We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
Secure routing in wireless sensor networks (WSN) is a crucial problem that has drawn the attention of researchers. The motivation for tackling this problem comes directly from the...
Abstract— Mobile ad hoc networks often support sensitive applications. These applications may require that users’ identity, location, and correspondents be kept secret. This is...
Heesook Choi, Patrick Drew McDaniel, Thomas F. La ...
Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local informa...
Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless networ...