Secure multicast routing protocols in mobile ad‐hoc networks

A mobile ad‐hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi‐hop radio network. Routing protocols in MANETs define how routes between source and destination nodes are established and maintained. Multicast routing provides a bandwidth‐efficient means for supporting group‐oriented applications. The increasing demand for such applications coupled with the inherent characteristics of MANETs (e.g., lack of infrastructure and node mobility) have made secure multicast routing a crucial yet challenging issue. Recently, several multicast routing protocols (MRP) have been proposed in MANETs. Depending on whether security is built‐in or added, MRP can be classified into two types: secure and security‐enhanced routing protocols, respectively. This paper presents a survey on secure and security‐enhanced MRP along with their security techniques and the types of attacks they can confront. A detailed comparison for the capability of the various routing protocols against some known attacks is also presented and analyzed. Copyright © 2013 John Wiley & Sons, Ltd.     

一种改进的层次型移动组播协议

论文介绍了现有层次性移动组播协议——Mobi Cast协议,分析了该协议的优缺点。在Mobi Cast协议的基础上通过加入隧道技术,并减轻基站开销等方面进行了改进。仿真与分析表明,改进后的Mobi Cast协议具有组播数据丢包率低、网络维护开销小、切换延迟短等特点。     

基于多播的移动IP位置管理的研究

提出了一种通过多播中组管理功能完成移动IP位置管理方法。每一个自治网络中都设置一个移动路由代理（MA），形成一个管理移动节点位置绑定信息的虚拟专用网，通过将与移动主机通信的节点联合起来构成一棵多播树，使网络中各节点相互合作维护移动节点的位置更新。设计了绑定信息表的存储结构和管理移动位置绑定信息的算法。模拟实验表明，提出的基于多播的位置管理方案能够使通信对端实时了解移动节点的转交地址，减少向家乡代理注册的时间和次数，减小了传输延迟，为实时业务传输提供较好的支持。同时减轻了家乡代理和各主机的负担，使移动IP的性能得到优化。     

A load‐balancing and coding‐aware multicast protocol for mobile ad hoc networks

In this paper, we propose a Load‐Balancing and Coding‐Aware Multicast (LCM) protocol for mobile ad hoc networks. In LCM protocol, a new route metric named Expected Transmission Time with Coding and Load Balancing (ETTCL) is presented at first, aiming at effectively selecting the path not only that has the possible coding opportunity but also where overflow due to network overload can be prevented. Then, we describe the route discovery phase by constructing the node‐disjoint multicast tree on the basis of ETTCL and employ network coding to encode the data flows for route maintenance. The effectiveness of LCM protocol is simulated and analyzed by NS‐2, which shows that this protocol has good performance in reducing average end‐to‐end delay and control overhead and can improve packet delivery ratio compared with the existing protocol. Copyright © 2015 John Wiley & Sons, Ltd.     

移动通信中的组播路由策略

终端移动或加入、退出组播组时，路由生成树应随之动态变化。对比多种组播路由策略后，在IntServ模型中融入CSM协议，希望在不增加网络负荷的前提下降低终端越区切换带来数据报的收发中断时间。     

An efficient mesh‐based multicast routing protocol in mobile ad hoc networks

Mesh‐based multicast routing protocols for mobile ad hoc networks (MANETs) build multiple paths from senders to receivers to deliver packets even in the presence of links breaking. This redundancy results in high reliability/robustness but may significantly increase packet overhead. This paper proposes a mesh‐based multicast protocol, called centered protocol for unified multicasting through announcements (CPUMA), that achieves comparable reliability as existing mesh‐based multicast protocols, however, with significantly much less data overhead. In CPUMA, a distributed core‐selection and maintenance algorithm is used to find the source‐centric center of a shared mesh. We leverage data packets to center the core of each multicast group shared mesh instead of using GPS or any pre‐assignment of cores to groups (the case of existing protocols). The proposed centering scheme allows reducing data packet overhead and creating forwarding paths toward the nearest mesh member instead of the core to reduce latency. We show, via simulations, that CPUMA outperforms existing multicast protocols in terms of data packet overhead, and latency while maintaining a constant or better packet delivery ratio, at the cost of a small increase in control overhead in a few scenarios. Copyright © 2010 John Wiley & Sons, Ltd.     

Reliable and efficient multicast protocol for mobile IP networks

To provide a multicasting service, several multicast protocols for mobile hosts (MHs) have been proposed. However, all of these protocols have faults, such as non‐optimal delivery routes and data loss when hosts move to another network, resulting in insecure multicast data transmissions. Thus, this paper presents a new reliable and efficient multicast routing protocol for mobile IP networks. The proposed protocol provides a reliable multicast transmission by compensating the data loss from the previous mobile agent when a MH moves to another network. In addition, an additional function allows for direct connection to the multicast tree according to the status of agents, thereby providing a more efficient and optimal multicast path. The performance of the proposed protocol is confirmed based on simulations under various conditions. Copyright © 2008 John Wiley & Sons, Ltd.     

一种时延受限的低代价移动IP组播路由算法

基于固定和移动IP混合网络，针对时延敏感的实时通信业务，建立了网络模型，提出了有时延约束的低代价组播路由问题，给出了一种分布启发式组播路由算法，证明了算法的正确性，分析了算法的复杂度。仿真结果表明，算法是有效的、稳定的。     

移动IP网络中的组播技术研究

主要讨论了基于移动IP网下的组播技术。在给出了基本的两种移动组播机制：即远程签署RS和双向隧道BT的基础上，重点分析了RBMoM协议，即基于范围的移动组播协议，同时比较了三者的优缺点。最后给出RBMoM协议的实现流程图。     

时延受限低代价的一种组播路由动态算法

提出了一种适合目的节点动态加入的、时延受限低代价多播路由的启发式算法DLHMA算法。该算法基于MPH算法的基本思想进行扩展,在满足时延限制条件和多播树代价增加最小的基础上,逐步将目的节点添加到多播树上。最后,证明了算法的正确性,分析了算法的动态性,并进行了仿真实验。结果表明,该算法可以实现新加目的节点的动态加入,并保证所获得多播树的低代价。     

Ad hoc mobile multicast routing using the concept of long‐lived routes

Mobile ad hoc networks are recognized by their abilities to form, sustain, and deform networks on‐the‐fly without the need for any pre‐established and fixed infrastructures. This wireless multi‐hop technology requires adaptive networking protocols with low control overhead and low power consumption to operate efficiently. Existing research so far are mainly concerned with unicast routing for ad hoc mobile networks. There is a growing interest in supporting multicast communication in an ad hoc mobile environment. In this paper, the associativity‐based ad hoc multicast (ABAM) routing protocol is proposed. The concept of association stability is utilized during multicast tree discovery, selection, and reconfiguration. This allows routes that are long‐lived to be selected, thereby reducing the frequency of route reconstructions. ABAM employs a localized route reconstruction strategy in response to migrations by source, receiver, and tree nodes. It can repair an affected subtree via a single route reconstruction operation. ABAM is robust since the repair can be triggered by a node in the tree or by the migrated node itself. ABAM is also capable of handling multicast group dynamics when mobile hosts decide to join and leave an existing multicast group. Our simulation results reveal that under different mobility scenarios and multicast group size, ABAM has low communication overhead and yields better throughput performance. Copyright © 2001 John Wiley & Sons, Ltd.     

A study of forward error correction for mobile multicast

3rd Generation Partnership Project (3GPP) has standardized the use of forward error correction (FEC) for the provision of reliable data transmission in the mobile multicast framework. This error control method inevitably adds a constant overhead in the transmitted data. However, it is so simple as to meet a prime objective for mobile multicast services; that is scalability to applications with thousands of receivers. In this paper, we present a study on the impact of application layer FEC on mobile multicast transmissions. We examine whether it is beneficial or not, how the optimal code dimension varies based on network conditions, which parameters affect the optimal code selection, and how this can be done. Additionally, we focus on one of the most critical aspects in mobile multicast transmission, which is power control. The evaluation is performed with the aid of a novel scheme that incorporates the properties of an evolved mobile network, as they are specified by the 3GPP. Copyright © 2010 John Wiley & Sons, Ltd.     

利用组播树优化VPLS组播功能的研究

RFCs 4761和4762描述了一种基于利用点对点或点对多点单播LSP承载组播流量的VPLS解决方案.对于某些VPLS组播流量配置,这种解决方案有一定局限性.例如,当有大量的组播流量需要传播时,会导致带宽利用严重非最佳化.本文描述的解决方案是为了克服现有VPLS组播解决方案中的一部分局限性.其中描述了在SP网络中利用组播树来实现VPLS组播的过程.该解决方案允许在多个VPLS实例间共享一个这样一棵组播树.此外,本文提出的解决方案还允许SP网络中的一棵单独的组播树承载来自一个或多个VPLS实例的,仅仅属于指定的一个或多个IP组播流集合的流量.     

Scalable location guide overlay multicast in mobile ad hoc networks using tree partition scheme

Nodes mobility brings flinty challenges to multicast in Mobile ad hoc Networks (MANETs). To track nodes mobility, flooding messages are widely used for data delivery structure construction and maintenance in many multicast protocols. These periodic flooding messages significantly consume network resources, such as energy and bandwidth, and result in network collisions. To release data delivery structure maintenance onus, profited from GPS location service, a number of stateless location based multicast protocol were proposed, where a destination list is encapsulated into each data packet for data packet orientation. However, due to data packet capability limitation, the way of encapsulating a destination list in each data packet header restricts the protocol scalability. To solve the scalability issue of multicast protocols, we propose a Scalable Location Guide Overlay Multicast (SLGOM) for MANETs. Analysis and simulation results show that SLGOM achieves high performance in large multicast group and significantly improves the scalability of stateless multicast with respect to group size. Copyright © 2010 John Wiley & Sons, Ltd.     

Performance evaluation for single‐ and semi‐layer multistage interconnection networks servicing multicast traffic by full multicast operation

Here a novel analytical method for performance prediction estimation of single‐ and multi‐layer multistage interconnection networks (MINs) under multicast environments is presented. The ‘Cell Replication While Routing’ is used as a packet routing technique and the ‘full multicast’ mode as transmission policy is employed in all the MINs under study. This model is developed for single‐layer MINs and is extended and applied to special types of multi‐layer MINs, called semi‐layer MINs, which support mixed traffic patterns such as unicast and multicast in uniform traffic conditions. The results confirm the significant performance saturation of single‐layer MINs and the improvement of corresponding performance indicators by semi‐layer MINs. The proposed analytical framework is anticipated to be a very useful tool in evaluating the performance of semi‐layer MINs in designing more efficient QoS networks. Copyright © 2010 John Wiley & Sons, Ltd.     

光组播路由代价与波长使用量的联合优化方法

为解决光组播路由中组播中路由代价和波长资源消耗单一化造成的组播路树路由的代价过高问题,在分光节点约束条件下,提出了光组播路由代价与波长使用量联合优化的长路优先(LPF)方法和短路优先(SPF)方法。算法通过检查最小光组播树是否存在节点分光约束的问题,根据设置的波长使用代价控制因子,使LPF或SPF的路由代价和波长使用量最小。LPF方法首先选择组播树最长路径或新波长通道重路由受分光约束的目的节点,SPF方法先选择组播树中最短路径或新波长通道重路由受分光约束的目的节点,仿真结果表明,本文提出的两种联合优化方法都能实现路由代价较低和波长需求较少的目的。     

A cross‐layer optimization for maximum‐revenue‐based multicast in multichannel multiradio wireless mesh networks

Given a video/audio streaming system installed on a multichannel multiradio wireless mesh network, we are interested in a problem concerning about how to construct a delay‐constrained multicast tree to support concurrent interference‐free transmissions so that the number of serviced mesh clients is maximized. In this paper, we propose a heuristic approach called cross‐layer and load‐oriented (CLLO) algorithm for the problem. On the basis of the cross‐layer design paradigm, our CLLO algorithm can consider application demands, multicast routing, and channel assignment jointly during the formation of a channel‐allocated multicast tree. The experimental results show that the proposed CLLO outperforms the layered approaches in terms of the number of serviced mesh clients and throughputs. This superiority is due to information from higher layers can be used to guide routing selection and channel allocation at the same time. As a result, the CLLO algorithm can explore more solution spaces than the traditional layered approaches. In addition to that, we also propose a channel adjusting procedure to enhance the quality of channel‐allocated multicast trees. According to our simulations, it is proved to be an effective method for improving the performance of the proposed CLLO algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

基于EPON的可控组播技术

以太无源光网络( EPON)作为光纤到户的理想解决方案之一,凭借其带宽优势非常适合承载组播业务.EPON可控组播技术结合EPON的特点,从安全性和可维护性考虑,提出了一套可控组播实现方案,包括组播源管理、用户认证和组播流量控制等内容,以满足组播业务可维、可控的运营管理需要.     

Analysis of tree‐based multicast routing in wireless sensor networks with varying network metrics

Wireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. Routing protocols act as an interface between the lower and higher layers of the network protocol stack. Depending on the size of target nodes, routing techniques are classified into unicast, multicast and broadcast protocols. In this article, we give analysis and performance evaluation of tree‐based multicast routing in wireless sensor networks with varying network metrics. Geographic multicast routing (GMR) and its variations are used extensively in sensor networks. Multicast routing protocols considered in the analytical model are GMR, distributed GMR, demand scalable GMR, hierarchical GMR, destination clustering GMR and sink‐initiated GMR. Simulations are given with comparative analysis based on varying network metrics such as multicast group size, number of sink nodes, average multicast latency, number of clusters, packet delivery ratio, energy cost ratio and link failure rate. Analytical results indicate that wireless sensor network multicast routing protocols operate on the node structure (such as hierarchical, clustered, distributed, dense and sparse networks) and application specific parameters. Simulations indicate that hierarchical GMR is used for generic multicast applications and that destination clustering GMR and demand scalable GMR are used for distributed multicast applications. Copyright © 2012 John Wiley & Sons, Ltd.     

Non‐cooperative game‐based packet ferry forwarding for sparse mobile wireless networks

In sparse mobile wireless networks, normally, the mobile nodes are carried by people, and the moving activity of nodes always happens in a specific area, which corresponds to some specific community. Between the isolated communities, there is no stable communication link. Therefore, it is difficult to ensure the effective packet transmission among communities, which leads to the higher packet delivery delay and lower successful delivery ratio. Recently, an additional ferry node was introduced to forward packets between the isolated communities. However, most of the existing algorithms are working on how to control the trajectory of only one ferry work in the network. In this paper, we consider multiple ferries working in the network scenario and put our main focus on the optimal packet selection strategy, under the condition of mutual influence between the ferries and the buffer limitation. We introduce a non‐cooperative Bayesian game to achieve the optimal packet selection strategy. By maximizing the individual income of a ferry, we optimize the network performance on packet delivery delay and successful delivery ratio. Simulation results show that our proposed packet selection strategy improves the network performance on packet delivery delay and successful delivery ratio. Copyright © 2013 John Wiley & Sons, Ltd.