Matrix-based pairwise key establishment in wireless mesh networks using deployment knowledge

Due to the nature of wireless transmission, communication in wireless mesh networks (WMNs) is vulnerable to many adversarial activities including eavesdropping. Pairwise key establishment is one of the fundamental issues in securing WMNs. This paper presents a new matrix-based pairwise key establishment scheme for mesh clients. Our design is motivated by the fact that in WMNs, mesh routers are more powerful than mesh clients, both in computation and communication. By exploiting this heterogeneity, expensive operations can be delegated to mesh routers, which help alleviate the overhead of mesh clients during key establishment. The new scheme possesses two desirable features: (1) Neighbor mesh clients can directly establish pairwise keys; and (2) Communication and storage costs at mesh clients are significantly reduced.

Privacy protected data forwarding in human associated delay tolerant networks

Human associated delay-tolerant networks (HDTNs) are new networks for DTNs, where mobile devices are associated with humans and demonstrate social related communication characteristics. As most of recent works use real social trace files to study the date forwarding in HDTNs, the privacy protection becomes a serious issue. Traditional privacy protections need to keep the attributes semantics, such as data mining and information retrieval. However, in HDTNs, it is not necessary to keep these meaningful semantics. In this paper, instead, we propose to anonymize the original data by coding to preserve individual's privacy and apply Privacy Protected Data Forwarding (PPDF) model to select the top N nodes to perform the multicast. We use both MIT Reality and Infocom 06 datasets, which are human associated mobile network trace file, to simulate our model. The results of our simulations show that this method can achieve a high data forwarding performance while protect the nodes' privacy as well.

Anonymous data forwarding in human associated delay tolerant networks

Human associated delay-tolerant networks (HDTNs) are new networks for DTNs, where mobile devices are associated with humans and demonstrate social-related communication characteristics. As most of recent works use the social attributes to study the date forwarding in HDTNs and these attributes are critical for the data provider, how to use the anonymous attributes becomes a serious issue. In this paper, we propose a three-dimensional coordinate model by using the anonymous attributes to perform the data forwarding. We use MIT reality dataset, which is a human associated mobile network trace file, to simulate our model. The results of simulations show that the proposed model can use the anonymous attributes to achieve a high data forwarding performance.

Matrix-based pairwise key establishment with pre and post deployment knowledge for wireless mesh networks

The nature of wireless transmission leads to vulnerabilities to many malicious activities, and communication in wireless mesh networks (WMNs) must be protected by proper security measures. This paper focuses on symmetric pair wise key establishment and presents a new matrix-based pair wise key establishment scheme for mesh clients. In WMNs, mesh routers are much more powerful than mesh clients, both in communication and computation. By taking advantage of this heterogeneity, our new scheme delegates energy-consuming operations to mesh routers when establishing pair wise keys for mesh clients. Additionally, neighbor mesh clients in our scheme can directly establish pair wise keys with significantly reduced communication and storage costs, due to the use of both pre and post deployment knowledge.

Polynomial based key predistribution scheme in wireless mesh networks

Wireless mesh networks (WMNs) have the ability to integrate with other networks while providing a fast and cost-saving deployment. The network security is one of important challenge problems in this kind of networks. This paper is focused on key management between mesh and sensor networks. We propose an efficient key pre-distribution scheme based on two polynomials in wireless mesh networks by employing the nature of heterogeneity. Our scheme realizes the property of bloom filters, i.e., neighbor nodes can discover their shared keys but have no knowledge on the different keys possessed by the other node, without the probability of false positive. The analysis presented in this paper shows that our scheme has the ability to establish three different security level keys and achieves the property of self adaptive security for sensor networks with acceptable computation and communication consumption.

Engineering a distributed infrastructure for large-scale cost-effective content dissemination over urban vehicular networks

This paper proposes a practical and cost-effective approach to construct a fully distributed roadside communication infrastructure to facilitate the localized content dissemination to vehicles in the urban area. The proposed infrastructure is composed of distributed lightweight low-cost devices called roadside buffers (RSBs), where each RSB has the limited buffer storage and is able to transmit wirelessly the cached contents to fast-moving vehicles. To enable the distributed RSBs working toward the global optimal performance (e.g., minimal average file download delays), we propose a fully distributed algorithm to determine optimally the content replication strategy at RSBs. Specifically, we first develop a generic analytical model to evaluate the download delay of files, given the probability density of file distribution at RSBs. Then, we formulate the RSB content replication process as an optimization problem and devise a fully distributed content replication scheme accordingly to enable vehicles to recommend intelligently the desirable content files to RSBs. The proposed infrastructure is designed to optimize the global network utility, which accounts for the integrated download experience of users and the download demands of files. Using extensive simulations, we validate the effectiveness of the proposed infrastructure and show that the proposed distributed protocol can approach to the optimal performance and can significantly outperform the traditional heuristics.

Byzantine-resilient secure software-defined networks with multiple controllers

Software-defined network (SDN) is the next generation of networking architecture that is dynamic, manageable, cost-effective, and adaptable, making it ideal for the high-bandwidth, dynamic nature of today's applications. In SDN, network management is facilitated through software rather than low-level device configurations. However, the centralized control plane introduced by SDN imposes a great challenge for the network security. In this paper, we present a secure SDN structure, in which each device is managed by multiple controllers rather than a single one as in a traditional manner. It can resist Byzantine attacks on controllers and the communication links between controllers and SDN switches. Furthermore, we design a cost-efficient controller assignment algorithm to minimize the number of required controllers for a given set of switches. Extensive simulations have been conducted to show that our proposed algorithm significantly outperforms random algorithms. © 2014 IEEE.

Wireless sensor networks for heritage object deformation detection and tracking algorithm

Deformation is the direct cause of heritage object collapse. It is significant to monitor and signal the early warnings of the deformation of heritage objects. However, traditional heritage object monitoring methods only roughly monitor a simple-shaped heritage object as a whole, but cannot monitor complicated heritage objects, which may have a large number of surfaces inside and outside. Wireless sensor networks, comprising many small-sized, low-cost, low-power intelligent sensor nodes, are more useful to detect the deformation of every small part of the heritage objects. Wireless sensor networks need an effective mechanism to reduce both the communication costs and energy consumption in order to monitor the heritage objects in real time. In this paper, we provide an effective heritage object deformation detection and tracking method using wireless sensor networks (EffeHDDT). In EffeHDDT, we discover a connected core set of sensor nodes to reduce the communication cost for transmitting and collecting the data of the sensor networks. Particularly, we propose a heritage object boundary detecting and tracking mechanism. Both theoretical analysis and experimental results demonstrate that our EffeHDDT method outperforms the existing methods in terms of network traffic and the precision of the deformation detection.