Dominating set clustering protocols for mobile ad hoc networks

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.

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.

In a mobile ad hoc network (MANET), the mobile nodes travel at random and are not constrained by any infrastructure. Clustering is a crucial model in MANET to improve the efficiency of routing. In a MANET, choosing a Cluster Head (CH) necessitates producing resiliency in the face of topology changes brought on by node movement, connection failure, and the insertion or removal of nodes. On the other hand, some malicious nodes intentionally drop data during network transmission, which results in ineffective routing and security for reaching the destination node. In order to increase throughput and network lifetime during multipath transmission, the proposed work is focused on increasing the stability in routing and secure data delivery with minimal end -to -end delay and energy consumption for MANET. This paper propose the Swarm Intelligence Based Cluster Supported Routing Protocol (SIBCSRP) to address these problems by improving cluster accuracy and routing efficiency to find the best route in MANET. Cluster Aided Routing Algorithm (CARA) and Trusted Path Selection Using Swarm Intelligence (TPSUSI) are the two components of the SIBCSRP. MANET problems including cluster head selection, multipath routing, data collecting, and localization are dealt with by CARA. To determine the best way for transmitting data packets, the ant feeding behavior created the meta -heuristic technique TPSUSI. By reducing End to End latency and Routing Control Overhead in the network, the proposed SIBCSRP protocol improves data packet delivery ratio.

A mobile ad hoc network (MANET) is a dynamic wireless network which can be formed without the need for any pre-existing infrastructure in which each node can act as a router. In comparison with fixed networks, some new security issues have arisen with the introduction of MANETs. Secure routing, in particular, is an important and complicated issue. 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 clusterhead role is resource consuming since its always switched on and is responsible for the long-range transmission. If a node has this role, it would burn its resource quickly, and after it died, all its members would be headless. In this work, we propose a new clustering algorithm for ad hoc networks, where the clusters are formed around the most powerful nodes, i.e, the node that has the best material resources such as residual energy, free memory, processor speed and hard disk space is elected as cluster head. Our algorithm takes into account the node range by including in our calculation the node density. Therefore, we are sure that the cluster head is represented by the most powerful and the less mobile node in the network that can perform its roles in the best conditions. 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.

Infrastructure and ad hoc network architectures are the two major architectures that can use wireless networks. Unlike infrastructure architecture using the centralized base station, mobile ad hoc network (MANET) is an infrastructure-less architecture which can be connected without any centralized control. In MANET, a mobile device can be connected with another device within the appropriate radio range that is typically 30 MHz to 5 GHz. Therefore, MANET is considered as a self-organizing network where each node acts as a participant and a router. Sector-based routing is a method in MANET which can be used to separate the positions of every node in a network topology. In addition, a specific node called server node can be assigned among the nodes in each sector. The server node is responsible to reserve the path resources and to maintain the information for its associated nodes and links. The performance of sector-based routing depends on the number of nodes available in the sector. Further, the routing approach in sector-based MANET can be considered in various scenarios using server nodes. Our research in this paper is to evaluate the efficiency of the sector-based routing in MANET considering several scenarios. Further, we address the variation of the performance while the number of nodes changes with several routing methods in sector-based MANET. In this paper, we investigate the detailed simulation experiments on a different number of nodes and various scenarios of sector-based routing in MANET. Our findings are as follows. (1) The average collision rate is significantly lower in sector-based routing when compared to MANET. (2) The resource efficiency in sector-based routing is considerably higher. (3) Unlike in a small number of nodes, the higher number of connections can be allowed in a high number of nodes distributed in a sector.KeywordsMANETSector-based routingServer nodeResource efficiency

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 Wireless Mobile Ad Hoc Networks (MANETs), the nodes consist of a wireless transmitter and receiver for communication. The nodes can move around easily within the range of the network. These nodes transfer the information through base stations. It does not take many cables for connection. This wireless network works too easily and rapidly compared to the wired network. Various sensor nodes are associated with MANET and it acquires limited energy source and memory capabilities. This research addressed these disadvantages by using novel techniques in MANET. The main aim is to increase the detection range of sensors remaining nodes when nodes fall in premature death, to prevent the formation of holes in the supply network of wireless sensors. In this research work, utilized the Expectation Maximization approach for uneven clustering and cluster head selection that aims to decrease energy consumption in the data transmission process that contributes to the highest energy consumption in MANET. Experiments proved that the proposed method achieved better results when compared with other algorithms with respect to various performance metrics.

Mobile Ad hoc Networks (MANETs) have always been vulnerable to Sybil attacks in which users create fake nodes to trick the system into thinking they’re authentic. These fake nodes need to be detected and deactivated for security reasons, to avoid harming the data collected by various applications. The MANET is an emerging field that promotes trust management among devices. Transparency is becoming more essential in the communication process, which is why clear and honest communication strategies are needed. Trust Management allows for MANET devices with different security protocols to connect. If a device finds difficulty in sending a message to the destination, the purpose of the communication process won’t be achieved and this would disappoint both that device and all of your devices in general. This paper presents, the Two-Tier Multi-Trust based Algorithm for Preventing Sybil Attacks in MANETs (TMTACS). The TMTACS provides a two-tier security mechanism that can grant or revoke trust in the Nodes of the MANET. It’s a smart way to identify Sybil nodes in the system. A proficient cluster head selection algorithm is also defined, which selects cluster head efficiently and does load balancing to avoid resource consumption from a single node only. Also, for routing efficient path is selected to deteriorate energy consumption and maximize throughput. The recent technique is compared with Secured QoS aware Energy Efficient Routing (SQEER), Adaptive Trust-Based Routing Protocol (ATRP), and Secure Trust-Aware Energy-Efficient Adaptive Routing (STEAR) in terms of Packet Delivery Ratio (PDR), consumption of energy etc. The simulation was performed on MATrix LABoratory (MATLAB) and the results achieved by the present scheme are better than existing techniques.

Mobile Ad hoc Networks (MANET) are wireless infrastructure less networks that are formed spontaneously and are highly dynamic in nature. Clustering is done in MANETs to address issues related to scalability, heterogeneity and to reduce network overhead. In clustering the entire network is divided into clusters or groups with one Cluster Head (CH) per cluster. The process of CH selection and route optimization is extremely crucial in clustering. Genetic Algorithm (GA) can be implemented to optimize the process of clustering in MANETs. GA is the most recently used advanced bio-inspired optimization technique which implements techniques of genetics like selection, crossover, mutation etc. to find out an improved solution to a problem similar to the next generation that inherits the positive traits and features of the previous one. In this chapter several genetic algorithm based optimization techniques for clustering has been discussed. A comparative analysis of the different approaches has also been presented. This chapter concludes with future research directions in this domain.

Mobile nodes communicate with each others having the limited energy in mobile ad hoc networks. The large amount of control packets and the frequent flooding of control packets cause energy exhaustion of nodes. The main goal of routing protocols in mobile ad hoc networks is throughput enhancement. Hence, this paper proposes a new routing protocol for mobile ad hoc networks called the Routing Protocol for Throughput Enhancement and Energy Saving (TEES) in mobile ad hoc networks. The simulation results show that TEES increases the amount of packet delivery and reduces the control packet overhead.

Power control algorithms for mobile ad hoc networks

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 (MANETs) are formed dynamically by an autonomous system of mobile nodes that are connected via wireless radio links. Hybrid routing strategy is widely used in hierarchical routing protocols to reduce the control overheads and packet delivery delay in MANETs. In this paper, we propose zone-based energy aware hybrid multicast routing scheme (ZEHMRP) for MANET. Our scheme operates in the following phases: 1) computation of node remaining energy (RE) by designing energy model; 2) prune the nodes having remaining energy less than predefined threshold value; 3) discovery of multiple routes using request and reply packets; 4) selection of stable route among multiple routes by considering node remaining energy and density; 5) route maintenance for route breaks and node failures; 6) simulation evaluation for various parameters. It is observed that ZEHMRP outperforms the zone routing protocol (ZRP) for various parameters like packet delivery ratio, end-to-end delay, jitter, and control overheads.

Mobile ad hoc network (MANET) is becoming a hot communication environment, and these days, it is more prominent due to its mobile and dynamic deployment nature. However, due to the autonomous and dynamic nature of network topology, it composes them more open to the different kind of attacks. The major problem statement is to assure secure network services to ensure secure communication for different communication areas. In order to overcome this issue, a secured cluster-based distributed fault diagnosis routing for MANET with key distribution and fault diagnosis model is proposed. In the proposed model, a cluster is created depending on the secured cluster function and fault diagnosis function. Cluster-based distribution distributes the aggregated data on each cluster and distributes to the corresponding data center. The node having maximum energy rate value is taken as the cluster head, and we introduced pseudonymity for secured routing. We simulated the proposed model using NS2 to determine the efficiency.