M. Akbar

Q-LEACH: A New Routing Protocol for WSNs

Wireless Sensor Networks (WSNs) with their dynamic applications gained a tremendous attention of researchers. Constant monitoring of critical situations attracted researchers to utilize WSNs at vast platforms. The main focus in WSNs is to enhance network life-time as much as one could, for efficient and optimal utilization of resources. Different approaches based upon clustering are proposed for optimum functionality. Network life-time is always related with energy of sensor nodes deployed at remote areas for constant and fault tolerant monitoring. In this work, we propose Quadrature-LEACH (Q-LEACH) for homogenous networks which enhances stability period, network life-time and throughput quiet significantly. c � 2011 Published by Elsevier Ltd.

Efficient Data Gathering in 3D Linear Underwater Wireless Sensor Networks Using Sink Mobility

Due to the unpleasant and unpredictable underwater environment, designing an energy-efficient routing protocol for underwater wireless sensor networks (UWSNs) demands more accuracy and extra computations. In the proposed scheme, we introduce a mobile sink (MS), i.e., an autonomous underwater vehicle (AUV), and also courier nodes (CNs), to minimize the energy consumption of nodes. MS and CNs stop at specific stops for data gathering; later on, CNs forward the received data to the MS for further transmission. By the mobility of CNs and MS, the overall energy consumption of nodes is minimized. We perform simulations to investigate the performance of the proposed scheme and compare it to preexisting techniques. Simulation results are compared in terms of network lifetime, throughput, path loss, transmission loss and packet drop ratio. The results show that the proposed technique performs better in terms of network lifetime, throughput, path loss and scalability.

SEDG: Scalable and Efficient Data Gathering Routing Protocol for Underwater WSNs

Abstract In recent years, the use of Autonomous Underwater Vehicle (AUV) along a constrained path can improve the data delivery ratio and maximize the energy efficiency in Underwater Wireless Sensor Networks (UWSNs). However, constant speed of AUV leads to limited communication to collect data packet from nodes deployed randomly in large scalable network. Moreover, the excessive number of associated nodes with Gateway Node (GN) causes to quick depletion of its energy, thus lead to hot spot problem. This poses prominent challenges in jointly improving the throughput with minimum energy consumption. To address these issues, we presented a novel scalable data gathering scheme called Scalable and Efficient Data Gathering SEDG routing protocol, that increases the packet delivery ratio as well as conserves limited energy by optimal assignment of member nodes with GN. Moreover, the variable sojourn interval of AUV decreases the packet drop ratio and hence, maximize the throughput of network.

On modeling geometric joint sink mobility with delay-tolerant cluster-less Wireless Sensor Networks

In recent study Moving Sink (MS) in Wireless Sensor Networks (WSNs) appears as a blessing. Because it collects data directly from the nodes and the concept of relay nodes is obsolete in this scheme. There are few challenges to be taken care of, like data delay tolerance and trajectory of MS which is NP-hard. In our proposed scheme, we divide the square field in small squares. Middle point of the partitioned area is the sojourn location of the sink, and nodes around MS are in it transmission range, they send directly the sensed data in a delay-tolerant fashion. Simultaneously two sinks are moving one is inside and having four sojourn locations and other is outer trajectory and have twelve sojourn locations. Introducing joint mobility is enhancing the network life and ultimately throughput. As the MS comes under the NP-hard problem here we convert it into a geometric problem and define it as, Geometric Sink Movement (GSM). Also there is set of linear programming equations supporting the model, and prolonging network life time.

An Intelligent Load Management System With Renewable Energy Integration for Smart Homes

Demand side management (DSM) will play a significant role in the future smart grid by managing loads in a smart way. DSM programs, realized via home energy management systems for smart cities, provide many benefits; consumers enjoy electricity price savings and utility operates at reduced peak demand. In this paper, evolutionary algorithms-based (binary particle swarm optimization, genetic algorithm, and cuckoo search) DSM model for scheduling the appliances of residential users is presented. The model is simulated in time of use pricing environment for three cases: 1) traditional homes; 2) smart homes; and 3) smart homes with renewable energy sources. Simulation results show that the proposed model optimally schedules the appliances resulting in electricity bill and peaks reductions.

Cooperative partner nodes selection criteria for cooperative routing in underwater WSNs

Underwater environment suffers from a number of impairments which effect reliability and integrity of data being transmitted. Cooperative transmission is well known for reliable data transfer. Hence, cooperative routing can be implemented in Underwater Wireless Sensor Networks (UWSNs) in order to reduce the impact of existing link impairments on transmitted data. Cooperative routing involves data transmission via partner node (relay/destination node) towards sink. Selection of partner node for cooperative routing is to be performed on basis of a certain criterion so that effective results can be achieved. In this paper, two different partner node selection criteria are implemented and compared. We consider source nodes depth threshold (dth), potential relay/destination nodess depth, residual energy and Signal to Noise Ratio (SNR) of the link connecting source node with potential relay/destination node as selection parameters. One criterion considers depth and residual energy while the other also takes links SNR into account along with depth and residual energy. SNR based criterion is proved to outperform the one involving only depth and residual energy information. Simulation results show that the SNR based criterion achieves better results with respect to stability period and Packet Acceptance Ratio (PAR) along with reduced delay and packet drop.

LAEEBA: Link Aware and Energy Efficient Scheme for Body Area Networks

Wireless sensor networks and, particularly wireless body area networks (WBANs) are the key building blocks of upcoming generation networks. Modern health care system is one of the most popular WBAN application and a hot area of research in subject to present work. In recent years, research has focused on channel modeling, energy conservation and design of efficient medium access control (MAC) schemes. Less attention has been paid to the path-loss performance analysis. In this work, we propose LAEEBA (Link-aware and Energy Efficient scheme for Body Area Networks) which is a reliable, path loss efficient and high throughput routing protocol for WBANs. The characteristics of single-hop and multi-hop communication schemes have been utilized to reduce path-loss effects and increase network lifetime. A cost function is proposed to select the forwarder node on the basis of has high residual energy and minimum distance to sink. Residual energy parameter balances the energy consumption among the sensor nodes while distance parameter ensures successful packet delivery to sink. Simulation results show that LAEEBA protocol maximizes the network stability period and nodes stay alive for longer time, which contributes to sufficient decrease in the path-losses occurring in the links connecting sensors on a human body and hence transferring of data with much less losses. Results show better performance of our proposed protocol as compared to its given variants.

SRP-MS: A new routing protocol for delay tolerant Wireless Sensor Networks

Sink Mobility is becoming popular due to excellent load balancing between nodes and ultimately resulting in prolonged network lifetime and throughput. A major challenge is to provide reliable and energy-efficient operations are to be taken into consideration for different mobility patterns of sink. Aim of this paper is lifetime maximization of Delay Tolerant Wireless Sensor Networks (WSNs) through the manipulation of Mobile Sink (MS) on different trajectories. We propose Square Routing Protocol with MS (SRP-MS) based on existing SEP (Stable Election Protocol) by making it Cluster Less (CL) and introducing sink mobility.

Underwater Wireless Sensor Network's Performance Enhancement with Cooperative Routing and Sink Mobility

Network efficiency and reliability in terms of high throughput, energy conservation, low bit error rate (BER) and reduced delay are pre-requisites for many applications in Underwater Wireless Sensor Networks (UWSNs). However, distinctive features of UWSNs like low available bandwidth, large propagation delay, highly dynamic network topology, and high error probability pose many challenges for devising efficient and reliable communication protocols. In this paper, we therefore propose a protocol that focuses on enhancing network reliability and efficiency using cooperative routing and sink mobility. Many cooperative communication protocols have been developed which investigate the physical and MAC layer aspects to improve link efficiency in harsh underwater environment, however, at network layer, it is still unexplored. Similarly, cooperative routing is not yet collaborated with sink mobility. In this paper, Cooperative routing is implemented at network layer along with sink mobility. Potential relay and destination nodes for cooperative routing are selected on the basis of their depth as well as residual energy information. Data from source node is forwarded towards the destination node via relay nodes in a cooperative manner. Sink mobility further improves the results by directly gathering data from nodes. Based on the comprehensive simulations implemented in MATLAB, we observe that our scheme improves the performance in terms of network lifetime, energy efficiency and throughput along with reducing delay and BER.

Optimal Number of Cluster Head Selection for Efficient Distribution of Sources in WSNs

In this paper, we compare problems of cluster formation and cluster-head selection between different protocols for data aggregation and transmission. We focus on two aspects of the problem: (i) how to guess number of clusters required to proficiently consume available sources for a sensor network, and (ii) how to select number of cluster-heads to cover up sensor networks more proficiently. A sensor in Wireless Sensor Networks (WSNs) can communicate directly only with other sensors that are within a radio range in a cluster. However, in order to enable communication between sensors not within communication range, they must form new clusters in distributed sensors. Several clustering algorithms such as LEACH, DEEC, and SEP have been proposed with the objectives of energy minimization, route-path selection, increased connectivity and network longevity. LEACH protocol and the similar ones assume an energy homogeneous system where a node is not likely to fail due to failure in connectivity and packet dropping. More recent protocols like SEP and TEEN considered the reverse that is energy heterogeneity which is more applicable to case of WSNs. We developed a bi-dimensional chain model to select average number of for DEEC. Simulation results are used to compare performance of different protocols to found optimal solutions of above mentioned problems.