DCFR: A Novel Double Cost Function based Routing Algorithm for Wireless Sensor Networks

Anfeng Liu 1 Ju Ren 1 Xu Li 2, 3 Zhigang Chen 3 Xuemin Shen 4
1 Central South University [Changsha]
2 FUN - Self-organizing Future Ubiquitous Network
Inria Lille - Nord Europe
3 LIFL - Laboratoire d'Informatique Fondamentale de Lille
4 ECE - Department of Electrical and Computer Engineering [Waterloo]
Abstract : Cost function based routing has been widely studied in wireless sensor networks for energy efficiency and network lifetime elongation. Existing algorithms however have limited effects because they adopt a single cost function that does not fully capture nodal energy consumption situation. In this paper, we propose a novel Double Cost Function based Routing (DCFR) algorithm, which takes into account end-to-end energy consumption, nodal remaining energy, and energy consumption rate altogether. An extensive simulation indicates that DCFR can lead to more balanced and efficient energy usage among nodes than existing algorithms.
Type de document :
Communication dans un congrès
ICC 2012 - IEEE International Conference on Communications, Jun 2012, Ottawa, Canada. IEEE, Communications (ICC), 2012 IEEE International Conference on, pp.323-327, 2012, 〈http://icc2012.ieee-icc.org/〉. 〈10.1109/ICC.2012.6364228〉
Liste complète des métadonnées
https://hal.inria.fr/hal-00669492
Contributeur : Xu Li <>
Soumis le : lundi 13 février 2012 - 12:40:44
Dernière modification le : jeudi 21 février 2019 - 10:52:47

Identifiants

Collections

INRIA | UNIV-LILLE3

Citation

Anfeng Liu, Ju Ren, Xu Li, Zhigang Chen, Xuemin Shen. DCFR: A Novel Double Cost Function based Routing Algorithm for Wireless Sensor Networks. ICC 2012 - IEEE International Conference on Communications, Jun 2012, Ottawa, Canada. IEEE, Communications (ICC), 2012 IEEE International Conference on, pp.323-327, 2012, 〈http://icc2012.ieee-icc.org/〉. 〈10.1109/ICC.2012.6364228〉. 〈hal-00669492〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

241

Contact


archive-ouverte@inria.fr