A receiver-initiated soft-state probabilistic multicasting protocol in wireless ad hoc networks

A novel Receiver-Initiated Soft-State Probabilistic multicasting protocol (RISP) for mobile ad hoc network is proposed in this paper. RISP introduces probabilistic forwarding and soft-state for making relay decisions. Multicast members periodically initiate control packets, through which intermediate nodes adjust the forwarding probability. With a probability decay function (soft-state), routes traversed by more control packets are reinforced, while the less utilized paths are gradually relinquished. In this way, RISP can adapt to node mobility: at low mobility, RISP performs similar to a tree-based protocol; at high mobility, it produces a multicast mesh in the network. Simulation results show RISP has lower delivery redundancy than meshbased protocols, while achieving higher delivery ratio. Further, the control overhead is lower than other compared protocols. © 2005 IEEE.published_or_final_versio

A receiver-initiated soft-state probabilistic multicasting protocol in wireless ad hoc networks

A novel Receiver-Initiated Soft-State Probabilistic multicasting protocol (RISP) for mobile ad hoc network is proposed in this paper. RISP introduces probabilistic forwarding and soft-state for making relay decisions. Multicast members periodically initiate control packets, through which intermediate nodes adjust the forwarding probability. With a probability decay function (soft-state), routes traversed by more control packets are reinforced, while the less utilized paths are gradually relinquished. In this way, RISP can adapt to node mobility: at low mobility, RISP performs similar to a tree-based protocol; at high mobility, it produces a multicast mesh in the network. Simulation results show RISP has lower delivery redundancy than meshbased protocols, while achieving higher delivery ratio. Further, the control overhead is lower than other compared protocols. © 2005 IEEE.published_or_final_versio

Mesh based and Hybrid Multicast routing protocols for MANETs: Current State of the art

This paper discusses various multicast routing protocols which are proposed in the recent past each having its own unique characteristic, with a motive of providing a complete understanding of these multicast routing protocols and present the scope of future research in this field. Further, the paper specifically discusses the current development in the development of mesh based and hybrid multicasting routing protocols. The study of this paper addresses the solution of most difficult task in Multicast routing protocols for MANETs under host mobility which causes multi-hop routing which is even more severe with bandwidth limitations. The Multicast routing plays a substantial part in MANETs

Reliable Multicast in Mobile Ad Hoc Wireless Networks

A mobile wireless ad hoc network (MANET) consists of a group of mobile nodes communicating wirelessly with no fixed infrastructure. Each node acts as source or receiver, and all play a role in path discovery and packet routing. MANETs are growing in popularity due to multiple usage models, ease of deployment and recent advances in hardware with which to implement them. MANETs are a natural environment for multicasting, or group communication, where one source transmits data packets through the network to multiple receivers. Proposed applications for MANET group communication ranges from personal network apps, impromptu small scale business meetings and gatherings, to conference, academic or sports complex presentations for large crowds reflect the wide range of conditions such a protocol must handle. Other applications such as covert military operations, search and rescue, disaster recovery and emergency response operations reflect the mission critical nature of many ad hoc applications. Reliable data delivery is important for all categories, but vital for this last one. It is a feature that a MANET group communication protocol must provide. Routing protocols for MANETs are challenged with establishing and maintaining data routes through the network in the face of mobility, bandwidth constraints and power limitations. Multicast communication presents additional challenges to protocols. In this dissertation we study reliability in multicast MANET routing protocols. Several on-demand multicast protocols are discussed and their performance compared. Then a new reliability protocol, R-ODMRP is presented that runs on top of ODMRP, a well documented best effort protocol with high reliability. This protocol is evaluated against ODMRP in a standard network simulator, ns-2. Next, reliable multicast MANET protocols are discussed and compared. We then present a second new protocol, Reyes, also a reliable on-demand multicast communication protocol. Reyes is implemented in the ns-2 simulator and compared against the current standards for reliability, flooding and ODMRP. R-ODMRP is used as a comparison point as well. Performance results are comprehensively described for latency, bandwidth and reliable data delivery. The simulations show Reyes to greatly outperform the other protocols in terms of reliability, while also outperforming R-ODMRP in terms of latency and bandwidth overhead

Development of a Reliable Multicast Protocol in Mobile Ad Hoc Networks

Mobile ad hoc network is a collection of mobile nodes forming dynamic and temporary network. The mobile nodes work in collaborative nature to carry out a given task. It can receive and transmit data packets without the use of any existing network infrastructure or centralized administration. Multicasting is among the pertinent issues of communication in such networks. The reliable delivery of multicast data packets needs feedback from all multicast receivers to indicate whether a retransmission is necessary. The Feedback Implosion Problem (FIP) states that reliable multicast in ad hoc networks suffers from redundant feedback packets, loss, duplication, and out-of-order delivery of data packets. To carry out this task, several reliable multicast protocols have been proposed to reduce the number of feedback packets from the receiver nodes. This is achieved by placing the responsibility to detect packet loss and initiating loss recovery timer on the receiver nodes which is complemented by feedback suppression. The initiating loss recovery timer depends on the number of hops between the nodes. As the dynamic nature of the number of hops between the nodes in ad hoc networks is unstable the loss recovery timer become inaccurate. Thus, the inaccuracy of the loss recovery timer, in return, causes extra overhead and more delays. The main objectives of this research are to enhance the FIP and decrease the recovery delays in reliable multicast protocol for mobile ad hoc networks using suggested approaches. First, the Source Tree Reliable Multicast (STRM) protocol adopting a novel technique to select a subset of one-hop neighbors from the sender node as its Forward Servers (FS). The key idea behind selecting this subset one-hop neighbors is to forward the retransmitted lost data packets and to receive the feedback packets from the receiver nodes. Second, proposed two algorithms to improve the performance of the STRM protocol. The first algorithm is developed to avoid the buffer overflow in the FS nodes. This is achieved by managing the buffer of the FS nodes; by selecting the FS nodes depending on the empty buffer size it has and reducing the amount of feedback sent from the receiver nodes to their FS node. The second algorithm is developed to decrease the number of duplicated packets in the multicast members in the local group. This is achieved by sending the repair packets only to the member that has requested it. The FS in the local group should create a dynamic and temporary sub group whose members are only the members that requested the retransmission of the repair packet. The approaches were tested using detailed discrete-event simulation model which was developed encompassing messaging system that includes error, delay and mobility models to characterize the performance benefits of the proposed algorithms in comparison to ReMHoc protocol. Our approaches achieve up to 2.19% improvement on average packet delivery ratio, 3.3% on requested packets, and 46% on recovery latency time without incurring any additional communication or intense computation

Supporting Protocols for Structuring and Intelligent Information Dissemination in Vehicular Ad Hoc Networks

The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for creating stable cluster structures in VANETs, and to minimize this associated overhead. Further a hybrid overlay-based geocast protocol for VANETs is presented. The protocol utilizes a backbone overlay virtual infrastructure on top of the physical network to provide geocast support, which is crucial for intervehicle communications since many applications provide group-oriented and location-oriented services. The final contribution is a structureless information dissemination scheme which creates a layered view of road conditions with a diminishing resolution as the viewing distance increases. Namely, the scheme first provides a high-detail local view of a given vehicle\u27s neighbors and its immediate neighbors, which is further extended when information dissemination is employed. Each vehicle gets aggregated information for road conditions beyond this extended local view. The scheme allows for the preservation of unique reports within aggregated frames, such that safety critical notifications are kept in high detail, all for the benefit of the driver\u27s improved decision making during emergency scenarios

LVMM: The Localized Vehicular Multicast Middleware - a Framework for Ad Hoc Inter-Vehicles Multicast Communications

This thesis defines a novel semantic for multicast in vehicular ad hoc networks (VANETs) and it defines a middleware, the Localized Vehicular Multicast Middleware (LVMM) that enables minimum cost, source-based multicast communications in VANETs. The middleware provides support to find vehicles suitable to sustain multicast communications, to maintain multicast groups, and to execute a multicast routing protocol, the Vehicular Multicast Routing Protocol (VMRP), that delivers messages of multicast applications to all the recipients utilizing a loop-free, minimum cost path from each source to all the recipients. LVMM does not require a vehicle to know all other members: only knowledge of directly reachable nodes is required to perform the source-based routing

Routing in Large Scale tactical mobile ad hoc Networks

The current Transformation of the military networks adopts the MANET as a main component of the tactical domain. Indeed, a MANET is the right solution to enable highly mobile, highly reactive and quickly deployable tactical networks. Many applications such as the Situational Awareness rely on group communications, underlying the need for a multicast service within the tactical environment where the MANET is employed as a transit network. The purpose of this thesis is to study the setting up of an optimal multicast service within this tactical environment. We firstly focus on defining the protocol architecture to carry out within the tactical network paying particular attention to the MANET. This network is interconnected with different types of networks based on IP technologies and implementing potentially heterogeneous multicast protocols. The tactical MANET is supposed to be made of several hundred of mobile nodes, which implies that the scalability is crucial in the multicast protocol architecture choice. Since the concept of clustering proposes interesting scalability features, we consider that the MANET is a clustered network. Thereby, we define two multicast routing protocols adapted to the MANET: firstly STAMP that is in charge of the multicast communications within each cluster and secondly SAFIR that handles multicast flows between the clusters. These two protocols that can be implemented independently, act in concert to provide an efficient and scalable multicast service for the tactical MANET. Then, we study the interoperability of these multicast protocols employed within the MANET with those employed in the heterogeneous networks that it is interconnected with in order to guarantee end-to-end seamless multicast services to users. Finally, since the multicast protocols proposed in this thesis rely on underlying unicast routing protocols, we propose, in the last chapter, a scalable unicast routing protocol based on OLS