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...
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
The purpose of MARIAN is to investigate the degree of suitability for mobile agent technology in routing, topology discovery, and automatic network reconfiguration in ad-hoc wirel...
Nikos Migas, William J. Buchanan, Kevin A. McArtne...
Abstract. The proliferation of sensor networks in various areas of technology has enabled real-time behavioral monitoring of various physical systems in various length and time sca...
John Michopoulos, Charbel Farhat, Elias N. Houstis
In this paper, we investigate the low coverage problem of efficient broadcast protocols in wireless ad hoc networks with realistic physical layer models. To minimize energy consum...