288 research outputs found
Swarm-based Intelligent Routing (SIR) - a new approach for efficient routing in content centric delay tolerant networks
This paper introduces Swarm-based Intelligent Routing (SIR), a swarm intelligence based approach used for routing content in content centric Pocket Switched Networks. We first formalize the notion of optimal path in DTN, then introduce a swarm intelligence based routing protocol adapted to content centric DTN that use a publish/subscribe communication paradigm. The protocol works in a fully decentralized way in which nodes do not have any knowledge about the global topology. Nodes, via opportunistic contacts, update utility functions which synthesizes their spatio-temporal proximity from the content subscribers. This individual behavior applied by each node leads to the collective formation of gradient fields between content subscribers and content providers. Therefore, content routing simply sums up to follow the steepest slope along these gradient fields to reach subscribers who are located at the minima of the field. Via real traces analysis and simulation, we demonstrate the existence and relevance of such gradient field and show routing performance improvements when compared to classical routing protocols previously defined for information routing in DTN
PROTECT: Proximity-based Trust-advisor using Encounters for Mobile Societies
Many interactions between network users rely on trust, which is becoming
particularly important given the security breaches in the Internet today. These
problems are further exacerbated by the dynamics in wireless mobile networks.
In this paper we address the issue of trust advisory and establishment in
mobile networks, with application to ad hoc networks, including DTNs. We
utilize encounters in mobile societies in novel ways, noticing that mobility
provides opportunities to build proximity, location and similarity based trust.
Four new trust advisor filters are introduced - including encounter frequency,
duration, behavior vectors and behavior matrices - and evaluated over an
extensive set of real-world traces collected from a major university. Two sets
of statistical analyses are performed; the first examines the underlying
encounter relationships in mobile societies, and the second evaluates DTN
routing in mobile peer-to-peer networks using trust and selfishness models. We
find that for the analyzed trace, trust filters are stable in terms of growth
with time (3 filters have close to 90% overlap of users over a period of 9
weeks) and the results produced by different filters are noticeably different.
In our analysis for trust and selfishness model, our trust filters largely undo
the effect of selfishness on the unreachability in a network. Thus improving
the connectivity in a network with selfish nodes.
We hope that our initial promising results open the door for further research
on proximity-based trust
A survey on Human Mobility and its applications
Human Mobility has attracted attentions from different fields of studies such
as epidemic modeling, traffic engineering, traffic prediction and urban
planning. In this survey we review major characteristics of human mobility
studies including from trajectory-based studies to studies using graph and
network theory. In trajectory-based studies statistical measures such as jump
length distribution and radius of gyration are analyzed in order to investigate
how people move in their daily life, and if it is possible to model this
individual movements and make prediction based on them. Using graph in mobility
studies, helps to investigate the dynamic behavior of the system, such as
diffusion and flow in the network and makes it easier to estimate how much one
part of the network influences another by using metrics like centrality
measures. We aim to study population flow in transportation networks using
mobility data to derive models and patterns, and to develop new applications in
predicting phenomena such as congestion. Human Mobility studies with the new
generation of mobility data provided by cellular phone networks, arise new
challenges such as data storing, data representation, data analysis and
computation complexity. A comparative review of different data types used in
current tools and applications of Human Mobility studies leads us to new
approaches for dealing with mentioned challenges
Multipoint Relay Selection based on Stability of Spatial Relation in Mobile Ad hoc Networks
Increasing stability is one of the main objectives in designing routing protocols for Mobile Ad-Hoc Network (MANETS). Various research schemes have been addressed to this challenge and to support it. In fact, some papers have considered modifications to MPRs selection mechanism in OLSR. In this paper, the author proposes a new mechanism to elect stable and sustainable nodes relay between all nodes in MANETs. In this mechanism, a mobility function is used as the main selection criterion based on the calculation of the spatial relation of a node relative to its neighbor. This mechanism is applied in OLSR protocol to choose stable and supportable MPRs nodes. This mechanism significantly finds more stable MPRs and it promises QoS metrics such as lost packets and delay. Simulation results reveals a significant performance gains and it motivates further examinations to develop the mechanism in order to improve the routing protocol requirements. Performances are evaluated based on Random Waypoint model and network simulator ns3
Temporal Networks
A great variety of systems in nature, society and technology -- from the web
of sexual contacts to the Internet, from the nervous system to power grids --
can be modeled as graphs of vertices coupled by edges. The network structure,
describing how the graph is wired, helps us understand, predict and optimize
the behavior of dynamical systems. In many cases, however, the edges are not
continuously active. As an example, in networks of communication via email,
text messages, or phone calls, edges represent sequences of instantaneous or
practically instantaneous contacts. In some cases, edges are active for
non-negligible periods of time: e.g., the proximity patterns of inpatients at
hospitals can be represented by a graph where an edge between two individuals
is on throughout the time they are at the same ward. Like network topology, the
temporal structure of edge activations can affect dynamics of systems
interacting through the network, from disease contagion on the network of
patients to information diffusion over an e-mail network. In this review, we
present the emergent field of temporal networks, and discuss methods for
analyzing topological and temporal structure and models for elucidating their
relation to the behavior of dynamical systems. In the light of traditional
network theory, one can see this framework as moving the information of when
things happen from the dynamical system on the network, to the network itself.
Since fundamental properties, such as the transitivity of edges, do not
necessarily hold in temporal networks, many of these methods need to be quite
different from those for static networks
Modern temporal network theory: A colloquium
The power of any kind of network approach lies in the ability to simplify a
complex system so that one can better understand its function as a whole.
Sometimes it is beneficial, however, to include more information than in a
simple graph of only nodes and links. Adding information about times of
interactions can make predictions and mechanistic understanding more accurate.
The drawback, however, is that there are not so many methods available, partly
because temporal networks is a relatively young field, partly because it more
difficult to develop such methods compared to for static networks. In this
colloquium, we review the methods to analyze and model temporal networks and
processes taking place on them, focusing mainly on the last three years. This
includes the spreading of infectious disease, opinions, rumors, in social
networks; information packets in computer networks; various types of signaling
in biology, and more. We also discuss future directions.Comment: Final accepted versio
Spectrum Map and its Application in Cognitive Radio Networks
Recent measurements on radio spectrum usage have revealed the abundance of underutilized bands of spectrum that belong to licensed users. This necessitated the paradigm shift from static to dynamic spectrum access. Cognitive radio based secondary networks that utilize such unused spectrum holes in the licensed band, have been proposed as a possible solution to the spectrum crisis. The idea is to detect times when a particular licensed band is unused and use it for transmission without causing interference to the licensed user. We argue that prior knowledge about occupancy of such bands and the corresponding achievable performance metrics can potentially help secondary networks to devise effective strategies to improve utilization. In this work, we use Shepard\u27s method of interpolation to create a spectrum map that provides a spatial distribution of spectrum usage over a region of interest. It is achieved by intelligently fusing the spectrum usage reports shared by the secondary nodes at various locations. The obtained spectrum map is a continuous and differentiable 2-dimension distribution function in space. With the spectrum usage distribution known, we show how different radio spectrum and network performance metrics like channel capacity, secondary network throughput, spectral efficiency, and bit error rate can be estimated. We show the applicability of the spectrum map in solving the intra-cell channel allocation problem in centralized cognitive radio networks, such as IEEE 802.22. We propose a channel allocation scheme where the base station allocates interference free channels to the consumer premise equipments (CPE) using the spectrum map that it creates by fusing the spectrum usage information shared by some CPEs. The most suitable CPEs for information sharing are chosen on a dynamic basis using an iterative clustering algorithm. Next, we present a contention based media access control (MAC) protocol for distributed cognitive radio network. The unlicensed secondary users contend among themselves over a common control channel. Winners of the contention get to access the available channels ensuring high utilization and minimum collision with primary incumbent. Last, we propose a multi-channel, multi-hop routing protocol with secondary transmission power control. The spectrum map, created and maintained by a set of sensors, acts as the basis of finding the best route for every source destination pair. The proposed routing protocol ensures primary receiver protection and maximizes achievable link capacity. Through simulation experiments we show the correctness of the prediction model and how it can be used by secondary networks for strategic positioning of secondary transmitter-receiver pairs and selecting the best candidate channels. The simulation model mimics realistic distribution of TV stations for urban and non-urban areas. Results validate the nature and accuracy of estimation, prediction of performance metrics, and efficiency of the allocation process in an IEEE 802.22 network. Results for the proposed MAC protocol show high channel utilization with primary quality of service degradation within a tolerable limit. Performance evaluation of the proposed routing scheme reveals that it ensures primary receiver protection through secondary power control and maximizes route capacity
- …