Sciweavers

95 search results - page 5 / 19
» Dynamic measurement-aware routing in practice
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 6 months ago
Securing AODV for MANETs using Message Digest with Secret Key
Due to lack of the infrastructure, open peer-to-peer architecture, shared wireless medium, limited resource constraints and highly dynamic topology, MANETs (Mobile Adhoc Networks) ...
Kamaljit I. Lakhtaria, Bhaskar N. Patel, Satish G....
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
CCR
2004
86views more  CCR 2004»
13 years 7 months ago
IPv4 address allocation and the BGP routing table evolution
The IP address consumption and the global routing table size are two of the vital parameters of the Internet growth. In this paper we quantitatively characterize the IPv4 address ...
Xiaoqiao Meng, Zhiguo Xu, Beichuan Zhang, Geoff Hu...
INFOCOM
2009
IEEE
14 years 2 months ago
DiffQ: Practical Differential Backlog Congestion Control for Wireless Networks
—Congestion control in wireless multi-hop networks is challenging and complicated because of two reasons. First, interference is ubiquitous and causes loss in the shared medium. ...
Ajit Warrier, Sankararaman Janakiraman, Sangtae Ha...
WSC
1997
13 years 9 months ago
Before Dynamic Simulation: Systematic Layout Design from Scratch
Excellent production design and planning depends on accurate simulation of a high quality layout. A good layout project will always begin with an analysis of the production volume...
David P. Sly