DISTRIBUTED MULTI-HOP ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORKS

In a Wireless Sensor Network (WSN), routing is the process of finding a cost-effective route in terms of power consumption. As an evaluation criterion for the WSN performance, network lifetime is directly affected by the routing method. In a wide variety of WSNs, different techniques are used as routing methods, such as shortest distance path. In this paper, we propose a novel algorithm, optimizing power consumption in WSN nodes, based on the shortest path algorithm. In this approach, the energy level of nodes and their geographical distance from each other contribute to the weight of the connecting path. The proposed algorithm is used as a data dissemination method in WSNs with randomly scattered nodes. We also apply Dijkstra’s shortest path algorithm to the same networks. The results showed that the proposed algorithm increases the network lifetime up to 30 % by preventing nodes with low charge levels from early disconnection

Performance Analysis of the Gossip based Ad Hoc Routing using Received Signal Strength for AODV

In Mobile Ad hoc Networks (MANETs), congestion control is a critical issue in controlling the degradation of network performance. During the route discovery process, the MANET routing protocol floods control packets to discover routes which may cause congestion. Currently, routing protocols take the shortest path with the minimum number of hops to reach the destination without considering the effects of Received Signal Strength (RSS). During the route discovery process, each node of MANET should not blindly broadcast without considering RSS to avoid link breakage. This causes excess energy consumption in rediscovering new routes and a greater likelihood of network partition. This paper suggests a modification of the rebroadcasting procedure for Received Requests (RREQ) in AODV using RSS on Gossip algorithm (AODV-RG). The performance of the protocol is measured based on different scenarios through metrics such as packet delivery ratio, throughput and, end-to-end delay using Network Simulator (NS 3.24.1). Experimental results show that thee AODV-RG protocol outperforms that of AODV with gossip probability p=0.66 by minimizing RREQ rebroadcasting messages during route discovery process. The Ad hoc mobile networks are suffering from the scarce power in the nodes. To decrease the amount of power consumption the AODV has been developed by many researchers by introducing the GOSSIP probability to alter the flow of RREQ. The advantage of this scheme is to decrease the overheads and the busy time of the node by detecting the RSS of the receiving node. When RSS is more than the threshold, then the RREQ is forwarded. If RSS is less than the threshold value, then RREQ is ignored. We need to test if the GOSSIP use has affected positively the quality of performance parameters such as utilization, packet delay ratio and throughput of the RREQ rebroadcast and end-to-end delay

ENERGY CONSERVATION FOR WIRELESS AD HOC ROUTING

Self-configuring wireless ad hoc networks have attracted considerable attention in the last few years due to their valuable civil and military applications. One aspect of such networks that has been studied insufficiently is the energy efficiency. Energy efficiency is crucial to prolong the network lifetime and thus make the network more survivable.Nodes in wireless ad hoc networks are most likely to be driven by battery and hence operate on an extremely frugal energy budget. Conventional ad hoc routing protocols are focused on handling the mobility instead of energy efficiency. Energy efficient routing strategies proposed in literature either do not take advantage of sleep modes to conserve energy more efficiently, or incur much overhead in terms of control message and computing complexity to schedule sleep modes and thus are not scalable.In this dissertation, a novel strategy is proposed to manage the sleep of the nodes in the network so that energy can be conserved and network connectivity can be kept. The novelty of the strategy is its extreme simplicity. The idea is derived from the results of the percolation theory, typically called gossiping. Gossiping is a convenient and effective approach and has been successfully applied to several areas of the networking. In the proposed work, we will developa sleep management protocol from gossiping for both static and mobile wireless ad hoc networks. Then the protocol will be extended to the asynchronous network, where nodes manage their own states independently. Analysis and simulations will be conducted to show thecorrectness, effectiveness and efficiency of the proposed work. The comparison between analytical and simulation results will justify them for each other. We will investigate the most important performance aspects concerning the proposed strategy, including the effect ofparameter tuning and the impacts of routing protocols. Furthermore, multiple extensions will be developed to improve the performance and make the proposed strategy apply to different network scenarios