Abid Ali Minhas

Multilayer cluster designing algorithm for lifetime improvement of wireless sensor networks

Cluster-based network is a proven architecture for energy-aware routing, but more attention is required to ameliorate the energy consumption aspect of its cluster designing process. In this research work, we introduce a novel design of clustered network architecture. The proposed design technique is innovative in its idea. The general trend in this scene is either centralized decision at base station for cluster head selection and its members or distributed decision by exchanging information between neighboring nodes until the cluster head and its members are selected. Both the techniques drastically create mess in energy consumption due to too much broadcasting, especially in large networks as well as message exchange until some final decision is made. Our novel layer-based hybrid algorithm for cluster head and cluster member selection comes up to novel communication architecture. Since its substantial constituent is cluster designing, we named it Multilayer Cluster Designing Algorithm (MCDA). The proposed design not only has effect on lessening blind broadcasting, but also on decreasing the message exchange in a passionate way. It also encapsulates the beauty of efficient centralized decision making for cluster designing and energy-aware distributed cluster head selection and cluster member allocation process. Comprehensive experimentations have been performed on the comparative analysis of MCDA with state-of-the-art centralized and distributed cluster designing approaches present in published literature. Calculation of energy consumption in various operational parametric values, number of clusters designed and the number of packets broadcasted during cluster designing are the main performance evaluation parameters. It has been found that MCDA outperforms compared to its three competing algorithms with respect to the aforementioned parameters due to its multilayered synergistic mating approach.

Energy efficient strategy for throughput improvement in wireless sensor networks.

Network lifetime and throughput are one of the prime concerns while designing routing protocols for wireless sensor networks (WSNs). However, most of the existing schemes are either geared towards prolonging network lifetime or improving throughput. This paper presents an energy efficient routing scheme for throughput improvement in WSN. The proposed scheme exploits multilayer cluster design for energy efficient forwarding node selection, cluster heads rotation and both inter- and intra-cluster routing. To improve throughput, we rotate the role of cluster head among various nodes based on two threshold levels which reduces the number of dropped packets. We conducted simulations in the NS2 simulator to validate the performance of the proposed scheme. Simulation results demonstrate the performance efficiency of the proposed scheme in terms of various metrics compared to similar approaches published in the literature.

E-MCDA: extended-multilayer cluster designing algorithm for network lifetime improvement of homogenous wireless sensor networks

The proposed idea in this paper is the constructive ramification of cluster designing mechanism floated in recently published work, multilayer cluster designing algorithm (MCDA) to ameliorate the performance in network lifetime. Novel algorithms for time slot allocation, minimizing the cluster head completion candidates, and cluster member selection∖node affiliation to cluster head play underpinning roles to achieve the target. These incorporations in MCDA result in minimizing transmissions, suppressing unfavorable response of transmissions and near-equal size and equal load clusters. We have done extensive simulations in NS2 and evaluate the performance of E-MCDA in energy consumption at various aspects of energy, packets transmission, number of designed clusters, number of nodes per cluster, and unclustered nodes. It is found that the proposed mechanism optimistically outperforms the competition with MCD and EADUC.

Computational intelligence based optimization in wireless sensor network

There are only two ways to live your life. One is as though nothing is a miracle. The other is as though everything is a miracle and so the technology advancement which proved to be a miracle of the miracles. Wireless Sensor Network (WSN) is one such miracle of the wireless technology which opens up the new dimensions for the researchers to write the technology of the future i.e. ubiquitous computing and intelligence. Nevertheless nature has played its ultimate role as well to give an idea of perfection in optimizing the teething issues in any field and so in WSN. Design and deployment, localization, routing and clustering, QoS management, security etc are few scenarios in WSN. The computational intelligence paradigm (CI) inspired by nature, comprising artificial neural network (ANN), artificial immune system (AIS), evolutionary algorithm (EA), swarm intelligence (SI) and fuzzy logic (FL). These are different flavors for increasing efficiency in terms of memory and computational power which alternatively affects other issues towards perfection i.e. convenience and intelligence. Hybrid and non hybrid algorithms optimizes the issues through CI paradigms, which are presented in this research article relevant to Wireless Sensor Network. Our findings strongly recommend development of hybrid CI based algorithms to address combinatorial optimizing issues in WSN.

REAR: Real-Time Energy Aware Routing for Wireless Adhoc Micro Sensors Network

Putting constraint on temporal domain based system performance, sometimes turns right into wrong, update into outdate, current into past and lawful into illegal. Therefore perfection satisfaction not only at hardware level but also at software level design is indispensable to quench the thirst of such ideal real time communication. From software perspective, in the timeless sensitive communication context, RTOS’s kernel design must be sensitive enough to compensate different delays. Active contribution from each communication layer protocol as well as cross layer protocol makes the overall performance healthier and valiant. This active contribution becomes much important when the resources are in stringent constraint as in Wireless SensorNetwork (WSN). A WSN is a network of energy, memory and processing constraint nodes. In this paper, we have proposed a protocol: REAR, to achieve the real-time routing with energy awareness feature in the ad hoc micro sensors network. It follows the customized proactive routing with in-network processing and localized behavior. Simulation results have intuited that REAR presents a better solution in energy consumption with the effect of improving the network life as well as increasing the performance efficiency in end-to-end delay.

Dependability and reliability analysis of intra cluster routing technique

Wireless sensor networks (WSN) consist of large number of sensor nodes and one or many base stations, to supervise particular physical or environmental conditions (temperature, sound, vibration, pressure, or motion). The nodes in WSN are battery operated in general; therefore, every operation in WSN should be energy aware. Routing in WSN is handled by network layer across the network from source to destination that should perform its task in energy aware fashion. There are different types of routing protocols and cluster routing is one of those. In literature, it has been suggested that hybrid routing is energy aware and load balanced routing technique. In this research work, we have analyzed different intra cluster routing techniques and have proposed the best intra cluster routing technique which is good for load balancing in order to increase the life time of the network. We have analyzed three different types of hybrid intra cluster routing techniques. In order to reach conclusion, we have implemented/ simulated and compared different intra cluster routing techniques proposed in the literature. The recommended algorithm extends the life time of the WSN and distributes the load among the nodes more uniformly.

EEAR: Efficient Energy Aware Routing in wireless sensor networks

The energy efficiency in wireless sensor networks plays a very important role because of the limited power of the battery used within nodes. This paper presents Efficient Energy Aware Routing (EEAR) algorithm for wireless sensor networks, that makes routing decisions on the basis of nodes residual energy. EEAR explores the optimized routing path by implementing a model which is function of the shortest distance and the residual energy of all nodes in a routing path. The proposed model also exploits the neighbors information of each node in the optimized path in order to reduce the probability of packet loss and to increase throughput. Simulation and comparative analysis show that EEAR gives higher packet delivery rate, less energy consumption with the maximum network life time as compared to traditional routing algorithms for wireless sensor networks.

Adaptive intra cluster routing for wireless sensor networks

Scientists have listed down ten emerging technologies that will change the worlds future and Wireless Sensor Network (WSN) is one of them. A lot of work is in progress to make this technology more effective by having research in this field. This network is composed of sensing nodes which are energy limited so energy efficiency is one of the most critical design issues. To have energy efficient network, efficient routing plays very important role. In this paper, Adaptive Intra Cluster routing (AICR) is proposed which is the best solution to the problem offered by traditional routing algorithms. Comparative study of AICR is done with MultiHop Router [1] by simulating. Simulation results have revealed that AICR is 17% more energy efficient and has increased network lifetime up to 12%.

An adaptive and efficient buffer management scheme for resource-constrained delay tolerant networks

Abstract Provisioning buffer management mechanism is especially crucial in resource-constrained delay tolerant networks (DTNs) as maximum data delivery ratio with minimum overhead is expected in highly congested environments. However, most DTN protocols do not consider resource limitations (e.g., buffer, bandwidth) and hence, results in performance degradation. To strangle and mitigate the impact of frequent buffer overflows, this paper presents an adaptive and efficient buffer management scheme called size-aware drop (SAD) that strives to improve buffer utilization and avoid unnecessary message drops. To improve data delivery ratio, SAD exactly determines the requirement based on differential of newly arrived message(s) and available space. To vacate inevitable space from a congested buffer, SAD strives to avoid redundant message drops and deliberate to pick and discard most appropriate message(s) to minimize overhead. The performance of SAD is validated through extensive simulations in realistic environments (i.e., resource-constrained and congested) with different mobility models (i.e., Random Waypoint and disaster). Simulation results demonstrate the performance supremacy of SAD in terms of delivery probability and overhead ratio besides other metrics when compared to contemporary schemes based on Epidemic (DOA and DLA) and PRoPHET (SHLI and MOFO).

A Novel Power Tuning Anchors Localization Algorithm for Mobile Wireless Sensor Nodes

Wireless Sensor Network (WSN) is composed of sensor nodes deployed to achieve some specific task. Localization of individual mobile node is a challenging task in wireless sensor networks. Localization system is not only for location identification but also provides the base for routing, density control, tracking, and a number of other communication network aspects. In real time applications of outdoor or indoor environments, there are significant challenges for node localization in WSN. Keeping in view the fact that many precise and smart solutions have been proposed, an approach for range free localization is Concentric Anchor Beacon (CAB), which comes with the requirement of improvement. In this paper, we have presented a novel solution “Power Tuning Anchors” (PTA) algorithm that outperforms in terms of accuracy. In PTA, mobile node localizes its position on the basis of minimum received power levels transmitted by the neighboring anchors. Localization error, anchor density, radio range and Gitter between two consecutive power levels are the performance metrics used for evaluation of PTA. Initial empirical results have shown better precision and more accuracy in terms of aforementioned performance parameter.