Download presentation

Presentation is loading. Please wait.

Published byNoah Gunn Modified over 4 years ago

1
Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-hop Networks L. Li, J. Y. Halpern Cornell University P. Bahl, Y. M. Wang, and R. Wattenhofer Microsoft Research, Redmond

2
The Aladdin Home Networking System Powerline Network Phoneline Ethernet LAN Home Gateway Alert Router IM Email Wireless Sensor Network

3
OUTLINE Motivation Bigger Picture and Related Work Basic Cone-Based Algorithm –Summary of Two Main Results –Properties of the Basic Algorithm Optimizations –Properties of Asymmetric Edge Removal Performance Evaluation

4
Example of No Topology Control with maximum transmission radius R (maximum connected node set) High energy consumption High interference Low throughput Motivation for Topology Control

5
Network may partition Example of No Topology Control with smaller transmission radius

6
Global connectivity Low energy consumption Low interference High throughput Example of Topology Control

7
Bigger Picture and Related Work Routing MAC / Power-controlled MAC Selective Node Shutdown Topology Control Relative Neighborhood Graphs, Gabriel graphs, Sphere-of-Influence graphs, -graphs, etc. [GAF] [Span] [Hu 1993] [Ramanathan & Rosales- Hain 2000] [Rodoplu & Meng 1999] [Wattenhofer et al. 2001] Computational Geometry [MBH 01] [WTS 00]

8
Basic Cone-Based Algorithm (INFOCOM 2001) Assumption: receiver can determine the direction of sender –Directional antenna community: Angle of Arrival problem Each node u broadcasts Hello with increasing power (radius) Each discovered neighbor v replies withAck.

9
Cone-Based Algorithm with Angle Need a neighbor in every -cone. Can I stop? No! Theres an -gap!

10
Notation E = { ( u, v ) V x V: v is a discovered neighbor by node u } –G = (V, E ) –E may not be symmetric (B,A) in E but (A,B) not in E

11
Two symmetric sets E + = { ( u, v ): ( u, v ) E or ( v, u ) E } –Symmetric closure of E –G + = (V, E + ) E - = { ( u, v ): ( u, v ) E and ( v, u ) E } –Asymmetric edge removal –G - = (V, E - )

12
Summary of Two Main Results Let G R = (V, E R ), E R = { ( u, v ): d( u, v ) R } Connectivity Theorem –If 150, then G + preserves the connectivity of G R and the bound is tight. Asymmetric Edge Theorem –If 120, then G - preserves the connectivity of G R and the bound is tight.

13
The Why-150 Lemma 150 = 90 + 60

14
Counterexample for = 150 + Properties of the Basic Algorithm

15
Counterexample for = 150 +

17
For 150 ( 5 /6 ) Connectivity Lemma –if d(A,B) = d R and (A,B) E +, there must be a pair of nodes, one red and one green, with distance less than d(A,B).

18
Connectivity Theorem Order the edges in E R by length and induction on the rank in the ordering –For every edge in E R, theres a corresponding path in G +. If 150, then G + preserves the connectivity of G R and the bound is tight.

19
Optimizations Shrink-back operation –Boundary nodes can shrink radius as long as not reducing cone coverage Asymmetric edge removal –If 120, remove all asymmetric edges Pairwise edge removal –If < 60, remove longer edge e 2 e1e1 e2e2 A B C

20
Properties of Asymmetric Edge Removal Counterexample for = 120 +

21
For 120 ( 2 /3 ) Asymmetric Edge Lemma –if d(A,B) R and (A,B) E, there must be a pair of nodes, W or X and node B, with distance less than d(A,B).

22
Asymmetric Edge Theorem Two-step inductions on E R and then on E –For every edge in E R, if it becomes an asymmetric edge in G, then theres a corresponding path consisting of only symmetric edges. If 120, then G - preserves the connectivity of G R and the bound is tight.

23
Performance Evaluation Simulation Setup –100 nodes randomly placed on a 1500m-by-1500m grid. Each node has a maximum transmission radius 500m. Performance Metrics –Average Radius –Average Node Degree

24
Average Radius

25
Average Node Degree

26
In response to mobility, failures, and node additions Based on Neighbor Discovery Protocol (NDP) beacons –Join u (v) event: may allow shrink-back –Leave u (v) event: may resume Hello protocol –AngleChange u (v) event: may allow shrink-back or resume Hello protocol Careful selection of beacon power Reconfiguration

27
Distributed cone-based topology control algorithm that achieves maximum connected node set –If we treat all edges as bi-directional 150-degree tight upper bound –If we remove all unidirectional edges 120-degree tight upper bound Simulation results show that average radius and node degree can be significantly reduced Summary

Similar presentations

OK

DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad- Hoc Networks Injong Rhee (with Ajit Warrier, Jeongki Min, Lisong Xu) Department of Computer.

DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad- Hoc Networks Injong Rhee (with Ajit Warrier, Jeongki Min, Lisong Xu) Department of Computer.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on metro rail project Ppt on bodybuilding workouts Ppt on shell structures theory Ppt on power transmission system in automobile Ppt on mohandas karamchand gandhi Ppt on different internet services Sixth sense technology best ppt on robotics Convert pdf to ppt online mac Ppt on old movies vs new movies Ppt on social media and nurses