Sciweavers

552 search results - page 52 / 111
» Routing complexity of faulty networks
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
AINA
2004
IEEE
13 years 11 months ago
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
Gang Feng
AINA
2009
IEEE
14 years 2 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
JUCS
2007
93views more  JUCS 2007»
13 years 7 months ago
Quality of Service Routing in a MANET with OLSR
: Ad hoc wireless networks have enormous commercial and military potential because of their self-organizing capacity and mobility support. However, some specificities of these net...
Dang-Quan Nguyen, Pascale Minet
SIGMETRICS
2000
ACM
217views Hardware» more  SIGMETRICS 2000»
13 years 7 months ago
Experimenting with an Ad Hoc wireless network on campus: insights and experiences
Ad hoc wireless networks are new communication networks that can be dynamically formed and deformed onthe- y, anytime and anywhere. User data is routed with the help of an ad hoc ...
Chai-Keong Toh, Richard Chen, Minar Delwar, Donald...