Deployment Strategies for Wireless Sensor Networks

Author(s):  
Ruay-Shiung Chang ◽  
Shuo-Hung Wang

In this chapter, we study the deployment problem in wireless sensor networks. The deployment affects the efficiency and the effectiveness of sensor networks. We discuss different types of deployment strategies including deterministic or random deployment, and centralized or distributed deployment. We also review the measures of deployment while considering the connectivity and coverage in detail. The best coverage and the worst coverage are also discussed. An important issue is the energy efficiency in wireless sensor networks. We classify the power conservation issue into 3 types of sensor networks. They are duty-cycle dependent, role dependent, and topology dependent methods. Finally, future trends in sensor deployment are proposed.

Electronics ◽  
2018 ◽  
Vol 7 (11) ◽  
pp. 306 ◽  
Author(s):  
Duy-Son Vu ◽  
Thi-Nga Dao ◽  
Seokhoon Yoon

Since sensor nodes usually have a large duty cycle interval to prolong network lifetime, duty-cycled wireless sensor networks (WSNs) can suffer from a long end-to-end (E2E) delay. Because delay-sensitive applications have a certain E2E delay requirement, a lot of studies have tried to tackle the long E2E delay problem. However, most existing studies focused on simply reducing the E2E delay rather than considering the delay bound requirement, which makes it hard to achieve balanced performance between E2E delay and energy efficiency. Although a few studies took into consideration both the delay bound requirement and energy consumption, they required specific node deployment or strict time synchronization between nodes in the network. In order to address the limitations of the existing studies, we propose a delay-constrained duty-cycle scheduling (DDS) algorithm. The objective of DDS is to achieve low energy consumption while satisfying the delay bound requirement in various node deployment scenarios depending on user demands. First, based on network topology information collected by the sink, one-hop delay distribution is derived as a function of the duty cycle interval. Then, the E2E delay distribution is estimated using the Lyapunov central limit theorem, which allows each node group to have a different delay distribution. Finally, the duty cycle interval is determined using the estimated E2E delay distribution such that energy consumption is minimized while meeting the delay bound requirement. Practical WSN deployment scenarios are considered to evaluate the proposed algorithm. The simulation results show that DDS can guarantee the given delay bound requirement and outperform existing algorithms in terms of energy efficiency.


2019 ◽  
Vol 131 ◽  
pp. 16-27 ◽  
Author(s):  
Yuxin Liu ◽  
Anfeng Liu ◽  
Ning Zhang ◽  
Xiao Liu ◽  
Ming Ma ◽  
...  

2020 ◽  
pp. 1252-1272
Author(s):  
Imen Jemili ◽  
Dhouha Ghrab ◽  
Abdelfettah Belghith ◽  
Mohamed Mosbah

As the energy efficiency remains a key issue in wireless sensor networks, duty-cycled mechanisms acquired much interest due to their ability to reduce energy consumption by allowing sensor nodes to switch to the sleeping state whenever possible. The challenging task is to authorize a sensor node to adopt a duty-cycle mode without inflicting any negative impact on the performance of the network. A context-aware paradigm allows sensors to adapt their functional behavior according to the context in order to enhance network performances. In this context, the authors propose an enhanced version the Efficient Context-Aware Multi-hop Broadcasting (E-ECAB) protocol, which combines the advantages of context awareness by considering a multi criteria and duty-cycle technique in order to optimize resources usage and satisfy the application requirements. Simulation results show that E-ECAB achieves a significant improvement in term of throughput and end-to-end delay without sacrificing energy efficiency.


Author(s):  
Imen Jemili ◽  
Dhouha Ghrab ◽  
Abdelfettah Belghith ◽  
Mohamed Mosbah

As the energy efficiency remains a key issue in wireless sensor networks, duty-cycled mechanisms acquired much interest due to their ability to reduce energy consumption by allowing sensor nodes to switch to the sleeping state whenever possible. The challenging task is to authorize a sensor node to adopt a duty-cycle mode without inflicting any negative impact on the performance of the network. A context-aware paradigm allows sensors to adapt their functional behavior according to the context in order to enhance network performances. In this context, the authors propose an enhanced version the Efficient Context-Aware Multi-hop Broadcasting (E-ECAB) protocol, which combines the advantages of context awareness by considering a multi criteria and duty-cycle technique in order to optimize resources usage and satisfy the application requirements. Simulation results show that E-ECAB achieves a significant improvement in term of throughput and end-to-end delay without sacrificing energy efficiency.


2016 ◽  
Vol 21 (4) ◽  
pp. 242 ◽  
Author(s):  
Fan Hsun Tseng ◽  
Hsin Hung Cho ◽  
Li Der Chou ◽  
Timothy K. Shih ◽  
Han Chieh Chao

Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


Sign in / Sign up

Export Citation Format

Share Document