Hop Count Distributions of the Furthest amd Nearest Distance Routing Protocols in Mobile Ad Hoc Networks
In this paper, we derive the probability distribution of the number of hops required for a source node to reach a destination node in a two-dimensional mobile ad hoc network when a fixed number of nodes are uniformly distributed in a finite region under the nearest- and furthest - distance routing p...
Autor principal: | |
---|---|
Outros Autores: | , |
Formato: | article |
Idioma: | eng |
Publicado em: |
2015
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/10174/14172 |
País: | Portugal |
Oai: | oai:dspace.uevora.pt:10174/14172 |