2,322 research outputs found
Message and time efficient multi-broadcast schemes
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
Connectivity Investigation of Channel Quality-Based Adaptive Gossip Flooding Mechanism for AODV
To address the “broadcast storm” problem associated with flooding-based route discovery mechanism of reactive routing protocols, probabilistic approaches are suggested in the literature. In the earlier work, Gossip flooding mechanism of Haas et.al. was extended with signal quality, to propose channel quality based adaptive gossip flooding mechanism for AODV (CQAG-AODV). Following the cross-layer design principle, CQAG-AODV algorithm tried to discover robust routes, as well as address the “broadcast storm” problem by controlling the rebroadcast probability of Route request (RREQ) packets on the basis of signal strength experienced at the physical layer. This paper investigates the connectivity of CQAG-AODV through theoretical and simulation analysis. Results show that, by accounting the signal strength in the route discovery process, not only does the proposed algorithm floods a lesser number of route requests and controls the broadcast storm, but also maintains a higher level of connectivity to offer high packet delivery ratio; independent of network density and node mobility. Moreover, due to controlled routing overhead and robust route discovery, channel quality based adaptive flooding mechanism offers fringe benefit of energy efficiency as well. CQAG-AODV thus proves its suitability in a variety of use cases of multi-hop ad hoc networks including WSNs and VANETs
Two Algorithms for Network Size Estimation for Master/Slave Ad Hoc Networks
This paper proposes an adaptation of two network size estimation methods:
random tour and gossip-based aggregation to suit master/slave mobile ad hoc
networks. We show that it is feasible to accurately estimate the size of ad hoc
networks when topology changes due to mobility using both methods. The
algorithms were modified to account for the specific constraints of
master/slave ad hoc networks and the results show that the proposed
modifications perform better on these networks than the original protocols.
Each of the two algorithms presents strengths and weaknesses and these are
outlined in this paper.Comment: 3 pages, 2 figures, submitted to ANTS'09 - Corrected typos and
definition
Pheromone-based In-Network Processing for wireless sensor network monitoring systems
Monitoring spatio-temporal continuous fields using wireless sensor networks (WSNs) has emerged as a novel solution. An efficient data-driven routing mechanism for sensor querying and information gathering in large-scale WSNs is a challenging problem. In particular, we consider the case of how to query the sensor network information with the minimum energy cost in scenarios where a small subset of sensor nodes has relevant readings. In order to deal with this problem, we propose a Pheromone-based In-Network Processing (PhINP) mechanism. The proposal takes advantages of both a pheromone-based iterative strategy to direct queries towards nodes with relevant information and query- and response-based in-network filtering to reduce the number of active nodes. Additionally, we apply reinforcement learning to improve the performance. The main contribution of this work is the proposal of a simple and efficient mechanism for information discovery and gathering. It can reduce the messages exchanged in the network, by allowing some error, in order to maximize the network lifetime. We demonstrate by extensive simulations that using PhINP mechanism the query dissemination cost can be reduced by approximately 60% over flooding, with an error below 1%, applying the same in-network filtering strategy.Fil: Riva, Guillermo Gaston. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales; Argentina. Universidad Tecnológica Nacional; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; Argentin
- …