Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Tipo de documento: | Tese |
Idioma: | por |
Título da fonte: | Biblioteca Digital de Teses e Dissertações do UFSM |
Texto Completo: | http://repositorio.ufsm.br/handle/1/3670 |
Resumo: | Wireless sensor and actuator networks are expected to grow quickly in size due to the decreasing cost of nodes. For such large scale networks, the geographic routing algorithm is a suitable approach. It finds a route for the packet based on the positions of the nodes. However, it often finds longer routes than the shortest possible ones, increasing the probability of packet loss. Moreover, the low cost wireless devices usually operate in the unlicensed bands, which is a crowded portion of the spectrum where several networks may be operating. Furthermore, the expected increase in the network density will also increase the competition for the wireless channel. Thus, intra and inter-network interferences play a major role in the reliability of the communication. In order to increase it, communication over multiple channels can be used. It exploits the capability of the radios that equip the nodes to be tuned over different frequencies. However, the number of available channels is limited in practice. Therefore, an allocation protocol must employ the channels eficiently. However, it was shown that to find an optimal allocation is NP-hard. Thus, one can use game theory to design a protocol that sub-optimally assigns channels in a distributed way. Game theory allows to model the problem as a game, where nodes are players and channels are their actions. According to the actions played, every node receives a payoff. The task of the protocol designer is to assign to every player a payoff function and a learning algorithm. This algorithm allows a player to play accordingly its observations of the game in order to maximize its payoff. If the designed game is potential, the algorithm can be used such that repeated playing converge to a steady state, known as Nash Equilibrium (NE). In a NE, no player can be better of by switching its current action and its received payoff can be bounded by a constant factor of the optimal payoff. By following such approach, a protocol called GBCA has been proposed, which allocates channels by exploiting topology and routing information. However, GBCA was designed for networks where routes are known in advance and static during a relatively long time. Geographic routing, by the other hand, finds the route for every packet on-demand. Therefore, in order to apply GBCA in networks that use geographic routing, this thesis proposes suitable modifications to the payoff functions. Using this modified protocol, which is called GBCA-G, it is shown, by simulations, the improvement of the network perfomance according to the metrics of delivery ratio, average delay and average number of trials per successfull transmission. |
id |
UFSM_1cdc40e5eba874b97961c09ae3d7ba46 |
---|---|
oai_identifier_str |
oai:repositorio.ufsm.br:1/3670 |
network_acronym_str |
UFSM |
network_name_str |
Biblioteca Digital de Teses e Dissertações do UFSM |
repository_id_str |
|
spelling |
2017-05-192017-05-192012-05-25BARRIQUELLO, Carlos Henrique. Channel allocation for geographic routing in wireless sensor and actuator networks using game theory. 2012. 118 f. Tese (Doutorado em Engenharia Elétrica) - Universidade Federal de Santa Maria, Santa Maria, 2012.http://repositorio.ufsm.br/handle/1/3670Wireless sensor and actuator networks are expected to grow quickly in size due to the decreasing cost of nodes. For such large scale networks, the geographic routing algorithm is a suitable approach. It finds a route for the packet based on the positions of the nodes. However, it often finds longer routes than the shortest possible ones, increasing the probability of packet loss. Moreover, the low cost wireless devices usually operate in the unlicensed bands, which is a crowded portion of the spectrum where several networks may be operating. Furthermore, the expected increase in the network density will also increase the competition for the wireless channel. Thus, intra and inter-network interferences play a major role in the reliability of the communication. In order to increase it, communication over multiple channels can be used. It exploits the capability of the radios that equip the nodes to be tuned over different frequencies. However, the number of available channels is limited in practice. Therefore, an allocation protocol must employ the channels eficiently. However, it was shown that to find an optimal allocation is NP-hard. Thus, one can use game theory to design a protocol that sub-optimally assigns channels in a distributed way. Game theory allows to model the problem as a game, where nodes are players and channels are their actions. According to the actions played, every node receives a payoff. The task of the protocol designer is to assign to every player a payoff function and a learning algorithm. This algorithm allows a player to play accordingly its observations of the game in order to maximize its payoff. If the designed game is potential, the algorithm can be used such that repeated playing converge to a steady state, known as Nash Equilibrium (NE). In a NE, no player can be better of by switching its current action and its received payoff can be bounded by a constant factor of the optimal payoff. By following such approach, a protocol called GBCA has been proposed, which allocates channels by exploiting topology and routing information. However, GBCA was designed for networks where routes are known in advance and static during a relatively long time. Geographic routing, by the other hand, finds the route for every packet on-demand. Therefore, in order to apply GBCA in networks that use geographic routing, this thesis proposes suitable modifications to the payoff functions. Using this modified protocol, which is called GBCA-G, it is shown, by simulations, the improvement of the network perfomance according to the metrics of delivery ratio, average delay and average number of trials per successfull transmission.Espera-se que as redes de sensores e atuadores sem fio cresçam rapidamente em tamanho devido à contínua redução de custo dos dispositivos. Para tais redes de larga escala, os algoritmos de roteamento geográfico são adequados. Estes encontram a rota com base nas posições dos nós. Contudo, geralmente as rotas encontradas são mais longas do que as rotas possíveis, aumentando a probabilidade de perda do pacote. Ademais, os dispositivos sem fio de baixo custo operam nas faixas livres do espectro e estão sujeitos a interferências causadas por outras redes que operam nessas mesmas faixas. Ainda, com o aumento da densidade da rede, aumenta também a competição pelo canal. Portanto, tanto interferências internas quanto externas prejudicam a confiabilidade da comunicacão. Para aumentá-la pode-se utilizar múltiplos canais, uma vez que os rádios que equipam os nós podem ser sintonizados em diferentes frequências. Contudo, o número de canais disponíveis é limitado, tornando imperativo um protocolo de alocação eficiente. Porém foi demonstrado que encontrar uma solução ótima é inviável. Por isso, a Teoria dos Jogos pode ser empregada para se encontrar alocações sub-ótimas de forma distribuída. A Teoria dos Jogos permite modelar o problema como um jogo, onde os nós são os jogadores; os canais, suas ações; e conforme suas escolhas, cada não recebe uma recompensa. Um projetista deve definir as funções de recompensa e um algoritmo de aprendizado, que permite ao jogador determinar a ação que maximiza sua recompensa através da observação do jogo. Se o jogo for potencial, o algoritmo pode levá-lo a um equilíbrio, conhecido por Equilíbrio de Nash (NE), após repetidas rodadas. Em um NE, todo jogador estão satisfeito e sua recompensa pode ser limitada por uma constante multiplicativa da máxima recompensa possível. Seguindo esta abordagem, um protocolo denominado GBCA foi proposto na literatura, o qual aloca canais com base na topologia da rede e nas rotas utilizadas. Contudo, o GBCA necessita conhecer as rotas antecipadamente e estas devem ser estáticas. Por outro lado, algoritmos geográficos determinam a rota sob demanda para cada pacote. Portanto, para tornar o GBCA adequado para redes com roteamento geográfico, propõe-se, nesta Tese, modificações ao GBCA. Utilizando-se o protocolo proposto, denominado GBCA-G, demonstra-se, por simulação, que é possível obter resultados melhores quanto à taxa de entrega de pacotes, ao atraso médio de entrega e ao número médio de transmissões efetuadas por transmissão bem-sucedida.Coordenação de Aperfeiçoamento de Pessoal de Nível Superiorapplication/pdfporUniversidade Federal de Santa MariaPrograma de Pós-Graduação em Engenharia ElétricaUFSMBREngenharia ElétricaRedes de sensores e atuadores sem fioTeoria dos jogosMulticanaisWireless sensor and actuators networksGame theoryMulti-channelCNPQ::ENGENHARIAS::ENGENHARIA ELETRICAAlocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogosChannel allocation for geographic routing in wireless sensor and actuator networks using game theoryinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisCampos, Alexandrehttp://lattes.cnpq.br/8059148083624149Prado, Ricardo Nederson dohttp://lattes.cnpq.br/6324790827842684Martins, João Baptista dos Santoshttp://lattes.cnpq.br/3158303689784382Rocha Neto, José Sérgio dahttp://lattes.cnpq.br/9085919442313408Beck Filho, Antonio Carlos Schneiderhttp://lattes.cnpq.br/5446996798632062http://lattes.cnpq.br/4127396473202565Barriquello, Carlos Henrique300400000007400300300300300300300272a7edd-3c46-4479-b573-4cd18bb0b376587f1258-fd66-491a-bf60-911cd6d648ab12860ce2-1b41-4c4f-b769-49ca2a56fc710b253003-b502-4ac1-aae6-03b42b0eacd3ae3df507-bf6a-4e38-82f0-bff9c402c6738fb5a54f-e9cf-49c9-86c2-db9e743e5463info:eu-repo/semantics/openAccessreponame:Biblioteca Digital de Teses e Dissertações do UFSMinstname:Universidade Federal de Santa Maria (UFSM)instacron:UFSMORIGINALBARRIQUELO, CARLOS HENRIQUE.pdfapplication/pdf3875451http://repositorio.ufsm.br/bitstream/1/3670/1/BARRIQUELO%2c%20CARLOS%20HENRIQUE.pdf857762e520bc01a54ff678be7964908dMD51TEXTBARRIQUELO, CARLOS HENRIQUE.pdf.txtBARRIQUELO, CARLOS HENRIQUE.pdf.txtExtracted texttext/plain230582http://repositorio.ufsm.br/bitstream/1/3670/2/BARRIQUELO%2c%20CARLOS%20HENRIQUE.pdf.txt3152bafee3926933aaee02f0e8b99170MD52THUMBNAILBARRIQUELO, CARLOS HENRIQUE.pdf.jpgBARRIQUELO, CARLOS HENRIQUE.pdf.jpgIM Thumbnailimage/jpeg4716http://repositorio.ufsm.br/bitstream/1/3670/3/BARRIQUELO%2c%20CARLOS%20HENRIQUE.pdf.jpg6d092e2a360981024e8648f5236f0987MD531/36702023-05-18 16:16:31.913oai:repositorio.ufsm.br:1/3670Biblioteca Digital de Teses e Dissertaçõeshttps://repositorio.ufsm.br/ONGhttps://repositorio.ufsm.br/oai/requestatendimento.sib@ufsm.br||tedebc@gmail.comopendoar:2023-05-18T19:16:31Biblioteca Digital de Teses e Dissertações do UFSM - Universidade Federal de Santa Maria (UFSM)false |
dc.title.por.fl_str_mv |
Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos |
dc.title.alternative.eng.fl_str_mv |
Channel allocation for geographic routing in wireless sensor and actuator networks using game theory |
title |
Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos |
spellingShingle |
Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos Barriquello, Carlos Henrique Redes de sensores e atuadores sem fio Teoria dos jogos Multicanais Wireless sensor and actuators networks Game theory Multi-channel CNPQ::ENGENHARIAS::ENGENHARIA ELETRICA |
title_short |
Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos |
title_full |
Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos |
title_fullStr |
Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos |
title_full_unstemmed |
Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos |
title_sort |
Alocação de canais para roteamento geográfico em redes de sensores e atuadores sem fio empregando a teoria dos jogos |
author |
Barriquello, Carlos Henrique |
author_facet |
Barriquello, Carlos Henrique |
author_role |
author |
dc.contributor.advisor1.fl_str_mv |
Campos, Alexandre |
dc.contributor.advisor1Lattes.fl_str_mv |
http://lattes.cnpq.br/8059148083624149 |
dc.contributor.advisor-co1.fl_str_mv |
Prado, Ricardo Nederson do |
dc.contributor.advisor-co1Lattes.fl_str_mv |
http://lattes.cnpq.br/6324790827842684 |
dc.contributor.referee1.fl_str_mv |
Martins, João Baptista dos Santos |
dc.contributor.referee1Lattes.fl_str_mv |
http://lattes.cnpq.br/3158303689784382 |
dc.contributor.referee2.fl_str_mv |
Rocha Neto, José Sérgio da |
dc.contributor.referee2Lattes.fl_str_mv |
http://lattes.cnpq.br/9085919442313408 |
dc.contributor.referee3.fl_str_mv |
Beck Filho, Antonio Carlos Schneider |
dc.contributor.referee3Lattes.fl_str_mv |
http://lattes.cnpq.br/5446996798632062 |
dc.contributor.authorLattes.fl_str_mv |
http://lattes.cnpq.br/4127396473202565 |
dc.contributor.author.fl_str_mv |
Barriquello, Carlos Henrique |
contributor_str_mv |
Campos, Alexandre Prado, Ricardo Nederson do Martins, João Baptista dos Santos Rocha Neto, José Sérgio da Beck Filho, Antonio Carlos Schneider |
dc.subject.por.fl_str_mv |
Redes de sensores e atuadores sem fio Teoria dos jogos Multicanais |
topic |
Redes de sensores e atuadores sem fio Teoria dos jogos Multicanais Wireless sensor and actuators networks Game theory Multi-channel CNPQ::ENGENHARIAS::ENGENHARIA ELETRICA |
dc.subject.eng.fl_str_mv |
Wireless sensor and actuators networks Game theory Multi-channel |
dc.subject.cnpq.fl_str_mv |
CNPQ::ENGENHARIAS::ENGENHARIA ELETRICA |
description |
Wireless sensor and actuator networks are expected to grow quickly in size due to the decreasing cost of nodes. For such large scale networks, the geographic routing algorithm is a suitable approach. It finds a route for the packet based on the positions of the nodes. However, it often finds longer routes than the shortest possible ones, increasing the probability of packet loss. Moreover, the low cost wireless devices usually operate in the unlicensed bands, which is a crowded portion of the spectrum where several networks may be operating. Furthermore, the expected increase in the network density will also increase the competition for the wireless channel. Thus, intra and inter-network interferences play a major role in the reliability of the communication. In order to increase it, communication over multiple channels can be used. It exploits the capability of the radios that equip the nodes to be tuned over different frequencies. However, the number of available channels is limited in practice. Therefore, an allocation protocol must employ the channels eficiently. However, it was shown that to find an optimal allocation is NP-hard. Thus, one can use game theory to design a protocol that sub-optimally assigns channels in a distributed way. Game theory allows to model the problem as a game, where nodes are players and channels are their actions. According to the actions played, every node receives a payoff. The task of the protocol designer is to assign to every player a payoff function and a learning algorithm. This algorithm allows a player to play accordingly its observations of the game in order to maximize its payoff. If the designed game is potential, the algorithm can be used such that repeated playing converge to a steady state, known as Nash Equilibrium (NE). In a NE, no player can be better of by switching its current action and its received payoff can be bounded by a constant factor of the optimal payoff. By following such approach, a protocol called GBCA has been proposed, which allocates channels by exploiting topology and routing information. However, GBCA was designed for networks where routes are known in advance and static during a relatively long time. Geographic routing, by the other hand, finds the route for every packet on-demand. Therefore, in order to apply GBCA in networks that use geographic routing, this thesis proposes suitable modifications to the payoff functions. Using this modified protocol, which is called GBCA-G, it is shown, by simulations, the improvement of the network perfomance according to the metrics of delivery ratio, average delay and average number of trials per successfull transmission. |
publishDate |
2012 |
dc.date.issued.fl_str_mv |
2012-05-25 |
dc.date.accessioned.fl_str_mv |
2017-05-19 |
dc.date.available.fl_str_mv |
2017-05-19 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
format |
doctoralThesis |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
BARRIQUELLO, Carlos Henrique. Channel allocation for geographic routing in wireless sensor and actuator networks using game theory. 2012. 118 f. Tese (Doutorado em Engenharia Elétrica) - Universidade Federal de Santa Maria, Santa Maria, 2012. |
dc.identifier.uri.fl_str_mv |
http://repositorio.ufsm.br/handle/1/3670 |
identifier_str_mv |
BARRIQUELLO, Carlos Henrique. Channel allocation for geographic routing in wireless sensor and actuator networks using game theory. 2012. 118 f. Tese (Doutorado em Engenharia Elétrica) - Universidade Federal de Santa Maria, Santa Maria, 2012. |
url |
http://repositorio.ufsm.br/handle/1/3670 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.cnpq.fl_str_mv |
300400000007 |
dc.relation.confidence.fl_str_mv |
400 300 300 300 300 300 300 |
dc.relation.authority.fl_str_mv |
272a7edd-3c46-4479-b573-4cd18bb0b376 587f1258-fd66-491a-bf60-911cd6d648ab 12860ce2-1b41-4c4f-b769-49ca2a56fc71 0b253003-b502-4ac1-aae6-03b42b0eacd3 ae3df507-bf6a-4e38-82f0-bff9c402c673 8fb5a54f-e9cf-49c9-86c2-db9e743e5463 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Universidade Federal de Santa Maria |
dc.publisher.program.fl_str_mv |
Programa de Pós-Graduação em Engenharia Elétrica |
dc.publisher.initials.fl_str_mv |
UFSM |
dc.publisher.country.fl_str_mv |
BR |
dc.publisher.department.fl_str_mv |
Engenharia Elétrica |
publisher.none.fl_str_mv |
Universidade Federal de Santa Maria |
dc.source.none.fl_str_mv |
reponame:Biblioteca Digital de Teses e Dissertações do UFSM instname:Universidade Federal de Santa Maria (UFSM) instacron:UFSM |
instname_str |
Universidade Federal de Santa Maria (UFSM) |
instacron_str |
UFSM |
institution |
UFSM |
reponame_str |
Biblioteca Digital de Teses e Dissertações do UFSM |
collection |
Biblioteca Digital de Teses e Dissertações do UFSM |
bitstream.url.fl_str_mv |
http://repositorio.ufsm.br/bitstream/1/3670/1/BARRIQUELO%2c%20CARLOS%20HENRIQUE.pdf http://repositorio.ufsm.br/bitstream/1/3670/2/BARRIQUELO%2c%20CARLOS%20HENRIQUE.pdf.txt http://repositorio.ufsm.br/bitstream/1/3670/3/BARRIQUELO%2c%20CARLOS%20HENRIQUE.pdf.jpg |
bitstream.checksum.fl_str_mv |
857762e520bc01a54ff678be7964908d 3152bafee3926933aaee02f0e8b99170 6d092e2a360981024e8648f5236f0987 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
Biblioteca Digital de Teses e Dissertações do UFSM - Universidade Federal de Santa Maria (UFSM) |
repository.mail.fl_str_mv |
atendimento.sib@ufsm.br||tedebc@gmail.com |
_version_ |
1801485283472965632 |