13214 search results - page 162 / 2643 » Pseudorandomness for network algorithms |
262
Voted
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
235
Voted
ICNSC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Dynamic scheduling management in wireless sensor networks is one of the most challenging problems in long lifetime monitoring applications. In this paper, we propose and evalua...
193
click to vote
LCN
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
187
click to vote
IWCMC
2010
ACM
16 years 2 days ago
2010
ACM
As wireless networks have been widely deployed for public mobile services, predicting the location of a mobile user in wireless networks became an interesting and challenging prob...
193
Voted
DSN
2002
IEEE
15 years 12 months ago
2002
IEEE
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...