Issue |
MATEC Web Conf.
Volume 82, 2016
2016 International Conference on Design, Mechanical and Material Engineering (D2ME 2016)
|
|
---|---|---|
Article Number | 01010 | |
Number of page(s) | 6 | |
Section | Chapter 1: Mechanical Engineering | |
DOI | https://doi.org/10.1051/matecconf/20168201010 | |
Published online | 31 October 2016 |
Topology Optimisation of Wireless Sensor Networks
1 National Research University of Electronic Technology, Zelenograd, Moscow, 124498, Russia
2 Bonn-Rhein-Sieg University of Applied Science, 20 Grantham-Allee, Sankt Augustin, D-53757, Germany
3 Glyndwr University, Plas Coch, Mold Road, Wrexham, LL11 2AW, UK
a Corresponding author: y.vagapov@glyndwr.ac.uk
Wireless sensor networks are widely used in a variety of fields including industrial environments. In case of a clustered network the location of cluster head affects the reliability of the network operation. Finding of the optimum location of the cluster head, therefore, is critical for the design of a network. This paper discusses the optimisation approach, based on the brute force algorithm, in the context of topology optimisation of a cluster structure centralised wireless sensor network. Two examples are given to verify the approach that demonstrate the implementation of the brute force algorithm to find an optimum location of the cluster head.
© The Authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.