期刊文献+

基于能量感知的移动低占空比机会网络纠删编码算法 被引量:4

Erasure-Coding Algorithm in Mobile Low-Duty-Cycle Opportunistic Networks Based on Energy-Aware
下载PDF
导出
摘要 低占空比(low-duty-cycle,简称LDC)技术是当前延长无线传感器网络生命周期的最关键技术,为了有效延长机会网络生命周期,将低占空比技术引入机会网络,形成LDC机会网络.但是,现有机会网络路由算法不能很好地适应LDC环境,其性能会大幅度下降.为了解决该问题,提出一种基于能量感知的移动低占空比机会网络纠删编码算法E-EC.仿真实验结果表明,与现有的典型机会网络路由算法相比,E-EC算法在延长移动机会网络生命周期以及增加数据传输成功率等方面带来明显的性能提升. Low-Duty-Cycle (LDC) is the most important technique in increasing the lifecycle of wireless sensor networks. This paper imports low duty cycle technology into opportunistic networks to extend the lifecycle of opportunistic networks effectively. However, the existing routing algorithms for opportunistic networks perform poorly in LDC environment. To solve this problem, this paper proposes an erasure-coding algorithm based on energy-aware (E-EC) for LDC opportunistic networks. Simulation results show that, compared with existing classical algorithms, E-EC algorithm achieves significant performance improvement in terms of life cycle and data success rate.
出处 《软件学报》 EI CSCD 北大核心 2013年第2期230-242,共13页 Journal of Software
基金 国家自然科学基金(60933011) 国家重点基础研究发展计划(973)(2011CB302902) 国家科技重大专项(2010ZX03004-002-01) 四川省科技支撑计划(2010GZ0170) 四川大学青年教师科研启动基金(2011SCU11091)
关键词 低占空比 机会网络 能量感知 纠删编码算法 low-duty-cycle opportunistic network energy-aware erasure-coding algorithm
  • 相关文献

参考文献2

二级参考文献87

  • 1Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu A, Shih E, Balakrishnan H, Madden S. CarTel: A distributed mobile sensor computing system. In: Proc. of the 4th Int'l Conf. on Embedded Networked Sensor Systems. Boulder: ACM, 2006. 125-138.
  • 2Pan H, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C. Pocket switched networks and human mobility in conference environments. In: Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia: ACM. 2005. 244-251.
  • 3Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D. Energy-Efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: Proc. of the 10th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002.96-107. DO1=http://doi.acm.org/10.1145/605397.605408
  • 4Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Communications Magazine, 2006,44(11): 134-141.
  • 5Conti M, Giordano S. Multihop ad hoe networking: The reality. Communications Magazine, 2007,45(4):88-95.
  • 6Fall K. A delay-tolerant network architecture for challenged Internets. In: Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe: ACM, 2003.27-34.
  • 7Akyildiz IF, Akan B, Chert C, Fang J, Su W. InterPlaNetary Intemet: State-of-the-Art and research challenges. Computer Networks, 2003,43(2):75-112.
  • 8Gupta P, Kumar P. The capacity of wireless networks. IEEE Trans. on Information Theory, 2000,46(2):388-404.
  • 9Grossglauser M, Tse DNC. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 2002, 10(4):477-486.
  • 10Small T, Haas ZJ. The shared wireless infostation model: A new ad hoc networking paradigm (or where there is a whale, there is a way). In: Proc. of the 4th ACM Int'l Symp. on Mobile Ad Hoc Networking. Annapolis: ACM, 2003. 233-244.

共引文献323

同被引文献27

  • 1Zhang Z S. Routing in intermittently connected mobile ad hoc net- works and delay tolerant networks overview and challenges. IEEE Communications Surveys Tutorials ,2006 ;8 ( 1 ) : 24-57.
  • 2Amin V, David B. Epidemic routing for partially connected Ad Hoc networks. Durham NC,USA: Duke University,2000.
  • 3Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittent- ly connected networks. ACM SIGMOBILE Mobile Computing and Communications Review ,2003 ;7 ( 3 ) : 19-20.
  • 4Lindgren A, Phanse K S, Evaluation of queuing policies and forward- ing strategies for routing in intermittently connected networks. Proc of IEEE COMSWARE ,2006 : 1-10.
  • 5Homepage of opportunistic network environment, http://www, net- lab. tkk. fi/tutkimus/dtn/theone/ versionl. 4.1. 2013-8-20.
  • 6Cao Y, Sun Z L, Ahmad N, et al. A mobility vector based routing algorithm for delay tolerant networks using history geographic infor- mation. Proceedings of the International Conference on Wireless Communications and Networking, Washington, DC: IEEE Commu- nications Society, 2012:2757-2762.
  • 7熊永平,孙利民,牛建伟,刘燕.机会网络[J].软件学报,2009,20(1):124-137. 被引量:324
  • 8牛建伟,周兴,刘燕,孙利民,马建.一种基于社区机会网络的消息传输算法[J].计算机研究与发展,2009,46(12):2068-2075. 被引量:38
  • 9任智,黄勇,陈前斌.机会网络路由协议[J].计算机应用,2010,30(3):723-728. 被引量:47
  • 10蔡青松,牛建伟,刘燕.机会网络中的消息传输路径特性研究[J].计算机研究与发展,2011,48(5):793-801. 被引量:9

引证文献4

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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