6,464 research outputs found

    Dynamic Queue Utilization Based MAC for multi-hop Ad Hoc networks

    Get PDF
    The end-to-end throughput in single flow multi-hop Ad Hoc networks decays rapidly with path length. Along the path, the success rate of delivering packets towards the destination decreases due to higher contention, interference, limited buffer size and limited shared bandwidth constraints. In such environments the queues fill up faster in nodes closer to the source than in the nodes nearer the destination. In order to reduce buffer overflow and improve throughput for a saturated network, this paper introduces a new MAC protocol named Dynamic Queue Utilization Based Medium Access Control (DQUB-MAC). The protocol aims to prioritise access to the channel for queues with higher utilization and helps in achieving higher throughput by rapidly draining packets towards the destination. The proposed MAC enhances the performance of an end-to-end data flow by up to 30% for a six hop transmission in a chain topology and is demonstrated to remain competitive for other network topologies and for a variety of packet sizes

    Queue utilization with hop based enhanced arbitrary inter frame spacing MAC for saturated ad HOC networks

    Get PDF
    © 2015 IEEE. Path length of a multi hop Ad Hoc networks has an adverse impact on the end-to-end throughput especially during network saturation. The success rate of forwarding packets towards destination is limited due to interference, contention, limited buffer space, and bandwidth. Real time applications streaming data fill the buffer space at a faster rate at the source and its nearby forwarding nodes since the channel is shared. The aim of this paper is to increase the success rate of forwarding the packets to yield a higher end-to-end throughput. In order to reduce loss of packets due to buffer overflow and enhance the performance of the network for a saturated network, a novel MAC protocol named Queue Utilization with Hop Based Enhanced Arbitrary Inter Frame Spacing based (QU-EAIFS) MAC is proposed for alleviating the problems in saturated Ad Hoc networks. The protocol prioritises the nodes based on its queue utilization and hops travelled by the packet and it helps achieving higher end-toend performance by forwarding the packets with higher rate towards the destination during network saturation. The proposed MAC enhances the end-to-end performance by approximately 40% and 34% for a 5hop and 6hop communication respectively in a chain topology as compared to the standard IEEE802.11b. The performance of the new MAC also outperforms the performance of IEEE 802.11e MAC. In order to validate the protocol, it is also tested with short hops and varying packet sizes and more realistic random topologies

    Hop-Based dynamic fair scheduler for wireless Ad-Hoc networks

    Get PDF
    In a typical multihop Ad-Hoc network, interference and contention increase when flows transit each node towards destination, particularly in the presence of cross-traffic. This paper observes the relationship between throughput and path length, self-contention and interference and it investigates the effect of multiple data rates over multiple data flows in the network. Drawing from the limitations of the 802.11 specification, the paper proposes a scheduler named Hop Based Multi Queue (HBMQ), which is designed to prioritise traffic based on the hop count of packets in order to provide fairness across different data flows. The simulation results demonstrate that HBMQ performs better than a Single Drop Tail Queue (SDTQ) scheduler in terms of providing fairness. Finally, the paper concludes with a number of possible directions for further research, focusing on cross-layer implementation to ensure the fairness is also provided at the MAC layer. © 2013 IEEE

    The centred travelling salesman at high temperature

    Get PDF
    A recently formulated statistical mechanics method is used to study the phase transition occurring in a generalisation of the Traveling Salesman Problem (TSP) known as the centred TSP. The method shows that the problem has clear signs of a crossover, but is only able to access (unscaled) finite temperatures above the transition point. The solution of the problem using this method displays a curious duality

    Search for long lived charged massive particles in pp collisions at s-hat = 1.8TeV

    Get PDF
    We report a search for the production of long-lived charged massive particles in a data sample of 90   pb-1 of √s=1.8   TeV pp̅ collisions recorded by the Collider Detector at Fermilab. The search uses the muonlike penetration and anomalously high ionization energy loss signature expected for such a particle to discriminate it from backgrounds. The data are found to agree with background expectations, and cross section limits of O(1) pb are derived using two reference models, a stable quark and a stable scalar lepton

    Slow synaptic transmission in frog sympathetic ganglia

    Get PDF
    Bullfrog ganglia contain two classes of neurone, B and C cells, which receive different inputs and exhibit different slow synaptic potentials. B cells, to which most effort has been directed, possess slow and late slow EPSPs. The sEPSP reflects a muscarinic action of acetylcholine released from boutons on B cells, whereas the late sEPSP is caused by a peptide (similar to teleost LHRH) released from boutons on C cells. During either sEPSP there is a selective reduction in two slow potassium conductances, designated 'M' and 'AHP'. The M conductance is voltage dependent and the AHP conductance is calcium dependent. Normally they act synergistically to prevent repetitive firing of action potentials during maintained stimuli. Computer stimulation of the interactions of these conductances with the other five voltage-dependent conductances present in the membrane allows a complete reconstruction of the effects of slow synaptic transmission on electrical behaviour

    Initial geomagnetic field model from MAGSAT

    Get PDF
    Magsat data from magnetically quiet days were used to derive a thirteenth degree and order spherical harmonic geomagnetic field model, MGST(3/80). The model utilized both scalar and vector data and fit that data with standard deviations of 8, 52, 55 and 97 nT for the scalar magnitude, B sub r, B sub theta and B sub phi respectively. When compared with earlier models, the Earth's dipole moment continues to decrease at a rate of about 26 nT/year. Evaluation of earlier models with Magsat data shows that the scalar field at the Magsat epoch is best predicted by the POGO(2/72) model but that the AWC/75 and IGS/75 are better for predicting vector fields

    Ergodic sampling of the topological charge using the density of states

    Get PDF
    In lattice calculations, the approach to the continuum limit is hindered by the severe freezing of the topological charge, which prevents ergodic sampling in configuration space. In order to significantly reduce the autocorrelation time of the topological charge, we develop a density of states approach with a smooth constraint and use it to study SU(3) pure Yang Mills gauge theory near the continuum limit. Our algorithm relies on simulated tempering across a range of couplings, which guarantees the decorrelation of the topological charge and ergodic sampling of topological sectors. Particular emphasis is placed on testing the accuracy, efficiency and scaling properties of the method. In their most conservative interpretation, our results provide firm evidence of a sizeable reduction of the exponent z related to the growth of the autocorrelation time as a function of the inverse lattice spacing

    Searching for Nodes in Random Graphs

    Full text link
    We consider the problem of searching for a node on a labelled random graph according to a greedy algorithm that selects a route to the desired node using metric information on the graph. Motivated by peer-to-peer networks two types of random graph are proposed with properties particularly amenable to this kind of algorithm. We derive equations for the probability that the search is successful and also study the number of hops required, finding both numerical and analytic evidence of a transition as the number of links is varied.Comment: 13 pages, 12 figure
    • …
    corecore