Energy Consumption Rate based Stable Election Protocol (ECRSEP) for WSNs

In recent few yearsWireless Sensor Networks (WSNs) have seen an increased interest in various applications like border field security, disaster management and medical applications. So large number of sensor nodes are deployed for such applications, which can work autonomously. Due to small power batteries in WSNs, efficient utilization of battery power is an important factor. Clustering is an efficient technique to extend life time of sensor networks by reducing the energy consumption. In this paper, we propose a new protocol; Energy Consumption Rate based Stable Election Protocol (ECRSEP). Our CH selection scheme is based on the weighted election probabilities of each node according to the Energy Consumption Rate (ECR) of each node. We compare results of our proposed protocol with Low Energy Adaptive Clustering Hierarchy (LEACH), Distributed Energy Efficient Clustering (DEEC), Stable Election Protocol (SEP), and Enhanced SEP(ESEP). Our simulation results show that our proposed protocol, ECRSEP outperforms all these protocols in terms of network stability and network lifetime

TSEP: Threshold-sensitive Stable Election Protocol for WSNs

Wireless Sensor Networks (WSNs) are expected to find wide applicability and increasing deployment in near future. In this paper, we propose a new protocol, Threshold Sensitive Stable Election Protocol (TSEP), which is reactive protocol using three levels of heterogeneity. Reactive networks, as opposed to proactive networks, respond immediately to changes in relevant parameters of interest. We evaluate performance of our protocol for a simple temperature sensing application and compare results of protocol with some other protocols LEACH, DEEC, SEP, ESEP and TEEN. And from simulation results it is observed that protocol outperforms concerning life time of sensing nodes used.Comment: 10th IEEE International Conference on Frontiers of Information Technology (FIT 12), 201

SQAP: A simple QoS supportive adaptive polling protocol for wireless LANs

A Simple QoS supportive Adaptive Polling (SQAP) protocol for wireless LANs is introduced. SQAP operates under an infrastructure wireless LAN, where an Access Point (AP) polls the wireless nodes in order to grant them permission to transmit. The polled node sends data directly to the destination node. We consider bursty traffic conditions, under which the protocol operates efficiently. The polling scheme is based on an adaptive algorithm according to which it is most likely that an active node is polled. Also, SQAP takes into account packet priorities, so it supports QoS by means of the Highest Priority First packet buffer discipline and the priority distinctive polling scheme. Lastly, the protocol combines efficiency and fairness, since it prohibits a singe node to dominate the medium permanently. SQAP is compared to the efficient learning automata-based polling (LEAP) protocol, and is shown to have superior performance. © 2005 Elsevier B.V. All rights reserved

EEHC: Event-driven Energy Optimization in Heterogeneous Clustered Wireless Sensor Networks

Wireless sensor networks are used in various applications worldwide. Large numbers small sized, inexpensive, low-powered sensor nodes are deployed in the target field to monitor or track particular objects. Sensor nodes have limited energy and computation capability. Energy optimization is an important task should be performed to improve the lifetime of the wireless sensor networks. Many researches focus only on continuous delivery model. This paper proposed energy efficient event-driven heterogeneous clustered wireless sensor network (EEHC) system. The results show that the proposed system reduced the energy consumption and longer lifetime than its comparatives

HSEP: Heterogeneity-aware Hierarchical Stable Election Protocol for WSNs

Wireless Sensor Networks (WSNs) are increasing to handle complex situations and functions. In these networks some of the nodes become Cluster Heads (CHs) which are responsible to aggregate data of from cluster members and transmit it to Base Stations (BS). Those clustering techniques which are designed for homogenous network are not enough efficient for consuming energy. Stable Election Protocol (SEP) introduces heterogeneity in WSNs, consisting of two type of nodes. SEP is based on weighted election probabilities of each node to become CH according to remaining energy of nodes. We propose Heterogeneity-aware Hierarchal Stable Election Protocol (HSEP) having two level of energies. Simulation results show that HSEP prolongs stability period and network lifetime, as compared to conventional routing protocols and having higher average throughput than selected clustering protocols in WSNs.Comment: ASTSA with 7th IEEE International Conference on Broadband and ireless Computing, Communication and Applications (BWCCA 2012), Victoria, Canada, 201

SurvSec: A New Security Architecture for Reliable Network Recovery from Base Station Failure of Surveillance WSN

AbstractSecuring surveillance wireless sensor networks (WSNs) in hostile environments such as borders, perimeters and battlefields during Base Station (BS) failure is challenging. Surveillance WSNs are highly vulnerable to BS failure. The attackers can render the network useless by only destroying the BS as the needed efforts to destroy the BS is much less than that is needed to destroy the network. This attack scenario will give the attackers the best chance to compromise many legitimate nodes. Previous works have tackled BS failure by deploying a mobile BS or by using multiple BSs. Despite the best electronic countermeasures, intrusion tolerance and anti-traffic analysis strategies to protect the BSs, an adversary still can destroy them. This paper proposes a novel security architecture called Surveillance Security (SurvSec) for reliable network recovery from single BS failure of surveillance WSN with single BS. SurvSec relies on a set of sensor nodes serve as Security Managers for management and storage of the security related data of all sensor nodes. SurvSec security architecture provides methodologies for choosing and changing the security managers of the surveillance WSN. SurvSec has three components: (1) Sensor nodes serve as Security Managers, (2) Data Storage System, (3) Data Recovery System. Furthermore, both the frame format of the stored data is carefully built and the security threats are encoded to allow minimum overheads for SurvSec security architecture. In this paper, we provide detailed specifications of SurvSec security architecture. We evaluate our designed security architecture for reliable network recovery from BS failure. Our evaluation shows that the proposed new security architecture can meet all the desired specifications and our analysis shows that the provided Security Managers are capable of network recovery from BS failure

Routing in mobile Ad Hoc Networks

A Mobile Ad Hoc Network (MANET) is built on the fly where a number of wireless mobile nodes work in cooperation without the engagement of any centralized access point or any fixed infrastructure. Two nodes in such a network can communicate in a bidirectional manner if and only if the distance between them is at most the minimum of their transmission ranges. When a node wants to communicate with a node outside its transmission range, a multihop routing strategy is used which involves some intermediate nodes. Because of the movements of nodes, there is a constant possibility of topology change in MANET. Considering this unique aspect of MANET, a number of routing protocols have been proposed so far. This chapter gives an overview of the past, current, and future research areas for routing in MANET. In this chapter we will learn about the following things: - The preliminaries of mobile ad hoc network - The challenges for routing in MANET - Expected properties of a MANET routing protocol - Categories of routing protocols for MANET - Major routing protocols for MANET - Criteria for performance comparison of the routing protocols for MANET - Achievements and future research directions - Expectations and realit

QAP: A QoS supportive adaptive polling protocol for wireless LANs

A QoS supportive adaptive polling (QAP) protocol for wireless LANs is introduced. QAP operates under an infrastructure wireless LAN, where an access point (AP) polls the wireless nodes in order to grant them permission to transmit. The polled node sends data directly to the destination node. We consider bursty traffic conditions, under which the protocol operates efficiently. The polling scheme is based on an adaptive algorithm according to which it is most likely that an active node is polled. Also, QAP takes into account packet priorities, so it supports QoS by means of the Highest Priority First packet buffer discipline and the priority distinctive polling scheme. Lastly, the protocol combines efficiency and fairness, since it prohibits a single node to dominate the medium permanently. QAP is compared to the efficient learning automata-based polling (LEAP) protocol, and is shown to have superior performance. © 2005 Elsevier B.V. All rights reserved