196 research outputs found
Enhanced Cluster Based Routing Protocol for MANETS
Mobile ad-hoc networks (MANETs) are a set of self organized wireless mobile
nodes that works without any predefined infrastructure. For routing data in
MANETs, the routing protocols relay on mobile wireless nodes. In general, any
routing protocol performance suffers i) with resource constraints and ii) due
to the mobility of the nodes. Due to existing routing challenges in MANETs
clustering based protocols suffers frequently with cluster head failure
problem, which degrades the cluster stability. This paper proposes, Enhanced
CBRP, a schema to improve the cluster stability and in-turn improves the
performance of traditional cluster based routing protocol (CBRP), by electing
better cluster head using weighted clustering algorithm and considering some
crucial routing challenges. Moreover, proposed protocol suggests a secondary
cluster head for each cluster, to increase the stability of the cluster and
implicitly the network infrastructure in case of sudden failure of cluster
head.Comment: 6 page
Heuristic Clustering Algorithms in Ad hoc Networks
The clustering allows dividing the geographical region to be covered into small zones in which each zone can be handled with a powerful node called clusterhead. The clusterheads have direct communication link with each of its members whereas the member nodes of a cluster must go through the clusterhead to communicate with each other. Since choosing clusterheads optimally is an NP-hard problem, existing solutions to this problem are based on heuristic (mostly greedy) approaches. In this paper, we present three well-known heuristic clustering algorithms: the Lowest-ID, the Highest-Degree, and the Node-Weight
A cluster-head selection and update algorithm for ad hoc networks
A novel cluster-head selection and update algorithm “Type-based Cluster-forming Algorithm (TCA)” is proposed, which outperforms both the lowest node ID (LID) and the Weighted Clustering Algorithm (WCA) in the ad hoc network scenario considered. The system’s performance is investigated in a scenario, when the 50 communicating nodes belong to three different groups, for example, a group of rescue workers, fire-fighters and paramedics. It is demonstrated that the carefully designed protocol is capable of outperforming the above-mentioned benchmarkers both in terms of a reduced number of cluster-head updates and cluster-change events. Hence its quality-of-service may be deemed higher
Genetic algorithms with elitism-based immigrants for dynamic load balanced clustering problem in mobile ad hoc networks
This article is posted here with permission of IEEE - Copyright @ 2011 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1 and Grant EP/E060722/2
Recommended from our members
SAnoVs: Secure Anonymous Voting Scheme for clustered ad hoc networks
In this paper we propose a secure anonymous voting scheme (SAnoVS) for re-clustering in the ad-hoc network. SAnoVS extends our previous work of degree-based clustering algorithms by achieving anonymity and confidentiality of the voting procedure applied to select new cluster heads. The security of SAnoVS is based on the difficulty of computing discrete logarithms over elliptic curves, the intractability of inverting a one-way hash function and the fact that only neighboring nodes contribute to the generation of a shared secret. Furthermore, we achieve anonymity since our scheme does not require any identification information as we make use of a polynomial equation system combined with pseudo-random coordinates. The security analysis of our scheme is demonstrated with several attacks scenarios.examined with several attack scenarios and experimental results
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
Energy Efficient Design of Wireless Ad Hoc Networks
The concept of wireless is not new. When the packet switching technology, the fabric of the Internet was introduced by the Department of Defense, the ARPANET ,it understood the potential of packet switched radio technology to interconnect mobile nodes .The DARPA around early 70’s helped establish the base of ad hoc wireless networking. This is a technology that enables untethered wireless networking environments where there is no wired or cellular infrastructure. Wireless Ad hoc Networks since then is a fast developing research area with a vast spectrum of applications. Wireless sensor network systems enable the reliable monitoring of a variety of environments for both civil and military applications. The Energy efficiency continues to be a key factor in limiting the deployability of ad-hoc networks. Deploying an energy efficient system exploiting the maximum lifetime of the network has remained a great challenge since years. The time period from the instant at which the network starts functioning to the time instant at which the first network node runs out of energy, i.e. the network lifetime is largely dependent on the system energy efficiency. This thesis looks at energy efficient protocols, which can have significant impact on the lifetime of these networks. The cluster heads get drain out maximum energy in the wireless ad hoc networks. The proposed algorithm deals with minimizing the rate of dissipation of energy of cluster heads. The algorithm LEAD deals with energy efficient round scheduling of cluster head followed by allocation of nodes to the cluster heads maximizing network lifetime using ANDA
- …