Title page for ETD etd-09092003-161434

Type of Document Master's Thesis
Author Samal, Savyasachi
Author's Email Address ssamal@vt.edu
URN etd-09092003-161434
Title Mobility Pattern Aware Routing in Mobile Ad Hoc Networks
Degree Master of Science
Department Computer Science
Advisory Committee
Advisor Name Title
Mishra, Amitabh Committee Chair
Varadarajan, Srinidhi Committee Co-Chair
DaSilva, Luiz A. Committee Member
  • DSDV
  • Random Motion
  • Routing Algorithms
  • Mobility Pattern
  • Ad Hoc Networks
Date of Defense 2003-05-19
Availability unrestricted
A mobile ad hoc network is a collection of wireless nodes, all of which may be mobile, that dynamically create a wireless network amongst them without using any infrastructure. Ad hoc wireless networks come into being solely by peer-to-peer interactions among their constituent mobile nodes, and it is only such interactions that are used to provide the necessary control and administrative functions supporting such networks. Mobile hosts are no longer just end systems; each node must be able to function as a router as well to relay packets generated by other nodes. As the nodes move in and out of range with respect to other nodes, including those that are operating as routers, the resulting topology changes must somehow be communicated to all other nodes as appropriate. In accommodating the communication needs of the user applications, the limited bandwidth of wireless channels and their generally hostile transmission characteristics impose additional constraints on how much administrative and control information may be exchanged, and how often. Ensuring effective routing is one of the greatest challenges for ad hoc networking.

As a practice, ad hoc routing protocols make routing decisions based on individual node mobility even for applications such as disaster recovery, battlefield combat, conference room interactions, and collaborative computing etc. that are shown to follow a pattern.

In this thesis we propose an algorithm that performs routing based on underlying mobility patterns. A mobility pattern aware routing algorithm is shown to have several distinct advantages such as: a more precise view of the entire network topology as the nodes move; a more precise view of the location of the individual nodes; ability to predict with reasonably accuracy the future locations of nodes; ability to switch over to an alternate route before a link is disrupted due to node movements.

  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  Final-thesis.pdf 439.81 Kb 00:02:02 00:01:02 00:00:54 00:00:27 00:00:02

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.