arXiv subjects

N. Javaid

Publications and source records attributed to N. Javaid.

At least 37 records · Page 2Linked to original sources

arXiv2013

REECH-ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol for WSNs

In this paper, we propose Regional Energy Efficient Cluster Heads based on Maximum Energy (REECH-ME) Routing Protocol for Wireless Sensor Networks (WSNs) . The main purpose of this protocol is to improve the network lifetime and particularly the stability period of the network. In REECH-ME, the node with the maximum energy in a region becomes Cluster Head (CH) of that region for that particular round and the number of the cluster heads in each round remains the same. Our technique outperforms LEACH which uses probabilistic approach for the selection of CHs. We also implement the Uniform Random Distribution Model to find the packet drop to make this protocol more practical. We also calculate the confidence interval of all our results which helps us to visualize the possible deviation of our graphs from the mean value.

cs.NI↗

arXiv2013

LPCH and UDLPCH: Location-aware Routing Techniques in WSNs

Wireless sensor nodes along with Base Station (BS) constitute a Wireless Sensor Network (WSN). Nodes comprise of tiny power battery. Nodes sense the data and send it to BS. WSNs need protocol for efficient energy consumption of the network. In direct transmission and minimum transmission energy routing protocols, energy consumption is not well distributed. However, LEACH (Low-Energy Adaptive Clustering Hierarchy) is a clustering protocol; randomly selects the Cluster Heads (CHs) in each round. However, random selection of CHs does not guarantee efficient energy consumption of the network. Therefore, we proposed new clustering techniques in routing protocols, Location-aware Permanent CH (LPCH) and User Defined Location-aware Permanent CH (UDLPCH). In both protocols, network field is physically divided in to two regions, equal number of nodes are randomly deployed in each region. In LPCH, number of CHs are selected by LEACH algorithm in first round. However in UDLPCH, equal and optimum number of CHs are selected in each region, throughout the network life time number of CHs are remain same. Simulation results show that stability period and throughput of LPCH is greater than LEACH, stability period and throughput of UDLPCH is greater than LPCH.

cs.NI↗

arXiv2013

MODLEACH: A Variant of LEACH for WSNs

Wireless sensor networks are appearing as an emerging need for mankind. Though, Such networks are still in research phase however, they have high potential to be applied in almost every field of life. Lots of research is done and a lot more is awaiting to be standardized. In this work, cluster based routing in wireless sensor networks is studied precisely. Further, we modify one of the most prominent wireless sensor network's routing protocol "LEACH" as modified LEACH (MODLEACH) by introducing \emph{efficient cluster head replacement scheme} and \emph{dual transmitting power levels}. Our modified LEACH, in comparison with LEACH out performs it using metrics of cluster head formation, through put and network life. Afterwards, hard and soft thresholds are implemented on modified LEACH (MODLEACH) that boast the performance even more. Finally a brief performance analysis of LEACH, Modified LEACH (MODLEACH), MODLEACH with hard threshold (MODLEACHHT) and MODLEACH with soft threshold (MODLEACHST) is undertaken considering metrics of throughput, network life and cluster head replacements.

cs.NI↗

arXiv2013

M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol for WSNs

In this research work, we advise gateway based energy-efficient routing protocol (M-GEAR) for Wireless Sensor Networks (WSNs). We divide the sensor nodes into four logical regions on the basis of their location in the sensing field. We install Base Station (BS) out of the sensing area and a gateway node at the centre of the sensing area. If the distance of a sensor node from BS or gateway is less than predefined distance threshold, the node uses direct communication. We divide the rest of nodes into two equal regions whose distance is beyond the threshold distance. We select cluster heads (CHs)in each region which are independent of the other region. These CHs are selected on the basis of a probability. We compare performance of our protocol with LEACH (Low Energy Adaptive Clustering Hierarchy). Performance analysis and compared statistic results show that our proposed protocol perform well in terms of energy consumption and network lifetime.

cs.NI↗

arXiv2013

Distance Aware Relaying Energy-efficient: DARE to Monitor Patients in Multi-hop Body Area Sensor Networks

In recent years, interests in the applications of Wireless Body Area Sensor Network (WBASN) is noticeably developed. WBASN is playing a significant role to get the real time and precise data with reduced level of energy consumption. It comprises of tiny, lightweight and energy restricted sensors, placed in/on the human body, to monitor any ambiguity in body organs and measure various biomedical parameters. In this study, a protocol named Distance Aware Relaying Energy-efficient (DARE) to monitor patients in multi-hop Body Area Sensor Networks (BASNs) is proposed. The protocol operates by investigating the ward of a hospital comprising of eight patients, under different topologies by positioning the sink at different locations or making it static or mobile. Seven sensors are attached to each patient, measuring different parameters of Electrocardiogram (ECG), pulse rate, heart rate, temperature level, glucose level, toxins level and motion. To reduce the energy consumption, these sensors communicate with the sink via an on-body relay, affixed on the chest of each patient. The body relay possesses higher energy resources as compared to the body sensors as, they perform aggregation and relaying of data to the sink node. A comparison is also conducted conducted with another protocol of BAN named, Mobility-supporting Adaptive Threshold-based Thermal-aware Energy-efficient Multi-hop ProTocol (M-ATTEMPT). The simulation results show that, the proposed protocol achieves increased network lifetime and efficiently reduces the energy consumption, in relative to M-ATTEMPT protocol.

cs.NI↗

arXiv2013

THE-FAME: THreshold based Energy-efficient FAtigue MEasurment for Wireless Body Area Sensor Networks using Multiple Sinks

Wireless Body Area Sensor Network (WBASN) is a technology employed mainly for patient health monitoring. New research is being done to take the technology to the next level i.e. player's fatigue monitoring in sports. Muscle fatigue is the main cause of player's performance degradation. This type of fatigue can be measured by sensing the accumulation of lactic acid in muscles. Excess of lactic acid makes muscles feel lethargic. Keeping this in mind we propose a protocol \underline{TH}reshold based \underline{E}nergy-efficient \underline{FA}tigue \underline{ME}asurement (THE-FAME) for soccer players using WBASN. In THE-FAME protocol, a composite parameter has been used that consists of a threshold parameter for lactic acid accumulation and a parameter for measuring distance covered by a particular player. When any parameters's value in this composite parameter shows an increase beyond threshold, the players is declared to be in a fatigue state. The size of battery and sensor should be very small for the sake of players' best performance. These sensor nodes, implanted inside player's body, are made energy efficient by using multiple sinks instead of a single sink. Matlab simulation results show the effectiveness of THE-FAME.

cs.NI↗

arXiv2013

SIMPLE: Stable Increased-throughput Multi-hop Protocol for Link Efficiency in Wireless Body Area Networks

In this work, we propose a reliable, power efficient and high throughput routing protocol for Wireless Body Area Networks (WBANs). We use multi-hop topology to achieve minimum energy consumption and longer network lifetime. We propose a cost function to select parent node or forwarder. Proposed cost function selects a parent node which 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 our proposed protocol maximize the network stability period and nodes stay alive for longer period. Longer stability period contributes high packet delivery to sink which is major interest for continuous patient monitoring.

cs.NI↗

arXiv2013

A Survey of Different Residential Energy Consumption Controlling Techniques for Autonomous DSM in Future Smart Grid Communications

In this work, we present a survey of residential load controlling techniques to implement demand side management in future smart grid. Power generation sector facing important challenges both in quality and quantity to meet the increasing requirements of consumers. Energy efficiency, reliability, economics and integration of new energy resources are important issues to enhance the stability of power system infrastructure. Optimal energy consumption scheduling minimizes the energy consumption cost and reduce the peak-to-average ratio (PAR) as well as peak load demand in peak hours. In this work, we discuss different energy consumption scheduling schemes that schedule the household appliances in real-time to achieve minimum energy consumption cost and reduce peak load curve in peak hours to shape the peak load demand.

cs.NI↗

arXiv2013

Home Energy Management Systems in Future Smart Grids

We present a detailed review of various Home Energy Management Schemes (HEM,s). HEM,s will increase savings, reduce peak demand and Pto Average Ratio (PAR). Among various applications of smart grid technologies, home energy management is probably the most important one to be addressed. Various steps have been taken by utilities for efficient energy consumption.New pricing schemes like Time of Use (ToU), Real Time Pricing (RTP), Critical Peak Pricing (CPP), Inclining Block Rates (IBR) etc have been been devised for future smart grids.Home appliances and/or distributed energy resources coordination (Local Generation) along with different pricing schemes leads towards efficient energy consumption. This paper addresses various communication and optimization based residential energy management schemes and different communication and networking technologies involved in these schemes.

cs.NI↗

arXiv2013

Control Strategies for Mobile Robot With Obstacle Avoidance

Obstacle avoidance is an important task in the field of robotics, since the goal of autonomous robot is to reach the destination without collision. Several algorithms have been proposed for obstacle avoidance, having drawbacks and benefits. In this survey paper, we mainly discussed different algorithms for robot navigation with obstacle avoidance. We also compared all provided algorithms and mentioned their characteristics; advantages and disadvantages, so that we can select final efficient algorithm by fusing discussed algorithms. Comparison table is provided for justifying the area of interest

cs.RO↗

arXiv2013

Advanced LEACH: A Static Clustering-based Heteroneous Routing Protocol for WSNs

Wireless Sensors Networks (WSNs) have a big application in heterogeneous networks. In this paper, we propose and evaluate Advanced Low-Energy Adaptive Clustering Hierarchy (Ad-LEACH) which is static clustering based heterogeneous routing protocol. The complete network field is first divided into static clusters and then in each cluster separate Ad-LEACH protocol is applied. Our proposed protocol is inherited from LEACH with a cluster head selection criteria of Distributed Energy-Efficient Clustering (DEEC). This enables Ad-LEACH to cope with the heterogeneous nature of nodes. Due to small static clusters, each node reduces its broadcast message power because it only has to cover a small area. We perform simulations in MATLAB to check the efficiency of Ad-LEACH. The Simulation results show that Ad-LEACH outperforms LEACH and DEEC in energy efficiency as well as throughput.

cs.NI↗

arXiv2013

Comparative Analysis of Routing Protocols for Under Water Wireless Sensor Networks

Underwater Wireless Sensor Networks are significantly different from terrestrial sensor networks due to peculiar characteristics of low bandwidth, high latency, limited energy, node float mobility and high error probability. These features bring many challenges to the network protocol design of UWSNs. Several routing protocols have been developed in recent years for these networks. One of the major difficulties in comparison and validation of the performance of these proposals is the lack of a common standard to model the acoustic propagation in the harsh underwater environment. In this paper we analyze the evolution of certain underwater routing protocols like VBF, DBR, H2-DAB, QELAR etc. in terms of their localization techniques, energy minimization characteristics and holding time calculations. The design of each protocol follows certain goals i.e. reduction of energy consumption, improvement of communication latency, achievement of robustness and scalability etc. This paper examines the main approaches and challenges in the design and implementation of underwater sensor networks. The detailed descriptions of the selected protocols contribute in understanding the direction of the current research on routing layer in UWSN.

cs.NI↗

arXiv2013

Evaluating Wireless Proactive Routing Protocols under Mobility and Scalability Constraints

Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different routing techniques, we select three proactive routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.

cs.NI↗

arXiv2013

Evaluating Wireless Reactive Routing Protocols with Linear Programming Model for Wireless Ad-hoc Networks

In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users with facility of quick communication. In Wireless Multi-hop Networks, routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models to assess and enhance reactive routing protocols. To practically examine constraints of respective Linear Programming models over reactive protocols, we select AODV, DSR and DYMO. It is deduced from analytical simulations of Linear Programming models in MATLAB that quick route repair reduces routing latency and optimizations of retransmission attempts results efficient energy utilization. To provide quick repair, we enhance AODV and DSR. To practically examine the efficiency of enhanced protocols in different scenarios of Wireless Multi-hop Networks, we conduct simulations using NS-2. From simulation results, enhanced DSR and AODV achieve efficient output by optimizing routing latencies and routing load in terms of retransmission attempts.

cs.NI↗

arXiv2013

Modeling and Simulating Network Connectivity in Routing Protocols for MANETs and VANETs

This paper presents a framework for node distribution with respect to density, network connectivity and communication time. Using NS2, we evaluate and compare performance of three routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Fisheye State Routing (FSR) both in MANETs (IEEE 802.11) and VANETs (IEEE 802.11p). We further enhanced these protocols by changing their routing information exchange intervals; MOD AODV, MOD DSR and MOD FSR. A comprehensive simulation work is performed for the comparison of these routing protocols for varying motilities and scalabilities of nodes. As a result, we can say that AODV outperforms DSR and FSR both in MANETs and VANETs.

cs.NI↗

arXiv2013

Evaluating and Comparing Probability of Path Loss in DSDV, OLSR and DYMO at 802.11 and 802.11p

In this paper, we present path loss model for VANETs and simulate three routing protocols; Destination Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR) and Dynamic MANET On-demand (DYMO) to evaluate and compare their performance using NS-2. The main contribution of this work is enhancement of existing techniques to achieve high efficiency of the underlying networks. After extensive simulations in NS-2, we conclude that DSDV best performs with 802.11p while DYMO gives outstanding performance with 802.11.

cs.NI↗

arXiv2013

On Adaptive Energy Efficient Transmission in WSNs

One of the major challenges in design of Wireless Sensor Networks (WSNs) is to reduce energy consumption of sensor nodes to prolong lifetime of finite-capacity batteries. In this paper, we propose Energy-efficient Adaptive Scheme for Transmission (EAST) in WSNs. EAST is an IEEE 802.15.4 standard compliant. In this scheme, open-loop is used for temperature-aware link quality estimation and compensation. Whereas, closed-loop feedback process helps to divide network into three logical regions to minimize overhead of control packets. Threshold on transmitter power loss (RSSIloss) and current number of nodes (nc(t)) in each region help to adapt transmit power level (Plevel) according to link quality changes due to temperature variation. Evaluation of propose scheme is done by considering mobile sensor nodes and reference node both static and mobile. Simulation results show that propose scheme effectively adapts transmission Plevel to changing link quality with less control packets overhead and energy consumption as compared to classical approach with single region in which maximum transmitter Plevel assigned to compensate temperature variation.

cs.NI↗

arXiv2013

On Modeling Geometric Joint Sink Mobility with Delay-Tolerant Cluster-less Wireless Sensor Networks

Moving Sink (MS) in Wireless Sensor Networks (WSNs) has appeared as a blessing because it collects data directly from the nodes where the concept of relay nodes is becomes obsolete. There are, however, a 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 its transmission range, which send directly the sensed data in a delay-tolerant fashion. Two sinks are moving simultaneously; one inside and having four sojourn locations and other in outer trajectory having twelve sojourn locations. Introduction of the joint mobility enhances network life and ultimately throughput. As the MS comes under the NP-hard problem, we convert it into a geometric problem and define it as, Geometric Sink Movement (GSM). A set of linear programming equations has also been given in support of GSM which prolongs network life time.

cs.NI↗