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

Self-stabilization in self-organized multihop wireless networks

International audienceIn large scale multihop wireless networks, flat architectures are not scalable. In order to overcome this major drawback, clusterization is introduced to support self-organization and to enable hierarchical routing. When dealing with multihop wireless networks the robustness is a main issue due to the dynamicity of such networks. Several algorithms have been designed for the clusterization process. As far as we know, very few studies check the robustness feature of their clusterization protocols. Moreover, when it is the case, the evaluation is driven by simulations and never by a theoretical approach. In this paper, we show that a clusterization algorithm, that seems to present good properties of robustness, is self-stabilizing. We propose several enhancements to reduce the stabilization time and to improve stability. The use of a Directed Acyclic Graph ensures that the self-stabilizing properties always hold regardless of the underlying topology. These extra criterion are tested by simulations

A survey of self organisation in future cellular networks

This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks

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

An Overview of QoS Enhancements for Wireless Vehicular Networks

Vehicular ad hoc networks (VANETs) allow vehicles to form a self-organized network without the need for permanent infrastructure. Even though VANETs are mobile ad hoc networks (MANETs), because of the intrinsic characteristics of VANETs, several protocols designed for MANETs cannot be directly applied for VANETs. With high number of nodes and mobility, ensuring the Quality of Service (QoS) in VANET is a challenging task. QoS is essential to improve the communication efficiency in vehicular networks. Thus a study of QoS in VANET is useful as a fundamental for constructing an effective vehicular network. In this paper, we present a timeline of the development of the existing protocols for VANETs that try to support QoS. Moreover, we classify and characterize the existing QoS protocols for VANETs in a layered perspective. The review helps in understanding the strengths and weaknesses of the existing QoS protocols and also throws light on open issues that remain to be addressed. Keywords: QoS, VANET, Inter-Vehicle Communications, MAC, Routin

Design and Analysis of An Improved AODV Protocol Based on Clustering Approach for Internet of Vehicles (AODV-CD)

The Internet of Vehicles (IoVs) has become a vital research area in order to enhance passenger and road safety, increasing traffic efficiency and enhanced reliable connectivity. In this regard, for monitoring and controlling the communication between IoVs, routing protocols are deployed. Frequent changes that occur in the topology often leads to major challenges in IoVs, such as dynamic topology changes, shortest routing paths and also scalability. One of the best solutions for such challenges is “clustering”. This study focuses on IoVs’ stability and to create an efficient routing protocol in dynamic environment. In this context, we proposed a novel algorithm called Cluster-based enhanced AODV for IoVs (AODV-CD) to achieve stable and efficient clustering for simplifying routing and ensuring quality of service (QoS). Our proposed protocol enhances the overall network throughput and delivery ratio, with less routing load and less delay compared to AODV. Thus, extensive simulations are carried out in SUMO and NS2 for evaluating the efficiency of the AODV-CD that is superior to the classic AODV and other recent modified AODV algorithms.

Design and Analysis of An Improved AODV Protocol Based on Clustering Approach for Internet of Vehicles (AODV-CD)

The Internet of Vehicles (IoVs) has become a vital research area in order to enhance passenger and road safety, increasing traffic efficiency and enhanced reliable connectivity. In this regard, for monitoring and controlling the communication between IoVs, routing protocols are deployed. Frequent changes that occur in the topology often leads to major challenges in IoVs, such as dynamic topology changes, shortest routing paths and also scalability. One of the best solutions for such challenges is “clustering”. This study focuses on IoVs’ stability and to create an efficient routing protocol in dynamic environment. In this context, we proposed a novel algorithm called Cluster-based enhanced AODV for IoVs (AODV-CD) to achieve stable and efficient clustering for simplifying routing and ensuring quality of service (QoS). Our proposed protocol enhances the overall network throughput and delivery ratio, with less routing load and less delay compared to AODV. Thus, extensive simulations are carried out in SUMO and NS2 for evaluating the efficiency of the AODV-CD that is superior to the classic AODV and other recent modified AODV algorithms.

A new clustering technique based on replication for MANET routing protocols

The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%

Adaptive Energy-aware Cluster Based Routing Protocol for Mobile Ad Hoc Networks

Due to the downside characteristics of Mobile Ad hoc Networks (MANETs) such as dynamic topology and energy consumption and control overhead, network clustering is one of the promising solutions. Cluster Based Routing Protocol (CBRP) is a robust and scalable routing protocol for MANETs. Clustering formation algorithm used in CBRP is a variation of simple lowest-ID algorithm in which the node with a lowest ID among its neighbors is elected as the Cluster head. Neglecting mobility and energy for selecting cluster head is one of the weakness points of the algorithm. In order to increase stability of the network and to prevent re-clustering an adaptive energy-aware Cluster Based Routing Protocol (AECBRP) is proposed. Two algorithms have been introduced in AECBRP as enhancement to the CBRP: improving the cluster formation algorithm by considering relative mobility, residual energy and connectivity degree metrics, and add in an efficient cluster maintenance algorithm based on the aggregate energy metric of cluster head. Using NS-2 we evaluate the rate of cluster-head changes, the normalization routing overhead and the packet delivery ratio. Comparisons denote that the proposed AECBRP has better performances with respect to the original CBRP and Cross-CBRP