2003/04/24AARON LEE 1 An Efficient K-hop Clustering Routing Scheme for Ad-Hoc Wireless Networks S....

2003/04/24 AARON 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

AARON LEE 22003/04/24

Outline

Introduction

K-hop Clustering Routing Algorithm

Simulation Results

Conclusions

AARON LEE 32003/04/24

Introduction - Routing Protocol Strategy: proactive or reactive

Proactive (Table-Driven) :DSDV 、 RIP 、 OSPF

Reactive (On-Demand): AODV 、 DSR

Hybrid : ZRP

AARON LEE 42003/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)

AARON LEE 52003/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

AARON LEE 62003/04/24

Introduction - k-hop Clustering Consideration of k-hop

Network size Flexible K value

Clustering algorithm Routing algorithm Maintenance mechanism

AARON LEE 72003/04/24

Notations V the set of nodes in the network Nk (v) the set of k-hop neighbors of v

Nk [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

}1)deg(),(|{ xvNxxL kv

})(],[|{ BxlabelvNxxB kkv

})(],[|{ FxlabelvNxxF kkv

AARON LEE 82003/04/24


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

AARON LEE 92003/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


AARON LEE 102003/04/24

Step 2, find sv

every node calculate r1(v),


vLu

vudvr ),()(1

Rylabel

IDwithsyrBylet

sif

Buurs

BvlabelwithVv

periodexecutiontheduring

vv

v

vv

)(

min)(,

0

}|)(max{

)(

:

11

11

AARON LEE 112003/04/24


For every cluster head y

AARON LEE 122003/04/24

Step 3, find tv

for every node v from step2, calculate r2(v),


||)(2kvBvr

Rylabel

IDwithtyrBylet

Buurt

StepinswithVv

periodexecutiontheduring

vv

vv

v

)(

min)(,

}|)(max{

20

:

21

12

AARON LEE 132003/04/24


AARON LEE 142003/04/24


AARON LEE 152003/04/24


AARON LEE 162003/04/24

Cluster


AARON LEE 172003/04/24

Cluster


AARON LEE 182003/04/24

Cluster


AARON LEE 192003/04/24

Cluster


AARON LEE 202003/04/24


AARON LEE 212003/04/24


AARON LEE 222003/04/24


AARON LEE 232003/04/24


AARON LEE 242003/04/24


AARON LEE 252003/04/24


AARON LEE 262003/04/24


AARON LEE 272003/04/24

Form a cluster head


AARON LEE 282003/04/24

Cluster maintenance node’s switch on node’s shut down node’s move

Intra-Cluster link change Inter-Cluster link change


AARON LEE 292003/04/24

Cluster maintenancenode’s switch on


AARON LEE 302003/04/24

Cluster maintenancenode’s shut downnode’s move

Inter-Cluster link change


AARON LEE 312003/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


AARON LEE 322003/04/24

Case1: stay in original cluster

Case2: join other cluster


AARON LEE 332003/04/24

Case3: neither Case1 nor Case2

=>form a new cluster head


AARON LEE 342003/04/24

Cluster head’s retire A cluster head v should retire when

)()(,)(..

)(),(1

vncmuncmkuhthts

vudomvNu


AARON LEE 352003/04/24

Improve the ZRP

Intra-Cluster Routing

Inter-Cluster Routing

Routing Maintenance

k-hop Clustering Routing Algorithm- Routing algorithm

AARON LEE 362003/04/24

Intra-Cluster Routing

InterCluster Routing


AARON LEE 372003/04/24

Route request packet forward:


AARON LEE 382003/04/24



AARON LEE 392003/04/24



AARON LEE 402003/04/24



AARON LEE 412003/04/24



AARON LEE 422003/04/24



AARON LEE 432003/04/24



AARON LEE 442003/04/24



AARON LEE 452003/04/24

Routing Maintenance


AARON LEE 462003/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

AARON LEE 472003/04/24

Simulation Results

Number of Clusters

Number of clusters vs. number of nodes (k=2, tx_range=100m)

0

10

20

30

40

100 250 500 750 1000Number of nodes

Num

ber

of c

lust

ers

Lowest IDOurs

AARON LEE 482003/04/24

Simulation Results

Number of Clusters

Number of clusters vs. number of nodes (k=3,tx_range=100m)

05

1015202530

100 250 500 750 1000

Number of nodes

Num

ber o

f clu

ster

s Lowest ID

Ours

AARON LEE 492003/04/24

Simulation Results

Stability of cluster

Number of role changes vs. tx_range (200nodes, 10m/s)

0

200

400

600

800

1000

1200

1400

150 200 250 300Tx_range

Num

ber

of r

ole

chan

ges

LCC Lowest ID (k=2)Ours (k=2)LCC Lowest ID (k=3)Ours (k=3)

AARON LEE 502003/04/24

Simulation Results

Stability of cluster

Number of clustre switches vs. tx_range ( 200nodes, 10m/s)

0

2000

4000

6000

8000

10000

150 200 250 300Tx_range

Num

ber

of

clust

er

swit

ches

LCC Lowest ID (k=2)Ours (k=2)LCC Lowest ID (k=3)Ours (k=3)

AARON LEE 512003/04/24

Simulation Results

Stability of cluster mobility

Number of role changes vs. tx_range (200 nodes)

0

500

1000

1500

2000

2500

3000

3500

100 150 200 250 300Tx-ran g e

Num

ber o

f rol

e ch

ange

s

Ours 2-hop 1 m/sOurs 2-hop 10 m/sOurs 2-hop 25 m/sOurs 3-hop 1 m/sOurs 3-hop 10 m/sOurs 3-hop 25 m/s

AARON LEE 522003/04/24

Simulation Results

Stability of cluster mobility

Number of cluster switches vs. tx_range (200nodes)

0

2000

4000

6000

8000

10000

12000

100 150 200 250 300Tx-ran g e

Num

ber o

f clu

ster s

witc

hes Ours 2-hop 1 m/s

Ours 2-hop 10 m/sOurs 2-hop 25 m/sOurs 3-hop 1 m/sOurs 3-hop 10 m/sOurs 3-hop 25 m/s

AARON LEE 532003/04/24

Simulation Results

Number of RREQ packet forward times

AARON LEE 542003/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.

AARON LEE 552003/04/24

Date post:	05-Jan-2016
Category:	Documents
Upload:	joseph-sydney-martin
View:	214 times
Download:	0 times

2003/04/24AARON LEE 1 An Efficient K-hop Clustering Routing Scheme for Ad-Hoc Wireless Networks S....

Documents