Abstract
We propose a Node Stability Index (NSI)-based algorithm to determine stable connected dominating sets (CDS) for Mobile Ad hoc Networks (MANETs). The NSI of a node is defined as the sum of the predicted Link Expiration Times (LETs) of the links with its neighbor nodes. The NSI-CDS algorithm prefers to include (to the CDS) covered nodes that have the largest NSI value, computed based on the sum of the LETs of the uncovered neighbors. The NSI-CDS has been observed to have significantly longer lifetime than the maximum density-based CDS (MaxD-CDS) and the ID-based CDS (ID-CDS). The tradeoff is a modest increase in the CDS Node Size which however contributes significantly to the robustness of the CDS as well as to a lower hop count per path, especially in high-density networks.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A Performance Comparison of Multi-hop Wireless Ad hoc Network Routing Protocols. In: International Conference on Mobile Computing and Networking, pp. 85–97. ACM, Dallas (1998)
Johansson, P., Larson, T., Hedman, N., Mielczarek, B., DegerMark, M.: Scenario-based Performance Analysis of Routing Protocols for Mobile Ad hoc Networks. In: International Conference on Mobile Computing and Networking, pp. 195–206. ACM, Seattle (1999)
Siva Ram Murthy, C., Manoj, B.S.: Ad Hoc Wireless Networks: Architectures and Protocols, 1st edn. Prentice Hall (2004)
Sakai, K., Sun, M.-T., Ku, W.-S., Okada, H.: Maintaining CDS in Mobile Ad Hoc Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol. 5258, pp. 141–153. Springer, Heidelberg (2008)
Sheu, P.-R., Tsai, H.-Y., Lee, Y.-P., Cheng, J.Y.: On Calculating Stable Connected Dominating Sets Based on Link Stability for Mobile Ad hoc Networks. Tamkang Journal of Science and Engineering 12(4), 417–428 (2009)
Bao, L., Garcia-Luna-Aceves, J.J.: Stable Energy-aware Topology Management in Ad hoc Networks. Ad hoc Networks 8(3), 313–327 (2010)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)
Meghanathan, N.: An Algorithm to Determine the Sequence of Stable Connected Dominating Sets in Mobile Ad hoc Networks. In: The 2nd Advanced International Conference on Telecommunications. IARIA, Guadeloupe (2006)
Su, W., Lee, S.-J., Gerla, M.: Mobility Prediction and Routing in Ad hoc Wireless Networks. International Journal of Network Management 11(1), 3–30 (2001)
Su, W., Gerla, M.: IPv6 Flow Handoff in Ad hoc Wireless Networks using Mobility Prediction. In: Global Telecommunications Conference, vol. 1a, pp. 271–275. IEEE, Rio de Janeireo (1999)
Meghanathan, N.: Exploring the Stability-Energy Consumption-Delay-Network Lifetime Tradeoff of Mobile Ad hoc Network Routing Protocols. Journal of Networks 3(2), 17–28 (2008)
Meghanathan, N.: Path Stability based Ranking of Mobile Ad hoc Network Routing Protocols. ISAST Transactions Journal on Communications and Networking 1(1), 66–73 (2007)
Johnson, D.B., Maltz, D.A., Broch, J.: Ad hoc Networking. Addison-Wesley (2001)
Hofmann-Wellenhof, B., Lichtenegger, H., Collins, J.: Global Positioning System: Theory and Practice, 5th edn. Springer, Heidelberg (2004)
Keiss, W., Fuessler, H., Widmer, J.: Hierarchical Location Service for Mobile Ad hoc Networks. ACM Mobile Computing and Communications Review 8(4), 47–58 (2004)
Bettstetter, C., Hartenstein, H., Perez-Costa, X.: Stochastic Properties of the Random-Way Point Mobility Model. Wireless Networks 10(5), 555–567 (2004)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit Disk Graph Approximation. In: Workshop on the Foundations of Mobile Computing, pp. 17–23. ACM, Philadelphia (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Meghanathan, N. (2012). A Node Stability Index-Based Connected Dominating Set Algorithm for Mobile Ad Hoc Networks. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Networks and Communications. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27299-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-27299-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27298-1
Online ISBN: 978-3-642-27299-8
eBook Packages: Computer ScienceComputer Science (R0)