Density Controlled Divide-and-Rule Scheme for Energy Efficient Routing in Wireless Sensor Networks

Cluster based routing technique is most popular routing technique in Wireless Sensor Networks (WSNs). Due to varying need of WSN applications efficient energy utilization in routing protocols is still a potential area of research. In this research work we introduced a new energy efficient cluster based routing technique. In this technique we tried to overcome the problem of coverage hole and energy hole. In our technique we controlled these problems by introducing density controlled uniform distribution of nodes and fixing optimum number of Cluster Heads (CHs) in each round. Finally we verified our technique by experimental results of MATLAB simulations.Comment: 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE2013), Regina, Saskatchewan, Canada, 201

Design Aspects of An Energy-Efficient, Lightweight Medium Access Control Protocol for Wireless Sensor Networks

This document gives an overview of the most relevant design aspects of the lightweight medium access control (LMAC) protocol [16] for wireless sensor networks (WSNs). These aspects include selfconfiguring and localized operation of the protocol, time synchronization in multi-hop networks, network setup and strategies to reduce latency.\ud The main goal in designing a MAC protocol for WSNs is to minimize energy waste - due to collisions of messages and idle listening - , while limiting latency and loss of data throughput. It is shown that the LMAC protocol performs well on energy-efficiency and delivery ratio [19] and can\ud ensure a long-lived, self-configuring network of battery-powered wireless sensors.\ud The protocol is based upon scheduled access, in which each node periodically gets a time slot, during which it is allowed to transmit. The protocol does not depend on central managers to assign time slots to nodes.\ud WSNs are assumed to be multi-hop networks, which allows for spatial reuse of time slots, just like frequency reuse in GSM cells. In this document, we present a distributed algorithm that allows nodes to find unoccupied time slots, which can be used without causing collision or interference to other nodes. Each node takes one time slot in control to\ud carry out its data transmissions. Latency is affected by the actual choice of controlled time slot. We present time slot choosing strategies, which ensure a low latency for the most common data traffic in WSNs: reporting of sensor readings to central sinks

Secure Clustering in DSN with Key Predistribution and WCDS

This paper proposes an efficient approach of secure clustering in distributed sensor networks. The clusters or groups in the network are formed based on offline rank assignment and predistribution of secret keys. Our approach uses the concept of weakly connected dominating set (WCDS) to reduce the number of cluster-heads in the network. The formation of clusters in the network is secured as the secret keys are distributed and used in an efficient way to resist the inclusion of any hostile entity in the clusters. Along with the description of our approach, we present an analysis and comparison of our approach with other schemes. We also mention the limitations of our approach considering the practical implementation of the sensor networks.Comment: 6 page