A study of design requirements for mobile learning environments

D Parsons, H Ryu, M Cranshaw - Sixth IEEE International …, 2006 - ieeexplore.ieee.org
This paper proposes a conceptual framework for mobile learning applications that provides
systematic support for mobile learning experience design. It is based on a combination of a …

Resilient wireless sensor networks using topology control: A review

Y Huang, JF Martínez, J Sendra, L López - Sensors, 2015 - mdpi.com
Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and
WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and …

Точные и граничные оценки вероятностей связности сетей связи на основе метода полного перебора типовых состояний

КА Батенков - Информатика и автоматизация, 2019 - mathnet.ru
В работе рассматривается один из методов анализа и синтеза структур сетей связи,
основанный на наиболее простом подходе к вопросу расчета вероятности связности …

On resilience and connectivity of secure wireless sensor networks under node capture attacks

J Zhao - IEEE Transactions on Information Forensics and …, 2016 - ieeexplore.ieee.org
Despite much research on probabilistic key predistribution schemes for wireless sensor
networks over the past decade, few formal analyses exist that define schemes' resilience to …

On the strengths of connectivity and robustness in general random intersection graphs

J Zhao, O Yağan, V Gligor - 53rd IEEE Conference on Decision …, 2014 - ieeexplore.ieee.org
Random intersection graphs have received much attention for nearly two decades, and
currently have a wide range of applications ranging from key predistribution in wireless …

[HTML][HTML] Анализ и синтез структур сетей связи методом перебора состояний

КА Батенков - Вестник Санкт-Петербургского университета …, 2022 - cyberleninka.ru
Рассматривается один из методов анализа и синтеза структур сетей связи,
основанный на наиболее простом подходе к вопросу расчета вероятности связности …

-Connectivity in Random Key Graphs With Unreliable Links

J Zhao, O Yağan, V Gligor - IEEE Transactions on Information …, 2015 - ieeexplore.ieee.org
Random key graphs form a class of random intersection graphs that are naturally induced by
the random key predistribution scheme of Eschenauer and Gligor for securing wireless …

Zero-one laws for connectivity in inhomogeneous random key graphs

O Yağan - IEEE Transactions on Information Theory, 2016 - ieeexplore.ieee.org
We introduce a new random key predistribution scheme for securing heterogeneous
wireless sensor networks. Each of the n sensors in the network is classified into r classes …

Topological Properties of Secure Wireless Sensor Networks Under the -Composite Key Predistribution Scheme With Unreliable Links

J Zhao - IEEE/ACM Transactions on Networking, 2017 - ieeexplore.ieee.org
Security is an important issue in wireless sensor networks (WSNs), which are often deployed
in hostile environments. The q-composite key predistribution scheme has been recognized …

On k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs

J Zhao, O Yağan, V Gligor - 2015 Proceedings of the Twelfth Workshop on …, 2014 - SIAM
Random s-intersection graphs have recently received much interest in a wide range of
application areas. Broadly speaking, a random s-intersection graph is constructed by first …