QQ客服 官方微博 反馈留言

	Distributed Node Election For Full Coverage Using Connectivity Information
	Li, Xiaoyun; Bleakley, Chris
	2014
会议名称	ICIST 2014 - Proceedings of 2014 4th IEEE International Conference on Information Science and Technology
会议地点	中国
英文摘要	This paper proposes a distributed node election algorithm to efficiently select a subset of nodes which provide full coverage. In addition the boundary of un-triangulated holes can be accurately detected. This algorithm only uses binary connectivity information without any additional information such as sensing range or distance between nodes. Assumptions of a Unit Disk Graph (UDG) or d-quasi UDG network configuration are not required. The number of elected nodes is close to the minimum number of nodes for full coverage as shown in simulations with arbitrary topologies and various densities. The algorithm is scalable to any network size. Its time complexity is only sensitive to the density of the network (or average number of neighbors for each node) and is insensitive to the total number of nodes in the network.
收录类别	EI
语种	英语
内容类型	会议论文
源URL	[http://ir.siat.ac.cn:8080/handle/172644/5646]
专题	深圳先进技术研究院_集成所
作者单位	2014
推荐引用方式 GB/T 7714	Li, Xiaoyun,Bleakley, Chris. Distributed Node Election For Full Coverage Using Connectivity Information[C]. 见:ICIST 2014 - Proceedings of 2014 4th IEEE International Conference on Information Science and Technology. 中国.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。