Heterogeneous wireless sensor network consists of wireless sensor nodes with different abilities, such as different computing power and different initial energy. We present in this paper a new scheme for maximizing heterogeneous WSN lifetime. The proposed scheme employs two types of sensor nodes that are named (consistent with IEEE 802.15.4 standard) Full Function Device (FFD) and Reduced Function Device (RFD). The FFDs are the expensive sensor nodes with high power and computational capabilities compared to the RFDs which are cheap sensors with a limited power supply. The scheme divides the network into smaller sub-networks (regions) that are built from sectors and tracks. The objective of this research is to balance and reduce the communication load on RFDs, reduce the delay, and increase the connectivity and lifetime, by using a limited number of FFDs. We investigate the performance of our scheme via numerical simulation and compare it to other related schemes that are presented for homogeneous WSNs with chain topology, such as Pegasis, Epegasis and Chiron. In addition to extending the lifetime, our scheme also results in reducing the data transmission delay compared to the related schemes. Furthermore, the scheme increases the network security and reduces the RFDs power consumption by preventing the direct communication with the base station (BS). The FFD is the communication bridge between RFDs and BS. The FFD communicate with the BS using the one-hop approach or multi-hop approach through other FFDs.
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. Data aggregation mechanism is one of the possible solutions to prolong the life time of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption, minimizing the dista…
Recently, many researchers have studied efficiently gathering data in wireless sensor networks to minimize the total energy consumption when a fixed number of data are allowed to be aggregated into one packet. However, minimizing the total energy consumption does not imply the network lifetime is maximized. In this paper, we study the problem of scheduling data aggregation trees working for different time periods to maximize the network lifetime when a fixed number of data are allowed to be aggregated into one packet. In addition, we propose a heuristic to balance the lifetime of nodes in data…
Full exploitation of the bandwidth resources of Wireless Networks is challenging because of the sharing of the radio medium among neighboring nodes. Practical algorithms and distributed schemes that tries to optimising the use of the network radio resources. In this technical report we present the proof that maximising the network capacity is is an APX Complete problem (not approximable within 1/(1 - 2^(-k)) - eps for eps > 0).
A wireless sensor network has a wide application domain which is expanding everyday and they have been deployed pertaining to their application area. An application independent approach is yet to come to terms with the ongoing exploitation of the WSNs. In this paper we propose a decentralized lifetime maximizing tree for application independent data aggregation scheme using the clustering for data delivery in WSNs. The proposed tree will minimize the energy consumption which has been a resisting factor in the smooth working of WSNs as well as minimize the distance between the communicating nod…
In this paper a packet level simulator is used to explore the performance of the proposed DLMT and CLMT algorithms under various traffic conditions. Performance of the proposed algorithms is compared with already existing E-Span tree structure. These proposed algorithms tend to extend the node lifetime in order to increase the amount of information gathered by the tree root. Decentralized lifetime maximizing tree (DLMT) features in nodes with higher energy to be chosen as data aggregating parents while Centralized Lifetime Maximizing Tree (CLMT) features with the identification of the bottlene…
To enable data aggregation among the event sources in wireless sensor networks and to reduce the communication cost there is a need to establish a coveraged tree structure inside any given event region to allow data reports to be aggregated at a single processing point prior to transmission to the network. In this paper we propose a novel technique to create one such tree which maximizes the lifetime of the event sources while they are constantly transmitting for data aggregation. We use the term Centralized Lifetime Maximizing Tree (CLMT) to denote this tree. CLMT features with identification…
Battery is a major hardware component of wireless sensor networks. Most of them have no power supply and are generally deployed for a long time. Researches have been done on battery physical model and their adaptation for sensors. We present an implementation on a real sensor operating system and how architectural constraints have been assumed. Experiments have been made in order to test the impact of some parameter, as the application throughput, on the battery lifetime.
Devices can now be powered wirelessly by Access Points (APs). However, an AP cannot transmit frequently to charge devices as it may starve other nearby APs operating on the same channel. Consequently, there is a need to schedule the transmissions of APs to ensure their data queues remain short whilst charging energy-harvesting devices. We present a finite-horizon Markov Decision Process (MDP) to capture the queue states at APs and also channel conditions to nodes. We then use the MDP to investigate the following transmission policies: max weight, max queue, best channel state and random. Our r…
Clustering in wireless sensor networks (WSNs) is an important technique to ease topology management and routing. Clustering provides an effective method for prolonging lifetime of a WSN. This paper proposes energy efficient multi-level clustering schemes for wireless sensor networks. Wireless sensor nodes are extremely energy constrained with a limited transmission range. Due to large area of deployment, the network needs to have a multi-level clustering protocol that will enable far-off nodes to communicate with the base station. Simulation is used to analyze the proposed protocols and compar…
Wireless sensor networks have significant potential to increase our ability to view and control the physical environment, but the issue of power consumption in these networks has become an important parameter in their reliability and since in many applications of networks. Wireless sensor needs to guarantee end-to-end quality parameters, support for quality of service in these networks is of utmost importance. In wireless sensor networks, one of the most important issues is the lifetime of each network, which is directly related to the energy consumption of the network sensors. Increasing netw…
Considering a wireless sensor network whose nodes are distributed randomly over a given area, a probability model for the network lifetime is provided. Using this model and assuming that packet generation follows a Poisson distribution, an analytical expression for the complementary cumulative density function (ccdf) of the lifetime is obtained. Using this ccdf, one can accurately find the probability that the network achieves a given lifetime. It is also shown that when the number of sensors, $N$, is large, with an error exponentially decaying with $N$, one can predict whether or not a certai…
In this paper we present a model for the lifetime of wireless sensor networks. The model takes into consideration several parameters such as the total number of sensors, network size, percentage of sink nodes, location of sensors, the mobility of sensors, and power consumption. A definition of the life time of the network based on three different criteria is introduced; percentage of available power to total power, percentage of alive sensors to total sensors, and percentage of alive sink sensors to total sink sensors. A Matlab based simulator is developed for the introduced model. A number of…
In this paper, we propose the mobility of a sink in improved energy efficient PEGASIS-based protocol (IEEPB) to advance the network lifetime of Wireless Sensor Networks (WSNs). The multi-head chain, multi-chain concept and the sink mobility affects largely in enhancing the network lifetime of wireless sensors. Thus, we recommend Mobile sink improved energy-efficient PEGASIS-based routing protocol (MIEEPB); a multi-chain model having a sink mobility, to achieve proficient energy utilization of wireless sensors. As the motorized movement of mobile sink is steered by petrol or current, there is a…
The transmission rate, delivery reliability and network lifetime are three fundamental but conflicting design objectives in energy-constrained wireless sensor networks. In this paper, we address the optimal rate-reliability-lifetime tradeoff with link capacity constraint, reliability constraint and energy constraint. By introducing the weight parameters, we combine the objectives at rate, reliability, and lifetime into a single objective to characterize the tradeoff among them. However, the optimization formulation of the rate-reliability-reliability tradeoff is neither separable nor convex. T…
In this paper we present a new model for the lifetime of wireless sensor networks used for sea water communications. The new model for power communications takes into consideration parameters such as power consumption for the active mode, power consumption for the sleep mode, power consumption for the transient mode, transmission period, transient mode duration, sleep mode duration, and active mode duration. The power communications model is incorporated in the life time model of wireless sensor networks. The life time model takes into consideration several parameters such as the total number …
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 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 O…
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering Network environment, it is divided into two virtual layers (using distan…
Due to the limited energy of sensor nodes in wireless sensor networks, extending the networks lifetime is a major challenge that can be formulated as an optimization problem. In this paper, we propose a distributed iterative algorithm based on Alternating Direction Method of Multipliers (ADMM) with the aim of maximizing sensor network lifetime. The features of this algorithm are use of local information, low overhead of message passing, low computational complexity, fast convergence, and consequently reduced energy consumption. In this study, we present the convergence results and the number o…
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's neighbours while providing the worst-case latency guarantee for data collection, and a distributed algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the longest path and the shortest path of each sensor node to the base station differ by at most k. By adding sibling edges to a SPD, our distributed algorithm allows critical nodes to have m…
In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take on different roles for different applications. Moreover, we address network reconfiguration as a means to increase the network lifetime, in keeping with the current trend towards software defined networks and network function virtualization. To test our optimization formulations…
Wireless sensor networks have attracted much attention because of many applications in the fields of industry, military, medicine, agriculture, and education. In addition, the vast majority of researches has been done to expand its applications and improve its efficiency. However, there are still many challenges for increasing the efficiency in different parts of this network. One of the most important parts is to improve the network lifetime in the wireless sensor network. Since the sensor nodes are generally powered by batteries, the most important issue to consider in these types of network…
We investigate the problem of network utility maximization in multiple gateways wireless mesh networks by considering Signal to Interference plus Noise Ratio (SINR) as the interference model. The aim is a cross layer design that considers joint rate control, traffic splitting, routing, scheduling, link rate allocation and power control to formulate the network utility maximization problem. As this problem is computationally complex, we propose the Joint dynamic Gateway selection, link Rate allocation and Power control (JGRP) algorithm based on the differential backlog as a sub-optimal solution…
The number of smart devices wear and carry by users is growing rapidly which is driven by innovative new smart wearables and interesting service o erings. This has led to applications that utilize multiple devices around the body to provide immersive environments such as mixed reality. These applications rely on a number of di erent types of functions such as sensing, communication and various types of processing, that require considerable resources. Thus one of the major challenges in supporting of these applications is dependent on the battery lifetime of the devices that provide the necessa…
The issue of optimizing the limited and often non-renewable energy of sensor nodes due to its direct impact on network lifetime dominates every aspect of wireless sensor networks. Existing techniques for optimizing energy consumption are based on exploiting node redundancy, adaptive radio transmission power and topology control. Topology control protocols have a significant impact on network lifetime, available energy and connectivity. In this paper we classify sensor nodes as strong and weak nodes based on their residual energy as well as operational lifetime and propose a Clustering based to…
In this paper we estimate lifetime bounds of a network of motes which communicate with each other using IEEE 802.15.4 standard. Different frame structures of IEEE 802.15.4 along with CSMA/CA medium access mechanism are investigated to discover the overhead of channel acquisition, header and footer of data frame, and transfer reliability during packet transmission. This overhead makes the fixed component, and the data payload makes the incremental component of a linear equation to estimate the power consumed during every packet transmission. Finally we input this per-packet power consumption in…
Unpredictable nature of fading channels and difficulty in tracking channel state information pose major challenge in wireless energy harvesting communication system design. In this work, we address relay selection problem for wireless powered communication networks, where the relays harvest energy from the source radio frequency signals. A single source-destination pair is considered without a direct link. The connecting relay nodes are equipped with storage batteries of infinite size. We assume that the channel state information (CSI) on the source-relay link is available at the relay nodes. …
To meet the demands of wireless sensor networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside any given event region. In this paper, we propose a novel technique to create one such tree, which preserves the energy and minimizes the lifetime of event sources while they are constantly transmitting for data aggregation in future WSNs. We use the term Decentralized Lifetime-Minimizing Tree (DLMT) to denote this tree. DLMT features in nodes with higher energy tend to be chosen as data aggre…
We consider multi-hop wireless networks serving multiple flows in which only packets that meet hard end-to-end deadline constraints are useful, i.e., if a packet is not delivered to its destination node by its deadline, it is dropped from the network. We design decentralized scheduling policies for such multi-hop networks that attain the maximum throughput of useful packets. The resulting policy is decentralized in the sense that in order to make a transmission decision, a node only needs to know the "time-till-deadline" of the packets that are currently present at that node, and not the state…
Wireless sensor networks (WSNs) suffers from the hot spot problem where the sensor nodes closest to the base station are need to relay more packet than the nodes farther away from the base station. Thus, lifetime of sensory network depends on these closest nodes. Clustering methods are used to extend the lifetime of a wireless sensor network. However, current clustering algorithms usually utilize two techniques; selecting cluster heads with more residual energy, and rotating cluster heads periodically to distribute the energy consumption among nodes in each cluster and lengthen the network lif…
Our contribution in this paper is e3D, a diffusion based routing protocol that prolongs the system lifetime, evenly distributes the power dissipation throughout the network, and incurs minimal overhead for synchronizing communication. We compare e3D with other algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm.
Topology control algorithms allow each node in a wireless multi-hop network to adjust the power at which it makes its transmissions and choose the set of neighbors with which it communicates directly, while preserving global goals such as connectivity or coverage. This allows each node to conserve energy and contribute to increasing the lifetime of the network. In this paper, in contrast to most previous work, we consider (i) both the energy costs of communication as well as the amount of available energy at each node, (ii) the realistic situation of varying rates of energy consumption at diff…
Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to the variability of network changes makes them difficult to use. Moreover, conserving energy is a critical concern in the design of routing protocols for ad hoc networks, because most mobile nodes operate with limited battery capacity, and the energy depletion of a node affects not only the node itself but also the overall network lifetime. In all proposed single-p…
We solve the maximum lifetime problem for a one-dimensional, regular ad-hoc wireless network with one data collector $L_N$ for any data transmission cost energy matrix which elements $E_{i,j}$ are superadditive functions, i.e., satisfy the inequality $\forall_{i\leq j\leq k}\;E_{i,j}+E_{j,k}\leq E_{i,k}$. We analyze stability of the solution under modification of two sets of parameters, the amount of data $Q_i$, $i\in [1,N]$ generated by each node and location of the nodes $x_i$ in the network. We assume, that the data transmission cost energy matrix $E_{i,j}$ is a function of a distance betwe…
Wireless power transfer (WPT) technology provides a cost-effective solution to achieve sustainable energy supply in wireless networks, where WPT-enabled energy nodes (ENs) can charge wireless devices (WDs) remotely without interruption to the use. However, in a heterogeneous WPT network with distributed ENs and WDs, some WDs may quickly deplete their batteries due to the lack of timely wireless power supply by the ENs, thus resulting in short network operating lifetime. In this paper, we exploit frequency diversity in a broadband WPT network and study the distributed charging control by ENs to…
Wireless Mesh network (WMN) is dynamically self-organizing and self-configured, with the nodes in the network automatically establishing an ad-hoc network and maintaining the mesh connectivity. The ability to use multiple-radios and multiple channels can be cashed to increase aggregate throughput of wireless mesh network. Thus the efficient use of available interfaces and channels without interference becomes the key factor. In this paper we propose, interference aware clustered based channel assignment schemes which minimizes the interference and increases throughput. In our proposed scheme w…
Wireless sensor networks are composed of low cost and extremely power constrained sensor nodes which are scattered over a region forming self organized networks, making energy consumption a crucial design issue. Thus, finite network lifetime is widely regarded as a fundamental performance bottleneck. These networks are used for various applications such as field monitoring, home automation, medical data collection or surveillance. Research has shown that clustering sensor nodes is an efficient method to manage energy consumption for prolonging the network lifetime. Presence of heterogeneity en…
In designing wireless sensor networks, it is important to reduce energy dissipation and prolong network lifetime. In this paper, a new model with energy and monitored objects heterogeneity is proposed for heterogeneous wireless sensor networks. We put forward an energy-efficient prediction clustering algorithm, which is adaptive to the heterogeneous model. This algorithm enables the nodes to select the cluster head according to factors such as energy and communication cost, thus the nodes with higher residual energy have higher probability to become a cluster head than those with lower residua…
We study the problem of routing in sensor networks where the goal is to maximize the network's lifetime. Previous work has considered this problem for fixed-topology networks. Here, we add mobility to the source node, which requires a new definition of the network lifetime. In particular, we redefine lifetime to be the time until the source node depletes its energy. When the mobile node's trajectory is unknown in advance, we formulate three versions of an optimal control problem aiming at this lifetime maximization. We show that in all cases, the solution can be reduced to a sequence of Non- L…
Adapting applications' data rates in multi-hop wireless ad-hoc networks is inherently challenging. Packet collision, channel contention, and queue buildup contribute to packet loss but are difficult to manage in conventional TCP/IP architecture. This work explores a data-centric approach based on Name Data Networking (NDN) architecture, which is considered more suitable for wireless ad-hoc networks. We show that the default NDN transport offers better performance in linear topologies but struggles in more extensive networks due to high collision and contention caused by excessive Interests fro…
Ameliorating the lifetime in heterogeneous wireless sensor network is an important task because the sensor nodes are limited in the resource energy. The best way to improve a WSN lifetime is the clustering based algorithms in which each cluster is managed by a leader called Cluster Head. Each other node must communicate with this CH to send the data sensing. The nearest base station nodes must also send their data to their leaders, this causes a loss of energy. In this paper, we propose a new approach to ameliorate a threshold distributed energy efficient clustering protocol for heterogeneous …
We study the problem of building a maximum lifetime data collection tree for periodic convergecast applications in wireless sensor networks. We experimentally observe that if two nodes transmit same number of data packets, the amount of energy consumption of the nodes is approximately the same even if the payload lengths of the transmitted packets are different. This is because the major energy consumption during a packet transmission arises from radio start-up and medium access control overhead. Our formulated lifetime maximization problem captures the energy expenditure due to message transm…
Energy management is one of the critical parameters in Wireless Sensor Networks. In this paper we attempt for a solution to balance the energy usage for maximizing the network lifetime, increase the packet delivery ratio and throughput. Our proposed algorithm is based on Energy Density of the clusters in Wireless Sensor Networks. The cluster head is selected using two step method and on-demand routing approach to calculate the balanced energy shortest path from source to sink. This unique approach maintains the balanced energy utilization among all nodes by selecting the different cluster head…
Wireless Sensor Networks are basically used for gathering information needed by smart environments but they are particularly useful in unattended situations where terrain, climate and other environmental constraints may hinder in the deployment of wired/conventional networks. Unlike traditional networks, these sensor networks do not have a continuous power supply at their disposal. Rather the individual sensors are battery operated and the lifetime of the individual sensors and thus the overall network depend heavily on duty cycle of these sensors. Analysis on WSNs shows that communication mod…
Recent advances in micro-sensor and communication technology have enabled the emergence of a new technology, Wireless Sensor Networks (WSN). WSN have emerging recently as a key solution to monitor remote or hostile environments and concern a wide range of applications. These networks are faced with many challenges such as energy efficiency usage, topology maintenance, network lifetime maximization, etc. Experience shows that sensing and communications tasks consume energy, therefore judicious power management can effectively extend network lifetime. Moreover, the low cost of sensor devices wil…
Wireless Sensor networks are dense networks of small, low-cost sensors, which collect and disseminate environmental data and thus facilitate monitoring and controlling of physical environment from remote locations with better accuracy. The major challenge is to achieve energy efficiency during the communication among the nodes. This paper aims at proposing a solution to schedule the node's activities to reduce the energy consumption. We propose the construction of a decentralized lifetime maximizing tree within clusters. We aim at minimizing the distance of transmission with minimization of en…
Wireless sensor network (WSN) consists of a group of dedicated sensors nodes which are distributed over a certain area for observing and recording the physical conditions (like temperature, sound, pressure) of the environment and organizing the collected data at a central location. These Sensor nodes are powered by a battery, so energy conservation becomes an important aspect in WSN. The Paper proposes a way of combining traditional LEACH (Low Energy Adaptive Clustering Hierarchy) with Mobile Sink and Rendezvous Nodes (RN Nodes) along with some changes in terms of cluster head selection proces…
Wireless sensor networks are composed of distributed sensors that can be used for signal detection or classification. The likelihood functions of the hypotheses are often not known in advance, and decision rules have to be learned via supervised learning. A specific such algorithm is Fisher discriminant analysis (FDA), the classification accuracy of which has been previously studied in the context of wireless sensor networks. Previous work, however, does not take into account the communication protocol or battery lifetime of the sensor networks; in this paper we extend the existing studies by …
It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are fundamentally different and cannot be derived from unicast case. Therefore, broadcast protocols must be adapted in order to still be efficient under realistic assumptions. In this paper, we study the well-known multipoint relay protocol (MPR). In the latter, each node has to cho…
Unmanned aerial vehicles (UAVs) are expected to play an important role in next generation cellular networks, acting as flying infrastructure which can serve ground users when regular infrastructure is overloaded or unavailable. As these devices are expected to operate wirelessly they will rely on an internal battery for their power supply, which will limit the amount of time they can operate over an area of interest before having to recharge. In this article, we outline three battery charging options that may be considered by a network operator and use simulations to demonstrate the performanc…
In WSN (Wireless Sensor Network) every sensor node sensed the data and transmit it to the CH (Cluster head) or BS (Base Station). Sensors are randomly deployed in unreachable areas, where battery replacement or battery charge is not possible. For this reason, Energy conservation is the important design goal while developing a routing and distributed protocol to increase the lifetime of WSN. In this paper, an enhanced energy efficient distributed protocol for heterogeneous WSN have been reported. EMEEDP is proposed for heterogeneous WSN to increase the lifetime of the network. An efficient algo…
Wireless sensor network (WSN) is a collection of nodes which can communicate with each other without any prior infrastructure along with the ability to collect data autonomously and effectively after being deployed in an ad-hoc fashion to monitor a given area. One major problem encountered in data gathering wireless systems is to obtain an optimal balance among the number of nodes deployed, energy efficiency and lifetime as energy of nodes cannot be replenished. In this paper we propose first a scheme to estimate the number of nodes to be deployed in a WSN for a predetermined lifetime so that …
A Wireless Sensor Network (WSN) is a collection of tiny nodes that have low energy levels and have become an essential component of the modern communication infrastructure and very important in industry and academia. Energy is crucial in WSN, and thus the design of WSN in the research community is based on energy efficiency, and node energy consumption is a great challenge to enhance WSN's lifetime. It may be costly or even impossible to charge or replace consumed batteries because of the difficult environment. Many energy efficiency methods are introduced in this article to decrease energy co…
A Wireless Sensor Network(WSN) can be described as a collection of untethered sensor nodes. An important application of WSNs is in the field of real-time communication. Real-time communication is a critical service which requires a qualitative routing protocol for energy-efficient network communication. The judicious use of energy of the network nodes is essential and important for sustainability and longevity of a WSN. This paper proposes an algorithm namely Priority-Energy Based Data Forwarding Algorithm(PEDF) which empowers the node to choose the most suitable packet forwarding path, based …
Energy-efficient communication is an important issue in wireless sensor networks (WSNs) consisting of large number of energy-constrained sensor nodes. Indeed, sensor nodes have different energy budgets assigned to data transmission at individual nodes. Therefore, without energy-aware transmission schemes, energy can deplete from sensor nodes with smaller energy budget faster than from the rest of the sensor nodes in WSNs. This reduces the coverage area as well as the lifetime of WSNs. Collaborative beamforming (CB) has been proposed originally to achieve directional gain, however, it also inhe…
Wireless Sensor Networks (WSN) have severe energy constraints imposed by limited capacity of the internal battery of sensor nodes. These restrictions stimulate the development of energy-efficient strategies aimed at increasing the period of stability and lifetime of these networks. In this paper, we propose a centralized control to elect more appropriate Cluster Heads, assuming three levels of heterogeneity and multi-hop communication between Cluster Heads. The centralized control uses the k-means algorithm, responsible for the division of clusters and Fuzzy Logic to elect the Cluster Head and…
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficie…
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 differentmobility patterns of sink. Aim of this paper is lifetime maximization of Delay TolerantWireless 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 i…
