2 research outputs found

    Message and time efficient multi-broadcast schemes

    Full text link
    We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459

    ABSTRACT Distributed Obstacle Localization in Large Wireless Sensor Networks

    No full text
    Obstacles are but pleasing for many aspects of large realworld sensor networks. Among other things, the presence of obstacles distort the sensor node localization process and might lead to costly routing because of unnecessary detours and/or dead ends. In order to relieve these problems, this paper proposes a distributed obstacle localization algorithm, called DOL for short, in which the sensor nodes interact with each other mostly locally. The proposed algorithm is very resource and communication efficient in that all sensor nodes send only a small number of additional messages. Finally, the sensor network fine tunes the employed routing algorithm
    corecore