Definition and Evaluation of Local Path Recovery Mechanisms in Wireless Sensor and Actuator Networks

2009 ◽  
Author(s):  
Pieter De Mil ◽  
Eli De Poorter ◽  
Benoît Latre ◽  
Ingrid Moerman ◽  
Piet Demeester
Keyword(s):  
Wireless Sensor ◽  
Recovery Mechanisms ◽  
Local Path

Fast Re-Association Scheme in Beacon-Enabled Wireless Sensor Networks

2011 ◽  
Vol 403-408 ◽  
pp. 145-149
Author(s):  
Sheng Dong Xie ◽  
Huan Cheng
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Association Scheme ◽  
Wireless Sensor ◽  
Recovery Mechanisms ◽  
Physical Address ◽  
The Coordinator

Zigbee has been considered as a promising standard for wireless sensor networks. There are two recovery mechanisms when node is orphaned. Although an orphan realignment mechanism is provided in Zigbee, it is only suitable for orphaned node associating with the coordinator which has 64-bit physical address of the orphaned node, and not suitable for beacon enabled network. And the re-association mechanism is time consuming because there is a long delay for channel scan before association. In this paper, we propose a fast re-association scheme for beacon enabled network based on Zigbee, in which the passive channel scan is not needed before association. Orphaned node selects the coordinator which has the highest estimation value. Because the channel scan is not needed, the re-association delay could be reduced greatly.

Dynamic Update Mechanism in Wireless Sensor Networks

2014 ◽  
Vol 526 ◽  
pp. 267-272 ◽  
Author(s):  
Wu Min Pan
Keyword(s):  
Flash Memory ◽  
Sensor Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Memory Space ◽  
Dynamic Update ◽  
Host Machine ◽  
Recovery Mechanisms ◽  
Application Requirements ◽  
Failed Node

Many researches use diff environmental conditions or application requirements in WSN. In the default Deluge mechanism, it will recover a sensor node from an updating error by reloading the stored full image again or waiting for the host machine to retransmit the full image again. This strategy is easy to implement and intuitive, but replacing the current executing image by retransmitting a full image file again is resource-consuming. To avoid retransmitting the full image when performing recovery, at the time when diff-based updating procedures have been finished, sensor nodes using our recovery mechanisms will backup the received patch files (i.e. diff script) in flash memory. Our mechanisms would effectively utilize flash memory space to store several backup patch files. When recovery is needed, our mechanismswould incrementally recover a failed node by patching up the system with each of the backup patch files. In the design of our recovery mechanisms, the failed sensor node will first try its best to recover itself without the assistance of the host machine, in order to avoid affecting the operations of other normal nodes when performing recovery procedures. Thus, compared with the full image replacement strategy, our mechanisms can save many computing resources.

Interference mitigation in point to point wireless sensor networks using LSP protocol and time division multiplexing approach

2020 ◽  
Vol 39 (4) ◽  
pp. 5449-5458
Author(s):  
A. Arokiaraj Jovith ◽  
S.V. Kasmir Raja ◽  
A. Razia Sulthana
Keyword(s):  
Energy Consumption ◽  
Large Scale ◽  
Control Parameter ◽  
Interference Mitigation ◽  
Wireless Sensor ◽  
Point To Point ◽  
A Minor ◽  
Two Stages ◽  
Time Division ◽  
And Control

Interference in Wireless Sensor Network (WSN) predominantly affects the performance of the WSN. Energy consumption in WSN is one of the greatest concerns in the current generation. This work presents an approach for interference measurement and interference mitigation in point to point network. The nodes are distributed in the network and interference is measured by grouping the nodes in the region of a specific diameter. Hence this approach is scalable and isextended to large scale WSN. Interference is measured in two stages. In the first stage, interference is overcome by allocating time slots to the node stations in Time Division Multiple Access (TDMA) fashion. The node area is split into larger regions and smaller regions. The time slots are allocated to smaller regions in TDMA fashion. A TDMA based time slot allocation algorithm is proposed in this paper to enable reuse of timeslots with minimal interference between smaller regions. In the second stage, the network density and control parameter is introduced to reduce interference in a minor level within smaller node regions. The algorithm issimulated and the system is tested with varying control parameter. The node-level interference and the energy dissipation at nodes are captured by varying the node density of the network. The results indicate that the proposed approach measures the interference and mitigates with minimal energy consumption at nodes and with less overhead transmission.

Energy Efficiency Analysis in ERA using NFL-BA Algorithm

2020 ◽  
pp. 340-348
Author(s):  
Palky Mehta ◽  
H. L. Sharma
Keyword(s):  
Cluster Head ◽  
Vital Role ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Cluster Heads ◽  
Comparison Results ◽  
Current Scenario ◽  
Energy Efficiency Analysis ◽  
Selection Of

In the current scenario of Wireless Sensor Network (WSN), power consumption is the major issue associated with nodes in WSN. LEACH technique plays a vital role of clustering in WSN and reduces the energy usage effectively. But LEACH has its own limitation in order to search cluster head nodes which are randomly distributed over the network. In this paper, ERA-NFL- BA algorithm is being proposed for selects the cluster heads in WSN. This algorithm help in selection of cluster heads can freely transform from global search to local search. At the end, a comparison has been done with earlier researcher using protocol ERA-NFL, which clearly shown that proposed Algorithm is best suited and from comparison results that ERA-NFL-BA has given better performance.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Sign in / Sign up

Export Citation Format

Share Document