Efficient broadcasting and gathering in wireless ad-hoc networks

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn 2005, Issue , 2005, Pages 346-351

  Onus, Melih ^a   Richa, Andréa ^a   Kothapalli, Kishore ^b   Scheideler, Christian ^b  

^a Arizona State University   (United States)

^b Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROADCASTING; INFORMATION RETRIEVAL; PACKET NETWORKS; USER INTERFACES; WIRELESS TELECOMMUNICATION SYSTEMS;

INFORMATION GATHERING; WIRELESS AD-HOC NETWORKS; WORK-EFFICIENCY;

TELECOMMUNICATION NETWORKS;

EID: 33846995950     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2005.43     Document Type: Conference Paper

References (19)

1. M. Adler and C. Scheideler. Efficient communication strategies for ad hoc wireless networks. Theory of Computing Systems, 33:337-391, 2000.
2. R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. of Comp. and System Sci., 45:104-126, 1992.
3. I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE trans. on commun., COM-39, 3:426-433, 1991.
4. A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. In IEEE FOCS, 2003.
5. E. J. Duarte-Melo and M. Liu. Data-gathering wireless sensor networks: organization and capacity. Computer Networks, 43(4):519-537, 2003.
6. M. Enachescu, A. Goel, R. Govindan, and R. Motwani. Scale free aggregation in sensor networks. In First Intl. W. on Algorithmic Aspects of Wireless Sensor Networks, 2004.
7. P. Gupta and P.R. Kumar. The capacity of wireless networks. IEEE Trans. Information Theory, IT-46(2):388-404, 2000.
8. P. Gupta and P.R. Kumar. Internets in the sky: The capacity of three dimensional wireless networks. Communications in Information and Systems, 1(1):33-50, 2001.
9. Q. Han, S. Mehrotra, and N. Venkatasubramanian. Energy efficient data collection in distributed sensor environments. In ICDCS, pages 590-597, 2004.
10. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: a scalable and robust communication paradigm for sensor networks. In Mobile Computing and Networking, pages 56-67, 2000.
11. T. Jurdzinski and G. Stachowiak. Probabilistic algorithms for the wakeup problem in single-hop radio networks. In Proc. of ISSAC, pages 535-549, 2002.
12. K. Kothapalli and C. Scheideler. Information gathering in adversarial systems: Lines and cycles. In ACM SPAA, 2003.
13. D. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. In ACM PODC, pages 73-82, 2003.
14. E. Kushilevitz and Y. Mansour. An Ω(D log(N/D)) lower bound for broadcast in radio networks. SICOMP: SIAM Journal on Computing, 27, 1998.
15. H. Luo and G. Pottie. Routing explicit side information for data compression in wireless sensor networks. In DCOSS, 2005.
16. M. Onus, A. Richa, K. Kothapalli, and C. Scheideler. Efficient broadcasting and gathering in wireless ad-hoc networks. Available at http://www.cs.jhu.edu/~kishore.
17. M. Onus, A. Richa, K. Kothapalli, and C. Scheideler. Constant density spanners for wireless ad-hoc networks. In ACM SPAA, 2005.
18. Brad Williams and Tracy Camp. Comparison of broadcasting techniques for mobile ad hoc networks. In ACM MOBIHOC, pages 194-205. ACM Press, 2002.
19. Y. Yu, B. Krishnamachari, and V. Prasanna. Energy-latency tradeoffs for data gathering in wireless sensor networks. In IEEE Infocom, 2004.