Results 1  10
of
38
Asymptotically optimal poweraware routing for multihop wireless networks with renewable energy sources
 in Proceedings of IEEE INFOCOM
, 2005
"... Abstract — In this paper, we model and characterize the performance of multihop radio networks in the presence of energy constraints, and design routing algorithms to optimally utilize the available energy. The energy model allows vastly different energy sources in heterogeneous environments. The pr ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
Abstract — In this paper, we model and characterize the performance of multihop radio networks in the presence of energy constraints, and design routing algorithms to optimally utilize the available energy. The energy model allows vastly different energy sources in heterogeneous environments. The proposed algorithm is shown to achieve a competitive ratio (i.e., the ratio of the performance of any offline algorithm that has knowledge of all past and future packet arrivals to the performance of our online algorithm) that is asymptotically optimal with respect to the number of nodes in the network. The algorithm assumes no statistical information on packet arrivals and can easily be incorporated into existing routing frameworks (e.g., proactive or ondemand methodologies) in a distributed fashion. Simulation results confirm that the algorithm performs very well in terms of maximizing the throughput of an energyconstrained network. Further, a new thresholdbased scheme is proposed to reduce the routing overhead while incurring only minimum performance degradation.
Rate Allocation in Wireless Sensor Networks with Network Lifetime Requirement
, 2004
"... An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocat ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocation among the nodes, we advocate the use of lexicographical maxmin (LMM) rate allocation for the nodes. To calculate the LMM rate allocation vector, we develop a polynomialtime algorithm by exploiting the parametric analysis (PA) technique from linear programming (LP), which we call serial LP with Parametric Analysis (SLPPA). We show that the SLPPA can be also employed to address the socalled LMM node lifetime problem much more efficiently than an existing technique proposed in the literature. More important, we show that there exists an elegant duality relationship between the LMM rate allocation problem and the LMM node lifetime problem. Therefore, it is sufficient to solve any one of the two problems and important insights can be obtained by inferring duality results for the other problem.
Asymptotically Optimal EnergyAware Routing for Multihop Wireless Networks with Renewable Energy Sources †
"... Abstract — In this paper, we develop a model to characterize the performance of multihop radio networks in the presence of energy constraints, and design routing algorithms to optimally utilize the available energy. The energy model allows us to consider different types of energy sources in heteroge ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Abstract — In this paper, we develop a model to characterize the performance of multihop radio networks in the presence of energy constraints, and design routing algorithms to optimally utilize the available energy. The energy model allows us to consider different types of energy sources in heterogeneous environments. The proposed algorithm is shown to achieve a competitive ratio (i.e., the ratio of the performance of any offline algorithm that has knowledge of all past and future packet arrivals to the performance of our online algorithm) that is asymptotically optimal with respect to the number of nodes in the network. The algorithm assumes no statistical information on packet arrivals and can easily be incorporated into existing routing schemes (e.g., proactive or ondemand methodologies) in a distributed fashion. Simulation results confirm that the algorithm performs very well in terms of maximizing the throughput of an energyconstrained network. Further, a new thresholdbased scheme is proposed to reduce the routing overhead while incurring only minimum performance degradation.
Paradox of shortest path routing for large multihop wireless networks
 in Proc. of IEEE Infocom ’07
, 2007
"... In this paper, we analyze the impact of straight line routing in large homogeneous multihop wireless networks. We estimate the nodal load, which is defined as the number of packets served at a node, induced by straight line routing. For a given total offered load on the network, our analysis shows ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
In this paper, we analyze the impact of straight line routing in large homogeneous multihop wireless networks. We estimate the nodal load, which is defined as the number of packets served at a node, induced by straight line routing. For a given total offered load on the network, our analysis shows that the nodal load at each node is a function of the node’s Voronoi cell, the node’s location in the network, and the traffic pattern specified by the source and destination randomness and straight line routing. The traffic pattern determines where the hot spot is created in the network, and straight line routing itself can balance the relay load in certain cases. In the asymptotic regime, each node’s probability that the node serves a packet arriving to the network can be approximated as the multiplication of a half length of its Voronoi cell perimeter and the probability density function that a packet goes through the node’s location. Both simulations and analysis confirm that this approximation converges to the exact value. The scaling order of network performance in our analysis is independent of traffic patterns generated by sourcedestination pair randomness, but for a given node the performance of each node is strongly related to the sourcedestination pair randomness. ulations
Interferenceaware routing in multihop wireless networks using directional antennas
 in Proceedings of INFOCOM
, 2005
"... Abstract — Recent research has shown that interference can make a significant impact on the performance of multihop wireless networks. Researchers have studied interferenceaware topology control recently [1]. In this paper, we study routing problems in a multihop wireless network using directional ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Abstract — Recent research has shown that interference can make a significant impact on the performance of multihop wireless networks. Researchers have studied interferenceaware topology control recently [1]. In this paper, we study routing problems in a multihop wireless network using directional antennas with dynamic traffic. We present new definitions of link and path interference that are suitable for designing better routing algorithms. We then formulate and optimally solve two power constrained minimum interference single path routing problems. Routing along paths found by our interferenceaware algorithms tends to have less channel collisions and higher network throughput. Our simulation results show that, compared with the minimum power path routing algorithm, our algorithms can reduce average path interference by 40 % or more at the cost of a minor power increase. We also extend our work towards survivable routing by formulating and solving the power constrained minimum interference nodedisjoint path routing problem.
Veciana, “Spatial energy balancing through proactive multipath routing in multihop wireless networks
 Tech. Rep., Wireless Networking and Communications Group (WNCG), University of Texas at Austin, TX. [Online] Available: http://www.ece.utexas.edu/∼gustavo
, 2004
"... Abstract—In this paper, we investigate the use of proactive multipath routing to achieve energyefficient operation of ad hoc wireless networks. The focus is on optimizing tradeoffs between the energy cost of spreading traffic and the improved spatial balance of energy burdens. We propose a simple s ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Abstract—In this paper, we investigate the use of proactive multipath routing to achieve energyefficient operation of ad hoc wireless networks. The focus is on optimizing tradeoffs between the energy cost of spreading traffic and the improved spatial balance of energy burdens. We propose a simple scheme for multipath routing based on spatial relationships among nodes. Then, combining stochastic geometric and queueing models, we develop a continuum model for such networks, permitting an evaluation of different types of scenarios, i.e., with and without energy replenishing and storage capabilities. We propose a parameterized family of energy balancing strategies and study the spatial distributions of energy burdens based on their associated secondorder statistics. Our analysis and simulations show the fundamental importance of the tradeoff explored in this paper, and how its optimization depends on the relative values of the energy reserves/storage, replenishing rates, and network load characteristics. For example, one of our results shows that the degree of spreading should roughly scale as the square root of the bits meters load offered by a session. Simulation results confirm that proactive multipath routing decreases the probability of energy depletion by orders of magnitude versus that of a shortest path routing scheme when the initial energy reserve is high. Index Terms—Gaussian random field, I queue, sensor networks, shotnoise process, stochastic geometry. I.
Geometrically aware communication in random wireless networks
 ACM PODC
, 2004
"... Some of the first routing algorithms for geographically aware wireless networks used the Delaunay triangulation among the network’s nodes as the underlying connectivity graph [4]. These solutions were considered impractical, however, because in general the Delaunay triangulation may contain arbitrar ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Some of the first routing algorithms for geographically aware wireless networks used the Delaunay triangulation among the network’s nodes as the underlying connectivity graph [4]. These solutions were considered impractical, however, because in general the Delaunay triangulation may contain arbitrarily long edges, and because calculating the Delaunay triangulation generally requires a global view of the network. Many other algorithms were then suggested for geometric routing, often assuming random placement of network nodes for analysis or simulation [30, 5, 31, 16]. We show that, when the nodes are uniformly placed in the unit disk, the Delaunay triangulation does not contain long edges, it is easy to compute locally and it is in many ways optimal for geometric routing and flooding. In particular, we prove that, with high probability, the
Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply
 in QShine06
, 2006
"... Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and propose two protocols, GREESL and GREESM, which ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and propose two protocols, GREESL and GREESM, which combine geographic routing and energy efficient routing techniques and take into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when making routing decisions. Simulation results show that GREESs are more energy efficient than the corresponding residual energy based protocols and geographic routing protocols without energy awareness. GREESs can maintain higher mean residual energy on nodes, and achieve better load balancing in terms of having smaller standard deviation of residual energy on nodes. Both GREESL and GREESM exhibit graceful degradation on endtoend delay, but do not compromise the endtoend throughput performance. Index Terms wireless sensor networks, geographic routing, energy efficiency, environmental energy supply
Lowcomplexity and distributed energy minimization in multihop wireless networks
 Purdue University, Tech. Rep., 2006, available on http://web.ics.purdue.edu/ ∼ llin/paper/ tech06.pdf
, 2007
"... Abstract — In this work, we study the problem of minimizing the total power consumption in a multihop wireless network subject to a given offered load. It is wellknown that the total power consumption of multihop wireless networks can be substantially reduced by jointly optimizing power control, ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract — In this work, we study the problem of minimizing the total power consumption in a multihop wireless network subject to a given offered load. It is wellknown that the total power consumption of multihop wireless networks can be substantially reduced by jointly optimizing power control, link scheduling, and routing. However, the known optimal crosslayer solution to this problem is centralized, and with high computational complexity. In this paper, we develop a lowcomplexity and distributed algorithm that is provably powerefficient. In particular, under the node exclusive interference model, we can show that the total power consumption of our algorithm is at most twice as large as the power consumption of the optimal (but centralized and complex) algorithm. Our algorithm is not only the first such distributed solution with provable performance bound, but its powerefficiency ratio is also tighter than that of another suboptimal centralized algorithm in the literature.
Algorithms for Wireless Sensor Network
 International Journal of Distributed Sensor Networks
, 2005
"... This paper reviews some of the recent advances in the development of algorithms for wireless sensor networks. We focus on sensor deployment and coverage, routing and sensor fusion. ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
This paper reviews some of the recent advances in the development of algorithms for wireless sensor networks. We focus on sensor deployment and coverage, routing and sensor fusion.