Improving route discovery in on-demand routing protocols using two-hop connected dominating sets

Many signaling or data forwarding operations involve the broadcasting of packets, which incurs considerable collisions in ad hoc networks based on a contention-based channel access protocol. We propose the Threehop Horizon Pruning (THP) algorithm to compute two-hop connected dominating set (TCDS) using only local topology information (i.e., two-hop neighborhood). Because every node has the two-hop neighborhood information, it is possible to maintain fresh routes to all nodes within two hops. In this situation, a TCDS is ideal for the propagation of route request (RREQ) messages in the route discovery process of on-demand routing protocols. THP is shown to be more ecient than all prior distributed broadcasting mechanisms,

[1]  J. J. Garcia-Luna-Aceves,et al.  Enhanced dominant pruning applied to the route discovery process of on-demand routing protocols , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[2]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[3]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[4]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Jie Wu,et al.  A generic distributed broadcast scheme in ad hoc wireless networks , 2004, IEEE Transactions on Computers.

[6]  Ivan Marsic,et al.  An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks , 2000 .

[7]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

[8]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[9]  J. J. Garcia-Luna-Aceves,et al.  Enhancing the Route Discovery Process of On-Demand Routing in Networks with Directional Antennas , 2004, NETWORKING.

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[11]  Gene Tsudik,et al.  Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks , 1999, DIALM '99.

[12]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[13]  Gaetano Borriello,et al.  A Survey and Taxonomy of Location Systems for Ubiquitous Computing , 2001 .

[14]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[15]  Jie Wu,et al.  Mobility-sensitive topology control in mobile ad hoc networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[16]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[17]  Jie Wu,et al.  On reducing broadcast redundancy in ad hoc wireless networks , 2002, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[18]  J. J. Garcia-Luna-Aceves,et al.  A scalable model for channel access protocols in multihop ad hoc networks , 2004, MobiCom '04.

[19]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[20]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[21]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[22]  Jie Wu,et al.  Distributed dominant pruning in ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[23]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[24]  Chong-Kwon Kim,et al.  Flooding in wireless ad hoc networks , 2001, Comput. Commun..

[25]  StojmenovicIvan,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002 .

[26]  Jie Wu,et al.  Mobility management and its applications in efficient broadcasting in mobile ad hoc networks , 2004, IEEE INFOCOM 2004.

[27]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..