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 consumption, improve network performance and increase network lifetime.
The main challenge in wireless sensor network is to improve the fault tolerance of each node and also provide an energy efficient fast data routing service. In this paper we propose an energy efficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant multipath routing scheme for energy efficient wireless sensor network (FTMRS).The FTMRS is based on multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic…
Mobile wireless networks are intrinsically more prone to link congestion and outright failures than wired networks. In this paper, we elaborate the resilient routing reconfiguration method of \cite{WangEtAl} and generalize it to accomodate point-to-multipoint links and wireless networks. By reframing link failures as traffic uncertainties, this technique allows essentially instantaneous rerouting around arbitrary link failures while preventing congestion. We illustrate the technique by identifying a critical bottleneck in a realistic model wireless network.
In our paper we provide mathematical analysis of a probabilistic long-hop routing algorithms which uses as the randomizing factor the estimate of distance of a station from the previous-hop source of the message.
Routing is one of the critical and ongoing challenges in Wireless Sensor Networks. The main challenge has always been to have a routing protocol that reduces the communication overhead, hence saving the energy of the sensors in the network. Hierarchical routing protocols are known to be the most energy-efficient routing protocols for Wireless Sensor Networks. In this paper, a more generalized hierarchical routing protocol is introduced for Wireless Sensor Network, which is based on tree data structures. The clustering in the proposed protocol has the format of a general tree, which is construc…
In this paper, we present analytical study of routing overhead of reactive routing protocols for Wireless Multihop Networks (WMhNs). To accomplish the framework of generalized routing overhead, we choose Ad-Hoc on Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET on Demand (DYMO). Considering basic themes of these protocols, we enhance the generalized network models by adding route monitoring overhead. Later, we take different network parameters and produce framework discussing the impact of variations of these parameters in network and routing performance. In the s…
A fundamental understanding of gain provided by motion prediction in wireless ad hoc routing is currently lacking. This paper examines benefits in routing obtainable via prediction. A theoretical best-case non-predictive routing model is quantified in terms of both message overhead and update time for non-predictive routing. This best- case model of existing routing performance is compared with predictive routing. Several specific instances of predictive improvements in routing are examined. The primary contribution of this paper is quantification of predictive gain for wireless ad hoc routing…
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 pro…
This paper presents mathematical framework and study of proactive routing Protocols. The performance analysis of three major proactive routing protocols: Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR) are under consideration in this work. Taking these routing protocols into account, we enhance existing framework. In the next step we further discuss and produce analytical framework by considering variations in different network and protocol parameters. Finally, experiments are performed regarding above mentioned routing protoco…
In this paper, we propose LMEEC, a cluster-based routing protocol with low energy consumption for wireless sensor networks. Our protocol is based on a strategy which aims to provide a more reasonable exploitation of the selected nodes (cluster-heads) energy. Simulation results show the effectiveness of LMEEC in decreasing the energy consumption, and in prolonging the network lifetime, compared to LEACH.
In wireless sensor networks, an important issue of Geographic Routing is local minimum problem, which is caused by hole that blocks the greedy forwarding process. To avoid the long detour path, recent research focuses on detecting the hole in advance, then the nodes located on the boundary of the hole advertise the hole information to the nodes near the hole.
An energy efficient routing protocol is the major concern in Wireless Sensor Networks (WSNs). In this survey paper, we present energy efficient hierarchical routing protocols, developed from conventional LEACH routing protocol. Main focus of our study is how these extended protocols work in order to increase the life time and how quality routing protocol are improved for WSNs. Furthermore, this paper also highlights some of the issues faced by LEACH and also explains how these issues are tackled by extended versions of LEACH. We compare the features and performance issues of the selected hiera…
The main focus of this article is to achieve prolonged network lifetime with overall energy efficiency in wireless sensor networks through controlled utilization of limited energy. Major percentage of energy in wireless sensor network is consumed during routing from source to destination, retransmission of data on packet loss. For improvement, cross layered algorithm is proposed for routing and retransmission scheme. Simulation and results shows that this approach can save the overall energy consumption
Wireless sensor networks are harshly restricted by storage capacity, energy and computing power. So it is essential to design effective and energy aware protocol in order to enhance the network lifetime. In this paper, a review on routing protocol in WSNs is carried out which are classified as data-centric, hierarchical and location based depending on the network structure. Then some of the multipath routing protocols which are widely used in WSNs to improve network performance are also discussed. Advantages and disadvantages of each routing algorithm are discussed thereafter. Furthermore, thi…
In this paper, we consider the problem of finding the maximum routing throughput between any pair of nodes in an arbitrary multirate wireless mesh network (WMN) using multiple paths. Multipath routing is an efficient technique to maximize routing throughput in WMN, however maximizing multipath routing throughput is a NP-complete problem due to the shared medium for electromagnetic wave transmission in wireless channel, inducing collision-free scheduling as part of the optimization problem. In this work, we first provide problem formulation that incorporates collision-free schedule, and then ba…
In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). The questions like, how these protocols differ from each other on the basis of implementing different routing strategies, how neighbor estimation errors affect broadcast of route requests, how reduction of broadcast overhead achieves bandwidth, how to cope with the problem of mobility and density, etc, are attempted to respond. In a…
This paper is about the wireless sensor network in environmental monitoring applications. A Wireless Sensor Network consists of many sensor nodes and a base station. The number and type of sensor nodes and the design protocols for any wireless sensor network is application specific. The sensor data in this application may be light intensity, temperature, pressure, humidity and their variations .Clustering and routing are the two areas which are given more attention in this paper.
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless sensor networks is a demanding task. This demand has led to a number of routing protocols which efficiently utilize the limited resources available at the sensor nodes. Most of these protocols are either based on single hop routing or multi hop routing and typically find the minimum energy path without addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data. Response time is very critical in environment monitoring sensor networks where ty…
These Network Coding improves the network operation beyond the traditional routing or store-and-forward, by mixing of data stream within a network. Network coding techniques explicitly minimizes the total no of transmission in wireless network. The Coding-aware routing maximizes the coding opportunity by finding the coding possible path for every packet in the network. Here we propose CORMEN: a new coding-aware routing mechanism based on opportunistic routing. In CORMEN, every node independently can take the decision whether to code packets or not and forwarding of packets is based on the codi…
In this paper we consider security-related and energy-efficiency issues in multi-hop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates congested areas in multi-hop wireless networks. These areas are critical--they generate both security and energy efficiency issues. We attack these problems and set out routing in outer space, a new routing mechanism that transforms any shortest path routing protocol (or approximated versions of it) into a new protocol that, in case of uniform traffic, guarantees that every node of the network…
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.
Enabling real time applications in wireless sensor networks requires certain delay and bandwidth which pose more challenges in the design of routing protocols. The algorithm that is used for packet routing in such applications should be able to establish a tradeoff between end to end delay parameter and energy consumption. In this paper, we propose a new multi path routing algorithm for real time applications in wireless sensor networks namely QEMPAR which is QoS aware and can increase the network lifetime. Simulation results show that the proposed algorithm is more efficient than previous alg…
Today in fast technology development in wireless mobile adhoc network there is vast scope for research. As it is known that wireless communication for mobile network has many application areas like routing services, security services etc. The mobile adhoc network is the wireless network for communication in which the mobile nodes are organized without any centralized administrator. There are many Manet routing protocols like reactive, proactive, hybrid etc. In this paper the reactive Manet routing protocol like DSR is simulated for traffic analysis for 50 mobile nodes for IP traffic flows. Als…
Cluster based routing technique is most popular routing technique in Wireless Sensor Networks (WSNs). Due to varying need of WSN applications efficient energy utilization in routing protocols is still a potential area of research. In this research work we introduced a new energy efficient cluster based routing technique. In this technique we tried to overcome the problem of coverage hole and energy hole. In our technique we controlled these problems by introducing density controlled uniform distribution of nodes and fixing optimum number of Cluster Heads (CHs) in each round. Finally we verifie…
Many wireless protocols wait a small and random amount of time which is called jitter before sending a packet to avoid high contention and packet collision. Jitter has been already proposed for many routing protocols including AODV and LOADng. However, since they do not consider any link quality parameters or metrics (such as ETX) in routing, they fail to be efficient in metric-based routing protocols. A metric-based jitter mechanism is proposed in this paper and a closed form expression is derived that enables us to obtain the probability of delay inversion for all jitter mechanisms available…
A dynamic routing policy, referred to as Heat-Diffusion (HD), is developed for multihop uniclass wireless networks subject to random traffic, time-varying topology and inter-channel interference.The policy uses only current condition of queue occupancies and channel states, with requiring no knowledge of traffic and topology.Besides throughput optimality, HD minimizes an average quadratic routing cost defined by endowing each channel with a time-varying cost factor. Further, HD minimizes average network delay in the class of routing policies that base decisions only on current condition of tra…
In this paper, we have modeled the routing over- head generated by three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and DYnamic MANET On-deman (DYMO). Routing performed by reactive protocols consists of two phases; route discovery and route maintenance. Total cost paid by a protocol for efficient routing is sum of the cost paid in the form of energy consumed and time spent. These protocols majorly focus on the optimization performed by expanding ring search algorithm to control the flooding generated by the mechanism of blind flooding. So,…
In this paper, we propose LMEEC, a cluster-based routing protocol with low energy consumption for wireless sensor networks. Our protocol is based on a strategy which aims to provide a more reasonable exploitation of the selected nodes (cluster-heads) energy. Simulation results show the effectiveness of LMEEC in decreasing the energy consumption, and in prolonging the network lifetime, compared to LEACH.
Many energy-aware routing protocols have been proposed for wireless sensor networks. Most of them are only energy savers and do not take care about energy balancing. The energy saver protocols try to decrease the energy consumption of the network as a whole; however the energy manager protocols balance the energy consumption in the network to avoid network partitioning. This means that energy saver protocols are not necessarily energy balancing and vice versa. However, the lifetime of wireless sensor network is strictly depending on energy consumption; therefore, energy management is an essent…
The effectiveness and simple implementation of physical layer jammers make them an essential threat for wireless networks. In a multihop wireless network, where jammers can interfere with the transmission of user messages at intermediate nodes along the path, one can employ jamming oblivious routing and then employ physical-layer techniques (e.g. spread spectrum) to suppress jamming. However, whereas these approaches can provide significant gains, the residual jamming can still severely limit system performance. This motivates the consideration of routing approaches that account for the differ…
Underwater optical wireless communication (UOWC) is becoming an attractive technology for underwater wireless sensor networks (UWSNs) since it offers high-speed communication links. Although UOWC overcomes the drawbacks of acoustic and radio frequency communication channels such as high latency and low data rate, yet, it has its own limitations. One of the major limitations of UOWC is its limited transmission range which demands to develop a multi-hop network with efficient routing protocols. Currently, the routing protocols for UOWSNs are centralized having high complexity and large end-to-en…
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes a novel hybrid multipath routing algorithm with an efficient clustering technique. A node is selected as cluster head if it has high surplus energy, better transm…
Underwater wireless sensor networks (UWSN), similar to the terrestrial sensor networks, have different challenges such as limited bandwidth, low battery power, defective underwater channels, and high variable propagation delay. A crucial problem in UWSN is finding an efficient route between a source and a destination. Consequently, great efforts have been made for designing efficient protocols while considering the unique characteristics of underwater communication. Several routing protocols are proposed for this issue and can be classified into geographic and non-geographic routing protocols.…
Backpressure routing and scheduling, with its throughput-optimal operation guarantee, is a promising technique to improve throughput in wireless multi-hop networks. Although backpressure is conceptually viewed as layered, the decisions of routing and scheduling are made jointly, which imposes several challenges in practice. In this work, we present Diff-Max, an approach that separates routing and scheduling and has three strengths: (i) Diff-Max improves throughput significantly, (ii) the separation of routing and scheduling makes practical implementation easier by minimizing cross-layer operat…
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the network coordinates with every other node in forwarding their packets to reach the destination. Since these nodes operate in a physically insecure environment; they are vulnerable to different types of attacks such as selective forwarding and sinkhole. These attacks can inject malicious packets by compromising the node. Geographical routing protocols of wireless sensor networks have been developed without considering t…
In this paper, we identify and analyze the requirements to design a new routing link metric for wireless multihop networks. Considering these requirements, when a link metric is proposed, then both the design and implementation of the link metric with a routing protocol become easy. Secondly, the underlying network issues can easily be tackled. Thirdly, an appreciable performance of the network is guaranteed. Along with the existing implementation of three link metrics Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with Optimized …
In the years, routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches. Most state-of-the-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN) and also provide a qualitative comparison of them.
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) a…
In this paper, we evaluate, analyze, and compare the impact of mobility on the behavior of three reactive protocols (AODV, DSR, DYMO) and three proactive protocols (DSDV, FSR, OLSR) in multi-hop wireless networks. We take into account throughput, end-to-end delay, and normalized routing load as performance parameters. Based upon the extensive simulation results in NS-2, we rank all of six protocols according to the performance parameters. Besides providing the interesting facts regarding the response of each protocol on varying mobilities and speeds, we also study the trade-offs, the routing p…
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 important issues in wireless networks is the Routing problem that is effective on system performance, in this article the attempt is made to propose a routing algorithm using the bee colony in order to reduce energy consumption in wireless relay networks. In EBCD algorithm, through combined of energy, distance and traffic parameters a routing algorithm for wireless networks is presented with more efficiency than its predecessor. Applying the bee colony method would allow the placement of the parameters under conventional conditions and to get closer to a mechanism with a better adap…
Wireless sensor networks hold a great potential in the deployment of several applications of a paramount importance in our daily life. Video sensors are able to improve a number of these applications where new approaches adapted to both wireless sensor networks and video transport specific characteristics are required. The aim of this work is to provide the necessary bandwidth and to alleviate the congestion problem to video streaming. In this paper, we investigate various load repartition strategies for congestion control mechanism on top of a multipath routing feature. Simulations are perfor…
Advances in wireless sensor network (WSN) technology have provided the availability of small and low-cost sensor with capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In WSN, the sensor nodes have a limited transmission range, and their processing and storage capabilities as well as their energy resources are also limited. Modified triple umpiring system (MTUS) has already proved its better performance in Wireless Sensor Networks. In this paper, we extended the MTUS by incorporating optimal signal to noise ratio (SNR)-ba…
From energy conservation perspective inWireless Sensor Networks (WSNs), clustering of sensor nodes is a challenging task. Clustering technique in routing protocols play a key role to prolong the stability period and lifetime of the network. In this paper, we propose and evaluate a new routing protocol for WSNs. Our protocol; Divide-and-Rule (DR) is based upon static clustering and dynamic Cluster Head (CH) selection technique. This technique selects fixed number of CHs in each round instead of probabilistic selection of CH. Simulation results show that DR protocol outperform its counterpart ro…
Energy efficiency in wireless networks has become an important field of research due to ever increasing energy expenditure in battery supplied mobile terminals. In this paper we present an energy efficient routing scheme for multi-standard infrastructure wireless networks based on multi-hop cooperative relaying. The aim of the proposed technique is to exploit short-range cooperation to take benefit from mobile terminals having superior links thus enable energy efficiency. Performance results show that higher data-rate yielded by cooperation can compensate the expense of higher energy due to mu…
We investigate the design of the optimal routing path in a moving vehicles involved the internet of things (IoT). In our model, jammers exist that may interfere with the information exchange between wireless nodes, leading to worsened quality of service (QoS) in communications. In addition, the transmit power of each battery-equipped node is constrained to save energy. We propose a three-step optimal routing path algorithm for reliable and energy-efficient communications. Moreover, results show that with the assistance of moving vehicles, the total energy consumed can be reduced to a large ext…
A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field. On rotation basis, a head-set member receives data from the neighbor nodes and transmits the aggregated results to the distance base station. This protocol reduces energy consumption quite significantly and prolongs the life time of sensor network. It is foun…
Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their conformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints su…
This paper presents an energy efficient routing algorithm for heterogeneous Wireless Body Area Sensor Networks (WBASNs). A prototype is defined for employing heterogeneous sensors on human body. Direct communication is used for real-time traffic (critical data) and on-demand data while multi-hop communication is used for normal data delivery in this proposed routing algorithm. One of the prime challenges in WBASNs is sensing of heat generated by implanted sensor nodes. The proposed routing algorithm is thermal-aware which sense the link Hot-spot and routes the data away from these links. Conti…
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…
In this paper we present a methodology employing statistical analysis and stochastic geometry to study geometric routing schemes in wireless ad-hoc networks. In particular, we analyze the network layer performance of one such scheme, the random $\frac{1}{2}$disk routing scheme, which is a localized geometric routing scheme in which each node chooses the next relay randomly among the nodes within its transmission range and in the general direction of the destination. The techniques developed in this paper enable us to establish the asymptotic connectivity and the convergence results for the mea…
These days MANET is an amazing remarkably altering or rising technology, for the reason that of its elite nature of scattered mobile devices and self motivated network topology. The mobile adhoc routing protocol follows several principles in wireless MANETs. The up to date and novel applications based on wireless technology are being produced in the private as well as commercial sectors. A lot of challenges which are facing wireless MANETs like network stability, security, energy efficiency and performance analysis etc. At present wireless adhoc network get much more attention because of its a…
Heterogeneous wireless networks with wireless devices supporting multitude of radio access technologies are witnessing increasing interest from network providers and consumers alike. Energy efficiency in such networks has become an important design consideration due to the limited battery life of mobile terminals on one side, and the ever increasing operational expenses pertaining to energy expenditure on the other. In this paper, we present a routing protocol for multi-radio multi-hop wireless networks, which aims to achieve a trade-off between energy consumption in the network and routing de…
In this paper, we propose a new Quality Link Metric (QLM), ``Inverse Expected Transmission Count (InvETX)'' in Optimized Link State Routing (OLSR) protocol. Then we compare performance of three existing QLMs which are based on loss probability measurements; Expected Transmission Count (ETX), Minimum Delay (MD), Minimum Loss (ML) in Static Wireless Multi-hop Networks (SWMhNs). A novel contribution of this paper is enhancement in conventional OLSR to achieve high efficiency in terms of optimized routing load and routing latency. For this purpose, first we present a mathematical framework, and th…
Wireless Ad-hoc network is generally employed in military and emergencies due to its flexibility and easy-to-use. It's suitable for military wireless network that has the characteristics of mobility and works effectively under severe environment and electromagnetic interfering conditions. However, military network cannot benefit from existing routing protocol directly; there exists quite many features which are only typical for military network. This paper presents a new metric for routing, which is employed in A* algorithm. The goal of the metric is to choose a route of less distance and less…
Wireless networks are becoming the key building block of our communications infrastructure. Examples range from cellular networks to ad hoc and sensor networks in wildlife monitoring and environmental scenarios. With the rise of the Internet of Things (IoT) millions of physical and virtual objects will communicate wireless and enhance the daily life. The adaptivity and scalability of wireless networks in the IoT is one of the most challenging tasks. Bio-inspired networking algorithms are a way to tackle these issues. In this paper we present a simulation framework based on OMNeT++ to implement…
We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support routing with delivery guarantee in wireless ad hoc sensor networks. It is a simple routing protocol that can easily be combined with any other greedy routing algorithm to obtain delivery guarantee. The efficiency of HBR increases if the network is sparse and contains obstacles. The space necessary to store the additional routing information at a node u is on average not larger than the size necessary to store the IDs of the neighbors of u. The amount of wo…
Several emerging classes of applications that run over wireless networks have a need for mathematical models and tools to systematically characterize the reliability of the network. We propose two metrics for measuring the reliability of wireless mesh routing topologies, one for flooding and one for unicast routing. The Flooding Path Probability (FPP) metric measures the end-to-end packet delivery probability when each node broadcasts a packet after hearing from all its upstream neighbors. The Unicast Retransmission Flow (URF) metric measures the end-to-end packet delivery probability when a r…
We present a unified analytical framework within which power control, rate allocation, routing, and congestion control for wireless networks can be optimized in a coherent and integrated manner. We consider a multi-commodity flow model with an interference-limited physical-layer scheme in which power control and routing variables are chosen to minimize the sum of convex link costs reflecting, for instance, queuing delay. Distributed network algorithms where joint power control and routing are performed on a node-by-node basis are presented. We show that with appropriately chosen parameters, th…
This work focusses on analyzing the optimization strategies of routing protocols with respect to energy utilization of sensor nodes in Wireless Sensor Network (WSNs). Different routing mechanisms have been proposed to address energy optimization problem in sensor nodes. Clustering mechanism is one of the popular WSNs routing mechanisms. In this paper, we first address energy limitation constraints with respect to maximizing network life time using linear programming formulation technique. To check the efficiency of different clustering scheme against modeled constraints, we select four cluster…
