2011 Wireless Advanced 2011
DOI: 10.1109/wiad.2011.5983261
|View full text |Cite
|
Sign up to set email alerts
|

A distributed algorithm for building approximate MSTs in random-distributed WSNs

Abstract: In this work the authors propose a distributed algorithm for building approximate Minimum Spanning Trees (MSTs) for energy-efficient gathering and aggregation of sensed data in randomly-distributed, multi-hops, wireless sensor networks (WSNs). The MST created, obtained through global organization based on local interactions among each sensor and its neighbors, exploits an innovative joining mechanism that guarantees, at the same time, the creation of a near-optimal energy-efficient MST and the avoidance of cyc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 23 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?