Efficient Routing in Mobile Ad Hoc Networks

Author(s): Wang, Yali | Advisor(s): Garcia-Luna-Aceves, J.J. | Abstract: A wireless network is any type of computer network that uses wireless communication links for connecting network nodes. There are two major types of wireless networks: one is infrastructure-based which is centralized and managed by at least one wireless access point (AP) to maintain the connections between all other nodes. The other type is self-configuring infrastructureless which is independent of AP andnode communicate each other directly without requiring centralized management, for instance, Ad hoc Network. A Mobile Ad-hoc Nework(MANET) is consisted of mobile nodes which can change geographic positions randomly in any directions. MANETusually has a routable networking environment on top of a Link Layer ad hoc network.In mobile ad hoc networks, each node randomly moves with various velocity and has no knowledge of other node's location. Before data is transmitted between nodes, each node is required to establish a path from source to destination which is so-called Routing. It may have multiple paths between source and destination. The path can be one-hop or multiple-hop. One-hop is referred to adjacent neighbors within a fixed radio distance. Imagine an undirected graph G={V,E} , there are multiple paths between pairs of vertices and each vertex obtains a path to other vertex so that it effectively arrives to destination vertex. In this dissertation, we study multiple distributed routing strategies for MANET. The major contributions are to mitigate routing overhead with the guaranty of covering all nodes in MANET and no knowledge of the geographical locations of destinations are required. All protocols are adaptive to the scenarios of independent of network mobility,cardinality of network and number of neighbors. It is noteworthy to mention that in experiemental study, for the purpose of the best observation, the set of scenarios is relatively selective to maintain the well established connected networks. The proportion of the size of terrains and the density of networks must be reasonable, which is not too dense or too sparse so that the performance is able to show more explicitly. First, we propose a novel directional routing scheme Dircast: Floodingreduced routing in MANET without destination coordinates [34] for which address the flooding problems that played many routing protocols designed in MANET. Dircast assumes that each node knows its own geographical coordinates and nominates the limitednumber of relay nodes at each hop to proceed routing discovery. The selected relay nodes have the shortest distance to all boundary vertices so that the span of routing can be extended to a maximal degree. Message complexity of Dircast is O(C) ≍ O(1), regardless of density of network and the number of neighbors of nodes.Second, we introduce a new methodology ORCA: On-demand Routing with Coordinates Awareness [36], using geographical coordinates to attain efficient route signaling in MANET . The selection of relaying nodes at each node in ORCA is done by computing the shortest Euclidean Distance from all neighbors of the node to fourpolar points located in the transmission range of the node. ORCA is capable to cover all nodes in a connected MANET and the maximal number of relay nodes at each hop is six. Message complexity of ORCA is O(C) ≍ O(1), regardless of density of network and the number of neighbors of nodes.Third, we develop an innovative protocol ORTHCA: On-demand Routingwith Two Hop Coordinates Awareness for minimizing dissemination of routing overhead with two-hop coordinate awareness in MANET [35]. The selection of relaying nodes is implemented as follows: firstly computes the best two hop relay nodes R2(u), whoseEuclidean Distance to four polar points are the shortest among all two hop neighbors N2(u); then determines one hop relay nodes R1(u) connecting with R2(u). This process is iterated only by each member of R2(u). Message complexity of ORTHCA is O(C) ≍O(1), regardless of density of network and the number of neighbors of nodes. Fourth, we present CBORCA: A Cluster Based ORCA Routing Protocol inMANET, by eliminating the redundant relay nodes and creating overlapping clusters to guarantee full coverage in MANET. This algorithm exploits the advantages of cluster's properties and achieves the enhanced performance better than ORCA. It divides the network into multiple overlapping clusters and select cluster head set H(u) by extracting a limited number of relay nodes from a given relay node set R(u) of the node. The selected cluster heads are the only relay nodes to forward routing requests. Both theoretical analysis and experimental simulation have proved message complexity is a constant number O(C) ≍ O(1), regardless of density of network and the number ofneighbors of nodes.

[1]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[2]  Ram Ramanathan,et al.  Hierarchically‐organized, multihop mobile wireless networks for quality‐of‐service support , 1998, Mob. Networks Appl..

[3]  Yali Wang,et al.  Dircast: Flooding-reduced routing in MANETs without destination coordinates , 2009, MILCOM 2009 - 2009 IEEE Military Communications Conference.

[4]  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.

[5]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[6]  Sergio D. Servetto,et al.  Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks , 2002, WSNA '02.

[7]  Ivan Stojmenovic,et al.  Depth first search and location based localized routing and QoS routing in wireless networks , 2000, Proceedings 2000 International Conference on Parallel Processing.

[8]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

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

[10]  SenthilVelmurugan Mangai,et al.  A new approach to geographic routing for location aided cluster based MANETs , 2011, EURASIP J. Wirel. Commun. Netw..

[11]  Gwillerm Froc,et al.  Random walk based routing protocol for wireless sensor networks , 2007, Valuetools 2007.

[12]  Yu-Chee Tseng,et al.  GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks , 2001, Telecommun. Syst..

[13]  J. J. Garcia-Luna-Aceves,et al.  OWL: Towards scalable routing in MANETs using depth-first search on demand , 2009, 2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems.

[14]  Hsu-Chun Yen,et al.  Core location-aided cluster-based routing protocol for mobile ad hoc networks , 2006 .

[15]  Dhiraj K. Pradhan,et al.  A cluster-based approach for routing in dynamic networks , 1997, CCRV.

[16]  Charles E. Perkins,et al.  Distribution of route requests using dominating-set neighbor elimination in an on-demand routing protocol , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[17]  Nitin H. Vaidya,et al.  GeoTORA: a protocol for geocasting in mobile ad hoc networks , 2000, Proceedings 2000 International Conference on Network Protocols.

[18]  Nitin H. Vaidya,et al.  Geocasting in mobile ad hoc networks: location-based multicast algorithms , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[19]  Mario Gerla,et al.  Fisheye state routing: a routing scheme for ad hoc wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[20]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[21]  Alhussein A. Abouzeid,et al.  Weak State Routing for Large-Scale Dynamic Networks , 2007, IEEE/ACM Transactions on Networking.

[22]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[23]  J. J. Garcia-Luna-Aceves,et al.  Ordering in time: A new routing approach for wireless networks , 2010, The 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS 2010).

[24]  Larry Hughes,et al.  Cartesian routing , 2000, Comput. Networks.

[25]  Yali Wang,et al.  Using geographical coordinates to attain efficient route signaling in ad hoc networks , 2013, 2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

[26]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[27]  Tomasz Imielinski,et al.  GeoCast—geographic addressing and routing , 1997, MobiCom '97.