Author:
Levin Liron,Segal Michael,Shpungin Hanan
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference35 articles.
1. C. Ambuhl, An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks, in: ICALP’05, vol. 3580, 2005, pp. 1139–1150.
2. Performance guarantees for approximation algorithms depending on parametrized triangle inequalities;Andreae;SIAM J. Discret. Math.,1995
3. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, in: Annual ACM Symposium on Theory of Computing, New York, USA, July, 1987, pp. 230–240.
4. R. Beier, P. Sanders, N. Sivadasan, Energy optimal routing in radio networks using geometric data structures, in: ICALP’02, 2002, pp. 366–376.
5. Energy and lifetime efficient connectivity in wireless ad-hoc networks;Berend;Ad Hoc Sens. Wireless Netw.,2010
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献