1. 2003/04/24AARON LEE 1 An Efficient K-hop Clustering Routing Scheme for Ad-Hoc Wireless Networks S. F. Hwang, C. R. Dow Journal of the Internet Technology, 2002

2. AARON LEE2 2003/04/24 Outline Introduction K-hop Clustering Routing Algorithm Simulation Results Conclusions

3. AARON LEE3 2003/04/24 Introduction - Routing Protocol Strategy: proactive or reactive Proactive (Table-Driven) :DSDV 、 RIP 、 OSPF Reactive (On-Demand): AODV 、 DSR Hybrid : ZRP

4. AARON LEE4 2003/04/24 Introduction - Clustering Advantages maintain local information only data flooding avoidance hierarchical architecture Distributed clustering algorithms Lowest ID High Connectivity Least Cluster Change (LCC)

5. AARON LEE5 2003/04/24 Introduction - Clustering Least Cluster Change (LCC) use lowest id rule to select header Non-header movement Move to another cluster Move to a no cluster position Header movement Competition Retirement

6. AARON LEE6 2003/04/24 Introduction - k-hop Clustering Consideration of k-hop Network size Flexible K value Clustering algorithm Routing algorithm Maintenance mechanism

7. AARON LEE7 2003/04/24 Notations V the set of nodes in the network N k (v) the set of k-hop neighbors of v N k [v] the set of k-hop neighbors of v, include v d(u, v) hop distance between u and v deg(v) degree of v _ k-hop Clustering Routing Algorithm - Clustering algorithm

8. AARON LEE8 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm Cluster information (id(v), dom(v), deg(v), hth(v), next(v), ncm(v), gw(v)) id(v) id of v dom(v) cluster head of v deg(v) degree of v hth(v) minimum hops to cluster head next(v) next node of v ncm(v) number of cluster members gw(v) gateway node or not

9. AARON LEE9 2003/04/24 Step 0, initialize cluster information (id(v), null, 0, null, null, 0, false) status ‘B’ Step 1, collect k-hop information every node broadcast its information (cluster information, status) to k-hop neighbors k-hop Clustering Routing Algorithm - Clustering algorithm

10. AARON LEE10 2003/04/24 Step 2, find s v every node calculate r 1 (v), k-hop Clustering Routing Algorithm - Clustering algorithm

11. AARON LEE11 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm For every cluster head y

12. AARON LEE12 2003/04/24 Step 3, find t v for every node v from step2, calculate r 2 (v), k-hop Clustering Routing Algorithm - Clustering algorithm

13. AARON LEE13 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

14. AARON LEE14 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

15. AARON LEE15 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

16. AARON LEE16 2003/04/24 Cluster k-hop Clustering Routing Algorithm - Clustering algorithm

17. AARON LEE17 2003/04/24 Cluster k-hop Clustering Routing Algorithm - Clustering algorithm

18. AARON LEE18 2003/04/24 Cluster k-hop Clustering Routing Algorithm - Clustering algorithm

19. AARON LEE19 2003/04/24 Cluster k-hop Clustering Routing Algorithm - Clustering algorithm

20. AARON LEE20 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

21. AARON LEE21 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

22. AARON LEE22 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

23. AARON LEE23 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

24. AARON LEE24 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

25. AARON LEE25 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

26. AARON LEE26 2003/04/24 k-hop Clustering Routing Algorithm - Clustering algorithm

27. AARON LEE27 2003/04/24  Form a cluster head k-hop Clustering Routing Algorithm - Clustering algorithm

28. AARON LEE28 2003/04/24 Cluster maintenance node’s switch on node’s shut down node’s move Intra-Cluster link change Inter-Cluster link change k-hop Clustering Routing Algorithm - Clustering algorithm

29. AARON LEE29 2003/04/24  Cluster maintenance  node’s switch on k-hop Clustering Routing Algorithm - Clustering algorithm

30. AARON LEE30 2003/04/24  Cluster maintenance  node’s shut down  node’s move Inter-Cluster link change k-hop Clustering Routing Algorithm - Clustering algorithm

31. AARON LEE31 2003/04/24  Cluster maintenance  node’s shut down  node’s move Intra-Cluster link change  Case1 can stay in original cluster  Case2 can join other cluster  Case3 neither Case1 nor Case2 k-hop Clustering Routing Algorithm - Clustering algorithm

32. AARON LEE32 2003/04/24 Case1: stay in original cluster Case2: join other cluster k-hop Clustering Routing Algorithm - Clustering algorithm

33. AARON LEE33 2003/04/24 Case3: neither Case1 nor Case2 =>form a new cluster head k-hop Clustering Routing Algorithm - Clustering algorithm

34. AARON LEE34 2003/04/24  Cluster head’s retire  A cluster head v should retire when k-hop Clustering Routing Algorithm - Clustering algorithm

35. AARON LEE35 2003/04/24 Improve the ZRP Intra-Cluster Routing Inter-Cluster Routing Routing Maintenance k-hop Clustering Routing Algorithm - Routing algorithm

36. AARON LEE36 2003/04/24  Intra-Cluster Routing  InterCluster Routing k-hop Clustering Routing Algorithm - Routing algorithm

37. AARON LEE37 2003/04/24 Route request packet forward: k-hop Clustering Routing Algorithm - Routing algorithm

38. AARON LEE38 2003/04/24 Route request packet forward: k-hop Clustering Routing Algorithm - Routing algorithm

39. AARON LEE39 2003/04/24 Route request packet forward: k-hop Clustering Routing Algorithm - Routing algorithm

40. AARON LEE40 2003/04/24 Route request packet forward: k-hop Clustering Routing Algorithm - Routing algorithm

41. AARON LEE41 2003/04/24 Route request packet forward: k-hop Clustering Routing Algorithm - Routing algorithm

42. AARON LEE42 2003/04/24 Route request packet forward: k-hop Clustering Routing Algorithm - Routing algorithm

43. AARON LEE43 2003/04/24 Route request packet forward: k-hop Clustering Routing Algorithm - Routing algorithm

44. AARON LEE44 2003/04/24 Route request packet forward: k-hop Clustering Routing Algorithm - Routing algorithm

45. AARON LEE45 2003/04/24  Routing Maintenance k-hop Clustering Routing Algorithm - Routing algorithm

46. AARON LEE46 2003/04/24 Simulation Results  Environment  Area: 1000m*1000m  Number of nodes :100-200 Nodes  Tx_range: 100-300 m  Simulation Time: 300 secs  Speed: 1-25 m/s  Move mode: Random Way-Point

47. AARON LEE47 2003/04/24 Simulation Results  Number of Clusters

48. AARON LEE48 2003/04/24 Simulation Results Number of Clusters

49. AARON LEE49 2003/04/24 Simulation Results Stability of cluster

50. AARON LEE50 2003/04/24 Simulation Results Stability of cluster

51. AARON LEE51 2003/04/24 Simulation Results Stability of cluster  mobility

52. AARON LEE52 2003/04/24 Simulation Results Stability of cluster  mobility

53. AARON LEE53 2003/04/24 Simulation Results Number of RREQ packet forward times

54. AARON LEE54 2003/04/24 Conclusions  We propose a k-hop clustering routing algorithm.  The number of clusters is less than others.  The stability of network is better.  Only cluster heads maintain the routing table.  Less route discovery overhead, especially during local communication.  Easy and quick broken link recovery.

55. AARON LEE55 2003/04/24