๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimum Data-Latency-Bound -Sink Placement Problem in Wireless Sensor Networks

โœ Scribed by Donghyun Kim; Wei Wang; Sohaee, N.; Changcun Ma; Weili Wu; Wonjun Lee; Ding-Zhu Du

Book ID
118216857
Publisher
IEEE
Year
2011
Tongue
English
Weight
729 KB
Volume
19
Category
Article
ISSN
1063-6692

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimum latency joint scheduling and rou
Minimum latency joint scheduling and routing in wireless sensor networks
โœ Gang Lu; Bhaskar Krishnamachari ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 654 KB

Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. In this pap

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