✦ LIBER ✦

Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks

✍ Scribed by Weiping Shang; Pengjun Wan; Xiaodong Hu

Publisher: Higher Education Press and Springer
Year: 2009
Tongue: English
Weight: 203 KB
Volume: 5
Category: Article
ISSN: 1673-3452
DOI: 10.1007/s11464-009-0050-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Linear Programming-based Evolutionary

A Linear Programming-based Evolutionary Algorithm for the Minimum Power Broadcast Problem in Wireless Sensor Networks

✍ Roberto Montemanni; Parvaz Mahdabi 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 690 KB

TDMA scheduling algorithms for wireless

TDMA scheduling algorithms for wireless sensor networks

✍ Sinem Coleri Ergen; Pravin Varaiya 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 1001 KB

Approximation algorithm for minimal conv

Approximation algorithm for minimal convergecast time problem in wireless sensor networks

✍ Weiping Shang; Pengjun Wan; Xiaodong Hu 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 528 KB

Improved Algorithm for Minimum Data Aggr

Improved Algorithm for Minimum Data Aggregation Time Problem in Wireless Sensor Networks

✍ Jianming ZHU; Xiaodong HU 📂 Article 📅 2008 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 285 KB

Minimum cost localization problem in wir

Minimum cost localization problem in wireless sensor networks

✍ Minsu Huang; Siyuan Chen; Yu Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 877 KB

Localization is a fundamental problem in wireless sensor networks. Current localization algorithms mainly focus on checking the localizability of a network and/or how to localize as many nodes as possible given a static set of anchor nodes and distance measurements. In this paper, we study a new opt

Hybrid approximation for minimum-cost ta

Hybrid approximation for minimum-cost target coverage in wireless sensor networks

✍ Zheng Fang; Jie Wang 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 383 KB