Dynamic Multicast Grouping Approach in HLA-Based Distributed Interactive Simulation

In order to improve the efficiency of data distributed management service in distributed interactive simulation based on high level architecture (HLA) and to reduce the network traffic and save the system resource, the approaches of multicast grouping in HLA-based distributed interactive simulation are discussed. Then a new dynamic multicast grouping approach is proposed. This approach is based on the current publication and subscription region in the process of simulation. The results of simulation experiment show that this approach can significantly reduce the message overhead and use fewer multicast groups.

A Dynamic Active Multicast Group Access Control Framework Based on Trust Management System

The current multicast model provides no access control mechanism. Any host can send data directly to a multicast address or join a multicast group to become a member, which brings safety problems to multicast. In this paper, we present a new active multicast group access control mechanism that is founded on trust management. This structure can solve the problem that exists in multicast members＇ access control and distributing authorization of traditional IP multicast.

Algorithm for Delay-Constrained Minimal Cost Group Multicasting

Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link. And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member′s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature.Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.

5G车联网中安全高效的组播服务认证与密钥协商方案

5G车联网(5G-V2X)中,内容提供者通过以点对多的传输方式向属于特定区域的一组车辆提供服务消息。针对于车辆获取组播服务遭受的安全威胁与隐私泄露问题,该文提出一种认证和密钥协商方案用于内容提供者与车辆之间的组播服务消息传输。首先,采用无证书聚合签名技术批量验证群组内所有车辆,提高了认证请求的效率。其次,基于多项式密钥管理技术实现安全的密钥协商,使得非法用户或核心网络无法获取共享会话密钥。最后,实现了群组内车辆的动态密钥更新机制,当车辆加入或离开群组时,内容提供者只需要发送1条密钥更新消息即可更新会话密钥。基于形式化验证工具和进一步安全性分析表明,所提方案可以保证匿名性、不可链接性、前向和后向安全性以及抗共谋攻击等安全需求。与现有方案相比,计算效率提高了约34.2%。

Identity Based Group Key Agreement in Multiple PKG Environment

Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative applications. In this paper, we propose the first identity-based authenticated group key agreement in multiple private key generators （PKG） environment. It is inspired on a new two-party identity-based key agreement protocol first proposed by Hoonjung Lee et al. In our scheme, although each member comes from different domain and belongs to different PKGs which do not share the common system parameters, they can agree on a shared secret group key. We show that our scheme satisfies every security requirements of the group key agreement protocols.

Reformative multicast routing protocol based on Ad Hoc

Mobile Ad Hoc networks has been widely applied to military field, emergency management, public service and so on. Because it is uncertain on network and communication, a great deal of energy will be consumed with nodes increasing and creating routing each other. The reformative on-demand multicast routing protocol was putted forward by researching the energy consuming of multicast routing protocol in Ad Hoc. It will decrease consumption in a big multicast flooding through studying the relaying group net structure based on map or wormhole. The energy consumption is reduced 30% by creating the two kinds of routing principles: minimization of energy consumption and minimization of maximum nodes energy consumption. The simulation result indicates that the reformative RODMRP is effective to reduce the energy consuming while routing protocol built.

Privacy Preservation Scheme for Multicast Communications in Smart Buildings of the Smart Grid

Privacy preservation is a crucial issue for smart buildings where all kinds of messages, e.g., power usage data, control commands, events, alarms, etc. are transmitted to accomplish the management of power. Without appropriate privacy protection schemes, electricity customers are faced with various privacy risks. Meanwhile, the natures of smart grids and smart buildings—such as having limited computation power of smart devices and constraints in communication network capabilities, while requiring being highly reliable—make privacy preservation a challenging task. In this paper, we propose a group key scheme to safeguard multicast privacy with the provisions of availability, fault-tolerance, and efficiency in the context of smart buildings as a part the smart grid. In particular, hybrid architecture accommodating both centralized and contributory modes is constructed in order to achieve both fault-tolerance and efficiency with only one set of group key installed. Key trees are sophisticatedly managed to reduce the number of exponentiation operations. In addition, an individual rekeying scheme is introduced for occasional joining and leaving of member smart meters. Experimental results, on a simulation platform, show that our scheme is able to provide significant performance gains over state-of-the-art methods while effectively preserving the participants’ privacy.

Advanced Transition/Cluster Key Management Scheme for End-System Multicast Protocol

The recent growth of the World Wide Web has sparked new research into using the Internet for novel types of group communication, like multiparty videoconferencing and real-time streaming. Multicast has the potential to be very useful, but it suffers from many problems like security. To achieve secure multicast communications with the dynamic aspect of group applications due to free membership joins and leaves in addition to member's mobility, key management is one of the most critical problems. So far, a lot of multicast key management schemes have been proposed and most of them are centralized, which have the problem of 'one point failure' and that the group controller is the bottleneck of the group. In order to solve these two problems, we propose a Key Management Scheme, using cluster-based End-System Multicast (ESM). The group management is between both 1) the main controller (MRP, Main Rendezvous Point) and the second controllers (CRP, Cluster RP), and 2) the second controllers (CRPs) and its members. So, ESM simplifies the implementation of group communication and is efficient ways to deliver a secure message to a group of recipients in a network as a practical alternative to overcome the difficulty of large scale deployment of traditional IP multicast. In this paper, we analyze different key management schemes and propose a new scheme, namely Advanced Transition/Cluster Key management Scheme (ATCKS) and find it has appropriate performance in security.

Identity Based Group Key Agreement from Bilinear Pairing

We present a provably secure authenticated tree based key agreement scheme for multicast. There is a wide variety of applications that can benefit from using our scheme, e. g. , pay-Tv, teleconferencing, software updates. Compared with the previous published schemes, our scheme provides group member authentication without introducing additional mechanism. Future, we give the security proof of our scheme under the random oracle model.

ENERGY-SAVING SCHEDULING FOR LTE MULTICAST SERVICES

In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put forward a new algorithm for LTE multicast downlink scheduling called the Energy-saving based Inter-group Proportional Fair(EIPF).The basic idea of EIPF is to calculate an appropriate transmitting power for each group according to its data rate respectively,and then follow the inter-group proportional fair principle to allocate RBs among multicast groups.The results of EIPF simulation show that the proposed algorithm not only can reduce the transmit power of BS effectively but also improve the utilization rate of energy.

Performance study on Gossip-based group key distribution protocal

Group key distribution is faced with two important problems, i.e. reliability and scalability, to support security multicast for large and dynamic groups. With group member increasing, traditional reliable multicast protocol can not deal with them fully. Gossip-based group key distribution idea for wide-area dissemination was provided. It is based on an gossip-based loss recovery control mechanism. It can provide a probabilistic reliable guarantee for a information dissemination to reach every group member, which can achieve scalability and reliability. To achieve full reliability, three layers protocol model in group key distribution was provided. One is best effect layer, which provides unreliable dissemination. Other is gossip-based loss recovery layer, which provides probabilistic reliable guarantee. Last is vsync-based layer, which provide deterministic loss recovery. We integrate probabilistic loss recovery method with deterministic one. The model possess scalability that probabilistic method has and full reliability prosthesis by vsync-based. To evaluate the effectiveness of gossip technique in scalable and reliable multicast protocols. We have compared gossip protocol with other reliable multicast protocols. Experimental result shows that gossip protocol has better scalability than other.

组播技术综述

组播通信技术提供了一种点对点或多点对多点的数据传输模型 ,作为下一代 Internet应用的重要技术 ,组播相关技术研究引起了广泛关注 .本文从分布式系统特点出发 ,分析了组播研究的内容和特点 ,描述了组播设计所涉及的技术及难点 。

应用层组播综述

为了加速组播的应用,解决现有组播存在的问题,近年来提出了应用层组播。将组播的功能从路由器转移到终端,不需要路由器维护组播组的路由表,且不用改变现有网络设施,方便实现组播功能。论述了现有的应用层组播,并对它们进行比较和评价,最后提出发展前景和进一步的研究方向。

基于空间填充曲线的数据分发区域匹配

提出基于空间填充曲线的HLA DDM区域匹配方法,将多维复杂路径空间中的区域线性化为字符串并建立空间区域索引树,区域匹配问题转换为索引的快速查询。这种方法在保证匹配精度前提下,在仿真推进全过程实现区域的快速匹配,并能在整个路径空间范围内实现组播资源动态分配,确保仿真成员间实时数据交互。实验结果表明基于索引树的线性化区域匹配方法能有效地保证数据分发管理服务功能的实现。

WSN中同构模型下动态组密钥管理方案

研究了同构网络模型的组密钥管理问题,首次给出了一个明确的、更完整的动态组密钥管理模型,并提出了一种基于多个对称多项式的动态组密钥管理方案。该方案能够为任意多于2个且不大于节点总数的节点组成的动态多播组提供密钥管理功能,解决了多播组建立、节点加入、退出等所引发的与组密钥相关的问题。该方案支持节点移动,具有可扩展性,并很好地解决了密钥更新过程中多播通信的不可靠性。组成员节点通过计算获得组密钥,只需要少量的无线通信开销,大大降低了协商组密钥的代价。分析比较认为,方案在存储、计算和通信开销方面具有很好的性能,更适用于资源受限的无线传感器网络。

基于逻辑密钥树的组播密钥管理研究进展

介绍了基于逻辑密钥树的组播密钥管理方案,以及针对逻辑密钥树的改进方案.分析了各个方案如何从组播应用的要求和限制出发,在满足安全需求、提高服务质量的同时尽量降低开销,指出各个方案都是在安全性、服务质量和开销等3个方面的要求之间进行适当的折衷与平衡.通过对各个改进方案的出发点及其优缺点的分析,为如何根据实际情况设计适合具体组播业务的密钥管理方案提供了参考.

IPv6组播技术及其实现

随着Internet的飞速发展,网络上的视频点播、网络TV、视频会议等多媒体应用越来越多。新一代Internet协议—IPv6也必须对这些应用提供有力的支持,才能满足需要。组播传输机制可以节省带宽,有效防止网络拥塞,尤其适合视频流等大数据量的传输。文章介绍了IPv6相关概念及组播机制原理,并实现了MPEG视频流在IPv6网上的组播传输。

组播技术在IPTV中的应用

随着网络技术的发展,IP技术已经成为核心网络承载技术的事实标准。传统业务在IP网络中的开展日趋成为广大研究人员以及各大运营商关注的热点。本文简要介绍了承载在IP网络上的电视业务(网络电视)的基本概念,重点研究了组播技术在网络电视中的应用,并从组网方式、频道快速切换方法、安全、计费以及源特定组播五个方面进行分析并给出了相应的解决策略。

IP多播组密钥管理方案分类体系研究

IP多播组密钥管理问题是IP多播安全的核心问题。本文通过对现有组密钥管理方案和密钥管理本身规律的研究,给出了组密钥管理方案的详细分类,该分类对分析和改进已有方案、设计新的方案具有重要的指导意义。

一种适用于大型动态群组的密钥管理方案

组播是一种基于组的有效的数据传输方式,安全组播对许多组播应用程序非常必要.如何在一个大型动态多播群组中实现高效的安全组播,是一个具有挑战性的难题.提出一种新的基于逻辑密钥树的密钥管理方案,该方案集中使用了单向函数,XOR运算,伪随机函数等,大大降低了组控制器的存储量,并且提高了密钥更新的效率.与现存的其他基于逻辑密钥树的方案相比,具有明显的优越性,更适用于大型动态多播群组.