scholarly journals Improving Route Selections in ZigBee Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 164 ◽  
Author(s):  
Srikar Meka ◽  
Benedito Fonseca
Keyword(s):  
Home Environment ◽  
Link Quality ◽  
Wireless Sensor ◽  
Medium Access ◽  
Successful Transmission ◽  
Zigbee Protocol ◽  
Link Cost ◽  
Simulation Results ◽  
Route Cost ◽  
Better Than

The ZigBee wireless communication specifications forecast the use of multihop routes between nodes and define that nodes select their routes based on their costs. The specifications define how to compute a route cost from the probability of successfully transmitting on each of the routes’ links; and it is recommended that such probabilities be obtained by counting received link status messages or averaging link quality indicators from received packets. In this paper, we study the performance of these two recommended procedures, show that they can lead to degraded route selections, and propose a procedure that can improve route selections without modifications to the ZigBee protocol or frame formats. Our procedure estimates the probability of successful transmission on each link, based on information from the medium access layer during unicast packet transmissions, and includes a modification into how ZigBee nodes treat routing messages internally in order to reduce variations in the link cost estimates. Focusing on a home environment with one or two hops, our simulation results show that, in several scenarios, our procedure performs better than either of the two procedures recommended in the ZigBee specifications.

LDFS: Localized Depth First Search for Member Loss Detection of Moving Group in Wireless Networks

2013 ◽  
Vol 378 ◽  
pp. 558-564
Author(s):  
Wei Li Chang ◽  
Eric Hsiaokuang Wu ◽  
Min Te Sun ◽  
Ching Hsiang Chu
Keyword(s):  
Dynamic Networks ◽  
Wireless Sensor ◽  
Point Problem ◽  
P2p Networks ◽  
Accuracy Rate ◽  
System A ◽  
Simulation Results ◽  
Pass Through ◽  
Message Overhead ◽  
Better Than

In a distributed system, a portion of nodes are more critical than others, and named them articulation points, all paths between certain nodes have to pass through these points. Most of previous works try to detect the articulation point problem in static networks such as wireless sensor networks, P2P networks. In dynamic networks, as group moving behavior, it is a challenge to detect articulation points because these nodes are moving with time. Group moving in this paper means that a group of mobile members move from one place to another place with different directions and speeds. We aim to propose a distributed LDFS algorithm to check the articulation points in dynamic networks, such as a moving group. The algorithm sets the number of hops for traversing and multiple initiators to reduce message overhead and improve the accuracy rate. In simulations, we design several schemes to compare message overhead, and correctness. Simulation results show that our scheme is better than GlobalDFS and CUD scheme. The scheme could be applied on different applications and is efficient helping us to save and alarm loss on group moving.

GTMA: Localization in Wireless Sensor Network Based a Group of Tri-Mobile Anchors

2017 ◽  
Vol 14 (1) ◽  
pp. 847-857 ◽  
Author(s):  
Bassam Gumaida ◽  
Chang Liu ◽  
Juan Luo
Keyword(s):  
High Accuracy ◽  
Outdoor Environment ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Target Node ◽  
Localization Accuracy ◽  
Mobile Anchor ◽  
Trajectory Mapping ◽  
Simulation Results ◽  
Better Than

Sensors positioning with high accuracy is a fundamental stone in Wireless Sensor Networks (WSNs). In outdoor environment which is hostile and unreachable, mobile anchors method is considered as an appropriate solution for locating unknown nodes. In this case, the key problems are the trajectory mapping and the needed number of mobile anchors. These mobile anchors should travel along the trajectory in order to determine the positions of unknown nodes with minimum localization error. In this paper, a localization algorithm named Group of Tri-Mobile Anchors (GTMA) is proposed, which is based on a group of tri-mobile anchors with adjustable square trajectory in the deployment area. The position of a target node is calculated by Trilateration. Simulation results show that the performance of the proposed algorithm GTMA is better than that of other algorithms adopted one mobile anchor, e.g., HILBERT, LMAT and SPIRAL algorithms. This is clearly evident in both the localization accuracy and trajectory planning.

scholarly journals Maximizing Lifetime of Barrier Coverage Wireless Sensor Network with Tell Neighbor Algorithm

2019 ◽  
Vol 4 (3) ◽  
pp. 775-785
Author(s):  
Vinay Chowdary ◽  
Mukul Kumar Gupta ◽  
Sushabhan Choudhury
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Barrier Coverage ◽  
Recent Past ◽  
Operating Lifetime ◽  
Simulation Results ◽  
State Of Art ◽  
Better Than

The maximizing lifetime of Barrier coverage in wireless sensor network has attracted researchers in recent past. In barrier coverage applications it is essential to prolong the lifetime of sensor networks which guarantees extended operating lifetime of the overall network. In this paper, we propose a novel Tell Neighbor Algorithm (TNA), which increases the operating lifetime of the overall network. Simulation results show that the lifetime obtained by TNA is better than some of the already existing state-of-art algorithms. Lifetime obtained by TNA is doubled when compared already existing algorithms.

scholarly journals Designing a Channel Access Mechanism for Wireless Sensor Network

2017 ◽  
Vol 2017 ◽  
pp. 1-31 ◽  
Author(s):  
Basma M. Mohammad El-Basioni ◽  
Abdellatif I. Moustafa ◽  
Sherine M. Abd El-Kader ◽  
Hussein A. Konber
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Performance Tuning ◽  
Wireless Sensor ◽  
Tuning Parameter ◽  
Channel Access ◽  
Medium Access ◽  
Average Delay ◽  
Multihop Communication ◽  
Better Than

Although there are various Medium Access Control (MAC) protocols proposed for Wireless Sensor Network (WSN), there is no protocol accepted as a standard specific to it. This paper deals with completing the design of our previously proposed MAC for WSN by proposing a channel access mechanism (CAM). The CAM is based on developing a backoff mechanism which mainly differentiates nodes’ backoffs depending on their different identification numbers, and it employs a performance tuning parameter for reaching a required performance objective. The probability distribution of the backoff period is constructed and Markov chain modeling is used to analyze and evaluate the CAM against the IEEE802.15.4 slotted CSMA/CA based on single- and multihop communication with respect to the reliability, the average delay, the power consumption, and the throughput. The analysis reveals that the required performance of CAM against the IEEE slotted CSMA/CA can be obtained by choosing the maximum backoff stages number and the tuning parameter value and that CAM performs better than the IEEE with larger nodes number. The multihop scenario results in a good end-to-end performance of CAM with respect to the reliability and delay becomes better with lengthier paths at the expense of increasing the energy consumption.

scholarly journals Combining Kalman Filtering with ZigBee Protocol to Improve Localization in Wireless Sensor Network

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Bouchra El Madani ◽  
Anne Paule Yao ◽  
Abdelouahid Lyhyaoui
Keyword(s):  
Low Cost ◽  
Link Quality ◽  
Wireless Sensor ◽  
Cooperative Approach ◽  
Localization Scheme ◽  
Zigbee Protocol ◽  
Localization Performance ◽  
Link Quality Indicator ◽  
Main Ideas

We propose a low-cost and low-power-consumption localization scheme for ZigBee-based wireless sensor networks (WSNs). Our design is based on the link quality indicator (LQI)—a standard feature of the ZigBee protocol—for ranging and the ratiometric vector iteration (RVI)—a light-weight distributed algorithm—modified to work with LQI measurements. To improve performance and quality of this system, we propose three main ideas: a cooperative approach, a coefficient delta () to regulate the speed of convergence of the algorithm, and finally the filtering process with the extended Kalman filter. The results of experiment simulations show acceptable localization performance and illustrate the accuracy of this method.

scholarly journals Data Collection and Medium Access Control Solutions for Underwater Wireless Sensor Networks

2021 ◽  
Author(s):  
Eduardo P. M. Câmara Júnior ◽  
Luiz F. M. Vieira ◽  
Marcos A. M. Vieira
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Communication Technology ◽  
Mac Protocol ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Medium Access ◽  
Existing Problems ◽  
Better Than

Underwater wireless sensor networks (UWSNs) can enable many applications in underwater environments. They face many challenges due to the characteristics of these environments and their use of acoustic or optical communications. Here we propose solutions for two existing problems in UWSNs. One of them is CAPTAIN, a cluster-based routing solution that explores the best of each communication technology to improve data collection. We also propose UW-SEEDEX, a MAC protocol that employs random time slot schedules to allow nodes to predict each other’s transmission schedules to avoid collisions. Through simulations, we show how both proposed solutions perform better than other solutions from the literature.

An Obstacle-resistant Relay Node Placement in Constrained Environment

2019 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Robots ◽  
Relay Node ◽  
Wireless Sensor ◽  
Relay Node Placement ◽  
Node Placement ◽  
Simulation Results ◽  
Additional Hardware ◽  
Shape And Size

Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement strategy (ORRNP). The proposed solution not only handles the obstacles but also estimates best locations for relay node placement in the network. It also does not involve any additional hardware (mobile robots) to estimate node locations thus can significantly reduce the deployment costs. Simulation results show the effectiveness of our proposed approach.

Sign in / Sign up

Export Citation Format

Share Document