A Novel Scalable Multicast Mesh Routing Protocol for Mobile ad hoc Networks

In recent years the use of portable and wireless equipment is becoming more widespread, and as in many situations communication infrastructure might not be available, wireless networks such as Mobile Ad Hoc Networks (MANETs) are becoming increasingly important. A mobile ad hoc network is a collection of nodes that exchanges data over wireless paths. The nodes in this network are free to move at any time, therefore the network topology changes in an unpredictable way. Since there is no fixed infrastructure support in mobile ad hoc networks, each node functions as a host and a router. Due to mobility, continuous change in topology, limited bandwidth, and reliance on batteries; designing a reliable and scalable routing protocol for mobile ad hoc networks is a challenging task. Multicast routing protocols have been developed for routing packets in mobile ad hoc networks. Existing protocols suffer from overheads and scalability. As the number of senders, groups, and mobility speed increases, the routing overhead and the packet collision increases, and therefore the packet delivery ratio decreases. Thus none of the existing proposed multicast routing protocols perform well in every situation. In this study a novel multicast routing protocol for ad hoc networks is proposed. It is an efficient and scalable routing protocol, and named Network Sender Multicast Routing Protocol (NSMRP). NSMRP is a reactive mesh based multicast routing protocol. A central node called mesh sender (MS) is selected periodically from among the group(s) sender(s) to create one mesh in order to be used in forwarding control and data packets to all multicast group(s) member(s). One invitation message will be periodically flooded to all group(s) member(s) by MS to join the group(s). The proposed routing protocol is evaluated by simulation and compared with a well known routing protocol. The results are analyzed and conclusions are drawn

A novel scalable multicast mesh routing protocol for mobile ad hoc networks

In recent years the use of portable and wireless equipment is becoming more widespread, and as in many situations communication infrastructure might not be available, wireless networks such as Mobile Ad Hoc Networks (MANETs) are becoming increasingly important. A mobile ad hoc network is a collection of nodes that exchanges data over wireless paths. The nodes in this network are free to move at any time, therefore the network topology changes in an unpredictable way. Since there is no fixed infrastructure support in mobile ad hoc networks, each node functions as a host and a router. Due to mobility, continuous change in topology, limited bandwidth, and reliance on batteries; designing a reliable and scalable routing protocol for mobile ad hoc networks is a challenging task. Multicast routing protocols have been developed for routing packets in mobile ad hoc networks. Existing protocols suffer from overheads and scalability. As the number of senders, groups, and mobility speed increases, the routing overhead and the packet collision increases, and therefore the packet delivery ratio decreases. Thus none of the existing proposed multicast routing protocols perform well in every situation. In this study a novel multicast routing protocol for ad hoc networks is proposed. It is an efficient and scalable routing protocol, and named Network Sender Multicast Routing Protocol (NSMRP). NSMRP is a reactive mesh based multicast routing protocol. A central node called mesh sender (MS) is selected periodically from among the group(s) sender(s) to create one mesh in order to be used in forwarding control and data packets to all multicast group(s) member(s). One invitation message will be periodically flooded to all group(s) member(s) by MS to join the group(s). The proposed routing protocol is evaluated by simulation and compared with a well known routing protocol. The results are analyzed and conclusions are drawn.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Multicast-Based Mobile Ipv6 Join/Leave Mechanism Software

Increasing demand for mobility in the Internet has created the need for a routing protocol that allows a host to roam in the network. Mobile IP is a solution that enables an IP host to leave its home link while transparently maintaining all of its present connections and remaining reachable to the rest of the Internet. The Internet Engineering Task Force (IETF) has standardized Mobile IPv4. Mobile IPv6 is a work in progress in the IETF, offering support for IPv6 mobile nodes. Although it is not yet standardized, every IPv6 node is required to implement Mobile IPv6, which means that mobility must be widely supported. IP-multicast provides efficient algorithms for multiple packet delivery. It also provides location-independent group addressing. The receiver-initiated approach for IP-multicast enables new receivers to join to a nearby branch of an already established multicast tree. Hence, IP-multicast provides a scalable infrastructure for efficient, location-independent, packet delivery.The recent advances in wireless communication technology and the growth of the Internet have paved the way for wireless networking and IP mobility. Unlike conventional wired networks, wireless networks possess different channel characteristics and mobility dynamics that render network design and analysis more cha1lenging. Performance during handoff where the mobile moves from one cell, or coverage area, to another is a significant factor in evaluating wireless networks

Security and Privacy Issues in Wireless Mesh Networks: A Survey

This book chapter identifies various security threats in wireless mesh network (WMN). Keeping in mind the critical requirement of security and user privacy in WMNs, this chapter provides a comprehensive overview of various possible attacks on different layers of the communication protocol stack for WMNs and their corresponding defense mechanisms. First, it identifies the security vulnerabilities in the physical, link, network, transport, application layers. Furthermore, various possible attacks on the key management protocols, user authentication and access control protocols, and user privacy preservation protocols are presented. After enumerating various possible attacks, the chapter provides a detailed discussion on various existing security mechanisms and protocols to defend against and wherever possible prevent the possible attacks. Comparative analyses are also presented on the security schemes with regards to the cryptographic schemes used, key management strategies deployed, use of any trusted third party, computation and communication overhead involved etc. The chapter then presents a brief discussion on various trust management approaches for WMNs since trust and reputation-based schemes are increasingly becoming popular for enforcing security in wireless networks. A number of open problems in security and privacy issues for WMNs are subsequently discussed before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the author's previous submission in arXiv submission: arXiv:1102.1226. There are some text overlaps with the previous submissio

Performance Evaluation of Multicast Trees in Adhoc Networks

An adhoc wireless network is a network composed of mobile hosts with no fixed infrastructure and no central administration. The main constraints in these networks are bandwidth limitation and unpredictable hosts mobility. In this context, one challenge is to propose multi-hop routes for multicast routing protocols. In this paper, we present a set of criteria adapted to the evaluation of multicast diffusion structures in adhoc networks. We also use these criteria to evaluate different tree construction algorithms and propose several comments for the design of an efficient multicast routing protocol

Multicast Routing in Mobile Adhoc Networks using Source Grouped Flooding

Ad hoc networks are peer to peer, autonomous networks comprised of wireless mobile devices. The ease and speed of deployment of these networks makes them ideal for battlefield communications, disaster recovery and other such applications where fixed infrastructure is not readily available. Limited bandwidth, energy constraints and unpredictable network topologies pose difficult problems for the design of applications for these networks. The last couple of years has seen renewed research in this field. Specifically in unicast and multicast routing and security issues.In this thesis, we address the multicast routing problem for ad hoc networks. We present a novel multicast routing protocol called the source grouped flooding protocol. The protocol creates multicast routes between the source and group members based on hop count distance constraints. We also propose a probabilistic data forwarding mechanism to achieve efficient data dissemination. We present simulation results that capture the performance of our protocol against parameters that characterize an ad hoc network. We find that the protocol is robust against topology changes and achieves efficient data distribution