M. Woo S. Singh and C. S. Raghavendra. Power-aware routing in mobile ad hoc networks. In International Conference on Mobile Computing and Networking, pages 181--190, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is absolutely essential for connecting two of its neighbors. Furthermore, Span explicitly attempts to preserve the same overall system capacity as the underlying network where all nodes are awake, which ensures that no increase in congestion occurs. The PAMAS power saving medium access protocol [18, 23] turns off a node s radio when it is overhearing a packet not addressed to it. This approach is suitable for radios in which processing a received packet is expensive compared to listening to an idle radio channel. Kravets and Krishnan [13] present a system in which mobile units wake up ....

SINGS, S., WOO, M., AND RAGHAVENDRA, C. S. Power-Aware Routing in Mobile Ad Hoc Networks. In Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom) (Dallas, TX, 1998).

.... forward error correction schemes in the link layer is studied from energy efficiency perspective in [23] Power aware MAC protocols for wireless ad hoc networks have been studied in [36] A case for using new power aware metrics for determining routes in wireless ad hoc networks is presented in [42]. A collection of papers on energy efficiency in wireless networks is available in [46] The chief sources of energy consumption in the mobile unit due to MAC related activities are the CPU, the transmitter, and the receiver. Mobile CPU usage may be reduced by relegating most of the ....

M. Woo, S. Singh, and C. S. Raghavendra. Power aware routing in mobile ad hoc networks. In Dallas, TX, (Oct. 1998). To appear.

.... ensure that messages sent by A arrive at B in the same order (FIFO property) 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 ....

M. Woo, S. Singh, and C. S. Raghavendra. Power-Aware Routing in Mobile Ad Hoc Networks. In Mobicom 98, Dallas, USA, October 1998.

....powered by batteries. In recent years, considerable amount of research has gone into designing power conscious routing schemes, with a view to minimizing energy consumption at the nodes and thereby prolonging the life of the overall communication system. See http: sensorweb.jpl.nasa.gov In [1], Woo, Singh and Raghavendra propose a multi tier power conservation approach, optimizing the MAC layer, network layer and transport layer protocols individually. The routing algorithm they propose and implement involves choosing the minimum residual energy path so as to minimize the total node ....

M. Woo, S. Singh, and C.S. Raghavendra, "Power-aware routing in mobile ad hoc networks", Proc. 4'h AnnuaI ACM/IEEE Intl. Conf on Mobile Computing & Networking, pp. 181-190, 1998.

....depend on local information. The key design challenge is to derive the required global properties based on these localized algorithms. In previous work, the general problem of designing poweraware protocols to construct power efficient routes has been extensively studied [1] 2] 3] 4] [5], particularly in the backdrop of stationary ad hoc networks such as sensor networks. The general assumption is that each node is able to dynamically adjust its transmission range to reach fewer neighboring nodes, thus saving power whenever possible. Various goals may be achieved by such ....

M. Woo S. Singh and C. Raghavendra, "Power-aware Routing in Mobile Ad-hoc Networks," in Proceedings of the Fourth ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom '98), 1998, pp. 181--190.

.... (FEC) mechanisms may be used to conserve power (i.e. tradeo retransmissions with ARQ versus longer packets with FEC) as in (Lettieri et al. 1997) Energy ecient routing protocols may be achieved by establishing routes that ensure that all nodes equally deplete their battery power, as studied in (Woo et al. 1998, Chang and Tassiulas, 2000) This helps balance the amount of trac carried by each node. A related mechanism is to avoid routing through nodes with lower battery power, but this requires a mechanism for dissemination of node battery power. Also, the periodicity of routing updates can be reduced ....

....update messages consume precious bandwidth. 2. Use infrequent topology updates resulting in decreased update messages, but inecient routing and occasionally missed packets results. Typical metrics used to evaluate ad hoc routing protocols are shortesthop, shortest delay, and locality stability (Woo et al. 1998). However, these metrics may have a negative e ect in wireless networks because they result in the overuse of energy resources of a small set of mobiles, decreasing mobile and network life. For example, consider the wireless network in Figure 5. Using shortest hop routing, trac from mobile A ....

[Article contains additional citation context not shown here]

Woo, M., S. Singh, and C. S. Raghavendra: 1998, `Power aware routing in mobile ad hoc networks'. In: Proc. ACM MobiCom. Dallas, TX, pp. 181-190.

....algorithms, on the other hand, typically require the knowledge of the locations of all nodes in the network, and also the information about the existence of every edge in the graph. All non localized routing algorithms proposed in literature are variations of shortest weighted path algorithm (e.g. [CN, LL, SWR]) Although ad hoc network is fairly accurately modeled by unit graphs, nodes that are at distance less than R may have an obstacle between them blocking the communication, while two nodes at distance that exceeds R by a small amount may still be able to communicate (or a node may even choose ....

S. Singh, M. Woo, C.S. Raghavendra, Power-aware routing in mobile ad hoc networks, Proc. MOBICOM, 1998, 181-190.

....analysis on ad hoc routing protocol evaluation, DSR was modi ed to make route selection decisions based on energy information instead of hop counts. 4.2.1 Energy aware DSR There has been a fair amount of work on alternative wireless ad hoc routing protocols to address energy eciency problem. [8] proposed that the routing decision be based on shortest cost in terms of di erent power aware metrics. 12] provides energy conserving routing for static, power controlled wireless ad hoc networks. Their algorithm is based on a prior knowledge of the trac, i.e. the sets of the origin and ....

Mike Woo; Suresh Singh; C. S. Raghavendra. Power-aware routing in mobile ad hoc networks. SIGCOMM '98.

.... energy conservation modes Resource Protection Allocation Fair distribution of battery life among both local and distributed tasks, locking battery for expensive operations Communication Adaptive network polling, energy aware routing, placement of distributed computation, and server binding [27, 13, 28, 25, 26] Table 1. Operating system functionality along with potential techniques for optimizing energy utilization. rics for picking energy efficient routes in ad hoc networks, energy efficient placement of distributed computation, and flexible RPC name binding that accounts for power consumption. These ....

.... transmission power in route discovery protocols, iii) balancing hop count and latency against power consumption in choosing the best route between two hosts, and iv) choosing routes to fairly distribute the routing duties (and the associated power consumption) among nodes in an ad hoc network [27]. Our initial investigations exploit the following property of wireless communication: received signal strength decreases exponentially with increased distance from the transmitter. In the simplest model, the signal decreases with the square of the distance from the transmitter [24] and ....

S. Singh, M. Woo, and C. S. Raghavendra. Power-Aware Routing in Mobile Ad Hoc Networks. In The Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 181--190, 1998.

....2.88 watts during reception and 0.35 watts when idle. The radio used in [GFM] consumes 15 watts while transmitting, 11 watts while receiving and 50mW in idle mode. Low power displays, I O devices, CPU s and algorithms to reduce power consumption of disk drives are being developed (cf. [SWR]) We see a clear need for improvement in the power consumption in existing MAC protocols and routing algorithms: in almost all of the current protocols, nodes are powered on most of the time even when they are doing no useful work [SC, SR, SWR] Power saving asynchronous communication protocols ....

.... power consumption of disk drives are being developed (cf. SWR] We see a clear need for improvement in the power consumption in existing MAC protocols and routing algorithms: in almost all of the current protocols, nodes are powered on most of the time even when they are doing no useful work [SC, SR, SWR]. Power saving asynchronous communication protocols were discussed in [CZ, SC, SR] Global Position System (GPS) provides location information (latitude, longitude and possibly height) to hosts in ad hoc wireless network. The location information allows each node to adjust the transmission power ....

[Article contains additional citation context not shown here]

S. Singh, M. Woo, C.S. Raghavendra, Power-aware routing in mobile ad hoc networks, Proc. MOBICOM, 1998, 181-190.

....etc. via data, video and or voice from one rescue team member to another over a small handheld or wearable wireless device. Again, this applies to law enforcement personnel as well. Current challenges for ad hoc wireless networks include: a) multicast, b) QoS support, c) power aware routing [20], and (d) location aided routing [12] As mentioned above, multicast is desirable to support multi party wireless communications. Since the multicast tree is no longer static (i.e. its topology is subject to change over time) the multicast routing protocol must be able to cope with mobility, ....

S. Singh, M. Woo, and C. S. Raghavendra, "Power-Aware Routing in Mobile Ad Hoc Networks," Proceedings of ACM/IEEE MOBICOM '98, October 1998.

....we may introduce a secondary measure of path length (hop count remains the primary measure) The secondary measure can be chosen in various ways. One can estimate the propagation delay, if there exist a reliable way of measuring it. Another option is to use a power consumption measure from [SWR, SL2]. Based on the remaining battery power, each node has a certain level of reluctance to accept further messages, and a sum of these reluctance levels on a given path can be considered as the secondary measure. The next option can be based on the use of Global Position System (GPS) that provides the ....

S. Singh, M. Woo, C.S. Raghavendra, Power-aware routing in mobile ad hoc networks, Proc. MOBICOM, 1998, 181-190. 15

....(in time proportional to the number of edges) and may select the first neighbor on the route to all destinations. This algorithm provides the shortest paths if the location information is reasonably accurate and all nodes are active. However, such shortest path (SP) algorithm (proposed also in [BCS, SWR], and used in this paper as the benchmark) does not adapt to sleep period operations, since the shortest paths can be broken by inactive nodes. Even if this information is updated with node s position, the unit graph model assumed here is merely a reasonably good approximation of the actual ....

....that have excellent delivery rates, short hop counts, small flooding ratios and power efficiency is far from over even for the case of static nodes. 2 hop variants of flooding or multiple path methods may be studied. Since the battery power is not expected to increase significantly in the future [SWR] and the ad hoc networks, on the other hand, are booming, power aware routing schemes need further investigation. We prepared a separate paper on the subject [SL] Next, BMSU] designed a routing algorithm that guarantees the message delivery in unit graphs without the use of any flooding based ....

S. Singh, M. Woo, C.S. Raghavendra, Power-aware routing in mobile ad hoc networks, Proc. MOBICOM, 1998, 181-190.

....as route selection metric, some nodes need to support many routes (i.e. have high route relaying load) These nodes continuously consume energy and their energy will eventually be exhausted, resulting in node failures. Route selection should also consider energy reserves as one of the factor [28]. ABR uses route relaying load as one of its metric and prevents node failures of this kind. However, this is not the case for DSR. 4 Conclusions Many routing protocols for ad hoc mobile wireless networks have been proposed in recent years. In this paper, we have reviewed and studied key ....

S. Singh, M. Woo, and C.S. Raghavendra, "Power-Aware Routing in Mobile Ad Hoc Networks," In Proceedings of ACM/IEEE MOBICOM'98, Dallas, TX, Oct. 1998, pp. 181-190.

....even more on the remaining nodes and links, and worsen the situation. Therefore, a desirable behavior of an ad hoc routing protocol is a low variance of node lifetime. Ideally, all nodes in the network should run out of power about the same time. By using power aware metrics suggested in [8], for instances, cost packet and maximum node cost, along with delay and distance, node and network life could be extended. In SARP, a node with low power could avoid routing packets by increasing its hop count as a simple power routing mechanism. We will focus more on power routing in future ....

Mike Woo, Suresh Singh and C.S. Raghavendra. "PowerAware Routing in Mobile Ad Hoc Networks," Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'98), Dallas, Texas, USA, October 25-30, 1998.

....crucial in coping with very low bandwidth links and decreasing transmitter power consumption by reducing the packet sizes. At the network layer, routing algorithms may use the total transmission power necessary to route packets from source to destination in selecting the routes in ad hoc networks [18]. At the transport and application layers, the traffic models of the streams are important in designing when and how long to put the respective network cards into sleep mode [19] Stemm [20] points out that network interface cards consume as much power as the PDAs, hence strategies that will put ....

S. Sing, M. Woo, and C. S. Raghavendra, "Power-Aware Routing in Mobile Ad-Hoc Networks," in MOBICOM Conference Proceedings, 1998.

No context found.

M. Woo S. Singh and C. S. Raghavendra. Power-aware routing in mobile ad hoc networks. In International Conference on Mobile Computing and Networking, pages 181--190, 1998.

No context found.

Woo, M., Singh, S., and Raghavendra, C. Power aware routing in mobile ad-hoc networks. In ACM Mobicom (1998).

No context found.

M. Woo S. Singh and C. Raghavendra, "Power-aware Routing in Mobile Ad-hoc Networks," in Proceedings of the Fourth ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom '98), 1998, pp. 181--190.

No context found.

S.M. Woo, S. Singh, C. S. Raghavendra, "Power-Aware Routing in Mobile Ad Hoc Networks," Proc. of IEEE/ACM Mobicom 1998, pp. 513-529.

No context found.

M. Woo, S. Singh, and C. S. Raghavendra. Power-Aware Routing in Mobile Ad Hoc Networks. In Mobicom 98, Dallas, USA, October 1998.

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