Strong Neighborhood Based Stable Connected Dominating Sets for Mobile Ad Hoc Networks
We propose an algorithm to determine stable connected dominating sets (SN-CDS) for mobile ad hoc networks (MANETs) using the notion of a “strong neighborhood,” defined based on a “threshold neighborhood distance ratio” (TNDR ≤ 1). A node j at a physical Euclidean distance of r from node i is said to be in the strong neighborhood of node i if r/R ≤ TNDR where R is the fixed transmission range of all nodes in the network. A non-CDS node is said to be covered it at least one of its neighbor nodes is in the SN-CDS. The proposed algorithm prefers to include a covered node with the maximum number (≥ 1) of uncovered neighbors into the SN-CDS; ties are broken using node ids. The algorithm stops when every node is either in the SN-CDS or has at least one neighbor node in the SN-CDS. If TNDR = 1, then SN-CDS corresponds to the maximum-density based CDS (MaxD-CDS) algorithm, a heuristic to approximate a CDS with the minimum number of constituent nodes. We observe that an SN-CDS (with TNDR < 1) has a significantly longer lifetime than a MaxD-CDS and for a given condition of network density and node mobility, the difference in the lifetime increases as the value of TNDR decreases. The tradeoff is lower connectivity as well as a larger constituent node size and hop count per path.
KeywordsStrong Neighborhood Connected Dominating Set Stability Mobile Ad hoc Networks Maximum Density Graph Theory Algorithm
Unable to display preview. Download preview PDF.
- 1.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: The 4th International Conference on Mobile Computing and Networking, pp. 85–97. ACM, USA (1998)Google Scholar
- 2.Johansson, P., Larsson, T., Hedman, N., Mielczarek, B., Degermark, M.: Scenario-based Performance Analysis of Routing Protocols for Mobile Ad hoc Networks. In: The 5th International Conference on Mobile Computing and Networking, pp. 195–206. ACM, USA (1999)Google Scholar
- 3.Siva Ram Murthy, C., Manoj, B. S.: Ad hoc Wireless Networks – Architectures and Protocols. Prentice Hall, USA (2004)Google Scholar
- 4.Ni, S.-Y., Tsenf, Y.-C., Chen, Y.-S., Sheu, J.-P.: The Broadcast Storm Problem in a Mobile Ad hoc Network. In: The 5th International Conference on Mobile Computing and Networking, pp. 151–162. ACM, USA (1999)Google Scholar
- 5.Sinha, P., Sivakumar, R., Bhargavan, V.: Enhancing Ad hoc Routing with Dynamic Virtual Infrastructures. In: The 20th International Conference on Computer and Communications Societies, pp. 1763–1772. IEEE, USA (2001)Google Scholar
- 6.Wang, F., Min, M., Li, Y., Du, D.: On the Construction of Stable Virtual Backbones in Mobile Ad hoc Networks. In: The International Performance Computing and Communications Conference (IPCCC). IEEE, USA (2005)Google Scholar
- 9.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, French Caribbean (2006)Google Scholar
- 10.Meghanathan, N.: An algorithm to determine minimum velocity-based stable connected dominating sets for ad hoc networks. In: Ranka, S., Banerjee, A., Biswas, K.K., Dua, S., Mishra, P., Moona, R., Poon, S.-H., Wang, C.-L. (eds.) IC3 2010. Communications in Computer and Information Science, vol. 94, pp. 206–217. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 12.Bettstetter, C., Hartenstein, H., Perez-Costa, X.: Stochastic Properties of the Random-Way Poin Mobility Model. Wireless Networks 10(5), 555–567 (2004)Google Scholar