1. 1 QoS Topology Control and Energy Efficient Routing in Ad hoc Wireless Networks Prof. Xiaohua Jia Dept of Computer Science, City Univ of Hong Kong

2. 2 Mobile Ad Hoc (Wireless) Networks What’s a mobile ad hoc network? 1) Mobility 2) No wired infrastructure S

3. 3 Energy-efficiency in ad hoc networks Power function: p(u,v) = d α (u,v), 2 ≤ α ≤ 4 Two special features of radio transmission: 1) Broadcast in nature. 2) p(u,w) + p(w,v) < p(u,v), relaying messages by a third node may result in a smaller energy cost.

4. 4 Topology Control Problem Given a set of wireless nodes V in a plane, for each node u, adjust its transmission power to p(u), such that the network is fully connected and is minimized.

5. 5 R. Ramanathan, R. Rosales-Hain, “Topology control of multihop wireless networks using transmit power adjustment”, INFOCOM’00. 1 3 3 1 4 5 Greedy algorithm (based on Kruskal’s MST algorithm) Side-effect edge problem Distributed algorithms: LINT and LILT AB C D

6. 6 R. Wattenhofer, L. Li, P. Bahl and Y.M. Wang, “Distributed topology control for power efficient operation in multihop wireless ad hoc networks”, INFOCOM’01. α Theorem. Let α ≤ 2π/3. G’ is connected if G is connected. G: topology by max power; G’: topology by min power. Algorithm: 1)Divide uniformly a node’s region into cones with angle ; 1)Divide uniformly a node’s region into cones with angle α; 2)Increase a node-power until there is a neighbor in each cone, 2)Increase a node-power until there is a neighbor in each cone, or it reaches max power of the node. u

7. 7 N. Li, J. Hou and Lui Sha, “Design and Analysis of an MST-based Topology Control Algorithm”, IEEE INFOCOM’03. N. Li and J. Hou, “Topology control in heterogeneous wireless networks: problems and solutions”, IEEE INFOCOM’04. Algorithm: 1) Collect information about maximally reachable neighbors; 2) Construct a local MST (in terms of transmission power) among neighbors by each node; 3) Determine the actual power of each node (the neighbors of u in G’ are 1-hop nodes in u’s local MST). Theorem 1. G’ is connected if G is connected. Theorem 2. The degree of any node in G’ is bounded by 6.

8. 8 QoS topology control Given a set of nodes in a plane: B, max bandwidth capacity at a node. λ s,d, end-end traffic demand between s, d. Δ s,d, maximal hop-count allowed between s, d. Problem. Find transmission power p(i) for 0  i  n, such that λ s,d, for all pairs (s,d), can be routed within Δ s,d, and P max is minimized, where P max = max{p(i) | 0  i  n}.

9. 9 Traffic Non-splittable Formulations Variables: x i,j - boolean, x i,j = 1 if there is a link from node i to node j; otherwise, x i,j = 0. - boolean, = 1 if the route from s to d goes through the link (i,j); otherwise = 0. - boolean, = 1 if the route from s to d goes through the link (i,j); otherwise = 0. P max - the maximum transmitting power of nodes.

10. 10 Traffic non-splittable Objective : Min P max Topology constraints: Transmission power constraint: Delay constraint: i i j j’

11. 11 Traffic non-splittable Bandwidth constraint: Flow constraints: Binary constraint:

12. 12 Traffic non-splittable Topology of six nodes and six requests Tab. 2. The QoS requests and their routes for Fig. 2 Non-splittable case Splittable case

13. 13 Trarffic Splittable Formulation Topology constraints: Transmission power constraint: Variables: and P max remain the same. - amount of (s, d)’s traffics going through link (i, j). Objective : Min P max i j j’

14. 14 Formulation (cont’d) Bandwidth constraint: Flow constraints: Variable constraints:

15. 15 Two steps of solution Step 1. QoS load-balanced routing L max : maximal node-load Problem. Given a network graph G and traffic demands between node pairs, route these traffics in this graph, such that L max minimized.

16. 16 Formulation of QoS routing problem Objective : Min L max Constraints:

17. 17 Step 2. QoS topology control Algorithm: 1) sort all node-pairs (i,j) in ascending order according to their distance d(i,j). 2) pick up the node-pair with closest distance but not yet connected and increase the power to make them connected. 3) run the QoS routing algorithm on G to obtain L max. If L max ≤ B, then stop; otherwise repeat (b) and (c).

18. 18 Experimental results (a) λ = 0.02B(b) = 0.1B (c) λ = 0.2B (d) λ = 0.32B

19. 19 Experimental results Node-degrees versus λ m X. Jia, D. Li, and D. Du, “QoS topology control in ad hoc wireless networks”, INFOCOM’04.

20. 20 Routing Protocols in Ad Hoc Networks Proactive protocols (routing table based), such as DSDV (Destination Sequenced Distance Vector), OLSR (Optimized Link State Routing), etc. Proactive protocols (routing table based), such as DSDV (Destination Sequenced Distance Vector), OLSR (Optimized Link State Routing), etc. On-demand protocols (reactive protocols), such as DSR (Dynamic Source Routing), AODV (Ad- hoc On-demand Distance Vector), etc. On-demand protocols (reactive protocols), such as DSR (Dynamic Source Routing), AODV (Ad- hoc On-demand Distance Vector), etc. Virtual backbone based protocols, such as Spine-based method, clustering method, hierarchical protocols, etc. Virtual backbone based protocols, such as Spine-based method, clustering method, hierarchical protocols, etc.

21. 21 D. B. Johnson, D. A. Maltz, Y.C. Hu, and J. G. Jetcheva, The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks, http://www.ietf.org, draft-ietf-manet-dsr-05.txt, Mar 01. Dynamic Source Routing (DSR): 1. Source s finds a route to destination d by flooding a Rreq packet. 2. d replies a Rrep packet to s by reversing the route appended to the Rreq. 3. s includes the route to d in each data packet to d (called source routing).

22. 22 Route Caching in DSR Each node learns routing information from both Rreq and Rrep packets and caches the routes. Each node learns routing information from both Rreq and Rrep packets and caches the routes. When a node receives a Rreq to d and it has a valid route in its cache, it replies the route to s. When a node receives a Rreq to d and it has a valid route in its cache, it replies the route to s.

23. 23 Charles E. Perkins, E. M. Royer and Samir R. Das, “Ad-hoc On-Demand Distance Vector (AODV) Routing”, draft-ietf- manet-aodv-08.txt, http://www.ietf.org, Mar 2001.http://www.ietf.org Charles E. Perkins, E. M. Royer and Samir R. Das, “Ad-hoc On-Demand Distance Vector (AODV) Routing”, draft-ietf- manet-aodv-08.txt, http://www.ietf.org, Mar 2001.http://www.ietf.org AODV (Ad-hoc On-demand Distance Vector) It is similar to DSR in route discovery, but improves DSR by keeping routing tables (next-hop) at nodes (no route info in data packets). It is similar to DSR in route discovery, but improves DSR by keeping routing tables (next-hop) at nodes (no route info in data packets). When a node receives a Rreq, it sets up a reverse path to the source in its routing table. When a node receives a Rreq, it sets up a reverse path to the source in its routing table. Rrep travels along the reverse set-up path to s and the forward-path (i.e., the route from s to d) is set up as the Rrep travels to s. Rrep travels along the reverse set-up path to s and the forward-path (i.e., the route from s to d) is set up as the Rrep travels to s. Entries in routing table are purged after a timeout. Entries in routing table are purged after a timeout.

24. 24 C. E. Perkins and Pravin Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, ACM SIGCOMM, Oct 1994, pp.234-244. Destination Sequence Distance Vector Routing: It mimics the Distance Vector Routing. It mimics the Distance Vector Routing. Each node keeps a routing table: next-hop and distance to each destination, and dest-sequnce-no. Each node keeps a routing table: next-hop and distance to each destination, and dest-sequnce-no. Each node periodically exchange the routing table with neighbors. Each node periodically exchange the routing table with neighbors. Data packets are forwarded towards destinations by using the next-hop info in routing tables on the way. Data packets are forwarded towards destinations by using the next-hop info in routing tables on the way.

25. 25 Power-Aware Routing Define optimization goals on energy cost for routing, e.g., minimum energy cost per packet, maximum network lifetime, maximum minimum residual energy. Define optimization goals on energy cost for routing, e.g., minimum energy cost per packet, maximum network lifetime, maximum minimum residual energy. Assign a weight to each link according to optimization goal, e.g., energy cost over a link, residual energy at nodes. Assign a weight to each link according to optimization goal, e.g., energy cost over a link, residual energy at nodes. Perform routing with minimum weight. Perform routing with minimum weight.

26. 26 Energy Efficient Broadcasting To determine, for each node u: 1) Transmission power of u, and 2) The children of u. T s : broadcast tree rooted from source s; NL(T s ): set of non-leaf nodes of T s. Problem. Given a set of nodes in a plane, for each node u, adjust its transmission power p(u), to form a T s, such that: S

27. 27 J. Cartigny, D.Simplot, and I. Stojmenovic, “Localized minimum-energy broadcast in ad-hoc networks”, IEEE INFOCOM’03. Algorithm: 1) Construct a connected topology that has min total energy. 2) Derive the broadcast tree from the min-energy topology using neighbor elimination scheme. S

28. 28 J.E. Wieselthier, G. D. Nguyen, and A. Ephremides, “On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks”, IEEE Infocom’00. BIP (broadcast incremental power): 1)It is based on Prim’s MST algorithm. 2)Starting from s, each time a new node that can be connected by a tree-node with least incremental power is added to the tree, until all nodes are in the tree. s

29. 29 Energy Efficient Broadcast with Given Transmission Power p(v): transmission power of node v; T s : broadcast tree rooted from source s; NL(T s ): set of non-leaf nodes of T s. Problem. Given a set of nodes in a plane and p(v) for each node v, find a T s that:

30. 30 Transforming the problem to the Steiner tree problem The broadcast routing problem is transformed to: finding a directed tree T s ’ in G’ that spans all nodes in V’ and the total weights of T s ’ is minimized.

31. 31 A Greedy Heuristic U: uncovered set; D: covered set; V i : set of outgoing neighbors of node i; 1) D ←V s ; U ← V – V s ; 2) Pick from D a node i that has the largest value of: | V i ∩U|/p(i); D ← D + V i ; U ← U - V i ; 3) Repeat step 2 until D = V.

32. 32 A Node-weighted Steiner Tree Based Heuristic Theorem 1. Given G(V, E) and s, this heuristic can output a broadcast tree in time O(n 4 ). Theorem 2. The approximation ratio is at most 2ln(n-1)+1.

33. 33 Experimental Results D. Li, Xiaohua Jia and H. Liu, "Energy efficient broadcast routing in ad hoc wireless networks", IEEE Trans on Mobile Computing, Vol. 3, No. 2, Apr - Jun, 2004, pp.144-151.

34. 34 Energy-Balanced Multicast Routing Given a wireless network G(V,E): E i – initial energy at node i. w i,j – power cost per time-unit on link l i,j, w i,j = d α i,j. Problem. For a multicast request (s, D, t), find a routing tree, such that the minimal remaining energy of nodes is maximized after the multicast session. S. Cheng, X. Jia, F. Hung, and Y. Wang, “Energy efficient broadcasting and multicasting in static wireless ad hoc networks”, IEEE Trans on Wireless Communications.

35. 35 Maximizing broadcast/multicast duration routing Given a wireless network G(V,E): E i – initial energy at node i; w i,j – power cost per time-unit on link l i,j. Problem. Find a set of broadcast / multicast trees, such that the duration of the broadcast / multicast session is maximized.

36. 36 The End