無線隨意網路中提供備援路徑的叢集繞送法

  

  

  

  

























































































E-mail

[email protected]

















              ! "#  $% & '   () * + , - . / 0 ! 1 2  3 4  5 6  7 8 ) * 9 : ; <= > ?
@ A  + , & '  / 0 ; <B ; <C D EF G 7 HI J  ?H 3 4) * ; <C D EKL - . MN> 9 : - . - .    O  > ?P Q R S 3 4
T U V  W X YZ [\ ]   ^ _`
; </ 0 a
- . / 0 b c d ef Q g h ijk l m n $% o Up2   q rs t
R S 3 4u v R w 4x p2 y z{ | \ y` } ~ €  ‚ > ?ƒ „ g … † y‡ˆy> ‰ Š ‹ Œ Ž   ‘ ’m n “$% yp2 q r  (” • –6 —˜ & '   ™ š(> ?› œ 3 4‡ ?ž P Q Ÿ r3 4Y



 & '   - .    

1.

















¡ ¢ £ ¤  o U¥ ¦ § ¨ © ª « ¬ ­® ¯ 1 2 ° ˆ± r ² ³ ?ž MN´µ ¶ * ± r· · ¸¹ º        ” • – 6 » H ¼    © ª‘ ½ ¾ œ ¿ À 
© ª " # Á $ %      >  :  U   Ã Ä  

ProactiveÅReactiveÆHybrid    

Proactive    Ç È Étable-drivenÊ UM NË Ì Í o Î   ÏÐ(route table)6 Ñ Ò  MNR wÓÊ Ô o Õ Ö× Ê UMNØ Ù Ú Û y” Ü wÝÞ ß   ÏÐ?Ì Í à }  R wKR S  H Öá  â h   ÏÐã > ä % å æ yç Ä   è :DSDV[2] Reactive     Ç È É on-demandá 
! é M N {  H  R S  Ö ê ë ì í î % ï ð ñqueryò3 4ä ó MNô õ ˆwÝMNè  z ó MNö ÷ ø ù  IP ú ûœ ˆwÝ route_list Z üý þ ÷ wÝÚ Û % ] ˆó M Nè  ô õ ˆ` ¿ wÝ
E ø ù Á % 
route_list MNö    wÝà üó MN _route_list“Ñ  MNH  ñresponseò 3 4 ] ! é MNϒy+ , : J à  ä  y  Ÿ r 3 4 z k 3 4 7 
Y µ   proactive = ( É ¾ }   ÏП r3 4    MNz{    R é ]     R w“ ?•  : G    ç Ä   è :DSR[3] ¸ÉProactiveÆReactive à      6  « N“? $%  æ ç  à 8   æ  (Hybrid)    Ê UMNÑ Ò ! " # B  R w" # B ¶ * Proactive= ($ï   ÏÐ%   " # &¶ * Reactive= (~ yç Ä

  è :ZRP[7] ' ( ) z* + : / 0   ™ š (, > ?É@ A 
 & ' @ A / 0  G - .  Ê UMN“/ ™ 0 ¢ Ë o 1 “? zc 2 %  Ò G ` MNÓt –> 3 4 Š 5 “?å æ *
6 ‹ G  Ö& '  0 ö  7 T UMN: #UG  8 <æ 9 È ; <ñclusteròÊ U8 <æ á * o U
YU¡  M N:6 » 8 <æ MN w; ¡  MN> ? ” < =  ! 0 : >o ' & ' / 0 > ?7  ? µ < –; ¡  MNP Q zå æ  × M N⠜ y  ¶ ½ & ' y  ™ š(> å * –6 ‹ G 7 

jk l $% o Ã
 $@ p

2 y; <  (ñCluster-based Routing with a

Backup Route Protocol, CRBRòzá $@  - . /

0  O s t A B C =  > ?º DU” B f E MNF × P Q V HG Y¾ > ?P Q H H I Ö× ¶ ½ H ¾ J  >&, $%  Ì K q r ! ƒ „
  ÖL M N … yO z* P G Q Ry~ €  • –A S T U V § Ö´ W $@ J   ´ k l 6 X + : / 0 É Y  Z M[ \ Æjl Ü ] ^ :” Ü   Y  Z M _ ¼ / 0 : ` % a b c d m n $% e (ž o ; f 8 g ?; <9 : :Ì Í - .   yÌ K q r· ! Î ! L h k Y i Z M6 j ‹ Œ © ªÅâ Yk  O œ ?Ž Æh k ‹ Œ   à üY l Z M ö Éjm k l n æ  k 

2.

































"#  o % @ A R¨  F « N[4]Å[6]Ê KT U 3 7 MNY › #ÖQR ´c 2 p q : à  ´r p 

 ¸¹ ¾ }   ÏÐ
ä H y[L M \ #Ÿ r3 4 :  Ò  £  #` W X  y z 2 Ì Í H I s t  ð  Æ M N  u ¨ Š ð 
{  ã ÖHI è v w   * a w w f x ` HI s t [#` W X y, £  {  V H#G yc 2 ¸É × V HMNu ¨
Ü q  : . o =  yz [¶ ½ T { yz´¶ * {  P ä } HI y è  3 4 ˆ7 | } Ö+ , o U& ' ” • –@ A   ֓{   O D  Ò ñoverheadòÆ  ~ × {   ” • G  [5]Z [\ ]   & ' / 0 9 :  - .   ֓L M d € c  ¦ ÅyÌ K e f Q g h iˆ

3.









































































!

!

!

!

"

"

"

"

jM7 ‚ ƒ
 è „ QR jk l “$% CRBR™ š(?r 7 : … U! g † d ; </ 0 Å- .   Æp2  yq r>&
k ‡™ š(ֈ ‰m n Š  Ê UMN­jHI J ñbasic-powerò ” ·  ?ž
MNF × =   ‹ Œ ­– Š 
w| } B Ž DMN  ç > ?< ” ô w

3.1








à  ID ; <9 : ™ š(
à ¥ =  ¦ ; <9 : ™ š(t –- .  ‘ ¸ç  à g Ú ’ ¶ *  ; <9 : ™ š(
ç m n “ * à  ID ; <9 : ™ š(?‚
+ ” / 0  9 : one-hop; </ 0 

3.1.1    

























ˆ ‰ • r A – — ! c d ; <9 : ™ š (:
node_id : Ê UMN˜ ™ o ID
cluster_id : Ê UM N“š ; <C D E  IDè  j› £  ; <C D Eö ç œ ú Éø ù ID
Address Ê UMN˜ ú û
H : MN ; <C D E 
M : MN ; <C D Ež r : Ÿ  
U : MN   ¡ g ¢ Ä £ MN 
HELLO wÝ: Ê UMN¤ ¥ Ú Û à wݺ ¦ § M N¨ © ø ù  
ç wÝ b 4 ª

neighbor table Æ neighboring clusterhead

tableè «1ϒ“9 : ; </ 0 ÏÐ1 É«1B MN7neighbor tablef 8 ?ž Ï Ð2 «1B MN7neighboring clusterhead table «1Åone-hop; </ 0 ÏÐ1ÅMN7neighbor table Neighbor

id Cluster id Neighbor node address Role

6 1 Node 6’s address M

2 2 Node 2’s address H

3 3 Node 3’s address H

12 10 Node 12’s address M

ÏÐ2ÅMN7neighboring clusterhead table

Neighbor

cluster id Gateway node id Neighbor cluster address

1 6 Node 1’s address 2
 Node 2’s address 10 12 Node 10’s address

3.1.2
  



















¬ í ÖT U a Ê UMN¤ ¥ Š Ú Û HELLOwÝs ?õ <­  ¦ § MNR w® M No ì í   ÉOKMNõ ˆHELLOwÝü 7 õ ˆHELLOwݜ ¯ neighbor tableO° ± ø ù  ² > ?: É; <C D EMN  ÉH
 ; <: Ÿ MN  ÉM³' õ ˆHELLOw Ý| \ o Õ Ö× üö ´ µ ø ù : É; <C D E[“+ , neighbor table| t MN› z* 

¶ · > ?+ , % neighboring clusterhead table

neighboring clusterhead table ¸  ” ¦ ; <R w

ÏÐ> ?* ! ¹ º - .   

[
; </ 0 Ì K = A ¸É cluster_id  ? ; <C D E ID ! œ ?» K; <C D E › § ¨ Ö= ¼ ® cluster_id , 7 ° ˆV § [ ½ ¾ ˆ; </ 0 J  Š ¸ç É P Q ; <§

¨ m n “ *  Least Cluster Change[2]?Ì

K ; <J  Š 

3.2    

























m n $% o à ) * œ 7 H J = ! P Q ya “{  W X YO‡: ¿ À H I Ö× >o = A ) *
~ & Õ “Á ½ yR w$

% yÌ K q rq r O
–… † 

y> ?
" # a ‡: ƒ „ [z*  ˆ! é MNQ R` } ~ y€  ?r 7 a b † d CRBR   = 

3.2.1    

























CRBR ““ * y~ = : DSR y

~  ö ” * z*  CRBR“ *  = Œ

Š ~ y[à DSRÚ Û ÅÄ Û H 

yä 3 4ñRoute Request, RREQò1  O

–> ?P Q Ÿ r3 4Å H 
y~  & Õ RREQÆ  ( Ç r È = H   Source->Clusterhead->Gateway->Clusterhead-> Gateway -> ... ->Destination KRREQˆ‡ó MNÖ£  É ya “ MNR wó MN
Ê #RREQ3 4b · %

o { à Ë yÌ Í Route recordH o Uy

Î 3 4ñRoute replyRREPò ˆ! é MN

3.2.2    

























t –
y~ & Õ ¶ *  source routing = KR S 3 4g H Öê 3 4u v B  ¸  ya “| \ MNú ûR wè « 2 [- .   ó 
–¶ * ; <C D _“9 :  - . ! HI R S 3 4) * u v B Á ¨ R wV §   HÏ y1  O
–> ? ¿ À ! é M N : ó  M N D Ð ×  y a  W X Y‡: ¿ À H I Ö×  «2ÅR S 3 4u v Ð K! é MNõ ˆRREQüt –
~ & Õ = Œ Š ~ y¸ç T { ya MN› z

 ; <C D EÑ ã  gateway[o { multi-hop   y « N  c 2 Ò Ó  y ± Ô
Õ Ö 3 4 × yØ [Ù  ² ³ Ú Û  ´Ü Ý ¸ç o { y Þ > ´¿ À yW X Y
jm k l m n ) * œ 7 H J = ! H R S 3 4º R S zP ( Ç clusterhead-gatewayÞ ß = HÏ 3 4[ ô ) * ; <C D E× ¸œ 7 H  J ü9 : - . ! HÏ 3 4 ô r ! m n h k ˆ
- .  É ¶ * „ à z* J ˆ ‰m n Ì Í r È à ñ1òá * w— â ¦ :B C @ = : ã  > ?7 J . ú V ß : ?B C . ú 8 ! ϒ:

…….(1)

@ A & ' MN¶ * J “´H à E B C  R[
- . & ' MN¶ * G â 7 J ´H B C , ” • G E Ó t –M N´µ ! é    ¤ ä å à ± r@ ­ –´ ¶ * ² ³ Æ´é “?m n ó u  7 DU” ¦ ; <´” < æ ” ¦ ã ϒ × ç | \ Ž „ 6 —; <
h i distributed gatewayð üñ«3òî DU” ¦ ; <C D EF × à 7 W X Y 3 hops[1 hopà 7 B C É R“?DU” ¦ ; <C D EB C à E  3R¸ç m n è high-power% É- . MNHI J à E > Hˆ| } 6 à E H | } 3R «3ÅDU” ¦ ; <C D EF × à E B C  3R é ê H J 7  ð üô r ! h k ; < C D Eè „ ë ì H R S 3 4 r o - . MN ñ; <C D Eò
 ó MNKí o - . MNõ ˆR S 3 4ü
R S 3 43 4u v b > ?Á ½ ya “MNú ûR wˆ ‰7 G –ø › MN ú û:ø › MNB “˜ neighboring clusterhead tableú ûœ ú  • ú ûR wè  ú û” – ã > ì  ç ú û r o - . MNú û‚ 7 R S 3 4H —³è   z” – ã P t R S 3 43 4u v b $è P G o MNú ûR w • ú û R wˆä ˆr o - . MNú û
 ó MNú ûÁ ½ ú ûR wü‚ ?high-power= H R S 3 4è r o - . MNë ì ¡  ack3 4 ã Ø ¯ yî 2 q r è ç o !
CRBR- .   & Õ Â jt y~ & Õ “Á ½ [! 3 4yya “

gatewayMN7 zP õ ˆR S 3 4R S 3 4

- .   & Õ 7 ( Ç _r È = H   Source ->Clusterhead1 ->Clusterhead2 -> ... -> Clusterheadn ->Destination

f è
«4 K! é MNa 7 R S H ó MNpMNaˆ ‰î  RREQ! ~ ˆMN

p   y  K M N a Á ½ ˆ M N p   y

<a-b-d-e-h-k-m-o-n-p>
- .   & Õ ç y:

ÉG À - . y<a-b-e-k-n-p>6 Â j

ya gatewayMN<dÅhÅmÅo>ö z{  P

V  3 4D”  G r > ?c 2 ½ ¨
! é M

N:ó MN× ya W X Y§ Q R S 3 4

«4Å- .  

3.2.3      





































¸É- . MNñã ; <C D Eò˜ G 7 H I | } - . MN&´µ ï  , ” • G 7 7  Ò Ó —n g ð Ü q
Eï y
T U F > &Ko UH - . MNî —:—r o -. M N ×  =  ± Ô — 7 î   y y € 3 4

ñRoute ErrorRERRò ˆ! é MN ¨ ! é M

Nç y± Ô è a “d Ü q =  ± Ô ·  ñ; ò ñË  ó ô ˆy
¸ç jk l “$CRBR™ š(, $%  yÌ K q r! ƒ „ ; õ … ö y Ko U- . MNî =  ± Ô
î  RERR 3 4F üyÌ K q r7 ) * R S 3 4u v R w; u v R w ! ø y~ & Õ “Á è  R wzÙ >&+ ,
E~ P ÷ ø a ø › HELLOwÝB R w! ù î y?r «57 a b † d yî 2 =  «5Åyp2 q r f è
« 6 F  o { - .  y <a-b-e-k-n-p>ë
H R S Z [
ya MNe u ¨
ï y MNb, î ˆ:MNeF × b-e =  ± Ô R S (ú ) H ւ û ¨  p2 yq r MNbzP ¶ * - . y[( R S 3 4u v R wH R S 3 4 r o MN, £  MNd MNd‰$ü R S 3 4b u v R w½ ¨  j r o MN MN e³ÓMN e Á ï yÖMN d ‚
u v R wb è ½ MNer o ú û, £  M N hMN d7 R S 3 4H MNh£ ¤ - . MNo ˜ ® ?high-power= H R S 3 4K R S 3 4‡MNhüMNh, ý u v R wb Á è r o M N ú û O 7 ç o M N ú û : ø › 

neighboring clusterhead table • ú ûœ ú ?‚ ä

% r o ; <C D E, £  MNkè  MNk: MNh” B á o Uhopö ?basic-powerH R S 3 4² ö ?high-power= H K; <C D EMNkõ ˆR S 3 4ü, þ Ï ˆ - .  ya F ü‚ ?- .   = H R S 3 4 ˆ3 4‡ó MN «6Åyp2 f 8 p2 yq r O DN  [1] • –Ž „ o • ! é MN:ó MN× - . 

yÆ  
o { p2 y! 
yy€ 

[2] t - . yV ß ˆp2 ya Ö×  –` }

+ , Ð N:Ð N× yÖ× 

4.

#

#

#

#

$

$

$

$

%

%

%

%

&

&

&

&

'

'

'

'

(

(

(

(

)

)

)

)

jZ M7 • m n “$%  CRBR ™ š(:6 » ™ š ( L  ´ a   G :  Ž  m n ö :

Dynamic Source Routing Protocol ñDSRòÆCRBR

without backup route maintenance ñã o ˜ & ' 

    òÑ É CRBR-NonBR! %  G ô r ! O7 [ \ m n
‹ Œ F  “$% Š k Ƌ Œ   NS-2[8]b © ªâ Yk  à üö  ‹ Œ     YÍ ÆŽ 

4.1        !  











































!

!

!













m n k ‡‹ Œ © ª    ± –'

ñnetwork layerò• –R S =  ' ñdata link layerò

access interferenceòÅ wJ  P Å  M Nð · Ozœ ?h i[  ' ñphysical layerò ?ž ² © R é F b Mð , z
h iF È 
j m k l Š k Ê UR¨ MN^ ˜ ” * ä é ´ µ ÆHI J á  DUMN< ”
HI | } B ֋ = £ > ?: J H R S ³Š  z . Œ =  ð î M =  ð > ?*  IEEE 802.11  œ ?é ê  ?r  ‹ Œ © ª“k  o ; â Y  ‹ Œ ~ ×  670à * 670à MNUY 50Å100U HI  y 100à Å300à u ¨ ‘ ¦  0 ~ 20à / 3 47   64 byte 3 4‘  4 packets / sec u ¨ ‹  Random waypoint ‹ Œ Ö×  600

Traffic source Continuous bit rate ñCBRò

Data flow 10 data flows

6 random waypoint u ¨ =  o 

a Ê UMN‰q · è o U= Œ Z ü? ‰k  ‘ ¦ u ¨ ˆÉ Nu ¨  ô _‚  Ýo Õ Ö×

ñpause timeòZ üP q · è r o U= Œ ` ¿

QRç u ¨ ‹ 
X pause time w  ‰

“þ Ïu ¨ Š  ¥ ?pause time0ÖMNu

¨ Š à ¥ Ö z ® u ¨ ³ w  ‰ “þ

Ïu ¨ Š  q?pause time600ÖMNu ¨

Š à qMN O – ® z¨   

4.2 ! " # $  % &

!

!

!

"

"

"

#

#

#

$

$

$







%

%

%

&

&

&

 • ?r 3U ´ ó Ž :

[1] Packet delivery ratio:MNH R S Ö ¸ÉV

HMNu ¨ [ : y± Ô ç ÖØ Ù ` } ~ >&H y¥ × ! é Ð    Í þ H R S 3 4¸[ : 3 4? yç     µ   ¥ × R S 3 4HI ‡a b % (
 ‰k  © ªr 7 ë ì  ‡F R S 3 4Æ Y ?î  F R S 3 4Æ Y‚ ½ ç  

[2] Average end-to-end delay of data packets:4 “

> ´Õ Ö H I Ö×  y~ “ * Ö× Å 
queueb “ * Ö× ÅMN O D Ö× Å¸MAC' Õ Ö ` HH I Ö× ÅH

Û Æî  Ö× 
Ž ™ : J ‡

R S 3 4“L M H I Ö× ë g ‡Y

[3] Normalized control message overhead:
o Y

Í Ž “! h  É : J   R S 3 4“ L M Ÿ r3 4Y6 Oz4ª ; <R€ :Ì K “L M Ÿ r3 4ñHELLOwÝòYµ ‡ š= ( “L M Ÿ r3 4Æ µ  ?: J  ‡R S 3 4Æ µ  ˆ ‰«7Æ«8‘ ’% u ¨ Š • 3 4‡ ½ ¾ m n î zk
Ž „ u ¨ r & '  CRBRË  @ A DSRϽ  ¸ÉDSR 3 4yW X Y CRBR#[L M G ¥ y€ "[ G CRBRÆCRBR-NonBRCRBRÆ   CRBR-NonBR# % 5 6
¥ u ¨ Š ò ñr   ¸ÉCRBRF yÌ K q r> ?$¥ 3 4 ‡
























              
            
           
     
«7Å50UMN3 4‡
























              
            

           

     

«8Å100UMN3 4‡ «9Æ«10 ‘ ’ u ¨ Š • DÐ N× H I Ö× ½ ¾ @ A  DSR t –3 4‡G

qy` + G Y¥ RREQÆRREP3 4#

½ ¾ ˆR S 3 4
queue (“ *  priority queue)

b · $ Ö×  :
u ¨ Š  ¥ ò ñr DÐ × H I Ö×  ‘ % ¥ [& ' CRBRJ  3 4‡¸[H I Ö× J  a % ³Ó& '

–CRBR-NonBR¸ÉCRBR-NonBRyW X

Y&  –CRBRÓCRBR3 4: J ‡Æ Y CRBR-NonBR#è ÏÐ3

         












              
            
           
     

   













              
            

           

     

«10Å100UMNE2E delay

ÏÐ3ÅR S 3 4‡Æ Y NonBR-50 CRBR- 50 NonBR-100 CRBR- 100 0 18040 20645 17137 21001 100 17511 18809 18351 20281 200 17959 18649 19006 20197 300 19733 19964 19494 20024 400 19780 19998 19507 19979 500 19831 19953 19776 19985 600 19946 19947 19922 19922 à üö  u ¨ Š • Ÿ r3 4Y½ ¾ è « 11Æ«12> ?ü % “ (   (Ÿ r3 4 YË _u ¨ Š % ¥ [a % 
à ò ñr y ~ G Y: ɟ r3 4Y  ¸¹ DSRy € ¥ ¸ç “{    Ÿ r3 4Y” • , ¥  [F yÌ K q rCRBRz{  y` } ~ ã > Ì K DÐ × y“?Ÿ r3 4Y&  –CRBR-NonBR

       












                    
               
    
           
     
«11Å50UMNŸ r3 4Y
 













                    
               
    

           

     

«12Å100UMNŸ r3 4Y

5.

%

%

%

%

*

*

*

*

o m k l m n    
–h k
& '  + , p2 y) 8 f 8 Y* UMN+
o U7 | } " # b
! é MNÆó MNW X Y” • ,  § 7 [ & ' / 0 ´P Q ˆ, E ó MNB C W X Y* G À - . yþ ß G A @ A / 0  #` W X YyZ [Ž „ o U
MN× =  ± Ô Ë  Õ Ö R S H I  d €  m n “ $ %  CRBR™ š(> ?P Q R S HI yW X YO  > ?ƒ „ Á … † y    - \ m n $% CRBR™ š(> ?J  A S T U § ¨ Ö  ´$% H ‘ ¦ ÆH : J 

+

,

-

.

+

+

,

,

-

-

.

.

+

,

-

.

[1] C. C. Chiang, H. K. Wu, W. Liu, and M. Gerla, “Ruoting in Clustered Multihop, Mobile Wireless Network with Fading Channel”, in Proceedings of IEEE Singapore International Conference on Networks, April, 1997, Singapore, pp. 197 - 211.

[2] C. E. Perkins, “Highly dynamic

destination-sequenced distance-vector routing (DSDV) for mobile computers,” Computer Communications Review, ACM SIGCOMM, Vol. 24, No. 4, October 1994, pp. 234 - 244.

[3] J. Broch, D. B. Johnson, and D. A. Maltz, “The dynamic source routing protocol for mobile ad hoc networks”, In Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile

Computing and Networking (Mobicom),

November 1996, Rye, New York, pp. 153 - 181. [4] P. Gupta, and P. R. Kumar, “The Capacity of

Wireless Networks”, IEEE Transactions on Information Theory, Vol. 46, No. 2, March 2000, pp. 388 - 404.

[5] S. Banerjee and S. Khuller, "A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks", in Proceedings of the IEEE

International Conference on Computer

Communication (INFOCOM), April 2001, Alaska, USA, pp. 1028 - 1037.

[6] S. R. Das, C. E. Perkins and E. M. Royer, "Performance Comparison of Two On-demand Routing Protocols", in Proceedings of the IEEE

International Conference on Computer

Communication (INFOCOM), March 2000, Tel Aviv, Israel, pp. 3 - 12.

[7] Z. J. Haas, “A new routing protocol for the reconfigurable wireless networks”, in Proceedings of IEEE International Conference on Universal Personal Communications, October 1997, San Diego, pp. 562 - 566.

[8] NS - Network Simulator