Abstract
A wireless sensor network (WSN) has resource constraints, which include a limited amount of energy, short communication range, low bandwidth, and limited processing and storage in each node. In this paper, an ant-routing algorithm is presented for wireless sensor networks. In the algorithm, ants are guided to choose different paths by adjusting heuristic factor. Mean-while, the weights are dynamically coordinated in the probability function. The evaporation coefficient of pheromone is improved by utilizing the idea of simulated annealing algorithm. In order to prevent local optimization, it introduces a reward and punishment mechanism into the pheromone update process. The simulation results show that the algorithm is better than the other current typical routing algorithms.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akyildiz, I.F., Su, W., Sankarasubramanian, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40, 102–114 (2002)
Hussain, D.S., Islam, O.: Genetic Algorithm for Energy-Efficient Trees in Wireless Sensor Networks. In: Kameas, A.D., Callagan, V., Hagras, H., Weber, M., Minker, W. (eds.) Advanced Intelligent Environments, pp. 139–173. Springer, US (2009)
Liu, Z., Kwiatkowska, M.Z., Constantinou, C.C.: A biologically inspired QoS routing algorithm for mobile ad hoc networks. Int. J. Wire. Mob. Comput. 4, 64–75 (2010)
Schoonderwoerd, R., Bruten, J.L., Holland, O.E., Rothkrantz, L.J.M.: Ant-based load balancing in telecommunications networks. Adapt. Behav. 5, 169–207 (1996)
Liao, W., Kao, Y., Fan, C.: An Ant Colony Algorithm for Data Aggregation in Wireless Sensor Networks. In: Proceedings of the 2007 International Conference on Sensor Technologies and Applications, pp. 101–106. IEEE Computer Society, Los Alamitos (2007)
Singh, G., Das, S., Gosavi, S.V., Pujar, S.: Ant Colony Algorithms for Steiner Trees: An Application to Routing in Sensor Networks. In: Leandro, N.D.C., Fernando, J. (eds.) Recent Developments in Biologically Inspired Computing, pp. 181–206. IGI Global (2005)
Zhang, Y., Kuhn, L.D., Fromherz, M.P.J.: Improvements on ant routing for sensor networks. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 154–165. Springer, Heidelberg (2004)
Camilo, T., Carreto, C., Silva, J.S., Boavida, F.: An energy-efficient ant-based routing algorithm for wireless sensor networks. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 49–59. Springer, Heidelberg (2006)
Corana, A., Marchesi, M., Martini, C., Ridella, S.: Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm. ACM Trans. Math. Softw. 13, 262–280 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, P., Deng, X. (2011). An Ant-Routing Algorithm for Wireless Sensor Networks. In: Ma, M. (eds) Communication Systems and Information Technology. Lecture Notes in Electrical Engineering, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21762-3_70
Download citation
DOI: https://doi.org/10.1007/978-3-642-21762-3_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21761-6
Online ISBN: 978-3-642-21762-3
eBook Packages: EngineeringEngineering (R0)