Sciweavers

641 search results - page 23 / 129
» Improved Bounds for Wireless Localization
Sort
View
TSP
2010
13 years 2 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
MOBICOM
2006
ACM
14 years 1 months ago
Localized algorithm for aggregate fairness in wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
Shigang Chen, Zhan Zhang
APAL
2011
13 years 2 months ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
MMSP
2008
IEEE
155views Multimedia» more  MMSP 2008»
14 years 2 months ago
Structured network coding and cooperative local peer-to-peer repair for MBMS video streaming
—By providing coding ability at intermediate nodes, network coding has been shown to improve throughput in wireless broadcast/multicast networks. Considering a scenario where wir...
Xin Liu, Gene Cheung, Chen-Nee Chuah
IPSN
2007
Springer
14 years 1 months ago
Wireless localization using self-organizing maps
Localization is an essential service for many wireless sensor network applications. While several localization schemes rely on anchor nodes and range measurements to achieve fine...
Gianni Giorgetti, Sandeep K. S. Gupta, Gianfranco ...