2,207 research outputs found
Phase transition for the Maki-Thompson rumour model on a small-world network
We consider the Maki-Thompson model for the stochastic propagation of a
rumour within a population. We extend the original hypothesis of homogenously
mixed population by allowing for a small-world network embedding the model.
This structure is realized starting from a -regular ring and by inserting,
in the average, additional links in such a way that and are
tuneable parameter for the population architecture. We prove that this system
exhibits a transition between regimes of localization (where the final number
of stiflers is at most logarithmic in the population size) and propagation
(where the final number of stiflers grows algebraically with the population
size) at a finite value of the network parameter . A quantitative estimate
for the critical value of is obtained via extensive numerical simulations.Comment: 24 pages, 4 figure
A general Markov chain approach for disease and rumour spreading in complex networks
Spreading processes are ubiquitous in natural and artificial systems. They can be studied via a plethora of models, depending on the specific details of the phenomena under study. Disease contagion and rumour spreading are among the most important of these processes due to their practical relevance. However, despite the similarities between them, current models address both spreading dynamics separately. In this article, we propose a general spreading model that is based on discrete time Markov chains. The model includes all the transitions that are plausible for both a disease contagion process and rumour propagation. We show that our model not only covers the traditional spreading schemes but that it also contains some features relevant in social dynamics, such as apathy, forgetting, and lost/recovering of interest. The model is evaluated analytically to obtain the spreading thresholds and the early time dynamical behaviour for the contact and reactive processes in several scenarios. Comparison with Monte Carlo simulations shows that the Markov chain formalism is highly accurate while it excels in computational efficiency. We round off our work by showing how the proposed framework can be applied to the study of spreading processes occurring on social networks
An Energy Aware and Secure MAC Protocol for Tackling Denial of Sleep Attacks in Wireless Sensor Networks
Wireless sensor networks which form part of the core for the Internet of Things consist of resource constrained sensors that are usually powered by batteries. Therefore, careful
energy awareness is essential when working with these devices.
Indeed,the introduction of security techniques such as authentication and encryption, to ensure confidentiality and integrity of data, can place higher energy load on the sensors. However, the absence of security protection c ould give room for energy drain attacks such as denial of sleep attacks which have a higher negative impact on the life span ( of the sensors than the presence of security features.
This thesis, therefore, focuses on tackling denial of sleep attacks from two perspectives A security perspective and an energy efficiency perspective. The security perspective involves evaluating and ranking a number of security based techniques to curbing denial of sleep attacks. The energy efficiency perspective, on the other hand, involves exploring duty cycling and simulating three Media Access Control ( protocols Sensor MAC, Timeout MAC andTunableMAC under different network sizes and measuring different parameters such as the Received Signal Strength RSSI) and Link Quality Indicator ( Transmit power, throughput and energy efficiency Duty cycling happens to be one of the major techniques for conserving energy in wireless sensor networks and this research aims to answer questions with regards to the effect of duty cycles on the energy efficiency as well as the throughput of three duty cycle protocols Sensor MAC ( Timeout MAC ( and TunableMAC in addition to creating a novel MAC protocol that is also more resilient to denial of sleep a ttacks than existing protocols.
The main contributions to knowledge from this thesis are the developed framework used for evaluation of existing denial of sleep attack solutions and the algorithms which fuel the other contribution to knowledge a newly developed protocol tested on the Castalia Simulator on the OMNET++ platform. The new protocol has been compared with existing protocols and
has been found to have significant improvement in energy efficiency and also better resilience to denial of sleep at tacks Part of this research has been published Two conference
publications in IEEE Explore and one workshop paper
Cascading Behaviour in Complex Soci-Technical Networks
Most human interactions today take place with the mediation of information and communications technology. This is extending the boundaries of interdependence: the group of reference, ideas and behaviour to which people are exposed is larger and less restricted to old geographical and cultural boundaries; but it is also providing more and better data with which to build more informative models on the effects of social interactions, amongst them, the way in which contagion and cascades diffuse in social networks. Online data are not only helping us gain deeper insights into the structural complexity of social systems, they are also illuminating the consequences of that complexity, especially around collective and temporal dynamics. This paper offers an overview of the models and applications that have been developed in what is still a nascent area of research, as well as an outline of immediate lines of work that promise to open new vistas in our understanding of cascading behaviour in social networks
A Computational Model and Convergence Theorem for Rumor Dissemination in Social Networks
The spread of rumors, which are known as unverified statements of uncertain
origin, may cause tremendous number of social problems. If it would be possible
to identify factors affecting spreading a rumor (such as agents' desires, trust
network, etc.), then this could be used to slowdown or stop its spreading. A
computational model that includes rumor features and the way a rumor is spread
among society's members, based on their desires, is therefore needed. Our
research is centering on the relation between the homogeneity of the society
and rumor convergence in it and result shows that the homogeneity of the
society is a necessary condition for convergence of the spreading rumor.Comment: 29 pages, 7 figure
The Impact of Social Curiosity on Information Spreading on Networks
Most information spreading models consider that all individuals are identical
psychologically. They ignore, for instance, the curiosity level of people,
which may indicate that they can be influenced to seek for information given
their interest. For example, the game Pok\'emon GO spread rapidly because of
the aroused curiosity among users. This paper proposes an information
propagation model considering the curiosity level of each individual, which is
a dynamical parameter that evolves over time. We evaluate the efficiency of our
model in contrast to traditional information propagation models, like SIR or
IC, and perform analysis on different types of artificial and real-world
networks, like Google+, Facebook, and the United States roads map. We present a
mean-field approach that reproduces with a good accuracy the evolution of
macroscopic quantities, such as the density of stiflers, for the system's
behavior with the curiosity. We also obtain an analytical solution of the
mean-field equations that allows to predicts a transition from a phase where
the information remains confined to a small number of users to a phase where it
spreads over a large fraction of the population. The results indicate that the
curiosity increases the information spreading in all networks as compared with
the spreading without curiosity, and that this increase is larger in spatial
networks than in social networks. When the curiosity is taken into account, the
maximum number of informed individuals is reached close to the transition
point. Since curious people are more open to a new product, concepts, and
ideas, this is an important factor to be considered in propagation modeling.
Our results contribute to the understanding of the interplay between diffusion
process and dynamical heterogeneous transmission in social networks.Comment: 8 pages, 5 figure
- …