Sciweavers

93 search results - page 10 / 19
» Performance evaluation of minimum interference routing in ne...
Sort
View
COMSWARE
2007
IEEE
14 years 2 months ago
On Optimal Performance in Mobile Ad hoc Networks
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...
Tapas K. Patra, Joy Kuri, Pavan Nuggehalli
ICC
2009
IEEE
124views Communications» more  ICC 2009»
13 years 5 months ago
Routing Games for Traffic Engineering
Abstract--Current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in mo...
Federico Larroca, Jean-Louis Rougier
INFOCOM
2008
IEEE
14 years 2 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy
JCST
2008
144views more  JCST 2008»
13 years 7 months ago
Beacon-Less Geographic Routing in Real Wireless Sensor Networks
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
Juan A. Sánchez, Rafael Marín-P&eacu...
COMCOM
2004
153views more  COMCOM 2004»
13 years 7 months ago
BLR: beacon-less routing algorithm for mobile ad hoc networks
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
Marc Heissenbüttel, Torsten Braun, Thomas Ber...