PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Multicast Connections in Wireless Sensor Networks with Topology Control

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
The article explores the quality of multicast trees constructed by heuristic routing algorithms in wireless sensor networks where topology control protocols operate. Network topology planning and performance analysis are crucial challenges for wire and wireless network designers. They are also involved in the research on routing algorithms, and protocols for these networks. In addition, it is worth to emphasize that the generation of realistic network topologies makes it possible to construct and study routing algorithms, protocols and traffic characteristics for WSN networks.
Słowa kluczowe
Rocznik
Tom
Strony
61--67
Opis fizyczny
Bibliogr. 24 poz., rys.
Twórcy
  • Institute of Mechanics and Applied Computer Science, Kazimierz Wielki University, Kopernika st 1, 85-172 Bydgoszcz, Poland
  • Faculty of Electronics and Telecommunications, Poznan University of Technology, Pl. Marii Sklodowskiej-Curie 5, 60-965 Poznan, Poland
autor
  • Faculty of Electronics and Telecommunications, Poznan University of Technology, Pl. Marii Sklodowskiej-Curie 5, 60-965 Poznan, Poland
Bibliografia
  • [1] P. Santi, Topology Control in Wireless Ad Hoc and Sensor Networks. Chichester, UK: Wiley, 2005.
  • [2] P. Santi, Mobility Models for Next Generation Wireles Networks: Ad Hoc, Vehicular, and Mesh Networks. Chichester, UK: Wiley, 2012.
  • [3] „Wireless sensors and integrated wireless sensor networks", Frost & Sullivan Technical Insights, 2004.
  • [4] M. Głąbowski, B. Musznicki, P. Nowak, and P. Zwierzykowski, „An algorithm for finding shortest path tree using ant colony optimization metaheuristic", in Image Processing and Communications Challenges 5, R. S. Chora±, Ed. Advances in Intelligent Systems and Computing, vol. 233, pp. 317-326, 2014.
  • [5] S. Chen and K. Nahrstedt, „An overview of quality of service routing for next-generation high-speed networks: problems and solutions", IEEE Network, vol. 12, pp. 64-79, 1998.
  • [6] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ, USA: Prentice-Hall, 1993.
  • [7] S. Borbash and E. Jennings, „Distributed topology control algorithm for multihop wireless networks", in Proc. 2002 World Congr. Comput. Intell. WCCI 2002, Honolulu, Hawaii, USA, 2002, pp. 355-360.
  • [8] E. Dijkstra, „A note on two problems in connexion with graphs", Numerische Mathematik, vol. 1, pp. 269-271, 1959.
  • [9] K. Stachowiak, J. Weissenberg, and P. Zwierzykowski, „Lagrangian relaxation in the multicriterial routing", in Proc. IEEE AFRICON 2011, Livingstone, Zambia, 2011, pp. 1-6.
  • [10] A. Jüttner, B. Szviatovszki, I. Mecs, and Z. Rajko, „Lagrange relaxation based method for the QoS routing problem", in Proc. 20th Ann. Joint Conf. IEEE Comp. Commun. Soc. INFOCOM 2001, Anchorage, Alaska USA, 2001.
  • [11] R. Prim, „Shortest connection networks and some generalizations", Bell Systems Tech. J., vol. 36, pp. 1389-1401, 1957.
  • [12] M. Piechowiak and P. Zwierzykowski, „A new delay-constrained multicast routing algorithm for packet networks", in Proc. IEEE AFRICON 2009, Nairobi, Kenya, 2009, pp. 1-5.
  • [13] F. Gang, „A multi-constrained multicast QoS routing algorithm", Comp. Commun., vol. 29, no. 10, pp. 1811-1822, 2006.
  • [14] K. Stachowiak and P. Zwierzykowski, „Rendezvous point based approach to the multi-constrained multicast routing problem", AEU - Int. J. Electron. Commun., vol. 68, no. 6, pp. 561-564, 2014.
  • [15] K. Stachowiak and P. Zwierzykowski, „Innovative method of the evaluation of multicriterial multicast routing algorithms", J. Telecommun. Inform. Technol., no. 1, pp. 49-55, 2013.
  • [16] R. Rajaraman, „Topology control and routing in ad hoc networks: a survey", ACM SIGACT News, vol. 33, no. 2, pp. 60-73, 2002.
  • [17] P. Santi, „Topology control in wireless ad hoc and sensor networks", ACM Comput. Surveys, vol. 37, no. 2, pp. 164-194, 2005.
  • [18] N. Li, J. Hou, and L. Sha, „Design and analysis of an MST-based topology control algorithm", in Proc. 22th Ann. Joint Conf. IEEE Comp. Commun. Soc. INFOCOM 2002, San Francisco, CA, USA, 2003, pp. 1702-1712.
  • [19] A. Medina, A. Lakhina, I. Matta, and J. Byers, „BRITE: An approach to universal topology generation", in Proc. 9th Int. Worksh. Model. Anal. Simul. Comp. Telecommun. Syst. MASCOTS 2001, Cincinnati, OH, USA, 2001, pp. 346-356.
  • [20] A. Zamożniewicz, „Methods for generating topologies of ad hoc networks", Master thesis, Poznan University of Technology, 2009 (in Polish).
  • [21] P. Prokopowicz, M. Piechowiak, and P. Kotlarz, „The linguistic modeling of fuzzy system as multicriteria evaluator for the multicast routing algorithms", in Artificial Intelligence and Soft Computing, L. Rutkowski et al., Eds. Proc. of ICAISC 2014, Zakopane, Poland, Part II. LNAI, vol. 8468, pp. 665-675. Springer, 2014.
  • [22] F. Gang, „The revisit of QoS routing based on non-linear Lagrange relaxation", Int. J. Commun. Syst., vol. 20, no. 1, pp. 9-22, 2007.
  • [23] P. Prokopowicz, „Flexible and simple methods of calculations on fuzzy numbers with the ordered fuzzy numbers model", Artificial Intelligence and Soft Computing, L. Rutkowski et al., Eds. Proc. of ICAISC 2013, Zakopane, Poland, Part I. LNAI, vol. 7894, pp. 365-375. Springer, 2013.
  • [24] J. M. Czerniak, W. Dobrosielski, Ł. Apiecionek, and D. Ewald, „Representation of a trend in OFN during fuzzy observance of the water level from the crisis control center", in Proc. 2015 Federated Conf. Comp. Sci. & Inform. Syst. FedCSIS 2015, Łódź, Poland, 2015, Annals of Computer Science and Information Systems, vol. 5, pp. 443-447 (doi: 10.15439/2015F217).
Uwagi
Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-b08dfb74-279b-4bb5-baa9-e6be1a5abbf8
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.