机会网络中能量有效的副本分布状态感知路由机制

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

Abstract

Abstract:

In opportunistic network, the relation between the node energy and message spreading degree is tradeoff. As a result, the network performance can be dramatically improved in limited resource scenarios by an effective routing me-chanism considering the node energy and copy status. Both the message spreading degree and node residual energy were taken into consideration, and then combined with the e probability predicting methods, an energy efficient copy distributing status aware routing mechanism was proposed, which could be used to choose the relay nodes reasonably. Numerical results show that the overhead can be reduced efficiently, and the message delivery ratio and latency can also be optimized.

Key words: opportunistic network, spreading degree, energy efficient, encounter probability, The National Natural Science Foundation of China, 61001105

Da-peng WU,Si-long FAN,GPu-ning ZHAN,Yi LV,Ru-yan WANG. Energy efficient copy distributing status aware routing mechanism in opportunistic network[J]. Journal on Communications, 2013, 34(7): 49-58.

Figures/Tables 16

References 21

[22]	DAI W , PHAM H V , MILENKOVIC O . Distortion-Rate functions for quantized compressive sensing[A]. Proceedings of IEEE on Networking and Information Theory[C]. Volos, Greece, 2009. 171-175.
[23]	KER?NEN A , OTT J , K?RKK?INEN T . he ONE simulator for dtn protocol evaluation[A]. Proceedings of 2nd International Conference on Simulation Tools and Techniques[C]. Rome, Italy, 2009. 1-10.
[1]	DALY E M , HAAHR M . The challenges of disconnected de-lay-tolerant MANETs[J]. Ad Hoc Networks, 2010,8(2):241-250.
[2]	吴大鹏, 周建二, 王汝言等．机会网络中消息冗余度动态估计的缓存管理策略[J]．电子与信息学报， 2012,34(1):101-107.
[3]	LI 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.
[4]	吴大鹏, 张普宁, 王汝言 . 节点连接态势感知的低开销机会网络消息传输策略[J]．通信学报, 2013,34(3):44-52.
[5]	刘期烈, 潘英俊, 李云等 . 延迟容忍网络中基于分离时间和副本控制的路由算法[J], 北京邮电大学学报. 2011,34(2):113-117.
[6]	YOO J , CHOI S , KIM C . The capacity of epidemic routing in vehicu-lar networks[J]. IEEE Communications Letters, 2009,13(6):459-461.
[7]	LINDGREN A , DORIA A , SCHELEN O . Probabilistic routing n intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing Communications Review, 2003,7(3):19-20.
[8]	SUGIHARA 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.
[9]	蔡青松，牛建伟，刘燕．机会网络中的消息传输路径特性研究[J]. 计算机研究与发展， 2011,48(5):793-801. CAI Q S , NIU J W , LIU Y . Message delivery properties i unis-tic networks[J]. Journal of Computer Research and Deve ment, 2011,48(5):793-801.
[10]	ELMUROD T , HOJUNG C . Communication capacity-based message exchange mechanism for DTN[J]. Computer Networks, 2011,55(15):3408-3422.
[11]	SANDULESCU G , NADJM S . Opportunistic DTN routing with in-dow-aware adaptive replication[A]. Proceedings of 4th Asian Confe-rence on Internet Engineering[C]. New York, NY, USA, 2008. 103-112.
[12]	叶辉，陈志刚，赵明 . ON-CRP：机会网络缓存替换策略研究[J]．通信学报， 2010,31(5):98-107.
[13]	LIU 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.
[14]	KRIFA 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 Hoc Communications and Networks[C]. San Francisco, CA, USA, 2008. 260-268.
[15]	周瑞涛, 曹元大, 胡晶晶等 . 基于消息重要性的容迟网络缓存管理策略[J]．通信学报, 2011,32(9A):128-132.
[16]	DALY E M , HAAHR M . Social network analysis for routing in dis-connected delay tolerant MANETs[A]. Proceedings of 8th ACM In-ternational Symposium on Mobile Ad hoc Networking and Compu-ting[C]. NewYork, USA, 2007. 32-40.
[17]	BOLDRINI C , CONTI M , PASSARELLA A . Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks[J]. Computer Networks, 2010,54(4):589-604.
[18]	MTIBAA A , MAY M , DIOT C , et al . PeopleRank: social opportunistic forwarding[A]. Proceedings of IEEE INFOCOM[C]. San Diego, USA, 2010. 1-5.
[19]	HUI P , CROWCROFT J , YONEKI E . UBBLE rap: social-based forwarding in delay tolerant networks[J]. IEEE Transactions on Mo-bile Computing, 2010,10(11):1536-1550.
[20]	SOARES V N , FARAHMAND F , RADRIGUES C . Impact of vehicle movement models on VDTN routing strategies for rural connectivi-ty[J]. International Journal of Mobile Network Design Innovation, 2009,3(2):103-111.
[21]	SPYROPOULOS T , PSOUNIS K , RAGHAVENDRA C S . Perfor-mance analysis of mobility-assisted routing[A]. Proceedings of 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing[C]. Florence, Italy, 2006. 49-60.

Metrics

Recommended 0

No Suggested Reading articles found!

段号(j)	段范围	段起始位置(D)j	段量化间隔(D_j)
1	0~16	0	1
2	16~32	16	1
3	32~64	32	2
4	64~128	64	4
5	128~256	128	8
6	256~512	256	16
7	512~1 536	512	32
8	1 536~1 792	1 536	16
9	1 792~1 920	1 792	8
10	1 920~1 984	1 920	4
11	1 984~2 016	1 984	2
12	2 016~2 032	2 016	1
13	2 032~2 048	2 032	1

相遇节点	相遇概率	最后更新时间
N₁	P_N1	t₁
N₂	P_N2	T₂
?	?	?

参数	数值
仿真时间 /h	12
网络大小/m²	4 500×3 400
节点通信方式	Bluetooth
传输范围/m	10
消息产生时间/s	1 000~42 000
节点数	120
移动速度/(m·s^{- 1})	0.5~1.5
消息大小/KB	200~300
传输速度/kbit/s	250
初始能耗/J	1 000
扫描能耗e_s/J·次-1	0.02
接收能耗e_r/J·bit^{- 1}	2.4×10^{- 7}
发送能耗e_t/J·bit^-1	3.3×10^{- 7}
P_init	0.75
b	0.98

Energy efficient copy distributing status aware routing mechanism in opportunistic network

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 16

References 21

Related Articles 15

Metrics

Recommended 0

[1]	Jian SHU, Jiawei SHI, Linlan LIU, Al-Kali Manar. Topology prediction for opportunistic network based on spatiotemporal convolution [J]. Journal on Communications, 2023, 44(3): 145-156.
[2]	Zhigang CHEN,NBin'an YI,Jia WU. Energy balanced routing algorithm for opportunistic network based on message importance [J]. Journal on Communications, 2018, 39(12): 91-101.
[3]	Feng LI,Ya-li SI,Zhen CHEN,Li-min SHEN. Lightweight opportunistic routing forwarding strategy based on Markov chain [J]. Journal on Communications, 2017, 38(5): 108-120.
[4]	Xue-bin MA,Ai-li LI,Xiao-juan ZHANG. Wakeup strategy based on multi-objective optimization for fixed relay nodes [J]. Journal on Communications, 2017, 38(10): 47-59.
[5]	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.
[6]	Zhi-fei WANG,Pei-teng SHI,Su DENG,Hong-bin HUANG,Ya-hui WU. Optimal forwarding policy in opportunistic based on social features of nodes [J]. Journal on Communications, 2016, 37(6): 163-168.
[7]	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.
[8]	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.
[9]	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.
[10]	Yong-kai LI,Shu-bo LIU,Zhao-huan YANG,Meng-jun LIU. Efficient and privacy-preserving profile matching protocols in opportunistic networks [J]. Journal on Communications, 2015, 36(12): 163-171.
[11]	. Priority-based message forwarding and query processing in opportunistic wireless sensor network [J]. Journal on Communications, 2014, 35(3): 10-93.
[12]	Yong-xuan LAI,Zi-yu LIN. Priority-based message forwarding and query processing in opportunistic wireless sensor network [J]. Journal on Communications, 2014, 35(3): 85-93.
[13]	. Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV [J]. Journal on Communications, 2014, 35(10): 10-88.
[14]	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.
[15]	Jian-kang DONG,Hong-bo WANG,Yang-yang LI,Shi-duan CHENG. Improving energy efficiency and network performance in IaaS cloud with virtual machine placement [J]. Journal on Communications, 2014, 35(1): 72-81.