Sciweavers

Share
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
10 years 3 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
10 years 3 months ago
A resource--efficient time estimation for wireless sensor networks
We study the problem of providing a sensor node with an accurate estimate of the current time, from a novel prospective which is complementary to the well
Daniela Tulone
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
10 years 5 months ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer
DIALM
2004
ACM
124views Algorithms» more  DIALM 2004»
10 years 5 months ago
Localized techniques for broadcasting in wireless sensor networks
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
Lorenzo Orecchia, Alessandro Panconesi, Chiara Pet...
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
10 years 5 months ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...
DIALM
2004
ACM
121views Algorithms» more  DIALM 2004»
10 years 5 months ago
Unit disk graph approximation
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
10 years 5 months ago
OVSF-CDMA code assignment in wireless ad hoc networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading...
Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
10 years 5 months ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi
books