Stojmenovic I, Lin Xu. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems 2001; 12(11): 1122 -- 1133.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....scheme which provides two optimizations to address this problem. In the first optimization, we can remove the cost information from the reconfiguration message since a heuristic can be used to estimate the cost, as long as the distance between two nodes is known. Based on the results from [17], the cost of sending one unit of information from node i to node j can be estimated by v(d i;j ) where 1 is a system parameter used to estimate the relationship between the minimum cost and the real cost. A large means a high cost. In our simulations, is set to 2:0. v(x) is a ....

.... means a high cost. In our simulations, is set to 2:0. v(x) is a function defined as c (a=c) x a (a=c) x, where a and c are parameters related to the power model. It has been proved that v(d i;j ) is the minimum cost for sending one unit of information from node i to node j [17]. To implement this idea, MinEngPath of Figure 7 should be modified as follows: MinEngPath(R, i, l 2 ) 1) find hj; e(j; R)i 2 l 2 , such that (8hk; e(k; R)i 2 l 2 )fe(i; j) v(d j;R ) e(i; k) v(d k;R )g (2) node i changes its parent to be j; e(i; R) e(i; j) v(d j;R ) In ....

Ivan Stojmenovic and Xu Lin, "Power-Aware Localized Routing in Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122--1133, 2001.

.... or known as topology control, is addressed in [3] 4] 5] How to increase network throughput by power adjustment for packet radio networks is addressed in [6] Power Aware Routing: Power aware routing protocols have been proposed based on various power cost functions [7] 8] 9] 10] [11]. In [7] when a mobile host s battery level is below a certain threshold, it will not forward packets for other hosts. In [10] five different metrics based on battery power consumption are proposed. Reference [11] considers both hosts lifetime and a distance power metric. A hybrid environment ....

....have been proposed based on various power cost functions [7] 8] 9] 10] 11] In [7] when a mobile host s battery level is below a certain threshold, it will not forward packets for other hosts. In [10] five different metrics based on battery power consumption are proposed. Reference [11] considers both hosts lifetime and a distance power metric. A hybrid environment consisting of battery powered and outlet plugged hosts is considered in [8] Two distributed heuristic clustering approaches for multicasting are proposed in [9] to minimizing the transmission power. Low Power ....

I. Stojmenovic and X. Lin, "Power-aware Localized Routing in Wireless Networks," Proc. of IEEE International Parallel and Distributed Processing Symposium, pp. 371--376, 2000.

.... or known as topology control, is addressed in [3] 4] 5] How to increase network throughput by power adjustment for packet radio networks is addressed in [6] Power Aware Routing: Power aware routing protocols have been proposed based on various power cost functions [7] 8] 9] 10] [11]. In [7] when a mobile host s battery level is below a certain threshold, it will not forward packets for other hosts. In [10] five different metrics based on battery power consumption are proposed. Reference [11] considers both hosts lifetime and a distance power metric. A hybrid environment ....

....have been proposed based on various power cost functions [7] 8] 9] 10] 11] In [7] when a mobile host s battery level is below a certain threshold, it will not forward packets for other hosts. In [10] five different metrics based on battery power consumption are proposed. Reference [11] considers both hosts lifetime and a distance power metric. A hybrid environment consisting of battery powered and outlet plugged hosts is considered in [8] Two distributed heuristic clustering approaches for multicasting are proposed in [9] to minimizing the transmission power. Low Power ....

I. Stojmenovic and X. Lin, "Power-aware Localized Routing in Wireless Networks," Proc. of IEEE International Parallel and Distributed Processing Symposium, pp. 371--376, 2000.

....loop free, while DIR method may create loops, unless past traffic is memorized or a timestamp is enforced [SL] A routing algorithm that guarantees delivery in unit graphs is described in [BMSU] It has been generalized in 3 [BFNO] for wider ranges of graphs. Power aware routing is discussed in [SL2]. The concept of internal nodes is introduced in [WL] and it significantly improves delivery rates and hop counts in routing algorithms [SSW] Detailed survey on position based routing schemes in given in [GSB] A detailed literature review on location update schemes for efficient routing in ad ....

....speed is far greater than node movement speed, the path creation phase in a localized routing may, to a large extent, be considered as the operation performed on a static network. Thus routing algorithms for static networks (with known location of destination) such as those proposed in [KSU, SL, BMSU, SL2, SSW, TK], may be applied for the path creation phase. This 5 assumption is justified since each node mountains the list of neighbors and learns the exact location of destination, which is the only information needed for making a routing decision at each node. 4) Data traffic messages, initiated by source ....

[Article contains additional citation context not shown here]

Ivan Stojmenovic and Xu Lin, Power-aware localized routing in wireless networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 11, November 2001, 1122-1133.

....is an important factor. Some engineers design low power consumption chips [3] and high efficient batteries to improve the performance of portable wireless devices. Some engineers design power aware algorithms to efficiently use batteries or to balance the energy consumption in the network [2,7,11,12,15]. Many protocols are designed concerning device energy conservation, such as Minimum Total Transmission Power Routing (MTPR) Minimum Battery Cost Routing (MBCR) Min Max Battery Cost Routing (MMBCR) and Conditional Max Min Battery Capacity Routing (CMMBCR) 13] These schemes focus on optimizing ....

Stojmenovic, X. Lin, "Power-aware localized routing in wireless networks ", IEEE transactions on parallel and distributed systems, vol. 12, no. 11, November 2001,

....research has been devoted to ad hoc sensor networks in this direction. Using power control to reduce interference and improve throughput is addressed in [4, 16] Topology control by tuning transmission powers is discussed in [3, 9, 14] Power aware routing for ad hoc networks can be found in [1, 10, 11, 12]. Both IEEE 802.11 and Bluetooth support low power modes [2, 15] How to design low power modes on 802.11based multi hop networks is addressed in [13] In this paper, we consider the topology control problem in an ad hoc sensor network. Topology in ad hoc networks is not a static notion since it ....

I. Stojmenovic and X. Lin. Power-aware Localized Routing in Wireless Networks. IEEE International Parallel and Distributed Processing Symposium, pages 371--376, 2000.

....links caused by obstruction or fading of signals. How to maintain the long multi hop paths between two communicating nodes [7] 12] 13] 15] 14] How to reduce the interference among the various users wishing to transmit which is caused due absence of any centralized control [20] 17] [19], 16] 18] Another direction in the quest for efficient routing protocols was introduced by the work of Gupta and Kumar [4] which focused on the capacity of wireless ad hoc networks. They first show an upper bound on the maximum possible transmission capacity achievable by any static ad hoc ....

Ivan Stojmenovic and Xu Lin. Power-aware localized routing in wireless networks. In Proc. IEEE Int. Parallel and Distributed Processing Symp., 2000.

....the total energy consumed per packet. However, 6] merely observes that the routes selected when using this metric will be identical to routes selected by shortest hop count routing, since the energy consumed in transmitting (receiving) one packet over one hop is considered constant. In [8] and [9] the authors describe several localized routing algorithms that try to minimize the total energy per packet and or lifetime of each node. The proposed routing algorithms are all demand based. These methods use control messages to update the positions of all nodes to maintain the efficiency of the ....

I. Stojmenovic and X. Lin. Power-aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

.... deliver messages at most once, and deliver messages with high reliability. Examples for such routing mechanisms are on demand ad hoc routing protocols like AODV [21] or DSR [11] with power aware distance metrics [30] and localized power aware routing algorithms for sensor networks such as [28]. The route discovery phase of many of these demand driven algorithms is very similar to DG discovery as described in section 4.1. A route to a destination address A is typically discovered by flooding the network with a route discovery message containing A. If A receives the discovery message, ....

I. Stojmenovic and X. Lin. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

.... 2 routing algorithms that try to find a low energy route instead of the shortest routing path [11] Two other routing algorithms in this direction can be found in [12 ,13] where the latter achieves the goal by controlling the transmit power of the communication device as suggested in [14]. However, these studies have three major shortcomings. First, they assume a static network topology where mobile nodes do not move, and thus ad hoc routing algorithms to support mobility are not considered. This assumption simplifies their studies but the validity of their results is limited. ....

I. Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks," International Parallel and Distributed Processing Symposium (IPDPS), pp. 371-376, 2000.

....The second option focuses on the paths that are followed during the data routing phase. The framework presented in [2] advocates a localized model called directed diffusion . Other work uses information on battery reserve and the energy cost to find the optimal routes [4] The routing protocol in [5] is based on the node s location, transmit energy and the residual battery capacity. In contract to this prior work, we propose a guideline that aims at spreading the network traffic in a uniform fashion. Our spreading ideas, although partly tailored towards the underlying routing algorithm we ....

Stojmenovic, I., Lin, X., "Power-Aware Localized Routing in Wireless Networks," Proceedings IPDPS 2000.

....information originating from a node is di#used slowly, the load on that path decreases. They also present a very nice analytical model based on Markov chains. A di#erent randomized protocol [7] uses mobile agents to help routing. Other interesting routing protocols include power aware routing [22, 15]. Another related area is PCS location management [23, 14, 6] Most location management techniques use a combination of updating and finding, in an e#ort to select the best trade o# between the update overhead and the delay incurred searching. Specifically, updates are not usually sent every ....

Ivan Stojmenovic and Xu Lin. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

....proposed power aware routing and discussed di#erent metrics in poweraware routing. Some of the ideas in this paper are extensions of what that paper proposed. Minimal energy consumption was used in [19] Stojmenovic and Lin proposed the first localized power aware algorithm in their paper series [23]. Their algorithm is novel in combining the power and cost into one metric and running only based on the local information. Chang and Tassiulas [2] also used the combined metric to direct the routing. Their algorithm is proposed to maximize the lifetime of a network when the message rate is known. ....

Ivan Stojmenovic and Xu Lin. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

No context found.

I. Stojmenovic and X. Lin. Power-aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

No context found.

I. Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks, " IEEE Trans. Parallel Distrib. Systems, vol. 12, no. 11, pp. 1122-- 1133, Oct. 2001.

No context found.

Ivan Stojmenovic and Xu Lin, Power aware localized routing in wireless networks, IEEE International Parallel and Distributed Processing Symposium, Cancun, Mexico, May 1-5, 2000, 371-376.

No context found.

I. Stojmenovic and X. Lin, Power aware localized routing in wireless networks, IEEE Transactions on Parallel and Distributed Systems 12(11) (2001) 1122--1133.

....of time, nodes may change their activity on a regular basis. Thus, nonlocalized shortest path algorithms may not be the best choice for a routing algorithm even in case of static networks (e.g. some kinds of sensor networks) This paper deals solely with localized algorithms. In accordance with [BCSW, BMSU, KV, KSU, SL1, SL2, TK], it is assumed that each node, in its routing table, contains the geographic location of all other nodes in network, including the time when the location for each node is established. The sender uses the latest available location about the position of the destination and attaches it to the ....

....destination are decreasing. Other existing GPS based routing algorithms are reviewed and two of them compared experimentally with the GEDIR algorithm. One of methods, called MFR (most forward with progress) TK] is comparable to GEDIR but is conceptually more sophisticated and requires more power [SL2], while the other, based on direction of edges [BCSW, KV, KSU] is not loop free [SL1] and does not perform better in terms of success rates or hop counts [SL1] More 4 precisely, direction based methods [BCSW, KV] forward message from node A currently holding it to all nodes located between ....

[Article contains additional citation context not shown here]

I. Stojmenovic and Xu Lin, Power-aware localized routing in wireless networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 11, November 2001, 11221133.

....In Scheme 1 and Scheme 2, each mobile terminal also keeps a power history table as in PCMAC, and the table updating mechanism is also similar to that of PCMAC. We choose Scheme 1 and Scheme 2 as our references because they are adopted by many other power control algorithms [1] 2] 3] 4] [9], 10] which are designed for tackling the asymmetrical link problem. Same as the parameters used in [5] in our simulation we adopt ten transmission power levels: 1 mW, 2 mW, 3.45 mW, 4.8 mW, 7.25 mW, 10.6 mW, 15 mW, 36.6 mW, 75.8 mW, and 281.8 mW, which roughly correspond to the decoding range ....

I. Stojmenovic and X. Lin, "Power-Aware Localized Routing in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122--1133, Nov. 2001.

....nodes B and E in Fig. 1) Basic Distance, Progress, And Direction Based Methods use these concepts to select among neighbors the next routing step. Schemes as the Random Progress Method [NK] Most Forward within Radius [TK] Nearest Forward Progress [HL] the Greedy Scheme [F] the Nearest Closer [SL] and all its variants (the 2 Hop Greedy Method [SL2] the Alternate Greedy method [LS] the Disjoint Greedy method [LS] and GEDIR [SL2] and the Compass Routing method [KSU] fall in this class. In the random progress method [NK] packets destined toward D are routed with equal probability ....

....is not expected to improve much in the future. We see a clear need for improvement in power consumption in existing routing algorithms. Schemes that combine position based and power cost aware routing are proposed in [RM] Fe] FN] LHBWW] LH] LWWF] E] HCB] SRW] CT] GCNB] SL2] [SL], LAR] SD] Rodoplu and Meng [RM] proposed a general model where the power consumption between two nodes with distance d is given by u(d) d c for some constants and c, and describe several properties of power transmission that are used to find neighbors for which direct transmission is ....

[Article contains additional citation context not shown here]

I. Stojmenovic and Xu Lin, Power-aware localized routing in wireless networks, IEEE Int. Parallel and Distributed Processing Symp., Cancun, Mexico, May 1-5, 2000, 371-376; IEEE Transactions on Parallel and Distributed Systems, to appear.

No context found.

I. Stojmenovic and X. Lin, "Power-Aware Localized Routing in Wireless Networks," IEEE Trans. Parallel and Distributed Systems, to appear.

No context found.

Stojmenovic I, Lin Xu. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems 2001; 12(11): 1122 -- 1133.

No context found.

Ivan Stojmenovic and Xu Lin. "Power-Aware Localized Routing in Wireless Networks." IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, 2001.

No context found.

I. Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks," IEEE Trans. Parallel Distrib. Syst., vol. 12, pp. 1122--1133, Nov. 2001.

No context found.

Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks." Proc. IEEE IPDPS, Cancun, Mexico, May 2000 .

No context found.

Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks." Proc. IEEE IPDPS, Cancun, Mexico, May 2000.

No context found.

Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks," Proc. IEEE Trans. on Parallel and Disrtibuted Systems.Vol. 12, No. 11,pp. 1122-1133 , May 2001.

No context found.

Ivan Stojmenovic and Xu Lin. Power-aware localized routing in wireless networks. IEEE Trans. Parallel Distrib. Syst., 12(11):1122--1133, 2001.

No context found.

I. Stojmenovic and X. Lin., "Power-aware localized routing in wireless networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122--1133, 2001.

No context found.

Ivan Stojmenovic and Xu Lin. Power-aware localized routing in wireless networks.

No context found.

I. Stojmenovic and X. Lin. Power-aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

No context found.

Ivan Stojmenovic and Xu Lin. Power-aware localized routing in wireless networks.

No context found.

I. Stojmenovic and X. Lin. Power-Aware Localized Routing in Wireless Networks. In Proc. of IEEE International Parallel and Distributed Processing Symposium, Cancun, Mexico, May 2000. 16

No context found.

Ivan Stojmenovic and Xu Lin. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

No context found.

I. Stojmenovic, X. Lin, "Power-Aware Localized Routing in wireless networks," IEEE Transactions on Parallel and Distributed Systems,Vol. 12, No. 11, November 2001, 1122-1133.

No context found.

I. Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks," in Proc. IEEE Int. Parallel and Distributed Processing Symp., May 2000.

No context found.

I. Stojmenovic and X. Lin., "Power-aware localized routing in wireless networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122--1133, 2001. [Online]. Available: citeseer.nj.nec.com/stojmenovic00poweraware.html

No context found.

Stojmenovic I, Lin Xu. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems 2001; 12(11): 1122 -- 1133.

No context found.

I. Stojmenovic and X. Lin. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

No context found.

I. Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks," IEEE Trans. Parallel Distrib. Syst., vol. 12, no. 11, pp. 1122--1133, Nov. 2001.

No context found.

I. Stojmenovic and X. Lin. Power aware localized routing in wireless networks. In Proceedings of the 14th IEEE International Parallel and Distributed Processing Symposium (IPDPS'00), pp. 371--376, Cancun, Mexico, May 2000.

No context found.

I. Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks," Proc. IEEE IPDPS, Cancun, Mexico, May 2000, pp. 371-376.

No context found.

Ivan Stojmenovic and Xu Lin. Power aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11):1122--1133, November 2001.

No context found.

I. Stojmenovic and X. Lin., "Power-aware localized routing in wireless networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122--1133, 2001. [Online]. Available: citeseer.nj.nec.com/stojmenovic00poweraware.html

No context found.

I. Stojmenovic and X. Lin, "Power-aware localized routing in wireless networks," IEEE Trans. Parallel Distrib. Syst., vol. 12, no. 11, pp. 1122--1133, Nov. 2001.

No context found.

Ivan Stojmenovic and Xu Lin, "Power aware localized routing in wireless networks," in IEEE Transactions on Parallel and Distributed Syste, VOL. 12, NO. 11, Nov 2001.

No context found.

I. Stojmenovic & X. Lin, Power-aware localized routing in wireless networks, IEEE Trans. on Parallel and Distributed Systems, 12(11), 2001, 1122--1133.

No context found.

I. Stojmenovic and X. Lin, \Power-aware localized routing in wireless networks," in IEEE Int. Parallel and Distributed Processing Symp., 2000.

No context found.

Stojmenovic, I., and Lin, X. Power-aware localized routing in wireless networks. In IEEE Int. Parallel and Distributed Processing Symp. (2000).

No context found.

I. Stojmenovic and X. Lin. Power-aware Localized Routing in Wireless Networks. IEEE Int'l Parallel and Distributed Processing Symp., pages 371-376, 2000.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC