Related papers: On the Applicability of Combinatorial Designs to K…
We propose and study the feasibility of wireless quantum key distribution (QKD) in indoor environments. Such systems are essential in providing wireless access to the developing quantum communications networks. We find a practical regime of…
We study semantic security for classical-quantum channels. Our security functions are functional forms of mosaics of combinatorial designs. We extend methods for classical channels to classical-quantum channels to demonstrate that mosaics…
We consider the network reliability problem in wireless sensor networks secured by the heterogeneous random key predistribution scheme. This scheme generalizes Eschenauer-Gligor scheme by considering the cases when the network comprises…
In wireless sensor networks (WSNs), security has a vital importance. Recently, there was a huge interest to propose security solutions in WSNs because of their applications in both civilian and military domains. Adversaries can launch…
Wireless sensor networks (WSNs) has a practical ability to link a set of sensors to build a wireless network that can be accessed remotely; this technology has become increasingly popular in recent years. Wi-Fi-enabled sensor networks…
Generally traffic and the sensor network security have many challenges in the transmission of data in the network. The existing schemes consider homogeneous sensor networks which have poor performance and scalability. Due to many-to-one…
We investigate the secure connectivity of wireless sensor networks under a heterogeneous random key predistribution scheme and a heterogeneous channel model. In particular, we study a random graph formed by the intersection of an…
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 node-capture attacks precisely and under realistic…
Wireless sensor networks (WSNs) have recently gained a lot of attention by scientific community. Small and inexpensive devices with low energy consumption and limited computing resources are increasingly being adopted in different…
In scenarios where devices are too small to support MIMO antenna arrays, symbol-level cooperation may be used to pool the resources of distributed single-antenna devices to create a virtual MIMO antenna array. We address design fundamentals…
This invited paper presents some novel ideas on how to enhance the performance of consensus algorithms in distributed wireless sensor networks, when communication costs are considered. Of particular interest are consensus algorithms that…
The use of quantum cryptography in everyday applications has gained attention in both industrial and academic fields. Due to advancements in quantum electronics, practical quantum devices are already available in the market, and ready for…
Wireless Sensor Networks (WSNs) is an emerging technology in several application domains, ranging from urban surveillance to environmental and structural monitoring. Computational Intelligence (CI) techniques are particularly suitable for…
Wireless sensor networks are harshly restricted by storage capacity, energy and computing power. So it is essential to design effective and energy aware protocol in order to enhance the network lifetime. In this paper, a review on routing…
Wireless Sensor Networks (WSNs) are used to perform distributed sensing in various fields, such as health, military, home etc. In WSNs, sensor nodes should communicate among themselves and do distributed computation over the sensed values…
The miniaturization process of various sensing devices has become a reality by enormous research and advancements accomplished in Micro Electro-Mechanical Systems (MEMS) and Very Large Scale Integration (VLSI) lithography. Regardless of…
This review is aimed to evaluate the importance of Symmetric Key Cryptography for Security in Distributed Systems. Businesses around the world as well as research and other such areas rely heavily on distributed systems these days. Hence,…
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also…
Quantum key-distribution protocols allow two honest distant parties to establish a common truly random secret key in the presence of powerful adversaries, provided that the two users share beforehand a short secret key. This pre-shared…
We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate…