1.   مشاوره و انجام پروپوزال  و پایان نامه ، مشاوره در زمینه ارائه سمینار، 
       مشاوره و انجام مقاله های بین المللی و داخلی، 
       مشاوره و انجام مقاله در مجله های علمی پژوهشی معتبر، 
        مشاوره و آموزش شبیه سازی شبکه توسط شبیه ساز آکادمیک 2-NS، 
         مشاوره و آموزش شبیه سازهای ترافیک شهری از قبیل  SUMO، ONE، و ...
          کمک به دانشجویان برای پیاده سازی ایده ها و مقالات خود با شبیه سازهای
               NS2, NS3 , OMNET++ , ONE
     
    
                 شماره تماس :
                         حسین رنجبران:    09101607834   
                                          
    
                  ساعات تماس: 
                                      ۸ الی ۲۰
                         
                   ایمیل:
                         hossein.ranjbaran.it@gmail.com
                        
           
    

An efficient resource allocation algorithm based on vertex coloring to mitigate interference among

شروع موضوع توسط Hossein Ranjbaran ‏5/2/20 در انجمن انجمن WBAN

وضعیت موضوع:
You must be a logged-in, registered member of this site to view further posts in this thread.
  1. Administrator
    Hossein Ranjbaran
    کاربر ویژه
    تاریخ عضویت:
    ‏3/10/13
    ارسال ها:
    1,030
    تشکر شده:
    197
    Interference among adjacent or overlapping Wireless Body Area Networks (WBAN) can cause serious performance degradation and energy wastage. This paper proposes a new resource allocation algorithm based on vertex coloring to provide performance efficiency and reliability in coexisting WBANs. Interference among coexisting WBANs is modeled as an m-vertex graph G; where a vertex represents a WBAN and an edge represents interference between the two adjacent WBANs. Reliability is achieved by allocating different resources (time slots) to any two adjacent WBANs. Allocating non-overlapping time intervals to adjacent WBANs avoids interference. We prove that by using the proposed algorithm, the amount of resource obtained by each vertex is always more than the amount given by (Δ(G)+1)" role="presentation">-coloring and sometimes even more than the amount given by χ(G)-coloring, where Δ(G) is the maximum vertex degree and χ(G) is the chromatic number of graph G. Moreover, it is demonstrated using game theoretic principles that while selfish vertices obtain unequal amount of resources, they have no motivation to disobey the rules of our proposed algorithm. The number of time slots required to allocate resource to G is O(Δ2(G)) and at most m. The number of transmitted messages by each vertex for resource allocation is at most one. The theoretical analysis is confirmed by extensive OPNET simulations.​

    لینک دانلود در پست بعد برای اعضاء قابل مشاهده است.
     
وضعیت موضوع:
You must be a logged-in, registered member of this site to view further posts in this thread.

این صفحه را به اشتراک بگذارید