Cost-effective design and evaluation of wireless sensor networks using topology-planning methods in small-world context

2014 ◽  
Vol 4 (2) ◽  
pp. 43-53 ◽  
Author(s):  
Navid Tadayon ◽  
Liudong Xing ◽  
Amir Ehsani Zonouz ◽  
Sonia Aïssa
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Small World ◽  
Cost Effective ◽  
Wireless Sensor ◽  
Planning Methods ◽  
Effective Design

A Novel Static Path Planning Method for Mobile Anchor-Assisted Localization in Wireless Sensor Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Abdelhady M. Naguib ◽  
Shahzad Ali
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Path Planning ◽  
Sensor Node ◽  
Large Scale ◽  
Performance Metrics ◽  
Wireless Sensor ◽  
Anchor Node ◽  
Mobile Anchor ◽  
Planning Methods

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Objectives: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.

A Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

On the Analysis of Newman & Watts and Kleinberg Small World Models in Wireless Sensor Networks

2015 ◽  
Author(s):  
Renan Pereira Araujo ◽  
Fernanda Sumika Hojo De Souza ◽  
Jo Ueyama ◽  
Leandro Aaparecido Villas ◽  
Daniel Ludovico Guidoni
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Small World ◽  
Wireless Sensor

A small world model to improve synchronization algorithms for wireless sensor networks

2010 ◽  
Author(s):  
Daniel L. Guidoni ◽  
Azzedine Boukerche ◽  
Horacio A. B. F. Oliveira ◽  
Raquel A. F. Mini ◽  
Antonio A. F. Loureiro
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Small World ◽  
Wireless Sensor ◽  
World Model

Small-World-Network Model Based Routing Method for Wireless Sensor Networks

2016 ◽  
Vol E99.B (11) ◽  
pp. 2315-2322
Author(s):  
Nobuyoshi KOMURO ◽  
Sho MOTEGI ◽  
Kosuke SANADA ◽  
Jing MA ◽  
Zhetao LI ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Model ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Model Based ◽  
Routing Method

An Effective Self-Adapting Localization Algorithm in Wireless Sensor Networks

2011 ◽  
Vol 58-60 ◽  
pp. 1013-1017 ◽  
Author(s):  
Fu Fang Li ◽  
Fei Luo ◽  
Jian Xiong Wang ◽  
De Yu Qi ◽  
Guo Wen Xie
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Theory ◽  
Hot Spot ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Localization Algorithm ◽  
Challenging Problem ◽  
Measured Distance

Research on nodes localization in Wireless Sensor Networks (WSN) has been a hot spot in recent years. How to improve the reliability and accuracy of nodes localization is a hard and challenging problem in the area, and is far to be solved satisfactorily. This paper proposes an effective self-adapting localization algorithm in WSN based on optimized RSSI and DV-Distance algorithm. In order to enhance the precision of localization, the presented algorithm introduces an effective method to reduce the error of RSSI-measured distance. The algorithm also uses Small-World-Network theory to help select beacon nodes from localized normal nodes, so as to raise the performance and efficiency. Experimental results show that the algorithm has effectively improved the accuracy, self adaptivity, performance and efficiency of nodes localization in WSN.

Sign in / Sign up

Export Citation Format

Share Document