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
Algoritmos de roteamento com baixo overhead, link estável e independência do número total de nós na rede são essenciais para o projeto e operação de redes móveis ad hoc sem fio de grande escala (MANET). Neste artigo, desenvolvemos e analisamos o Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), um algoritmo de roteamento escalonável e eficaz para MANET. O C-LAR é executado sobre uma cobertura de cluster adaptativa da MANET, que pode ser criada e mantida usando, por exemplo, o algoritmo distribuído baseado em peso. Este algoritmo leva em consideração o grau do nó, a mobilidade, a distância relativa, a potência da bateria e a estabilidade do link dos nós móveis. A estrutura hierárquica estabiliza os caminhos de comunicação ponta a ponta e melhora a escalabilidade das redes, de modo que a sobrecarga de roteamento não se torne tremenda em MANET de grande escala. Os clusterheads formam um backbone virtual conectado na rede, determinam a topologia e a estabilidade da rede e fornecem uma abordagem eficiente para minimizar o tráfego de inundação durante a descoberta de rotas e também acelerar esse processo. Além disso, é fascinante e importante investigar como controlar o número total de nós participantes de um processo de estabelecimento de roteamento, de modo a melhorar o desempenho da camada de rede da MANET. C-LAR deve usar informações de localização geográfica fornecidas pelo Global Position System para auxiliar na rota. A informação de localização do nó de destino é usada para prever um retângulo menor, um triângulo isósceles ou uma zona de solicitação circular, que é selecionada de acordo com a localização relativa da origem e do destino, que cobre a região estimada na qual o destino pode estar localizado. Assim, em vez de procurar cegamente a rota em toda a rede, o C-LAR confina o espaço de busca da rota em um intervalo estimado muito menor. Os resultados da simulação mostraram que o C-LAR supera significativamente outros protocolos em tempo de configuração de rota, sobrecarga de roteamento, atraso médio e colisão de pacotes e, simultaneamente, mantém atraso médio baixo de ponta a ponta, alta taxa de entrega de sucesso, baixa sobrecarga de controle, também como baixa frequência de descoberta de rota.
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
Yi WANG, Liang DONG, Taotao LIANG, Xinyu YANG, Deyun ZHANG, "Cluster Based Location-Aided Routing Protocol for Large Scale Mobile Ad Hoc Networks" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 5, pp. 1103-1124, May 2009, doi: 10.1587/transinf.E92.D.1103.
Abstract: Routing algorithms with low overhead, stable link and independence of the total number of nodes in the network are essential for the design and operation of the large-scale wireless mobile ad hoc networks (MANET). In this paper, we develop and analyze the Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), a scalable and effective routing algorithm for MANET. C-LAR runs on top of an adaptive cluster cover of the MANET, which can be created and maintained using, for instance, the weight-based distributed algorithm. This algorithm takes into consideration the node degree, mobility, relative distance, battery power and link stability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks' scalability such that the routing overhead does not become tremendous in large scale MANET. The clusterheads form a connected virtual backbone in the network, determine the network's topology and stability, and provide an efficient approach to minimizing the flooding traffic during route discovery and speeding up this process as well. Furthermore, it is fascinating and important to investigate how to control the total number of nodes participating in a routing establishment process so as to improve the network layer performance of MANET. C-LAR is to use geographical location information provided by Global Position System to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region in which the destination may be located. Thus, instead of searching the route in the entire network blindly, C-LAR confines the route searching space into a much smaller estimated range. Simulation results have shown that C-LAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1103/_p
Copiar
@ARTICLE{e92-d_5_1103,
author={Yi WANG, Liang DONG, Taotao LIANG, Xinyu YANG, Deyun ZHANG, },
journal={IEICE TRANSACTIONS on Information},
title={Cluster Based Location-Aided Routing Protocol for Large Scale Mobile Ad Hoc Networks},
year={2009},
volume={E92-D},
number={5},
pages={1103-1124},
abstract={Routing algorithms with low overhead, stable link and independence of the total number of nodes in the network are essential for the design and operation of the large-scale wireless mobile ad hoc networks (MANET). In this paper, we develop and analyze the Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), a scalable and effective routing algorithm for MANET. C-LAR runs on top of an adaptive cluster cover of the MANET, which can be created and maintained using, for instance, the weight-based distributed algorithm. This algorithm takes into consideration the node degree, mobility, relative distance, battery power and link stability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks' scalability such that the routing overhead does not become tremendous in large scale MANET. The clusterheads form a connected virtual backbone in the network, determine the network's topology and stability, and provide an efficient approach to minimizing the flooding traffic during route discovery and speeding up this process as well. Furthermore, it is fascinating and important to investigate how to control the total number of nodes participating in a routing establishment process so as to improve the network layer performance of MANET. C-LAR is to use geographical location information provided by Global Position System to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region in which the destination may be located. Thus, instead of searching the route in the entire network blindly, C-LAR confines the route searching space into a much smaller estimated range. Simulation results have shown that C-LAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.},
keywords={},
doi={10.1587/transinf.E92.D.1103},
ISSN={1745-1361},
month={May},}
Copiar
TY - JOUR
TI - Cluster Based Location-Aided Routing Protocol for Large Scale Mobile Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Information
SP - 1103
EP - 1124
AU - Yi WANG
AU - Liang DONG
AU - Taotao LIANG
AU - Xinyu YANG
AU - Deyun ZHANG
PY - 2009
DO - 10.1587/transinf.E92.D.1103
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2009
AB - Routing algorithms with low overhead, stable link and independence of the total number of nodes in the network are essential for the design and operation of the large-scale wireless mobile ad hoc networks (MANET). In this paper, we develop and analyze the Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), a scalable and effective routing algorithm for MANET. C-LAR runs on top of an adaptive cluster cover of the MANET, which can be created and maintained using, for instance, the weight-based distributed algorithm. This algorithm takes into consideration the node degree, mobility, relative distance, battery power and link stability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks' scalability such that the routing overhead does not become tremendous in large scale MANET. The clusterheads form a connected virtual backbone in the network, determine the network's topology and stability, and provide an efficient approach to minimizing the flooding traffic during route discovery and speeding up this process as well. Furthermore, it is fascinating and important to investigate how to control the total number of nodes participating in a routing establishment process so as to improve the network layer performance of MANET. C-LAR is to use geographical location information provided by Global Position System to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region in which the destination may be located. Thus, instead of searching the route in the entire network blindly, C-LAR confines the route searching space into a much smaller estimated range. Simulation results have shown that C-LAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.
ER -