We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
The use of contention-based MAC protocols combined with hidden terminal problems make multi-hop wireless ad hoc networks much more sensitive to load and congestion than wired netw...
Ken Tang, Katia Obraczka, Sung-Ju Lee, Mario Gerla
— Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay no...
This paper proposes and specifies a protocol for distributing and managing group keys in ad hoc environments, which applies for the Secure Optimized Link State Routing Protocol. Ou...
Natalia Castro Fernandes, Otto Carlos Muniz Bandei...