Uma Abordagem de Grades Virtuais para Agrupamento e Roteamento em Redes de Sensores Sem Fio com Sorvedouro Móvel
Resumo
Redes de Sensores Sem Fio são um tipo de redes ad hoc compostas por nós sensores. A alta concentração de nós sensores resulta em um alto tráfego de dados, colisões de pacotes, interferências e gasto de energia desnecessário. Para tratar estes problemas, organizamos os nós sensores em grupos, que são formados por grades virtuais, e usamos um sorvedouro móvel para coletar os dados. O problema de agrupamento consiste em definir quais grades virtuais compõem cada grupo e o problema de roteamento consiste em definir a rota para o sorvedouro percorrer. Propomos duas abordagens para o problema do agrupamento e duas abordagens para o roteamento. Resolvemos os problemas separados e em conjunto e nossos resultados mostram que, resolver os problemas em conjunto conduz a melhores resultados, especialmente em termos de tamanho da rota do nó sorvedouro.
Palavras-chave:
Rede de Sensores Sem Fio, Roteamento, Agrupamento, Área principal: Otimização Combinatória
Referências
Aiof, W. M., Valle, C. A., Mateus, G. R., and da Cunha, A. S. (2011). Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in wireless sensor networks. Computer Networks, pages 2803–2820.
Akyildiz, I., Su, W., Sankarasubramaniam, Y., and Cyirci, E. (2002). Wireless sensor networks: A survey. Computer Networks, pages 393–422.
Chatzigiannakis, I., Kinalis, A., and Nikoletseas, S. (2008). Efcient data propagation strategies in wireless sensor networks using a single mobile sink. Computer Communications, pages 896–914.
Chatzigiannakis, I., Kinalis, A., Nikoletseas, S., and Rolim, J. (2007). Fast and energy In Proceedings of the 5th efcient sensor data collection by multiple mobile sinks. ACM international workshop on mobility management and wireless access, pages 25– 32.
Chen, J.-L., Chen, M.-C., Huang, P.-Y., and Chang, Y.-C. (2007). Cluster-grid structure routing protocol for sensor mobility management. In Sarnoff Symposium, 2007 IEEE, pages 1–5.
Dantzig, G., Fulkerson, R., and Johnson, S. (1954). Solution of a large-scale travelingsalesman problem. Operations Research, pages 393–410.
Deng, J., Han, Y. S., Heinzelman, W. B., and Varshney, P. K. (2005). Scheduling sleeping nodes in high density cluster-based sensor networks. Mobile Networks and Applications, pages 825–835.
Heinzelman, W. R., Chandrakasan, A., and Balakrishnan, H. (2000). Energy-efcient communication protocol for wireless microsensor networks. In Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 Volume 8, HICSS ’00, pages 8020–8030.
Johnson, D. S. (1973). Approximation algorithms for combinatorial problems. In Proceedings of the fth annual ACM symposium on Theory of computing, pages 38–49.
Nakayama, H., Ansari, N., Jamalipour, A., and Kato, N. (2007). Fault-resilient sensing in wireless sensor networks. Computer Communications, pages 2375–2384.
Xu, Y., Heidemann, J., and Estrin, D. (2001). Geography-informed energy conservation for ad hoc routing. In International Conference on Mobile Computing and Networking (MOBICOM), pages 70–84.
Akyildiz, I., Su, W., Sankarasubramaniam, Y., and Cyirci, E. (2002). Wireless sensor networks: A survey. Computer Networks, pages 393–422.
Chatzigiannakis, I., Kinalis, A., and Nikoletseas, S. (2008). Efcient data propagation strategies in wireless sensor networks using a single mobile sink. Computer Communications, pages 896–914.
Chatzigiannakis, I., Kinalis, A., Nikoletseas, S., and Rolim, J. (2007). Fast and energy In Proceedings of the 5th efcient sensor data collection by multiple mobile sinks. ACM international workshop on mobility management and wireless access, pages 25– 32.
Chen, J.-L., Chen, M.-C., Huang, P.-Y., and Chang, Y.-C. (2007). Cluster-grid structure routing protocol for sensor mobility management. In Sarnoff Symposium, 2007 IEEE, pages 1–5.
Dantzig, G., Fulkerson, R., and Johnson, S. (1954). Solution of a large-scale travelingsalesman problem. Operations Research, pages 393–410.
Deng, J., Han, Y. S., Heinzelman, W. B., and Varshney, P. K. (2005). Scheduling sleeping nodes in high density cluster-based sensor networks. Mobile Networks and Applications, pages 825–835.
Heinzelman, W. R., Chandrakasan, A., and Balakrishnan, H. (2000). Energy-efcient communication protocol for wireless microsensor networks. In Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 Volume 8, HICSS ’00, pages 8020–8030.
Johnson, D. S. (1973). Approximation algorithms for combinatorial problems. In Proceedings of the fth annual ACM symposium on Theory of computing, pages 38–49.
Nakayama, H., Ansari, N., Jamalipour, A., and Kato, N. (2007). Fault-resilient sensing in wireless sensor networks. Computer Communications, pages 2375–2384.
Xu, Y., Heidemann, J., and Estrin, D. (2001). Geography-informed energy conservation for ad hoc routing. In International Conference on Mobile Computing and Networking (MOBICOM), pages 70–84.
Publicado
23/07/2013
Como Citar
ARAÚJO, André Ricardo Melo; PENARANDA, Adriana Gomes; NAKAMURA, Fabíola Guerra.
Uma Abordagem de Grades Virtuais para Agrupamento e Roteamento em Redes de Sensores Sem Fio com Sorvedouro Móvel. In: SIMPÓSIO BRASILEIRO DE COMPUTAÇÃO UBÍQUA E PERVASIVA (SBCUP), 5. , 2013, Maceió.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2013
.
p. 2062-2071.
ISSN 2595-6183.
