应用科学学报 ›› 2009, Vol. 27 ›› Issue (5): 446-452.

• 通信工程 • 上一篇    下一篇

大规模无线传感器网络中近似静态分簇的高效概率覆盖协议

邓曙光,沈连丰,朱晓荣,杨冰   

  1. 1. 东南大学移动通信国家重点实验室,南京210096
    2. 湖南城市学院物理与电信工程系,湖南益阳413000
  • 收稿日期:2009-05-04 修回日期:2009-08-17 出版日期:2009-09-25 发布日期:2009-09-25
  • 通信作者: 邓曙光,博士生,教授,研究领域:无线传感器网络,E-mail: shuguangdeng@163.com;沈连丰,教授,博导,研究领域:新一代移动通信技术,E-mail: lfshen@seu.edu.cn
  • 基金资助:
    国家“973” 重点基础研究发展计划基金(No.2007CB310606); 湖南省自然科学基金(No.07JJ6120)基金; 湖南省科技计划(No.2008GK3095);湖南省教育厅优秀青年基金(No.08B012)资助项目

Efficient Probabilistic Coverage Protocol for Near Static Clustering in Large Scale Wireless Sensor Networks

  1. 1. National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
    2. Department of Physics and Telecommunication Engineering, Hunan City University, Yiyang 413000, Hunan Province, China
  • Received:2009-05-04 Revised:2009-08-17 Online:2009-09-25 Published:2009-09-25

摘要:

为在大规模无线传感器网络中获得较好的网络性能,提出一种基于近似静态分簇的高效概率覆盖协议EPCSC. 该协议通过近似静态分簇节省网络资源,保持网络连通性. 根据网络QoS期望值选择必需节点数目来保证网络服务质量,实行簇头轮换机制,并在簇头间构建近似Prim最小生成树来有效延长网络生命期. 仿真结果表明,EPCSC协议能有效降
低控制开销,显著延长网络生命期,提供满足应用期望的网络服务质量.

关键词: 无线传感器网络, 近似静态分簇, 概率覆盖, Prim树

Abstract:

In order to achieve good network performance, an efficient probabilistic coverage protocol using near static clustering (EPCSC) is proposed for large-scale wireless sensor networks (LWSN). This protocol employs a near
static clustering to economize network resource and insure the network connectivity. It selects minimum number of active sensors to achieve expected quality of service (QoS), implements cluster heads (CH) rotation mechanism, and computes transmitting path by using approximate Prim minimum spanning tree algorithm to prolong the network lifetime. Simulation results show that the EPCSC protocol can effectively reduce control overheads and prolong network lifetime, and provide desired QoS in LWSN.

Key words: wireless sensor networks, near static clustering, probabilistic coverage, Prim tree

中图分类号: