✦ LIBER ✦

On the construction ofk-connectedm-dominating sets in wireless networks

✍ Scribed by Yingshu Li; Yiwei Wu; Chunyu Ai; Raheem Beyah

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 799 KB
Volume: 23
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-010-9346-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving Construction for Connected Dom

Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

✍ Manki Min; Hongwei Du; Xiaohua Jia; Christina Xiao Huang; Scott C.-H. Huang; Wei 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 83 KB

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

On the construction of maximum residual

On the construction of maximum residual energy resource broadcast trees with minimum diameter in static ad hoc wireless networks

✍ Chor Ping Low; Lai Woen Goh 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 1 views

Each node in a wireless ad hoc network runs on a local energy source that has a limited energy life span. Thus, energy conservation is a critical issue in such networks. In addition, it is in general desirable to construct routes with low hop counts as a route with a high hop count is more likely to