✦ LIBER ✦

Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks

✍ Scribed by Zhenyu Xu; James Wang; Pradip K. Srimani

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 530 KB
Volume: 53
Category: Article
ISSN: 0920-8542
DOI: 10.1007/s11227-009-0325-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maintaining weakly-connected dominating

Maintaining weakly-connected dominating sets for clustering ad hoc networks

✍ Yuanzhu Peter Chen; Arthur L. Liestman 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 424 KB

An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been p

A new distributed approximation algorith

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

✍ Bo Gao; Yuhang Yang; Huiye Ma 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 516 KB

A polynomial-time approximation scheme f

A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks

✍ Xiuzhen Cheng; Xiao Huang; Deying Li; Weili Wu; Ding-Zhu Du 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views