PowerAware Ad Hoc Routing TheCAT Web Services Overview功率感知的A Hoc路由猫 Web服务概述.pptVIP

11/07/00 Power-Aware Ad Hoc Routing Mobicom98 paper “Power-Aware Routing in Ad Hoc Networks” by Singh, Woo, and Raghavendra Presentation by – Harkirat Singh Motivation Conservation of power and power-aware routing must take into consideration Low Power Hardware - energy efficient displays - CPU’s with active and doze mode - low-power I/O devices Energy-efficient algorithms 40-70% saving in energy using PAMAS Other factors - average battery life in idle cellular phone – one day - DEC Roamabout 5.76 W transmission, 2.88 W receive, 0.35 W idle Listening Problem The Problem Shortest-hop rotes (green, blue, red) all use middle (black) node’s resources. It’s battery will die early. Fairness issue Routing packets through lightly loaded nodes also helps in energy expended in contention. Goal: Reduce the energy consumption of whole communication system Increase lifetime of nodes/network until partition Brief overview of Routing Protocols On-Demand Routing protocols - no up-to-date routes are maintained - Routes are created as an when basis: call passive convergence. Table-Driven Routing protocols - Each node maintains a table containing routing information to every other node in network: call active convergence. Dynamic source Routing Source-routed on-demand routing protocol Temporally-Ordered Routing Algorithm (TORA) Assign each node a “height” heuristic value based on various attributes A node with higher height called upstream and a node with lower height called downstream Route creation is done using QRY and UPD packets, results in DAG. In case of node failure, TORA floods a CLR (clear) packet. TORA – Route creation Height of destination assigned to 0 and all other set to NULL(i.e. undefined) Src broadcast a QRY packet with Dest id in it. Spine routing Algorithm (SRA) Nodes are assigned to cluster Clusters