Sciweavers

641 search results - page 2 / 129
» Improved Bounds for Wireless Localization
Sort
View
PERCOM
2008
ACM
14 years 5 months ago
An Algorithm for Distributed Beacon Selection
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
MOBIHOC
2004
ACM
14 years 5 months ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li
ICALP
2005
Springer
13 years 11 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf
NAS
2010
IEEE
13 years 4 months ago
Time-Bounded Essential Localization for Wireless Sensor Networks
In many practical applications of wireless sensor networks, it is crucial to accomplish the localization of sensors within a given time bound. We find that the traditional defin...
Wei Cheng, Nan Zhang 0004, Min Song, Dechang Chen,...
IEEECIT
2006
IEEE
13 years 11 months ago
An Energy-Efficient Localization Scheme with Specified Lower Bound for Wireless Sensor Networks
Localization is a basic and critical requirement for wireless sensor network applications, e.g. target tracking, monitoring and intrusion detection. In the received signal strengt...
Haoran Feng, Ruixi Yuan, Chundi Mu