scholarly journals Improving Packet Delivery Performance of Publish/Subscribe Protocols in Wireless Sensor Networks

Sensors ◽  
2013 ◽  
Vol 13 (1) ◽  
pp. 648-680 ◽  
Author(s):  
Ernesto Davis ◽  
Anna Calveras ◽  
Ilker Demirkol
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Packet Delivery ◽  
Delivery Performance

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

2020 ◽  
Vol 10 (1) ◽  
pp. 63-78
Author(s):  
Neetika Jain ◽  
Sangeeta Mittal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Resource Constraints ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Packet Delivery ◽  
High Data ◽  
Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

scholarly journals Developing of Bluetooth mesh flooding between source-destination linking of nodes in wireless sensor networks

2021 ◽  
Vol 6 (9 (114)) ◽  
pp. 6-14
Author(s):  
Shaymaa Kadhim Mohsin ◽  
Maysoon A. Mohammed ◽  
Helaa Mohammed Yassien
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Packet Delivery Ratio ◽  
Mesh Network ◽  
Wireless Sensor ◽  
Destination Node ◽  
Delivery Ratio ◽  
Area Network ◽  
Hop Count ◽  
Packet Delivery

Bluetooth uses 2.4 GHz in ISM (industrial, scientific, and medical) band, which it shares with other wireless operating system technologies like ZigBee and WLAN. The Bluetooth core design comprises a low-energy version of a low-rate wireless personal area network and supports point-to-point or point-to-multipoint connections. The aim of the study is to develop a Bluetooth mesh flooding and to estimate packet delivery ratio in wireless sensor networks to model asynchronous transmissions including a visual representation of a mesh network, node-related statistics, and a packet delivery ratio (PDR). This work provides a platform for Bluetooth networking by analyzing the flooding of the network layers and configuring the architecture of a multi-node Bluetooth mesh. Five simulation scenarios have been presented to evaluate the network flooding performance. These scenarios have been performed over an area of 200×200 meters including 81 randomly distributed nodes including different Relay/End node configurations and source-destination linking between nodes. The results indicate that the proposed approach can create a pathway between the source node and destination node within a mesh network of randomly distributed End and Relay nodes using MATLAB environment. The results include probability calculation of getting a linking between two nodes based on Monte Carlo method, which was 88.7428 %, while the Average-hop-count linking between these nodes was 8. Based on the conducted survey, this is the first study to examine and demonstrate Bluetooth mesh flooding and estimate packet delivery ratio in wireless sensor networks

scholarly journals End-To-End Delay Optimization in Wireless Sensor Network (WSN)

2012 ◽  
pp. 247-251
Author(s):  
Shweta K. Kanhere ◽  
Mahesh Goudar ◽  
Vijay M. Wadhai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Central System ◽  
Neighboring Node ◽  
Packet Delivery ◽  
End To End

In this paper, we are interested in optimizing the delay of event-driven wireless sensor networks, for which events does not occur frequently. In such systems, most of the energy is consumed when the radios are on, waiting for an arrival to occur. Sleep-wake scheduling is an effective mechanism to prolong the lifetime of this energy constrained wireless sensor networks by optimization of the delay in the network but this scheme could result in substantial delays because a transmitting node needs to wait for its next-hop relay node to wake up. An attempt has been made to reduce these delays by developing new method of packet forwarding schemes, where each nod opportunistically forwards a packet to the its neighboring node that wakes up among multiple candidate nodes. In this paper, the focus is to study how to optimize the packet forwarding schemes by optimization of the expected packet-delivery delays from the sensor nodes to the sink. Based on optimized delay scheme result, we then provide a solution to the central system about how to optimally control the system parameters of the sleep-wake scheduling protocol and the packet forwarding protocol to maximize the network lifetime, subject to a constraint on the expected end-to-end packet delivery delay. Our numerical results indicate that the proposed solution can outperform prior heuristic solutions in the literature, especially under the practical scenarios where there are obstructions, e.g., a lake or a mountain, in the area of wireless sensor networks.

scholarly journals An efficient traffic contention and control mechanism to improve QoS in heterogeneous wireless sensor networks

2020 ◽  
Vol 20 (2) ◽  
pp. 968
Author(s):  
Kavitha Ganesh ◽  
P. Latchoumy ◽  
A. Sonya
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Data Transfer ◽  
Packet Delivery Ratio ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Heterogeneous Wireless Sensor Networks ◽  
And Control

<span>Heterogeneous Wireless Sensor Networks (HWSN) gathers information from a cooperative network. In HWSN, the sensor nodes are scattered and the major challenges are topology control, battery optimization, packet loss and link lifetime. The existing techniques do not concentrate on all the mentioned issues. The objective of this work is to provide congestion-free data transfer with higher throughput and increased packet delivery ratio. In the proposed methodology, three protocols are designed and developed, namely, Hop by Hop Rate Adjustment Protocol (HHRA), Energy Efficient Data Transfer Protocol (EEDT) and Alternative Routing Congestion Control Protocol (ARCC). The HHRA protocol senses the traffic in the channel and adjusts the transmission rate accordingly to avoid congestion. Secondly, the EEDT protocol is used to find specific nodes that are more efficient and transfer packets through those nodes to improve throughput. The ARCC protocol is used to redirect the path of transmission during the occurrence of congestion. Thus, the proposed traffic contention and control mechanisms ensures congestion free transmission and increases the packet delivery ratio by 23% and average throughput by 20% compared to the Dynamic Contention Window based Congestion Control (DCWCC) algorithm. </span>

scholarly journals RDCPF: A Redundancy-Based Duty-Cycling Pipelined-Forwarding MAC for Linear Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (19) ◽  
pp. 5608
Author(s):  
Quanwei Zhang ◽  
Dazhong Li ◽  
Yue Fei ◽  
Jiakang Zhang ◽  
Yu Chen ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sleep Latency ◽  
Wireless Sensor ◽  
Sink Node ◽  
Duty Cycling ◽  
Energy Hole ◽  
Packet Delivery

Existing duty-cycling and pipelined-forwarding (DCPF) protocols applied in battery-powered wireless sensor networks can significantly alleviate the sleep latency issue and save the energy of networks. However, when a DCPF protocol applies to a linear sensor network (LSN), it lacks the ability to handle the bottleneck issue called the energy-hole problem, which is mainly manifested due to the excessive energy consumption of nodes near the sink node. Without overcoming this issue, the lifespan of the network could be greatly reduced. To that end, this paper proposes a method of deploying redundant nodes in LSN, and a corresponding enhanced DCPF protocol called redundancy-based DCPF (RDCPF) to support the new topology of LSN. In RDCPF, the distribution of energy consumption of the whole network becomes much more even. RDCPF also brings improvements to the network in terms of network survival time, packet delivery latency, and energy efficiency, which have been shown through the extensive simulations in comparison with existing DCPF protocols.

Sign in / Sign up

Export Citation Format

Share Document