Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay
Autor(a) principal: | |
---|---|
Data de Publicação: | 2016 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/523 |
Resumo: | In this paper, a fault tolerant routing scheme in wireless cellular networks is proposed for improving call acceptance and simultaneously reducing delay in spite of existence of Base Station fault. The local routing tables on the neighbours are created to identify the preference of any neighbouring base station for forwarding data. Using an Ant Colony Optimization (ACO) based approach, faulty regions in the network are detected and call requests are efficiently routed around such regions thus avoiding congestion. It determines the optimal routes in network with reduced delay. The experimental results confirm the theoretical findings and its effectiveness over existing approaches. |
id |
UFLA-5_5c74b1afc708e00c7f3f095f7bb4321d |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/523 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delayroutingfault tolerancewireless cellular networkcall acceptancedelayAnt Colony OptimizationIn this paper, a fault tolerant routing scheme in wireless cellular networks is proposed for improving call acceptance and simultaneously reducing delay in spite of existence of Base Station fault. The local routing tables on the neighbours are created to identify the preference of any neighbouring base station for forwarding data. Using an Ant Colony Optimization (ACO) based approach, faulty regions in the network are detected and call requests are efficiently routed around such regions thus avoiding congestion. It determines the optimal routes in network with reduced delay. The experimental results confirm the theoretical findings and its effectiveness over existing approaches.Editora da UFLA2016-12-30info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/523INFOCOMP Journal of Computer Science; Vol. 15 No. 2 (2016): December 2016; 10-201982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/523/490Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessThakurta, Parag GuhaSett, SujoyChoudhury, SpandanBhattacharya, SwapanBandyopadhyay, Shubhansu2017-08-19T13:09:47Zoai:infocomp.dcc.ufla.br:article/523Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:42.373098INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay |
title |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay |
spellingShingle |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay Thakurta, Parag Guha routing fault tolerance wireless cellular network call acceptance delay Ant Colony Optimization |
title_short |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay |
title_full |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay |
title_fullStr |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay |
title_full_unstemmed |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay |
title_sort |
Fault Tolerant Routing in Wireless Cellular Networks: An Approach for maximizing Call Acceptance and reducing Delay |
author |
Thakurta, Parag Guha |
author_facet |
Thakurta, Parag Guha Sett, Sujoy Choudhury, Spandan Bhattacharya, Swapan Bandyopadhyay, Shubhansu |
author_role |
author |
author2 |
Sett, Sujoy Choudhury, Spandan Bhattacharya, Swapan Bandyopadhyay, Shubhansu |
author2_role |
author author author author |
dc.contributor.author.fl_str_mv |
Thakurta, Parag Guha Sett, Sujoy Choudhury, Spandan Bhattacharya, Swapan Bandyopadhyay, Shubhansu |
dc.subject.por.fl_str_mv |
routing fault tolerance wireless cellular network call acceptance delay Ant Colony Optimization |
topic |
routing fault tolerance wireless cellular network call acceptance delay Ant Colony Optimization |
description |
In this paper, a fault tolerant routing scheme in wireless cellular networks is proposed for improving call acceptance and simultaneously reducing delay in spite of existence of Base Station fault. The local routing tables on the neighbours are created to identify the preference of any neighbouring base station for forwarding data. Using an Ant Colony Optimization (ACO) based approach, faulty regions in the network are detected and call requests are efficiently routed around such regions thus avoiding congestion. It determines the optimal routes in network with reduced delay. The experimental results confirm the theoretical findings and its effectiveness over existing approaches. |
publishDate |
2016 |
dc.date.none.fl_str_mv |
2016-12-30 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/523 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/523 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/523/490 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 15 No. 2 (2016): December 2016; 10-20 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874742157574144 |