The Community for Technology Leaders
RSS Icon
Issue No.03 - July-September (2010 vol.7)
pp: 284-299
Fei Xing , North Carolina State University, Raleigh
Wenye Wang , North Carolina State University, Raleigh
Network survivability is the ability of a network to stay connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad hoc networks. In this paper, we focus on the analysis of network survivability in the presence of node misbehaviors and failures. First, we propose a novel semi-Markov process model to characterize the evolution of node behaviors. As an immediate application of the proposed model, we investigate the problem of node isolation where the effects of denial-of-service (DoS) attacks are considered. Then, we present the derivation of network survivability and obtain the lower and upper bounds on the topological survivability for k-connected networks. We find that the network survivability degrades very quickly with the increasing likelihood of node misbehaviors, depending on the requirements of disjoint outgoing paths or network connectivity. Moreover, DoS attacks have a significant impact on the network survivability, especially in dense networks. Finally, we validate the proposed model and analytical result by simulations and numerical analysis, showing the effects of node misbehaviors on both topological survivability and network performance.
Network survivability, node misbehaviors, semi-Markov process, node behavior modeling, node isolation problem, k-connectivity, wireless ad hoc networks.
Fei Xing, Wenye Wang, "On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures", IEEE Transactions on Dependable and Secure Computing, vol.7, no. 3, pp. 284-299, July-September 2010, doi:10.1109/TDSC.2008.71
[1] F. Xing and W. Wang, "Modeling and Analysis of Connectivity in Mobile Ad Hoc Networks with Misbehaving Nodes," Proc. IEEE Int'l Conf. Comm. (ICC '06), pp. 1879-1884, June 2006.
[2] R. Ellison, D. Fisher, R. Linger, H. Lipson, T. Longstaff, and N. Mead, "Survival Network Systems: An Emerging Discipline," Technical Report CMU/SEI-97-TR-013, SEI, CMU, http://www. , 1997.
[3] "Telecom Glossary 2000," Technical Report ANS T1.523-2001, Institute for Telecomm. Services, NTIA, DOC, http://www.atis. orgtg2k/, Feb. 2001.
[4] J.C. Knight and K.J. Sullivan, "On the Definition of Survivability," Technical Report CS-TR-33-00, Dept. Computer Science, Univ. of Virginia, Jan. 2000.
[5] A.P. Snow, U. Varshney, and A.D. Malloy, "Reliability and Survivability of Wireless and Mobile Networks," IEEE Computer Magazine, vol. 33, no. 7, pp. 449-454, July 2000.
[6] D. Chen, S. Garg, and K.S. Trivedi, "Network Survivability Performance Evaluation: A Quantitative Approach with Applications in Wireless Ad-hoc Networks," Proc. ACM Int'l Workshop Modeling, Analysis, and Simulation of Wireless and Mobile Systems (MSWiM '02), pp. 61-68, Sept. 2002.
[7] E. Mannie and D. Papadimitriou., eds., Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS), IETF RFC 4427,, Mar. 2006.
[8] K. Paul, R.R. Choudhuri, and S. Bandyopadhyay, "Survivability Analysis of Ad Hoc Wireless Network Architecture," Proc. IFIP-TC6/European Commission Int'l Workshop Mobile and Wireless Comm. Networks, C.G. Omidyar., ed., pp. 31-46, 2000.
[9] D. Goyal and J.J. Caffery, "Partitioning Avoidance in Mobile Ad Hoc Networks Using Network Survivability Concepts," Proc. Seventh Int'l Symp. Computers and Comm. (ISCC), May 2002.
[10] H. Kawahigashi, Y. Terashima, N. Miyauchi, and T. Nakakawaji, "Designing Fault Tolerant Ad Hoc Networks," Proc. IEEE/AFCEA Military Comm. Conf. (MILCOM), 2005.
[11] J.P. Sterbenz, R. Krishnan et al., , "Survivable Mobile Wireless Networks: Issues, Challenges, and Research Directions," Proc. ACM Workshop Wireless Security (WiSe '02), pp. 31-40, Sept. 2002.
[12] X.-Y. Li, P.-J. Wan, Y. Wang, and C.-W. Yi, "Fault Tolerant Deployment and Topology Control in Wireless Networks," Proc. ACM MobiHoc '03, pp. 117-128, Jan. 2003.
[13] F. Xue and P. Kumar, "The Number of Neighbors Needed for Connectivity of Wireless Networks," Kluwer Wireless Networks, vol. 10, no. 2, pp. 169-181, Mar. 2004.
[14] C. Bettstetter, "On the Minimum Node Degree and Connectivity of a Wireless Multihop Network," Proc. ACM MobiHoc '02, pp. 80-91, June 2002.
[15] C. Bettstetter, "On the Connectivity of Ad Hoc Networks," Computer J., special issue on mobile and pervasive computing, vol. 47, no. 4, pp. 432-447, 2004.
[16] P.-J. Wan and C.-W. Yi, "Asymptotic Critical Transmission Radius and Critical Neighbor Number for k-Connectivity in Wireless Ad Hoc Networks," Proc. ACM MobiHoc, 2004.
[17] S. Marti, T.J. Giuli, K. Lai, and M. Baker, "Mitigating Routing Misbehavior in Mobile Ad hoc Networks," Proc. ACM MobiCom '00, pp. 255-265, 2000.
[18] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, and R.R. Rao, "Cooperation in Wireless Ad Hoc Networks," Proc. IEEE INFOCOM '03, pp. 808-817, Mar. 2003.
[19] I. Aad, J.-P. Hubaux, and E.W. Knightly, "Denial of Service Resilience in Ad Hoc Networks," Proc. ACM MobiCom, 2004.
[20] M. Penrose, Random Geometric Graphs. Oxford Univ. Press, 2003.
[21] L. Buttyan and J.-P. Hubaux, "Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks," Mobile Networks and Applications, vol. 8, no. 5, pp. 579-592, Oct. 2003.
[22] D. Miorandi and E. AltmanA, "Coverage and Connectivity of Ad Hoc Networks in Presence of Channel Randomness," Proc. IEEE INFOCOM '05, pp. 491-502, Mar. 2005.
[23] J. Medhi, Stochastic Processes. John Wiley & Sons, 1994.
[24] G. Corradi, J. Janssen, and R. Manca, "Numerical Treatment of Homogeneous Semi-Markov Processes in Transient Case—A Straightforward Approach," Methodology and Computing in Applied Probability, vol. 6, pp. 233-246, 2004.
[25] J.-K. Lee and J.C. Hou, "Modeling Steady-State and Transient Behaviors of User Mobility: Formulation, Analysis, and Application," Proc. ACM MobiHoc '06, pp. 85-96, May 2006.
[26] D. Heyman and M. Sobel, Stochastic Models in Operations Research. McGraw-Hill, 1982.
[27] B. Bollobas, Modern Graph Theory. Springer, 1998.
[28] B. Bollobas, Random Graphs. Academic Press, 1985.
[29] P. Santi, Topology Control in Wireless Ad Hoc and Sensor Networks. John Wiley & Sons, 2006.
[30] M.D. Penrose, "On $k$ -Connectivity for a Geometric Random Graph," Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
[31] R. Hekmat, Ad-Hoc Networks: Fundamental Properties and Network Topologies, first ed. Springer, 2006.
[32] Z. Nikoloski1, N. Deo, and L. Kucera, "Degree-Correlation of a Scale-Free Random Graph Process," Proc. European Conf. Combinatorics, Graph Theory and Applications (EuroComb '05), pp. 239-244, 2005.
[33] D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. Weaver, "Inside the Slammer Worm," IEEE Security and Privacy, vol. 1, no. 4, pp. 33-39, July/Aug. 2003.
[34] L.M. Feeney and M. Nilsson, "Investigating the Energy Consumption of a Wireless Network Interface in An Ad Hoc Networking Environment," Proc. IEEE INFOCOM '01, vol. 3, pp. 1548-1557, Apr. 2001.
[35] M. Zhao and W. Wang, "A Unified Mobility Model for Analysis and Simulation of Mobile Wireless Networks," ACM-Springer Wireless Networks, Sept. 2007.
[36] N. Sadagopan, F. Bai, B. Krishnamachari, and A. Helmy, "PATHS: Analysis of PATH Duration Statistics and their Impact on Reactive MANET Routing Protocols," Proc. ACM MobiHoc '03, June 2003.
53 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool