69 research outputs found
Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks
Efficient routing between nodes is the most important challenge in a Mobile Ad Hoc Network (MANET). A Connected Dominating Set (CDS) acts as a virtual backbone for routing in a MANET. Hence, the construction of CDS based on the need and its application plays a vital role in the applications of MANET. The PipeLined Strategic CDS (PLS-CDS) is constructed based on strategy, dynamic diameter and transmission range. The strategy used for selecting the starting node is, any source node in the network, which has its entire destination within a virtual pipelined coverage, instead of the node with maximum connectivity. The other nodes are then selected based on density and velocity. The proposed CDS also utilizes the energy of the nodes in the network in an optimized manner. Simulation results showed that the proposed algorithm is better in terms of size of the CDS and average hop per path length
Local Approximation Schemes for Ad Hoc and Sensor Networks
We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1+ε)-approximation to the problems at hand for any given ε > 0. The time complexity of both algorithms is O(TMIS + log*! n/εO(1)), where TMIS is the time required to compute a maximal independent set in the graph, and n denotes the number of nodes. We then extend these results to a more general class of graphs in which the maximum number of pair-wise independent nodes in every r-neighborhood is at most polynomial in r. Such graphs of polynomially bounded growth are introduced as a more realistic model for wireless networks and they generalize existing models, such as unit disk graphs or coverage area graphs
Making On-Demand Routing Efficient with Route-Request Aggregation
In theory, on-demand routing is very attractive for mobile ad hoc networks
(MANET), because it induces signaling only for those destinations for which
there is data traffic. However, in practice, the signaling overhead of existing
on-demand routing protocols becomes excessive as the rate of topology changes
increases due to mobility or other causes. We introduce the first on-demand
routing approach that eliminates the main limitation of on-demand routing by
aggregating route requests (RREQ) for the same destinations. The approach can
be applied to any existing on-demand routing protocol, and we introduce the
Ad-hoc Demand-Aggregated Routing with Adaptation (ADARA) as an example of how
RREQ aggregation can be used. ADARA is compared to AODV and OLSR using
discrete-event simulations, and the results show that aggregating RREQs can
make on-demand routing more efficient than existing proactive or on-demand
routing protocols
On-line genetic programming of multi-hop broadcast protocols in ad hoc networks
From the family of ad hoc communication protocols the most challenging ones are those, that are designed to disseminate messages to all, or most of the nodes in the system. By their nature, these kinds of protocols use significant network resources, as the communication must involve a large fraction of the network nodes. Reducing the network load can be achieved by using the available local broadcast medium (radio channel), but it is not trivial how to select the set of nodes that should participate in the dissemination process. Previous attempts delivered algorithms that can provide reasonable performance and reliability but mostly for specific cases of ad hoc networks. In this paper a new way of tackling the broadcast problem is presented that takes no assumptions about the nature of the underlying network. Instead of using hand-optimizing protocols, we propose a framework for a self-optimizing and self-managing system inspired by natural selection and evolution. A generic distributed feed-forward performance evaluation criterion based on natural selection is presented along with an implementation of a virtual machine and a corresponding language for Genetic Programming to be used in tandem with the natural selection process
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
A Survey of Checkpointing Algorithms in Mobile Ad Hoc Network
Checkpoint is defined as a fault tolerant technique that is a designated place in a program at which normal processing is interrupted specifically to preserve the status information necessary to allow resumption of processing at a later time. If there is a failure, computation may be restarted from the current checkpoint instead of repeating the computation from beginning. Checkpoint based rollback recovery is one of the widely used technique used in various areas like scientific computing, database, telecommunication and critical applications in distributed and mobile ad hoc network. The mobile ad hoc network architecture is one consisting of a set of self configure mobile hosts capable of communicating with each other without the assistance of base stations. The main problems of this environment are insufficient power and limited storage capacity, so the checkpointing is major challenge in mobile ad hoc network. This paper presents the review of the algorithms, which have been reported for checkpointing approaches in mobile ad hoc network
- …