Sciweavers

995 search results - page 121 / 199
» Minimizing Congestion in General Networks
Sort
View
ADHOC
2007
144views more  ADHOC 2007»
13 years 8 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
IAT
2009
IEEE
14 years 2 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
MOBISYS
2006
ACM
14 years 7 months ago
CoolSpots: reducing the power consumption of wireless mobile devices with multiple radio interfaces
CoolSpots enable a wireless mobile device to automatically switch between multiple radio interfaces, such as WiFi and Bluetooth, in order to increase battery lifetime. The main co...
Trevor Pering, Yuvraj Agarwal, Rajesh K. Gupta, Ro...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 2 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
MOBIWAC
2006
ACM
14 years 1 months ago
Ad hoc routing based on the stability of routes
Some reactive ad hoc protocols allow the discovery and/or storage of multiple paths to the same destination node. The selection of the path to utilize is commonly based on the cri...
Alicia Triviño-Cabrera, Irene Nieves-P&eacu...