A Pareto Ant Colony Optimization Algorithm for Application-Specific Routing in Wireless Sensor & Actor Networks 


Vol. 36,  No. 4, pp. 346-353, Apr.  2011


PDF
  Abstract

Routing schemes that service applications with various delay times, maintaining the long network life time are required in wireless sensor & actor networks. However, it is known that network lifetime and hop count of trees used in routing methods have the tradeoff between them. In this paper, we propose a Pareto Ant Colony Optimization algorithm to find the Pareto tree set such that it optimizes these both tradeoff objectives. As it enables applications which have different delay times to select appropriate routing trees, not only satisfies the requirements of various multiple applications but also guarantees long network lifetime. We show that the Pareto tree set found by proposed algorithm consists of trees that are closer to the Pareto optimal points in terms of hop count and network lifetime than minimum spanning tree which is a representative routing tree.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Kang, M. Choi, M. Jung, S. Lee, "A Pareto Ant Colony Optimization Algorithm for Application-Specific Routing in Wireless Sensor & Actor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 4, pp. 346-353, 2011. DOI: .

[ACM Style]

Seung-Ho Kang, Myeong-Soo Choi, Min-A Jung, and Seong-Ro Lee. 2011. A Pareto Ant Colony Optimization Algorithm for Application-Specific Routing in Wireless Sensor & Actor Networks. The Journal of Korean Institute of Communications and Information Sciences, 36, 4, (2011), 346-353. DOI: .

[KICS Style]

Seung-Ho Kang, Myeong-Soo Choi, Min-A Jung, Seong-Ro Lee, "A Pareto Ant Colony Optimization Algorithm for Application-Specific Routing in Wireless Sensor & Actor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 4, pp. 346-353, 4. 2011.