A ZigBee/Wi-Fi Cooperative Channel Control Method and Its Prototyping

Coexistence between ZigBee and Wi-Fi technologies, which operate within the same frequency band, is increasing with the widespread use of the IoT (Internet of Things). ZigBee devices suffer significant decrease in the sink arrival rate of packets in the presence of Wi-Fi interference. To overcome this problem, many channel control methods have been proposed. These existing methods switch only ZigBee channels to avoid interference with Wi-Fi. In contrast, we propose a cooperative channel control method for improving ZigBee packet arrival rate by controlling both the Wi-Fi and ZigBee channels. Specifically, the proposed method not only controls ZigBee devices and channels but also requests a temporary pause in the use of specific Wi-Fi channels. Finally, we show the effectiveness of the proposed method from the viewpoints of ZigBee’s packet arrival rate and applications’ satisfaction using computer simulations. In addition, the effective action of the proposed method is also demonstrated by experiments with prototyping

Name anomaly detection for ICN

International audience—Information leakages are one of the main security threats in today's Internet. As ICN is expected to become the core architecture for Future Internet, it is therefore mandatory to prevent this threat. This paper proves that some ICN configuration prevents information leakages via Data packets and shows that it is an open problem to prevent interest packets from carrying encoded crucial information in their names. Assuming that names in ICN will follow the current URL format commonly used in the Internet, we get the statistics of web URL based on extensive crawling experiments of main internet organizations. Then we propose a simple filtering technique based on these statistics for firewall to detect anomalous names in ICN. The experiment shows that our filtering technique recognizes 15% of names in our dataset as malicious. As the false positive rate is still high for this filter to be used in a real world operation, this work is an important step for detecting anomalous names and preventing information-leakage in ICN

Fair Routing for Overlapped Cooperative Heterogeneous Wireless Sensor Networks

In recent years, as WSNs (Wireless Sensor Networks) are diffused widely, multiple overlapping WSNs constructed on the same area become more common. In such a situation, their lifetime is expected to be extended by cooperative packet forwarding. Although some researchers have studied about cooperation in multiple WSNs, most of them do not consider the heterogeneity in characteristics of each WSN such as battery capacity, operation start time, the number of nodes, nodes locations, energy consumption, packet size and/or data transmission timing, and so on. In a heterogeneous environment, naive lifetime improvement with cooperation may not be fair. In this paper, we propose a fair cooperative routing method for heterogeneous overlapped WSNs. It introduces an energy pool to maintain the total amount of energy consumption by cooperative forwarding. The energy pool plays a role of broker for fair cooperation. Finally, simulation results show the excellent performance of the proposed method

Name Filter: A Countermeasure against Information Leakage Attacks in Named Data Networking

International audienceNamed Data Networking (NDN) has emerged as a future networking architecture having thepotential to replace the Internet. In order to do so, NDN needs to cope with inherent problems of the Internetsuch as attacks that cause information leakage from an enterprise. Since NDN has not yet been deployed ona large scale, it is currently unknown how such attacks can occur, let alone what countermeasures can betaken against them. In this study, we first show that information leakage in NDN, can be caused by malwareinside an enterprise, which uses steganography to produce malicious Interest names encoding confidentialinformation. We investigate such attacks by utilizing a content name dataset based on uniform resourcelocators (URLs) collected by a web crawler. Our main contribution is a name filter based on anomalydetection that takes the dataset as input and classifies a name in the Interest as legitimate or not. Ourevaluation shows that malware can exploit the path part in the URL-based NDN name to create maliciousnames, thus, information leakage in NDN cannot be prevented completely. However, we illustrate for thefirst time that our filter can dramatically choke the leakage throughput causing the malware to be 137 timesless efficient at leaking information. This finding opens up an interesting avenue of research that could resultin a safer future networking architecture

Risk analysis of information-leakage through interest packets in NDN

International audienceInformation-leakage is one of the most importantsecurity issues in the current Internet. In Named-Data Networking(NDN), Interest names introduce novel vulnerabilities thatcan be exploited. By setting up a malware, Interest names can beused to encode critical information (steganography embedded) andto leak information out of the network by generating anomalousInterest traffic. This security threat based on Interest names doesnot exist in IP network, and it is essential to solve this issue tosecure the NDN architecture. This paper performs risk analysisof information-leakage in NDN. We first describe vulnerabilitieswith Interest names and, as countermeasures, we propose a namebasedfilter using search engine information, and another filterusing one-class Support Vector Machine (SVM). We collectedURLs from the data repository provided by Common Crawland we evaluate the performances of our per-packet filters. Weshow that our filters can choke drastically the throughput ofinformation-leakage, which makes it easier to detect anomalousInterest traffic. It is therefore possible to mitigate informationleakagein NDN network and it is a strong incentive for futuredeployment of this architecture at the Internet scale

Effective Life and Area Based Data Storing and Deployment in Vehicular Ad-Hoc Networks

In vehicular ad-hoc networks (VANETs), store-carry-forward approach may be used for data sharing, where moving vehicles carry and exchange data when they go by each other. In this ap-proach, storage resource in a vehicle is generally limited. Therefore, attributes of data that have to be stored in vehicles are an important factor in order to efficiently distribute desired data. In VA-NETs, there are different types of data which depend on the time and location. Such kind of data cannot be deployed adequately to the requesting vehicles only by popularity-based rule. In this paper, we propose a data distribution method that takes into account the effective life and area in addition to popularity of data. Our extensive simulation results demonstrate drastic improve-ments on acquisition performance of the time and area specific data