Computer Science ›› 2017, Vol. 44 ›› Issue (2): 140-146.doi: 10.11896/j.issn.1002-137X.2017.02.021

Previous Articles     Next Articles

Research on Network Performance Based on Nomadic Group Mobility Model

LIU Jian-ming and LIN Dao-wei   

  • Online:2018-11-13 Published:2018-11-13

Abstract: In view of the fact that the independent network mobility model between nodes can’t reflect the mobile ad hoc network features under the real application scenario,nomadic group mobility model which is applicable in the military field and vehicle network is utilized.After constructing the corresponding system model,a multi-copy relaying algorithm between groups was put forward and the upper and lower bounds of network capacity and delay based on nomadic group mobility model under relaying mode can be deduced from which the corresponding rate of compromise is obtained.The simulation of the node mobility shows that the model possesses good mobility characteristics.The function curves of the relevant parameters prove that the better performance of the network can be obtained under this kind of mobility model.

Key words: Mobile ad hoc networks,Nomadic group mobility model,Throughput,Delay,Tradeoff

[1] CHLAMTAC I,CONTI M,LIU J N.Mobile ad hoc networ-king:imperatives and challenges[J].Ad Hoc Networks,2003,1(3):13-64.
[2] GUPTA P,KUMAR P R.The capacity of wireless networks[J].IEEE Transactions on Information Theory,2000,46(2):388-404.
[3] GROSSGLASUER M,TSE D N C.Mobility Increases the Ca-pacity of Ad Hoc Wireless Networks[J].IEEE/ACM Transactions on Networking,2002,10(4):477-486.
[4] GAMAL A E,MAMMEN J,PRABHAKAR B,et al.Optimal Through put-Delay Scaling in Wireless Networks—Part II:Constant-Size Packets[J].IEEE Transactions on Information Theory,2006,52(11):5111-5116.
[5] GAMAL A E,MAMMEN J,PRABHAKAR B,et al.Throughput-delay trade-off in energy constrained wireless networks[C]∥International Symposium on Information Theory,2004(ISIT 2004).IEEE,2004:439.
[6] NEELY M J,MODIANO E.Capacity and delay tradeoffs for ad-hoc mobile networks[C]∥First International Conference on Broadband Networks,2004.IEEE,2004:3687-3687.
[7] CAMP T,BOLENG J,DAVIES V.A survey of mobility models for ad hoc network research [J].Wireless Communications & Mobile Computing,2002,2(5):483-502.
[8] LI P,FANG Y,LI J,et al.Smooth Trade-Offs between Th-roughput and Delay in Mobile Ad Hoc Networks[J].IEEE Transactions on Mobile Computing,2012,11(3):427-438.
[9] CIULLO D,MARTINA V,GARETTO M,et al.Impact of Cor-related Mobility on Delay-Throughput Performance in Mobile Ad Hoc Networks[J].IEEE/ACM Transactions on Networking,2011,19(6):1745-1758.
[10] GARETTO M,GIACCONE P,LEONARDI E.Capacity scaling in ad hoc networks with heterogeneous mobile nodes:the super-critical regime[J].IEEE/ACM Transactions on Networking,2009,17(5):1522-1535.
[11] SNCHEZ M.Mobilitymodels.
[12] SNCHEZ M,MANZONI P.ANEJOS:a Java based simulator for ad hoc networks[J].Future Generation Computer Systems,2001,17(5):573-583.
[13] LIU J,JIANG X,NISHIYAMA H,et al.Delay and Capacity in Ad Hoc Mobile Networks with f-cast Relay Algorithms[J].IEEE Transactions on Wireless Communications,2011,10(8):2738-2751.
[14] KNUTH D E.Big Omicron and big Omega and big Theta[J].Acm Sigact News,1976,8(2):18-24.
[15] NEELY M J,MODIANO E.Capacity and delay tradeoffs for ad-hoc mobile networks[C]∥First International Conference on Broadband Networks,2004.IEEE,2004:3687-3687.
[16] LIU Y T,AN J P.Asymptotic node distribution of self-organizing Network random walk model[J].Journal of Beijing Institute of Technology,2010,5(5):573-577.(in Chinese) 刘宴涛,安建平.自组织网络随机游走模型的渐近节点分布[J].北京理工大学学报,2010,30(5):573-577.

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .