This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions
March 2012 (vol. 11 no. 3)
pp. 402-413
M. Khabbazian, Dept. of Appl. Comput. Sci., Univ. of Winnipeg, Winnipeg, MB, Canada
I. F. Blake, Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
V. K. Bhargava, Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
There are two main approaches, static and dynamic, to broadcast algorithms in wireless ad hoc networks. In the static approach, local algorithms determine the status (forwarding/nonforwarding) of each node proactively based on local topology information and a globally known priority function. In this paper, we first show that local broadcast algorithms based on the static approach cannot achieve a good approximation factor to the optimum solution (an NP-hard problem). However, we show that a constant approximation factor is achievable if (relative) position information is available. In the dynamic approach, local algorithms determine the status of each node "on-the-fly” based on local topology information and broadcast state information. Using the dynamic approach, it was recently shown that local broadcast algorithms can achieve a constant approximation factor to the optimum solution when (approximate) position information is available. However, using position information can simplify the problem. Also, in some applications it may not be practical to have position information. Therefore, we wish to know whether local broadcast algorithms based on the dynamic approach can achieve a constant approximation factor without using position information. We answer this question in the positive-we design a local broadcast algorithm in which the status of each node is decided "on-the-fly” and prove that the algorithm can achieve both full delivery and a constant approximation to the optimum solution.

[1] M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., 1990.
[2] B. Clark, C. Colbourn, and D. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165-177, 1990.
[3] J. Wu and F. Dai, “Broadcasting in Ad Hoc Networks Based on Self-Pruning,” Proc. IEEE INFOCOM, pp. 2240-2250, 2003.
[4] 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.
[5] J. Wu and F. Dai, “A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks,” IEEE Trans. Computers, vol. 53, no. 10, pp. 1343-1354, Oct. 2004.
[6] S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM MobiCom, pp. 151-162, 1999.
[7] Z. Haas, J. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, pp. 1707-1716, 2002.
[8] D.Y. Sasson and A. Schiper, “Probabilistic Broadcast for Flooding in Wireless Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf., pp. 1124-1130, 2003.
[9] 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.
[10] 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.
[11] M. Khabbazian and V.K. Bhargava, “Efficient Broadcasting in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 8, no. 2, pp. 231-245, Feb. 2009.
[12] W. Peng and X. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, 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] M. Khabbazian and V.K. Bhargava, “Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy,” IEEE Trans. Computers, vol. 57, no. 8, pp. 1072-1086, Aug. 2008.
[15] Y. Xu, J. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Proc. ACM MobiCom, 2001.
[16] Y. Chen and J.L. Welch, “Location-Based Broadcasting for Dense Mobile Ad Hoc Networks,” Proc. ACM Int'l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp. 63-70, 2005.
[17] A. Keshavarz-Haddad, V. Ribeiro, and R. Riedi, “DRB and DCCB: Efficient and Robust Dynamic Broadcast for Ad Hoc and Sensor Networks,” Proc. IEEE Fourth Ann. Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '07), pp. 253-262, 2007.
[18] C.T. Zahn, “Black Box Maximization of Circular Coverage,” J. Research of the Nat'l Bureau of Standards B., vol. 66, pp. 181-216, 1962.
[19] L. Barriére, P. Fraigniaud, and L. Narayanan, “Robust Position-Based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges,” Proc. Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. pp. 19-27, 2001.
[20] Y. Cai, K. Hua, and A. Phillips, “Leveraging 1-Hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks,” Proc. IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '05), pp. 347-354, 2005.
[21] P. Wan, K. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, vol. 3, pp. 1597-1604, 2002.
[22] A. Vahdatpour, F. Dabiri, M. Moazeni, and M. Sarrafzadeh, “Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks,” Proc. 22nd Int'l Symp. Distributed Computing (DISC '08), pp. 481-495, 2008.
[23] J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DiaLM '99), pp. 7-14, 1999.
[24] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing (WCMC '02), vol. 2, pp. 483-502, 2002.

Index Terms:
telecommunication network topology,ad hoc networks,approximation theory,computational complexity,optimisation,radio broadcasting,NP-hard problem,local broadcast algorithm,wireless ad hoc network,local topology information,globally known priority function,approximation factor,Approximation algorithms,Heuristic algorithms,Approximation methods,Algorithm design and analysis,Decision support systems,Network topology,Broadcasting,Ad hoc networks,Mobile ad hoc networks,constant approximation.,Mobile ad hoc networks,distributed algorithms,broadcasting,connected dominating set
Citation:
M. Khabbazian, I. F. Blake, V. K. Bhargava, "Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions," IEEE Transactions on Mobile Computing, vol. 11, no. 3, pp. 402-413, March 2012, doi:10.1109/TMC.2011.67
Usage of this product signifies your acceptance of the Terms of Use.