咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >NBgossip:An Energy-Efficient G... 收藏

NBgossip:An Energy-Efficient Gossip Algorithm for Wireless Sensor Networks

NBgossip:An Energy-Efficient Gossip Algorithm for Wireless Sensor Networks

作     者:陆峰 谢良镇 郑国良 钟伟豪 

作者机构:Center for Multimedia and Network TechnologySchool of Computer EngineeringNanyang Technological University 

出 版 物:《Journal of Computer Science & Technology》 (计算机科学技术学报(英文版))

年 卷 期:2008年第23卷第3期

页      面:426-437页

核心收录:

学科分类:080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 080202[工学-机械电子工程] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 0802[工学-机械工程] 

主  题:data dissemination gossip network coding sensor networks 

摘      要:Gossip-based algorithms for information dissemination have recently received significant attention for sensor and ad hoc network applications because of their simplicity and robustness. However, a common drawback of many gossip-based protocols is the waste of energy in passing redundant information over the network. Thus gossip algorithms need to be re-engineered in order to become applicable to energy constrained networks. In this paper, we consider a scenario where each node in the network holds a piece of information (message) at the beginning, and the objective is to simultaneously disseminate all information (messages) among all nodes quickly and cheaply. To provide a practical solution to this problem for ad hoc and sensor networks, NBgossip algorithm is proposed, which is based on network coding and neighborhood gossip. In NBgossip, nodes do not simply forward messages they receive, instead, the linear combinations of the messages are sent out. In addition, every node exchanges messages with its neighboring nodes only. Mathematical proof and simulation studies show that the proposed NBgossip terminates in the optimal O(n)-order rounds and outperforms the existing gossip-based approaches in terms of energy consumption incurred in spreading all the information.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分