scholarly journals The Dynamical Modeling Analysis of the Spreading of Passive Worms in P2P Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Shujuan Zhang ◽  
Zhen Jin ◽  
Juan Zhang
Keyword(s):  
Reproduction Number ◽  
Propagation Speed ◽  
Peer Networks ◽  
Positive Equilibrium ◽  
Hop Count ◽  
Network Heterogeneity ◽  
Immunization Strategies ◽  
Modeling Analysis ◽  
Proposed Model ◽  
Peer To Peer Networks

Passive worms are prone to spreading through Peer-to-Peer networks, and they pose a great threat to the security of the network. In this paper, considering network heterogeneity and the number of hops a search can reach, we propose a novel mathematical model to study the dynamics of the propagation of passive worms. For the proposed model, the basic reproduction number R0 is derived by employing the existence of the positive equilibrium. And the stabilities of the worm-free equilibrium and positive equilibrium are analyzed. Moreover, we verify the rationality of the model established by comparing the stochastic simulation with the numerical simulation. Finally, we examine the effect of the number of hops on the spread of passive worms and discuss the various immunization strategies. We find that if R0>1, the propagation speed of passive worms is accelerated with the increase of hop count d; if R0<1, the number of infected peers decreases rapidly with the increase of the value of d and drops to zero eventually. Results show that the network topology and the number of hops can affect the spread of passive worms.

scholarly journals Secure Access Control to IoT Devices using Blockchain

2019 ◽  
Vol 8 (2) ◽  
pp. 3064-3070 ◽  
Keyword(s):  
Smart Home ◽  
Single Point ◽  
Qualitative Evaluation ◽  
Peer Networks ◽  
Privacy And Security ◽  
Proposed Model ◽  
Peer To Peer Networks ◽  
Iot Devices ◽  
Two Parameters

Internet of Things (IoT) is growing at an exponential rate but the area of privacy and security in IoT still remains unexplored. The existing algorithms or methods are mainly centralized and hence they are vulnerable due to their single point authentication topology. As it has been estimated that by 2020 there will be more ‘things’ than people on this earth the problem of security becomes a major concern in IoT networks, as a person having control to an IoT network will be able to control a large portion of an organization. Blockchain has recently been used to provide security to peer-to-peer networks. Blockchains are computationally expensive, heavyweight and are considered unsuitable for IoT architecture. In this paper a new lightweight and secure architecture for IoT by using Ethereum Blockchain retaining most of its security providing powers is proposed. Since Blockchain is decentralized it solves the single point authentication problem existing in IoT networks. A Smart Home System as a representative case study has been implemented for broader IoT applications. The two parameters measured are temperature and intrusion detection. The proposed model tackles some more challenges that exist in IoT networks. The Qualitative evaluation of the proposed architecture highlights how it tackles various attacks.

Partition Nodes: Topologically-Critical Nodes of Unstructured Peer-to-Peer Networks

2008 ◽  
Vol 19 (9) ◽  
pp. 2376-2388 ◽  
Author(s):  
Zhen-Hua LI ◽  
Gui-Hai CHEN ◽  
Tong-Qing QIU
Keyword(s):  
Peer To Peer ◽  
Peer Networks ◽  
Critical Nodes ◽  
Peer To Peer Networks

An Aware Ant Routing Algorithm in Mobile Peer-To-Peer Networks

2014 ◽  
Vol 36 (7) ◽  
pp. 1456-1464 ◽  
Author(s):  
Da-Peng QU ◽  
Xing-Wei WANG ◽  
Min HUANG
Keyword(s):  
Routing Algorithm ◽  
Peer To Peer ◽  
Peer Networks ◽  
Peer To Peer Networks

A Novel Super-Peer Based Trust Model for Peer-to-Peer Networks

2010 ◽  
Vol 33 (2) ◽  
pp. 345-355 ◽  
Author(s):  
Chun-Qi TIAN ◽  
Jian-Hui JIANG ◽  
Zhi-Guo HU ◽  
Feng LI
Keyword(s):  
Trust Model ◽  
Peer To Peer ◽  
Peer Networks ◽  
Peer To Peer Networks ◽  
Super Peer

Network search

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Web Search ◽  
Distributed Databases ◽  
Small World ◽  
Peer Networks ◽  
Model Parameters ◽  
Breadth First Search ◽  
Ranking Algorithms ◽  
Network Search ◽  
Peer To Peer Networks ◽  
Search Processes

This chapter gives a discussion of search processes on networks. It begins with a discussion of web search, including crawlers and web ranking algorithms such as PageRank. Search in distributed databases such as peer-to-peer networks is also discussed, including simple breadth-first search style algorithms and more advanced “supernode” approaches. Finally, network navigation is discussed at some length, motivated by consideration of Milgram's letter passing experiment. Kleinberg's variant of the small-world model is introduced and it is shown that efficient navigation is possible only for certain values of the model parameters. Similar results are also derived for the hierarchical model of Watts et al.

Multiple description coded video streaming in peer-to-peer networks

2012 ◽  
Vol 27 (5) ◽  
pp. 412-429 ◽  
Author(s):  
Yuanyuan Xu ◽  
Ce Zhu ◽  
Wenjun Zeng ◽  
Xue Jun Li
Keyword(s):  
Video Streaming ◽  
Peer To Peer ◽  
Peer Networks ◽  
Multiple Description ◽  
Peer To Peer Networks
Sign in / Sign up

Export Citation Format

Share Document