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

Cluster-Based Routing for the Mobile Sink in Wireless Sensor Networks With Obstacles

شروع موضوع توسط AdMiN ‏5/8/16 در انجمن الگوریتم های مسیریابی

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

    AdMiN Administrator هیات مدیره

    In wireless sensor networks (WSNs), the benets of exploiting the sink mobility to prolong
    network lifetime have been well recognized. In physical environments, all kinds of obstacles could exit in
    the sensing eld. Therefore, a research challenge is how to efciently dispatch the mobile sink to nd an
    obstacle-avoiding shortest route. This paper presents an energy-efcient routing mechanism based on the
    cluster-based method for the mobile sink in WSNs with obstacles. According to the cluster-based method,
    the nodes selected as cluster heads collect data from their cluster members and transfer the data collected
    to the mobile sink. In this paper, the mobile sink starts the data-gathering route periodically from the
    starting site, then directly collects data from these cluster heads in a single-hop range, and nally returns
    to the starting site. However, due to the complexity of the scheduling problem in WSNs with obstacles, the
    conventional algorithms are difcult to resolve. To remedy this issue, we propose an efcient scheduling
    mechanism based on spanning graphs in this paper. Based on the spanning graph, we present a heuristic
    tour-planning algorithm for the mobile sink to nd the obstacle-avoiding shortest route. Simulation results
    verify the effectiveness of our method.​
    لینک دانلود در پست بعد برای اعضاء قابل مشاهده است.​
     
وضعیت موضوع:
You must be a logged-in, registered member of this site to view further posts in this thread.

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