885 research outputs found

    Extensions to the IEEE 802.11 TSF for Efficient and Reliable Network Synchronization in Large Scale MANETs

    Full text link
    Designing new protocols for Mobile Ad hoc Networks (MANETs) is a great challenge due to their distributed and self organized nature. Though, aspects of approved algorithms for hierarchical topographies may be carried over to these flat networks. The IEEE 802.11 protocol supports ad hoc networks in small scale applications, but its performance in large scale environments is still under investigation. Besides the Distributed Coordination Function (DCF), the Timer Synchronization Function (TSF) can be significantly improved in order to increase the performance in large scale multihop networks. This article presents systematic extensions to the TSF that allow increasing the overall reliability and disburdening the network at the same time. The presented scheme may be tailored to specific applications and even supports mobile stations and herewith MANETs

    Random Broadcast Based Distributed Consensus Clock Synchronization for Mobile Networks

    Get PDF
    Clock synchronization is a crucial issue for mobile ad hoc networks due to the dynamic and distributed nature of these networks. In this paper, employing affine models for local clocks, a random broadcast based distributed consensus clock synchronization algorithm is proposed. In the absence of transmission delays, we theoretically prove the convergence of the proposed scheme, which is further illustrated by numerical results. In addition, it is concluded from simulations that the proposed scheme is scalable and robust to transmission delays as well as different accuracy requirements

    Global visualization of experiments in ad hoc networks

    Get PDF
    The real experiments in ad hoc networks study metrics that can be obtained with local monitoring on the machines. No global and full visualization of the experiments is proposed. However such a visualization can be very useful and can help in a sharp evaluation of the tested protocols. Setting this type of visualization requires a synchronization of the events performed during the experiment. In this paper, we propose a synchronization method that enables the setting up of a global visualization of experiments in ad hoc networks

    Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation

    Full text link
    Sensor networks potentially feature large numbers of nodes that can sense their environment over time, communicate with each other over a wireless network, and process information. They differ from data networks in that the network as a whole may be designed for a specific application. We study the theoretical foundations of such large scale sensor networks, addressing four fundamental issues- connectivity, capacity, clocks and function computation. To begin with, a sensor network must be connected so that information can indeed be exchanged between nodes. The connectivity graph of an ad-hoc network is modeled as a random graph and the critical range for asymptotic connectivity is determined, as well as the critical number of neighbors that a node needs to connect to. Next, given connectivity, we address the issue of how much data can be transported over the sensor network. We present fundamental bounds on capacity under several models, as well as architectural implications for how wireless communication should be organized. Temporal information is important both for the applications of sensor networks as well as their operation.We present fundamental bounds on the synchronizability of clocks in networks, and also present and analyze algorithms for clock synchronization. Finally we turn to the issue of gathering relevant information, that sensor networks are designed to do. One needs to study optimal strategies for in-network aggregation of data, in order to reliably compute a composite function of sensor measurements, as well as the complexity of doing so. We address the issue of how such computation can be performed efficiently in a sensor network and the algorithms for doing so, for some classes of functions.Comment: 10 pages, 3 figures, Submitted to the Proceedings of the IEE

    Performance and energy efficiency in wireless self-organized networks

    Get PDF
    fi=vertaisarvioitu|en=peerReviewed
    • …
    corecore