Sciweavers

1355 search results - page 210 / 271
» A Taxonomy of Localization Schemes for Wireless Sensor Netwo...
Sort
View
MOBICOM
2009
ACM
14 years 2 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
HYBRID
2009
Springer
14 years 2 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...

Presentation
945views
12 years 1 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
WICON
2008
13 years 9 months ago
Risk-aware beacon scheduling for tree-based ZigBee/IEEE 802.15.4 wireless networks
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times to avoid beacon collisions. The beacon schedule determines packet delivery laten...
Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami
TMC
2008
108views more  TMC 2008»
13 years 7 months ago
Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks
Abstract--Two well-known problems that can cause performance degradations in IEEE 802.11 wireless networks are the exposednode (EN) and hidden-node (HN) problems. Although there ha...
Li Bin Jiang, Soung Chang Liew