基于节点社会特征的机会网络最优发送策略

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

Abstract

Abstract:

A forwarding model of opportunistic network was established based on social features of node and by introducing the Pontryagin’s maximal principle,the optimal policy was got,which obeyed the threshold form.Let h denotes the stop time,when th,the node stops sending messages.Experiments show that the optimal strategy is better than optimal static policy.Further analysis show that the bigger the average number of friends of node is,the smaller the stopping time is,the better the performance is.

Key words: opportunistic network, social feature, optimal control, energy constraint

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.

Figures/Tables 4

References 15

[1]	LIN Y , WANG X , ZHANG L ,et al. The impact of node velocity diversity on mobile opportunistic network performance[J]. Journal of Network＆Computer Applications, 2015,55: 47-58.
[2]	ALTMAN E , BASAR T , PELLEGRINI F D . Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks[J]. Valuetools Proceedings of International Conference on Performance Evaluation Methodologi, 2010,67(4): 299-317.
[3]	LI Y , JIANG Y , JIN D ,et al. Energy-efficient optimal opportunistic forwarding for delay-tolerant networks[J]. IEEE Transactions on Vehicular Technology, 2010,59(9): 4500-4512.
[4]	WANG S , KHOUZANI M , KRISHNAMACHARI B ,et al. Optimal control for epidemic routing of two files with different priorities in delay tolerant networks[C]// American Control Conference (ACC). 2015IEEE, 2015: 1387-1392.
[5]	SHRESTHA N , SASSATELLI L . On optimality of routing policies in delay-tolerant mobile social networks[C]// Vehicular Technology Conference(VTC Spring). 2013 IEEE 77thIEEE, 2013: 1-5.
[6]	CONAN V , LEGUAY J , FRIEDMAN T . Characterizing pairwise inter-contact patterns in delay tolerant networks[C]// The 1st International Conference on Autonomic Computing and Communication Systems.ICST (Institute for Computer Sciences,Social-Informatics and Telecommunications Engineering). 2007:19.
[7]	KARAGIANNIS T , LE BOUDEC J Y , VOJNOVI?M . Power law and exponential decay of inter contact times between mobile devices[J]. IEEE Transactions on Mobile Computing, 2010,9(10): 1377-1390.
[8]	WU Y , DENG S , HUANG H . Information propagation through opportunistic communication in mobile social networks[J]. Mobile Networks and Applications, 2012,17(6): 773-781.
[9]	LI Y , SU G , WU D O ,et al. The impact of node selfishness on multicasting in delay tolerant networks[J]. IEEE Transactions on Vehicular Technology, 2011,60(5): 2224-2238.
[10]	RAPOPORT A , HORVATH W J . A study of a large sociogram[J]. Behavioral Science, 1961,6(4): 279-291.
[11]	WU Y , DENG S , HUANG H . Evaluating the impact of selfish behaviors on epidemic forwarding in mobile social networks[J]. Journal of Statistical Mechanics:Theory and Experiment, 2013,2013(02):P02018.
[12]	WU Y , DENG S , HUANG H . Energy-efficient joint control of epidemic routing in delay tolerant networks[J]. Ksii Transactions on Internet＆Information Systems, 2013,7(2): 234-252.
[13]	KER NEN A , OTT J , K RKK INEN T . The ONE simulator for DTN protocol evaluation[C]// The 2nd International Conference on Simulation Tools and Techniques. 2009:55.
[14]	ALTMAN E , AZAD A P , BASAR T ,et al. Optimal activation and transmission control in delay tolerant networks[C]// IEEE INFOCOM. IEEE, 2010: 1-5.
[15]	LI Y , WANG Z , JIN D ,et al. Optimal beaconing control for epidemic routing in delay tolerant networks[J]. IEEE Transactions on Vehicular Technology, 2012,61(1): 311-320.

Metrics

Recommended 0

No Suggested Reading articles found!

Optimal forwarding policy in opportunistic based on social features of nodes

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 4

References 15

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 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.
[7]	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.
[8]	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.
[9]	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.
[10]	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.
[11]	. Priority-based message forwarding and query processing in opportunistic wireless sensor network [J]. Journal on Communications, 2014, 35(3): 10-93.
[12]	. Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV [J]. Journal on Communications, 2014, 35(10): 10-88.
[13]	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.
[14]	. Period dividing opportunistic networks mobility model based on human realistic scenarios [J]. Journal on Communications, 2013, 34(Z1): 24-189.
[15]	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.