Localized broadcasting with guaranteed delivery and bounded transmission redundancy

IEEE Transactions on Computers

Volumn 57, Issue 8, 2008, Pages 1072-1086

  Khabbazian, Majid ^a   Bhargava, Vijay K ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Approximation algorithms; Broadcasting; Localized algorithms; Minimum connected dominating set; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; RADIO BROADCASTING; TRANSMISSIONS;

APPROXIMATION RATIOS; BROADCAST ALGORITHMS; GUARANTEED DELIVERY; INFORMATION EXCHANGING; SELF-PRUNING; WORST CASE;

APPROXIMATION ALGORITHMS;

EID: 47049086236     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2008.51     Document Type: Article

References (18)

1. M. Garey and D. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman, 1990.
2. B. Clark, C. Colbourn, and D. Johnson, "Unit Disk Graphs," Discrete Math., vol. 86, pp. 165-177, 1990.
3. P. Wan, K. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks," Proc. IEEE INFOCOM '02, vol. 3, pp. 1597-1604, 2002.
4. S. Funke, A. Kesselman, U. Meyer, and M. Segal, "A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs," ACM Trans. Sensor Networks, vol. 2, no. 3, pp. 444-453, 2006.
5. H. Liu, P. Wan, X. Jia, X. Liu, and F. Yao, "Efficient Flooding Scheme Based on 1-hop Information in Mobile Ad Hoc Networks," Proc. IEEE INFOCOM, 2006.
6. Y. Tseng, S. Ni, and E. Shih, "Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Networks," Proc. 21st Int'l Conf. Distributed Computing Systems, pp. 481-488, 2001.
7. Y. Sasson, D. Cavin, and A. Schiper, "Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks," Proc. IEEE Wireless Comm. and Networking Conf., pp. 1124-1130, 2003.
8. P. Kyasanur, R. Choudhury, and I. Gupta, "Smart Gossip: An Adaptive Gossip-Based Broadcasting Service for Sensor Networks," Proc. Third IEEE Int'l Conf. Mobile Adhoc and Sensor Systems, pp. 91-100, 2006.
9. J. Wu, W. Lou, and F. Dai, "Extended Multipoint Relays to Determine Connected Dominating Sets in Manets," IEEE Trans. Computers, vol. 55, no. 3, pp. 334-347, Mar. 2006.
10. G. Calinescu, I. Mandoiu, P. Wan, and A. Zelikovsky, "Selecting Forwarding Neighbors in Wireless Ad Hoc Networks," ACM Mobile Networks and Applications, vol. 9, no. 2, pp. 101-111, 2004.
11. J. Wu and F. Dai, "Broadcasting in Ad Hoc Networks Based on Self-Pruning," Proc. IEEE INFOCOM '03, pp. 2240-2250, 2003.
12. W. Peng and X. Lu, "On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks," Proc. ACM MobiHoc '00, pp. 129-130, 2000.
13. I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
14. J. Wu and W. Lou, "Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks," Wireless Comm. and Mobile Computing, vol. 3, no. 2, pp. 155-173, 2003.
15. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, second ed. Springer-Verlag, 2000.
16. Y. Cai, K. Hua, and A. Phillips, "Leveraging 1-Hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks," Proc. 24th IEEE Int'l Performance, Computing, and Comm. Conf., pp. 347-354, 2005.
17. J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks," Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 7-14, 1999.
18. M. Khabbazian and V.K. Bhargava, "Highly Efficient Flooding in Mobile Ad Hoc Networks," Technical Report TR-2006-28, Dept. of Computer Science, Univ. of British Columbia, http://www.cs.ubc.ca/cgi-bin/tr/2006/TR-2006-28, 2006.