Randomized permutation routing in multihop ad hoc networks with unknown destinations

Autores
Karimou, Djibo; Myoupo, Jean Frédéric
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
1st IFIP International Conference on Ad-Hoc NetWorking
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Routing protocols
Clustering
Network communications
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23824
Acceder
id SEDICI_6bcf7894d8f705dc93def3d5f7eb2231
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23824
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Randomized permutation routing in multihop ad hoc networks with unknown destinationsKarimou, DjiboMyoupo, Jean FrédéricCiencias InformáticasRouting protocolsClusteringNetwork communicationsA 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.1st IFIP International Conference on Ad-Hoc NetWorkingRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23824enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34635-Xinfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:28:25Zoai:sedici.unlp.edu.ar:10915/23824Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:28:25.254SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Randomized permutation routing in multihop ad hoc networks with unknown destinations
title Randomized permutation routing in multihop ad hoc networks with unknown destinations
spellingShingle Randomized permutation routing in multihop ad hoc networks with unknown destinations
Karimou, Djibo
Ciencias Informáticas
Routing protocols
Clustering
Network communications
title_short Randomized permutation routing in multihop ad hoc networks with unknown destinations
title_full Randomized permutation routing in multihop ad hoc networks with unknown destinations
title_fullStr Randomized permutation routing in multihop ad hoc networks with unknown destinations
title_full_unstemmed Randomized permutation routing in multihop ad hoc networks with unknown destinations
title_sort Randomized permutation routing in multihop ad hoc networks with unknown destinations
dc.creator.none.fl_str_mv Karimou, Djibo
Myoupo, Jean Frédéric
author Karimou, Djibo
author_facet Karimou, Djibo
Myoupo, Jean Frédéric
author_role author
author2 Myoupo, Jean Frédéric
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Routing protocols
Clustering
Network communications
topic Ciencias Informáticas
Routing protocols
Clustering
Network communications
dc.description.none.fl_txt_mv 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.
1st IFIP International Conference on Ad-Hoc NetWorking
Red de Universidades con Carreras en Informática (RedUNCI)
description 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.
publishDate 2006
dc.date.none.fl_str_mv 2006-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23824
url http://sedici.unlp.edu.ar/handle/10915/23824
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/0-387-34635-X
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260122913472512
score 13.13397

Publicaciones similares