版权说明 操作指南
首页 > 成果 > 详情

A Distributed Approximate Algorithm for Minimal Connected Cover Set Problem in Sensor Networks

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Zou Sai*;Xu YuMing;Zou Fei;Jiang XiaoQi;Deng HongWei;...
通讯作者:
Zou Sai
作者机构:
[Zou Sai; Zou Fei; Yu Ying; Deng HongWei; Xu YuMing; Jiang XiaoQi] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
通讯机构:
[Zou Sai] H
Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
语种:
英文
期刊:
2009 WRI INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND MOBILE COMPUTING: CMC 2009, VOL I
年:
2009
卷:
1
页码:
556-562
机构署名:
本校为第一且通讯机构
院系归属:
计算机科学与技术学院
摘要:
For wireless sensor networks, it is an effective approach for energy conservation in wireless sensor networks to keep the most of redundant sensors asleep while the remaining nodes stay active to maintain both sensing coverage and network connectivity, i.e., to form the minimal connected cover set. A novel concept named "square grid partition" is proposed, and based on the good characteristics of "square grid partition", a new distributed approximate algorithm for constructing the Minimal Connected Cover Set is presented, in which, Sink partitions its area of interest into square grids firstly...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com