Homogeneous 2-hop broadcast in 2D

Computational Geometry: Theory and Applications

Volumn 43, Issue 2 SPEC. ISS., 2010, Pages 182-190

  Das, Gautam K ^a   Das, Sandip ^b   Nandy, Subhas C ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Algorithm; Broadcast; Mobile communication; Range assignment

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BROADCASTING; COMBINATORIAL OPTIMIZATION; RADIO STATIONS;

2-FACTORS; MINIMUM COST; MOBILE COMMUNICATIONS; RANGE ASSIGNMENT; REAL NUMBER; TOTAL POWER CONSUMPTION;

RADIO BROADCASTING;

EID: 84867982382     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2009.06.005     Document Type: Conference Paper

References (16)

1. C. Ambuhl An optimal bound for the MST algorithm to compute energy efficient broadcast tree in wireless networks Proc. 32nd Int. Colloquium on Automata, Languages and Programming Lecture Notes in Comput. Sci. vol. 3580 2005 1139 1150
2. C. Ambuhl, A.E.F. Clementi, M. Di Ianni, N. Lev-Tov, A. Monti, D. Peleg, G. Rossi, and R. Silvestri Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks Proc. 21st Annual Symposium on Theoretical Aspects of Computer Science Lecture Notes in Comput. Sci. vol. 2996 2004 418 427
3. M. de Berg, M. Van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry Algorithms and Applications 1997 Springer-Verlag
4. B. Chazelle, and L.J. Guibas Fractional cascading: I. A data structuring technique Algorithmica 1 1986 133 162
5. M. Cagalj, J.-P. Hubaux, C. Enz, Minimum energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: Proc. 8th Annual International Conference on Mobile Computing and Networking, 2002, pp. 172-182
6. A.E.F. Clementi, G. Huiban, P. Penna, G. Rossi, Y.C. Verhoeven, Some recent theoretical advances and open questions on energy consumption in ad hoc wireless networks, in: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, 2002, pp. 23-38
7. A.E.F. Clementi, M. Di Ianni, and R. Silvestri The minimum broadcast range assignment problem on linear multihop wireless networks Theoret. Comput. Sci. 299 2003 751 761
8. P. Carmi, M.J. Katz, and N. Lev-Tov Covering points by unit disks of fixed location Proc. 18th International Symposium on Algorithms and Computation Lecture Notes in Comput. Sci. vol. 4835 2007 644 655
9. G. Calinescu, I.I. Mandoiu, P.-J. Wan, and A.Z. Zelikovsky Selecting forwarding neighbors in wireless ad-hoc networks Mobile Netw. Appl. 9 2004 101 111
10. D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progressions J. Symbolic Comput. 9 1990 251 280
11. G.K. Das, S. Das, and S.C. Nandy Efficient algorithm for energy efficient broadcasting in linear radio networks Theoret. Comput. Sci. 352 2006 332 341
12. Z.J. Haas, S. Tabrizi, On some challenges and design choices in ad-hoc communications, in: Proc. IEEE Military Communication Conference, vol. 1, 1998, pp. 187-192
13. K. Pahlavan, and A. Levesque Wireless Information Networks 1995 John Wiley New York
14. J. Park, and S. Sahni Maximum lifetime broadcasting in wireless networks IEEE Trans. Comput. 54 2005 1081 1090
15. P. Santi Topology Control in Wireless Ad Hoc and Sensor Networks 2005 John Wiley & Sons
16. L. Zosin, S. Khuller, On directed Steiner trees, in: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 59-63