Activating the Hot Spot Problem by Switching Multiple Sinks in Wireless Sensor Networks

2009 ◽  
Author(s):  
Chang Wu Yu ◽  
Shan Shiung Wei ◽  
Bing Jiun Shie
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Hot Spot ◽  
Wireless Sensor ◽  
Multiple Sinks ◽  
Hot Spot Problem

scholarly journals Mitigating Hot Spot Problems in Wireless Sensor Networks Using Tier-Based Quantification Algorithm

2016 ◽  
Vol 16 (1) ◽  
pp. 73-79 ◽  
Author(s):  
R. Balamurali ◽  
K. Kathiravan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Protocol ◽  
Hot Spot ◽  
Wireless Sensor ◽  
Key Issues ◽  
Hot Spot Problem

Abstract One of the key issues in Wireless Sensor Networks (WSN) is the hot-spot problem i.e. the nodes closer to the sink tend to drain their energy at a faster rate when compared to other nodes as they have to perform more communication and hence the sensor network may get isolated. In this paper we are using an integrated MAC and routing protocol which divides the network into tiers. We also propose a quantification algorithm, which decides the number of nodes in each tier to mitigate the hot-spot problem.

scholarly journals Distributed Data Storage Strategy in Wireless Sensor Networks

2016 ◽  
Vol 12 (11) ◽  
pp. 52
Author(s):  
Song-juan Zhang ◽  
Jian Yang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Storage ◽  
Hot Spot ◽  
Wireless Sensor ◽  
Distributed Data ◽  
Distributed Data Storage ◽  
Storage Node ◽  
Approach Method ◽  
Hot Spot Problem

In order to solve the problem of large scalability and low energy efficiency in distributed data storage in wireless sensor networks, the author proposed a temporal-centric storage approach method. By using this method the sensing data are stored in some storage node indexed by a hash function parameterized with detecting time. These nodes act as rendezvous among sink and source nodes. Simulation results show that the proposed approach mitigates the hot-spot problem and can thus improve overall system performance substantially.

scholarly journals A node deployment algorithm for maximizing network lifetime in delay-constrained duty-cycled wireless sensor networks

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771877129 ◽  
Author(s):  
Thi-Nga Dao ◽  
Seokhoon Yoon
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Hot Spot ◽  
Optimal Number ◽  
Wireless Sensor ◽  
Node Deployment ◽  
End To End Delay ◽  
End To End ◽  
Hot Spot Problem

Although duty-cycling is a promising approach to reduce energy consumption in wireless sensor networks, sufficiently long network lifetime may not be achieved due to the hot spot problem. Moreover, a long duty cycle interval can lead to high end-to-end delay, which is not desired in delay-constrained applications. In order to address the hot spot problem and long end-to-end delay, this article proposes a novel energy-balanced node deployment algorithm for maximizing network lifetime in duty-cycled wireless sensor networks while taking into account a delay requirement. In addition, energy-balanced node deployment considers network connectivity and sensing coverage constraints, which are also important factors when wireless sensor networks are deployed. An optimization problem is first formulated where the objective function and constraints are estimated based on node distribution in the area and the network parameters. Then, a non-deterministic algorithm is proposed to derive the optimal number of nodes in each circular layer that meets given constraints and maximizes network lifetime. Numerical analysis and simulations have been conducted to validate the proposed algorithm. The results show that the proposed algorithm can achieve higher network lifetime than other schemes.

Sign in / Sign up

Export Citation Format

Share Document