MOTION VECTOR ROUTING PROTOCOL: A POSITION BASED ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS

Persistent Link:
http://hdl.handle.net/10150/195303
Title:
MOTION VECTOR ROUTING PROTOCOL: A POSITION BASED ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
Author:
Zhao, Yun
Issue Date:
2005
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
A Mobile Ad Hoc Network (MANET) consists of mobile nodes, equipped with wireless communications devices, which form a communications network without fixed network infrastructure or topology. The MANET is typically characterized by: limited bandwidth; limited radio range; high mobility; and susceptibility to impairments that degrade the signal to noise ratio and bit error rates. These characteristics pose challenges to the MANET routing protocols. In addition to these characteristics, we have found that the mobility pattern of the nodes also has significant impact on the MANET routing protocols. In order to achieve improved efficiency for these networks, we propose the Motion Vector Routing (MoVeR) protocol. MoVeR is a position based routing protocol for MANET communications that uses the motion information of mobile nodes to determine how to route the packets. MoVeR predicts the future positions of mobile nodes, based on motion vectors containing current and previous position, and velocity information. The protocol is designed for applications in which we expect that nodes will have access to a position service. We also assume the availability of a location service by which the sender can obtain an initial estimate of the location of the destination. Nodes using the MoVeR protocol distribute the routing information to neighbors in one-hop transmission range. Given the position information, MoVeR can potentially employ one of several forwarding strategies. The implementation used for this research employs a greedy algorithm forwarding the packet to the neighbor such that the neighbor is closer to the destination in the near future. Since the forwarding strategy could be subject to local minima problems, the algorithm also includes a recovery mode which is activated when this problem has occurred. In the recovery mode, the protocol traverses the planarized graph to the destination. MoVeR is a localized routing protocol and therefore exhibits reduced control overhead compared to protocols which maintain a global topology. The mobility prediction capability of MoVeR improves routing performance in several types of sophisticated mobility scenarios. We describe the MoVeR protocol algorithm, implementation, and simulation results show that MoVeR gives improved performance compared to Greedy Perimeter Stateless Routing and Dynamic Source Routing.
Type:
text; Electronic Dissertation
Keywords:
Electrical & Computer Engineering
Degree Name:
PhD
Degree Level:
doctoral
Degree Program:
Electrical & Computer Engineering; Graduate College
Degree Grantor:
University of Arizona
Advisor:
McNeill, Kevin M.
Committee Chair:
McNeill, Kevin M.

Full metadata record

DC FieldValue Language
dc.language.isoENen_US
dc.titleMOTION VECTOR ROUTING PROTOCOL: A POSITION BASED ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKSen_US
dc.creatorZhao, Yunen_US
dc.contributor.authorZhao, Yunen_US
dc.date.issued2005en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractA Mobile Ad Hoc Network (MANET) consists of mobile nodes, equipped with wireless communications devices, which form a communications network without fixed network infrastructure or topology. The MANET is typically characterized by: limited bandwidth; limited radio range; high mobility; and susceptibility to impairments that degrade the signal to noise ratio and bit error rates. These characteristics pose challenges to the MANET routing protocols. In addition to these characteristics, we have found that the mobility pattern of the nodes also has significant impact on the MANET routing protocols. In order to achieve improved efficiency for these networks, we propose the Motion Vector Routing (MoVeR) protocol. MoVeR is a position based routing protocol for MANET communications that uses the motion information of mobile nodes to determine how to route the packets. MoVeR predicts the future positions of mobile nodes, based on motion vectors containing current and previous position, and velocity information. The protocol is designed for applications in which we expect that nodes will have access to a position service. We also assume the availability of a location service by which the sender can obtain an initial estimate of the location of the destination. Nodes using the MoVeR protocol distribute the routing information to neighbors in one-hop transmission range. Given the position information, MoVeR can potentially employ one of several forwarding strategies. The implementation used for this research employs a greedy algorithm forwarding the packet to the neighbor such that the neighbor is closer to the destination in the near future. Since the forwarding strategy could be subject to local minima problems, the algorithm also includes a recovery mode which is activated when this problem has occurred. In the recovery mode, the protocol traverses the planarized graph to the destination. MoVeR is a localized routing protocol and therefore exhibits reduced control overhead compared to protocols which maintain a global topology. The mobility prediction capability of MoVeR improves routing performance in several types of sophisticated mobility scenarios. We describe the MoVeR protocol algorithm, implementation, and simulation results show that MoVeR gives improved performance compared to Greedy Perimeter Stateless Routing and Dynamic Source Routing.en_US
dc.typetexten_US
dc.typeElectronic Dissertationen_US
dc.subjectElectrical & Computer Engineeringen_US
thesis.degree.namePhDen_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineElectrical & Computer Engineeringen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorMcNeill, Kevin M.en_US
dc.contributor.chairMcNeill, Kevin M.en_US
dc.contributor.committeememberZeigler, Bernard P.en_US
dc.contributor.committeememberTalarico, Claudioen_US
dc.identifier.proquest1106en_US
dc.identifier.oclc137353999en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.