A new MANETs clustering algorithm based on nodes performances

A mobile ad hoc network (MANET) is a wireless network without the support of any fixed infrastructure. Security is one of the main challenges in ad hoc network due to dynamic topology and mobility of nodes. Organizing mobile nodes into manageable clusters can limit the amount of secure routing information. Under a cluster structure, mobile nodes are managed by nodes called cluster heads. The cluster-head role is resource consuming since it's always switched on and is responsible for the long-range transmission. In this paper, we present a clustering algorithm based on node performances, a scheme to improve the cluster by electing a better cluster head using a threshold of performance. This solution will be used to manage cryptographic keys in an ad hoc network. Our algorithm gives major improvements regarding the number and the performance of elected cluster heads. Analysis and simulation results are used to show the performance of our algorithm, compared with other clustering algorithms in literature.

Mobile Ad hoc Network (MANET) basically, is a collection of mobile hosts incorporating wireless interfaces that forms a transitory autonomous network. They do not base on fixed infrastructure or central administration, rather work on the principle of self-organized interconnections among mobile nodes. Fundamentally, in MANET when nodes come inside the transmission range of neighboring nodes', they can be detected by each other and can communicate directly. However for communication outside this range they have to depend on some other nodes to relay the messages .This is where routing protocols have to play a very important role. Literature for improving the performance of routing protocol is available in abundance. Among these comes, the hierarchical/cluster-based routing protocols that claim to reduce control overheads. Clustering in Mobile Ad hoc Networks (MANETs) has proved to be advantageous compared to the traditional networks. However the highly dynamic and unstable nature of MANETs makes it intricate for the cluster based routing protocols to split a mobile network into clusters and determination of cluster heads for each cluster. Although much previous research has concentrated on cluster-head selection in MANETs, not much effort has been done on the security side of cluster-head selection. This paper emphasize that secure cluster head selection in MANETs has an intense effect on network performance. Specifically, we stress that in ad hoc network where all the participants are self controlled, security is an essential aspect and the effective cluster-head selection can improve network throughput. We propose a secure and effective cluster-head Selection scheme using a cross-layer approach that integrates cluster-head discovery and selection functionality with network ad hoc routing mechanisms and the lower layer drivers built-in the system. Besides, proposed scheme handle the disconnections in ad hoc network due to the effects of topology changes and battery depletion. This scheme allows clients to switch to better cluster-head nodes as network topology changes. Hence, provides better performance to network.

A mobile ad-hoc network is an autonomous collection of wireless mobile nodes that organizes a temporary network without any network infrastructure. Due to node mobility, it is a challenging task to maintain the network topology. In this paper, we propose a stable clustering algorithm that uses node mobility for cluster formation. In the proposed algorithm, the node mobility is measured by counting the time of nodes entering into leaving from its transmission range. The node having the lowest mobility is selected as a cluster head. For topology maintenance with reduced control overhead, the cluster head adaptively controls the broadcasting period of hello message to the measured node mobility. Through computer simulations, it is verified that the proposed algorithm outperforms previous clustering algorithms in terms of control overhead, the rate of node mobility changes and the number of cluster head changes.KeywordsMobile ad-hoc networkClusterNode Mobility

A mobile ad-hoc network is an autonomous collection of wireless mobile nodes that organizes a temporary network without any network infrastructure. Due to node mobility, it is a challenging task to maintain the network topology. In this paper, we propose a stable clustering algorithm that uses node mobility for cluster formation. In the proposed algorithm, the node mobility is measured by counting the time of nodes entering into leaving from its transmission range. The node having the lowest mobility is selected as a cluster head. For topology maintenance with reduced control overhead, the cluster head adaptively controls the broadcasting period of hello message to the measured node mobility. Through computer simulations, it is verified that the proposed algorithm outperforms previous clustering algorithms in terms of control overhead, the rate of node mobility changes and the number of cluster head changes.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Mobile ad-hoc network (MANET) is a type of communication network which is used for data communication between a group of mobile nodes using wireless channels. Clustering has evolved as an important research topic in MANETs as it improves the system performance of large MANETs. Clustering is a process that divides the network into interconnected substructures, called clusters. Each cluster has a cluster head as coordinator within the substructure. In this paper, we propose a new clustering protocol for MANET. The proposed algorithm is a very quick clustering algorithm and creates minimum clusters with maximum member node in each cluster. The simulation results show that the proposed algorithm provides better performance in terms of the number of formed clusters and average number of transition (state change) on cluster heads when compared to that of other weight based algorithms such as weighted clustering algorithm (WCA).

One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.

With the advancement of wireless communication technology, the intelligent transportation system (ITS) has attracted the attention of vehicle companies and academic researchers. Recently, vehicular ad hoc networks (VANETs) as a leading genuine technology have received serious attention as a kind of mobile ad hoc network (MANET) to ensure the safety of vehicles, drivers, and passengers. However, these networks face many challenges due to the mobility of vehicle nodes, wireless communication, and frequent topology changes. One of the crucial issues of these networks is a cluster-based routing scheme with the ability to provide quality of service (QoS) parameters. A clustering scheme is an appropriate method for increasing the scalability of VANETs. In a cluster-based routing scheme, the cluster head (CH) is responsible for receiving data from its member nodes, and aggregating and transferring data to the next CH node. On the other hand, providing a suitable clustering method is NP-hard problems and meta-heuristic algorithms are suitable for solving these problems. A scalable and reliable routing scheme is necessary and essential in VANETs. In this paper, a routing method based on the clustering technique is presented considering the moth-flame optimization (MFO) algorithm for clustering and the Firefly optimization algorithm (FoA) with a suitable fitness function for routing between CHs. The simulation of the proposed method with MATLAB software shows that the proposed RVMF method improves the parameters of packet delivery rate (PDR), latency, and throughput.

The mobility and resource limitation of nodes are the critical factors that affect the performance of Mobile AD hoc network (MANET). The mobility of nodes will affect the stability of links, and the limitation of node resources will lead to congestion, so it is very difficult to design a routing protocol that supports quality of service (QoS) in MANET. Especially in the scenario of high-speed node movement, frequent link interruption will damages QoS performance, so it is necessary to design MANET routing protocol that can adapt to network topology changes to support QoS. In this paper, we propose a Topological change Adaptive Ad hoc On-demand Multipath Distance Vector (TA-AOMDV) routing protocol, which can adapt to high-speed node movement to support QoS. In this protocol, a stable path selection algorithm is designed, which not only takes node resources (residual energy, available bandwidth and queue length) as the path selection parameters, but also considers the link stability probability between nodes. Furthermore, in order to adapt to the rapid change of topology, link interrupt prediction mechanism is integrated into the protocol, which updates the routing strategy based on periodic probabilistic estimates of link stability. Different scenarios with node speed in the range of 10-50m/s, data rate in the range of 4-40kbps and number of nodes in the range of 10-100 are simulated on NS2 platform. Our results show that the QoS metrics (packet delivery rate, end-to-end delay, and throughput) of the proposed protocol are significantly improved when the node speed is higher than 30m/s although it is slightly better when the node speed is lower than 30m/s. Our on-demand multipath routing protocol demonstrates high potential to support QoS for high-speed MANET.

Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop paths between each source and destination pairs. For scalability, it is critical that for supporting network centric applications with large set of nodes require hierarchical approach to designing networks. In this research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster supports a few nodes with a cluster head. The intra -cluster connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure handling mo bility in such a way that no service disruption can occur. The inter-cluster connectivity is also achieved by multi -hop connectivity. However, for inter-cluster communications, only cluster heads are connected. The selection of intra -cluster communications and inter-cluster communications allow scalability of the network to support multi services applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph theoretic approach to establish efficient connection between a source an d a destination within each cluster in intra-cluster network and between clusters in inter -cluster network. Graph theoretic approach traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is to support an efficient routing algorithm for multi -hop communications across many nodes which are dynamic in nature. However, dynamic behavior of the nodes requires greater u nderstanding of the node degree and mobility at each instance of time in order to maintain end -to-end QoS for multi-service provisioning. This paper demonstrates graph theoretic approach produces an optimum multi -hop connectivity path based on cumulativeminimum degree that minimizes the contention and scheduling delay end-to-end. It is applied to both intra-cluster communications as well as inter -cluster communications. The performance shows that having a multi -hop connectivity for intra-cluster communications is more power efficient compared to broadcast of information with maximum power coverage. Each cluster performs similarly and the algorithm is also used for inter -cluster communications. Our simulation results show that the proposed graph theoreticrouting approach will reduce the overall delay and improves the physical layer data frame transmission.

In mobile ad hoc networks (MANETs), the efficient energy-efficient cluster head selection (EECHS) is a significant issue. When an appropriate cluster head (CH) is chosen, MANETs'''' energy efficiency improves. Clusters are built in MANETs to facilitate communication between nodes. The EECHS problem has been addressed using a variety of clustering strategies, including distributed clustering and cluster-based routing. However, these approaches require high overhead and complexity, leading to suboptimal performance. Therefore, it is necessary to develop an algorithm that can select the best CH to facilitate efficient energy-efficient communication in MANETs. In this regard, the Firefly Algorithm (FA) has been proposed as an effective approach to solving the EECHS problem. FA is a type of swarm intelligence-based meta-heuristics algorithm inspired by the behavior of fireflies. FA is a simple and efficient optimization method that can be used to select the best CH in MANETs. The method has a number of benefits, including enhanced convergence rate and local search functionality. FA is also computationally effective and can adapt to shifting network conditions. This essay offers a thorough evaluation of the literature on the use of FA in MANETs to address the EECHS. Along with comparisons of their performances, a thorough examination of the suggested methodologies and algorithms is offered. Last but not least, various difficulties and potential research paths pertaining to the usage of the FA are explored.

Energy and mobility conscious multipath routing scheme for route stability and load balancing in MANETs

A Mobile ad hoc Network (MANET) is a self-configuring, dynamic, multi-hop network composed of mobile nodes that operate without the need of any established infrastructure. The creation of stable, scalable and adaptive clusters with good performance, faster convergence rate and minimal overhead is a challenging task in MANET. This chapter proposes two clustering techniques for MANET, which are (k, r)-Dominating Set-based, weighted and adaptive to changes in the network topology. The set of dominating nodes functions as the clusterhead (CH) to relay the data and control packets. The proposed scenario-based clustering algorithm for MANETs (SCAMs) is a greedy approximation algorithm, whereas the Distributed SCAM (DSCAM) selects the (k, r)-dominating set through a distributed election mechanism. These algorithms achieve variable degree of CH redundancy through the parameter k, which contributes to reliability. Similarly, flexibility in creating variable diameter clusters is achieved with the parameter r. The performance of these algorithms are evaluated through simulation and the results show that these algorithms create stable, scalable and load-balanced clusters with relatively less control overhead in comparison with the existing popular algorithms.

A very efficient and well-known computing environment is Mobile Adhoc Network (MANET). However, the node capacity and delay are affected during the data transmission due to its mobility. To tackle this problem, Multi-criteria Enhanced Optimal Capacity-Delay Tradeoff with Efficient Fuzzy-based Multi-constraint Multicast Routing (MEOCDT-EFM2R) method has been proposed to solve the optimal route selection problem where the multiple network metrics are taken into consideration. However, it requires fault tolerance-based Cluster Head (CH) selection since it does not handle any transmission or link failure in the network. Therefore in this paper, Efficient Fuzzy-based Multi-constraint Multicast Fault Tolerance Routing (MEOCDT-EFM2FTR) method is proposed to efficiently handle the transmission failure in the network. In this method, the CH for each cluster is chosen depending upon on the maximum nodal weight which is stored in the routing table. Initially, each and every node computes its weight with different network metrics like residual energy, mobility speed, computational power and fault tolerance. Then, the node with the highest weight is elected as CH of a specific cluster and each CH coordinates itself as a ring to tolerate any transmission failure by choosing a new CH. So, the new CH takes the responsibility of initial CH to complete the transmission without degrading the network performance. Finally, the simulation gives the evidence for the performance effectiveness of the MEOCDT-EFM2FTR method compared to the MEOCDT-EFM2R for throughput, routing overhead, delay, etc.

Mobile Ad hoc Networks (MANET) are structure less, autonomous wireless networks with mobile nodes that dynamically establish data transmission connections. Due to dynamic topological change, MANET routes are unbalanced and break repeatedly. Hence, providing efficient and reliable data delivery with effective utilization of network resources is a challenging issue to be considered in MANET. This paper proposes an instant-runoff Ranked Decision Forests Probit Regression-based Connectionist Multilayer Deep Neural Network (IRDFPR-CMDNN) for efficient data transmission and higher data delivery with a minimum end-to-end delay. This IRDFPR-CMDNN method performs route identification, data delivery, and route maintenance with more than three layers. Then the mobile nodes are sent to the input layer of the Connectionist Multilayer Deep Neural Network. In hidden layer 1, the Instant-runoff Ranked Decision Forests algorithm is applied for classifying the mobile nodes depending on the residual energy and load capacity. With selected mobile nodes, the Probit Regression is applied for finding the nearest neighboring nodes in the second hidden layer based on the link quality and received signal strength for route path establishment. Then multiple paths for routing are established from source to destination node and start to perform the data transmission. If link failure occurs during the data transmission, another alternative route with better link quality is selected for routing. In this way, energy-efficient data transmission is performed from source to destination with a higher data delivery rate and minimal time consumption. Experimental evaluation is carried out on energy consumption, packet delivery ratio, packet drop rate, throughput, and end-to-end delay with varying numbers of mobile nodes and data packets. Simulation results show that the IRDFPR-CMDNN technique effectively enhances data delivery, throughput and minimizes energy consumption, packet loss rate, delay with respect to conventional methods.