Distributed Construction of Connected Dominating Sets Optimized by Minimum-Weight Spanning Tree in Wireless Ad-Hoc Sensor Networks

A Connected Dominating Set (CDS) is a subset V' of V for the graph G(V,E) and induces a connected subgraph, such that each node in V -V' is at least adjacent to one node in V'. CDSs have been proposed to formulate virtual backbones in wireless ad-hoc sensor networks to design routing...

Celý popis

Podrobná bibliografie

Vydáno v:	2014 IEEE 17th International Conference on Computational Science and Engineering s. 901 - 908
Hlavní autoři:	Sijun Ren, Ping Yi, Dapeng Hong, Yue Wu, Ting Zhu
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.12.2014
Témata:	Ad hoc networks Algorithm design and analysis Approximation algorithms Broadcasting minimum connected dominating set minimum-weight spanning tree parallel and distributed algorithm Relays wireless ad-hoc sensor networks Wireless communication Wireless sensor networks
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!