1017 search results - page 52 / 204 » On the Computational Complexity of Sensor Network Localizati... |
ICDE
2012
IEEE
11 years 11 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
SAC
2003
ACM
14 years 2 months ago
2003
ACM
Networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. Programming embedded systems wit...
MOBIHOC
2004
ACM
14 years 8 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
MOBIHOC
2006
ACM
14 years 8 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
DMSN
2006
ACM
14 years 2 months ago
2006
ACM
This paper presents a novel research direction in the field of sensor data management. It concerns transactional support in heterogeneous large scale sensor systems. Besides well...