MACOA: A Modified Ant Colony Optimization Algorithm for the CWFRD Problem

Yong Wang; Qiang Dou; Wei  Peng; Zheng Hu  Gong

doi:10.4028/www.scientific.net/AMM.427-429.2412

Paper Titles

Optical Distribution Network Partitioning Method Based on Tabu Search
p.2395

An Optical Distribution Network Partitioning Method Based on the Branch-and-Bound
p.2399

Research on RFID Multi-Authentication Protocol Based on Hash Function
p.2403

An Angle Partitioning Based Algorithm for the ECFRD Problem in Wireless Sensor Network
p.2408

MACOA: A Modified Ant Colony Optimization Algorithm for the CWFRD Problem
p.2412

Hierarchical Routing Algorithm for Wireless Sensor Network
p.2416

Parallel Algorithm for Solving Block-Tridiagonal Linear Systems
p.2420

Multiple Watermarking Based on the Principle of Orthogonality
p.2424

Research on Data Item Correlation in Dataspace
p.2428

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 427-429MACOA: A Modified Ant Colony Optimization...

MACOA: A Modified Ant Colony Optimization Algorithm for the CWFRD Problem

Abstract:

In the traditional scheduling scheme of the message ferry in wireless sensor networks, the route of a ferry is usually designed as a simple cycle. Closed Walk Ferry Route Design (CWFRD) aims to design the ferry route as a closed walk which contains more than one simple cycle to minimize the average weighted delay of the sensed data to the sink. In this paper, an Modified Ant Colony Optimization Algorithm (MACOA) is proposed to solve the CWFRD problem. The experimental results show that MACOA can greatly reduce the average weighted delay, comparing the previous proposed algorithms.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 427-429)

Pages:

2412-2415

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.427-429.2412

Citation:

Cite this paper

Online since:

September 2013

Authors:

Yong Wang, Qiang Dou, Wei Peng, Zheng Hu Gong

Keywords:

Ant Colony Optimization Algorithm, Closed Walk, CWFRD, Message Ferry, Wireless Sensor Network (WSN)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] A. S. Arun, R. Aditya, and B. S. Mani, Mobile element scheduling with dynamic deadlines, Mobile Computing, IEEE Transactions on, vol. 6, no. 4, p.395–410, (2007).

DOI: 10.1109/tmc.2007.57

Google Scholar

[2] P. Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and D. Rubenstein, Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet, SIGOPS Oper. Syst. Rev., vol. 36, no. 5, p.96–107, (2002).

DOI: 10.1145/635508.605408

Google Scholar

[3] A. Vahdat and D. Becker, Epidemic routing for partially connected ad hoc networks, tech. rep., Duke University, (2000).

Google Scholar

[4] W. Zhao and M. Ammar, Message ferrying: Proactive routing in highly-parititioned wireless ad hoc networks, in Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems, (Puerto Rico), p.308–314, (2003).

DOI: 10.1109/ftdcs.2003.1204352

Google Scholar

[5] E. Lawler, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley-Interscience series in discrete mathematics, Wiley, (1987).

Google Scholar

[6] W. Yong, D. Qiang, P. Wei, and G. Zhenghu, Closed walk ferry route design for wireless sensor networks, Submitted to Publish, (2013).

Google Scholar

[7] M. Dorigo, Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano, Italy, (1992).

Google Scholar