Hierarchical Multicast Routing Scheme for Mobile Ad Hoc Network

Ad hoc network is a dynamic multi-hop wireless network that is established by a group of mobile nodes on a shared wireless channel. The plain flooding algorithm provokes a high number of unnecessary packet rebroadcasts, causing contention, packet collisions and ultimately wasting precious limited bandwidth. Another barrier is that routing in ad hoc networks does not scale up as easily as in fixed network. Hierarchical techniques have long been known to afford scalability in networks. By introducing hierarchical routing scheme to ad hoc networks, we can effectively address this problem. Clustering provides a method to build and maintain hierarchical routing scheme in ad hoc networks. By summarizing topology detail via a hierarchical map of the network topology, network nodes are able to conserve memory and link resources. This paper proposes a fully distributed cluster based routing algorithm for mobile ad hoc networks. Non-overlapping clusters are formed using the dynamic cluster creation algorithm. Packets are routed according to the routing information available with each gateway node. The mobility issues are also handled locally in this routing architecture. The proposed cluster maintenance algorithm dynamically adapts to the changes and hence the efficiency is not degraded by node mobility. In addition, our analysis shows that building clustered hierarchies is affordable and that clustering algorithms can also be used to enhance network quality of service.

[1]  Raghupathy Sivakumar,et al.  ATP: a reliable transport protocol for ad hoc networks , 2003, IEEE Transactions on Mobile Computing.

[2]  Lazaros F. Merakos,et al.  An advanced location information management scheme for supporting flexible service provisioning in reconfigurable mobile networks , 2003, IEEE Commun. Mag..

[3]  Symeon Papavassiliou,et al.  An analytical model for measuring QoS in ad-hoc wireless networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Jie Wu,et al.  Efficient broadcasting with guaranteed coverage in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[5]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[6]  Antonio Alfredo Ferreira Loureiro,et al.  MANNA: a management architecture for wireless sensor networks , 2003, IEEE Commun. Mag..

[7]  Ravi Prakash,et al.  A distributed protocol for dynamic address assignment in mobile ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[8]  Miodrag Potkonjak,et al.  Model-based compression in wireless ad hoc networks , 2003, SenSys '03.

[9]  Chong Wang,et al.  Novel self-configurable positioning technique for multihop wireless networks , 2005, IEEE/ACM Transactions on Networking.

[10]  Peter Marbach,et al.  Cooperation in wireless ad hoc networks: a market-based approach , 2005, IEEE/ACM Transactions on Networking.

[11]  Hassan Taheri,et al.  A light-weight contention-based clustering algorithm for wireless ad hoc networks , 2004, The Fourth International Conference onComputer and Information Technology, 2004. CIT '04..

[12]  Chien-Chung Shen,et al.  Adaptive backbone-based multicast for ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[13]  Parameswaran Ramanathan,et al.  Proportional differentiated services: delay differentiation and packet scheduling , 2002, TNET.

[14]  Mauro Leoncini,et al.  The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks , 2006, IEEE Transactions on Mobile Computing.