The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2008 vol.57)
pp: 1072-1086
Majid Khabbazian , University of British Columbia, Vancouver
Vijay K. Bhargava , University of British Columbia, Vancouver
ABSTRACT
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the first localized broadcast algorithm that guarantees full delivery and a constant approximation ratio to the minimum number of required transmissions in the worst case. The proposed broadcast algorithm is a self-pruning algorithm based on one round of information exchange. Using the proposed algorithm, each node determines its forwarding status in O(D logD), where D is the maximum node degree of the network. By extending the proposed algorithm, we show that localized broadcast algorithms can achieve both full delivery and a constant approximation ratio to the optimum solution with message complexity O(N), where N is the total number of nodes in the network and each message contains a constant number of bits. We also show how to save bandwidth by reducing the size of piggybacked information. Finally, we relax several system-model assumptions, or replace them with practical ones, in order to improve the practicality of the proposed broadcast algorithm.
INDEX TERMS
Distributed networks, Wireless communication
CITATION
Majid Khabbazian, Vijay K. Bhargava, "Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy", IEEE Transactions on Computers, vol.57, no. 8, pp. 1072-1086, August 2008, doi:10.1109/TC.2008.51
REFERENCES
[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/2006TR-2006-28 , 2006.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool