On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10174/1433 |
Resumo: | This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the exact probability distribution of the minimum hop count from the location density of relay nodes in the multihop path selected with the Most Forward within Radius (MFR) scheme. The probability that the source and destination nodes are connected (provided by Ghasemi and Nader-Esfahani [IEEE Commun. Lett. 10(4):251–253, 2006]) can be obtained by summing the probability masses for each possible value of the minimum hop count, which provides new insights to the connectivity probability. Numerical results show the effect of the number of nodes and the transmission range on the minimum hop count. |
id |
RCAP_00ac0ec52220fc97fc444b233bdf37f0 |
---|---|
oai_identifier_str |
oai:dspace.uevora.pt:10174/1433 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networksOne-dimensional ad hoc networkConnectivity probabilityPoisson randomizationMinimum hop countThis paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the exact probability distribution of the minimum hop count from the location density of relay nodes in the multihop path selected with the Most Forward within Radius (MFR) scheme. The probability that the source and destination nodes are connected (provided by Ghasemi and Nader-Esfahani [IEEE Commun. Lett. 10(4):251–253, 2006]) can be obtained by summing the probability masses for each possible value of the minimum hop count, which provides new insights to the connectivity probability. Numerical results show the effect of the number of nodes and the transmission range on the minimum hop count.2009-04-07T14:07:35Z2009-04-072008-10-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article293386 bytesapplication/pdfhttp://hdl.handle.net/10174/1433http://hdl.handle.net/10174/1433eng137-1431018-4864 (print) 1572-9451 (online)Telecommunication Systems239livreCIMAnantunes@ualg.ptgjcj@uevora.ptapacheco@math.ist.utl.pt340Antunes, NelsonJacinto, GonçaloPacheco, Antónioinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-01-03T18:37:25Zoai:dspace.uevora.pt:10174/1433Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T00:57:30.583554Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks |
title |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks |
spellingShingle |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks Antunes, Nelson One-dimensional ad hoc network Connectivity probability Poisson randomization Minimum hop count |
title_short |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks |
title_full |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks |
title_fullStr |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks |
title_full_unstemmed |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks |
title_sort |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks |
author |
Antunes, Nelson |
author_facet |
Antunes, Nelson Jacinto, Gonçalo Pacheco, António |
author_role |
author |
author2 |
Jacinto, Gonçalo Pacheco, António |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Antunes, Nelson Jacinto, Gonçalo Pacheco, António |
dc.subject.por.fl_str_mv |
One-dimensional ad hoc network Connectivity probability Poisson randomization Minimum hop count |
topic |
One-dimensional ad hoc network Connectivity probability Poisson randomization Minimum hop count |
description |
This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the exact probability distribution of the minimum hop count from the location density of relay nodes in the multihop path selected with the Most Forward within Radius (MFR) scheme. The probability that the source and destination nodes are connected (provided by Ghasemi and Nader-Esfahani [IEEE Commun. Lett. 10(4):251–253, 2006]) can be obtained by summing the probability masses for each possible value of the minimum hop count, which provides new insights to the connectivity probability. Numerical results show the effect of the number of nodes and the transmission range on the minimum hop count. |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008-10-01T00:00:00Z 2009-04-07T14:07:35Z 2009-04-07 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10174/1433 http://hdl.handle.net/10174/1433 |
url |
http://hdl.handle.net/10174/1433 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
137-143 1018-4864 (print) 1572-9451 (online) Telecommunication Systems 2 39 livre CIMA nantunes@ualg.pt gjcj@uevora.pt apacheco@math.ist.utl.pt 340 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
293386 bytes application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799136459601477632 |