3793 search results - page 9 / 759 » The wireless synchronization problem |
ICDCSW
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
PIMRC
2008
IEEE
14 years 1 months ago
2008
IEEE
—In this paper, we propose a new control method to cover “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are dis...
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...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
—We propose a new approach to evaluate the ultimate performance limit of time synchronization in wireless sensor networks based on the estimation theory. In particular the lower ...