The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...
Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
We address the stochastic characteristics of a recently-proposed greedy routing scheme. The stochastic behaviour of individual hop advancements is examined to observe the overall ...
: There is a growing interest in deployment and evaluation of routing protocols for Vehicular Ad-Hoc Wireless Networks (VANETs) in urban contexts. The mobility model of nodes is on...