Content uploaded by Nadeem Javaid
Author content
All content in this area was uploaded by Nadeem Javaid on Aug 23, 2017
Content may be subject to copyright.
A preview of the PDF is not available
On Network Lifetime Maximization in Wireless Sensor Networks with Sink Mobility
Abstract and Figures
Wireless Sensor Networks (WSNs) extend human capability to monitor and con- trol the physical world, especially, in catastrophic/emergency situations where hu- man engagement is too dangerous. There is a diverse range of WSN applications in terrestrial, underwater and health care domains. In this regard, the wireless sensors have significantly evolved over the last few decades in terms of circuitry miniaturization. However, small sized wireless sensors face the problem of limited battery/power capacity. Thus, energy efficient strategies are needed to prolong the lifetime of these networks. This dissertation, limited in scope to routing only, aims at energy efficient solutions to prolong the lifetime of terrestrial sensor networks
(i.e., WSNs) and Underwater WSNs (UWSNs).
In WSNs, we identify that uneven cluster size, random number of selected Clus- ter Heads (CHs), communication distance, and number of transmissions/recep- tions are mainly involved in energy consumption which lead to shortened net- work lifetime. As a solution, we present two proactive routing protocols for cir- cular WSNs; Angular Multi-hop Distance based Clustering Network Transmission (AM-DisCNT) and improved AM-DisCNT (iAM-DisCNT). These two protocols are supported by linear programming models for information flow maximization and packet drop minimization. For reactive applications, we present four routing protocols; Hybrid Energy Efficient Reactive (HEER), Multi-hop Hybrid Energy Ef- ficient Reactive (MHEER), HEER with Sink Mobility (HEER-SM) and MHEER with Sink Mobility (MHEER-SM). The multi hop characteristic of the reactive protocols make them scalable. We also exploit node heterogeneity by presenting four routing protocols (i.e., Balanced Energy Efficient Network Integrated Super Heterogeneous (BEENISH), Mobile BEENISH (MBEENISH), improved BEEN- ISH (iBEENISH) and improved Mobile BEENISH (iMBEENISH)) to prolong the network lifetime. Since the problems of delay tolerance and mobile sink trajecto- ries need investigation, this dissertation factors in four propositions that explore defined and random mobile sink trajectories. On the other hand, designing an energy efficient routing protocol for UWSNs demands more accuracy and extra computations due to harsh underwater environment. Subject to nodes’ energy consumption minimization, we present Autonomous Underwater Vehicle (AUV) and Courier Nodes (CNs) based routing protocol for UWSNs. We validate our propositions for both WSNs and UWSNs via simulations. Results show that the proposed protocols where we incorporated sink mobility perform better than the existing ones in terms of selected performance metrics.
Content may be subject to copyright.
ResearchGate has not been able to resolve any citations for this publication.
In order to overcome the energy hole problem in some wireless sensor networks (WSNs), lifetime optimization algorithm with mobile sink nodes for wireless sensor networks (LOA_MSN) is proposed. In LOA_MSN, hybrid positioning algorithm of satellite positioning and RSSI positioning is proposed to save energy. Based on location information, movement path constraints, flow constraint, energy consumption constraint, link transmission constraint, and other constraints are analyzed. Network optimization model is established and decomposed into movement path selection model and lifetime optimization model with known grid movement paths. Finally, the two models are solved by distributed method. Sink nodes gather data of sensor nodes along the calculated paths. Sensor nodes select father nodes and transmit data to corresponding sink node according to local information. Simulation results show that LOA_MSN makes full use of node energy to prolong network lifetime. LOA_MSN with multiple sink nodes also reduces node energy consumption and data gathering latency. Under certain conditions, it outperforms MCP, subgradient algorithm, EASR, and GRAND.
In this paper, we propose a distributed data-gathering scheme using an autonomous underwater vehicle (AUV) working as a mobile sink to gather data from a randomly distributed underwater sensor network where sensor nodes are clustered around several cluster headers. Unlike conventional data-gathering schemes where the AUV visits either every node or every cluster header, the proposed scheme allows the AUV to visit some selected nodes named path-nodes in a way that reduces the overall transmission power of the sensor nodes. Monte Carlo simulations are performed to investigate the performance of the proposed scheme compared with several preexisting techniques employing the AUV in terms of total amount of energy consumption, standard deviation of each node's energy consumption, latency to gather data at a sink, and controlling overhead. Simulation results show that the proposed scheme not only reduces the total energy consumption but also distributes the energy consumption more uniformly over the network, thereby increasing the lifetime of the network.
In this paper a new method to improve performance of cooperative underwater acoustic (UWA) sensor networks will be introduced. The method is based on controlling and optimizing carrier frequencies which are used in data links between network nods. In UWA channels Pathloss and noise power spectrum density (psd) are related to carrier frequency. Therefore, unlike radio communications, in UWA Communications signal to noise ratio (SNR) is related to frequency besides propagation link length. In such channels an optimum frequency in whole frequency band and link lengths cannot be found. In Cooperative transmission, transmitter sends one copy of transmitted data packets to relay node. Then relay depending on cooperation scheme, amplifies or decodes each data packet and retransmit it to destination. Receiver uses and combines both received signals to estimate transmitted data. This paper wants to propose a new method to decrease network power consumptions by controlling and sub-optimizing transmission frequency based on link length. For this purpose, underwater channel parameters is simulated and analyzed in 1km to 10km lengths (midrange channel). Then link lengths sub categorized and in each category, optimum frequency is computed. With these sub optimum frequencies, sensors and base station can adaptively control their carrier frequencies based on link length and decrease network’s power consumptions. Finally Different Cooperative transmission schemes “Decode and Forward (DF)” and “Amplify and Forward (AF)”, are simulated in UWA wireless Sensor network with and without the new method. In receiver maximum ratio combiner (MRC) is used to combining received signals and making data estimations. Simulations show that the new method, called AFC cooperative UWA communication, can improve performance of underwater acoustic wireless sensor networks up to 40.14%.
Localizing machine-type communication (MTC) devices or sensors is becoming important because of the increasing popularity of machine-to-machine (M2M) communication networks for location-based applications. These include such as health monitoring, rescue operations, vehicle tracking, and wildfire monitoring. Moreover, efficient localization approaches for sensor-based MTC devices reduce the localization error and energy consumption of MTC devices. Because sensors are used as an integral part of M2M communication networks and have achieved popularity in underwater applications, research is being conducted on sensor localization in both underwater and terrestrial M2M networks. Major challenges in designing underwater localization techniques are the lack of good radio signal propagation in underwater, sensor mobility management, and ensuring network coverage in 3D underwater M2M networks. Similarly, predicting the mobility pattern of MTC devices, trading-off energy consumption and location accuracy pose great design challenges for terrestrial localization techniques. This article presents a comprehensive survey on the current state-of-the-art research on both terrestrial and underwater localization approaches for sensor-based MTC devices. It also classifies localization approaches based on several factors, identifies their limitations with potential solutions, and compares them. Copyright © 2015 John Wiley & Sons, Ltd.
As for cluster-based wireless sensor networks (WSNs), cluster lifetime is one of the most important subjects in recent researches. Besides reducing the energy consumptions of the clusters, it is necessary to make the clusters achieve equal lifetimes so that the whole network can survive longer. In this paper, we focus on the cluster lifetimes in multi-hop WSNs with cooperative multiinput single-output scheme. With a simplified model of multi-hop WSNs, we change the transmission schemes, the sizes and transmission distances of clusters to investigate their effects on the cluster lifetimes. Furthermore, linear and uniform data aggregations are considered in our model. As a result, we analyze the cluster lifetimes in different situations and discuss the requirements on the sizes and transmission distances of clusters for equal lifetimes.
Improving energy efficiency and prolonging network lifetime is a challenging research issue for wireless sensor networks (WSNs). Nowadays, adding mobility technology into WSNs has drawn increasing attention. In this paper, we combine the uneven clustering algorithm with mobile sink strategy and propose our mobile sink based uneven clustering algorithm. First, we study the uneven clustering algorithm with a fixed sink node located at the center of a rectangle network. We analyze the performance of energy consumption and network lifetime, and compare our algorithm with LEACH. Then we use mobile sink node instead of fixed sink node to collect fused data under similar environment. Simulation results show that mobile sink node can efficiently mitigate hot spots near sink node as sink node moves either randomly or along a predetermined fixed path.
In this paper we consider the problem of uploading data from a network of fixed sensors to a mobile sink, incorporated by an Autonomous Underwater Vehicle (AUV). We approach this problem by presenting U-Fetch, a protocol based on two levels of coordinated access. In U-Fetch, some head nodes retrieve data from their neighbors locally, and send all data to the mobile sink in bunches via a contention-free link, as the sink passes by. We compare this approach against two approaches endorsed by several works in the literature, namely multi-hop routing and polling. U-Fetch represents an intermediate approach between these two schemes, and constitutes a valid tradeoff in the presence of a mobile sink. We first substantiate this claim via some simple Monte-Carlo simulations. Finally, to confirm the validity of our approach, we reproduce the detailed behavior of U-Fetch in the event-driven ns2/NS-MIRACLE simulator endowed with the DESERT Underwater libraries, and present a set of simulation results that compare the performance of U-Fetch against multihop routing and polling.
Due to limited energy, computing ability, and memory of Wireless sensor Networks(WSN), routing issue is one of the key factors for WSN. LEACH is the first clustering routing protocol, which can efficiently reduce the energy consumption and prolong the lifetime of WSN, but it also has some disadvantage. This paper proposed an improvement based LEACH, called LEACH-T. According to different number of clusters, LEACH-T uses variable time slot for different clusters in steady-state phase, and single-hop or multi-hop to transmit data between cluster heads and Base Station. Also it considered residual energy of sensor nodes and the optimal number of clusters during selection of the cluster heads. The simulation results show that LEACH-T has better performance than LEACH for prolonging the lifetime and reducing the energy consumption.
The location-based routing protocol has proven to be scalable and efficient in large wireless sensor networks with mobile sinks. A great challenge in location-based routing protocols is the design of scalable distributed location service that tracks the current locations of mobile sinks. Although various location services have been proposed in the literature, hierarchical-based location services have the significant advantage of high scalability. However, most of them depend on a global hierarchy of grids. A major disadvantage of this design is that high control overhead occurs when mobile sinks cross the boundaries of the top level grids. In this paper, we introduce Hierarchical Ring Location Service (HRLS) protocol, a practical distributed location service that provides sink location information in a scalable and distributed manner. In contrast to existing hierarchical-based location services, each sink in HRLS constructs its own hierarchy of grid rings distributively. To reduce the communication overhead of location update, sinks utilize the lazy update mechanism with their indirect location. Once a sensor node detects a target, it queries the location of a sink by sending request packets in eight directions. HRLS is evaluated through mathematical analysis and simulations. Compared with a well-known hierarchical-based location service, our results show that HRLS provides a more scalable and efficient distributed location service in scenarios with various network size, sink mobility and increasing number of source nodes.