Multihop clustering algorithm for load balancing in wireless sensor networks

The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach

MiPOS - the Mote Indoor Positioning System

In the past few years, there have been huge research efforts into ubiquitous and context aware platforms that offer a user a custom level of service based on some known local parameters. The utility of such systems is greatly enhanced if a physical locational area can be determined. Recently, hybrid devices have been developed combining low power micro controllers with short range FM radio transceivers. Some location identification work has been carried out with these systems such as the Matrix Pencil approximation technique[8],however most of these all provide information for an ideal square area with no RF obstructions.Here we present MiPOS, a scalable locationing system based on the MICA mote[11] family of devices.The design goal of MiPOS is to provide a low-power, scalable, distributed locationing system suited to an indoor (office) environment.During the presentation of this paper we will highlight solutions in the areas of security, radio and network management and power awareness for a hybrid context aware wearable locationing device

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)