摘要
针对WSANs中的服务发现问题,提出了一种基于六边形分区的多中心编址服务发现算法MASD。算法综合考虑了节点的通信开销和存储负担,设计了一种多中心的编址方案,此方案采用局部计算,拥有计算量小的优点。Sensor节点可按地址或者采用局部搜索的算法寻找到达附近actor节点的下一跳节点。通过实验发现,与现有的imesh算法相比,本算法具有更短的搜索距离和更少的通信开销。
A multi-centre addressing algorithm MASD with cell-based network partition was presented to solve the service discovery problem in WSANs.With the comprehensive consideration of the communication cost and per-node storage load,a multi-centre addressing scheme which uses no global computation and has lower computation was designed.Sensor node can find the next hop to the nearby actor through address or local searching.The simulated experiment results show that the algorithm has shorter search distance and more little communication cost compared to the imesh algorithm.
出处
《计算机科学》
CSCD
北大核心
2014年第4期44-48,共5页
Computer Science
基金
国家自然基金(60873026
61021062)
国家"九七三"重点基础研究发展规划(2006CB303000
2009CB320705)
江苏省科技支撑计划(工业)项目(BE2011195
BE2010178)资助
