20 July 2020 in IEEE Access
The recent outbreak of COVID-19 has taken the world by surprise, forcing lockdowns and straining public health care systems. COVID-19 is known to be a highly infectious virus, and infected individuals do not initially exhibit symptoms, while some remain asymptomatic. Thus, a non-negligible fraction of the population can, at any given time, be a hidden source of transmissions. In response, many governments have shown great interest in smartphone contact tracing apps that help automate the difficult task of tracing all recent contacts of newly identified infected individuals. However, tracing apps have generated much discussion around their key attributes, including system architecture, data management, privacy, security, proximity estimation, and attack vulnerability. In this article, we provide the first comprehensive review of these much-discussed tracing app attributes. We also present an overview of many proposed tracing app examples, some of which have been deployed countrywide, and discuss the concerns users have reported regarding their usage. We close by outlining potential research directions for next-generation app design, which would facilitate improved tracing and security performance, as well as wide adoption by the population at large.
1 April 2005 in ACM SIGMOBILE Mobile Computing and Communications Review
Several anomalies can occur in wireless sensor networks that impair their desired functionalities i.e., sensing and communication. Different kinds of holes can form in such networks creating geographically correlated problem areas such as coverage holes, routing holes, jamming holes, sink/black holes and worm holes, etc. We detail in this paper different types of holes, discuss their characteristics and study their effects on successful working of a sensor network. We present state-of-the-art in research for addressing the holes related problems in wireless sensor networks and discuss the relative strengths and short-comings of the proposed solutions for combating different kinds of holes. We conclude by highlighting future research directions.
4 April 2005 in IEEE Transactions on Mobile Computing
We present a novel scheme for node localization in a delay-tolerant sensor network (DTN). In a DTN, sensor devices are often organized in network clusters that may be mutually disconnected. Some mobile robots may be used to collect data from the network clusters. The key idea in our scheme is to use this robot to perform location estimation for the sensor nodes it passes based on the signal strength of the radio messages received from them. Thus, we eliminate the processing constraints of static sensor nodes and the need for static reference beacons. Our mathematical contribution is the use of a robust extended Kalman filter (REKF)-based state estimator to solve the localization. Compared to the standard extended Kalman filter, REKF is computationally efficient and also more robust. Finally, we have implemented our localization scheme on a hybrid sensor network test bed and show that it can achieve node localization accuracy within 1 m in a large indoor setting.
12 August 2015 in IEEE Transactions on Mobile Computing
Airborne relaying can extend wireless sensor networks (WSNs) to remote human-unfriendly terrains. However, lossy airborne channels and limited battery of unmanned aerial vehicles (UAVs) are critical issues, adversely affecting success rate and network lifetime, especially in real-time applications. We propose an energy-efficient cooperative relaying scheme which extends network lifetime while guaranteeing the success rate. The optimal transmission schedule of the UAVs is formulated to minimize the maximum (min-max) energy consumption under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimisation techniques. We also propose a computationally efficient suboptimal algorithm to reduce the scheduling complexity, where energy balancing and rate adaptation are decoupled and carried out in a recursive alternating manner. Simulation results confirm that the suboptimal algorithm cuts off the complexity by orders of magnitude with marginal loss of the optimal network yield (throughput) and lifetime. The proposed suboptimal algorithm can also save energy by 50 percent, increase network yield by 15 percent, and extend network lifetime by 33 percent, compared to the prior art.
11 April 2014 in IEEE Transactions on Dependable and Secure Computing
Due to limited computational power and energy resources, aggregation of data from multiple sensor nodes done at the aggregating node is usually accomplished by simple methods such as averaging. However such aggregation is known to be highly vulnerable to node compromising attacks. Since WSN are usually unattended and without tamper resistant hardware, they are highly susceptible to such attacks. Thus, ascertaining trustworthiness of data and reputation of sensor nodes is crucial for WSN. As the performance of very low power processors dramatically improves, future aggregator nodes will be capable of performing more sophisticated data aggregation algorithms, thus making WSN less vulnerable. Iterative filtering algorithms hold great promise for such a purpose. Such algorithms simultaneously aggregate data from multiple sources and provide trust assessment of these sources, usually in a form of corresponding weight factors assigned to data provided by each source. In this paper we demonstrate that several existing iterative filtering algorithms, while significantly more robust against collusion attacks than the simple averaging methods, are nevertheless susceptive to a novel sophisticated collusion attack we introduce. To address this security issue, we propose an improvement for iterative filtering techniques by providing an initial approximation for such algorithms which makes them not only collusion robust, but also more accurate and faster converging.
22 April 2015 in IEEE Transactions on Reliability
Software Defined Networking (SDN) is rapidly emerging as a new paradigm for managing and controlling the operation of networks ranging from the data center to the core, enterprise, and home. The logical centralization of network intelligence presents exciting challenges and opportunities to enhance security in such networks, including new ways to prevent, detect, and react to threats, as well as innovative security services and applications that are built upon SDN capabilities. In this paper, we undertake a comprehensive survey of recent works that apply SDN to security, and identify promising future directions that can be addressed by such research.