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...
Location discovery is a fundamental problem in wireless ad hoc networks. Most of the ad hoc routing protocols use some form of flooding to discover the location and route of a mobi...
Vamsi K. Parachuri, Arjan Durresi, Durga S. Dash, ...
All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. Although it is tempting to assume that a...
David Kotz, Calvin C. Newport, Robert S. Gray, Jas...
Setting up an IDS architecture on ad-hoc network is hard because it is not easy to find suitable locations to setup IDS's. One way is to divide the network into a set of clust...
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...