Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
The problem of finding a shortest path is common to many different fields including transportation systems, mechanical systems and computer communications. Most telecommunication ...