An Enhanced Cluster based Multi-hop Routing Technique in Wireless Sensor Network Using AODV Protocol

Wireless Sensor Network is one of main extent in physical environmental inquiry. The Cluster based multi-hop routing for the capable network to improve the life time data transmission and energy saving for the network progress. In this Research paper based on Flat Multi-Hop Routing Technique is used to LEACH protocol using reduced overall network power utilization. Hierarchical Multi-hop routing Technique is one of the methods using M-LEACH protocol, while using this method user is able to get the large number of data and packet losses also reduced. Hybrid multi-hop routing Technique using PEACH protocol used by the users are able to get Energy saving is high. My Research contribution going to Enhanced Hybrid Multi-hop Routing(EHYMN) for improve the data transmission with less time , reduced the packet losses and also minimum power utilization for this Ad-hoc On Demand Distance Vector (AODV) protocol is used for the implementation in network simulation tool 2.34 version for get a good Results

Wireless sensor node mobility and its effect on transmission reliability

Abstract: Deploying a Wireless Sensor Network (WSN) poses certain challenges such as data reliability due to Electromagnetic Interference (EMI), multipath fading as well as faster energy depletion of nodes located near the base station creating communication holes in the network. Several energy efficient algorithms have been developed to improve the energy consumption of static nodes however the issue of battery depletion of nodes near the base station remains present. In this paper we attempt to model the relationship between the node mobility and the reliability of data transmission. Mobile nodes could move near static nodes experiencing high traffic in order to reduce the number of packets sent through the saturated nodes. This paper will investigate, using a real environment, the effect of speed and packet size on the reliability of the wireless link. This is a required prerequisite, prior to a detailed design of a Mobile relay node

A modified energy efficient multi-hop routing protocol in wireless sensor networks

Energy efficient routing protocols in Wireless Sensor Networks (WSNs) is an important area of research due to energy limitations. It is therefore important to maximize the limited energy so as to increase the network lifetime of the WSN. In this paper, a modified energy efficient multi-hop routing protocol (mEEMRP) in a 200 m2 field is presented. This protocol is based on a technique that involves balancing load between communication management (CM) nodes during the multi-hop routing of aggregated data to the base station (BS), where the residual energy (RE) levels of CM nodes are considered as well as the distance between neighboring CM nodes. Simulation results showed that mEEMRP yielded a 1.77% improvement over energy efficient multi-hop routing protocol (EEMRP) in terms of network lifetime. More so, the proposed mEEMRP also improved the energy consumption and the number of packets received at the BS by 4.83% and 7.41%, respectively.Keywords: Routing protocol, Multi-hop routing, Network lifetime, mEEMRP, EEMR

An Election Energy Threshold Based Multi-Hop Routing Protocol in a Grid-Clustered Wireless Sensor Network

Owing to the limited energy of sensor nodes (SNs) in a wireless sensor network (WSN), it is important to reduce and balance the energy consumption of the SNs in order to extend the WSN lifetime. Clustering mechanism is a highly efficient and effective mechanism for minimizing the amount of energy that SNs consume during the transmission of data packets. In this paper, an election energy threshold based multi-hop routing protocol (mEEMRP) is presented. In order to minimize energy consumption, this routing protocol uses grid clustering, where the network field is divided into grid clusters. SNs in each grid cluster select a cluster head (CH) based on a weight factor that takes the node location, node’s residual energy (RE) as well as the node’s distance from the base station into consideration. An energy efficient multi-hop routing algorithm is adopted during the transmission of data packets from the cluster heads (CHs) to the base station (BS). This multi-hop routing algorithm uses an election energy threshold value, T­nhCH that takes into consideration the RE of CHs as well as the distance between CHs. Simulation results show a 1.77% and 10.65% improvement in terms of network lifetime for two network field scenarios over Energy Efficient Multi-hop Routing Protocol (EEMRP)

RFDMRP: River Formation Dynamics based Multi-hop Routing Protocol for Data Collection in Wireless Sensor Networks

AbstractIn Wireless sensor networks, sensor nodes sense the data from environment according to its functionality and forwards to its base station. This process is called Data collection and it is done either direct or multi-hop routing. In direct routing, every sensor node directly transfers its sensed data to base station which influences the energy consumption from sensor node due to the far distance between the sensor node and base station. In multi-hop routing, the sensed data is relayed through multiple nodes to the base station, it uses less energy. This paper introduces a new mechanism for data collection and routing based on River Formation Dynamics. The proposed algorithm is termed as RFDMRP: River Formation Dynamics based Multi-hop Routing Protocol. This algorithm is explained and implemented using MATLAB. The performance results are compared with LEACH and MODLEACH. The comparison reveals that the proposed algorithm performs better than LEACH and MODLEACH

Energy Efficient Multicast Routing in Mobile Ad Hoc Networks: Contemporary Affirmation of Benchmarking Models in Recent Literature

The Mobile Ad hoc Networks playing critical role in network aided communication requirements The features such as ad hoc and open architecture based connectivity and node mobility are elevating the mobile ad hoc networks as much as feasible to deploy and use The direct communication between any of two nodes in this network is possible if target node is in the range of source node If not the indirect communication took place which is usually referred as multi hop routing The multi hop routing occurs as either a unicast model one source node to one destination node multicast model one source node to multiple destination nodes or multiple casting manifold unicast routing In these routing strategies provision of service quality in multi hop routing is a challenging task The optimal quality of service in routing magnifies the delivery ratio transmission rate network life span and other expected characteristics of the ad hoc routing Among the quality service provision factors minimal energy conservation is prime factor which is since the nodes involved in routing are self-energized and if discharged early then the route will be destructed that causes discontinued routing The energy consumption is more specific in multicast routing hence it is grabbing the more attention of the current research contribution

Reliable multi-hop routing with cooperative transmissions in energy-constrained networks

We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regime, we determine the optimal cardinality of the cooperation sets at each hop on a path minimizing the total energy cost per transmitted bit. Optimal cooperating set cardinality curves are derived, and they can be used to determine the optimal routing strategy based on the required reliability, transmission power, and path loss coefficient. We design a new greedy geographical routing algorithm suitable for vMISO transmissions, and demonstrate the applicability of our results for more general networks