|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing
An improved ant-based routing protocol in Wireless Sensor Networks
Atlanta, GA
November 17-November 20
ISBN: 1-4244-0428-2
| ASCII Text | x | ||
| null Ge Chen, null Tian-De Guo, null Wen-Guo Yang, null Tong Zhao, "An improved ant-based routing protocol in Wireless Sensor Networks," International Conference on Collaborative Computing: Networking, Applications and Worksharing, pp. 64, 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/COLCOM.2006.361893, author = {null Ge Chen and null Tian-De Guo and null Wen-Guo Yang and null Tong Zhao}, title = {An improved ant-based routing protocol in Wireless Sensor Networks}, journal ={International Conference on Collaborative Computing: Networking, Applications and Worksharing}, volume = {0}, year = {2006}, isbn = {1-4244-0428-2}, pages = {64}, doi = {http://doi.ieeecomputersociety.org/10.1109/COLCOM.2006.361893}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - International Conference on Collaborative Computing: Networking, Applications and Worksharing TI - An improved ant-based routing protocol in Wireless Sensor Networks SN - 1-4244-0428-2 SP EP A1 - null Ge Chen, A1 - null Tian-De Guo, A1 - null Wen-Guo Yang, A1 - null Tong Zhao, PY - 2006 KW - protocol dead-lock KW - ant-based routing protocol KW - wireless sensor networks KW - ant colony optimization KW - data-centric routing protocol KW - search ant KW - global pheromone update KW - retry rule VL - 0 JA - International Conference on Collaborative Computing: Networking, Applications and Worksharing ER - | |||
Routing in wireless sensor networks (WSNs) is very challenging due to their inherent characteristics of large scale, no global identification, dynamic topology, and very limited power, memory, and computational capacities for each sensor. Recent research on WSNs routing protocol has proved that data-centric technologies are needed for performing in-network aggregation of data to yield energy-efficient dissemination. As an effective distributed approach, ant colony optimization (ACO) algorithms have been introduced to the design of data-centric routing protocol and have got many achievements, but still have some shortcomings blocking their further application in the large scale WSNs. To overcome the flaws of conventional ant-based data-centric routing algorithms, we proposed an improved protocol by adding a new type of ant, search ant, to supply prior information to the following ants. Besides, we introduced the strategy of simulating global pheromone update to accelerate the convergence of our algorithm and defined a "retry" rule to avoid dead-lock of the protocol. All of these modifications made the routing protocol scalable, practicable and energy-conservative. Simulation results showed the great advantages of the new protocol
Index Terms:
protocol dead-lock, ant-based routing protocol, wireless sensor networks, ant colony optimization, data-centric routing protocol, search ant, global pheromone update, retry rule
Citation:
null Ge Chen, null Tian-De Guo, null Wen-Guo Yang, null Tong Zhao, "An improved ant-based routing protocol in Wireless Sensor Networks," colcom, pp.64, 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2006
Usage of this product signifies your acceptance of the Terms of Use.
