Randomized permutation routing in multihop ad hoc networks with unknown destinations
A large variety of permutation routing protocols in a single-hop Network are known to day. Since they are single hop, there is always a wireless path connecting two nodes. One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster c...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23824 |
| Aporte de: |
| Sumario: | A large variety of permutation routing protocols in a single-hop Network are known to day. Since they are single hop, there is always a wireless path connecting two nodes.
One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster called clusterhead is responsible for the routing service.
In this paper, we propose a clustering mechanism to perform permutation routing in multi-hop ad hoc Networks having p stations and in which n data items are saved. We first develop a clustering algorithm to partition stations into clusters. Secondly, we run a locally permutation routing to broadcast items to their local destinations in each group. Finally we use a multicast procedure to transmit outgoing items to their final cluster destination. |
|---|