528 search results - page 64 / 106 » Approximation algorithm for minimal convergecast time proble... |
MOBIHOC
2006
ACM
14 years 7 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...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
MOBIHOC
2000
ACM
14 years 5 days ago
2000
ACM
— We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. We addres...
IPSN
2009
Springer
14 years 2 months ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
PERVASIVE
2007
Springer
14 years 1 months ago
2007
Springer
We propose a method through which dynamic sensor nodes determine that they move together, by communicating and correlating their movement information. We describe two possible solu...