Node Scheduling Strategy Based on k-Coverage Guarantee for Heterogeneous Wireless Sensor Networks

王换招; 董贝; 罗韩梅; 陈培军; 李增智

您当前的位置：

首页 >

文章列表页 >

Node Scheduling Strategy Based on k-Coverage Guarantee for Heterogeneous Wireless Sensor Networks

更新时间：2025-12-08

- Node Scheduling Strategy Based on k-Coverage Guarantee for Heterogeneous Wireless Sensor Networks
- Vol. 42, Issue 8, Pages: 940-944+1005(2008)
- 作者机构：
  
  西安交通大学计算机科学与技术系,西安,710049
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393
- Online First：10 August 2008，
  
  Published：2008
- 稿件说明：
移动端阅览
王换招, 董贝, 罗韩梅, et al. Node Scheduling Strategy Based on k-Coverage Guarantee for Heterogeneous Wireless Sensor Networks[J]. 2008, 42(8): 940-944+1005.
DOI：

王换招, 董贝, 罗韩梅, et al. Node Scheduling Strategy Based on k-Coverage Guarantee for Heterogeneous Wireless Sensor Networks[J]. 2008, 42(8): 940-944+1005. DOI：

摘要

在分析已有传感器网络覆盖控制协议的基础上

提出了一种分布式覆盖控制算法.针对节点随机部署的异构网络

通过研究网络中节点交点的必要性

得出必要节点交点的最低覆盖度即为区域覆盖度的结论

由此可将区域覆盖度的计算转化为特殊点的覆盖度计算

从而解决了覆盖算法计算复杂度高和不精确等问题.在此基础上

又提出了一种以保证k-覆盖为目标的节点调度策略(SEC)

该策略按照时间轮次

根据精确覆盖度算法可分布式地确定节点的状态.仿真结果表明

SEC能够减少节点的通信量

使工作节点数摆脱总节点数的影响

从而延长了网络的生命周期.与经典覆盖控制算法相比

所提算法在保证网络覆盖度的前提下可有效降低工作节点的数量

提高大规模传感器网络的可扩展性.

Abstract

Based on analyzing the existing coverage control protocols for wireless sensor networks

a distributed coverage control strategy is proposed for heterogeneous sensor network with stochastically deployed nodes. By studying the necessity of the node intersection points

the conclusion that the lowest coverage degree of the necessary node intersection points is the coverage degree of the area is obtained

and hence the coverage degree of the whole monitoring region can be converted into the coverage degrees of some special points. The imprecision and complexity problems that appear in many existing protocols can be solved accordingly. A node scheduling strategy called SEC is also proposed based on the proposed coverage arithmetic. The nodes' states are then decided in terms of the network operating time in rounds and the accurate coverage degree arithmetic. Simulation results show that the communications can be reduced observably in SEC

and the affect of the number of total nodes on the working nodes can be eliminated. The network lifetime is prolonged consequently. With k-coverage warranty the number of active nodes is reduced effectively compared with the classical strategies

and the SEC strategy has good expansibility.

关键词

Keywords

references

HUANG Chifu.The Coverage problem in wireless sensor network[C]∥ACM International Workshop on Wireless Sensor Networks and Applications. New York, USA: ACM, 2005:519-528.

SU Lu. Coverage algorithm and protocol in heterogeneous sensor networks[C]∥International Conference on Computer Network and Mobile Computing. Berlin, Germany: Springer-Verlag, 2005:53-63.

WU Kui. Lightweight deployment aware scheduling for wireless sensor networks [J].Mobile Networks and Applications,2005,10(6):837-852

HUSSEIN I I, STIPANOVIC D M. Effective coverage control for mobile sensor networks with guaranteed collision avoidance [J]. IEEE Transactions on Control Systems Technology, 2007,15(4):642-657.

WATFA M K, COMMURI S. Optimal 3-dimensional sensor deployment strategy [C]∥IEEE Consumer Communications and Networking Conference. Piscataway, NJ, USA: IEEE, 2006:892-896.

TSAI Y R. Coverage-preserving routing protocols for randomly distributed wireless sensor networks [J]. IEEE Transactions on Wireless Communications, 2007,6(4):1240-1245.

BOUKERCHE A. A local information exchange based coverage-preserving protocol for wireless sensor networks [C]∥IEEE International Conference on Communications. Piscataway, NJ, USA: IEEE, 2006: 3420-3425.

WANG Bang. Information coverage in randomly deployed wireless sensor networks [J]. IEEE Transactions on Wireless Communications, 2007,6(8):2994-3004.

SAVVIDES A, HAN C, STRIVASAVA M. Dynamic fine-grained localization in ad-hoc networks of sensors [C]∥Proceedings of the 7th Annual International Conference on Mobile Computing and Networking. New York, USA: ACM, 2001:166-179.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Prolonging Lifecycle of Energy Balance Routing in Real-Time Wireless Sensor Networks

Secure Directed Diffusion Protocol Based on Random Key Predistribution Model

Directed Diffusion Algorithm Based on Dynamic Threshold

Dynamic Data Transmission Mechanism Based on Prediction Revision

Proportional Fairness Scheduling Algorithm Used for Wireless Sensor Network

Related Author

赵保华 1

李培龙 1

高存皓 1

周颢 1

宋飞 1

谷雨 1

Related Institution

Anhui Province Key Laboratory of Software in Computing and Communication

Department of Computer Science and Technology, University of Science and Technology of China

School of Mathematics and Computer Science, Ningxia University

School of Electronics and Information Engineering, Xi'an Jiaotong University

School of Mathematics and Computer Science, Ningxia University

⁰