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

计算机科学 ›› 2014, Vol. 41 ›› Issue (4): 44-48.

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

杜景林,郑若钦,谢立

南京大学计算机科学与技术系南京210046;南京信息工程大学电子与信息工程学院南京210044;南京大学计算机科学与技术系南京210046

出版日期:2018-11-14 发布日期:2018-11-14
基金资助:
本文受国家自然基金(60873026,2),国家“九七三”重点基础研究发展规划(2006CB303000,2009CB320705),江苏省科技支撑计划(工业)项目(BE2011195,BE2010178)资助

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

DU Jing-lin,ZHENG Ruo-qin and XIE Li

Online:2018-11-14 Published:2018-11-14

摘要/Abstract

摘要： 针对WSANs中的服务发现问题,提出了一种基于六边形分区的多中心编址服务发现算法MASD。算法综合考虑了节点的通信开销和存储负担,设计了一种多中心的编址方案,此方案采用局部计算,拥有计算量小的优点。Sensor节点可按地址或者采用局部搜索的算法寻找到达附近actor节点的下一跳节点。通过实验发现,与现有的imesh算法相比,本算法具有更短的搜索距离和更少的通信开销。

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

Abstract: 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.

Key words: WSANs,Service discovery,Hexagonal,Addressing

杜景林,郑若钦,谢立. WSANs中基于六边形分区的多中心编址服务发现算法[J]. 计算机科学, 2014, 41(4): 44-48. https://doi.org/

DU Jing-lin,ZHENG Ruo-qin and XIE Li. Multi-centre Addressing Service Discovery Algorithm with Cell-based Network Partition for WSANs[J]. Computer Science, 2014, 41(4): 44-48. https://doi.org/

参考文献

[1] Mezei I,Lukic M,Veljko M,et al．Auctions and iMesh basedtask assignment in wireless sensor and actuator networks[J]．Computter Communication,2012,36(9):979-987
[2] Li Xu,Santoro N,Stojmenovic I.Localized distance-sensitieservice discovery in wireless sensor and actor networks[J]．IEEE Transactions on Computers,2009,8(9):1275-1288
[3] Li J,Jannotti J,Couto D S J D,et al．A scalable location service for geographic ad hoc routing[C]∥Proceedings of the ACM MobiCom.2000:120-130
[4] Ratnasamy S,Karp B,Yin L,et al．GHT:A geographic hash table for data-centric storage[C]∥Proceedings of the Internatio-nal Workshop on Wireless Sensor Networks and Applications (WSNA)．2002:78-87
[5] Tchakarov J B,Vaidya N H．Efficient content location in wireless ad hoc networks[C]∥Proceedings of the IEEE Internatio-nal Conference on Mobile Data Management (MDM)．2004:74-85
[6] Fang Q,Gao J,Guibas L J．Landmark-based information storageand retrieval in sensor networks[C]∥Proceedings of the IEEE INFOCOM．2006:286-297
[7] Stojmenovic I,Liu D,Jia X．A scalable quorum based location service in ad hoc and sensor networks[J]．International Journal of Communication Networks and Distributed Systems,2007,1(1):71-94
[8] Erman A T．Multi-Sink Mobile Wireless Sensor Networks:Dissemination Protocols,Design and Evaluation[D]．Turkey:the University of Twente,2011
[9] Gungor V C,Akan O B,Akyildiz I F．A real-time and reliable transport (RT)2protocol for wireless sensor and actor networks[J]．IEEE/ACM Trans.on Networking,2008,6(2):359-370
[10] 江海峰,钱建生,孙彦景,等.WSN中基于能量代价的能量优化路由算法[J].计算机科学,2012,9(1):73-76,84
[11] 王江涛,陈志刚,邓晓衡．WSN中基于可信核心树的路由算法研究[J]．计算机科学,2011,8(12):36-42
[12] Mezei I,Malbasa V,Stojmenovic I．Robot to robot:communication aspects of coordination in robot wireless networks[J]．IEEE Robotics and Automation Magazine,2010,7(4):63-69
[13] Selvaradjou K,Siva Ram Murthy C．Maximizing lifetime of mobile actors inwireless sensor and actor networks[J]．Ad Hoc & Sensor,Wireless Networks,2010,4(9):179-202
[14] Bechkit W,Koudil M,Challal Y,et al.A New Weighted Shortest Path Tree for Convergecast Traffic Routing in WSN[C]∥Computers and Communications (ISCC)．2012:187-192
[15] Mian A N,Baldoni R,Beraldi R．A survey of service discovery protocols in multihop mobile ad hoc networks[J]．IEEE Pervasive Computing,2009,8(1):66-74

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed