13306 search results - page 2464 / 2662 » Theoretical Computer Science |
208
click to vote
IPPS
2005
IEEE
16 years 17 days ago
2005
IEEE
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
182
click to vote
MOBICOM
2005
ACM
16 years 16 days ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
201
click to vote
MOBICOM
2005
ACM
16 years 16 days ago
2005
ACM
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
172
click to vote
PADS
2005
ACM
16 years 16 days ago
2005
ACM
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
196
click to vote
SPAA
2005
ACM
16 years 16 days ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...