Classifications of multicast routing In mobile ad hoc networks

Multicasting is a useful communication scheme that facilitates group communication. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages. Multicast is a relatively unexplored research area, when it is compared with Unicast [I]. Over the past few years, several multicast routing protocols have been proposed for Ad-Hoc networks. In this chapter, we first provide a classification approach of the multicasting techniques in mobile Ad-Hoc networks, followed by the description of theexisting approaches that support QoS in mobile Ad-Hoc networks using multicasting scheme. We concentrate on hierarchical multicast routing protocols and position-based protocols, because of its relationship to our research. We will highlight their advantages and outline their limitation

A Survey of QoS Routing Protocols for Ad Hoc Networks

The aim of this paper is to give a big survey in enhancing the balance of the routing load and the consumption of resources using network layer metrics for the path discovery in the MAODV protocol. A ad hoc network (AD HOC NETWORKS) consists of a collection of wireless mobile nodes, which form a temporary network without relying on any existing infrastructure or centralized administration. The bandwidth of the ad hoc networks architecture is limited and shared between the participating nodes in the network, therefore an efficient utilization of the network bandwidth is very important. Multicasting technology can minimize the consumption of the link bandwidth and reduce the communication cost too. As multimedia and group-oriented computing gains more popularity for users of ad hoc networks, the effective Quality of Service (QoS) of the multicasting protocol plays a significant role in ad hoc networks. In this paper we propose a reconstruction of the MAODV protocol by extending some featuring QoS in MAODV. All simulations are prepared with the NS2 simulator and compare the performance of this algorithm with the MAODV algorithm. The achieved results illustrate faster path discovery and more performing routing balance in the use of MAODV-Extension.This paper would give relatively a modest support in Mobile Technology according to QoS communication

1 A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols

Abstract—In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge of producing multihop routes under host mobility and bandwidth constraints. In recent years, a number of new multicast protocols of different styles have been proposed for ad hoc networks. However, systematic performance evaluations and comparative analysis of these protocols in a common realistic environment has not yet been performed. In this study, we simulate a set of representative wireless ad hoc multicast protocols and evaluate them in various network scenarios. The relative strengths, weaknesses, and applicability of each multicast protocol to diverse situations are studied and discussed. I

Geocasting and Multicasting Routing Operation in Mobile Ad Hoc Network

Abstract: The paper considers, the different multicasting routing protocols in wireless mobile Ad hoc network (MANET).An Ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure .In this environment routing/multicasting protocols are faced with the challenge of producing multihop router under host mobility and band constraints. Various approaches and routing protocol have been proposed to address Ad hoc networking problems and multiple standardization effort within the Internet Engineering Task Force, along with academic and industrial research projects. In recent year, a number of new multicast protocols of different styles have been proposed for Ad hoc networks. Geocast Adaptive Mesh Environment for Routing [GAMER] is one which provides geocast communication in an Ad hoc network and it adapts to the correct network environment by dynamically changing the density of the mesh. Forwarding Group Multicast Protocol [FGMP] is based on the forward group concept and it dynamically refreshes the forward group member using a procedure to On-Demand routing. The relative strengths, weakness and applicability of each multicast protocol to diverse situations have considered and analyzed. Index Terms: FGMP Protocol, GAMER Protocol, MANETs, multicast, routing. An Ad hoc networks [1] [2] , is a dynamically reconfigurable wireless network with no fixed infrastructure (or) central administration. Due to the limited radio propagation range of wireless devices, routers are often "multihop". Applications such as disaster recovery, crowd control, search, rescue and automated battlefields are typical examples of where Ad hoc networks are deployed. Nodes in these networks more arbitrary thus network topology changes frequently and unpredictably. Moreover, bandwidth and battery power are limited. These constraints, in combination with the dynamic network topology make routing and multicasting in Ad hoc networks extremely challenging. Various multicast protocols have been newly proposed to perform multicasting in Ad hoc network. However, no operation study between them has yet been performed. The comparative analysis of Ad hoc unicast routing protocols has been reported. This paper gives a comparison study of two protocols with different characteristics: GAMER [3] and FGMP The rest of the paper is organized as follows. Section I presents an overview of the multicast protocols. The section II discusses the future enhancements, and concluding remarks are made in section III.

Multicast outing protocols and architectures in mobile ad-hoc wireless networks

The basic philosophy of personal communication services is to provide user-to-user, location independent communication services. The emerging group communication wireless applications, such as multipoint data dissemination and multiparty conferencing tools have made the design and development of efficient multicast techniques in mobile ad-hoc networking environments a necessity and not just a desire. Multicast protocols in mobile adhoc networks have been an area of active research for the past few years. In this dissertation, protocols and architectures for supporting multicast services are proposed, analyzed and evaluated in mobile ad-hoc wireless networks. In the first chapter, the activities and recent advances are summarized in this work-in-progress area by identifying the main issues and challenges that multicast protocols are facing in mobile ad-hoc networking environments and by surveying several existing multicasting protocols. a classification of the current multicast protocols is presented, the functionality of the individual existing protocols is discussed, and a qualitative comparison of their characteristics is provided according to several distinct features and performance parameters. In the second chapter, a novel mobility-based clustering strategy that facilitates the support of multicast routing and mobility management is presented in mobile ad-hoc networks. In the proposed structure, mobile nodes are organized into nonoverlapping clusters which have adaptive variable-sizes according to their respective mobility. The mobility-based clustering (MBC) approach which is proposed uses combination of both physical and logical partitions of the network (i.e. geographic proximity and functional relation between nodes, such as mobility pattern etc.). In the third chapter, an entropy-based modeling framework for supporting and evaluating the stability is proposed in mobile ad-hoc wireless networks. The basic motivations of the proposed modeling approach stem from the commonality observed in the location uncertainty in mobile ad-hoc wireless networks and the concept of entropy. In the fourth chapter, a Mobility-based Hybrid Multicast Routing (MHMR) protocol suitable for mobile ad-hoc networks is proposed. The MHMR uses the MBC algorithm as the underlying structure. The main features that the proposed protocol introduces are the following: a) mobility based clustering and group based hierarchical structure, in order to effectively support the stability and scalability, b) group based (limited) mesh structure and forwarding tree concepts, in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide the low route acquisition delay of proactive techniques and the low overhead of reactive methods. In the fifth chapter, an architecture for supporting geomulticast services with high message delivery accuracy is presented in mobile ad-hoc wireless networks. Geomulticast is a specialized location-dependent multicasting technique, where messages are multicast to some specific user groups within a specific zone. An analytical framework which is used to evaluate the various geomulticast architectures and protocols is also developed and presented. The last chapter concludes the dissertation

Review of multicast QoS routing protocols for mobile ad hoc networks

A Mobile Ad hoc NETwork (MANET) is consisting of a collection of wireless mobile nodes, which form a temporary network without relying on any existing infrastructure or centralized administration. Since the bandwidth of MANETs is limited and shared between the participating nodes in the network, it is important to efficiently utilize the network bandwidth. Multicasting can minimize the link bandwidth consumption and reduce the communication cost by sending the same data to multiple participants. Multicast service is critical for applications that need collaboration of team of users. Multicasting in MANETs becomes a hot research area due to the increasing popularity of group communication applications such as video conferencing and interactive television. Recently, multimedia and group-oriented computing gains more popularity for users of ad hoc networks. So, effective Quality of Service (QoS) multicasting protocol plays significant role in MANETs. In this paper, we are presenting an overview of set of the most recent QoS multicast routing protocols that have been proposed in order to provide the researchers with a clear view of what has been done in this field

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

A novel approach for the fast detection of black holes in mobile ad hoc networks

Mobile ad hoc networks are infrastructure-less wireless networks that rely on node cooperation to properly work. In this kind of networks, attack detection and reaction is a key issue to the whole network. The most common threat in mobile ad hoc network scenarios consists in the presence of a certain percentage of selfish nodes, which try to reduce the consumption of their own resources to prolong their battery lifetime. Those nodes do not collaborate on forwarding activities, therefore affecting the overall network performance. Watchdogs are well-known mechanisms to detect threats and attacks from misbehaved and selfish nodes in computer networks. The problem behind the use of watchdogs is that while they can be quite effective in detecting selfishness by using their traffic overhearing behaviour, they can also cause a relatively high level of false negatives, thereby reducing their accuracy. This article proposes a collaborative approach for detecting selfish nodes in mobile ad hoc networks. It is based on using a set of collaborative watchdogs, which collaborate to enhance their individual and collective performance. By using both an analytical study and simulation, we demonstrate that our approach is able to improve accuracy and detection speed, while reducing the impact of false-negative eventsThis work was partially supported by the Ministerio de Ciencia e Innovacion, Spain, under grant TIN2011-27543-C03-01.Serrat Olmos, MD.; Hernández Orallo, E.; Cano Escribá, JC.; Tavares De Araujo Cesariny Calafate, CM.; Manzoni, P. (2013). A novel approach for the fast detection of black holes in mobile ad hoc networks. Concurrent Engineering: Research and Applications. 21(3):177-185. https://doi.org/10.1177/1063293X13493448S177185213Buchegger, S., & Le Boudec, J.-Y. (2005). Self-policing mobile ad hoc networks by reputation systems. IEEE Communications Magazine, 43(7), 101-107. doi:10.1109/mcom.2005.1470831Buttyán, L., & Hubaux, J.-P. (2003). Mobile Networks and Applications, 8(5), 579-592. doi:10.1023/a:1025146013151Groenevelt, R., Nain, P., & Koole, G. (2005). The message delay in mobile ad hoc networks. Performance Evaluation, 62(1-4), 210-228. doi:10.1016/j.peva.2005.07.018Hortelano, J., Calafate, C. T., Cano, J. C., de Leoni, M., Manzoni, P., & Mecella, M. (2010). Black-Hole Attacks in P2P Mobile Networks Discovered through Bayesian Filters. Lecture Notes in Computer Science, 543-552. doi:10.1007/978-3-642-16961-8_77Li, Y., Su, G., Wu, D. O., Jin, D., Su, L., & Zeng, L. (2011). The Impact of Node Selfishness on Multicasting in Delay Tolerant Networks. IEEE Transactions on Vehicular Technology, 60(5), 2224-2238. doi:10.1109/tvt.2011.2149552Marti, S., Giuli, T. J., Lai, K., & Baker, M. (2000). Mitigating routing misbehavior in mobile ad hoc networks. Proceedings of the 6th annual international conference on Mobile computing and networking - MobiCom ’00. doi:10.1145/345910.345955T.V.P, S., & A, S. (2010). Modeling the Behavior of Selfish Forwarding Nodes to Stimulate Cooperation in MANET. International journal of Network Security & Its Applications, 2(2), 147-160. doi:10.5121/ijnsa.2010.2212Xu, L., Lin, Z., & Ye, A. (2006). Analysis and Countermeasure of Selfish Node Problem in Mobile Ad Hoc Network. 2006 10th International Conference on Computer Supported Cooperative Work in Design. doi:10.1109/cscwd.2006.253072Zhong, S., Chen, J., & Yang, Y. R. (s. f.). Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks. IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428). doi:10.1109/infcom.2003.1209220Zhu, H., Fu, L., Xue, G., Zhu, Y., Li, M., & Ni, L. M. (2010). Recognizing Exponential Inter-Contact Time in VANETs. 2010 Proceedings IEEE INFOCOM. doi:10.1109/infcom.2010.546226

Network coding with periodic recomputation for minimum energy multicasting in mobile ad-hoc networks

We consider the problem of minimum-energy multicast using network coding in mobile ad hoc networks (MANETs). The optimal solution can be obtained by solving a linear program every time slot, but it leads to high computational complexity. In this paper, we consider a low-complexity approach, network coding with periodic recomputation, which recomputes an approximate solution at fixed time intervals, and uses this solution during each time interval. As the network topology changes slowly, we derive a theoretical bound on the performance gap between our suboptimal solution and the optimal solution. For complexity analysis, we assume that interior-point method is used to solve a linear program at the first time slot of each interval. Moreover, we can use the suboptimal solution in the preceding interval as a good initial solution of the linear program at each fixed interval. Based on this interior-point method with a warm start strategy, we obtain a bound on complexity. Finally, we consider an example network scenario and minimize the complexity subject to the condition that our solution achieves a given optimality gap