Coding redundancy controlled data forwarding mechanism in opportunistic networks

Da-peng WU; Peng-wen LOU; Qiao-shou LIU; Yu XIONG; Ru-yan WANG

doi:10.11959/j.issn.1000-436x.2015059

您当前的位置：

首页 >

文章列表页 >

Coding redundancy controlled data forwarding mechanism in opportunistic networks

academic paper | 更新时间：2024-06-05

- Coding redundancy controlled data forwarding mechanism in opportunistic networks
- Journal of Communications Vol. 36, Issue 3, Pages: 63-74(2015)
- 作者机构：
  
  重庆邮电大学宽带泛在接入技术研究所，重庆 400065
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61371097);The Natural Science Foundation of Chongqing(cstc2013jjB40001);The Natural Science Foundation of Chongqing(cstc2013jjB40006);Youth Talents Training Project of Chongqing Science ＆ Technology Commission(CSTC2014KJRC-QNRC40001);The Foundation of Chongqing University of Posts and Telecommunication(A2012-93)
- DOI：10.11959/j.issn.1000-436x.2015059
  CLC： TP393
- Online First：2015-03，
  
  Published：25 March 2015
- 稿件说明：
移动端阅览
Da-peng WU, Peng-wen LOU, Qiao-shou LIU, et al. Coding redundancy controlled data forwarding mechanism in opportunistic networks[J]. Journal of Communications, 2015, 36(3): 63-74.
DOI：

Da-peng WU, Peng-wen LOU, Qiao-shou LIU, et al. Coding redundancy controlled data forwarding mechanism in opportunistic networks[J]. Journal of Communications, 2015, 36(3): 63-74. DOI： 10.11959/j.issn.1000-436x.2015059.

摘要

网络编码方法能有效提高数据传输效率，但采用该方法的机会网络数据转发机制均未考虑传输中的编码数据迭代冗余副本控制问题。为了充分降低译码复杂度并减少迭代冗余副本，提出了相遇持续时间估计及编码机会感知方法，进而设计了带有传输容量估计的编码冗余控制数据转发机制。节点以分布式的方式感知数据编码机会，为不同扩散程度的数据确定相应的优先级，并根据传输容量估计结果完成转发控制，以充分利用节点间的相遇持续时间。结果表明，所提出机制有效地减少了网络中的冗余副本，使译码所需的数据量趋于理论上的最小值，改善了网络资源利用率。

Abstract

The network coding can improve network transmission efficiency. But most of the data forwarding mechanism does not consider the iteration redundancy control during data transmission. In order to reduce the complexity of decod-ing and iteration redundancy copies sufficiently in coding nodes limited network

the encounter duration estimating method and coding opportunity-aware method are proposed. Further

a data forwarding mechanism for coding redun-dancy control with communication capacity estimating method is designed. It can make full use of the encounter duration between nodes to forward the data

which has more coding opportunity and less than the community capacity. Further-more

the coding number of nodes is updated and the iteration redundancy in every generation is controlled. Experimental results show that

the mechanism could reduce the iteration redundancy in the network and minimize data amount re-quired by decoding

which tends to the theoretical minimum and improves the utilization of network resources.

关键词

Keywords

references

KHABBAZ M J , ASSI C M , FAWAZ W F . Disruption-tolerant net-working: a comprehensive survey on recent developments and persist-ing challenges [J ] . IEEE Communications Surveys and Tutorials , 2012 , 14 ( 2 ): 607 - 640 .

BULUT E , GEYIK S , SZYMANSKI B . Efficient routing in delay tolerant networks with correlated node mobility [A ] . The 7th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems [C ] . San Francisco, USA , 2010 . 79 - 88 .

DALY E M , HAAHR M . The challenges of disconnected delay-tolerant MANET [J ] . Ad Hoc Networks , 2010 , 8 ( 2 ): 241 - 250 .

GAO W , LI Q H , ZHAO B , et al . Social-aware multicast in disruption-tolerant networks [J ] . IEEE/ACM Transactions on Networking , 2012 , 20 ( 5 ): 1553 - 1566 .

CONAN V , COMMUN T , CLARKSBURG M D , et al . Fixed point opportunistic routing in delay tolerant networks [J ] . IEEE Journal on Selected Areas in Communications , 2008 , 26 ( 5 ): 773 - 782 .

PAN D R , LIN M , CHEN L J , et al . An improved spray and wait with probability choice routing for opportunistic networks [J ] . Journal of Networks , 2012 , 7 ( 9 ): 1486 - 1492 .

HAN X , YANG Y W , WANG L . Performance of network coding protocol based epidemic routing [J ] . Journal of Computer Applications , 2012 , 32 ( 3 ): 791 - 794 ,799.

樊凯，李令雄，龙冬阳．无线Mesh网中网络编码感知的按需无线路由协议的研究 [J ] ．通信学报， 2009 , 30 ( 1 ): 128 - 134 .

FAN K , LI L X , LONG D Y . Study of on-demand cope-aware routing protocol in wireless Mesh networks [J ] . Journal on Communications , 2009 , 30 ( 1 ): 128 - 134 .

SONG Z M , SU J S , PENG W , et al . NTC:towards efficient network coding in delay tolerant networks [A ] . The Fifth International Conference Innovative Mobile and Internet Services in Ubiquitous Computing [C ] . Seoul, Korea , 2011 . 57 - 64 .

SHABBIR A , SALIL S K . HUBCODE: hub-based forwarding using network. coding in delay tolerant networks [J ] . Wireless Communications and Mobile Computing , 2013 , 13 ( 9 ): 828 - 846 .

NARMAWALA Z , SRIVASTAVA S . MIDTONE: multicast in delay tolerant networks [A ] . The Fourth International Conference on Communications and Networking [C ] . Xian, China , 2009 . 1 - 8 .

ZHANG J , CHEN Y P , MARSIC I . Network coding via opportunistic forwarding in wireless mesh networks [A ] . Wireless Communications and Networking Conference [C ] . 2008 . 1775 - 1780 .

袁永琼，张军，王赟．无线多跳网络中网络编码感知的机会转发机制 [J ] ．北京航空航天大学学报， 2012 , 38 ( 5 ): 648 - 653 .

YUAN Y Q , ZHANG J , WANG Y . Network coding-aware opportunis-tic forwarding mechanism in wireless multi-hop networks [J ] . Journal of Beijing University of Aeronautics and Astronautics , 2012 , 38 ( 5 ): 648 - 653 .

HAN B , PAN H , KUMAR V S , et al . Mobile data offloading through opportunistic communications and social participation [J ] . IEEE Transactions on Mobile Computing , 2012 , 11 ( 5 ): 821 - 834 .

KERÄNEN A , OTT J , KÄRKKÄINEN T . The ONE simulator for DTN protocol evaluation [A ] . Proceedings of 2nd International Conference on Simulation Tools and Techniques [C ] . Rome, Italy , 2009 . 1 - 10 .

PAN H , CROWCROFT J , YONEKI E . BUBBLE rap: social-based forwarding in delay-tolerant networks [J ] . IEEE Transactions on Mobile Computing , 2011 , 10 ( 11 ): 1578 - 1589 .

Views

1023

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

HARQ scheme for sparse code multiple access based on network coding

Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage

Research on linear solvability of network coding based cooperative recovery scheme

Mimic storage scheme based on regenerated code

Cooperative secret key generation for multi-hop relaying systems in Internet of things

Related Author

Ke LAI

Jing LEI

Wei LIU

Lei WEN

Guangjun LIU

Wangmei GUO

Jinbo XIONG

Ximeng LIU

Related Institution

College of Electronic Science and Technology, National University of Defense Technology

School of Computing, Newcastle University

College of Mathematics and Computer Science, Fuzhou University

College of Mathematics and Informatics, Fujian Normal University

State Key Laboratory of Integrated Services Networks, Xidian University

AI问答

⁰