Catálogo de publicaciones - libros

To increase the lifespan of wireless sensor networks (WSN) and preserve the energy of sensors, data aggregation techniques are usually used. Aggregation can be seen as the process by which data sent from sensors to the BS are little-by-little processed by some nodes called aggregator nodes. Aggregators collect data from surrounding nodes and produce a small sized output, thus preventing that all nodes in the network send their data to the BS. Security plays a major role in data aggregation process, especially that aggregators are more attractive for attackers than normal nodes, where compromising few aggregators can significantly affect the final result of aggregation. In this paper, we present SAPC, a secure aggregation protocol for cluster-based WSN, which does not rely on trusted aggregator nodes and thus is immune to aggregators compromising. In addition to security performance, SAPC has a low transmission overhead.

In this paper, we investigate the use of Aspect-Oriented Programming (AOP) [13] in the domain of Mobile Ad-hoc NETworks (MANETs). More precisely we study the availability issues in Proactive routing protocols. This paper classifies the different possible attacks and examines the countermeasures to ensure availability. Our approach is based on a detection-reaction process. The reasoning followed by the detection process is built on a formal description of normal and incorrect node behaviors. This model allows us to derive security properties. These properties are woven into our implementation using the AOP. Our algorithm checks if these security properties are violated. If they are, detection of incorrect (malicious) behaviors occurs to allow the normal node to find a path without incorrect node behavior. Therefore the detector node sends to its neighborhood the detection information to allow its neighbors to avoid choosing the intruder as a node to cross to. A node chooses the path using its local diagnosis and the reputation of other nodes. Using a field in the standard control message to communicate the detections, our approach does not change the message format, so it is very easy to use and there is no overhead. While we use OLSR as an example of protocol for our studies, we argue that the presented techniques apply equally to any proactive routing protocol for MANETs.

Deploying wireless LANs (WLAN) at large scale is mainly affected by reliability, availability, performance, and security. These parameters will be a concern for most of managers who want to deploy WLANs. Most importantly, the security issue became the predominant factor in WLAN design. Different Intrusion detection mechanisms have been addressed in research papers, but with little being focused on internal intrusion and prevention. In this paper an efficient security method has been proposed. It is based on detecting rogue access points as well as rogue bridge access points and denying their access to the WLAN. In addition a new method of mutual authentication between DHCP server at the AP and wireless client has been introduced. This would allow client to detect rogue DHCP server and stop the association with it. It also allows registered DHCP server to detect unauthorized client and deny its request. Moreover the DHCP server would synchronize with the AP or intelligent LAN switch to drop packets from unauthorized client who might use static IP to get access to the network.

In this paper we discuss the uprising problem of public key revocation. The main problem in key revocation includes the relatively large memory and communication required to store and transmit the revoked list of keys. This problem becomes serious as the sensor network is subjected to several constraints. In this paper, we introduce several efficient representation mechanisms for representing a set of revoked identifiers of keys. We discuss several network and revocation scenarios and introduce the corresponding solution for each. To demonstrate the value of our proposed approaches, practical simulation results and several comparisons with the current used revocation mechanism are included.

Improvements in technology introduce new application for sensor networks. As Mission-critical applications are deployed in distributed wireless sensor networks, security issues arise. They are facing tremendous challenges: wireless communication environment (usually in hostile areas), lack of infrastructure support, inability of predicting network topology and limited resource associated with nodes. Efficient and robust key distribution is important to secure such kind of sensor networks. To address this issue, we propose a simple pair-wise key distribution and management approach. We predistribute an INITIAL_KEY and a PRIVATE_KEY to each sensor. Let each sensor broadcast its encrypted PRIVATE_KEY with limited power. Then every sensor shares a pair-wise key with each of its neighbors. Any pair of adjacent nodes could communicate securely using a common pair-wise key. Node addition and deletion during communication stage are supported, so as to the update of pair-wise keys. Simulation result proves the scalability of our method.

As the WSN multi-media applications go deep into the military, monitor and other data-sensitive areas, stream data have become the main data processing objects instead of scalar data in WMSN. Because of the difference between the application environments and data features of stream data and scalar data, traditional secure routing for scalar data is not fit for stream data. In this paper, SOAR, a secure route for the false data injection attack model is presented. SOAR works in the stream data transfer mode and randomly detects the false data injection attacks. SOAR guarantees that the base stations receive small percentage of false packages with rather low load.

The growing popularity of wireless sensor networks has brought increasing attention to many security issues for such networks. In these security issues, key management is one of the most challenging and in dire need of solving problems. A lot of research has been mainly concentrated on key management for homogeneous wireless sensor networks. However, such homogeneous networks could restrict them to have a long network lifetime as well as to improve network connectivity. Recent research has shown that heterogeneous wireless sensor networks have greater performance and reliability. In this paper, we propose a key management scheme for heterogeneous wireless sensor networks to improve the random key pre-distribution scheme using deployment knowledge of nodes and the prior area deployment information. The performance evaluation and security analysis show that our scheme can substantially improve the network connectivity with low complexity and significant reduction on storage requirement, and enhance the network resilience against node capture, compared with existing key management schemes.