Using mobile agents to detect and recover from node compromise in path-based DoS attacks in wireless sensor networks

Wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack called a path-based DoS (PDoS) attack has appeared. In a PDoS attack, an adversary, either inside or outside the network, overwhelms sensor nodes by flooding a multi-hop end-to end communication path with either replayed packets or injected spurious packets. Detection and recovery from PDoS attacks have not been given much attention in the literature. In this article, we propose a solution using mobile agents which can detect PDoS attacks easily and efficiently and recover the compromised nodes.

Maintaining optimal co-channel interference for power efficient wireless communication

Maintaining QoS (quality of service) guaranteed communication links, and improving the energy consumption; are two aspects that received a significant consideration in the modern wireless sensor network research. This paper formulates a transmission power control problem which satisfies both considerations mentioned above. Moreover, a class of functions for an iterative controller was introduced and analyzed for its convergence. The experimental evaluation of the controller justifies the theoretical assertions as well as the applicability of the control scheme in wireless nodes with minimum measurement capabilities.

Geographic routing with cooperative relaying and leapfrogging in wireless sensor networks

A novel geographic routing protocol for multi-hop wireless sensor networks is presented. It exploits the broadcast nature of the wireless channel to enable on-demand cooperative relaying and leapfrogging for circumventing weak radio links. In order to achieve energy efficiency, a metric is introduced for next-hop selection that takes into account information on the residual battery energy, the geographical position of the sensor nodes, and the channel quality of the involved radio links when available. Performance results show that the completely decentralized protocol offers significant benefits by reducing the number of (re)transmissions required to reach the destination. This translates into network-wide energy savings that extend the network lifetime.

LAN cafes: cafes, places of gathering or sites of informal teaching and learning?

Despite the interest of sociologists and educational researchers in Internet café as sites for new cultural and social formations and informal learning, thus far little attention has been paid to the function of café owners, managers and other staff in the mediation and co-construction of those spaces. Drawing from interviews with managers of commercial Internet café in Australia specialising in LAN (Local Area Network) gaming, this article seeks to examine their role and their attitudes more closely; in particular with regard to school-aged users of their facilities. We contend that LAN café are liminal spaces situated at the margins of Australian culture and located at the junctions between home, school and the street, online and offline spaces, work and play. The roles of LAN café managers are similarly ambiguous: in many ways they can be regarded as informal teachers facilitating the process of informal learning.

The crossroads approach to information discovery in wireless sensor networks

Wireless sensor networks (WSN) are attractive for information gathering in large-scale data rich environments. In order to fully exploit the data gathering and dissemination capabilities of these networks, energy-efficient and scalable solutions for data storage and information discovery are essential. In this paper, we formulate the information discovery problem as a load-balancing problem, with the combined aim being to maximize network lifetime and minimize query processing delay resulting in QoS improvements. We propose a novel information storage and distribution mechanism that takes into account the residual energy levels in individual sensors. Further, we propose a hybrid push-pull strategy that enables fast response to information discovery queries.

Simulations results prove the proposed method(s) of information discovery offer significant QoS benefits for global as well as individual queries in comparison to previous approaches.

Dynamic route construction for mobile collectors in wireless sensor networks

Wireless sensor networks with mobile data collectors have been recently proposed for extending the sensor network lifetime. Powerful mobile collectors are deployed to patrol the network and approach the static sensors for collecting their data buffers using single hop communication. The route followed by the mobile collector is very crucial for the data collection operation performed in the network and highly impacts the data collection time. This paper presents a practically efficient algorithm for constructing the mobile collector route. The route is constructed dynamically during the network operational time regardless of the sensors data generation rates. The algorithm acts on minimizing the sleeping time and the number of sensors waiting for the arrival of the mobile collector. Simulation results demonstrate that the presented algorithm can effectively reduce the overall data collection time.

A practical framework for data collection in wireless sensor networks

Optimizing energy consumption for extending the lifetime in wireless sensor networks is of dominant importance. Groups of autonomous robots and unmanned aerial vehicles (UAVs) acting as mobile data collectors are utilized to minimize the energy expenditure of the sensor nodes by approaching the sensors and collecting their buffers via single hop communication, rather than using multihop routing to forward the buffers to the base station. This paper models the sensor network and the mobile collectors as a system-of-systems, and defines all levels and types of interactions. A practical framework that facilitates deploying heterogeneous mobiles without prior knowledge about the sensor network is presented. Realizing the framework is done through simulation experiments and tested against several performance metrics.

Decentralized mobility models for data collection in wireless sensor networks

Controlled mobility in wireless sensor networks provides many benefits towards enhancing the network performance and prolonging its lifetime. Mobile elements, acting as mechanical data carriers, traverse the network collecting data using single-hop communication, instead of the more energy demanding multi-hop routing to the sink. Scaling up from single to multiple mobiles is based more on the mobility models and the coordination methodology rather than increasing the number of mobile elements in the network. This work addresses the problem of designing and coordinating decentralized mobile elements for scheduling data collection in wireless sensor networks, while preserving some performance measures, such as latency and amount of data collected. We propose two mobility models governing the behaviour of the mobile element, where the incoming data collection requests are scheduled to service according to bidding strategies to determine the winner element. Simulations are run to measure the performance of the proposed mobility models subject to the network size and the number of mobile elements.

Performance of smart antennas with receive diversity in wireless sensor networks

In this paper we propose a Geometrically Based Single Bounce Elliptical Model (GBSBEM) for multipath components involving randomly placed scatterers in the scattering region with sensors deployed on a field. The system model assumes a cluster based wireless sensor network (WSN) which collects information from the sensors, filters and modulates the data and transmit it through a wireless channel to be collected at the receiver. We first develop a GBSBE model and based on this model we develop our channel model. Use of Smart antenna system at the receiver end, which exploits various receive diversity combining techniques like Maximal Ratio Combining (MRC), Equal Gain Combining (EGC), and Selection Combining (SC), adds novelty to this system. The performance of these techniques have been proved through matlab simulations and further ahead based on different number of antenna elements present at the receiver array, we calculate the performance of our system in terms of bit-error-rate (BER). Based on the transmission power we quantify for the energy efficiency of our communication model.

An adaptive policy-based vertical handoff algorithm for heterogeneous wireless networks

The next generation of wireless networks is envisioned as convergence of heterogeneous radio access networks. Since technologies are becoming more collaborative, a possible integration between IEEE 802.16 based network and previous generation of telecommunication systems (2G, ..., 3G) must be considered. A novel quality function based vertical handoff (VHO) algorithm, based on proposed velocity and average receive power estimation algorithms is discussed in this paper. The short-time Fourier analysis of received signal strength (RSS) is employed to obtain mobile speed and average received power estimates. Performance of quality function based VHO algorithm is evaluated by means of measure of quality of service (QoS). Simulation results show that proposed quality function, brings significant gains in QoS and more efficient use of resources can be achieved.

Wireless estimation of canine pose for search and rescue

In this paper we discuss the use of accelerometers and Bluetooth to monitor canine pose in the context of common poses observed in urban search and rescue dogs. We discuss the use of the canine pose system in a disaster environment, and propose techniques for determining canine pose. In addition we discuss the challenges with this approach in such environments. The paper presents the experimental results obtained from the heavy urban search and rescue disaster simulation, where experiments were conducted using multiple canines, which show that angles can be derived from acceleration readings. Our experiments show that similar angles were measured for each of the poses, even when measured on multiple USAR canines of varying size. We also found measurable and consistent differences between each of the poses, making them clearly distinguishable from one another, again even when comparing with different USAR canines.

Using mobile agents to recover from node and database compromise in path-based DoS attacks in wireless sensor networks

Wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack called a path-based DoS (PDoS) attack has appeared. In a PDoS attack, an adversary, either inside or outside the network, overwhelms sensor nodes by flooding a multi-hop end-to-end communication path with either replayed packets or injected spurious packets. Detection and recovery from PDoS attacks have not been given much attention in the literature. In this article, we consider wireless sensor networks designed to collect and store data. In a path-based attack, both sensor nodes and the database containing collected data can be compromised. We propose a recovery method using mobile agents which can detect PDoS attacks easily and efficiently and recover the compromised nodes along with the database.

Wireless broadcast encryption based on smart cards

Wireless broadcasting is an efficient way to broadcast data to a large number of users. Some commercial applications of wireless broadcasting, such as satellite pay-TV, desire that only those users who have paid for the service can retrieve broadcast data. This is often achieved by broadcast encryption, which allows a station securely to broadcast data to a dynamically changing set of privileged users through open air. Most existing broadcast encryption schemes can only revoke a pre-specified number of users before system re-setup or require high computation, communication and storage overheads in receivers. In this paper, we propose a new broadcast encryption scheme based on smart cards. In our scheme, smart cards are used to prevent users from leaking secret keys. Additionally, once an illegally cloned smart card is captured, our scheme also allows tracing of the compromised smart card by which illegal smart cards are cloned, and can then revoke all cloned smart cards. The new features of our scheme include minimal computation needs of only a few modular multiplications in the smart card, and the capability to revoke up to any number of users in one revocation. Furthermore, our scheme is secure against both passive and active attacks and has better performance than other schemes.