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

Energy Efficient Routing Algorithm on the Target Tracking in Wireless Sensor Network

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

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

    AdMiN Administrator هیات مدیره

    Abstract—Wireless Sensor Network (WSN) has many applications in day to day life. One of the applications of WSN is target tracking that uses sensors to track and localize the targets. This makes sensor node deployment in a network necessary and highly important. But the main challenge faced by sensor networks is the power consumption by sensor nodes. Hence an energy optimization technique must be in place that ultimately reduces the actual power consumption of the sensor nodes. Here, the shortest path algorithms are used in routing and it helps in reducing the energy consumption. The shortest path algorithms used in wireless sensor network are Dijkstra’s algorithm and Floyd-Warshall’s algorithm. They are also used for calculating throughput, packet delivery ratio and energy consumption for given number of nodes. The Floyd-Warshall’s algorithm is not scalable and efficient for routing in WSN. Hence, we use modified Floyd- Warshall’s algorithm that obtains better throughput, packet delivery ratio and minimized energy consumption. The new Modified Floyd-Warshall’s algorithm calculates the shortest path from node to node by adding an acknowledgment mechanism. We have done a comparative analysis of Dijkstra’s algorithm, Floyd-Warshall’s algorithm, and modified Floyd- Warshall’s algorithm for parameters like packet deliver ratio, throughput, and energy optimization for multiple nodes. From simulation results it is observed that the modified Floyd-Warshall’s algorithm works better than Dijkstra’s and FloydWarshall’s algorithm in terms of Packet Delivery ratio, throughput and energy consumption.
    لینک دانلود در پست بعد برای اعضاء قابل مشاهده است.
     
وضعیت موضوع:
You must be a logged-in, registered member of this site to view further posts in this thread.

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