Sciweavers

1404 search results - page 150 / 281
» On General Laws of Complex Networks
Sort
View
MOBICOM
2003
ACM
15 years 9 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
NETGAMES
2003
ACM
15 years 9 months ago
Mobility and stability evaluation in wireless multi-hop networks using multi-player games
Plenty of work was contributed in the field of protocol design and performance evaluation of multi-hop networks. It is generally accepted that mobility has a huge impact on the p...
Frank H. P. Fitzek, Leonardo Badia, Michele Zorzi,...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 6 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
PERVASIVE
2008
Springer
15 years 4 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
TON
2002
144views more  TON 2002»
15 years 4 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...