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

Wireless Communications and Mobile Computing ◽

10.1155/2020/7230565 ◽

2020 ◽

Vol 2020 ◽

pp. 1-32 ◽

Cited By ~ 22

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%.

Download Full-text

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

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.c6707.098319 ◽

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.

Download Full-text

Energy-Efficient and Disjoint Multipath Using Face routing in Wireless Sensor Networks

Energies ◽

10.3390/en14227823 ◽

2021 ◽

Vol 14 (22) ◽

pp. 7823

Author(s):

Hyunchong Cho ◽

Seungmin Oh ◽

Yongje Shin ◽

Euisin Lee

Keyword(s):

Energy Consumption ◽

Average Energy ◽

Packet Transmission ◽

Destination Node ◽

Path Generation ◽

Data Packets ◽

Hole Area ◽

Face Routing ◽

Multiple Routes ◽

Average Energy Consumption

In WSNs, multipath is well-known as a method to improve the reliability of packet delivery by making multiple routes from a source node to a destination node. To improve reliability and load-balancing, it is important to ensure that disjoint characteristics of multipath do not use same nodes during path generation. However, when multipath studies encounter a hole area from which is hard to transmit data packets, they have a problem with breaking the disjoint features of multipath. Although existing studies propose various strategies to bypass hole areas, they have side effects that significantly accelerate energy consumption and packet transmission delay. Therefore, to retain the disjoint feature of multipath, we propose a new scheme that can reduce delay and energy consumption for a node near a hole area using two approaches—global joint avoidance and local avoidance. This scheme uses global joint avoidance to generate a new path centered on a hole area and effectively bypasses the hole area. This scheme also uses local joint avoidance that does not select the same nodes during new path generation using a marking process. In simulations, the proposed scheme has an average 30% improvement in terms of average energy consumption and delay time compared to other studies.

Download Full-text

Relay-Assisted D2D Transmission for Mobile Health Applications

Sensors ◽

10.3390/s18124417 ◽

2018 ◽

Vol 18 (12) ◽

pp. 4417 ◽

Cited By ~ 2

Author(s):

Hongcheng Huang ◽

Wei Xiang ◽

Yang Tao ◽

Biao Liu ◽

Min Hu

Keyword(s):

Energy Consumption ◽

Mobile Health ◽

Data Transmission ◽

Transmission Rate ◽

Relay Node ◽

Medical Data ◽

Spectrum Efficiency ◽

D2d Communication ◽

Relay Nodes ◽

Relay Communication

Relay-assisted Device-to-Device (D2D) communication, one of the important transmission modes in mobile health systems, can provide high transmission quality for servicing users at the edge of system coverage. However, the quality of the D2D relay communication is largely limited by the relay nodes. When a poor node is selected to assist the source node in the data transmission, it is likely to result in the loss of medical data and inaccurate transmission. Therefore, this paper focuses on how to select relay modes and relay nodes to improve the reliability of medical data transmission. Firstly, in order to eliminate the relay nodes with low energy or poor willingness, the acceptable energy consumption metric of relay nodes is proposed in this paper. The relay mode of each relay node is determined by the acceptable energy consumption metric, which can ensure the physical reliability of the relay communication links. Then a trust metric is proposed to measure the social reliability of each relay link, further excluding the malicious relay nodes. Finally, this paper proposes a relay selection algorithm based on compromise factors (RSCF). With the help of the proposed algorithm, the reliability of the relay communication can be guaranteed, and the spectrum efficiency can be promoted greatly. The simulation results show that the relay nodes selected by RSCF algorithm can greatly improve transmission rate and reliability compared with the traditional relay-assisted D2D communication schemes.

Download Full-text

Energy-Efficient Relay-Based Void Hole Prevention and Repair in Clustered Multi-AUV Underwater Wireless Sensor Network

Security and Communication Networks ◽

10.1155/2021/9969605 ◽

2021 ◽

Vol 2021 ◽

pp. 1-20

Author(s):

Amir Chaaf ◽

Mohammed Saleh Ali Muthanna ◽

Ammar Muthanna ◽

Soha Alhelaly ◽

Ibrahim A. Elgendy ◽

...

Keyword(s):

Energy Consumption ◽

Energy Efficient ◽

Autonomous Underwater Vehicles ◽

Average Energy ◽

Packet Transmission ◽

Wireless Sensor ◽

Current Status ◽

Maximum Matching ◽

Sleep Scheduling ◽

Relay Nodes

Underwater wireless sensor networks (UWSNs) enable various oceanic applications which require effective packet transmission. In this case, sparse node distribution, imbalance in terms of overall energy consumption between the different sensor nodes, dynamic network topology, and inappropriate selection of relay nodes cause void holes. Addressing this problem, we present a relay-based void hole prevention and repair (ReVOHPR) protocol by multiple autonomous underwater vehicles (AUVs) for UWSN. ReVOHPR is a global solution that implements different phases of operations that act mutually in order to efficiently reduce and identify void holes and trap relay nodes to avoid it. ReVOHPR adopts the following operations as ocean depth (levels)-based equal cluster formation, dynamic sleep scheduling, virtual graph-based routing, and relay-assisted void hole repair. For energy-efficient cluster forming, entropy-based eligibility ranking (E2R) is presented, which elects stable cluster heads (CHs). Then, dynamic sleep scheduling is implemented by the dynamic kernel Kalman filter (DK2F) algorithm in which sleep and active modes are based on the node’s current status. Intercluster routing is performed by maximum matching nodes that are selected by dual criteria, and also the data are transmitted to AUV. Finally, void holes are detected and repaired by the bicriteria mayfly optimization (BiCMO) algorithm. The BiCMO focuses on reducing the number of holes and data packet loss and maximizes the quality of service (QoS) and energy efficiency of the network. This protocol is timely dealing with node failures in packet transmission via multihop routing. Simulation is implemented by the NS3 (AquaSim module) simulator that evaluates the performance in the network according to the following metrics: average energy consumption, delay, packet delivery rate, and throughput. The simulation results of the proposed REVOHPR protocol comparing to the previous protocols allowed to conclude that the REVOHPR has considerable advantages. Due to the development of a new protocol with a set of phases for data transmission, energy consumption minimization, and void hole avoidance and mitigation in UWSN, the number of active nodes rate increases with the improvement in overall QoS.

Download Full-text

Analyzing bit error rate of relay sensors selection in wireless cooperative communication systems

Bulletin of Electrical Engineering and Informatics ◽

10.11591/eei.v10i1.2492 ◽

2021 ◽

Vol 10 (1) ◽

pp. 216-223

Author(s):

Ahmed Allawy Alawady ◽

Ahmed Alkhayyat ◽

Mohammed Ahmed Jubair ◽

Mustafa Hamid Hassan ◽

Salama A. Mostafa

Keyword(s):

Cooperative Communication ◽

System Performance ◽

Communication Systems ◽

Relay Selection ◽

Relay Node ◽

Cooperative Systems ◽

Diversity Order ◽

Channel Fading ◽

Negative Effects ◽

Relay Nodes

Cooperative communication systems, which make use of the intermediate relays between the transmitter and the receiver, have been employed as an effective technique to combat the channel fading and to enhance system performance. Cooperative systems have some drawbacks such as high latency and may diversity order not guaranteed. To alleviate the negative effects of these factors, the relay selection protocol is employed in cooperative communication systems to increase overall cooperative system performance. Relay selection in the cooperative systems enables the source to cooperate with the single relay node rather than multiple relay nodes which guaranteed the diversity order.

Download Full-text

An Adaptive Buffer tradeoff, energy-aware Congestion Control protocol in WSN

Turkish Journal of Computer and Mathematics Education (TURCOMAT) ◽

10.17762/turcomat.v12i3.1993 ◽

2021 ◽

Vol 12 (3) ◽

pp. 4880-4891

Author(s):

M. Sri Lakshmi Et. al.

Keyword(s):

Energy Consumption ◽

Congestion Control ◽

Residual Energy ◽

Vital Role ◽

Sensor Nodes ◽

Data Loss ◽

Energy Aware ◽

End To End Delay ◽

Adequate Communication ◽

Control Management

In a Wireless sensor network, network lifetime plays a vital role, wherein regular communication and sensor nodes are positioned at different points. Nodes energy depletion may lead to communication interruption due to unlimited data flow from one point to another; for adequate communication, Nodes energy should be maximized by arranging cutting-edge techniques such as adaptive buffer switching and congestion control significant role. When the incoming data is more wide-ranging than available resources, a congestion situation arises. It results in energy consumption, loss of packets, buffer overflow, and raises end-to-end delay. In this paper, adaptive buffer switching and Congestion Control management are done effectively. Simultaneously, congestion detects based on residual energy, residual buffer space, and sensor nodes conviction level. This methodology shows based on the evaluation of cost, which selects main and spare buffers adaptively. Dynamic buffer switching and swapping are used to enhance the outcome of congestion. Result of the ABETCC approach is compared with the protocol like TCEER and TFCC compared to the data loss ratio and energy consumption

Download Full-text

Highly Reliable Routing In Healthcare Systems Based on Internet of Things

10.21203/rs.3.rs-468326/v1 ◽

2021 ◽

Author(s):

Saeed Javid ◽

Abbas Mirzaei

Keyword(s):

Energy Consumption ◽

Internet Of Things ◽

Healthcare Systems ◽

Residual Energy ◽

Body Sensor Networks ◽

Healthcare Applications ◽

Data Packets ◽

Reliable Routing ◽

Novel Method

Abstract Healthcare is an important application of Internet of things (IoT) and body sensor networks (BSNs). Known as a method of measuring and collecting data in healthcare applications, a BSN must provide more reliable routing. Therefore, it is necessary to develop a method for reducing communication rates and improving reliability in healthcare systems. This paper proposes a novel method for routing data packets to enhance reliability in IoT-based healthcare systems. Given the nature of healthcare systems and importance of energy consumption, the proposed method employs different criteria (residual energy and variance of distance from neighbours) to perform the routing process. The results of implementing the proposed method indicated its acceptable performance in comparison with LSR, OLSR, and MAEB protocols. The method also managed to achieve the goals of retaining the quality of packets received by the sink and reducing energy consumption in healthcare systems.

Download Full-text

Joint Next-Hop/Relay Selection for Distributive Multihop Cooperative Networks

Discrete Dynamics in Nature and Society ◽

10.1155/2015/613168 ◽

2015 ◽

Vol 2015 ◽

pp. 1-10 ◽

Cited By ~ 10

Author(s):

Ahmed Alkhayyat

Keyword(s):

Spectral Efficiency ◽

Relay Selection ◽

Relay Node ◽

Cooperative Networks ◽

Channel Fading ◽

Relay Nodes ◽

Effective Technique ◽

Node Selection ◽

Relay Node Selection ◽

Selection For

Cooperative networks that use adjacent nodes to relay hearing data are employed as an effective technique to deal with channel fading, thereby enhancing the network performances. Next-hop and relay nodes selection schemes determine the optimal next-hop node toward the destination and relay node between the source and the optimal next-hop and/or destination. Offering joint next-hop and relay node selection in distributive multihop cooperative networks will enable the source to select the optimal next-hop node and relay node that can improve the system performance. In this paper, we propose a joint next-hop node and relay node selection (JNRS) protocol for wireless distributive multihop cooperative networks. The goal of JNRS is to reduce the spectral efficiency loss and outage probability. Analysis results show that JNRS can enhance the cooperative networks performance under general conditions compared to cooperative networks without the JNRS protocol.

Download Full-text

Priority-Based Pipelined-Forwarding MAC Protocol for EH-WSNs

Wireless Communications and Mobile Computing ◽

10.1155/2019/5418516 ◽

2019 ◽

Vol 2019 ◽

pp. 1-7 ◽

Cited By ~ 1

Author(s):

Kyuwook Shim ◽

Hyung-Kun Park

Keyword(s):

Energy Harvesting ◽

Mac Protocol ◽

Real Life ◽

Relay Node ◽

Medium Access Control Protocols ◽

Medium Access ◽

Relay Nodes ◽

End To End Delay ◽

Power And Energy ◽

Residual Power

To reduce the end-to-end delay in EH-WSNs (energy-harvesting wireless sensor networks), medium access control protocols using pipelined-forwarding have been introduced and studied. In real-life applications, there are several situations where it is difficult to harvest more energy than the energy consumed. Therefore, it is crucial to design a MAC protocol that allows nodes to efficiently relay data without exhausting the power in pipelined-forwarding multihop transmission. In this paper, we propose a PP-MAC (priority-based pipelined-forwarding MAC) protocol that determines the priority of relay nodes based on the residual power and energy-harvesting rate. The proposed protocol determines the probability of a node becoming a relay node based on the priority of the node and attempts to access the channel in a distributed manner. Furthermore, the PP-MAC protocol controls the sleep interval based on the power conditions of the nodes. It also minimizes the power exhaustion problem by controlling the sleep interval based on the priority of the nodes. The performance of the proposed PP-MAC was evaluated via computer simulation, and the results indicated that PP-MAC could improve the network lifetime by mitigating the power imbalance of nodes.

Download Full-text

Improvement of Hierarchical Routing Algorithm in Wireless Sensor Network

International Journal of Online and Biomedical Engineering (iJOE) ◽

10.3991/ijoe.v15i01.9780 ◽

2019 ◽

Vol 15 (01) ◽

pp. 71

Author(s):

Yinghui Yang ◽

Qunting Yang ◽

Tiegang Gao

Keyword(s):

Energy Consumption ◽

Routing Algorithm ◽

Average Energy ◽

Residual Energy ◽

Optimal Number ◽

Simulation Software ◽

Data Packets ◽

Advantages And Disadvantages ◽

Cluster Heads ◽

Average Energy Consumption

To prolong the life cycle of the network and increase the effective data transmission quantity of the network, several classic network layer routing algorithms are analyzed and they are implemented with programming language, which verifies their real advantages and disadvantages. In the model of ring networking, the optimal number of cluster heads in the annular region is deduced with the goal of minimizing the average energy consumption of cluster heads in each ring,and the formation mechanism of cluster heads is proposed for the purpose of preferentially using nodes with more residual energy as cluster heads.To further optimize energy consumption performance, a dynamic self-organizing multi-hop routing selection mode is proposed.Finally, the network simulation software is applied to construct the model based on ring network, and the optimization algorithm is adopted to obtain the flow chart of actual programming and some programming methods.The results show that the proposed algorithm achieves the ultimate optimization goal, which increases the number of effective monitoring data packets.

Download Full-text