Scalable energy-efficient routing in mobile Ad hoc network

The quick deployment without any existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for dynamic situations such as military and rescue operations, disaster recovery, and so on and so forth. However, routing remains one of the major issues in MANET due to the highly dynamic and distributed environment. Energy consumption is also a significant issue in ad hoc networks since the nodes are battery powered. This report discusses some major dominating set based approaches to perform energy efficient routing in mobile ad hoc networks. It also presents the performance results for each of these mentioned approaches in terms of throughput, average end to end delay and the life time in terms of the first node failure. Based on the simulation results, I identified the key issues in these protocols regarding network life time. In this report, I propose and discuss a new approach “Dynamic Dominating Set Generation Algorithm” (DDSG) to optimize the network life time. This algorithm dynamically selects dominating nodes during the process of routing and thus creates a smaller dominating set. DDSG algorithm thereby eliminates the energy consumption from the non-used dominating nodes. In order to further increase the network life time, the algorithm takes into consideration the threshold settings which helps to distribute the process of routing within the network. This helps to eliminate a single dominating node from getting drained out by continuous transmission and reception of packets. In this report, the detailed algorithmic design and performance results through simulation is discussed

Multicast Routing in Mobile Adhoc Networks using Source Grouped Flooding

Ad hoc networks are peer to peer, autonomous networks comprised of wireless mobile devices. The ease and speed of deployment of these networks makes them ideal for battlefield communications, disaster recovery and other such applications where fixed infrastructure is not readily available. Limited bandwidth, energy constraints and unpredictable network topologies pose difficult problems for the design of applications for these networks. The last couple of years has seen renewed research in this field. Specifically in unicast and multicast routing and security issues.In this thesis, we address the multicast routing problem for ad hoc networks. We present a novel multicast routing protocol called the source grouped flooding protocol. The protocol creates multicast routes between the source and group members based on hop count distance constraints. We also propose a probabilistic data forwarding mechanism to achieve efficient data dissemination. We present simulation results that capture the performance of our protocol against parameters that characterize an ad hoc network. We find that the protocol is robust against topology changes and achieves efficient data distribution