New hierarchical approach to reactive routing protocols for wireless ad hoc networks with cross-layer design

A hierarchical routing protocol is designed for reactive ad hoc networks. In the hierarchical architectures network nodes are classified as Mobile Nodes (MNs) and Forwarding Nodes (FNs). FNs are selected from MNs during the route discovery phase of the reactive routing. This FN selection algorithm is distributed, dynamic and requires no additional protocol messaging other than used during the route discovery. The FN selection algorithm is further improved by using network congestion information from Medium Access (MAC) layer. The protocol is implemented using Dynamic Source Routing (DSR) protocol, and the new protocol is called HDSR. Simulation results show that HDSR significantly improves the routing efficiency in wireless ad hoc networks.

[1]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[2]  Duc A. Tran,et al.  Routing with congestion awareness and adaptivity in mobile ad hoc networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[3]  V. Bharghavan,et al.  MACAW: A media access protocol for wireless LANs , 1994 .

[4]  Mario Gerla,et al.  Efficient flooding with Passive Clustering (PC) in ad hoc networks , 2002, CCRV.

[5]  Andrea J. Goldsmith,et al.  Design challenges for energy-constrained ad hoc wireless networks , 2002, IEEE Wirel. Commun..

[6]  Yih-Chun Hu,et al.  Exploiting congestion information in network and higher layer protocols in multihop wireless ad hoc networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[7]  Elizabeth M. Belding-Royer,et al.  Hierarchical routing in ad hoc mobile networks , 2002, Wirel. Commun. Mob. Comput..

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

[9]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[10]  Andrea J. Goldsmith,et al.  Performance, optimization, and cross-layer design of media access protocols for wireless ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[11]  Ramón Agustí,et al.  Automatic rate adaptation and energy-saving mechanisms based on cross-layer information for packet-switched data networks , 2004, IEEE Communications Magazine.

[12]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[14]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[15]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

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

[17]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[18]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[19]  Mung Chiang,et al.  To layer or not to layer: balancing transport and physical layers in wireless multihop networks , 2004, IEEE INFOCOM 2004.