Abstract
One of the most obvious features of ad hoc communication is the analyze of the relationships between the ad hoc network users and their need for communication. On that point, the determination of topologies for efficient broadcast based on property of users of ad hoc networks has attracted a growing interest. In the current work, we propose a method to build a virtual topology that exploits the property of community structure in ad hoc network. The first phase of the proposed method constructs a clustering tree based on structural weight of nodes, while maintaining capacity-efficient links. In the second phase, the algorithm determines a community backbone in order to ensure efficient transmission coverage. Results confirm the generation of a good topology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ilyas, M.: The Handbook of Ad Hoc Wireless Networks. CRC PRESS LLC, Boca Raton Florida (2003)
Rheingold, H.: Smart Mobs: The Next Social Revolution. Macquarie University, Sydney (2002)
Flake, G.W., Lawrence, S., Giles, C.L., Coetzee, F.M.: Selforganization and identification of web communities. Computer 35(3), 6670 (2002)
Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. J. Math. Sociol. 1(1), 49–80 (1971)
Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice Hall, New York (1996)
Mark, N.: Networks an introduction. Oxford University Press, New York (2010)
Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.-U.: Complex networks: Structure and dynamics. Phys. Rep. 424(4), 175–308 (2006)
Haddad, M., Kheddouci, H.: Discussion on virtual dynamic topologies in Ad Hoc networks. In: META 2010, Hammamet, Tunisia (2010)
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Syst. 13(1), 14–25 (2002)
Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Springer, New York (1998). LLC, ISSN: 0178–4617
Chen, Y.P., Liestman, A.L.: A zonal algorithm for clustering Ad Hoc networks. Int. J. Found. Comput. Sci. 14(2), 305–322 (2003)
Liu, Z., Wang, B., Guo, L.: A survey on connected dominating set construction algorithm for wireless sensor networks. Inf. Technol. J. 9, 1081–1092 (2010)
Gerla, M., Tsai, J.T.-C.: Multicluster, Mobile Multimedia Radio Networks, Wireless Networks. Wireless Netw. 1, 255–265 (1995)
Chiang, C.-C., Wu, H.-K., Liu, W., Gerla, M.: Routing in clustered networks with fading channel. In: Proceedings of SICON (1997)
Basu, P., Khan, N., Little, T.: A mobility based metric for clustering in mobile Ad Hoc networks. In: DCS Workshop (2001)
Mitton, N., Busson, A., Fleury, E: Self-organization in large scale Ad Hoc networks. In: 3rd Med-Hoc-Net, June 2004
Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, K.: Self-Stabilizing protocols for maximal matching and maximal independent sets for Ad Hoc networks. In: Proceedings of IPDPS, pp. 162–162 (2003)
Blin, L., Gradinariu, M. Butucaru, P., Rovedakis, S.: Self-stabilizing minimum-degree spanning tree within one from the optimal degree. In: Proceedings of the 23rd IEEE International Conference on Parallel and Distributed Processing Systems (IPDPS), Rome, Italy, pp. 1–11 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Drif, A., Boukerram, A., Slimani, Y. (2015). Community Discovery Topology Construction for Ad Hoc Networks. In: Mumtaz, S., Rodriguez, J., Katz, M., Wang, C., Nascimento, A. (eds) Wireless Internet. WICON 2014. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-319-18802-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-18802-7_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18801-0
Online ISBN: 978-3-319-18802-7
eBook Packages: Computer ScienceComputer Science (R0)