/
Adhoc-VCG:ATruthfulandCost-Ef Adhoc-VCG:ATruthfulandCost-Ef

Adhoc-VCG:ATruthfulandCost-Ef - PDF document

min-jolicoeur
min-jolicoeur . @min-jolicoeur
Follow
372 views
Uploaded On 2016-11-08

Share:

Link:

Embed:

Download Presentation from below link

Download Pdf The PPT/PDF document "Adhoc-VCG:ATruthfulandCost-Ef" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Adhoc-VCG:ATruthfulandCost-EfÞcientRoutingProtocolforMobileAdhocNetworkswithSelÞshAgentsLuziAndereggInstituteofTheoreticalComputerScienceETHZurichinf.ethz.chStephanEidenbenzBasicandAppliedSimulationScience(CCS-5)LosAlamosNationalLaboratorylanl.govABSTRACT                                    !               �           =   @      ?              @                 #-:8:0/  %SelshnessandPayments4 &         A &             1                 &             �          *            ?              = '*          "    ?       *                #-;/  %?       #  -0:BC090;/%          #  -DE99B:E/%               @                       ?                                               1                  * @              (          &      ?           #  =     %+       ?      '    # %  )'            ! '                                 F  @         -0D/?        -./      26!54?F           ?                                                      AttractiveCheating   !             1  G  G                                   ?                                     ?        ?                       &      G     G                A     1                    $     ?    1   $         '                &  4 1   '           F                (                              1                                   �       *        (                (                           =  -./        MechanismDesign    "          &       ?               ?         #    =  %                                                                       !                     @  ?                  @  F  09-00/            2   7-0C/                 ?               &               =     4             '* 1                                  ?          ?                 @      �                                ?                   OurContribution   !          &      6                      �          0max   '  maxmin% ' # %        &  ?                 &  (      !     -9;/  -::/  !-:D/ G G  *           !?                                   ?   !                   '     ? !           @                =               #      %?                         !                        !  HF7                ?         !                                   1   &      ?       #         % =      -D9B/     !        �       '*  A         '*     1            =   �@        �                    =       �        �        @       I  *         #    %                          -./    F                   &      Organization?    * 1   F 0      F 9   !  F ;    &      F B      '       F CF D       -./       F . '               #            !%2.RELATEDWORK!                     *         2   7-0C/           ,       ? +J+  -:/'                -:B/?    -:;/     !       K!+�                         &  -0.0E/F     #-;/  %,      1                          K    A  '-./ #  %       26!54?F    �  =    26!54?F  K    A  '-E/    1            *        ?  +   4 #+4%-9/  =    L  M7 N    O   F+7?4-9B/              )    -:E/                            -0:B090;/ =         '      ,      =        ?    ) = '-;/3.OURMODEL                       %           #%           #%          4    @    #   ' %          ?     4                                     +                             1  '* ?         #'  %        1                                               ,                                    ?        ?   #     -9B/%              2             ?                     4       #    %       '  F-:C/ "       F             &    @   &  �        &           ?  @   @        �         #  %     #  09 ..8..:-00/% !     '      � -:C/                           (  @            &   &      *                       ,               *     )                                                           =           '    A                     '       �        ?G 'G                                                                                        ?          1               -:0/1   #:%             '     '     min              ,           '    @     +      max        max            #'     %        0                 min    5      6                   #         %   min @           @ 4@:1min    min#0%? %    %1Pmin 2            A           ?   @      *                  4.THEADHOC-VCGPROTOCOL   !                  A     'F               !   &              !   1:7   0H          �                 Routediscovery             -:8:0/                  ROUTEREQUEST ?   1:@   0?  8   9?     ;?    B?  4 '       '   1 4@ 0   @   -:8:0/    #  %    minmin  #:% min(1)(2) min(1) Figure1:Packetheadersduringtheroutediscovery:  ROUTEREQUEST                     ROUTEREQUEST  @   �       ''  0H        94  @     min  rec min;7    min �               �    2      �       $        @        ? ROUTEREQUEST        ) :  @    H                %(           (1) #       %5        !       (1)                   ? !      1  min+1)#9%  =      '        ?min+1)       � = #  %                         ) 0 '          '     ? &       PBR0R9P:8?     PDR9R;P:;?     PBR9R;P:0?   ! P:;:8R0PCP:0:8R9PBF           B                         BRCRBP:C  �                  BR0R9P:8            H     ROUTEREPLY    @  #:%%         @   min+1)      !      ?ROUTEREPLY                    ROUTEREPLY                             -:8:0/     ROUTEREQUEST     #    %,    @            @   G* G    @                                       ?             -:0/4   #'   %    ROUTEREQUEST           %  ?                !                 � '      1531034v3v27S 2 v3v4515 D Figure2:Anexamplenetworkwithedge-weightsDataTransmission            (1)    @      '              (1)    (1)F                 #  -9B/%@                                          #-./ ' %             -9B/1                         #               !  %�                          #-9B/  %                                     ?        �                                       RouteRecoveryH                     '   $                       #  %      '                    BROKENLINK       6  BROKENLINK G    G                  @           5.ANALYSIS     !  @  &         &     !       !     F       !          &          ? Observation                     !           #    %     &         !         #'      %           @    F            &      4          * F     !   ?             :H        0         min    9          ROUTEREQUEST          L   M                1                '   (         '    ?                   )     1                                           ?                           $                    #'    %       �    )    # @    %                "              #Proof.                    1       #       %  #        %K                     F         '                       '                �                       4@9 1 &          �                                         # %  # %4         '                                               "      #       #min    #   Proof.          2           min   6     #    min  min  min min %              min             min                        (    #    min  min  min min %                #     %             min  I                     -0B:;/?          #          %     ?                ROUTEREQUEST "               ROUTEREQUEST#         ## !Proof.F         %    ROUTEREQUEST    1 #%                             %                            %    =   =                        ?            2       %?    $ 1    #%       #%  A           %                   F            %       )        #'          %                      ?                                                     2      ?                              G  G               ?  1Theorem    !6.OVERPAYMENT      !                   (0)(1) +1)                           ?      min+1)?        ! #    %     min (1)min (1)          Theorem$max% min             #  %#             max minProof.?              *   (1) +1) @           +1)?    min+1)minmin+1)   min+1)  4         min+1) min +1) min +1) min +1)minmin+1) @   min (1)minmin+1)%)    :R 6                 ' A        �@     '  max    0        F 9 2   :88 B88 4' B09;BC B09;BC B09;BC(     :C:;8:E;0CB;:BB 0B:B00:80.09C.;; 0B:B908:0D0999;  DB:;;0.CB .E:;C0 .C: '  C00;BB8CEC.088E90 BE00;;;E.BD:9BB9: B808E;:9D.B:890:C        0.;0;9B9B9BD EE.:0B:8 88888: Table1:Overviewofexperimentalresults    1  max minminmin+1) min+1)max min F 'C        max  '            #         '          %?0 @       �          ?0         '    -0/           '  1 '    :8        *:B88B88                   #4          % '  '?                                   '  :88   B88         '      ? C              '  '                               ) 9            ')? C       ::C  :0BB#    :C0B          %'   ?             L    M   -:./    :   -90/        '   MM  '?             '   #     %   �  B             ?        88.8.   '           �          ? '       :888'      0?0�  '               ? '                   =   ? '       '               (  :88    ?      ) 9:88     B88    '               )9  @          '    I  '  ?'             ?                     M    '        7.ANALYSISOFPACKETPURSEMODELWITHAUCTIONSI                    ?    :8         A   =  '    :          0 100 200 300 400 500 600 700 800 900 1000 1 2 3 4 5 6 7 Frequency of Occurrence Overpayment ratio VCG/|SP| Distribution Function, 500 x 1500 Grid, 1000 Graphs, 100 Nodes 100 200 300 400 500 600 700 800 900 1000 1 2 3 4 5 6 7 Frequency of Occurrence Overpayment ratio VCG/|SP| Distribution Function, 500 x 1500 Grid, 1000 Graphs, 500 Nodes 100 150 200 250 300 350 400 1 1.5 2 2.5 3 3.5 4 Frequency of Occurrence Overpayment ratio VCG/|SP| Density Function, 500 x 1500 Grid, 1000 Graphs, 100 Nodes 100 150 200 250 300 350 400 1 1.5 2 2.5 3 3.5 4 Frequency of Occurrence Overpayment ratio VCG/|SP| Density Function, 500 x 1500 Grid, 1000 Graphs, 500 Nodes Figure3:Overpaymentratiodistributionanddensityfunctionsofourexperiments  + + ,  -./         ?               F                                        #    %  ?   =                          @    F        =       ?           ?       =   = =   =� 1 @    =        ?  L !MK   =                   #"       �%          ?          &     *              !  "     &  ) ;       "      ) ;       =   #%? &       9      :0 = :C=   ?   & ,       1  21D110v1v12021511vvv51150S1v115071v64v105118153v16"25""26"8 9 10 11 Figure4:AnexampleforthePacketPurseModelwithAuctions               #%:B0B     ?     =  :C0C G G = 0:               0:BR:P:D?    :D:P:C   8   (                     &   *               8.CONCLUSION                                    &          !                   &         !                                         !                 #%     #  %           #%           F B                 &                                !             &                  (  '     !@                          &                       LM             '           ?     @             A        #  '  @ %                                @    K  2 @               !                 "     &      �   #%               !                 H            &                      +     F-9B/2 -E/        !      7                      -98/        !�                !           '     #    ,  �-:9/ %  *    )'               *   Acknowledgements  '                S=F            9.REFERENCES-:/ FF 7T FF +   �FK   F 1! ?  ?� + &   '())*+,-0/   4?  �) + ,  � &   -.#  /   ) 0')10  #EE:EEE0880-9/,K 4) H! *?5O5 "     �  +   4 �, 088:-;/FK  S5K  �  7  ,  21 4= ,    F� &$   '  ) '  2 #' ,++,/  ( 0880-B/FK  S5K  �2 K  ! 1?  7  F )   7 , A 2� &   3 " 2 #   /      ;89;:8444  F 0880-C/FK  S5K  �+    (2)H2?+ 1  (2 G) H    2?� &   '"""0)#  ) 4   # 5)4(6$  7  -D/5K    SA  � '4  F   , A 2� &   '"""0)2 # ) 4   # 5)4(68   0888-./5K    SA  � '2 1         *  � &3    #"9$/-E/5K    SA  � 'F    F( * , A 2�)0: )   ##   .2B( 0889-:8/+K !   ?  H, **!, **,N�*H  + 4 4& 7   A 2� # #    2'"3!-::/4  �,  +  +  ! � &   :::D99:ED:-:0/FHFK  ?K�(           � &)) #     C9S 0880-:9/F4 *FT  FN �4@  ?  !  A 2� &   /'$)()*+.-:;/S)   +   7F FF�K!+  ,  5 7  � &   ,- )#   #   / # 5(/6:D9:.0S 0880-:B/S)  FF�H    ,  H 17 7   )  H � &   ;'    2 # /    ) ) #     5/ )*+,6) 1::90880-:C/S!  S5 =� +  H ,  � &    "    !-4   CBD.:EDE-:D/?!� ?�  &"   -C:DCC9:ED9 -:./7!  T  7  �      1        �    )   "  ,++.0;.0;ES 0889-:E/,S S+A  '5K  �             �' &   9   #,++.$ #S  0889-08/F5 TF   7   � +(* 7  +   ,2� &4  2    ) # '!=  5!6� 2   ' !1;8D;090880-0:/F, ?! T5 ,K �,       � &   3%'       ) #   ,+++8  ) 0888-00/,  ,S!�,   ?�(% ?   1-09/+,   7,� !      �  #!+,+@+' " -0;/+,   7,� (741   7  ,      ,  2� &%'9'           5),++,67  -0B/H, ,?*�H  ! 1),  + � &   -;     A  '    909D:EEE-0C/22 7�      � &  "   89B:CC:EC-0D/?7  �   1+   + �   4 -0./?7   4?  �AK F7  V� &�   );E#0%09C0BE,  0880-0E/?7   �A     V� &   -.  )') #  /   5(/608908;F )   0880-98/SF  H + ,F*�(  7  ,   H  ,   �43    #3-,+.-9:/F  +2   )  777� 4 4&   A 2F6� &"# 2    -90/T? � ?+ ? 1) ?  ,  � &   ,+  #  3   #   #  536C8.C:EK0889-99/O? 5 F �, A 2  7  + � &4  2    ) # '!=  5!6� 2   ' !1:EB0:.-9;/ �          � &�   9  -;.9D:EC:-9B/FN O  7   O  S �F1F  +  K  F,  2� &   '9(():E.D:EED,  0889A.ALTERNATIVEVERSIONOFROUTEDISCOVERYPHASE                !         ?            ROUTEREQUEST ?    '    '   max '           G      F ;G '  ' max?        ROUTEREQUEST           maxmax                    "  F ;  ROUTEREQUEST ?    '        1   ROUTEREQUEST                         @                                                    ?          '   F ;           #      %                  ?       (                                                 '    �                         (                   '  )          '      #       %       ?          A              ?             +       #   %           ,   ROUTEREQUEST                           @       Adhoc-VCG:ATruthfulandCost-EfÞcientRoutingProtocolforMobileAdhocNetworkswithSelÞshAgentsLuziAndereggInstituteofTheoreticalComputerScienceETHZurichinf.ethz.chStephanEidenbenzBasicandAppliedSimulationScience(CCS-5)LosAlamosNationalLaboratorylanl.govABSTRACT\b\t\n \f\r\f\b \r\b\b\n\r\f\b\f\t\b \b\f \b\b\r\t\f\r\b\f \f\b\b\f\t\r\t\f\f\b\b\f\r\f \b\t\t\n\f \b \n\t\b\f\t\r\t\f\f\r\b\b\t\b  !\f\f \b\n\r\b\b \b\f\f \t\r\b" \b\n\n#\f\r$\b\f\n \b\b\b\f\t\r\t\f\f%\f\t \b&  #\r\n\f\f\f\b\n\r\t\b\f\b\r\b \b& \f%\f\r\f\b \f\r\b\t\f\b\t\f\n\b\f \n\f \b\b\b\f\t\r\t\f\f\f \b\f\b\f\b\f#\n\b\f\n\f\t%\f\f\r\r\f\b \f\n\b\n\t\f\t\b\t\r'\f\t (\n\b\n\r\b\b \b\f\f\f\b\b\b \f  \f\f\t!\b\f\b\b\r)\f\f\f*\f\f\n\f\b\n\r\b\b \b\f\f\f\t\f\f\b\b+\f +\n,\b\t-./\f\n \b\b\n\r\f\t\b\f\n\b\n\f\t\b\b\f  \b&  \b\n\nCategoriesandSubjectDescriptors 00-ComputerSystemsOrganization/1 \b\n \b\n \f\b2\b3\b\t\n GeneralTerms\r\b+\b\f 4 \b\b Keywords ! \f\b\n\r\f\r \f\t\r\f\t\b \b\r&  \r\f\b 5\b\f\b2\f\b\f5\f\b\f\b+\n \f\b2\b567189:;8;2003edgesthatthiscontributionwasauthoredorco-authoredbyacontractororafÞliateoftheU.S.Government.Assuch,theGovernmentretainsanonex-clusive,royalty-freerighttopublishorreproducethisarticle,ortoallowotherstodoso,forGovernmentpurposesonly.September14Ð19,2003,SanDiego,California,USA.Copyright2003ACM1-58113-753-2/03/0009...1.INTRODUCTION7\b\n\r\b\f\t\b \b\f\n" \b\f =\b\b\f\f�=\b\f\n\t\n\b\n\b\b\f\b\b\n\r\b\b \b#-99/\b\f\n%,\b\b\n\r\b\b \b\f\n\f\f\t \f\f\n\f\t\b \b\f \b\b\f\f \n\f\f\r\b\f \f\t\f\b\t\f\b\n\r\f\b\f\t\r\t\f\f\b\b\b\b\t? \b\b\f\f\n\b\f\f\b\f\b\r\n\r\b \b\b\f \f \f\b\f\n\t\f\r\f\f\t\b \r \b\f\t\r\t\f\f\b\b\b\b\t \f\t\f\f\b\f\b\t\b\n\b\t\r\b\n \b\t\f\b\b\t\f\f\f\b\f\t\b\b\t\f\b\b\t\f\r\n\f\b\b\t\t\t\f\r\f\t\t\f\b\b\f\b\t\b \b\r\f\f\f \f\r\b\b\n\f\f\b\f \r\r\b\f\t\f\r\b\f\b\r&  \b\t\b\b\f\f\t\n\f\b\n\f\b" \b\t\r\r\f\b\n\r\b\b \b\f\t\n \b\t\b\f \f\b\n\r\f\b\r\r\b\f\b \b& \f\t \f\r\f\b \b\t\b\b\n\r \b\t\n \t\b  !\f\b\n\r\b\b \b\f\f  \b&  \f\t\n\nEnergyEfciency?\f\t\b\f\f\b\f \b\t\f\r\b\b\f\t\f\f\r\f\b*\r \b\n\b\b\f\r\b\f\b\b\b\b#\n\b \b\t\r\t\t\n\f\b\b\t%\t\t\f\r\t\f\t\f\b" \f\b\n\r\b\b \b#-08/\b\f\n\f\t-:8:0/\b\b \b%\r& \b\n\r\b\b \b\n\f\f\f \b\f\b\n \b\t\b\f\t\f\b\r\b\n\t\f\b\r\b\r& \f\b\f\t\f\b\t?\b\f\r\b\f\b\n\r\f\n\b\b\r\n\t\f\b\n \f\t\f\f \t\f\b\t\r\b\b\b\r \b\n\b\n \f\r\b\r\f\f\t\b\f\r\n\t\f\f\b\r \r\b\f'\b\b\b\b'\t\f \b\b\t\f\b\t\b'\t\f\f\t\f\b\t\n\f\b\r\f\f\b\t\r\f\b"\n\f\f '\b\t\b\f\r\b\n,\b\t \b\b\r#\n \f \f\t% \f\f\b\b\f\r\f\f\r\n\b\f\f'\n\bmax\f\t \f \b@\n\f\f