Preferable Wireless Sensor Networks Algorithm Based On the Maximum Weight Value of Time

DOI

10.2991/emcs-16.2016.92How to use a DOI?

Keywords

Wireless sensor network; Self-organization; Maximum weight value; The longest path; Robustness

Abstract

The characteristic of Wireless Sensor Networks (WSN)is the one which supported by non-partition and non-infrastructure under large-scale self-organization and limited capacity. This kind of network system is self-organized by means of wireless communications between nodes. However, capacity within nodes is limited, thus we put forward a better method of cluster network on the basis of the maximum weight calculation. In order to make data transmission as effective as possible, we have adopted a method of broadcasting to classify node as inner-cluster node and cluster-head node, and found the longest path (also known as the critical path). Ultimately, network will find the cluster-head node of next layer quickly after the failure of one of the nodes under control, and it will make the valid node complete data transmission, achieve robustness of network, and maintain its life circle effectively.

Copyright

© 2016, 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  - Li Zhang
AU  - Yi Liu
AU  - Yongyi Zhao
PY  - 2016/01
DA  - 2016/01
TI  - Preferable Wireless Sensor Networks Algorithm Based On the Maximum Weight Value of Time
BT  - Proceedings of the 2016 International Conference on Education, Management, Computer and Society
PB  - Atlantis Press
SP  - 385
EP  - 388
SN  - 2352-538X
UR  - https://doi.org/10.2991/emcs-16.2016.92
DO  - 10.2991/emcs-16.2016.92
ID  - Zhang2016/01
ER  -