Abstract
This paper proposes an efficient heuristic for solving the minimum-intracommunication clustering problem in energy- and resource-constrained ad hoc networks. The heuristic organizes the network in clusters aiming to minimize a given cost function. The function used measures the total communication cost between all nodes within the cluster, keeping a minimum amount of resources per cluster.
The clusterhead selection of the proposed heuristic is based on the division of labor encountered in social insects. The idea is that each node has probabilistic tendencies to assume a determined role in the network. For example, nodes with good connectivity and high energy level are good candidates for being clusterheads. The probability of assuming a determined role is based on a node’s fitness for the specific role and the actual necessity (reflected by stimulus) of the role in the current network context. After becoming clusterhead, a node starts recruiting members in order to reach a minimum amount of resources that have to be available in the cluster. The procedure is based on a membership fitness function that evaluates the suitability of a node for the cluster.
The realized simulations demonstrate that the proposed heuristic performance was about in average 25% inferior to the global optimum.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Heimfarth, T., Danne, K., Rammig, F.J.: An os for mobile ad hoc networks using ant based hueristic to distribute mobile services, 77 (2005)
Baker, D., Ephremides, A.: The architectural organization of a mobile radio network via a distributed algorithm. IEEE Transactions on Communications 29(11), 1694–1701 (1981)
Baker, D.J., Ephremides, A., Flynn, J.A.: The design and simulation of a mobile radio network with distributed control. IEEE J. on Selected Areas in Communications SAC2(1), 226–237 (1984)
Gerla, M., Tsai, J.T.-C.: Multicluster, mobile, multimedia radio network. Wirel. Netw. 1(3), 255–265 (1995)
Basagni, S., Chlamtac, I., Farago, A.: A generalized clustering algorithm for peer-to-peer networks. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, Springer, Heidelberg (1997)
Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications 1(4), 660–670 (2002)
Amis, A., Prakash, R., Vuong, T., Huynh, D.: Max-min d-cluster formation in wireless ad hoc networks. In: INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 26-30 March 2000, vol. 1, pp. 32–41 (2000)
Krishnan, R., Starobinski, D.: Message-efficient self-organization of wireless sensor networks. In: Proc. IEEE Wireless Communications and Networking Conference, New Orleans, USA, IEEE Computer Society Press, Los Alamitos (2003)
Bannerjee, S., Khuller, S.: A clustering scheme for hierarchical control in wireless networks. In: Proc. IEEE INFOCOM, Anchorage, Alaska, IEEE Computer Society Press, Los Alamitos (2001)
Heimfarth, T., Janacik, P.: Ant based heuristic for os service distribution on ad hoc networks. In: BICC 2006. 1st IFIP International Conference on Biologically Inspired Cooperative Computing, IFIP International Federation for Information Processing, Boston, MA, USA, vol. 216, pp. 75–84. Springer, Heidelberg (2006)
http://shox.sourceforge.net , (Accessed on Jannuary 28, 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Heimfarth, T., Janacik, P., Rammig, F.J. (2007). Self-organizing Resource-Aware Clustering for Ad Hoc Networks. In: Obermaisser, R., Nah, Y., Puschner, P., Rammig, F.J. (eds) Software Technologies for Embedded and Ubiquitous Systems. SEUS 2007. Lecture Notes in Computer Science, vol 4761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75664-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-75664-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75663-7
Online ISBN: 978-3-540-75664-4
eBook Packages: Computer ScienceComputer Science (R0)