Survivability modeling and analysis on 3D mobile ad-hoc networks

Abstract

Most existing work on survivability in mobile ad-hoc networks (MANETs) focuses on two dimensional (2D) networks. However, many real applications run in three dimensional (3D) networks, e.g., climate and ocean monitoring, and air defense systems. The impact on network survivability due to node behaviors was presented, and a quantitative analysis method on survivability was developed in 3D MANETs by modeling node behaviors and analyzing 3D network connectivity. Node behaviors were modeled by using a semi-Markov process. The node minimum degree of 3D MANETs was discussed. An effective approach to derive the survivability of k-connected networks was proposed through analyzing the connectivity of 3D MANETs caused by node misbehaviors, based on the model of node isolation. The quantitative analysis of node misbehaviors on the survivability in 3D MANETs is obtained through mathematical description, and the effectiveness and rationality of the proposed approach are verified through numerical analysis. The analytical results show that the effect from black and gray attack on network survivability is much severer than other misbehaviors.

Keywords

mobile ad-hoc networks (MANETs) / survivability / node behaviors / semi-Markov process / network connectivity

References

[1] PengS.-c., JiaW.-j., WangG.-j., WuJ., GuoM.-yi.. Trusted routing based on dynamic trust mechanism in mobile ad-hoc networks [J]. IEICE Transactions on Information and Systems, 2010, 93-D(3): 510-517

[2] HeidemannJ., YeW., WillsJ., SyedA., LiYuan.. Research challenges and applications for underwater sensor networking [C]. Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC 2006), 2006, Las Vegas, Nevada, USA, IEEE Computer Society: 228-235

[3] AlamS. M. N., HaasZ. J.. Coverage and connectivity in three-dimensional networks [C]. Proceedings of the Eighth Annual International Conference on Mobile Computing and Networking (MobiCom 2006), 2006, Los Angeles, California, USA, IEEE Computer Society: 346-357

[4] BaiX.-l., ZhangC.-l., XuanD., JiaW.-jia.. Full-coverage and k-connectivity (k=14, 6) three dimensional networks [C]. Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM 2009), 2009, Rio de Janeiro, Brazil, IEEE Computer Society: 388-396

[5] LiuC., WuJie.. Efficient geometric routing in three dimensional ad hoc networks [C]. Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM 2009), 2009, Rio de Janeiro, Brazil, IEEE Computer Society: 2751-2755

[6] LimaM. N., SantosA., PujolleG.. A survey of survivability in mobile ad hoc networks [J]. IEEE Communications Surveys & Tutorials, 2009, 11(1): 66-77

[7] KawahigashiH., TerashimaY., MiyauchiN., NakakawajiT.. Designing fault tolerant ad hoc networks [C]. Proceedings of IEEE/AFCEA Military Communications Conference (MILCOM 2005), 2005, Atlantic City, New Jersey, IEEE Computer Society: 1360-1367

[8] BettstetterC.. On the minimum node degree and connectivity of a wireless multihop Network [C]. Proceedings of the 3rd ACM International Symposium On Mobile Ad Hoc Networking and Computing (MobiHoc 2002), 2002, Lausanne, Switzerland, ACM: 80-91

[9] SantiP.. The critical transmitting range for connectivity in mobile Ad Hoc networks [J]. IEEE Transaction on Mobile Computing, 2005, 4(3): 310-317

[10] HollickM., SchmittJ., SeiplC., SteinmetzR.. On the effect of node misbehavior in ad hoc networks [C]. Proceedings of the IEEE International Conference on Communications (ICC 2004), 2004, Paris, IEEE Computer Society: 3759-3763

[11] XingF., WangW.-ye.. Modeling and analysis of connectivity in mobile ad hoc networks with misbehaving nodes [C]. Proceedings of the IEEE International Conference on Communications (ICC 2006), 2006, Istanbul, Turkey, IEEE Computer Society: 1879-1884

[12] KomathyK., NarayanasamyP.. A probabilistic behavioral model for selfish neighbors in a wireless ad hoc network [J]. International Journal of Computer Science and Network Security, 2007, 7(7): 77-83

[13] ChenD.-y., GargS., TrivediK. S.. Network survivability performance evaluation: A quantitative approach with applications in wireless ad-hoc networks [C]. Proceedings of the 5th ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2002, New York, USA, IEEE Computer Society: 61-68

[14] KOROMA J, LI Wei. A generalized model for network survivability [C]// Proceedings of the 2003 Conference on Diversity in Computing (TAPIA 2003). Atlanta, Georgia, USA, 2003: 47–51.

[15] PengS.-c., JiaW.-j., WangG.-jun.. Survivability evaluation in large-scale mobile ad-hoc networks [J]. Journal of Computer Science and Technology, China, 2009, 24(4): 761-774

[16] HuangX.Semi-Markov model of network traffic [D], 2006, China, Graduate School of Chinese Academy of Sciences

[17] XingF., WangW.-ye.. On the survivability of wireless ad hoc networks with node misbehaviors and failures [J]. IEEE Transactions on Dependable and Secure Computing, 2008, 7(3): 284-299

[18] BollobasB.Modern graph theory [M], 1998, New York, Springer: 216-240

[19] PenroseM. D.. On k-connectivity for a geometric random graph [J]. Random Structure Algorithms, 1999, 15(2): 145-164

[20] FaragoA.. Scalable analysis and design of ad hoc networks via random graph theory [C]. Proceedings of the ACM Dial-M, 2002, Atlantic, Georgia, USA, ACM: 43-50

[21] HuY. C., PerrigA., JohnsonD. B.. Ariadne: A secure on-demand routing protocol for ad hoc networks [J]. Wireless Networks, 2005, 11(2): 21-38

[22] GongG.-l., QianM.-ping.Tutorial on the application of random process & the stochastic model of algorithm and intelligent computing [M], 2004, Beijing, China, Tsinghua University Press: 26-27