Grade Diffusion Algorithm

Abstract:

Article Preview

In this paper, a grade diffusion algorithm is proposed to solve the sensor node’s transmission problem and the sensor node’s loading problem in wireless sensor networks by to arrange the sensor node’s routing. In addition to them, the sensor node also can save some backup nodes to reduce the energy consumption for the re-looking routing by our proposed algorithm in case the sensor node’s routing is broken. In the simulation, the grade diffusion algorithm can save 28.66% energy and increase 76.39% lift time than the tradition algorithms for sensor node. Moreover, our proposed algorithm has the less data package transmission loss and the hop count than the tradition algorithms in our simulate setting. Hence, in addition to balance the sensor node’s loading and reduce the energy consumption, our algorithm can send the data package to destination node quickly and correctly.

Info:

Periodical:

Edited by:

Wen-Hsiang Hsieh

Pages:

2064-2068

Citation:

J. H. Ho et al., "Grade Diffusion Algorithm", Applied Mechanics and Materials, Vols. 284-287, pp. 2064-2068, 2013

Online since:

January 2013

Export:

Price:

$38.00

[1] J. A. Carballido, I. Ponzoni and N. B. Brignole, A graph-based genetic algorithm for sensor network design, Information Sciences (2007) 5091-5102.

DOI: https://doi.org/10.1016/j.ins.2007.05.036

[2] S. Corson and J. Macker, Mobile Ad Hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations, RFC 2501, (1999).

DOI: https://doi.org/10.17487/rfc2501

[3] M. Dorigo and L. M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Computational Intelligence Society (1997) 53-66.

DOI: https://doi.org/10.1109/4235.585892

[4] H. Zhen, B. S. Lee and X. S. Wang, Aggregation in sensor networks with a user-provided quality of service goal, Information Sciences (2008) 2128-2149.

DOI: https://doi.org/10.1016/j.ins.2008.01.003

[5] T. P. Hong and C. H. Wu, An Improved Weighted Clustering Algorithm for Determination of Application Nodes in Heterogeneous Sensor Networks, Journal of Information Hiding and Multimedia Signal Processing (2011) 173-184.

[6] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann and F. Silva, Directed Diffusion for Wireless Sensor Networking, IEEE/ACM Transactions on Networking (2003) 2-16.

DOI: https://doi.org/10.1109/tnet.2002.808417

[7] J. Pan, Y. Hou, L. Cai, Y. Shi and X. Shen, Topology control for wireless sensor networks, The Ninth ACM International Conference on Mobile Computing and Networking (2003) 286-299.

DOI: https://doi.org/10.1145/938985.939015

[8] C. E. Perkins and E. Royer, Ad Hoc On-Demand Distance Vector Routing, Proceedings of IEEE WMCSA (1999) 90-100.

DOI: https://doi.org/10.1109/mcsa.1999.749281

[9] E. M. Royer and C. -K. Toh, A Review of Current Routing Protocols for Ad-Hoc Mobile Networks, IEEE Personal Communications (1999) 46-55.

DOI: https://doi.org/10.1109/98.760423

[10] J. H. Ho, H. C. Shih, B. Y. Liao and S. C. Chu, A Ladder Diffusion Algorithm Using Ant Colony Optimization for Wireless Sensor Networks, Information Sciences (2012) 204-212.

DOI: https://doi.org/10.1016/j.ins.2011.03.013