Broadcasting and topology control in wireless ad hoc networks

Handbook of Algorithms for Wireless Networking and Mobile Computing

Volumn , Issue , 2005, Pages 11-239-11-264

  Li, Xiang Yang ^a   Stojmenovic, Ivan ^b  

^a Illinois Institute of Technology   (United States)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85008575534     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420035094     Document Type: Chapter

References (67)

1. Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, “The broadcast storm problem in a mobile ad hoc network,“Wireless Networks, vol. 8, pp. 153-167, 2002, Short version in MOBICOM 99.
2. B. Williams and T. Camp, “Comparison of broadcasting techniques for mobile ad hoc networks,” in Proceedings of the ACM International Symposium on Mobile ad hoc Networking and Computing (MOBIHOC), pp. 194-205, 2002.
3. J.Wu andW. Lou,“Forward-node-set-based broadcast in clustered mobile ad hoc networks,“Wireless Communications and Mobile Computing, vol. 3, pp. 155-173, 2003.
4. Khaled Alzoubi, Peng-Jun Wan, and Ophir Frieder, “Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks,” in Proceedings of the 3rd ACM International Symposium on Mobile ad hoc Networking and Computing (MOBIHOC’02), 2002.
5. Khaled Alzoubi, Xiang-Yang Li, Yu Wang, Peng-Jun Wan, and Ophir Frieder, “Geometric spanners for wireless ad hoc networks,” IEEE Transactions on Parallel and Distributed Processing, vol. 14, pp. 408-421, April 2003, Short version in IEEE ICDCS 2002.
6. Xiang-Yang Li, “Approximate MST for UDG locally,” in Proceedings of the COCOON 2003, Big Sky, MT, 2003.
7. Xiang-Yang Li, Localized construction of low weighted structure and its applications in wireless ad hoc networks, ACMWireless Network (WINET), 2004 (Accepted for Publication).
8. Ivan Stojmenovic, “Degree limited RNG,” in Proceedings of the Workshop on Wireless Networks, Cocoyoc, Mexico, 2003.
9. Xiang-Yang Li, YuWang, Peng-JunWan, Wan-Zhen Song, and Ophir Frieder, “Localized low-weight graph and its applications in wireless ad hoc networks,” in Proceedings of the IEEE INFOCOM, 2004.
10. Xiang-Yang Li, Yu Wang, and Wen-Zhan Song, “Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks,” IEEE Transaction on Parallel and Distributed Systems, vol. 15, pp. 1057-1069, December 2004.
11. A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, “On the complexity of computing minimum energy consumption broadcast subgraphs,” in Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010, pp. 121-131, 2001.
12. A. Clementi, P. Penna, and R. Silvestri, “On the power assignment problem in radio networks,” Electronic Colloquium on Computational Complexity, 2001, To approach. Preliminary results in APPROX’99 and STACS’2000.
13. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc,“Power consumption in packet radio networks,” Theoretical Computer Science, vol. 243, pp. 289-305, 2000.
14. J. Wieselthier, G. Nguyen, and A. Ephremides, “On the construction of energy-efficient broadcast and multicast trees in wireless networks,” in Proceedings of the IEEE INFOCOM 2000, pp. 586-594, 2000.
15. Weifa Liang, “Constructing minimum-energy broadcast trees in wireless ad hoc networks,” in Proceedings of the ACM International Symposium on Mobile ad hoc Networking and Computing (MOBIHOC), pp. 112-122, 2002.
16. Arindam K. Das, Robert J. Marks, Mohamed El-Sharkawi, Payman Arabshahi, and Andrew Gray, “Minimum power broadcast trees for wireless networks: an ant colony system approach,” in Proceedings of the IEEE International Symposium on Circuits and Systems, 2002.
17. Fulu Li and Ioanis Nikolaidis, “On minimum-energy broadcasting in all-wireless networks,” in Proceedings of the IEEE 26th Annual IEEE Conference on Local Computer Networks (LCN’01), 2001.
18. R.J. Marks, A.K. Das, M. El-Sharkawi, P. Arabshahi, and A. Gray,“Minimum power broadcast trees for wireless networks: optimizing using the viability lemma,” in Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 245-248, 2002.
19. Arindam K. Das, Robert J. Marks, Mohamed El-Sharkawi, Payman Arabshahi, and Andrew Gray, “Minimum power broadcast trees for wireless networks: integer programming formulations,” in Proceedings of the IEEE INFOCOM 2003, 2003.
20. Peng-Jun Wan, G. Calinescu, Xiang-Yang Li, and Ophir Frieder, “Minimum-energy broadcast routing in static ad hoc wireless networks,” ACM Wireless Networks, 2002 (Preliminary version appeared in IEEE INFOCOM 2000).
21. V. Chvátal, “A greedy heuristic for the set-covering problem,” Mathematics of Operations Research, vol. 4, pp. 233-235, 1979.
22. M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman and Co., New York, 1979.
23. Sudipto Guha and Samir Khuller, “Approximation algorithms for connected dominating sets,” in Proceedings of the European Symposium on Algorithms, pp. 179-193, 1996.
24. G. Robins and A. Zelikovsky, “Improved steiner tree approximation in graphs,” in Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, pp. 770-779, 2000.
25. Harry B. Hunt III, Madhav V.Marathe, Venkatesh Radhakrishnan, S.S. Ravi, Daniel J. Rosenkrantz, and Richard E. Stearns, “NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs,” Journal of Algorithms, vol. 26, pp. 238-274, 1999.
26. Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, S.S. Ravi, and Daniel J. Rosenkrantz, “Simple heuristics for unit disk graphs,“Networks, vol. 25, pp. 59-68, 1995.
27. Yu Wang and Xiang-Yang Li, “Geometric spanners for wireless ad hoc networks,” in Proceedings of the of 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), 2002.
28. P. Berman, M. Furer, and A. Zelikovsky, “Applications of matroid parity problem to approximating steiner trees,” Technical Report 980021, Computer Science, UCLA, 1998.
29. Khaled M. Alzoubi, “Virtual Backbone in Wireless ad hoc Networks,” Ph.D. thesis, Illinois Institute of Technology, 2002.
30. X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du, “Polynomial-time approximation scheme for minimum connected set in ad hoc wireless network,“Networks, vol. 42, pp. 202-208, 2003.
31. Khaled M. Alzoubi, Peng-Jun Wan, and Ophir Frieder, “New distributed algorithm for connected dominating set in wireless ad hoc networks,” in Proceedings of the HICSS, Hawaii, 2002.
32. Chunhung Richard Lin and Mario Gerla, “Adaptive clustering for mobile wireless networks,” IEEE Journal of Selected Areas in Communications, vol. 15, pp. 1265-1275, 1997.
33. I. Chlamtac and A. Farago,“A new approach to design and analysis of peer to peer mobile networks,” Wireless Networks, vol. 5, pp. 149-156, 1999.
34. Alan D. Amis, Ravi Prakash, Dung Huynh, and Thai Vuong, “Max-min d-cluster formation in wireless ad hoc networks,” in Proceedings of the of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, 2000, vol. 1, pp. 32-41, 2000.
35. Lujun Jia, Rajmohan Rajaraman, and Torsten Suel, “An efficient distributed algorithm for constructing small dominating sets,” in Proceedings of the ACM PODC, 2000.
36. B. Das and V. Bharghavan, “Routing in ad-hoc networks using minimum connected dominating sets,” in Proceedings of the 1997 IEEE International Conference on Communications (ICC’97), 1997, vol. 1, pp. 376-380, 1997.
37. R. Sivakumar, B. Das, andV. Bharghavan,“An improved spine-based infrastructure for routing in ad hoc networks,” in Proceedings of the IEEE Symposium on Computers and Communications, Athens, Greece, June 1998.
38. Jie Wu and Hailan Li, “A dominating-set-based routing scheme in ad hoc wireless networks,” The Special Issue onWireless Networks in the Telecommunication Systems Journal, vol. 3, pp. 63-84, 2001.
39. F. Dai and J. Wu, “Distributed dominant pruning in ad hoc networks,” in Proceedings of the IEEE ICC, 2003.
40. Ivan Stojmenovic, Mahtab Seddigh, and Jovisa Zunic, “Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, pp. 14-25, 2002.
41. F. Garcia, J. Solano, and I. Stojmenovic, “Connectivity based k-hop clustering in wireless networks,” in Telecommunication Systems, vol. 22, pp. 205-220, 2003.
42. S. Basagni, I. Chlamtac, and A. Farago, “A generalized clustering algorithm for peer-to-peer networks,” in Proceedings of theWorkshop on Algorithmic Aspects of Communication, 1997.
43. Peng-Jun Wan, Khaled M. Alzoubi, and Ophir Frieder, “Distributed construction of connected dominating set in wireless ad hoc networks,” in Proceedings of the INFOCOM, 2002.
44. Yu Wang and Xiang-Yang Li, “Distributed low-cost weighted backbone formation for wireless ad hoc networks,” (Submitted for Publication), 2004.
45. Mario Cagalj, Jean-Pierre Hubaux, and Christian Enz, “Minimum-energy broadcast in all-wireless networks: Np-completeness and distribution issues,” in Proceedings of theACMMOBICOM02, 2002.
46. Ning Li and Jennifer C. Hou, “Blmst: a scalable, power efficient broadcast algorithm for wireless sensor networks,” 2003, Submitted for publication, a version as UIUC Computer Science Department Technical Report.
47. J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized minimum-energy broadcasting in ad-hoc networks,” in Proceedings of the IEEE INFOCOM 2003, 2003.
48. Ning Li, Jennifer C. Hou, and Lui Sha, “Design and analysis of a mst-based topology control algorithm,” in Proceedings of the IEEE INFOCOM 2003, 2003.
49. Gruia Călinescu, “Computing 2-hop neighborhoods in ad hocwireless networks,” 2002, Manuscript.
50. Mahtab Seddigh, J. Solano Gonzalez, and I. Stojmenovic, “Rng and internal node based broadcasting algorithms for wireless one-to-one networks,” ACM Mobile Computing and Communications Review, vol. 5, pp. 37-44, 2002.
51. Xiang-Yang Li, Kousha Moaveninejad, and Yu Wang, “Low weighted structures and internal node based broadcasting schemes for wireless ad hoc networks,” Manuscript, 2003.
52. H. Lim and C. Kim,“Multicast tree construction and flooding in wireless ad hoc networks,” in Proceedings of the ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), 2000.
53. Gruia Čalinescu, Ion Măndoiu, Peng-Jun Wan, and Alexander Zelikovsky, “Selecting forwarding neighbors in wireless ad hoc networks,” in Proceedings of the ACM DialM, 2001.
54. W. Peng and X. Lu, “On the reduction of broadcast redundancy in mobile ad hoc networks,” in Proceedings of the MOBIHOC, 2000.
55. I. Stojmenovic, and M. Seddigh, “Broadcasting algorithms in wireless networks,” in Proceedings of the International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet SSGRR, L’Aquila, Italy, July 31-Aug. 6, 2000.
56. J.Wu, B.Wu, and I. Stojmenovic,“Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets,“Wireless Communications and Mobile Computing, vol. 3, 2003, pp. 425-438.
57. L. M. Feeney and M. Nilson, “Investigating the energy consumption of a wireless network interface in an ad hoc networking environment,” in Proceedings of the IEEE INFOCOM 2001, pp. 1548-1557, 2001.
58. J. Shaikh, J. Solano, I. Stojmenovic, and J.Wu, “New metrics for dominating set based energy efficient activity scheduling in ad hoc networks,” IEEE Conference on Local Computer Networks/WLN, Bonn, Germany, Oct. 20-24, 2003.
59. Y.Xu, J.Heidemann, andD. Estrin,“Geography-informed energy conservation for ad hoc networks,” in Proceedings of the MOBICOM, 2001.
60. D. M. Blough and P. Santi, “Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks,” in Proceedings of the MOBICOM, 2002.
61. Benjie Chen, Kyle Jamieson, Hari Balakrishnan, and Robert Morris, “Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks,” in Proceedings of the Mobile Computing and Networking, 2001, 85-96.
62. J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized energy efficient broadcast for wireless networks with directional antennas,” in Proceedings of the IFIP Mediterranean ad hoc Networking Workshop (MED-HOC-NET 2002), Sardegna, Italy, 2002.
63. J. Cartigny, F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic, “Localized LMST and RNG based minimum energy broadcast protocols in ad hoc networks,” (Submitted for Publication).
64. F. Ingelrest, D. Simplot-Ryl, and I. Stojmenovic, “Target transmission radius over LMST for energy-efficient broadcast protocol in ad hoc networks,” (Submitted for Publication).
65. J. Cartigny, and D. Simplot, “Border node retransmission based probabilistic broadcast protocols in ad hoc networks,” Telecommunication Systems, 22, 2003, pp. 189-204.
66. J. Lipman, P. Boustead, and J. Judge, “Efficient and scalable information dissemination in mobile ad hoc networks,” in Proceedings of the First International Conference on Ad-Hoc Networks andWireless ADHOC-NOW, 2002, pp. 119-134, 2002.
67. J. Carle, D. Simplot, and I. Stojmenovic, “Area coverage based beaconless broadcasting in adhoc networks,” (In Preparation).