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

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

MODLEACH: A Variant of LEACH for WSNs

Wireless sensor networks are appearing as an emerging need for mankind. Though, Such networks are still in research phase however, they have high potential to be applied in almost every field of life. Lots of research is done and a lot more is awaiting to be standardized. In this work, cluster based routing in wireless sensor networks is studied precisely. Further, we modify one of the most prominent wireless sensor network's routing protocol "LEACH" as modified LEACH (MODLEACH) by introducing \emph{efficient cluster head replacement scheme} and \emph{dual transmitting power levels}. Our modified LEACH, in comparison with LEACH out performs it using metrics of cluster head formation, through put and network life. Afterwards, hard and soft thresholds are implemented on modified LEACH (MODLEACH) that boast the performance even more. Finally a brief performance analysis of LEACH, Modified LEACH (MODLEACH), MODLEACH with hard threshold (MODLEACHHT) and MODLEACH with soft threshold (MODLEACHST) is undertaken considering metrics of throughput, network life and cluster head replacements.Comment: IEEE 8th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA'13), Compiegne, Franc

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

Three-dimensional magnetohydrodynamical simulations of the morphology of head-tail radio galaxies based on magnetic tower jet model

The distinctive morphology of head-tail radio galaxies reveals strong interactions between the radio jets and their intra-cluster environment, the general consensus on the morphology origin of head-tail sources is that radio jets are bent by violent intra-cluster weather. We demonstrate in this paper that such strong interactions provide a great opportunity to study the jet properties and also the dynamics of intra-cluster medium (ICM). By three-dimensional magnetohydrodynamical simulations, we analyse the detailed bending process of a magnetically dominated jet, based on the magnetic tower jet model. We use stratified atmospheres modulated by wind/shock to mimic the violent intra-cluster weather. Core sloshing is found to be inevitable during the wind-cluster core interaction, which induces significant shear motion and could finally drive ICM turbulence around the jet, making it difficult for jet to survive. We perform detailed comparison between the behaviour of pure hydrodynamical jets and magnetic tower jet, and find that the jet-lobe morphology could not survive against the violent disruption in all of our pure hydrodynamical jet models. On the other hand, the head-tail morphology is well reproduced by using a magnetic tower jet model bent by wind, in which hydrodynamical instabilities are naturally suppressed and the jet could always keep its integrity under the protection of its internal magnetic fields. Finally, we also check the possibility for jet bending by shock only. We find that shock could not bend jet significantly, so could not be expected to explain the observed long tails in head-tail radio galaxies.Comment: submitted to ApJ on December 9, 2016, and accepted on March 1st, 201

Equalized Cluster Head Election Routing Protocol for WSNs

In recent years, the growing interest in the WIRELESS SENSOR NETWORK (WISENET) is increases. Wireless Sensor Network is an emerging technology that promises a wide range of potential applications in both civilian and military areas. A sensor network consists of multiple detection stations called sensor nodes, each of which is small, lightweight and portable. Every sensor node is equipped with a Sensing Unit, Data Processing Unit, transceiver and power source. The development of WSNs largely depends on the availability of low-cost and low-power hardware and software platforms for sensor networks. Equalized Cluster Head Election Routing Protocol (ECHERP), pursues energy conservation through balanced clustering for Energy Efficiency

Performance evaluation of two-fuzzy based cluster head selection systems for wireless sensor networks

Sensor networks supported by recent technological advances in low power wireless communications along with silicon integration of various functionalities are emerging as a critically important computer class that enable novel and low cost applications. There are many fundamental problems that sensor networks research will have to address in order to ensure a reasonable degree of cost and system quality. Cluster formation and cluster head selection are important problems in sensor network applications and can drastically affect the network’s communication energy dissipation. However, selecting of the cluster head is not easy in different environments which may have different characteristics. In this paper, in order to deal with this problem, we propose two fuzzy-based systems for cluster head selection in sensor networks. We call these systems: FCHS System1 and FCHS System2. We evaluate the proposed systems by simulations and have shown that FCHS System2 make a good selection of the cluster head compared with FCHS System1 and another previous system.Peer ReviewedPostprint (published version