We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Simulation studies have been the predominant method of evaluating ad hoc routing algorithms. Despite their wide use and merits, simulations are generally time consuming. Furthermo...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
Abstract—We study the ubiquitous data collection for mobile users in wireless sensor networks. People with handheld devices can easily interact with the network and collect data....
Wireless vehicular ad hoc networks are characterized by multi-hop transmission, where a key problem is the design of routing, e.g., how to efficiently direct the information flo...