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

Interference-fault free transmission schedule in tree-structured WSN

شروع موضوع توسط AdMiN ‏9/8/17 در انجمن مدیریت خطا و تحمل پذیری خطا

وضعیت موضوع:
You must be a logged-in, registered member of this site to view further posts in this thread.
  1. AdMiN

    AdMiN Administrator هیات مدیره

    Interference due to concurrent link transmissions has for long been recognized as a major cause for issues like packet retransmissions, distorted signal strength and communication link failures in WSN. The two best known approaches to model interference, namely the Protocol Interference (PrI) and Physical Interference models, fail to identify all Potential Interferers (PIs) to a given link. Therefore, the two models have limited utility in determining an Interference-Fault Free Transmission (IFFT) schedule for all active links in the network. This leads to serious repercussions, especially in tree-structured WSNs, where data aggregation is hierarchical. In a pioneering work done earlier, we have developed Composite Interference Mapping (CIM) model, which succeeds in identifying the PIs of all active links in a network. In this paper, we implement the CIM model to map PIs of all transmission links in a tree-structured WSN. We develop an IFFT-Tree algorithm to obtain an IFFT schedule for all links in an aggregation tree, and analytically prove that the algorithm is both optimal and complete. To support our analytical studies, we implement the IFFT-Tree algorithm and carry out extensive simulations to show that the algorithm minimizes the number of time slots required to schedule all active links. We introduce three new performance metrics to study the performance of IFFT-Tree algorithm, and to compare the efficacy of the CIM model with PrI model. The results of the simulations prove that the PrI model identifies only a small subset of total PIs identified by the CIM model. This finding highlights the threat to the credibility of data being aggregated along the tree, if interference-faults arising due to PIs which are not identified by the PrI model, proliferate into the tree-structured WSN.​


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

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