287,984 research outputs found
Designing energy-efficient wireless access networks: LTE and LTE-advanced
As large energy consumers, base stations need energy-efficient wireless access networks. This article compares the design of Long-Term Evolution (LTE) networks to energy-efficient LTE-Advanced networks. LIE-Advanced introduces three new functionalities - carrier aggregation, heterogeneous networks, and extended multiple-input, multiple-output (MIMO) support. The authors develop a power consumption model for LIE and LIE-Advanced macrocell and femtocell base stations, along with an energy efficiency measure. They show that LIE-Advanced's carrier aggregation and MIMO improve networks' energy efficiency up to 400 and 450 percent, respectively
Effects of time window size and placement on the structure of aggregated networks
Complex networks are often constructed by aggregating empirical data over
time, such that a link represents the existence of interactions between the
endpoint nodes and the link weight represents the intensity of such
interactions within the aggregation time window. The resulting networks are
then often considered static. More often than not, the aggregation time window
is dictated by the availability of data, and the effects of its length on the
resulting networks are rarely considered. Here, we address this question by
studying the structural features of networks emerging from aggregating
empirical data over different time intervals, focussing on networks derived
from time-stamped, anonymized mobile telephone call records. Our results show
that short aggregation intervals yield networks where strong links associated
with dense clusters dominate; the seeds of such clusters or communities become
already visible for intervals of around one week. The degree and weight
distributions are seen to become stationary around a few days and a few weeks,
respectively. An aggregation interval of around 30 days results in the stablest
similar networks when consecutive windows are compared. For longer intervals,
the effects of weak or random links become increasingly stronger, and the
average degree of the network keeps growing even for intervals up to 180 days.
The placement of the time window is also seen to affect the outcome: for short
windows, different behavioural patterns play a role during weekends and
weekdays, and for longer windows it is seen that networks aggregated during
holiday periods are significantly different.Comment: 19 pages, 11 figure
iPDA: An Integrity-Protecting Private Data Aggregation Scheme for Wireless Sensor Networks
Data aggregation is an efficient mechanism widely used in wireless sensor networks (WSN) to collect statistics about data of interests. However, the shared-medium nature of communication makes the WSNs are vulnerable to eavesdropping and packet tampering/injection by adversaries. Hence, how to protect data privacy and data integrity are two major challenges for data aggregation in wireless sensor networks. In this paper, we present iPDA??????an integrity-protecting private data aggregation scheme. In iPDA, data privacy is achieved through data slicing and assembling technique; and data integrity is achieved through redundancy by constructing disjoint aggregation paths/trees to collect data of interests. In iPDA, the data integrity-protection and data privacy-preservation mechanisms work synergistically. We evaluate the iPDA scheme in terms of the efficacy of privacy preservation, communication overhead, and data aggregation accuracy, comparing with a typical data aggregation scheme--- TAG, where no integrity protection and privacy preservation is provided. Both theoretical analysis and simulation results show that iPDA achieves the design goals while still maintains the efficiency of data aggregation
Sparsely Aggregated Convolutional Networks
We explore a key architectural aspect of deep convolutional neural networks:
the pattern of internal skip connections used to aggregate outputs of earlier
layers for consumption by deeper layers. Such aggregation is critical to
facilitate training of very deep networks in an end-to-end manner. This is a
primary reason for the widespread adoption of residual networks, which
aggregate outputs via cumulative summation. While subsequent works investigate
alternative aggregation operations (e.g. concatenation), we focus on an
orthogonal question: which outputs to aggregate at a particular point in the
network. We propose a new internal connection structure which aggregates only a
sparse set of previous outputs at any given depth. Our experiments demonstrate
this simple design change offers superior performance with fewer parameters and
lower computational requirements. Moreover, we show that sparse aggregation
allows networks to scale more robustly to 1000+ layers, thereby opening future
avenues for training long-running visual processes.Comment: Accepted to ECCV 201
On the Potential of Generic Modeling for VANET Data Aggregation Protocols
In-network data aggregation is a promising communication mechanism to reduce bandwidth requirements of applications in vehicular ad-hoc networks (VANETs). Many aggregation schemes have been proposed, often with varying features. Most aggregation schemes are tailored to specific application scenarios and for specific aggregation operations. Comparative evaluation of different aggregation schemes is therefore difficult. An application centric view of aggregation does also not tap into the potential of cross application aggregation. Generic modeling may help to unlock this potential. We outline a generic modeling approach to enable improved comparability of aggregation schemes and facilitate joint optimization for different applications of aggregation schemes for VANETs. This work outlines the requirements and general concept of a generic modeling approach and identifies open challenges
Complex networks created by aggregation
We study aggregation as a mechanism for the creation of complex networks. In
this evolution process vertices merge together, which increases the number of
highly connected hubs. We study a range of complex network architectures
produced by the aggregation. Fat-tailed (in particular, scale-free)
distributions of connections are obtained both for networks with a finite
number of vertices and growing networks. We observe a strong variation of a
network structure with growing density of connections and find the phase
transition of the condensation of edges. Finally, we demonstrate the importance
of structural correlations in these networks.Comment: 12 pages, 13 figure
Enrichment and aggregation of topological motifs are independent organizational principles of integrated interaction networks
Topological network motifs represent functional relationships within and
between regulatory and protein-protein interaction networks. Enriched motifs
often aggregate into self-contained units forming functional modules.
Theoretical models for network evolution by duplication-divergence mechanisms
and for network topology by hierarchical scale-free networks have suggested a
one-to-one relation between network motif enrichment and aggregation, but this
relation has never been tested quantitatively in real biological interaction
networks. Here we introduce a novel method for assessing the statistical
significance of network motif aggregation and for identifying clusters of
overlapping network motifs. Using an integrated network of transcriptional,
posttranslational and protein-protein interactions in yeast we show that
network motif aggregation reflects a local modularity property which is
independent of network motif enrichment. In particular our method identified
novel functional network themes for a set of motifs which are not enriched yet
aggregate significantly and challenges the conventional view that network motif
enrichment is the most basic organizational principle of complex networks.Comment: 12 pages, 5 figure
- âŠ