Delaunay Network Topology Generation Algorithm for Wireless Sensor Networks

2013 ◽  
Vol 11 (6) ◽  
pp. 1036-1041 ◽  
Author(s):  
Huarui Wu ◽  
Ronghua Gao
Author(s):  
Vladimir Vasilevich Fedorenko ◽  
Vladimir Valerevich Samoylenko ◽  
Daria Vladimirovna Alduschenko ◽  
Igor Vladimirovich Emelyanenko

The article presents the analysis of developing methods of wireless sensor networks (WSNs) topologies based on a graph structure. It indicates the prevalence of tolerance criteria for de-scribing the links between nodes, for example, the limiting distance of radio communication, a sufficient ratio of signal/energy (interference + noise). To consider the impact of inter-node interference on the network topology it is proposed to use the permissible values of bit error probabilities or erasing an information packet in case of distortion of at least one its elements as a criterion for stable communication. The algorithm for calculating an analytical model of internode communication channel is presented to evaluate the effect of intra-network additive and multiplicative noise on the reliability indicator of incoherent message reception in the form of a bit error rate. Expression for the coefficient of structural interaction of the received signal and the interference complex is obtained, which allows considering the dependence of bit error rate on the energy components of individual interference at the receiver input, frequency separation value of a signal and values of each disturbance, their phase shifts and the duration of the information bit. There has been considered practical application of the WSNs topology modeling technique for the internode communication channels with Rice fading of a useful signal and Rayleigh fading of an intra-network interference complex (a case study of using CC2500 modems as part of WSNs nodes). As a result of analysis, there have been determined the relations between nodes, for which the bit error rates do not exceed the allowable value established by requirements for channel capacity and the length of information packets. The presented modeling approach proves the possibility of improving the network topology due to developing the internode links by redistributing the frequency resource between the nodes or adjusting the operation modes of the modems.


Sensors ◽  
2019 ◽  
Vol 19 (13) ◽  
pp. 3020 ◽  
Author(s):  
Linh-An Phan ◽  
Taejoon Kim ◽  
Taehong Kim ◽  
JaeSeang Lee ◽  
Jae-Hyun Ham

The time synchronization protocol is indispensable in various applications of wireless sensor networks, such as scheduling, monitoring, and tracking. Numerous protocols and algorithms have been proposed in recent decades, and many of them provide micro-scale resolutions. However, designing and implementing a time synchronization protocol in a practical wireless network is very challenging compared to implementation in a wired network; this is because its performance can be deteriorated significantly by many factors, including hardware quality, message delay jitter, ambient environment, and network topology. In this study, we measure the performance of the Flooding Time Synchronization Protocol (FTSP) and Gradient Time Synchronization Protocol (GTSP) in terms of practical network conditions, such as message delay jitter, synchronization period, network topology, and packet loss. This study provides insights into the operation and optimization of time synchronization protocols. In addition, the performance evaluation identifies that FTSP is highly affected by message delay jitter due to error accumulation over multi-hops. We demonstrate that the proposed extended version of the FTSP (E-FTSP) alleviates the effect of message delay jitter and enhances the overall performance of FTSP in terms of error, time, and other factors.


2011 ◽  
Vol 474-476 ◽  
pp. 1221-1227
Author(s):  
Ying Liao ◽  
Wei Xu Hao

Wireless sensor networks (WSNs) detect and monitor the outside physical state by the sensor nodes organizing automatically. Utilizing clustering algorithm to form hierarchical network topology is the common method which implements managing network and aggregating data in WSNs. Different from the previous clustering algorithms, this article proposes a clustering algorithm for WSNs based on distance and distribution to generate clusters considering residual energy of nods in WSNs with inhomogeneous distribution. The simulation result indicates that the algorithm can establish more balanceable clustering structure effectively and enhance the network life cycle obviously.<b></b>


Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 458
Author(s):  
Sangdae Kim  ◽  
Cheonyong Kim  ◽  
Hyunchong Cho  ◽  
Kwansoo Jung 

As many industrial applications require real-time and reliability communication, a variety of routing graph construction schemes were proposed to satisfy the requirements in Industrial Wireless Sensor Networks (IWSNs). Each device transmits packet through a route which is designated based on the graph. However, as existing studies consider a network consists of static devices only, they cannot cope with the network changes by movement of mobile devices considered important in the recent industrial environment. Thus, the communication requirements cannot be guaranteed because the existing path is broken by the varying network topology. The communication failure could cause critical problems such as malfunctioning equipment. The problem is caused repeatedly by continuous movement of mobile devices, even if a new graph is reconstructed for responding the changed topology. To support mobile devices exploited in various industrial environments, we propose a Hierarchical Routing Graph Construction (HRGC). The HRGC is consisted of two phases for hierarchical graph construction: In first phase, a robust graph called skeleton graph consisting only of static devices is constructed. The skeleton graph is not affected by network topology changes and does not suffer from packet loss. In second phase, the mobile devices are grafted into the skeleton graph for seamless communication. Through the grafting process, the routes are established in advance for mobile device to communicate with nearby static devices in anywhere. The simulation results show that the packet delivery ratio is improved when the graph is constructed through the HRGC.


Sign in / Sign up

Export Citation Format

Share Document