Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
We study the optimal control of propagation of packets in delay tolerant mobile ad-hoc networks. We consider a two-hop forwarding policy under which the expected number of nodes ca...
Eitan Altman, Tamer Basar, Francesco De Pellegrini
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Managing problem tickets is a key issue in the IT services industry. A large service provider may handle thousands of problem tickets from its customer on daily basis. The efficie...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
Many routing protocols have been designed for Ad Hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In the paper, we pro...
Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng, Po Tsa...