Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

While there are distributed algorithms for the MST problem, these algorithms require relatively large number of messages and time; this makes these algorithms impractical for resource-constrained networks such as ad hoc wireless sensor networks. In such networks, a sensor has very limited power, and...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 20; číslo 1; s. 124 - 139
Hlavní autoři:	Khan, M., Pandurangan, G., Anil Kumar, V.S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.01.2009 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithms Approximation Approximation algorithms Buildings Communication networks Computer simulation Construction Deletion Distributed algorithms Distributed Algorthms Energy efficiency Minimum Spanning Tree Nearest neighbor searches Networks Probabilistic Analysis Routing Sensor networks Sensors Studies Trees Wireless sensor networks Distributed Algorthms Sensor networks Approximation Algorithms Minimum Spanning Tree Probabilistic Analysis
ISSN:	1045-9219, 1558-2183
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!