基于人类真实场景的分时段的机会网络移动模型

doi:10.3969/j.issn.1000-436x.2013.z1.024

Abstract

Abstract:

Existing mobility models are unable to effectively reflect the behavioral trait of nodes during movement, so the period dividing opportunistic network mobility model based on human realistic scenarios was proposed, by setting up a node daily mobility model and dividing node mobility submodels according to time segment. The features of node activities based on the realistic human scenario and the opportunistic network mobility model were analyzed, in-cluding the node average detention time, the number of nodes in a community during different time interval and the changing frequency of destinations etc. And a contrast has been made between the collected realistic mobility data and data from other mobility models in the way of simulation. The results of simulation show that with respect to node meeting time interval etc., the performances of the model are closer to the activity features in realistic scenarios than other node mobility models.

Key words: opportunistic networks, mobility model, inter-contact time

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.

Figures/Tables 12

References 22

[1]	GUERRIERI A , CARRERAS I , DEPELLEGRINI F , et al. Distributed estimation of global parameters in delay-tolerant networks[A]. IEEE International Symposium of World of Wireless, Mobile and Multime-dia Networks＆Workshops[C]. 2009.1-7.
[2]	BJUREFORS F , GUNNINGBERG P , et al. Interest dissemination in a searchable data-centric opportunistic network[A]. Wireless Conference (EW)[C]. 2010.889-895.
[3]	ABDULLA M , SIMON R . Characteristics of common mobility mod-els for opportunistic networks[A]. PM2HW2N'07: Proceedings of the Second ACM Workshop on Performance Monitoring and Measure-ment of Heterogeneous Wireless and Wired Networks[C]. 2007.105-109.
[4]	CONTI M , KUMAR M . Opportunities in opportunistic computing[J]. Computer, 2010,43 (1):42-50.
[5]	HUANG C M , LAN K C , et al. A survey of opportunistic networks[A]. International Conference on Advanced Information Networking and Applications[C].AINA. 2008.1672-1677.
[6]	PELUSI L , PASSARELLA A , et al. Opportunistic networking:data fowarding in disconnected mobile ad hoc networks[J]. communica-tions Magazine, 2006,44 (11):134-141.
[7]	NIU J W , ZHOU X , WANG K Q , et al. A data transmission scheme for community-based opportunistic networks[A]. the 5th International Conference on Wireless Communications, Networking and Mobile Computing[C]. 2009.1-5.
[8]	NIU J W , WU F F , HUO D , et al. Message publish/subscribe scheme based on opportunistic network[A]. the 7th International Conference on Ubiquitous Intelligence ＆ Computing and 7th International Con-ference on Autonomic ＆ Trusted Computing (UIC/ATC). 2010.180-184.
[9]	BOLDRINI C , CONTI M , et al. Users mobility models for opportun-istic networks:the role of physical locations[A]. Proc of IEEE WRE-COM[C]. 2007.151-157.
[10]	BOLDRINI C , CONTI M , PASSARELLA A . Context and resource awareness in opportunistic network data dissemination[A]. World of Wireless, Mobile and Multimedia Networks[C]. 2008.1-6.
[11]	BOLDRINI C , et al. User-centric mobility models for opportunistic networking[A]. 1st Workshop on Bio-Inspired Design of Networks[C]. 2008.255-267.
[12]	ABDULLA M , et al. Characteristics of common mobility models for opportunistic networks[A]. ACM PM2HW2N'07[C]. 2007.105-109.
[13]	BOUDEC L J , VOJNOVI M . Perfect simulation and stationarity of a class of mobility models[A]. INFOCOM[C]. 2005.2743-2754.
[14]	JARDOSH A , et al. Towards realistic mobility models for mobile ad hoc networks[A]. MobiCom'03[C]. 2003.217-229.
[15]	HONG X , et al. A group mobility model for ad hoc wireless net-works[A]. MSWiM[C]. 1999.53-60.
[16]	SPYROPOULOS T , PSOUNIS K , RAGHAVENDRA C . Performance analysis of mobility-assisted routing[A]. ACM Mobihoc 2006[C]. 2006.49-60.
[17]	BLOUGH D M , RESTA G , SANTI P . A statistical analysis of the long-run node spatial distribution in mobile ad hoc networks[A]. Pro-ceedings of ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems(MSWiM)[C]. Atlanta, GA, 2002.1-5.
[18]	CHAINTREAU A , HUI P , CROWCROFT J , et al. Impact of human mobility on the design of opportunistic forwarding algorithms[A]. Proc INFOCOM'06[C]. 2006.1-13.
[19]	KARAGIANNIS T , BOUDEC J Y L , VOJNOVIC M . Power law and exponential decay of inter contact times between mobile devices[A]. Microsoft Research[C]. 2007.1377-1390.
[20]	MUSOLESI M , MASCOLO C . A community based mobility model for ad hoc network research[A]. Proc 2nd ACM/SIGMOBILE Interna-tional Workshop on Multi-hop Ad Hoc Networks: from theory to real-ity[C]. 2006.31-38.
[21]	SPYROPOULOS T , PSOUNIS K . Performance analysis of mobility assisted routing[A]. Proceedings of ACM MOBIHOC[C]. 2006.49-60.
[22]	CAI H , EUN D. Y . Crossing over the bounded domain: from exponen-tial to power-law inter-meeting time in manet[A]. Mobicom[C]. 2007.159-170.

Metrics

Recommended 0

No Suggested Reading articles found!

仿真参数	参数值
仿真时间	12 h
网络节点数目	100个
副本数量限制	15条
消息数目	100条
消息生存时间	10min
数据长度	100bit
数据传输速度	1Mbit/s
通信范围	15m
网络规模	1000m×500m

Period dividing opportunistic networks mobility model based on human realistic scenarios

RichHTML

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

Figures/Tables 12

References 22

Related Articles 15

Metrics

Recommended 0

[1]	Fengli XU,Yong LI. Survey on user’s mobility behavior modelling in urban environment [J]. Journal on Communications, 2020, 41(7): 18-28.
[2]	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.
[3]	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.
[4]	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.
[5]	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.
[6]	ENGGuang-hong D,AOWan-hua C,HANGJian Z,HENGXiong C,ENGLi F. Mobility model detection method based on birth and death model in DTN environment [J]. Journal on Communications, 2015, 36(1): 57-67.
[7]	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.
[8]	. Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV [J]. Journal on Communications, 2014, 35(10): 10-88.
[9]	. Period dividing opportunistic networks mobility model based on human realistic scenarios [J]. Journal on Communications, 2013, 34(Z1): 24-189.
[10]	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.
[11]	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.
[12]	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.
[13]	Hui YE,Zhi-gang CHEN,Ming ZHAO. ON-CRP:cache replacement policy for opportunistic networks [J]. Journal on Communications, 2010, 31(5): 98-107.
[14]	Yan-tao LIU,Jian-ping AN,Ji-hua LU,Heng LIU. Analysis to entity mobility models of wireless ad hoc works [J]. Journal on Communications, 2010, 31(2): 36-43.
[15]	Min PENG,Pei-lin HONG,Han-cheng LU,Kai-ping XUE. Framework for mobility model detection based on local information [J]. Journal on Communications, 2010, 31(11): 73-79.