• Nenhum resultado encontrado

A DISTRIBUTED RESOURCE-MANAGEMENT APPROACH IN MANETS

N/A
N/A
Protected

Academic year: 2017

Share "A DISTRIBUTED RESOURCE-MANAGEMENT APPROACH IN MANETS"

Copied!
12
0
0

Texto

(1)

!

" #$ % & $ ' (

A DISTRIBUTED RESOURCE MANAGEMENT APPROACH IN MANETS

) *+ , , + - . /)*0 ) 1)2 * ( 3)

4 .%2,)4 + 5 5 6)2*%5

!

" # $# % &

' # ( ) * +,- ! ( ) (#

' ! ! & ,# # ( )

( . ! # ( ' & # ( )

! ( # # '

! ! & * - ! #

# !! # ( )& , # !

( ) ( # ' !

/ ! # & # !

) ! # +, ( 0 1

* 01 -& 2 ! (

! & ,# ( ' #

# ( ) & 3 ( # !

4 # ( # # 4 # # ( )&

5 ( $ 01 +, 1

!

,# ! ' # ( ) #

6 ' # !

#& ) ! # ! ! &

!! ) ! # ! & 7' ) !

(2)

!

3 3

01 0 1

01 0 1

8 8

3 3

!

9 9 ( ) !

+, ' # ( )

' ( )

: : !

, , '

8 8

)

# ! # # ( ) 4 ! '

' & 0 (# # ( )

( ) # ! ( !! #

# ' & 3 ( ' !!

# ' & 1 # ' ( #

! # ! ( ) ) ! ' ! # 4 #

# ' ! # ( ) &

7 ! # ! ! # ( )

& ,# ! ( #

* - ) # ! / ! # '

# ( )$ ,# ' # #

' # (# # &

* - ! $ ,# #

! # ! # ! 4 #

' ; 8 # # # &

* - ,# ! # ( (# ! # $

# (# # ! '

# ' !

! ! (# # ! # ( )

# 4 # ( )&

< ' # # ! # 6 * - *

-! & ! ! ! ( #

# # ( # ( !! ! # ! *

(3)

! = > # ' !

# ( ) # # / # '

! # & ,# ! ( )

! ! # ! # &

# ( ) ' ! ( # ( #

# ' . &

! # ! # ! ( # (

(# # # &

! ! (# #

# # ! # ( )

' # ! # ! ( ! : &

) ( &

! ! #

# ( ) (# # ! !! ' ( )

# ' ! # ? ' ( ) &

! ! #

# ( ) (# # ' # ! #

! ( # ( !! ' ( )/ # !

! &

# ( ' # ! )

) ! # ( )& 2 ' !

( !

( ' # # ( ) &

,# . ! ( & ' ! !

( ) & @ ( 4 ' # !

+, & A & < #

B&

' ! !! # !

# ( )& ' ! $

# ! ' ' #

( ) ' &

# C # ' #

# # ( )&

# # ' & ! ! #

(4)

,# (# # # ! !

# & ,# ! ( 4 &

,# * - 4 ! #

# & . ! D ' D

( ) ! ' # ! !

( ! & < # E ( )

' ' ' #

' ! # ' . ! ( ) =@ A>&

+ ! ( ) ( &

#C C' # ! !! & !

' & + !

# # & ,# ! # # # # & + #

# ! ) 4 * C C -&

# ' ' # # #' =B>&

!

* - ! ' # #

# ! ' # # ! # ( ) & #

# # # ! # # # '

# ! # ( )& + # # 4 #

! # # (# # &

8 * 8- ! = >&

! "

,# . # # #

! ' # ( ) '

& # #

& , ! #

' # (# # # ( # #

&

. # ( ! C'

( ) & 3 ( # # ) #

# ' ! # (# # ! # ' )&

. ( #

& ,# ' ! ' ! #

' # ' # ! # # # !

( ( )& 8 9 # ! # ! # $

# $

9 ( ) ! *9 - # # !

( ) '

9 & ,# 9 8 ) *

-# ' # ( )& <#

(5)

7

* - # ' ' ? )

=F>&

%&

,# 8 * 8 - ! 4 ' ' ! ( )

! # ( # ! ' ( ) & ,#

# # 8 ! ( )$ * - *

-G 1 ? G ' # ! ! # # (

1 ! # ! # ( ) (# # !

# ? & * - * - # ' ' # !

! & ! ? !

# G & * - * - #

( )& ,# # ! ' #

# ( )& 8 # ( !! ! $ *

-(# ! '

# ? # * - (# #

# ? ! # ?

# =H>&

'

,# # # ! # ' # !

# ' (# # ' # (# # ( ) . ' & ,#

# ? # ' # ( ) &

' (# # # ' ' * & &

' ( ( &- =@>&

# # # ' # & #

=I> +, * & &

' JJ -& ' . #

!! & ! # '

! # ) ! ' & ! #

( )& ( ) ! ' ! +,/

& ,# ' )' ! '

! ! & ,# &

(! ) *

C # ' ! & ,#

' # ! ' # ( ) #

# ! ' ( # & ,# ! # ( ) .

' # C # & # ( #

4 # # ' ' ' # ' # ? &

# # # # .

# ( ( ) # ! #

' )& . ( #

(6)

8

' # ? ( # ' #

( ) ' (# ( # # ( ) # #

( 4 &

# !! # ' #

# # ' # &

+! ,

01 ' ' # ( ) & ,#

# ! # # ( ) ' !

E C# C ' & + # #

# ' # ! & 0 ' #

! ) # # C

& ,# !! . # ! !!

# ' &

# 4 ! C ) # ! # ) ! ' # C

C 4 ' # &

4 ! # ( ) # ( 2 & & . !

# ! # # # &

) # # C 01 #

. # # & C# # ( #

# # & ,# ! 01 # #

4 # ! # ! # ' ! #

# # # ( ) # # ! # &

3 ( # # # # #

( # ! = J>&

,# ! ' ) * C ' C

-#' / * ' 01 - #'

' & # ) ! ! #'

# ! ! ' & ,# ! #

# ! #' ( #'

= >&

Cluster Head Gateway Member Node

(7)

9

01 # # ! ! . &

01 # ! ' #

(# ) & 4 # # #

#' 4 # . # # '

( ) # &

(.4/ $ ' : ' $ ; <=

> $' ? ' @ '

0 $$ ' ' A ' $ & @ $$

B@ ' B@ ' ' ' C$ ' ' : ' : $ ?

$

. C ' $ ? @ : ' ' $ &

? @' A ' $ ? $ ' $ ' $

, ' $ ' ' A A D @ ' &

' @ * : & ' & A ' @ ' '

A ' ? ' ' : ': C#$ $' A A? $ @ ' $'

' A ' ' & ' ' @ C ' $

$ ?

' - ) * % - $ .

' ! ! # # ( ) &

# !! !! # ( ) & ,# ! (

/ ! !! # ( # #

' ! ) # & 3 ( ' !

? & (

/ ! # # # K (

! ! ' (

' ( ! (

* ? 6 -&

! ! #

' . # ' ! ! !

# # ( )& ,# ! # !

! ! # !

? ' # ! ?

& ! ( !

' # ' K '

* # ! # ! - ( !!

! +,& # / ! !

# ' ( # / !

' # #

& ? # # ( ! #

& ( !! ( # ( # !

+, ' * - ! *

-/ ! ' &

' 01 #

(8)

, ' * ,- # ' & + # # , #

' & ,# , # ( , ' &

. % . %

% %

.

% %

/0

, ' 7(

L L L L

, ' 7(

(# ( # # #

( ) # ( ! # 6 #

' &

# ! ! ) ' / , (

# / , # ! # ! # # (

2 & &

3 $ 3 ,$ , '

1 , % . , ) * %

# ' !

' # #

&

<# # # , #

# ) ) (# # # ,

( # & # # ' #

) ' # # !

!! ! 4 3 # # M, & 2

4 (# ( ! , ' ( #

# , # ' 2 & @ ( ) *

-3 ' &

% $ % 2

* - , * - ' *

(9)

*)- , *)- '

*)-1 , ' % *

( 3 ) # ' . ! 01 #

* 2 & A-& ! ( # 01 # ( #

! ! & <# # # )

# , ( # # # &

, ! )

#' *

-#'

* -

*)-#' * - #' *

-L L

#' * - #' *

-#' *

-L

#' *

-* - , * - ' *

-L L L

*)- , *)- '

*)-$ J N N ' N 3

, ! ) $ H N 1 '

I N J N

N 1 ? 3

N ? #

1 , ( % * $ 0 3 - ,

# ( ) # ) )

K # ! ( ' #

' ! # ! ( # * 2 & B -$

& # ) (# # # # #

, ' O ! ! # &

& ! # , ' (# # # '

# 3 # # ' !

, ' 3&

,# ! # # ! ( $

!" # # $ %

&

'# %

( %

)

* & +

(10)

1 , + . ! * , )

( % ) 4

7 ( # ( ) * - = >&,

! # ! # ( # # B #

( )& ,# ! ' # #

( # !! # & ,# !

' # ! # # !! ! '

P ' & / & ,# # ( , ' &

. % ) % ,

IJJ 0

4 !

#

J 6

01

01 4 ) JJ

4& H

J& B &J

' ! B J @J AJ BJ J FJ HJ IJ

4"N BJJ 4 N BJJ

+ ' @ A A ' $ $ ' ' ' A ' A $$ #$

& ) A $A $ A ' A $ $ ' '

' A$ ': C $ $ ' A$ ' A? @ C '$

, ' $' B@ A '$ : ' ' @' ' ' ) '

' (.4/ ' A $$ & : : $ ' A?

$ 3 & @' ' A ' A $$ &

& $ $' ' $ ' A$ ' A? $ ' ': C > 7

$ :$ ' & $ & $ $ A? $ ) ' $' ' $ ' '

) ' ' (.4/ $ ' A@ $ A & ' ' ': C

Overhad Befor and After Adding SA

! 7 8 9

! 7 8 9

Nodes

O

v

e

rh

e

a

d

(11)

Fig. 6. Overhead before and after Adding SA to CBRP.

, ' ' ' ' $ $ ' $ '$ : & '

B@ A ' ' @ ) ' @ : $

' : & ? ' ' '

' ' ' : $ $ ' . $ ' $ ' @ : ' '

A ' $ & @ ' ' ' ': C : $ ? $ :

> 8 ' # !

# ( ) 4 @ &@AQ ! &

The Amount ofَََ A Service Peneteration on the Network

! !

! 7

Experiments

P

e

rc

e

n

ta

g

e

Fig. 7. Service Penetration on the Network.

, ' B@ A ' : D ' A $$ @ $$ A )

: $ ? $ : > 9 + # J&H *H

Q-! # # ' * ' #

-(# # # ( ( ( ) !! * - # ! (

( ) &

Packet Generated due to A SA

7 9

! 7

Expriment

P

a

c

k

e

ts

0 / C '$ / C '$ ? ': E ' ( $' $ ' / C '$

Fig. 8. Message Passing among SA.

(12)

!

0 4 01 #

& 7 # # # # ! #

( ) # @JQ ! # # H Q ! # #

' * ' # - (# # # (

( ( ) !! * - # ! ( ( )

& + # ) ( !

# & ' ! #

!! # ( # ' ' 3 #

& * ( # # ( ) ' # # ' !

-*

& & & 3 K 0& # . #K ,& & < K 1& 0 K &

# # * JJH-& ( # 01 ' !

+, & , #

- ( $ . , - .R & H & B @J C@JH& & & & 3 K ,& & < K 1& 0 * JJF-&

! +, ( ' &

/ 01 & 2 BC F

JJF +++ ' $ JF+; F@A * ' C17 -&

@& & # K & 8 * JJB-& ! # !

' # ( ) & & # # . # . !- 3340

! ! + *

+-! 2 # $66(((& & ! & 6 6 BB@ ! JB6&

A& $ * JJJ-& # $66(((& & &

B& & * JJ -& + & !!! /

R &H &A @ICAB&

& S& 2 K +& & 3 * JJB-& ' # ( ) &

/ " !!! # ( (

( $ ABFCABI&

F& & 9 ( ) , # & # $66((( & & 6 ! ( 6E 6& H& +& K #& ) K 9& R . K & * III-&

R 12 JH&- ( $ 5 $ 6 #. &

I& 2& # K R& * JJB-& ' ! +,&

/ 4 !!! / #

* JJB- R & H& & @BC AA&

J& & ' # K ,& < ) K +& ) ( .K #& 8 K 9& 5 * JJA-&

( ! ! ' # ( ) & ( $

R & & C &

& & 9 K 9& 8 K T& & , * III-& ' * 01 -&

-&! -!& 7& # # 809 "

! 9 III&

Imagem

Fig. 6. Overhead before and after Adding SA to CBRP.  , ' ' ' ' $ $ ' $ '$ : &amp; ' B@ A ' ' @ ) ' @ : $ ' : &amp; ? ' ' ' ' ' ' : $ $ '

Referências

Documentos relacionados

The MIST-NTP (Modification, Impersonation, Sleep deprivation and TTL attacks in Node Transition Probability) based routing algorithm establishes a route using its control

To this very purpose, the main objectives for the intern were: to develop the methodologies to quantify six risks that were identified as priority; to adapt and

We then focused in traffic engineering aspects, considering network dimensioning, dynamic route and dynamic resource management and presenting both MPLS and IP-based techniques.

Para São Luís a distribuição mensal dos eventos pluviométricos intensos concentrou-se entre novembro e julho, tendo maior ocorrência nos meses de janeiro, fevereiro,

Moreover, since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions can be defined by such models..

Adicionalmente, a instalação do inversor de frequência para acionamento da esteira da máquina possibilitou não somente o aumento da capacidade de lavagem da máquina, como o

O parâmetro da segmentação linguística, o qual preconiza que a divisão de texto na legenda seja feita de forma que cada linha contenha o máximo de carga semântica

If one node is moving away from the communicating node then both moving node will measure its receiving power with respect to the distance and if its current power level reaches