A Routing Algorithm for Wireless Sensor Networks

DOI

10.2991/iccasm.2012.378How to use a DOI?

Keywords

Wireless sensor networks, data-aggregation, tree structure, maximum lifetime, minimum routing

Abstract

This paper presents a data-aggregation algorithm in the environment of wireless sensor network based on maximum lifetime. In this algorithm, the whole network is constructed into a tree structure with sink being the root of the tree. In the process of data-aggregation tree structure, in order to enable the data transmission path is the shortest, selected the smallest deflection angle relative to the sink as the next hop node. By the same time the remaining energy of the nodes is taken into account and achieves load balancing, maximizes the network lifetime.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Fei Du
AU  - Jianping Lv
PY  - 2012/08
DA  - 2012/08
TI  - A Routing Algorithm for Wireless Sensor Networks
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 1476
EP  - 1479
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.378
DO  - 10.2991/iccasm.2012.378
ID  - Du2012/08
ER  -