Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks

Autores
Chawla, Mohit; Goel, Nishith; Kalaichelvan, Kalai; Nayak, Amiya; Stojmenovic, Ivan
Año de publicación
2006
Idioma
español castellano
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.
1st IFIP International Conference on Ad-Hoc NetWorking
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Routing protocols
RTS/CTS messages
guaranteed delivery
beaconless routing scheme
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/23825
Acceder
id SEDICI_90ec7e71ae7ed7e284ed4257e2cb86b1
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23825
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networksChawla, MohitGoel, NishithKalaichelvan, KalaiNayak, AmiyaStojmenovic, IvanCiencias InformáticasRouting protocolsRTS/CTS messagesguaranteed deliverybeaconless routing schemeExisting position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.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/23825spainfo: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/23825Institucionalhttp://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.256SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks
title Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks
spellingShingle Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks
Chawla, Mohit
Ciencias Informáticas
Routing protocols
RTS/CTS messages
guaranteed delivery
beaconless routing scheme
title_short Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks
title_full Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks
title_fullStr Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks
title_full_unstemmed Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks
title_sort Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks
dc.creator.none.fl_str_mv Chawla, Mohit
Goel, Nishith
Kalaichelvan, Kalai
Nayak, Amiya
Stojmenovic, Ivan
author Chawla, Mohit
author_facet Chawla, Mohit
Goel, Nishith
Kalaichelvan, Kalai
Nayak, Amiya
Stojmenovic, Ivan
author_role author
author2 Goel, Nishith
Kalaichelvan, Kalai
Nayak, Amiya
Stojmenovic, Ivan
author2_role author
author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Routing protocols
RTS/CTS messages
guaranteed delivery
beaconless routing scheme
topic Ciencias Informáticas
Routing protocols
RTS/CTS messages
guaranteed delivery
beaconless routing scheme
dc.description.none.fl_txt_mv Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.
1st IFIP International Conference on Ad-Hoc NetWorking
Red de Universidades con Carreras en Informática (RedUNCI)
description Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.
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/23825
url http://sedici.unlp.edu.ar/handle/10915/23825
dc.language.none.fl_str_mv spa
language spa
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_ 1842260122914521088
score 13.13397

Publicaciones similares