An Energy Efficient Routing Based on Route Segmentation in Mobile Ad Hoc Network

Mobile Ad hoc networks based communication is one of an essential form of today's technologies which is highly effective in an emergency need. The feature of infrastructure independence makes it highly useful and versatile all kind of wireless communications needs. But the insufficiency of resources availability degrades its performance and stability of the network. Energy is the vital resource in MANET, as it makes a node to live and retain in-network for longer, which provide better network stability, scalability, and throughput. In this paper, we propose an energy efficient routing based on route segmentation mechanism (EER-RS) for energy saving in the high scalable network. It presents a lightweight route segments energy prediction algorithm to predicts the optimal energy efficiency path for data routing. We evaluate this mechanism in a high scalable network and the obtained results show an improvisation with 40 to 60 percent less energy consumption than traditional AODV and other compared protocol

SSEGR: Secure single-copy energy efficient geographical routing algorithm in wireless sensor networks

Geographical Routing Technique is a new trend in Wireless Sensor Networks in which the sensor nodes are enabled using Global Positioning Systems (GPS). This helps to easily detect the position of their neighboring nodes. The power consumption is more in the existing routing algorithms, since the nodes build the routing tables and the neighboring node IDs are determined by searching the routing table. In this paper, we have proposed Secure Single-Copy Energy Efficient Geographical Routing (SSEGR) algorithm in which the data traffic and energy consumption is minimized using single copy data transfer. In SSEGR, initially one copy is transmitted to the next node using greedy approach and another copy is preserved in the sending station. If acknowledgment is not received even after timeout then the second copy is transmitted. This dynamic single copy scheme reduces the data traffic in Wireless Sensor Networks. Security algorithms are incorporated in every sensor node to prevent any malicious node attack that disturb the normal functioning of the network. Simulation result shows that the performance of the proposed algorithm is better interms of packet delivery probability and energy consumption in comparision with existing algorithm

GSAR: Greedy Stand-Alone Position-Based Routing protocol to avoid hole problem occurance in Mobile Ad Hoc Networks

The routing process in a Mobile Ad Hoc Network (MANET) poses critical challenges because of its features such as frequent topology changes and resource limitations. Hence, designing a reliable and dynamic routing protocol that satisfies MANET requirements is highly demanded. The Greedy Forwarding Strategy (GFS) has been the most used strategy in position-based routing protocols. The GFS algorithm was designed as a high-performance protocol that adopts hop count in soliciting shortest path. However, the GFS does not consider MANET needs and is therefore insufficient in computing reliable routes. Hence, this study aims to improve the existing GFS by transforming it into a dynamic stand-alone routing protocol that responds swiftly to MANET needs, and provides reliable routes among the communicating nodes. To achieve the aim, two mechanisms were proposed as extensions to the current GFS, namely the Dynamic Beaconing Updates Mechanism (DBUM) and the Dynamic and Reactive Reliability Estimation with Selective Metrics Mechanism (DRESM). The DBUM algorithm is mainly responsible for providing a node with up-to-date status information about its neighbours. The DRESM algorithm is responsible for making forwarding decisions based on multiple routing metrics. Both mechanisms were integrated into the conventional GFS to form Greedy Stand-Alone Routing (GSAR) protocol. Evaluations of GSAR were performed using network simulator Ns2 based upon a defined set of performance metrics, scenarios and topologies. The results demonstrate that GSAR eliminates recovery mode mechanism in GFS and consequently improve overall network performance. Under various mobility conditions, GSAR avoids hole problem by about 87% and 79% over Greedy Perimeter Stateless Routing and Position-based Opportunistic Routing Protocol respectively. Therefore, the GSAR protocol is a reasonable alternative to position-based unicast routing protocol in MANET