scholarly journals A Relay Mote Wheeze for Energy Saving and Network Longevity Enhancement in WSN

2019 ◽  
Vol 8 (3) ◽  
pp. 8220-8227
Keyword(s):  
Relay Node ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Data Delivery ◽  
Route Discovery ◽  
Relay Nodes ◽  
Global Energy Balance ◽  
End To End Delay ◽  
Ratio Energy ◽  
Selection Of

Weather Monitoring, surveillance of enemy vehicles, sensed data delivery are few of the applications of Wireless Sensor Networks. All the applications want the nodes to spend their energy in the critical activities. Lifetime depends on the residual energy of the nodes in the network. In this work we modify the Global Energy Balance [1] algorithms to have better network lifetime by making use of fixed relay nodes at various positions in the network. The selection of relay node is based on the distance and residual energy of the relay node all through the route discovery practice. The FRNS scheme is compared with existing algorithms for diverse parameters like End to End Delay, Overall Hops Count, Overall Alive nodes and Dead nodes, Residual energy, Lifetime ratio, Energy Consumption, Throughput and Routing Overhead.

scholarly journals Relay Selection Joint Consecutive Packet Routing Scheme to Improve Performance for Wake-Up Radio-Enabled WSNs

2020 ◽  
Vol 2020 ◽  
pp. 1-32 ◽  
Author(s):  
Mengyu Peng ◽  
Wei Liu ◽  
Tian Wang ◽  
Zhiwen Zeng
Keyword(s):  
Energy Consumption ◽  
Relay Selection ◽  
Relay Node ◽  
Residual Energy ◽  
Packet Transmission ◽  
Network Throughput ◽  
Packet Routing ◽  
Relay Nodes ◽  
Data Packets ◽  
End To End Delay

Reducing energy consumption, increasing network throughput, and reducing delay are the pivot issues for wake-up radio- (WuR-) enabled wireless sensor networks (WSNs). In this paper, a relay selection joint consecutive packet routing (RS-CPR) scheme is proposed to reduce channel competition conflicts and energy consumption, increase network throughput, and then reduce end-to-end delay in data transmission for WuR-enabled WSNs. The main innovations of the RS-CPR scheme are as follows: (1) Relay selection: when selecting a relay node for routing, the sender will select the node with the highest evaluation weight from its forwarding node set (FNS). The weight of the node is weighted by the distance from the node to sink, the number of packets in the queue, and the residual energy of the node. (2) The node sends consecutive packets once it accesses the channel successfully, and it gives up the channel after sending all packets. Nodes that fail the competition sleep during the consecutive packet transmission of the winner to reduce collisions and energy consumption. (3) Every node sets two thresholds: the packet queue length threshold Nt and the packet maximum waiting time threshold Tt. When the corresponding value of the node is greater than the threshold, the node begins to contend for the channel. Besides, to make full use of energy and reduce delay, the threshold of nodes which are far from sink is small while that of nodes which are close to sink is large. In such a way, nodes in RS-CPR scheme will select those with much residual energy, a large number of packets, and a short distance from sink as relay nodes. As a result, the probability that a node with no packets to transmit becomes a relay is very small, and the probability that a node with many data packets in the queue becomes a relay is large. In this strategy, only a few nodes in routing need to contend for the channel to send packets, thereby reducing channel contention conflicts. Since the relay node has a large number of data packets, it can send many packets continuously after a successful competition. It also reduces the spending of channel competition and improves the network throughput. In summary, RS-CPR scheme combines the selection of relay nodes with consecutive packet routing strategy, which greatly improves the performance of the network. As is shown in our theoretical analysis and experimental results, compared with the receiver-initiated consecutive packet transmission WuR (RI-CPT-WuR) scheme and RI-WuR protocol, the RS-CPR scheme reduces end-to-end delay by 45.92% and 65.99%, respectively, and reduces channel collisions by 51.92% and 76.41%. Besides, it reduces energy consumption by 61.24% and 70.40%. At the same time, RS-CPR scheme improves network throughput by 47.37% and 75.02%.

scholarly journals A Two Hop Relay Battery Aware Mote Scheme for Energy Redeemable and Network Lifespan Improvement in WSN

2019 ◽  
Vol 9 (1) ◽  
pp. 4785-4791
Keyword(s):  
Energy Consumption ◽  
Low Cost ◽  
Relay Node ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Virtual Currency ◽  
Multiple Factors ◽  
Battery Energy ◽  
Selection Of

The nodes available in the market are now of miniaturized nature, also have the characteristics of low cost and power values. Wireless Sensor Network (WSN) will be a sparse network with independent points acting as energy sources. The application in WSN includes temperature sensing, sound sensing, and pressure session. The data is sent from one point to other using multi intermediate nodes. The selection of intermediate nodes will be done based on computation of trust. As the number of hops increases energy consumption will become high and this can be improved with the help of relay node which can store the data and deliver the data once destination is in its range. The selection of relay node can be done in multiple ways like random, based on meeting probability and in the proposed two hop relay battery energy aware algorithm makes use of multiple factors namely residual energy, virtual currency based data, meeting probability, security computation so that the communication can be optimized. The proposed method is also compared with several existing methods with respect to delay, energy consumption, alive nodes, dead nodes, lifetime ratio and residual energy.

CONSTRAINED RELAY NODE DEPLOYMENT FOR UNDERWATER ACOUSTIC WIRELESS SENSOR NETWORKS

2012 ◽  
Vol 04 (01) ◽  
pp. 1250010 ◽  
Author(s):  
DEYING LI ◽  
ZHENG LI ◽  
WENKAI MA ◽  
WENPING CHEN
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Relay Node ◽  
Network Connectivity ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Underwater Acoustic ◽  
Node Deployment ◽  
Algorithm Framework

An underwater acoustic wireless sensor network (UA-WSN) consists of many resource-constrained underwater sensor nodes (USNs), which are deployed to perform collaborative monitoring tasks over a given region. One way to preserve network connectivity while guaranteeing other network QoS is to deploy some relay nodes (RNs) in the networks. Although RNs' function is more powerful than USNs, but they can lead to more interference and their cost is more expensive. This paper addresses constrained low-interference relay node deployment problem for 3-D UA-WSNs in which the RNs are placed at a subset of candidate locations to ensure connectivity between the USNs such that the number of RNs deployed and the value of total incremental interference are minimized. We first prove that it is NP-hard, then propose a general approximation algorithm framework. Based on the framework, we get two polynomial time O(1)-approximation algorithms.

scholarly journals Prolonging the Lifetime of Two-Tiered Wireless Sensor Networks with Mobile Relays

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Theodore C. Kotsilieris ◽  
George T. Karetsos
Keyword(s):  
Energy Savings ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Relay Nodes ◽  
Large Numbers ◽  
Sensor Networking ◽  
Key Aspects ◽  
Networking Architectures ◽  
Mobile Relay

We propose a clustering scheme for wireless sensor nodes in hierarchical wireless sensor networking architectures that employs mobile relay nodes in order to achieve energy conservation and network lifetime prolongation. The key aspects of our scheme are relay node relocation and reclustering when failures are detected. The performance of the proposed approach is evaluated via simulations for various topology layouts based on the sensor node population and number of mobile relay nodes employed. The results show significant energy savings in particular for topologies with large numbers of sensors.

scholarly journals A Novel Cooperative ARQ Method for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Haiyong Wang ◽  
Geng Yang ◽  
Yiran Gu ◽  
Jian Xu ◽  
Zhixin Sun
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Markov Chain Model ◽  
Relay Node ◽  
Wireless Sensor ◽  
System Throughput ◽  
Chain Model ◽  
Channel Fading ◽  
Relay Nodes

In wireless sensor networks, cooperative communication can combat the effects of channel fading by exploiting diversity gain achieved via cooperation communication among the relay nodes. A cooperative automatic retransmission request (ARQ) protocol based on two-relay node selection was proposed in this paper. A novel discrete time Markov chain model in order to analyze the throughput and energy efficiency was built, and system throughput and energy efficiency performance of proposed protocol and traditional ARQ protocol were studied based on such model. The numerical results reveal that the throughput and energy efficiency of the proposed protocol could perform better when compared with the traditional ARQ protocol.

scholarly journals Routing of emergency data in a wireless sensor network for mining applications

2021 ◽  
Author(s):  
Mandana Jafarian
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Residual Energy ◽  
Mesh Network ◽  
Wireless Sensor ◽  
End To End Delay ◽  
Simulation Results ◽  
End To End

Emergency situations in mines result in loss of precious human lives. In this thesis we discussed architecture of a Wireless Sensor Network (WSN) that can be deployed in mines, which takes care of severe geographical and environmental constraints found inside mines. The proposed architecture is a two-level hierarchy of small sized WSNs that employs a wireless Mesh network as the backbone connecting small sized WSNs scattered inside mines. We proposed a routing protocol for that WSN that is optimized for both emergency and non-emergency data routing. Since our main goal is to provide safety in the mining environment, the main consideration of the routing protocol is to provide reliability and reduce the end-to-end delay for vital emergency traffic while optimizing for network longevity for non-emergency traffic. We present a new cost-based routing protocol called MDML, which provides Minimum Delay and Maximum Lifetime routing for such networks. The proposed MDML routing defines separate cost metrics for emergency and non-emergency traffic. It finds the least-cost path for the reliable delay-constrained emergency traffic with regards to link error rate but also gives secondary consideration to nodes' residual energy. It is an energy efficient routing scheme for non-emergency or regular data traffic routing that maximizes the network lifetime. However, for emergency traffic energy efficiency is compromised to achieving minimal delay. Regular traffic is generated through periodic monitoring and is delay-insensitive. For regular traffic delivery, a shortest path routinig algorithm is employed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. Simulation results show that using the proposed emergency routes reduces the end-to-end delay for emergency traffic. The effect of protocol update cycle on increasing the network lifetime is verified true simulation. MDML is also compared with a simulated non-MDML approach to compare the lifetime and delay performance. Simulation results have demonstrated the effectiveness of our approach.

scholarly journals An energy aware scheme for layered chain in underwater wireless sensor networks using genetic algorithm

2021 ◽  
Vol 11 (5) ◽  
pp. 4272
Author(s):  
Sihem Souiki ◽  
Sidi Mohamed Hadj Irid ◽  
Mourad Hadjila
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Aware ◽  
Chain Transmission ◽  
Selection Of

Extending the network lifetime is a very challenging problem that needs to be taken into account during routing data in wireless sensor networks in general and particularly in underwater wireless sensor networks (UWSN). For this purpose, the present paper proposes a multilayer chain based on genetic algorithm routing (MCGA) for routing data from nodes to the sink. This algorithm consists to create a limited number of local chains constructed by using genetic algorithm in order to obtain the shortest path between nodes; furthermore, a leader node (LN) is elected in each chain followed by constructing a global chain containing LNs. The selection of the LN in the closest chain to the sink is as follows: Initially, the closest node to sink is elected LN in this latter because all nodes have initially the same energy value; then the future selection of the LN is based on the residual energy of the nodes. LNs in the other chains are selected based on the proximity to the previous LNs. Data transmission is performed in two steps: intra-chain transmission and inter-chain transmission. Furthermore, MCGA is simulated for different scenarios of mobility and density of nodes in the networks. The performance evaluation of the proposed technique shows a considerable reduction in terms of energy consumption and network lifespan.

scholarly journals A Review of Relay Assignment Problem in the Cooperative Wireless Sensor Networks

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 443
Author(s):  
Mohammed S. Al-kahtani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Relay Selection ◽  
Relay Node ◽  
Cooperative Networks ◽  
Performance Criteria ◽  
Wireless Sensor ◽  
Proper Selection ◽  
Relay Assignment ◽  
Selection Of

The relay selection is a promising approach of maximizing the diversity gain achieved in the cooperative wireless sensor networks. In the cooperative networks, the proper selection of relay node is a challenging task. The proper selection of relay nodes not only improves the source–destination performance, but also maximizes the overall system performance. There are many factors involved in designing a relay selection algorithm. The different relay selection algorithms have different focus, criteria, objective, mechanism, and performance issues. In this article, several relay assignment algorithms have been analyzed to show the effectiveness of channel capacity, power allocation, coverage expansion and interference mitigation in term of proper relay selection schemes. Moreover, this paper discusses some relay selection schemes, their challenging issues, limitations, performance criteria, and mechanisms. This article also highlights the significant design issues of relay selection methods and compares them that are appropriate in the cooperative wireless sensor networks.

Intelligent Water Drop Based Coverage-Connectivity and Lifespan Maximization Protocol for Wireless Sensor Networks

2019 ◽  
Vol 13 (3) ◽  
pp. 261-273
Author(s):  
R. Sharma ◽  
D.K. Lobiyal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Water Drop ◽  
Relay Node ◽  
Residual Energy ◽  
Base Station ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Coverage Ratio ◽  
Area Of Interest

Background: A significant issue of consideration in wireless sensor networks is to reduce the energy utilization while preserving the required coverage and connectivity of an area of interest. We have revised all patents relating to preserving of energy in sensor motes of the wireless sensor networks. Methods: We proposed a novel; Intelligent Water Drop based coverage-connectivity and lifespan protocol which minimizes energy consumption of the network. In this routing protocol, sensors are partitioned into the connected first layer and connected successive layer sets and a scheduling mechanism has been used to activate and deactivate sensors. Multi-hoping is used to transmit packets from sensors to the Base Station and sensor with maximum residual energy has been selected as the next hop. Power wastage has been avoided by removing duplicate information through a common relay node. Results: We have derived the expected number of sensors required to cover an area of interest and our protocol gives a long life to the network. A theorem has been provided to validate the results for different communication ranges of sensors. Conclusion: The protocol has been compared with other protocols and it proved better than other protocols in terms of the lifespan and the coverage ratio of the area. Results approve that our protocol reduces the problem of energy holes and maintains the connectivity of the network.

scholarly journals E-FLEACH: An Improved Fuzzy Based Clustering Protocol for Wireless Sensor Network

2021 ◽  
Vol 17 (2) ◽  
pp. 190-197
Author(s):  
Enaam Al-Husain ◽  
Ghaida Al-Suhail
Keyword(s):  
Network Lifetime ◽  
Fuzzy Logic Controller ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Optimal Number ◽  
Wireless Sensor ◽  
Clustering Protocol ◽  
Leach Protocol ◽  
Selection Of

Clustering is one of the most energy-efficient techniques for extending the lifetime of wireless sensor networks (WSNs). In a clustered WSN, each sensor node transmits the data acquired from the sensing field to the leader node (cluster head). The cluster head (CH) is in charge of aggregating and routing the collected data to the Base station (BS) of the deployed network. Thereby, the selection of the optimum CH is still a crucial issue to reduce the consumed energy in each node and extend the network lifetime. To determine the optimal number of CHs, this paper proposes an Enhanced Fuzzy-based LEACH (E-FLEACH) protocol based on the Fuzzy Logic Controller (FLC). The FLC system relies on three inputs: the residual energy of each node, the distance of each node from the base station (sink node), as well as the node’s centrality. The proposed protocol is implemented using the Castalia simulator in conjunction with OMNET++, and simulation results indicate that the proposed protocol outperforms the traditional LEACH protocol in terms of network lifetime, energy consumption, and stability.

Sign in / Sign up

Export Citation Format

Share Document