16,016 research outputs found
A testbed for MANETs: Implementation, experiences and learned lessons
In this paper, we present the implementation, experiences and lessons learned of our tesbed for Ad-hoc networks and Mobile Ad hoc Networks (MANETs). We used OLSR protocol for real experimental evaluation. We investigate the effect of mobility and topology changing in the throughput of a MANET. We study the impact of best-effort traffic for Mesh Topology and Linear Topology. In this work, we consider eight experimental models and we assess the performance of our testbed in terms of throughput, round trip time and packet loss. We found that some of the OLSR's problems can be solved, for instance the routing loop, but this protocol still has the self-interference problem. Also, there is an intricate interdependence between MAC layer and routing layer. We carried out the experiments considering stationary nodes of an Ad-hoc network and the node mobility of MANETs. We found that throughput of TCP was improved by reducing Link Quality Window Size (LQWS). For TCP data flow, we got better results when the LQWS value was 10. Moreover, we found that the node join and leave operations increase the packet loss. The OLSR protocol has a good performance when the source node is moving. However, the performance is not good when the relay nodes are moving.Peer ReviewedPostprint (published version
A Systematic Approach to Constructing Families of Incremental Topology Control Algorithms Using Graph Transformation
In the communication systems domain, constructing and maintaining network
topologies via topology control (TC) algorithms is an important cross-cutting
research area. Network topologies are usually modeled using attributed graphs
whose nodes and edges represent the network nodes and their interconnecting
links. A key requirement of TC algorithms is to fulfill certain consistency and
optimization properties to ensure a high quality of service. Still, few
attempts have been made to constructively integrate these properties into the
development process of TC algorithms. Furthermore, even though many TC
algorithms share substantial parts (such as structural patterns or tie-breaking
strategies), few works constructively leverage these commonalities and
differences of TC algorithms systematically. In previous work, we addressed the
constructive integration of consistency properties into the development
process. We outlined a constructive, model-driven methodology for designing
individual TC algorithms. Valid and high-quality topologies are characterized
using declarative graph constraints; TC algorithms are specified using
programmed graph transformation. We applied a well-known static analysis
technique to refine a given TC algorithm in a way that the resulting algorithm
preserves the specified graph constraints.
In this paper, we extend our constructive methodology by generalizing it to
support the specification of families of TC algorithms. To show the feasibility
of our approach, we reneging six existing TC algorithms and develop e-kTC, a
novel energy-efficient variant of the TC algorithm kTC. Finally, we evaluate a
subset of the specified TC algorithms using a new tool integration of the graph
transformation tool eMoflon and the Simonstrator network simulation framework.Comment: Corresponds to the accepted manuscrip
The Bursty Dynamics of the Twitter Information Network
In online social media systems users are not only posting, consuming, and
resharing content, but also creating new and destroying existing connections in
the underlying social network. While each of these two types of dynamics has
individually been studied in the past, much less is known about the connection
between the two. How does user information posting and seeking behavior
interact with the evolution of the underlying social network structure?
Here, we study ways in which network structure reacts to users posting and
sharing content. We examine the complete dynamics of the Twitter information
network, where users post and reshare information while they also create and
destroy connections. We find that the dynamics of network structure can be
characterized by steady rates of change, interrupted by sudden bursts.
Information diffusion in the form of cascades of post re-sharing often creates
such sudden bursts of new connections, which significantly change users' local
network structure. These bursts transform users' networks of followers to
become structurally more cohesive as well as more homogenous in terms of
follower interests. We also explore the effect of the information content on
the dynamics of the network and find evidence that the appearance of new topics
and real-world events can lead to significant changes in edge creations and
deletions. Lastly, we develop a model that quantifies the dynamics of the
network and the occurrence of these bursts as a function of the information
spreading through the network. The model can successfully predict which
information diffusion events will lead to bursts in network dynamics
Complete mitochondrial genome of the Verticillium-wilt causing plant pathogen Verticillium nonalfalfae
Verticillium nonalfalfae is a fungal plant pathogen that causes wilt disease by colonizing the vascular tissues of host plants. The disease induced by hop isolates of V. nonalfalfae manifests in two different forms, ranging from mild symptoms to complete plant dieback, caused by mild and lethal pathotypes, respectively. Pathogenicity variations between the causal strains have been attributed to differences in genomic sequences and perhaps also to differences in their mitochondrial genomes. We used data from our recent Illumina NGS-based project of genome sequencing V. nonalfalfae to study the mitochondrial genomes of its different strains. The aim of the research was to prepare a V. nonalfalfae reference mitochondrial genome and to determine its phylogenetic placement in the fungal kingdom. The resulting 26,139 bp circular DNA molecule contains a full complement of the 14 "standard" fungal mitochondrial protein-coding genes of the electron transport chain and ATP synthase subunits, together with a small rRNA subunit, a large rRNA subunit, which contains ribosomal protein S3 encoded within a type IA-intron and 26 tRNAs. Phylogenetic analysis of this mitochondrial genome placed it in the Verticillium spp. lineage in the Glomerellales group, which is also supported by previous phylogenetic studies based on nuclear markers. The clustering with the closely related Verticillium dahliae mitochondrial genome showed a very conserved synteny and a high sequence similarity. Two distinguishing mitochondrial genome features were also found-a potential long non-coding RNA (orf414) contained only in the Verticillium spp. of the fungal kingdom, and a specific fragment length polymorphism observed only in V. dahliae and V. nubilum of all the Verticillium spp., thus showing potential as a species specific biomarker
Should QoS routing algorithms prefer shortest paths?
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay guarantees. The problem of selecting such constrained paths is the task of quality of service (QoS) routing. This paper considers link-state routing, and the choice of cost metric used to implement QoS routing. There are two schools of thought regarding the choice of link cost. It is commonly assumed that QoS routing algorithms should limit hop count so as to conserve resources for future connections. Others advocate load balancing mechanisms so as to increase overall network utilisation. This paper investigates which of these approaches gives the better performance. We show that there is no one general answer to this question. We also point out the dangers of drawing general conclusions about routing algorithm performance based on the study of only a limited set of network topologies
- …