期刊文献+

移动传感网社区间能量均衡路由算法 被引量:2

Energy-balanced routing algorithm for inter-community in mobile sensor network
下载PDF
导出
摘要 在资源受限的无线移动传感器网络(MWSN)中设计能效路由是一个挑战性难题。针对移动传感器网络中社区间路由节点能量消耗过快的问题,提出了一种社区间能量均衡路由算法(ERAI)。设计了一个新的基于节点的剩余能量以及相遇可能性的转发能力路由度量FC。利用此度量FC和相遇节点的去向信息选择中继节点来转发消息。实验数据显示,ERAI路由算法在首个节点消亡时间上与Epidemic和PROPHET路由算法相比分别推迟了12.6%~15.6%和4.5%~8.3%,且节点剩余能量均方差小于Epidemic和PROPHET路由算法。实验结果表明,ERAI在一定程度上均衡了各节点的能耗,延长了网络的生命周期。 Energy efficient routing is a challenging problem in resource constrained Mobile Wireless Sensor Network (MWSN) . Focused on the issue that the energy consumption of the inter-community routing in the mobile sensor network is too fast, an Energy-balanced Routing Algorithm for Inter-community (ERAI) was proposed. In ERAI, a new routing metric FC ( Forwarding Capacity) based on the residual energy of nodes and the probability of encounter was designed. Then, this metric FC and the directional information of encountered nodes were used for selection of a relay node to forward the messages. The experimental data show that the death time of the first node of ERAI was later than that of Epidemic and PROPHET by 12.6% - 15.6% and 4.5% - 8.3% respectively, and the residual energy mean square deviation of ERAI was less than that of Epidemic and PROPHET. The experimental results show that the ERAI can balance the energy consumption of each node to a certain extent, and thus prolongs the network lifetime.
出处 《计算机应用》 CSCD 北大核心 2017年第7期1855-1860,共6页 journal of Computer Applications
基金 国家自然科学基金资助项目(U1603115 61262087 61262089) 新疆高校教师科研计划重点资助项目(XJEDU2012I09) 江西省青年科学基金资助项目(20151521020008)~~
关键词 移动传感网 社区 能量均衡 相遇概率 生命周期 mobile sensor network community energy balance encounter probability network lifetime
  • 相关文献

参考文献3

二级参考文献62

  • 1DALY E M, HAAHR M. The challenges of disconnected de- lay-tolerant MANETs [J]. Ad Hoe Networks, 2010, 8(2):241-250.
  • 2LI Y, WANG Z, YOU X H, et al. NER-DRP: dissemination-based routing protocol with network-layer error control for intermittently connected mobile networks[J]. Mobile Networks and Applications, 2012,17(5):618-628.
  • 3YOO J, CHOI S, KIM C. The capacity of epidemic routing in vehicu- lar networks[J]. IEEE Communications Letters, 2009, 13(6):.459-461.
  • 4LINDGREN A, DORIA A, SCHELEN O. Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing Communications Review, 2003, 7(3): 19-20.
  • 5SUGIHARA R, GUPTA R K. Speed control and scheduling of data mules in sensor networks[J]. ACM Transactions on Sensor Networks, 2010, 7(1):1-29.
  • 6ELMUROD T, HOJUNG C. Communication capacity-based message exchange mechanism for DTN[J]. Computer Networks, 2011, 55(15): 3408-3422.
  • 7SANDULESCU G: NADJM S. Opportunistic DTN routing with win- dow-aware adaptive replication [A]. Proceedings of 4th Asian Con- ference on Internet Engineering[C]. New York, N'Y, USA, 2008. 103-112.
  • 8LIU Y, WANG J X, ZHANG S G, et al. A buffer management scheme based on message transmission status in delay tolerant networks[A]. IEEE Globecom[C]. Houston, USA, 2011.1-5.
  • 9KRIFA A, BARAKAT C, SPYROPOULOS T. Optimal buffer man- agement policies for delay tolerant networks[A]. The 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks[C]. San Francisco, CA, USA, 2008. 260-268.
  • 10周瑞涛,曹元大,胡晶晶等.基于消息重要性的容迟网络缓存管理策略[J].通信学报,2011,32(9A):128-132.

共引文献27

同被引文献17

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部