This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
March 2006 (vol. 55 no. 3)
pp. 334-347
Jie Wu, IEEE
Wei Lou, IEEE
Fei Dai, IEEE
Multipoint relays (MPR) [18] provide a localized and optimized way of broadcasting messages in a mobile ad hoc network (MANET). Using partial 2-hop information, each node chooses a small set of forward neighbors to relay messages and this set covers the node's 2-hop neighbor set. These selected forward nodes form a connected dominating set (CDS) to ensure full coverage. Adjih et al. [1] later proposed a novel extension of MPR to construct a small CDS and it is source-independent. In this paper, we provide several extensions to generate a smaller CDS using complete 2-hop information to cover each node's 2-hop neighbor set. We extend the notion of coverage in the original MPR. We prove that the extended MPR has a constant local approximation ratio compared with a logarithmic local ratio in the original MPR. In addition, we show that the extended MPR has a constant global probabilistic approximation ratio, while no such ratio exists in the original MPR and its existing extensions. The effectiveness of our approach is confirmed through a simulation study.

[1] C. Adjih, P. Jacquet, and L. Viennot, “Computing Connected Dominated Sets with Multipoint Relays,” Ad Hoc & Sensor Networks vol. 1, pp. 27-39, May 2005.
[2] K. Alzoubi, X.Y. Li, Y. Wang, P.J. Wan, and O. Frieder, “Geometric Spanners for Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 5, pp. 408-421, May 2003.
[3] G. Calinescu, I. Mandoiu, P.J. Wan, and A. Zelikovsky, “Selecting Forwarding Neighbors in Wireless Ad Hoc Networks,” Proc. Fifth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 34-43, Oct. 2001.
[4] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” ACM Wireless Networks J., vol. 8, no. 5, pp. 481-494, Sept. 2002.
[5] V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem,” Math. Operation Research, vol. 4, no. 3, pp. 233-235, 1979.
[6] T. Clausen and P. Jacquet, “Optimized Link State Routing Protocol,” IETF drafts (draft-ietf-manet-olsr-11.txt), July 2003.
[7] F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004.
[8] B. Das, R. Sivakumar, and V. Bharghavan, “Routing in Ad-Hoc Networks Using a Spine,” Proc. Sixth Int'l Conf. Computer Comm. and Networks (ICCCN '97), pp. 1-20, Sept. 1997.
[9] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.
[10] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks,” Mobile Computing, T. Imielinski and K. Korth, eds., pp. 153-181, Boston: Kluwer Academic, 1996.
[11] H. Lim and C. Kim, “Flooding in Wireless Ad Hoc Networks,” Computer Comm. J., vol. 24, nos. 3-4, pp. 353-363, 2001.
[12] W. Lou and J. Wu, “On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks,” IEEE Trans. Mobile Computing, vol. 1, no. 2, pp. 111-123, Apr.-June 2002.
[13] M.V. Marathe, H. Breu, H.B. HuntIII, S.S. Ravi, and D.J. Rosenkrantz, “Simple Heuristics for Unit Disk Graphs,” Networks, vol. 25, pp. 59-68, 1995.
[14] M. Mosko and J.J. Garcia-Luna-Aceves, “A Self-Correcting Neighbor Protocol for Mobile Ad-Hoc Wireless Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks (IC3N '02), pp. 556-560, Oct. 2002.
[15] S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. ACM/IEEE MOBICOM '99, pp. 151-162, Aug. 1999.
[16] W. Peng and X.C. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. First Ann. Workshop Mobile and Ad Hoc Networking and Computing (MOBIHOC 2000), pp. 129-130, Aug. 2000.
[17] C. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA), pp. 90-100, Feb. 1999.
[18] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Message in Mobile Wireless Networks,” Proc. 35th Hawaii Int'l Conf. System Sciences (HICSS-35), pp. 3898-3907, Jan. 2002.
[19] M.Q. Rieck, S. Pai, and S. Dhar, “Distributed Routing Algorithms for Wireless Ad Hoc Networks Using d-Hop Connected Dominating Sets,” Proc. Int'l Conf. High-Performance Computing and Grid in Asia Pacific Region (HPC-ASIA), pp. 443-450, Dec. 2002.
[20] P. Sinha, R. Sivakumar, and V. Bharghavan, “Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures,” Proc. IEEE INFOCOM 2001, vol. 3, pp. 1763-1772, Apr. 2001.
[21] I. Stojmenovic, S. 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.
[22] J. Sucec and I. Marsic, “An Efficient Distributed Network-Wide Broadcast Algorithm for Mobile Ad Hoc Networks,” submitted for publication, 2002.
[23] P.J. Wan, K. Alzoubi, and O. Frieder, “Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM 2002, vol. 3, pp. 1597-1604, June 2002.
[24] J. Wu, “An Enhanced Approach to Determine a Small Forward Node Set Based on Multipoint Relay,” Proc. IEEE Semi-Ann. Vehicular Technology Conf. Fall (VTC 2003), Sept. 2003.
[25] J. Wu and F. Dai, “A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS 2003), pp. 460-468, May 2003.
[26] J. Wu and H. Li, “On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks,” Proc. ACM Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM '99), pp. 7-14, Aug. 1999.
[27] J. Wu and W. Lou, “Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks,” Wireless Networks and Mobile Computing, special issue on algorithmic, geometric, graph, combinatorial, and vector aspects, vol. 3, no. 2, pp. 155-173, 2003.

Index Terms:
Approximation ratio, broadcasting, connected dominating set (CDS), heuristic solutions, mobile ad hoc networks (MANETs), multipoint relays (MPR).
Citation:
Jie Wu, Wei Lou, Fei Dai, "Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs," IEEE Transactions on Computers, vol. 55, no. 3, pp. 334-347, March 2006, doi:10.1109/TC.2006.40
Usage of this product signifies your acceptance of the Terms of Use.