Sciweavers

32545 search results - page 6404 / 6509
» Data Structures and Algorithms
Sort
View
MOBIHOC
2005
ACM
15 years 11 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
DCC
2003
IEEE
15 years 10 months ago
Code Compression Using Variable-to-fixed Coding Based on Arithmetic Coding
Embedded computing systems are space and cost sensitive; memory is one of the most restricted resources, posing serious constraints on program size. Code compression, which is a s...
Yuan Xie, Wayne Wolf, Haris Lekatsas
MOBIHOC
2004
ACM
15 years 10 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
EUROSYS
2007
ACM
15 years 8 months ago
Latency and bandwidth-minimizing failure detectors
Failure detectors are fundamental building blocks in distributed systems. Multi-node failure detectors, where the detector is tasked with monitoring N other nodes, play a critical...
Kelvin C. W. So, Emin Gün Sirer
EUROSYS
2007
ACM
15 years 8 months ago
Removing the memory limitations of sensor networks with flash-based virtual memory
Virtual memory has been successfully used in different domains to extend the amount of memory available to applications. We have adapted this mechanism to sensor networks, where,...
Andreas Lachenmann, Pedro José Marró...
« Prev « First page 6404 / 6509 Last » Next »