The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Redes Ad Hoc Móveis (MANETs) são redes sem fio independentes de tempo e infraestrutura que consistem em nós móveis. Por exemplo, uma MANET pode ser usada como uma rede emergente para comunicação entre pessoas quando ocorre um desastre. Como não existe um servidor central na rede, cada nó deve descobrir sozinho as informações (objetos) desejadas. A construção de uma rede móvel Peer-to-Peer (P2P) sobre a MANET pode suportar a busca de objetos. Alguns pesquisadores propuseram esquemas de construção de redes móveis P2P, como Ekta e MADPastry. Eles integraram o roteamento da camada de aplicação baseado em DHT e o roteamento da camada de rede para aumentar a eficiência da pesquisa. Além disso, MADPastry propôs um método de agrupamento que agrupa os nós de sobreposição de acordo com sua distância física. No entanto, também foi apontado que a eficiência da busca se deteriora em ambientes altamente dinâmicos onde os nós se movem rapidamente. Neste artigo, focamos nos desaparecimentos de rotas na camada de rede que causam a deterioração da eficiência da busca. Descrevemos detalhadamente este problema e o avaliamos quantitativamente através de experimentos de simulação. Estendemos MADPastry introduzindo um método de compartilhamento de objetos entre nós em um cluster. Através de experimentos de simulação, mostramos que o método proposto pode atingir uma taxa de sucesso de busca de objetos até 2.5 vezes maior do que o MADPastry.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Kei TAKESHITA, Masahiro SASABE, Hirotaka NAKANO, "Improving Success Ratio of Object Search in Highly-Dynamic Mobile P2P Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 12, pp. 3851-3859, December 2008, doi: 10.1093/ietcom/e91-b.12.3851.
Abstract: Mobile Ad Hoc Networks (MANETs) are temporal and infrastructure-independent wireless networks that consist of mobile nodes. For instance, a MANET can be used as an emergent network for communication among people when a disaster occurred. Since there is no central server in the network, each node has to find out its desired information (objects) by itself. Constructing a mobile Peer-to-Peer (P2P) network over the MANET can support the object search. Some researchers proposed construction schemes of mobile P2P networks, such as Ekta and MADPastry. They integrated DHT-based application-layer routing and network-layer routing to increase search efficiency. Furthermore, MADPastry proposed a clustering method which groups the overlay nodes according to their physical distance. However, it has also been pointed out that the search efficiency deteriorates in highly dynamic environments where nodes quickly move around. In this paper, we focus on route disappearances in the network layer which cause the deterioration of search efficiency. We describe the detail of this problem and evaluate quantitatively it through simulation experiments. We extend MADPastry by introducing a method sharing objects among nodes in a cluster. Through simulation experiments, we show that the proposed method can achieve up to 2.5 times larger success rate of object search than MADPastry.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.12.3851/_p
Copiar
@ARTICLE{e91-b_12_3851,
author={Kei TAKESHITA, Masahiro SASABE, Hirotaka NAKANO, },
journal={IEICE TRANSACTIONS on Communications},
title={Improving Success Ratio of Object Search in Highly-Dynamic Mobile P2P Networks},
year={2008},
volume={E91-B},
number={12},
pages={3851-3859},
abstract={Mobile Ad Hoc Networks (MANETs) are temporal and infrastructure-independent wireless networks that consist of mobile nodes. For instance, a MANET can be used as an emergent network for communication among people when a disaster occurred. Since there is no central server in the network, each node has to find out its desired information (objects) by itself. Constructing a mobile Peer-to-Peer (P2P) network over the MANET can support the object search. Some researchers proposed construction schemes of mobile P2P networks, such as Ekta and MADPastry. They integrated DHT-based application-layer routing and network-layer routing to increase search efficiency. Furthermore, MADPastry proposed a clustering method which groups the overlay nodes according to their physical distance. However, it has also been pointed out that the search efficiency deteriorates in highly dynamic environments where nodes quickly move around. In this paper, we focus on route disappearances in the network layer which cause the deterioration of search efficiency. We describe the detail of this problem and evaluate quantitatively it through simulation experiments. We extend MADPastry by introducing a method sharing objects among nodes in a cluster. Through simulation experiments, we show that the proposed method can achieve up to 2.5 times larger success rate of object search than MADPastry.},
keywords={},
doi={10.1093/ietcom/e91-b.12.3851},
ISSN={1745-1345},
month={December},}
Copiar
TY - JOUR
TI - Improving Success Ratio of Object Search in Highly-Dynamic Mobile P2P Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3851
EP - 3859
AU - Kei TAKESHITA
AU - Masahiro SASABE
AU - Hirotaka NAKANO
PY - 2008
DO - 10.1093/ietcom/e91-b.12.3851
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2008
AB - Mobile Ad Hoc Networks (MANETs) are temporal and infrastructure-independent wireless networks that consist of mobile nodes. For instance, a MANET can be used as an emergent network for communication among people when a disaster occurred. Since there is no central server in the network, each node has to find out its desired information (objects) by itself. Constructing a mobile Peer-to-Peer (P2P) network over the MANET can support the object search. Some researchers proposed construction schemes of mobile P2P networks, such as Ekta and MADPastry. They integrated DHT-based application-layer routing and network-layer routing to increase search efficiency. Furthermore, MADPastry proposed a clustering method which groups the overlay nodes according to their physical distance. However, it has also been pointed out that the search efficiency deteriorates in highly dynamic environments where nodes quickly move around. In this paper, we focus on route disappearances in the network layer which cause the deterioration of search efficiency. We describe the detail of this problem and evaluate quantitatively it through simulation experiments. We extend MADPastry by introducing a method sharing objects among nodes in a cluster. Through simulation experiments, we show that the proposed method can achieve up to 2.5 times larger success rate of object search than MADPastry.
ER -