We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP’s design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP’s behavior, defining an “update area ” in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP’s packet drop rate is up to 90 % lower while sending up to 90 % fewer packets.

In this paper, two efficient hybrid routeless routing protocols (static and adaptive channel width) for Mobile Ad hoc Sensor Networks (MASNETs) have been proposed. They are based on Location-Aided Routing (LAR) and Received signal strength-Aided Flooding (RAF) protocols. Our protocols maintain geographical Route Broadcasting Virtual Channels (RBVC) with different widths between a source node and its destination to reduce the rebroadcasts of packets. Hence without predefined source-destination route, i.e., routeless, only some nodes, inside the RBVC, may contribute in rebroadcasting packets. Simulation results show that our protocols are able to outperform both RAF and LAR based protocols with respect to energy consumption and packet delivery ratio.

Energy efficient hint based routing protocol (EEHP) in wireless networks is the problem of finding energy efficient shortest active path which also senses the node breakage before occurrence of disconnection and performs a handoff. In the existing Hint Based Routing Protocol (HBP), the nodes discover an active path to the destination exploiting a set of routing meta-information (called hints). The active paths based on hint computation is alone not sufficient for nodes in the ad hoc network for which there may be energy loss during packet transfer leading to disconnection. to avoid path loss a new energy efficient hint based routing approach outperforms the existing HBP protocol by inheriting the node handoff strategy into the HBP protocol which finds the active shortest path based on hint computation followed by route maintenance based on power of the nodes in the active route. The simulation results show that the proposed protocol performs well when a link failure occurrence is identified preventing the route from being broken, leading to energy efficient and better performance in the network.

Abstract: Wireless network are becoming popular now a days due their features like easy setup without the need of cabling. Wireless ad-hoc networks are a collection of mobile/semi-mobile nodes with no pre-established infrastructure, forming a temporary network. Each node in the network has a wireless Interface and communicates with each other over either radio frequency or infrared, that is, point to point communication. An ad-hoc network is a local area network (LAN) that is built spontaneously as the devices connect. Dynamic Source Routing protocol is a self-organizing and self-configuring routing protocol which allows the easy access to the network without the need for any existing network infrastructure or administration and uses Route Discovery and Route Maintenance techniques for routing packets from source to random destinations. Temporally Ordered Routing Algorithm (TORA) is a distributed routing algorithm based on the concept of link reversal. TORA is implemented where nodes are continuously moving from one place to another. This paper is aimed to study the on-demand routing protocols DSR and TORA for wireless adhoc networks. Further, the implementation of a network using network simulator OPNET will be done to analyze the performance of these two network protocols for traffic sent and received, end to end delay during data communication and download and upload response time.

Energy conservation is one of the greatest challenges in multi-hop wireless networks due to the everincreasing energy requirements of wireless devices and the slow advancement of battery technology. While significant energy savings can be obtained by incorporating energy efficiency into the design of network protocols, the approaches taken so far have been very diverse. Current research has focused on either optimizing the energy use for a given communication task, or optimizing the energy consumption when the network is idle. However, an integrated approach is lacking. To this end, we explore the limits of traditional stand-alone techniques and expose some commonly held myths about energy conservation in wireless multi-hop networks. The main goal of our research is to develop a unified design that enables energy-efficient network operation. In the first part of the thesis, we explore the existence of an optimal operating point that minimizes energy while satisfying the communication requirements on the network. Our goal is to conserve energy by accounting for all sources of energy consumption: (1) energy consumed for communication including energy spent for data and control overhead and (2) energy consumed during idling. Essentially, this is an energy-efficient network design problem. Since this problem is a node-weighted buy-at-bulk problem, which is NP-hard, we follow a divide-and-conquer approach,