
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Fully Distributed SelfOrganization of Shortest Spanning Tree and Optimal Sink Node Position for LargeScale Wireless Sensor Network
Kazunori MIYOSHI Masahiro JIBIKI Tutomu MURASE
Publication
IEICE TRANSACTIONS on Communications
Vol.E95B
No.2
pp.449459 Publication Date: 2012/02/01 Online ISSN: 17451345
DOI: 10.1587/transcom.E95.B.449 Print ISSN: 09168516 Type of Manuscript: PAPER Category: Network Keyword: selforganizing control, distributed control, wireless network, sensor network,
Full Text: PDF(7MB)>>
Summary:
The primary challenges faced by wireless sensor networks are how to construct the shortest spanning tree and how to determine the optimal sink node position in terms of minimizing the data transmission times and their variances for data gathering from all sensor nodes to a sink node. To solve these two problems, we propose a novel algorithm that uses the polygonal affine shortening algorithm with flow aggregation. This algorithm enables a wireless sensor network that has movable sensor nodes and one movable sink node to selforganize the shortest spanning tree and selfdetermine the optimal sink node position in a fully distributed manner. We also show that our algorithm is faster than the existing shortest path algorithm in terms of computational complexity.

