期刊文献+

基于网络编码的WSN机会路由优化算法 被引量:5

Optimized Opportunistic Routing Algorithm Based on Network Coding in Wireless Sensor Network
下载PDF
导出
摘要 在无线传感器网络中,现有基于网络编码的低能耗可靠机会路由算法(EROR),在均衡节点能量消耗和延长网络生存时间上存在不足。为此,提出一种基于网络编码的机会路由优化算法(OPEROR)。通过信道误码率和丢包率计算节点接收编码包失败的概率,以减少编码包的重传次数。转发集中的节点在收齐解码所需的编码包后直接广播自己的代价数据包,不再发送确认包,从而减少网络开销和确定主转发节点的等待时间。主转发节点的邻居节点根据收到的代价数据包更新自己的转发代价后再判断自己是否成为协助转发节点,防止转发代价大的邻居节点也转发编码包。仿真结果表明,与EROR算法相比,OPEROR算法可以延长网络生存时间并降低平均能耗。 In Wireless Sensor Network(WSN),the current Energy-efficient Reliable Opportunistic Routing(EROR) algorithm based on network coding has shortcoming in balancing the energy consumption of nodes and prolonging the lifetime of network,so an optimized opportunistic routing algorithm based on network coding named OPEROR is proposed.It uses the channel bit error rate and packet loss rate to calculate the probability of failure of the received encode packets,reducing the retransmitted number of encode packets.The nodes in the forwarding set broadcast the cost packet directly instead of acknowledgement packet when it collects enough encode packets,reducing the network overhead and the waiting time of primary forwarding nodes.The neighbors of the primary forwarding nodes update their own forwarding cost based on the received cost packet,and decide whether to become assistant forwarding node,thus can prevent the neighbors with large forwarding cost from forwarding encode packets.Simulation results show that compared with EROR algorithm,the performance of OPEROR algorithm is improved in prolonging the lifetime of network and reducing the average energy consumption.
作者 姚玉坤 张毅 李娟 YAO Yukun,ZHANG Yi,LI Juan(Key Laboratory of Mobile Communication Technology,Chongqing University of Posts and Telecommunications,Chongqing 400065,Chin)
出处 《计算机工程》 CAS CSCD 北大核心 2018年第6期68-73,共6页 Computer Engineering
基金 国家自然科学基金(61379159) 重庆市基础与前沿研究计划项目(cstc2015jcyjBX0085)
关键词 无线传感器网络 机会路由 网络编码 主转发节点 代价数据包 Wireless Sensor Network(WSN) opportunistic routing network coding primary forwarding node cost data packet
  • 相关文献

参考文献5

二级参考文献101

  • 1Garcia P J, Duato J, Flich J, et al. Cost-Effective Congestionmanagement for Interconnection Networks Using Distributed Deterministic Routing [ C ]//IEEE, International Conference on, Parallel and Distributed Systems,Univ of Castilla-La Mancha,Albacete, Spain, Dec 2010:355-364.
  • 2Biswas S, Morris R. Opportunistic Routing in Multi-Hop Wireless Networks [ J ]. In ACM SIGCOMM Computer ommunications Review,Jan 2004,34( 1 ) :69-74.
  • 3Biswas S, Morris R. ExOR: Opportunistic Multi-Hop Routing for Wireless Networks [ J ]. ACM SIGCOMM Computer Communication Review, Aug 2005,35 (4) : 133-144.
  • 4Koetter R,M'edard M. An Mgebraic Approach to Network Coding[J].IEEE/ACM Transactionson on Networking,2003,11 (5) :782-795.
  • 5Rozner E, Seshadri J, Mehta Y, et al. Simple Opportunistic Routing Protocol for Wireless Mesh Networks[ C ]//Proc IEEE Workshop on, Wireless Mesh Networks,Univ of Texas,Austin,Sept 2006:48-54.
  • 6Rozner E, Seshadri J, Mebta Y, et al. SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks [ J ]. In IEEE Transactions on Mobile Computing, Dec 2009,8 (12) : 1622-1635.
  • 7Jaggi S, Sanders P, Chou P A, et al. Polynomial Time Algorithms for Multicast Network Code Construction [ J ]. IEEE Transaction on Information Theory,2005,51 ( 6 ) : 1973-1982.
  • 8Li S Y, Yeung R W, Cai N. Linear Network Coding [ J ]. IEEE Transactions on Information Theory,2003,49 ( 2 ) : 371 -381.
  • 9Ahlswede R,Cai N,Yeung R W,et al. Network Information Flow [ J ]. IEEE Transactions on Information Theory,20(lO,46(4) :1204-1216.
  • 10Chachulski S, Jennings M, Katti S, et al. Trading Structure for Ran- domness in Wireless Opportunistic Routing [ J ]. ACM SIGCOMM Computer Communication Review,2007,37 (4) : 169-180.

共引文献60

同被引文献38

引证文献5

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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