Showing 1 - 20 results of 39 for search '"СЕТЕВОЙ ПРОТОКОЛ"', query time: 0.68s Refine Results
  1. 1
  2. 2
    Academic Journal

    Contributors: Работа выполнена при поддержке РФФИ в рамках научного проекта №18-37-00485

    Source: The Herald of the Siberian State University of Telecommunications and Information Science; № 1 (2019); 70-78 ; Вестник СибГУТИ; № 1 (2019); 70-78 ; 1998-6920

    File Description: application/pdf

    Relation: https://vestnik.sibsutis.ru/jour/article/view/100/104; Jiaqi Cui. CSMA/CA through put analysis in hybrid CSMA/CA and TDMA networks [Электронный ресурс]. URL: https://dl.acm.org/citation.cfm?id=3028882&dl=ACM&coll=DL (дата обращения: 25.05.2018).; Analysis of superframe adjustment and beacon transmission for IEEE 802.15.4 cluster tree networks [Электронный ресурс]. URL: https://www.researchgate.net/publication/257878023_Analysis_of_superframe_adjustment_and_beacon_transmission_for_IEEE_802154_cluster_tree_networks (дата обращения: 25.05.2018).; Jianping Zhu. Performance Analyses and Improvements for IEEE 802.15.4 CSMA/CA Scheme in Wireless Multihop Sensor Networks Based on HTC Algorithm [Электронный ресурс]. URL: https://www.researchgate.net/publication/275460243_Performance_Analyses_and_Improvements_for_IEEE_802154_CSMACA_Scheme_in_Wireless_Multihop_Sensor_Networks_Based_on_HTC_Algorithm (дата обращения: 25.05.2018).; Hao Wen. An Improved Markov Model for IEEE 802.15.4 Slotted CSMA/CA Mechanism [Электронный ресурс]. URL: https://link.springer.com/article/10.1007/s11390-009-9240-5 (дата обращения: 23.05.2018).; Shakil Akhtar. Semi-Markov performance model of CSMA/CD networks [Электронный ресурс]. URL: https://www.sciencedirect.com/science/article/pii/0140366489901096 (дата обращения: 25.05.2018).; Minyu Fang. Power Evaluation and Performance. Enhancement of CSMA/CA based WLANs [Электронный ресурс]. URL: https://www.hamilton.ie/publications/minyus_thesis.pdf (дата обращения: 25.05.2018).; https://vestnik.sibsutis.ru/jour/article/view/100

  3. 3
  4. 4
    Academic Journal

    Source: Scientific research and developments of students; № 1(6); 102-104 ; Научные исследования и разработки студентов; № 1(6); 102-104

    File Description: text/html

    Relation: info:eu-repo/semantics/altIdentifier/isbn/978-5-6040559-9-1; https://interactive-plus.ru/e-articles/534/Action534-468887.pdf; DHCP [Электронный ресурс]. – Режим доступа: https://ru.wikipedia.org/wiki/DHCP (дата обращения: 29.01.2018).

  5. 5
    Academic Journal

    Source: Sučasnì Informacìjnì Tehnologìï u Sferì Bezpeki ta Oboroni, Vol 0, Iss 1(31), Pp 47-52 (2018)
    Modern Information Technologies in the Sphere of Security and Defence; Том 31, № 1 (2018); 47-52
    Современные информационные технологии в сфере безопасности и обороны; Том 31, № 1 (2018); 47-52
    Сучасні інформаційні технології у сфері безпеки та оборони; Том 31, № 1 (2018); 47-52

    File Description: application/pdf

  6. 6
    Academic Journal

    Source: Modeling and Analysis of Information Systems; Том 22, № 4 (2015); 546-562 ; Моделирование и анализ информационных систем; Том 22, № 4 (2015); 546-562 ; 2313-5417 ; 1818-1015

    File Description: application/pdf

    Relation: https://www.mais-journal.ru/jour/article/view/272/281; “B.A.T.M.A.N. Advanced Documentation Overview”, 2014, http://www.open-mesh.org/projects/batman-adv/wiki.; Conner W. S. et al., “IEEE 802.11s Tutorial”, 2006, http://www.ieee802.org/802 tutorials/06-November/802.11s Tutorial r5.pdf.; “Mobile Mesh Networks for Military, Defense and Public Safety”, 2015, http://meshdynamics.com/military-mesh-networks.html.; Shen W. L. et al., “Autonomous Mobile Mesh Networks”, IEEE Transactions on Mobile Computing, 13:2 (2014), 364–376.; Boukerche A. et al., “Routing protocols in ad hoc networks: A survey”, Computer Networks, 55:13 (2011), 3032–3080.; Broch J. et al., “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, Proc. of ACM/IEEE International Conference on Mobile Computing and Networking, 1998, 85–97.; Servetto S.D., Barrenechea G., “Constrained Random Walks on Random Graphs: Routing Algorithms for Large Scale Wireless Sensor Networks”, Proc. of 1st ACM International Workshop on Wireless Sensor Networks and Applications, 2002, 12–21.; Nelakuditi S. et al., “Adaptive Proportional Routing: A Localized QoS Routing Approach”, IEEE/ACM Transactions on Networking, 10:6 (2002), 790–804.; Baumann R. et al., “Routing in Large-Scale Wireless Mesh Networks Using Temperature Fields”, IEEE Network, 2008, 25–31.; Cormen T. H. et al., Introduction to Algorithms, MIT Press, 2009.; Perkins Ch. E. et al., “Performance Comparison of Two On-demand Routing protocols for Ad Hoc Networks”, IEEE Personal Communications, 2001, 16–28.; Awerbuch B. et al., “On the Survivability of Routing Protocols in Ad Hoc Wireless Networks”, CERIAS Tech Report 2005–121, 2005.; Nelakuditi S., Zhang Zh.-L., “On Selection of Paths for Multipath Routing”, Proc. of IWQoS, 2001, 170–186.; Nguyen Ph. H. et al., “Distributed routing algorithms to manage power flow in agent-based active distribution network”, Innovative Smart Grid Technologies Conference Europe (ISGT Europe), IEEE PES, 2010, 1–7.; Brunsch T. et al., “Smoothed Analysis of the Successive Shortest Path Algorithm”, 2015, arXiv: 1501.05493v1.; Spielman D. A., Teng Sh.-H., “Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time”, Journal of the ACM, 51:3 (2004), 385–463.

  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
    Academic Journal

    Source: Engineering Software; Vol. 15 No. 3-4 (2013); 25 ; Инженерия программного обеспечения; Том 15 № 3-4 (2013); 25 ; Інженерія програмного забезпечення; Том 15 № 3-4 (2013); 25

    File Description: application/pdf

  14. 14
    Academic Journal

    Source: Наука і техніка Повітряних Сил Збройних Сил України. — 2013. — № 1(10). 123-125 ; Наука и техника Воздушных Сил Вооруженных Сил Украины. — 2013. — № 1(10). 123-125 ; Science and Technology of the Air Force of Ukraine. — 2013. — № 1(10). 123-125 ; 2223-456X

    File Description: application/pdf

  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20