See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/4080357

Collaborative resource allocation in wireless sensor networks

Conference Paper  in  Proceedings - Euromicro Conference on Real-Time Systems · January 2004

DOI: 10.1109/EMRTS.2004.1310996 · Source: IEEE Xplore

CITATIONS READS
59 165

3 authors, including:

Marco Caccamo Chi-Sheng Shih

University of Illinois, Urbana-Champaign National Taiwan University
128 PUBLICATIONS   4,031 CITATIONS    157 PUBLICATIONS   1,170 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Smart City View project

WuKong: Intelligent Virtual Middleware for IoT/M2M View project

All content following this page was uploaded by Chi-Sheng Shih on 06 April 2017.

The user has requested enhancement of the downloaded file.





 

      
  


 



 

 



  



 






!

          

   %        &





  
             
    

        $          
     
              ' 

   
  
   
 
     ( ) *    
   

           

 !
        

        
  
      
          ! 
  
 
  
  
       +
    
     
 
 
     
            
 
       
    
             
  

        
    ,    
!  
 
    

 
            
 
 "#$%  
&
           

 
 
   
      
 "              
  

    % 
  '              , 
"      % (
)
 
         
    
  #$
    

 


           
      
             
           
          
  

        
   !
   

 

  

       !*        !  
       
       -+.       
                    
    
  
      #      
                 
       

            /   
     
                 
 " 
  
      !             
          '           
    

 "           

      
         

   


  Æ                   
  
                
  
  
   ! #   
        
 
  
     $
  *     /  



            
     
  
     )               34 
   "        /  
    
 

    
   
     
  
   
              

          ;  
   *
   
 
     

 


 
       

      +   







"      
        


  -0 1.        

          #    

     

       
 
        
 

  $
  !/       

 * ! )   

            



  !       


                < 
 
         

      

     
                     
  
       2           
  3   23      !   -0.  
     
  
    4     67   =      !
    
     23    
       



         
        

                 
*     !*   
                    ,    
  

    * %
   23      

  $   
 !   ,    

   
        

             & #

        
      *    

  ,       
    
   & #
"      *  
      ,         
 5       

 
  
      


       #   6     *      
 23        #   7          
 
    !   #   8  


  

#    9     %  
      

   

            

     

 $  

 

   
  
          

    &    

>   
 


  


"   
           "
  
 
    
   &     
            
  

 (       

    
 ,    
      "   
    
       

+ 




   ;?% -9.    

 /   
  !  4 




 
 

  ;?% -+.  

 '  
      
 @ 2          

        !    /!   A  

  

     ! 




*       *     
  *          


%  
        
   34    -:. 
    
    
 

   

    *    



   
   
  

"     *       
 

 
    


 

  
        

     
    *     
   "   
   >  


 B  



 5
        


 

 ;  
     =    /    5 
  
   *   



  
  

  


      
  
  


 
          


         
                  
   
           

 
     

   



   
+    !  


     
 !  


      
  


          
          



       
    
,



  
         

    
   


>  

       





 





     B   





 


           


- .








 
!          /



6
 ' ,
  
 >   B
    + 
+ 



 + 7


  

            ! 
  % 
 
    

A + 8
      
      



      

 


  
 


+  
+  
    9
     C   
 D     
 
  
+ 

   :
         
/   
    *    


 * ! ) E( '  2EF  *  
+  
+   > > 
   


    

1




 
     
   *
  > -   .     
  
    /      




        
 
     
 # 
 $
   
        6  
 23           '      *    7 
  
        "     2EF  *    ;?%
     
       8       
   
    *   !     



 > 

  > 


   

 *    

   ;?% -+.



     *     *



   9  :        
 E(      / ,          

 /    1     

        




   


   
  
 

 

         
       
        

 
           
   !
      
/    
"#$%   
 
  

   &   5  
     
   

 
   
&  & 
  ' (  ) 

     &   
        23  
          
 Ì   !

       

     !
% 



Ì 
 
         &    


 
    ) & !
%           
        
 
     
      
      
       
      


  "  
   /   
"        !   
         
 *     '             
 
!   '                 
2EF  

     
       /     
  
       
     
     

                   
 
  !  

 >
A % !      


         /   
      
  



      $
 
  

 
           
   
      
            



          
  
  ,     


         
    
        



    /  Æ    


23     /        /   C D 
      *   "             
 

  
     
  ! 




    23   
 
 

 >
A > 
B
  A


          



7 %   *     
 6       
,
3.1 The CoRAl algorithm

" 23       (   


 
  >  





-0.
        *     




- .



   
      $
 

  


  23    
     0
    (  , +   ' ,
   

         
 ;?%  # 5  
     
G 


 + +G

          
    2       ! 
          
    (  
  , 
) 
+  
G  
    ++
      *     
             

     
 
  &
      
    "   
+  
G   > #
       23  +5




    
)        

    8  :     
            

 
       

    !     (   C D  
  
           23      
   *           !     (
  !        
      65     
"        (         
)   
      
 
)  
     "
   

          23   

    
 
  
       
      

      
  23       
       
  

        


           
   
   *


  
   
 *     
!  

    


+   *&           
   
 <


          
     

     #        
+           #   

       
  

       
          
    *  '          
   


     
      +6 ;!     
 
        
 *   
     
66 @        
      
    
 Initialization

 
       

     
     
 4   
          23 , Run the SLSS algorithm for node 1 Run the SLSS algorithm for node N

     

    
 Compute bottlenecks and leader’s frequencies

         


True
bn
∀i, fi = f i
 
     Evaluate the terminating condition
False

     

    

Compute the max frequency for each end−to−end task


      
  



  
    
Figure 1. Flow chart of the CoRAl algorithm.
     23      
      
 

    
    *  
    /        
        G    
 
        

+       >  B     +6
   
     /    !  

                 
      >  

       
     
     *      
     G    +       

   
 
 
    
              23    &
             !          
          /        !   
             
 CD  C 
D     
  3.2 Extended SLSS algorithm
23        
  
 % +,
      23    
        /     !  
    
  


         
    
+     

> B #             
          )
          
     66     $

   !  (        23        ( 
   65 
         -0.     E(
 
     
# !           
      
   
  !    >  > 


           

      
   67 !     
 

 
#      E(    
  

   >  >    

 

           %  

      !  (
   
  &               
         
   /     

 
    
      
  
 -  
        

  
 >  " # "  

55
         !


    ! =     >  "  " 

 56
    +
     
  , " > H   
 
 
57




" > H   

  
58

   >



    >      +7
 

 

' ,  -5. ¾



 + +8             
            , +

  

        !

+ +9
 
           
 >  #  



         

    5            
    /    *   
    # 6    
   
     !   
    B+          
 (  
          
    @ ,
         
  +    
 

          

  ,   -      
  !     
 > G

   .  +
 / 
)  >     
    #  

 0             ! 
  / " > H   
  " >
  


 H    #  /       

 


 
+
 
   5+  /
 
  " # " 



 
 
 



 >   H    
 B +  

            


        
  
  B

  
 B +  


+             $

+:
         
  

  


           
    
  ,  
  
 
H        H    
 
+1 
 
      ;   
  
H   
 
 
 &                

           
H >
 +0    +:  5G "      
     
      
               

H  +        /    
>  +





 

!B
 
B   

  
 

     
 5G 3.3 Theoretical validation of the model

! > 
        

 

 G           
 *     
23          
!B



 
B




  
B  HH

+
'       *     
 
 !  
     
     
      


 
 
    
5+    
       
  
      !  *   
   *   
  , +    '  > 5()  
  51


     # 5    

 !        
$  * > G   +$$
 
 
  #$ 
   
    
    B+    *! 
> )   50
      B +
 
   


         )  
 
0         
 
 C    D   

 
 
       ) > +
    

   
 6


 -5. ¾  7  -5.       

        51     
    
 '      
 ! $        *!
  !          *
  
 &
 
  #$      *  
 '    
                    
$&$ &
,%      
 


    59 /  

 '        
   *     

 

 
 '       
    
     ) 
 -5. ¾     '     
   
      
           
 " $     +
    !#   E(
> )     

    0  "1% "23% "22%  "24%   
         23   
   #$ 
  
     

     E(    ! 
    (      /   
 
-5.     ! ,
  H >  
 


 -5. ¾  
    ,

 
 
H   
      H   

3.4 Modeling the PLI as power function

 
      6  23     " >H 
 
 


          

  

 %       " > H 

 
 

  


 
          5+    
,
         

 "    
5     
     E(   
,



 B
 



    H B
 

+
 


H 



   >   
5:    
6G

 
 
  
   
     
     ,     

 
   - 
 

  &
 
   


   
 '      
0 0
$%
$  -5.   #     !./%  
 
    
 0  0
         ' 0 0 
     $&$        1     !
 *  !.2%%
     +:    
,             

      ,

  
+
 



 
 
  
   67
 >  >   
 B +   
  

      

  
 B +  



    
     
6+  & 

    
    5G    
,   23      / !

 *  9 
  57  

 
 



H
 
  *  +8 
  ++7 



 ;      8GG 

 >   

 65 
)        
+


  




 

 
          
    ,
=   (      23  
      
   
 
G 
  +

 

*  
'    
    

 ! 


    
      8  +G   

% 5  % 6 
  
        23 
         ,  !  
 &     
    

          
   /    
             & 

             
         
           !   /     !   
      23                 
   
         
      

     *    @           
      23      :0        
 
         
     
 

 '   ,          

* 


  "       "          
   >   +  -           23   
  
   "  
    
!
           
  &    !     
 & 

, 7 
  &         
  +8  
  9 
  58  
 
             
,          

        
  > . "
66 
  -8  8G.     

         

 . > +1  / > G9
       
  -+  6G. $*     

      !         > G %   
  23  
           


 *       
    #           0
  '

        )       
,
           
           


#
  $%& 

   23        
 '> 

      
   
#

           ;         
 3  &

  
  

     
  & 
   
  
            23    ,1
 Representation of the overall error Representation of the overall error
300 300

250 250

200 200

Overall error at the xth step

Overall error at the xth step

150 150

100 100

50 50

0 0
1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10
Steps of the algorithm Steps of the algorithm

Figure 2. Convergence speed for a Figure 3. Convergence speed for a

network of 6 nodes. network of 15 nodes.
Mean and dispersion of the errors of each task Speed evaluation of CoRAl
0.12 3.2
Accepted Error=0.1 (10%)

0.1 Average number of step=13.000000 3.1

Ratio between Optimal Solution time and Coral time

Accepted Error=0.05 (5%)
0.08 3

0.06 2.9
Mean and dispersion of each task

0.04 µ+σ 2.8

0.02 2.7

µ
0 2.6 Accepted Error=0.01 (1%)

−0.02 2.5
µ−σ Accepted Error=0.005 (0.5%)

−0.04 2.4

−0.06 2.3 Accepted Error=0.001 (0.1%)

−0.08 2.2
0 5 10 15 20 25 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.1
Tasks Accepted Error as Termination Condition

Figure 4. Mean and variance of Figure 5. Speed evaluation of the

CoRAl accuracy with 6 nodes. CoRAl algorithm.

 % 7 
     23     '      
    
  9   
      $
   
           *            
   
#       !           
          
    
      
6I
    
  -+. 2    
%   


  9     @ 2    ;?% 

 58  
 % 8 
       

       #

@      23    
    
      
   *    @ ,       !       
 23   59   
        
  *   
  > +I  65   
  > +GI
        

 -1. 3'
      J  
  
     J3 @   

        
 -0.             "        /  
   
)     *              
         !*           
   
      '         "   
  & 
          23           
"   
     )     *       
*     
                  
   &   $
   /        1  # 
                     
  
        23 

  6I    


 
  -7 8 6. 3'
      !  23   
    !  
    J3 @  !           *     
        *   2?@ 
  


 #     

    J
           #$% "

    
           %  223G56:117      %
/           223G658:+9

   /   # 

    
      
           
! 
 
  -+G. K     

  

    #! 

  
  
 
 


   !!     "  #!! $

!       -+.     !  %& '!(

 
  
   

 "        
)* +,,+
    2?@      +  
 * - !  

   &  


  #!! !  %& '!(
 
 

       


   .//  /!!/-*/ $

          

+0+,,1$++21,+/ !
3
+,,1

 J  *    /     1   !

4 45'
6 7!
6  '3
$

    

     

* 4!     "  $ !!  8  9$


     $
   



 

   

 (

     9         
3 +,,1
    L
      
 2  
6  '3
4 45'
) & '
9

=        

    83 " - 9  & )! 8  9$

      !     !(

 
   


  
        
)*
:::
;  
6  '3
) & '
4 45'
6



 7!
 *      $4! 

8   *(

 
  
   
)*
:::
  
       <    6# 3
   !

    23    / "      7 $= >- $

  


  
    (

 
  +,?
@

:01
 2,A<

 
        )     0 6 
4 = 3!!(
 
+,,,
     
 
    B 4 45'
 
6  '3  ) & '

        

 "
  4!       "  8  (

             
 

     
  


    
  
)*
::0
         &   : ) 
6  '3
   C  9 =!'

 
  !*       *3  4$=    3!(

 

"              
)*

           
::<

 
, D 

8 #
 
 # 7
9 8 

          EF3 !! "  4$= #$

23     !    " ! !! !  %& '!(

 
  
          &    

G
)* +,,1

View publication stats