Investigation of New Approach to the Design and Development for Clumping Algorithm in MANET (original) (raw)

A Review: Novel Protocol For Clumping In Mobile Adhoc Networks

Mobile ad hoc networks (MANETs) is the combination of three words 1. Mobile(Movable or Transportable) 2. Adhoc( Temporary or for specific purpose) 3. Networks(Flexible data applications which use networks to communicate) or A MANET can be defined as a system of autonomous mobile nodes that communicate over wireless links without bounded, defined or fixed infrastructure. MANETs are useful in places that have no communicat ions infrastructure. Mobile adhoc network is a type of ad hoc network that can change locations and configure itself on the fly. Base station plays a very important role in infrastructure based cellular networks . But to create a base station in infrastructure less network is very difficult because of movable of nodes. Mapping the logic of base stations into mobile ad hoc networks leads to the design of logical clump, where the ch(clump head) in every clump play the role of base station. So clumping is very important in this type of networks . The aim of this research work is to enhance the network lifetime , proper balancing the power consumption among mobile nodes and increase the throughput of the networks. For this type of architecture we have design some protocols and algorithms which a re : Closer Clump Detection Protocol (CCDP) , Energy Efficient Based Clumping Algorithm (EEBCA) and A Broadcasting Range Adjustment Protocol (BRAP) has been proposed which allows the isolated nodes to adjust their ranges to remain connected with existing c lump heads. Each of the work is evaluated separately to analyze their performances and compared with the competent results.

Performance Evaluation of Energy Efficient Clumping Based Algorithm in MANET Using NS2

2014

Energy efficient clumping formation of nodes in Mobile Ad-Hoc Networks (MANETs) is very important as nodes in MANETs typically activate unattended with a limited power source. Energy efficient clumping formation in MANET is one of the major issue because energy of one node in clumping may affect all other nodes and also effect on the life time of the Clumping Head.In this paper, propose a newalgorithm technique - which is "Energy Efficient ClumpingBased Algorithm (EECBA)" on the bases of energy efficient routing and minimized the flooding strategies. It is emphasis that clumping maintenance and formation at low cost the resources used that aremobility and high battery power.This algorithmic technique reduce the routing overhead,increase the network life time. The Performance metrics are delay, Throughput. Thesimulation will be done using NS2 network Simulator.

PERFORMANCE ANALYSIS OF ENERGY EFFICIENT CLUMPING BASED ALGORITHM USING BARP AND CCDP

Energy Efficient Clumping Based Algorithm establishing of nodes in Mobile Ad-Hoc Networks (MANETs) is very critical as nodes mobility, battery power and range in MANETs. Rendering to performances many problems are handle and identify to lower stability of the network and battery drainage of clumping heads due to dynamic allocation of Clumping Heads. Energy efficient clumping formation in MANET is one of the major issues because energy of one node in clumping may affect all other nodes and also effect on the life time of the Clumping Head. In this paper, propose a new algorithm technique – which is “Energy Efficient Clumping Based Algorithm (EECBA)” a new Weightage based and distributed mobility prediction-based weighted clumping algorithm with local clumping-heads. Omni-directional antennas are used in Broadcast range adjustment protocol (BRAP). This BRAP technique set the range for clumping head is to reduce the network overhead and increase the performance of the network. It is emphasis that Closer Clump Detection Protocol (CCDP) for finding the maintenance, formation and neighbour clump in the network at low cost the resources used that are mobility and high battery power. This algorithmic technique reduces the routing overhead, increase the network life time. The Performance metrics are Average Throughput, packet delivery ratio, Network Life time, Delay Analysis. The simulation will be done using NS2 network Simulator.

Review of Manet on Different Clustering Approaches

A new era is dawning for wireless mobile ad hoc networks where communication will be done using a group of mobile devices called cluster, hence clustered network. In a clustered network, protocols used by these mobile devices are different from those used in a wired network; which helps to save computation time and resources efficiently. A mobile ad hoc network (MANET) is a network in which data is transmitted from the sender to the receiver without the ne ed for any infrastructure. In this network, the connected nodes may be in the form of laptops, mobile phones, personal digital assistant (PDA), and so on, and any node can work as a router that receives and sends packets [1]. In an ad hoc network, the dela y of route traffic can be minimized by the clustering technique, and network performance, as well as data transfer control, can be improved by the selection of the routing protocol type [2]. This survey investigates the effect of using the clustering technique in ad hoc n etworks and how this technique can increase resource savings and decrease time delay. It also describes clustering, cluster structure, cluster linking type, and the different types of clustering algorithms used in cluster head selection and their effects on MA NETs. INTRODUCTION A wireless mobile ad-hoc network is a group of mobile devices that forms a network which does not require the usage of wires or cables for communication. Mobile nodes in this network are able to detect the presence of nodes that are in close proximity. Due to the limited transmission range of wireless network interfaces, multiple networks " hops " may be needed for one node to exchang e data with another across the network. Wireless ad-hoc networks have some properties such as the dynamic network topology, limited bandwidth, and energy constraint in the network. A mobile ad hoc network (MANET) consists of a number of mobile nodes that jointly function as a router. A MANET can be created dynamically without any infrastructure. In this network type, the use of the clustering technique significantly reduces the routing traffic that occurs during the routing process. Clustering is used to divide an ad hoc network into small sets of nodes, with each cluster consisting of a cluster head, ordinary nodes, and gateway nod es. Clustering can be used for the effective utilization of resources for large ad hoc networks. This survey explores the main clustering me chanisms for selecting cluster heads in ad hoc networks. The mechanisms include the lowest degree ID algorithm (LDID), highest degree ID algorithm (HDID), dynamic mobile adaptive clustering (DMAC), and weighted clustering algorithm (WCA). Different types of routing protocols are used to evaluate the performance of this network type with and without clustering. According to [4,5], sensor nodes are dynamic in nature also and are limited in the communication range and computing power. The energy of sensor nodes gets reduced while communicating with other nodes or the base station. These nodes get converted into dead nodes from the ali ve nodes, which can make the network less energy efficient. Making clusters of the sensors is one of the possible solutions to deal with this issue as this can make the network more scalable and energy efficient. In cluster based routing, a network is divided in to a number of clusters and within each cluster, a cluster head is elected based on some pre-decided parameter. Cluster Head nodes in clusters have more energy as compared to non-cluster head nodes. So, to balance energy level of the network, we propose Flower Pollination Algorithm (FPA) which gives more energy efficient network as compared to existing approache s. Fig.1 shows all the nodes connected in the ad hoc network without clustering, and Fig.2 shows the same network with clusterin g.

Survey on Algorithms for Efficient Cluster Formation and Cluster Head Selection in MANET

Procedia Computer Science, 2016

A Mobile Ad-hoc Network (MANET) is dynamic and self-configuring network that formed by collecting number of mobile nodes. Group of node make one cluster. It is necessary to have a good and efficient cluster formation and cluster head selection algorithm to connect with other neighbouring node. Their communication should do in very less time. The various techniques are available to make cluster. Battery life, speed, packet delivery ratio, delay these are some important parameter through which we can make efficient algorithm. This survey paper focuses on the Comparison between Lowest ID (LID), Highest Degree (HD), LEACH(Low Energy Adaptive Clustering Hierarchy).

A Novel Clustering Approach for MANETs based on Mobility

In recent years, many studies have been conducted in Mobile Ad Hoc Networks field in order to make a virtual infrastructure consisting of nodes. The common goal of all was to select a node called clusterhead which guarantees relationships between nodes. In this paper, we have presented a new clustering algorithm in Mobile Ad Hoc Network based on nodes weight. For calculating node weight we persent four new parameter, congestion, stability, number of nodes moving towards a node and battery remaining. The goal of this algorithm is to decrease the number of cluster forming, maintain stable clustering structure and maximize lifespan of mobile nodes in the system. In simulation, the proposed algorithm has been compared with WCA, MOBIC and the Lowest_ID algorithm. The results of simulation reveal that the proposed algorithm achieves the goals.

A Review on Various Clustering Technique and Protocol in MANET

IJARCCE, 2017

Mobile ad-hoc network (MANETs) is a type of wireless network which do not consist a base station for providing network connectivity. A mobile ad-hoc network (MANET) is a self-configuring, infrastructure less network. When MANET network used for large scale operation, MANET induce many drawbacks like delay in routing, resource consumption due to dynamic nature of MANET. Many cluster algorithm proposed by researcher to overcome this problem. Cluster technique used to splitting the network into Sub network called cluster. Every cluster has a its own cluster head which maintains a whole information about the cluster. Dynamic nature of MANET make difficult to divide a network into cluster and electing cluster head. In this paper we provide an overview of some clustering approaches and protocol used in Manet.

A STATE OF ART OF VARIOUS CLUSTERING SCHEMES IN MANET

Mobile Ad-hoc Networks (MANETs), are a specific kind of wireless networks that can be quickly deployed without any pre-existing infrastructures. They are used in different contexts such as collaborative, medical, military, embedded applications, etc. MANET has fully mobile nodes with limited energy and bandwidth. To provide better communication, the efficient utilization of energy and bandwidth is required. Due to this challenging approach, the mobile nodes can form groups for their stability and better bandwidth usage. The mobile nodes can be grouped using clustering approach. This approach involves with several clustering algorithms which allow the structuring of the network into groups of entities called clusters and creating a hierarchal structure. Each cluster contains a particular node called cluster head which is elected as according to a specific metric or a combination of metrics such as identity, degree, mobility weight, density, energy etc. This paper discusses clustering, its advantages and disadvantages, cluster head selection methods and various clustering schemes proposed in MANET.

A New Clustering Algorithm Using Links' Weight to Decrease Consumed Energy in MANETs

TELKOMNIKA (Telecommunication Computing Electronics and Control), 2014

One of the most important problems of clustering algorithms in mobile ad-hoc networks (MANETs) is the relatively low stability in generated clusters which are resulted by rapid clusters destruction and high energy consumption in performing the re-clustering processes. Many algorithms have been provided to increase the clusters stability of which the most significant are weight-based algorithms. In weight-based algorithms, only limited information of each node is used to determine its weight and it causes that the best possible option for cluster-head is not selected. The purpose of this paper is providing one weight-based algorithm in which each node's weight determination is performed not only by using its node information but also its neighbor's nodes information and this work is performed by determining the links' weight between nodes that provide connections between nodes. Via this method, the best possible options can be selected as cluster-head. In simulations and performed experiments, it is revealed that the generated clusters by our proposed algorithms have very high stability.