4,282 research outputs found
Scalable energy-efficient routing in mobile Ad hoc network
The quick deployment without any existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for dynamic situations such as military and rescue operations, disaster recovery, and so on and so forth. However, routing remains one of the major issues in MANET due to the highly dynamic and distributed environment. Energy consumption is also a significant issue in ad hoc networks since the nodes are battery powered. This report discusses some major dominating set based approaches to perform energy efficient routing in mobile ad hoc networks. It also presents the performance results for each of these mentioned approaches in terms of throughput, average end to end delay and the life time in terms of the first node failure. Based on the simulation results, I identified the key issues in these protocols regarding network life time. In this report, I propose and discuss a new approach “Dynamic Dominating Set Generation Algorithm” (DDSG) to optimize the network life time. This algorithm dynamically selects dominating nodes during the process of routing and thus creates a smaller dominating set. DDSG algorithm thereby eliminates the energy consumption from the non-used dominating nodes. In order to further increase the network life time, the algorithm takes into consideration the threshold settings which helps to distribute the process of routing within the network. This helps to eliminate a single dominating node from getting drained out by continuous transmission and reception of packets. In this report, the detailed algorithmic design and performance results through simulation is discussed
An ACO Algorithm for Effective Cluster Head Selection
This paper presents an effective algorithm for selecting cluster heads in
mobile ad hoc networks using ant colony optimization. A cluster in an ad hoc
network consists of a cluster head and cluster members which are at one hop
away from the cluster head. The cluster head allocates the resources to its
cluster members. Clustering in MANET is done to reduce the communication
overhead and thereby increase the network performance. A MANET can have many
clusters in it. This paper presents an algorithm which is a combination of the
four main clustering schemes- the ID based clustering, connectivity based,
probability based and the weighted approach. An Ant colony optimization based
approach is used to minimize the number of clusters in MANET. This can also be
considered as a minimum dominating set problem in graph theory. The algorithm
considers various parameters like the number of nodes, the transmission range
etc. Experimental results show that the proposed algorithm is an effective
methodology for finding out the minimum number of cluster heads.Comment: 7 pages, 5 figures, International Journal of Advances in Information
Technology (JAIT); ISSN: 1798-2340; Academy Publishers, Finlan
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
On Derandomizing Local Distributed Algorithms
The gap between the known randomized and deterministic local distributed
algorithms underlies arguably the most fundamental and central open question in
distributed graph algorithms. In this paper, we develop a generic and clean
recipe for derandomizing LOCAL algorithms. We also exhibit how this simple
recipe leads to significant improvements on a number of problem. Two main
results are:
- An improved distributed hypergraph maximal matching algorithm, improving on
Fischer, Ghaffari, and Kuhn [FOCS'17], and giving improved algorithms for
edge-coloring, maximum matching approximation, and low out-degree edge
orientation. The first gives an improved algorithm for Open Problem 11.4 of the
book of Barenboim and Elkin, and the last gives the first positive resolution
of their Open Problem 11.10.
- An improved distributed algorithm for the Lov\'{a}sz Local Lemma, which
gets closer to a conjecture of Chang and Pettie [FOCS'17], and moreover leads
to improved distributed algorithms for problems such as defective coloring and
-SAT.Comment: 37 page
The Homogeneous Broadcast Problem in Narrow and Wide Strips
Let be a set of nodes in a wireless network, where each node is modeled
as a point in the plane, and let be a given source node. Each node
can transmit information to all other nodes within unit distance, provided
is activated. The (homogeneous) broadcast problem is to activate a minimum
number of nodes such that in the resulting directed communication graph, the
source can reach any other node. We study the complexity of the regular and
the hop-bounded version of the problem (in the latter, must be able to
reach every node within a specified number of hops), with the restriction that
all points lie inside a strip of width . We almost completely characterize
the complexity of both the regular and the hop-bounded versions as a function
of the strip width .Comment: 50 pages, WADS 2017 submissio
- …