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

A security framework for content retrieval in DTNs

شروع موضوع توسط AdMiN ‏4/6/17 در انجمن انجمن DTN

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

    AdMiN Administrator هیات مدیره

    In this paper, we address several security issues in our previously proposed content retrieval scheme for Disruption Tolerant Networks (DTNs). The content retrieval is built upon the social-tie relationships among DTN nodes for routing and content lookup service placement. Malicious nodes can launch attacks by advertising falsified social-tie information to attract and drop packets intended for other nodes, or simply disrupt and destroy the query and delivery paths. Furthermore, selfish nodes, while not seeking to attack, are unwilling to forward packets of others. Both malicious and selfish behaviors contribute to the deterioration of the content retrieval performance. To address the problem, we propose to secure both social-tie records and content delivery records during a contact between two nodes. The unforgeable social-tie records prevent malicious nodes from falsifying the social-tie information. The delivery records from which the packet forwarding ratio of a node is computed, help detect selfish behavior. Lastly, we propose a blacklist distribution method that allows nodes to filter out misbehaving nodes from their social contact graph, effectively preventing network traffic from flowing to misbehaving nodes. Extensive real-trace-driven simulation results show that our scheme can detect misbehaving nodes and mitigate their effects efficiently, thus improving the content retrieval performance.​

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

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