Site-wide links

Center For Applied and Computational Mathematics

A Multi Meshed Tree Algorithm for Mobile Ad Hoc Networks

Faculty: John Hamilton
 Carl Lutzer
 David Ross


Mobile ad hoc networks (MANETs) are comprised of wireless and mobile devices that self organize and self heal to facilitate communication among one another without depending on an underlying infrastructure. Historically, MANETs have been considered for communications in tactical networks in a battlefield, where dependency on a communications infrastructure is not an option. However, the ability of MANETs to operate in an infrastructure-less environment makes them also attractive for civilian applications; such as communications among mobile units in a city area, a network of moving vehicles which could form a backbone network, a network of firefighters or rescue operators, an industry control network with a combination of mobile and stationary devices that are monitoring several processes, and so on. In situations where infrastructure is an option hesitancy to adopt MANETs can be attributed to the persisting challenges of "robust connectivity", "reliable data delivery" and "security"; each of these or all can be crucial to some applications. This project focuses on the first two challenges namely robust connectivity and increased reliability in data delivery when required, while contributing towards scalability and adapting to highly dynamic network conditions due to node mobility and the wireless environment. These requirements along with simple mechanisms to self organize, self heal, being energy and device-size sensitive schemes and configurable to specific application requirements are desirable in most MANET applications. In this work, an algorithm called the "multi meshed tree (MMT)" forms the basis for the routing framework that is capable of providing several of the desired features stated above. MMT is a single algorithm operating at layer 2 and collaborating with the medium access functions to facilitate the formation of multiple clusters of definable size and definable max hops from an elected cluster head and while simultaneously setting up proactive routes within the clusters without flooding, or routing tables and states maintenance. For inter cluster routing, MMT adapts the popular "route discovery" process used in most current reactive routing protocols but based on the meshed tree principles which avoids flooding discovery messages and reduces the route dependency between distant communicating nodes.


  1. Route robustness of a multi-meshed tree routing scheme for Internet MANETs, N. Shenoy, Y. Pan, C. Lutzer, D. S. Ross, and D. Narayan, Proceedings, IEEE Global Communications Conference, (2005).
Collaborators: Niramala Shenoy (RIT)
 Yamin Al-Mousa (RIT)