22,405 research outputs found
Dynamic Topology Adaptation Based on Adaptive Link Selection Algorithms for Distributed Estimation
This paper presents adaptive link selection algorithms for distributed
estimation and considers their application to wireless sensor networks and
smart grids. In particular, exhaustive search--based
least--mean--squares(LMS)/recursive least squares(RLS) link selection
algorithms and sparsity--inspired LMS/RLS link selection algorithms that can
exploit the topology of networks with poor--quality links are considered. The
proposed link selection algorithms are then analyzed in terms of their
stability, steady--state and tracking performance, and computational
complexity. In comparison with existing centralized or distributed estimation
strategies, key features of the proposed algorithms are: 1) more accurate
estimates and faster convergence speed can be obtained; and 2) the network is
equipped with the ability of link selection that can circumvent link failures
and improve the estimation performance. The performance of the proposed
algorithms for distributed estimation is illustrated via simulations in
applications of wireless sensor networks and smart grids.Comment: 14 figure
Recommended from our members
Diagnostic Applications for Micro-Synchrophasor Measurements
This report articulates and justifies the preliminary selection of diagnostic applications for data from micro-synchrophasors (µPMUs) in electric power distribution systems that will be further studied and developed within the scope of the three-year ARPA-e award titled Micro-synchrophasors for Distribution Systems
Voice Packet Performance Estimation through Step Network Using OPNET
VoIP transfer voice over networks such as LAN. This technology is growing
rapidly due to support of existing network infrastructure at low cost. Various
simulations have been done and it is observed that by increasing the VoIP
client, packet length and traffic arrival rate the performance of step network
affected. In the current work packet dropped, packet received, voice traffic
sent and end-to-end delay is estimated for various queuing disciplines like PQ,
FIFO and WFQ. It is depicted that queuing disciplines effects the applications
performance and utilization of resources.Comment: 2018 IEEE 3rd International Conference on Computing, Communication
and Security (ICCCS). arXiv admin note: text overlap with arXiv:1701.0479
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization, and Assurance
Research into active networking has provided the incentive to re-visit what
has traditionally been classified as distinct properties and characteristics of
information transfer such as protocol versus service; at a more fundamental
level this paper considers the blending of computation and communication by
means of complexity. The specific service examined in this paper is network
self-prediction enabled by Active Virtual Network Management Prediction.
Computation/communication is analyzed via Kolmogorov Complexity. The result is
a mechanism to understand and improve the performance of active networking and
Active Virtual Network Management Prediction in particular. The Active Virtual
Network Management Prediction mechanism allows information, in various states
of algorithmic and static form, to be transported in the service of prediction
for network management. The results are generally applicable to algorithmic
transmission of information. Kolmogorov Complexity is used and experimentally
validated as a theory describing the relationship among algorithmic
compression, complexity, and prediction accuracy within an active network.
Finally, the paper concludes with a complexity-based framework for Information
Assurance that attempts to take a holistic view of vulnerability analysis
A critical look at power law modelling of the Internet
This paper takes a critical look at the usefulness of power law models of the
Internet. The twin focuses of the paper are Internet traffic and topology
generation. The aim of the paper is twofold. Firstly it summarises the state of
the art in power law modelling particularly giving attention to existing open
research questions. Secondly it provides insight into the failings of such
models and where progress needs to be made for power law research to feed
through to actual improvements in network performance.Comment: To appear Computer Communication
- …