552 search results - page 52 / 111 » Routing complexity of faulty networks |
104
Voted
COMSWARE
2007
IEEE
15 years 5 months ago
2007
IEEE
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...
AINA
2004
IEEE
15 years 2 months ago
2004
IEEE
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...
143
click to vote
AINA
2009
IEEE
15 years 6 months ago
2009
IEEE
—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...
93
Voted
JUCS
2007
14 years 11 months ago
2007
: 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...
152
click to vote
SIGMETRICS
2000
ACM
14 years 11 months ago
2000
ACM
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 ...