Multicast Routing In MANETs Research Articles

A competent CCHFMO with AMDH for QoS improvisation and efficient route protection in MANET

SummaryThe ability of mobile ad hoc networks (MANET) to be used as communication tools in a variety of industries, including healthcare, the military, smart traffic, and smart cities, has drawn special consideration. Traditional Manet's multicast routing methods seem to be inappropriate to massive with Adaptive systems because the problem is NP‐complete, resulting in an enchanting QoS restrictions. In order to conquer that the paper proficiently introduces the Conglomerate Crumb Horde Formicary Meta‐Heuristic (CCHFMO) with Asymmetrical Meander Diffie‐Hellman (AMDH) to tackle the major obstacles are multicast routing problems and lack of data protection. Initially, the fusion of crumb horde optimization (CHO) and formicary optimization (FO) is exploited to strengthen QoS limitations and reduce QoS data loss. However, the massive and dynamic nature of the network with the combination of more QoS restrictions, deficient security has become extremely difficult. Therefore, the research work establishes the asymmetrical meander Diffie‐Hellman (AMDH) to significantly improve performance and concealment while ensuring channel security during data transfer. Finally, the results demonstrated that by employing the novel optimization approaches, the MANET can increase data protection while still achieving high transmission rates and sophistication of communication. As a consequence, it adequately explicates the article to improve QoS performances.

WBMR: a new communication scheme for multicast routing in MANETs

WBMR: a new communication scheme for multicast routing in MANETs

Tiger hash based AdaBoost machine learning classifier for secured multicasting in mobile healthcare system

Secure multicast routing is an important in mobile healthcare system. Few research works have been developed to prevent malicious behaviors from disclosing integrity of data in mobile healthcare systems using machine learning technique. But, the performance of conventional machine learning technique was not effectual. In order to overcome this limitation, Tiger hashing based AdaBoost with SVM classifier (TH-ASVMC) technique is proposed. The TH-ASVMC technique is designed to improve the security of multicast routing in MANETs with higher data integrity rate and therefore reducing the time taken. The TH-ASVMC technique initially used Tiger hash function which converts the patient data to be transmitted over a wireless network into a hash value for maintaining the data integrity during the process of multicasting in mobile healthcare system. After that, TH-ASVMC technique used AdaBoost with SVM classifier to classify the nodes in mobile healthcare system as authentic or unauthentic based on measurement of trust value for securing multicast routing with minimum communication overhead. Thus, TH-ASVMC technique choose the only an authentic node for routing the hash value of patient data to multiple destination nodes in mobile healthcare system. This process results in enhanced reliability and scalability of secured multicast routing. The TH-ASVMC technique conducts the simulations works on metrics such as data integrity rate, scalability, reliability and communication overhead. The simulation results shows that the TH-ASVMC technique is able to improve the reliability and data integrity rate of multicast routing as compared to state-of-the-art works.

Improved multicast routing in MANETs using link stability and route stability

SummaryThe growing popularity of multimedia applications and services needs to support several quality of service metrics such as high throughput, low energy, and jitter, which is a challenging task in mobile ad hoc networks. Because of limited bandwidth, energy constraints, dynamic topology, transmission errors, and fluctuating link stability, the links between adjacent nodes are often not reliable and may break because of node mobility. Link breakage initiates the process of rerouting either at the sender node (the node at which the link breaks) or at the source node. In either case, it leads to packet loss, delivery delays, and increased control overheads. Hence, to attain a minimum quality of service, routing protocols must address the dynamic network topology. Uncertain and varying movement of nodes necessitates stability of the links between such nodes. The objective of this paper is to propose 2 protocols, the first based on link stability and the other based on route stability. Link stability identifies a stable link from the available links to the next hop and determines a stable end‐to‐end route. The probability of successful transmission of periodic packets is used as a link stability metric to assess the stable path. Acknowledgment ‐free packets are used to check connectivity in the network. Increased probability of successful transmission implies that the selected link is sustained for longer duration and can deliver packets more reliably or, as a consequence, results in a stable link to deliver a better data rate. With a stable link, there is a reduced possibility of retransmissions, reduced end‐to‐end delay, reduced control overheads, and enhanced data delivery ratio. Selection of the most stable route for data transmission improves the performance. Experimental results from simulations performed on EXata/Cyber v2.0 simulator reveal that our proposed protocols are an improvement over the existing protocols in terms of packet delivery ratio, average end‐to‐end delay, and average route lifetime, even without route optimization with the minor increase in control packets. A case study of the application of proposed protocols is also presented.

An Algorithm to Improve MAODV Multicast Routing in MANET

By studying multicast routing algorithm for MANET, this paper proposes a new heuristic algorithm to improve MAODV performance. Algorithm calculate the cost function under the delay constraint conditions, dynamically adjust the leader node, thus reducing crowded areas produce, for MAODV provide Qos. Simulation results show that when the expansion of the network, this algorithm has less routing overhead, high efficiency.

Anonymous group-based routing in MANETs

Although operating as groups is required by many of ad hoc applications and privacy preservation is a critical issue in such scenarios, there is only a sparse research done on anonymous multicast routing in MANETs. Anonymity, location privacy and unlinkable communication are important privacy aspects specially in wireless environments. A potential eavesdropper may launch traffic analysis to infer privacy related information of the network. Meanwhile, the characteristics of wireless ad hoc networks such as the limited resources or dynamic topology make providing privacy very challenging in MANETs and privacy in such networks can not be achieved without appropriate protection schemes. In this paper, we propose an anonymous multicast routing protocol for mobile ad hoc networks. Our protocol extends anonymous routing from unicast communication to multicast scenarios and also provides additional privacy properties.

Range Detection Multicast Routing Protocol for Mobile Ad-Hoc Networks

Problem statement: Many efforts have been implemented towards the Group membership management on multicast routing in MANETs, but the difficulties associated with Group membership management are still existed. Approach: Maintaining endurance of Group Leader (GL) in multicasting routing has been a great challenge to all the protocol having been invented so far. Results: This study provides the RDMP algorithm for persistency of Group Leader within the group. Nodes perform very active in exchanging the Data and Control packet when they mobile within the transmission range. Range Detection Multicast Protocol (RDMP) focuses on dynamic topology of nodes and uses detection mechanism based on transmission range within the group. Instead of having a separate external node to monitor on Group leadership, a node within the transmission range acts as a Leadership Track Node (LTN), Group Leader manages the group member with the aid provided by LTN and thus control over head shared among them. LTN keeps track of mobility of Group Leader and send alert message when Group Leader moves out of Transmission range and also holds the list of address of all other Group Leader which are adjacent to it. Routing control packet and data packet are regulated with minimum control over head. Conclusion/Recommendations: Our simulation results under increasing group size demonstrate endurance of Group leader for longer period of time, joining delay for multicast group is very low, normalized control over head and minimizing number of hops in maintain average path length.

Energy Efficient Multicast Routing in Manet

In this paper, we have presented the Modified Multicasting through Time Reservation using Adaptive Control for Excellent Energy efficiency (MMC-TRACE). It is a real time multicasting architecture for Mobile Ad-Hoc networks to make their work an energy efficient one .MMC-TRACE is a cross layer design where the network layer and medium access control layer functionality are done in a single integrated layer design. The basic design of the architecture is to establish and maintain an active multicast tree surrounded by a passive mesh within a mobile ad hoc network. Energy efficiency is maximized by enabling the particular node from sleep to awake mode while the remaining nodes of the same path are maintained at sleep mode. Energy efficiency too achieved by eliminating most of the redundant data receptions across nodes. The performance of MMC-TRACE are evaluated with the help of ns-2 simulations and comparisons are made with its predecessor such as MC-TRACE. The results show that the MMC-TRACE provides superior energy efficiency, competitive QoS performance and bandwidth efficiency.

Energy-aware multicast routing in manet based on particle swarm optimization

Mobile ad hoc is an autonomous network whose nodes can move. Multicast is a mechanism in the network that a node sends data to a set of nodes in the network. Finding a multicast tree which satisfies the problem constraints is a NP-Complete problem. This paper proposes a novel multicast routing in mobile Ad Hoc networks based on particle swarm optimization algorithm. The simulation and experimental results show that the proposed algorithm has better speed, performance and efficiency than multicast routing based on genetic algorithm.

Mesh Based Multicast Routing in MANET: Stable Link Based Approach

Mesh Based Multicast Routing in MANET: Stable Link Based Approach

A Novel Fast Multi-objective Evolutionary Algorithm for QoS Multicast Routing in MANET

Multicast routing is regarded as a critical component in networks especially the real-time applications become increasingly popular in recent years. Existing multicast routing under certain QoS Constraints tend to use conventional IP QoS architecture based on GA. In this paper, we propose a novel fast multi-objective evolutionary algorithm called QMOEA for solving multicast routing problem (MRP) in MANET. The steps are that, through the analysis of the strengths and limitations of the well-known multicast architecture, we firstly give an improved Core Based Tree model to simplify the MRP. Based on this model, we then propose the QMOEA which integrates the “Greedy”and “family competition”approaches to speed up the convergence and to maintain the diversity of population. After that, we present the theoretical validations for the proposed method to show its efficiency, and finally, the performance of MANET scaled from 20 to 200 nodes with different types of service is evaluated by OPNET, our experimental res...

MOEAQ: A QoS-Aware Multicast Routing algorithm for MANET

Multicast routing is regarded as a critical component in networks especially the real-time applications become increasingly popular in recent years. This paper proposes a novel fast multi-objective evolutionary algorithm called MOEAQ for solving multicast routing problem (MRP) in MANET. The strengths and limitations of the well-known multicast model are analyzed firstly in this work. Specifically, the “Greedy” and “family competition” approach are integrated into MOEAQ to speed up the convergence and to maintain the diversity of population. The theoretical validations for the proposed method are presented to show its efficiency. After that, a CBT-based improved protocol is then proposed to simplify the MRP, and finally, the performance of MANET scaled from 20 to 200 nodes with different types of service is evaluated by OPNET, experimental results show that the proposed method is capable of achieving faster convergence and more preferable for multicast routing in MANET compared with other GA-based protocol well-known in the literature.

A Novel Fast Multi -objective Evolutionary Algorithm for QoS Multicast Routing in MANET

A Novel Fast Multi -objective Evolutionary Algorithm for QoS Multicast Routing in MANET

Exploring optimised route selection strategy in tree- and mesh-based multicast routing in MANETs

Mobile ad hoc networks are collections of mobile nodes with dynamism forming a momentary network, with no pre-existing network infrastructure or centralised administration. Disaster relief, education and armed forces are widespread situations where mobile nodes need to communicate in areas without any pre-existing infrastructure. Multicast routing protocols outperform the basic broadcast routing by giving out the resources along general links while sending information to a set of multiple destinations. As the network topology is dynamic, optimised routing protocols are needed for communication proficiency. This paper explores the intelligent Genetic Algorithm (GA)-based on-demand multicast routing protocol and GA-based multicast ad hoc on-demand distance vector protocol which improve the control overheads and packet delivery ratio in the routing messages.

Overlay multicasting for small group application in MANETs

Most MANET multicast routing protocols require intermediate nodes to maintain the multicast membership information. Efforts to reduce such an overhead proposed overlay multicast mechanisms, especially for small group. We propose the overlay small group multicast mechanism, called Shortest Path overlay Multicast (SPM) to improve the performance in terms of the distribution delay of packets and the bandwidth needed for the delivery. SPM creates the shortest path overlay tree from the paths toward each receiver which are provided by underlying routing protocols.

Improving the reliability of IEEE 802.11 broadcast scheme for multicasting in mobile ad hoc networks

Broadcasting is one of the essential communication models of MANETs. Many MANET multicast routing protocols rely heavily upon MAC layer's broadcast service for data delivery, multicast architecture construction and maintenance. However, the broadcast mechanism of the IEEE 802.11 standards cannot provide reliable broadcasting support, and therefore, satisfactory performance of the multicast protocols cannot be guaranteed. An extension to IEEE 802.11 broadcast mechanism, called round-robin acknowledge and retransmit, to address this shortcoming is proposed. Different from other mechanisms, we employ a simple and effective acknowledge mechanism, in which the lost frames are reported by neighbouring nodes in a round-robin style to avoid the notorious ack explosion problem. A MAC layer retransmission scheme is then provided for the lost frames. By varying the traffic load and group size, under the on demand multicast routing protocol (ODMRP), extensive simulations show that the proposed scheme provides a highly reliable broadcast service to the routing layer, and ODMRP's performance is improved significantly.

A two-phase multicast routing in MANETs using Steiner connected dominating core sets

Multicast communication is a point to multipoint transmission that occurs when data is to be delivered to a subset of nodes in a computer network. Because multicast communications can save network bandwidth when delivering data to multiple destinations, many researchers have given much attention to multicast routing problems. An ad hoc network is a multihop wireless network with highly dynamic behaviour. Because an ad hoc network's topology changes frequently, multicast routing in such a network is more complicated than in wired networks. In this paper, a two phase multicast routing scheme using Steiner Connected Dominating Core Sets (SCDCS) is proposed to accommodate the dynamic nature of ad hoc networks. The problem of finding the minimum SCDCS is called the Steiner Connected Domination Problem (SCDP). Two heuristic algorithms are proposed to compute the approximate SCDP solution. Some simulations are also made for evaluating the performance of the proposed methods. Two polynomial time exact algorithms to solve the proposed problem on trees with two types of dominating functions are given.