High-Density Randomly Deployed Nodes Sleep Scheduling Algorithm in Wireless Sensor Networks

Dong Qing Zhang; Deng Li

doi:10.4028/www.scientific.net/AMR.846-847.446

Paper Titles

The Simulation Study of Soft Switching Power Factor Correction Circuit Based on MATLAB
p.429

Global Robust Sliding Mode Tracking Control for Helicopter with Input Time Delay
p.434

A Method for Truck Crane Reliability Test Based on Wireless Sensor Network
p.438

Technology Research on the Fault Diagnosis of Wireless Sensor Network System
p.442

High-Density Randomly Deployed Nodes Sleep Scheduling Algorithm in Wireless Sensor Networks
p.446

A Novel Planar Dipole Antenna with Distributed Inductive Load for Size Reduction
p.452

Layer Based Energy-Balanced Reliable Routing Protocol for Wireless Sensor Networks in Coal Mine
p.457

QoS Access Points Placement with Fault Tolerance in Wireless Local Area Networks
p.463

Research of Insulator Contamination about Microwave Radiation Characteristic Based on the Theory of Component Emissivity
p.469

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 846-847High-Density Randomly Deployed Nodes Sleep...

High-Density Randomly Deployed Nodes Sleep Scheduling Algorithm in Wireless Sensor Networks

Abstract:

The high-density randomly deployment of nodes in Wireless Sensor Networks results in a large number of redundant nodes due to the overlap of sensing areas. A scheduling algorithm for redundant nodes is proposed to effectively prolong the lifetime of WSN. The algorithm focuses on employing different scheduling strategies on border nodes and internal nodes to avoid contraction of the network boundary by judging whether a node is on the network boundary according to the number of working nodes in its neighbor table. The simulation results show that the algorithm can effectively prolong the lifetime of the network.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 846-847)

Pages:

446-451

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.846-847.446

Citation:

Cite this paper

Online since:

November 2013

Authors:

Dong Qing Zhang*, Deng Li

Keywords:

Boundary Nodes, High-Density Randomly Deployed Nodes, Network Lifecycle, Redundant Nodes Sleep Schedule, Wireless Sensor Network (WSN)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Popa M, Girban G. On the Energy Constraint in Wireless Sensor Networks[J]. Computer Communications, 2003, 26(11): 1131-1144.

Google Scholar

[2] Liu C, Wu K, Xiao Y, et al. Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks[J]. IEEE Transactions on Parallel and Distributed System, 2006, 17(6): 562-575.

DOI: 10.1109/tpds.2006.77

Google Scholar

[3] Fan G, Wang R, Huang H, et al. Coverage-Guaranteed Sensor Node Deployment Strategies for Wireless Sensor Networks[J]. Sensors, 2010, 10(3): 2064-(2087).

DOI: 10.3390/s100302064

Google Scholar

[4] Hu X M, Zhang J, Yu Y, et al. Hybrid genetic algorithm using a forward encoding scheme for lifetime maximization of wireless sensor networks[J]. IEEE Transactions on Evolutionary Computation, 2010, 14(5): 766-781.

DOI: 10.1109/tevc.2010.2040182

Google Scholar

[5] Wu K, Gao Y, Li F, et al. Lightweight deployment-aware scheduling for wireless sensor networks[J]. Mobile Networks and Application, 2005, 10(6): 837-852.

DOI: 10.1007/s11036-005-4442-8

Google Scholar

[6] Fan Gao-juan, Wang Ru-chuan, Huang Hai-ping, et al. Tolerable Coverage Area Based Node Scheduling Algorithm in Wireless Sensor Networks[J]. ACTA ELECTRONICA SINICA, 2011, 1(1): 89-94.

Google Scholar