scholarly journals Efficient Link Scheduling Based on Estimated Number of Packets in Queue on Industrial Wireless Sensor Networks

Energies ◽  
2021 ◽  
Vol 14 (19) ◽  
pp. 6370
Author(s):  
Myung-Kyun Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
The Other ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Industrial Wireless Sensor Networks ◽  
End To End Delay ◽  
Other Hand ◽  
End To End

The links of low power wireless sensor networks are error prone and the transmission on a wireless link is determined probabilistically by the packet reception rate (PRR) of the link. On the other hand, there is a very strict requirement in the end-to-end reliability and delay of sensor data in industrial wireless sensor networks (IWSNs). The existing approaches to provide the end-to-end reliability in IWSNs is retransmitting the packet when failure occurs. These approaches transmit a packet multiple times in successive time slots to provide the required reliability. These approaches, however, can increase the average delay of packets and the number of packets buffered in a queue. This paper proposes a new scheme to estimate the probabilistic amount of packets, called queue level (QL), in the buffer of each node based on the PRRs of the wireless links. This paper also proposes a QL-based centralized scheduling algorithm to assign time slots efficiently in TDMA-based IWSNs. The proposed scheduling algorithm gives higher priority to the nodes with higher QL. By assigning time slots first to the node with the highest QL, we can reduce the average end-to-end delay of packets and reduce the amount of buffered packets in the queue while satisfying the required end-to-end reliability. The performance of the proposed scheduling algorithm have been evaluated through a simulation using the Cooja simulator and compared with the existing approach. In the simulation on an sample network with the target end-to-end reliability of 99%, all of the flows were shown to guarantee the target reliability in both algorithms: on average, 99.76% in the proposed algorithm and 99.85% in the existing approach. On the other hand, the proposed algorithm showed much better performance than the existing approach in terms of the average end-to-end delay of packets (about 47% less) and the number of maximally buffered packets in the queue of each node (maximally, more than 90% less).

scholarly journals Quantitative Invulnerability Analysis of Artificial Spider-Web Topology Model Based on End-to-End Delay

2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhitao He
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Analysis Method ◽  
Communication Performance ◽  
Spider Web ◽  
End To End Delay ◽  
Topology Model ◽  
Practical Analysis ◽  
End To End

This paper presents an artificial spider-web topology model inspired by the structure and invulnerability of a spider web. A hierarchical clustering routing rule is accordingly established using the vibration transmission features of the natural spider web as a reference. Furthermore, the end-to-end delay is applied as the quantitative indicator of invulnerability for analyzing the communication performance and characteristics of the artificial spider-web topology. The simulation tests of a one-layer and 3-layer artificial spider-web model are implemented to obtain the importance and destructive tolerance of network components based on OPNET, with the change of communication conditions and fault types. This paper can provide a practical analysis method for the invulnerability of the artificial spider-web topology and offer important implications for the construction and maintenance of wireless sensor networks based on the topology.

scholarly journals An Energy Efficient Data Gathering in Dense Mobile Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
R. Velmani ◽  
B. Kaarthick
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Cluster Formation ◽  
Cluster Head ◽  
Data Gathering ◽  
Wireless Sensor ◽  
End To End Delay ◽  
End To End

Amidst of the growing impact of wireless sensor networks (WSNs) on real world applications, numerous schemes have been proposed for collecting data on multipath routing, tree, clustering, and cluster tree. Effectiveness of WSNs only depends on the data collection schemes. Existing methods cannot provide a guaranteed reliable network about mobility, traffic, and end-to-end connection, respectively. To mitigate such kind of problems, a simple and effective scheme is proposed, which is named as cluster independent data collection tree (CIDT). After the cluster head election and cluster formation, CIDT constructs a data collection tree (DCT) based on the cluster head location. In DCT, data collection node (DCN) does not participate in sensing, which is simply collecting the data packet from the cluster head and delivering it into sink. CIDT minimizes the energy exploitation, end-to-end delay and traffic of cluster head due to transfer of data with DCT. CIDT provides less complexity involved in creating a tree structure, which maintains the energy consumption of cluster head that helps to reduce the frequent cluster formation and maintain a cluster for considerable amount of time. The simulation results show that CIDT provides better QoS in terms of energy consumption, throughput, end-to-end delay, and network lifetime for mobility-based WSNs.

Sign in / Sign up

Export Citation Format

Share Document