Sciweavers

866 search results - page 117 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
JSAC
2010
142views more  JSAC 2010»
15 years 1 months ago
Handling inelastic traffic in wireless sensor networks
The capabilities of sensor networking devices are increasing at a rapid pace. It is therefore not impractical to assume that future sensing operations will involve real time (inela...
Jiong Jin, Avinash Sridharan, Bhaskar Krishnamacha...
MOBIHOC
2009
ACM
16 years 6 months ago
MotionCast: on the capacity and delay tradeoffs
In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay tradeoffs for it. Assuming nodes move according ...
Chenhui Hu, Xinbing Wang, Feng Wu
GECCO
2008
Springer
146views Optimization» more  GECCO 2008»
15 years 7 months ago
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation ...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 12 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
JSAC
2007
97views more  JSAC 2007»
15 years 6 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li