5,142 research outputs found
Tracking Topology Dynamicity for Link Prediction in Intermittently Connected Wireless Networks
Through several studies, it has been highlighted that mobility patterns in
mobile networks are driven by human behaviors. This effect has been
particularly observed in intermittently connected networks like DTN (Delay
Tolerant Networks). Given that common social intentions generate similar human
behavior, it is relevant to exploit this knowledge in the network protocols
design, e.g. to identify the closeness degree between two nodes. In this paper,
we propose a temporal link prediction technique for DTN which quantifies the
behavior similarity between each pair of nodes and makes use of it to predict
future links. We attest that the tensor-based technique is effective for
temporal link prediction applied to the intermittently connected networks. The
validity of this method is proved when the prediction is made in a distributed
way (i.e. with local information) and its performance is compared to well-known
link prediction metrics proposed in the literature.Comment: Published in the proceedings of the 8th International Wireless
Communications and Mobile Computing Conference (IWCMC), Limassol, Cyprus,
201
Leveraging intelligence from network CDR data for interference aware energy consumption minimization
Cell densification is being perceived as the panacea for the imminent capacity crunch. However, high aggregated energy consumption and increased inter-cell interference (ICI) caused by densification, remain the two long-standing problems. We propose a novel network orchestration solution for simultaneously minimizing energy consumption and ICI in ultra-dense 5G networks. The proposed solution builds on a big data analysis of over 10 million CDRs from a real network that shows there exists strong spatio-temporal predictability in real network traffic patterns. Leveraging this we develop a novel scheme to pro-actively schedule radio resources and small cell sleep cycles yielding substantial energy savings and reduced ICI, without compromising the users QoS. This scheme is derived by formulating a joint Energy Consumption and ICI minimization problem and solving it through a combination of linear binary integer programming, and progressive analysis based heuristic algorithm. Evaluations using: 1) a HetNet deployment designed for Milan city where big data analytics are used on real CDRs data from the Telecom Italia network to model traffic patterns, 2) NS-3 based Monte-Carlo simulations with synthetic Poisson traffic show that, compared to full frequency reuse and always on approach, in best case, proposed scheme can reduce energy consumption in HetNets to 1/8th while providing same or better Qo
CT-Mapper: Mapping Sparse Multimodal Cellular Trajectories using a Multilayer Transportation Network
Mobile phone data have recently become an attractive source of information
about mobility behavior. Since cell phone data can be captured in a passive way
for a large user population, they can be harnessed to collect well-sampled
mobility information. In this paper, we propose CT-Mapper, an unsupervised
algorithm that enables the mapping of mobile phone traces over a multimodal
transport network. One of the main strengths of CT-Mapper is its capability to
map noisy sparse cellular multimodal trajectories over a multilayer
transportation network where the layers have different physical properties and
not only to map trajectories associated with a single layer. Such a network is
modeled by a large multilayer graph in which the nodes correspond to
metro/train stations or road intersections and edges correspond to connections
between them. The mapping problem is modeled by an unsupervised HMM where the
observations correspond to sparse user mobile trajectories and the hidden
states to the multilayer graph nodes. The HMM is unsupervised as the transition
and emission probabilities are inferred using respectively the physical
transportation properties and the information on the spatial coverage of
antenna base stations. To evaluate CT-Mapper we collected cellular traces with
their corresponding GPS trajectories for a group of volunteer users in Paris
and vicinity (France). We show that CT-Mapper is able to accurately retrieve
the real cell phone user paths despite the sparsity of the observed trace
trajectories. Furthermore our transition probability model is up to 20% more
accurate than other naive models.Comment: Under revision in Computer Communication Journa
Tensor-Based Link Prediction in Intermittently Connected Wireless Networks
Through several studies, it has been highlighted that mobility patterns in
mobile networks are driven by human behaviors. This effect has been
particularly observed in intermittently connected networks like DTN (Delay
Tolerant Networks). Given that common social intentions generate similar human
behavior, it is relevant to exploit this knowledge in the network protocols
design, e.g. to identify the closeness degree between two nodes. In this paper,
we propose a temporal link prediction technique for DTN which quantifies the
behavior similarity between each pair of nodes and makes use of it to predict
future links. Our prediction method keeps track of the spatio-temporal aspects
of nodes behaviors organized as a third-order tensor that aims to records the
evolution of the network topology. After collapsing the tensor information, we
compute the degree of similarity for each pair of nodes using the Katz measure.
This metric gives us an indication on the link occurrence between two nodes
relying on their closeness. We show the efficiency of this method by applying
it on three mobility traces: two real traces and one synthetic trace. Through
several simulations, we demonstrate the effectiveness of the technique
regarding another approach based on a similarity metric used in DTN. The
validity of this method is proven when the computation of score is made in a
distributed way (i.e. with local information). We attest that the tensor-based
technique is effective for temporal link prediction applied to the
intermittently connected networks. Furthermore, we think that this technique
can go beyond the realm of DTN and we believe this can be further applied on
every case of figure in which there is a need to derive the underlying social
structure of a network of mobile users.Comment: 13 pages, 9 figures, 8 tables, submitted to the International Journal
of Computer and Telecommunications Networking (COMNET
Recommended from our members
Bistability through triadic closure
We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications include telecommunication, on-line social behaviour and information processing in neuroscience. We model the evolving network as a discrete time Markov chain, and study a very general framework where, conditioned on the current state, edges appear or disappear independently at the next timestep. We show how to exploit symmetries in the microscopic, localized rules in order to obtain conjugate classes of random graphs that simplify analysis and calibration of a model. Further, we develop a mean ïŹeld theory for describing network evolution. For a simple but realistic scenario incorporating the triadic closure eïŹect that has been empirically observed by social scientists (friends of friends tend to become friends), the mean ïŹeld theory predicts bistable dynamics, and computational results conïŹrm this prediction. We also discuss the calibration issue for a set of real cell phone data, and ïŹnd support for a stratiïŹed model, where individuals are assigned to one of two distinct groups having diïŹerent within-group and across-group dynamics
- âŠ