WSANs中基于六边形分区的多中心编址服务发现算法  

Multi-centre Addressing Service Discovery Algorithm with Cell-based Network Partition for WSANs

作　　者：杜景林[1,2] 郑若钦[2] 谢立[1] 

机构地区：[1]南京大学计算机科学与技术系,南京210046 [2]南京信息工程大学电子与信息工程学院,南京210044

出　　处：《计算机科学》2014年第4期44-48,共5页Computer Science

基　　金：国家自然基金(60873026;61021062);国家"九七三"重点基础研究发展规划(2006CB303000;2009CB320705);江苏省科技支撑计划(工业)项目(BE2011195;BE2010178)资助

摘　　要：针对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.

关 键 词：WSANs 服务发现 六边形 编址 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]