节点连接态势感知的低开销机会网络消息传输策略

doi:10.3969/j.issn.1000-436x.2013.03.006

Abstract

Abstract:

A novel connection status aware cost efficient message transmission mechanism (CSAMT) was proposed. The presented mechanism constructed a dynamic temporal graph matrix based on historical data stored in the cache of the peers to estimate the connection status. Furthermore, the delay, delivery ratio and overhead together were selected as ob-ject optimizing parameters, and then the preferable relay peers could be distributively chosen by adopting equalization and quantification schemes proposed. Numerical results show that CSAMT mechanism can efficiently reduce overhead for more than 48% while the message delivery ratio and latency are improved also.

Key words: opportunistic networks, connection status, temporal graph matrix, message forwarding weight

Da-peng WU,Pu-ning ZHANG,Ru-yan WANG. Connection status aware cost efficient message transmission mechanism in opportunistic networks[J]. Journal on Communications, 2013, 34(3): 44-52.

Figures/Tables 10

References 17

[1]	董超, 钱睿, 陈贵海等. 无线自组织网络中流间网络编码机会发现方法的研究[J]. 通信学报, 2011,32(10): 92-98. DONGC , QIANR , CHENG H , et al. Method for discovering in-tra-session network coding opportunity in wireless ad hoc networks[J]. Journal on Communications, 2011,32(10): 92-98.
[2]	MORGANY L . Notes on DSRC ＆ WAVE standards suite: its archi-tecture, design, and characteristics[J]. IEEE Communications Surveys＆ Tutorials, 2010,12(4): 504-518.
[3]	JUANGP , OKIH , WANGY , et al. Energy-efficient computing for wildlife tracking: design trade-offs and early experiences with Ze-bra-Net[J]. ACM SIGARCH Computer Architecture News, 2002,37(10): 96-107.
[4]	SMALLT , HAADSZ J . The shared wireless infostation model: a new ad hoc networking paradigm[A]. Proceedings of the 4th ACM Interna-tional Symposium on Mobile Ad Hoc Networking and Computing. Annapolis[C]. Annapolis, MD, USA, 2003. 233-244.
[5]	PENTLANDA , FLETCHERR , HASSONA . DakNet: rethinking connectivity in developing nations[J]. Computer, 2004,37(1): 78-83.
[6]	DORIAA , UDENM , PANDEYD P . Providing connectivity to the saami nomadic community[A]. Proceedings of the 2nd International Conference on Open Collaborative Design for Sustainable Innova-tion[C]. Bangalore, India, 2002.
[7]	聂志, 刘静, 甘小莺等. 移动adhoc网络中机会路由转发策略的研究[J]. 重庆邮电大学学报(自然科学版), 2010,22(4): 421-425. NIEZ , LIUJ , GANX Y , et al. A relay node selection technique for opportunistic routing in mobile ad hoc networks[J]. Journal of Chongqing University of Posts and Telecommunications, 2010,22(4): 421-425.
[8]	熊永平，孙利民，牛建伟等. 机会网络[J]. 软件学报， 2009,20(1): 124-137. XIONGY P , SUNL M , NIUJ W , et al. Opportunistic networks[J]. Journal of Software, 2009,20(1): 124-137.
[9]	THRASYVOULOSs , KONSTANTINOSp , CAULIGIS R . Efficient routing in intermittently connected mobile networks: the multiple-copy case[J]. IEEE/ACM Transactions on Networking, 2008,16(1): 77-90.
[10]	THRASYVOULOSs , KONSTANTINOSp , CAULIGIS R . Efficient routing in intermittently connected mobile networks: the sin le-copy case[J]. IEEE/ACM Transactions on Networking, 2008,16(1): 63-76.
[11]	ANDERSL , AVRID , OLOVS . Probabilistic routing in intermittently connected networks[A]. ACM SIGMOBILE Mobile Computing and Communications Review[C]. New York, NY, USA, 2003,7 (3): 19-20.
[12]	卓莹, 龚春叶, 龚正虎 . 网络传输态势感知的研究与实现[J]. 通信学报， 2010,31(9): 54-63. ZHUOY , GONGC Y , GONGZ H . Research and implementatio of network transmission situation awareness[J]. Journal on Communications, 2010,31(9): 54-63.
[13]	VASSILISK . Sequence diagramsgraphs[J]. Physica A: Statistical Mechanics and Its Applications, 2009,388(6): 1007-1023.
[14]	潘国荣, 赵鹏飞 . 基于空间向量的三维基准转换模型[J]. 大地测量与地球动力学， 2009,29(6): 79-82. PANG R , ZHAOP F . 3D datum transformation model based on space vector[J]. Journal of Geodesy and Geodynamics, 2009,29(6): 79-82.
[15]	WEID , HOAV P , OLGICAM . Distortion-rate functions for quantized compressive sensing[A]. IEEE Workshop on Networking and Infor-mation Theory[C]. Greece, 2009. 171-175.
[16]	KER?NENA , OTTJ , K?RKK?INENT . The ONE simulator for DTN protocol evaluation[A]. The 2nd International Conference on Simulation Tools and Techniques[C]. Rome, Italy, 2009. 1-10.
[17]	VASCONG J W , FARIDFARAHMAND , JQEL JOSEP C R . Retiring replicants: congestion control for intermittently-connected networks[A]. IEEE Proceedings INFOCOM[C]. San Diego, USA, 2010. 1-9.
	VASCONG J W , FARIDFARAHMAND , JQEL JOSEP C R . Impact of vehicle movement models on VDTN routing strategies for rural con-nectivity[J]. International Journal of Mobile Network Desi n and In-novation, 2009,3(2): 103-111.

Metrics

Recommended 0

No Suggested Reading articles found!

节点	相遇时间
N₁	T₁
N₂	T₂
M	M
N_i	T_i

参数	数值
仿真时间	10 800s
仿真区域	4 500m×3 400m
节点运动模型	社区模型
热身时间	500s
时间窗口	1 200s
节点组	5个
节点个数	45~95个
节点通信方式	蓝牙
节点速度	5~10m/s
节点缓存空间	6~22MB
传输范围	10m
传输速率	2 Mbit/s
消息大小	50~150KB
消息产生间隔	25~35s

Connection status aware cost efficient message transmission mechanism in opportunistic networks

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 10

References 17

Related Articles 11

Metrics

Recommended 0

[1]	Jian-sheng YAO,Chun-guang MA,Qi YUAN. Utility-based barter trade incentive scheme in opportunistic network [J]. Journal on Communications, 2016, 37(9): 102-110.
[2]	Zhi REN,Yong-yin TAN,Ji-bi LI,Qian-bin CHEN. Reliable selfish node detection algorithm for opportunistic networks [J]. Journal on Communications, 2016, 37(3): 1-6.
[3]	Zhi REN,Jian-wei SUO,Wen-peng LIU,Hong-jiang LEI,Qian-bin CHEN. High-throughput and low-overhead probabilistic routing based on multi-player bargaining game for opportunistic networks [J]. Journal on Communications, 2015, 36(6): 41-48.
[4]	Da-peng WU,Peng-wen LOU,Qiao-shou LIU,Yu XIONG,Ru-yan WANG. Coding redundancy controlled data forwarding mechanism in opportunistic networks [J]. Journal on Communications, 2015, 36(3): 63-74.
[5]	. Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV [J]. Journal on Communications, 2014, 35(10): 10-88.
[6]	Zhi REN,Cong CHEN,Ya-nan CAO,Chen PENG,Qian-bin CHEN. Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV [J]. Journal on Communications, 2014, 35(10): 81-88.
[7]	Gang CHENG,Yun-yong ZHANG,Yong ZHANG,Mei SONG. Period dividing opportunistic networks mobility model based on human realistic scenarios [J]. Journal on Communications, 2013, 34(Z1): 182-189.
[8]	. Period dividing opportunistic networks mobility model based on human realistic scenarios [J]. Journal on Communications, 2013, 34(Z1): 24-189.
[9]	Xi CHEN,Guang-song LI,You-liang TIAN,Jian-feng MA. On-demand key management based on social attribute for opportunistic networks [J]. Journal on Communications, 2012, 33(12): 93-99.
[10]	Jian-wei NIU,Jin-kai GUO,Yan LIU,Chao TONG. PreS:an efficient routing algorithm for opportunistic networks based on mobility prediction [J]. Journal on Communications, 2010, 31(9A): 73-80.
[11]	Hui YE,Zhi-gang CHEN,Ming ZHAO. ON-CRP:cache replacement policy for opportunistic networks [J]. Journal on Communications, 2010, 31(5): 98-107.