We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
Murtuza Jadliwala, Sheng Zhong, Shambhu J. Upadhya...
Although the content of sensor messages describing “events of interest” may be encrypted to provide confidentiality, the context surrounding these events may also be sensitiv...
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Predicting accurately the spatiotemporal evolution of a diffusive environmental hazard is of paramount importance for its effective containment. We approximate the front line of a...