Multicast Group Communication Research Articles

MSDN-IoT multicast group communication in IoT based on software defined networking

MSDN-IoT multicast group communication in IoT based on software defined networking

UMUcast: A Framework for Massive Small-Data Delivering in Industrial Internet of Things

As a key infrastructure of Industry 4.0, Industrial Internet-of-Things (IIoT) promises the opportunity to build powerful industrial environments by leveraging the growing ubiquity of wired and wireless communication technologies. Designing a data delivery scheme in the future IIoT networks is undoubtedly a challenging task, as it should satisfy several conflicting requirements: massive-scale, data-intensive, and mission-critical, the requirements of which have motivated the desired need for feasible IIoT network architecture. In particular, the traffic characteristics of certain IIoT applications feature small-data patterns especially in typical automation control scenarios such as robot control on the downlink. In order to reduce the huge overhead associated with each individual unicast transmission of the small-data message, we propose a novel “multipoint-to-multipoint” and/or “point-to-multipoint with different contents” communication paradigm-Uni-Multi-Unicast (UMUcast), which is based-on traditional 4G technologies such as evolved Multimedia Broadcast Multicast Service (eMBMS) and Group Communication System Enablers (GCSE), and novel 5G technologies such as Multi-Access Edge Computing (MEC). For the downlink, the UMUcast transmitter can jointly encode multiple-sources' small-data messages into a single chunk at MEC equipment in conjoint with a gNB, where chunk can be one-off transmission to multiple receivers simultaneously through an eMBMS frame, whereas the chunk is decoded into multiple small-data by each individual IIoT devices separately and respectively. The simulation results show that UMUcast has remarkable improvements over conventional point-to-point unicasting in handling multi-source, multi-destination, and massive small-data delivery with characteristics of low-overhead, high-throughput, and ultra-low-latency for future 5G-based IIoT networks.

Multicast error correction method to support scalability in mobile ad hoc networks

Error-free data transmission over a wireless channel is a major barrier to achieving group communication in mobile ad hoc networks (MANETs). As the node density starts varying in MANET, chances of error-free transmissions start decreasing. In order to support scalable network and to save the network resources, we need to reduce the retransmission of erroneous data packets. Various error correction methods (ECMs) are used to reduce the retransmission cost by enabling the receiver with error correction capability. In case of multicast group communication, where data is delivered to multiple receivers, retransmissions become a more challenging task to handle. In this paper, multicast error correction method (MECM) has been proposed that uses the concept of forward error correction (FEC) scheme to reduce the packet retransmission in mobile ad-hoc networks. The performance analysis of MECM based MAODV and ODMRP multicast protocols are carried out under varying density of nodes. The proposed MECM scheme is also compared with normal and traditional FEC based MAODV and ODMRP in terms of throughput, packet delivery ratio, routing load and end to end delay.

Axiom

This article presents Axiom, a DTLS-based approach to efficiently secure multicast group communication among IoT-constrained devices. Axiom provides an adaptation of the DTLS record layer, relies on key material commonly shared among the group members, and does not require one to perform any DTLS handshake. We made a proof-of-concept implementation of Axiom based on the tinyDTLS library for the Contiki OS and used it to experimentally evaluate performance of our approach on real IoT hardware. Results show that Axiom is affordable on resource-constrained platforms and performs significantly better than related alternative approaches.

Self-Organized Hash Based Secure Multicast Routing Over Ad Hoc Networks

Multicast group communication over mobile ad hoc networks has various challenges related to secure data transmission. In order to achieve this goal, there is a need to authenticate the group member as well as it is essential to protect the application data, routing information, and other network resources etc. Multicast-AODV (MAODV) is the extension of an AODV protocol, and there are several issues related to each multicast network operation. In the case of dynamic group behavior, it becomes more challenging to protect the resources of a particular group. Researchers have developed different solutions to secure multicast group communication, and their proposed solutions can be used for resource protection at different layers i.e. application layer, physical layer, network layer, etc. Each security solution can guard against a particular security threat. This research paper introduced a self-organized hash based secure routing scheme for multicast ad hoc networks. It uses group Diffie-Hellman method for key distribution. Route authentication and integrity, both are ensured by generating local flag codes and global hash values. In the case of any violation, route log is monitored to identify the malicious activities.

Efficient Multicast Routing on BCube-Based Data Centers

Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD （Hamming Distance）-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

AN EFFICIENT AND VARIABLE INTERVAL REKEYING FOR DYNAMIC AD HOC MULTICAST GROUP USING KEY PATH REDUCTION

Key distribution is one of the major issues in secure ad hoc multicast group communication. There has been an extensive research on rekeying, to reduce cost. In this study, we propose an efficient and scalable batch rekeying for dynamic ad hoc multicast group, with variable interval and key path reduction techniques. The proposed scheme overcomes the major existing issues like inefficiency in using the keys that are generated and distributed, the sync issue in which a user tries to decrypt a data using an irrelevant key, imbalance in network traffic and latency in the key server response to the user request, for leaving and joining at once. Generally, a central key server is used to govern all the above issues. The proposed scheme excludes the usage of a central key server by generating the group key in the individual nodes, which minimizes the communication overhead and the number of keys that each user possesses. The proposed scheme also reduces the depth of the tree very effectively, when a user joins or leaves the group, using key path reduction technique and ensures forward and backward secrecy. The simulation result shows better performance when compared to individual, regular batch and periodic rekeying.

Trust based Leader Selection Methodology for P-LeaSel: A Multicast Group Communication Model

is an internetwork group communication service which reduces the transmission overheads. The data can be secured by encrypting it with a group key, shared among all group members (6). Whenever members join/leave in a group communication, it is essential to preserve the forward and backward confidentiality by sending new keys for transmission. When members join/leave frequently, it gives rise to transmission overhead. Leasel is a multicast group communication model which addresses the problem of scalability due to the multicast transmission overheads. Being a de-centralized group model, a top ranking member of the sub-group is designated as a and authorized to perform key generation and distribution. The identity as Leader is hidden to the sub group members. The P-Leasel model, instead of a single leader, identifies p leaders and is alternated for every transaction. Any one leader from the p leaders is authorized to perform key management. This study proposes a trust based leader selection methodology by analyzing trust in selecting Leaders for key generation and distribution. In addition to selecting Leaders based on the static trust computation, allowing the controllers to judge the trustworthiness of leaders dynamically, making better use of the received recommendations directly and indirectly. The simulation experiments show improvements in the security aspects which makes P-Leasel more secured multicast group communication model.

A multi-agent system for scalable group decision making

In Group Decision Support System (GDSS), multicast group communication was found to be challenging because of the nature of its distributed decision makers. The efficiency and correctness of the group decision making process mainly depends on the communication approach used among its participants. Although many solutions have been proposed to handle group communication, this paper aims to achieve reliable, fault tolerant, and high scalable group communication that supports successful group decision making. In this paper, a new group communication approach that supports group decision making in collaborative environments such as GDSS is proposed. This approach enables a set of distributed decision makers to collaborate and exchange proposals and solutions in a coordinated and reliable way to reach a collective decision. The proposed approach is a multi-agent system inspired by the behaviour of swarms of honeybees in their food foraging and source evaluation. The advantages of the proposed approach are investigated and showed that simulating bee behavior for group decision making makes the new system fault tolerant and more reliable compared to centralized and distributed approaches. The ability of the new approach to handle a group decision making with several environmental changes is measured and compared through simulation experiments. The results showed that the new multi-agent system achieved higher scalability with 45% efficiency. 5544 Anas Jebreen Atyeeh Husain

Simulation of A Novel Scalable Group Key Management Protocol

Secure and multicast group communication is an active area of research. The main problem in secure group communication is group dynamics and key management. Group key management brings challenges on scalability for multicast security. Member joining and member leaving from the group is the main challenge in designing secure and scalable group communication for dynamic update of keys. Most of the proposed solutions are not considering this parameter and so suffer from the one-affects-n scalability problem. This paper presents the simulation of our approach A Novel Scalable Group Key Management Protocol (NSGKMP) and gives the brief introduction about NetworkSimulator2 (NS2). This NSGKMP approach decreases number of rekeying operation when a member joins in to the group or leave from the group i.e. dynamic updating of keys. General Terms Network security, simulation.

Deployment of a Hybrid Multicast Switch in Energy-Aware Data Center Network: A Case of Fat-Tree Topology

Recently, energy efficiency or green IT has become a hot issue for many IT infrastructures as they attempt to utilize energy-efficient strategies in their enterprise IT systems in order to minimize operational costs. Networking devices are shared resources connecting important IT infrastructures, especially in a data center network they are always operated 24/7 which consume a huge amount of energy, and it has been obviously shown that this energy consumption is largely independent of the traffic through the devices. As a result, power consumption in networking devices is becoming more and more a critical problem, which is of interest for both research community and general public. Multicast benefits group communications in saving link bandwidth and improving application throughput, both of which are important for green data center. In this paper, we study the deployment strategy of multicast switches in hybrid mode in energy-aware data center network: a case of famous fat-tree topology. The objective is to find the best location to deploy multicast switch not only to achieve optimal bandwidth utilization but also to minimize power consumption. We show that it is possible to easily achieve nearly 50% of energy consumption after applying our proposed algorithm.

A secure group communication architecture for autonomous unmanned aerial vehicles

AbstractThis paper investigates the application of a secure group communication architecture to a swarm of autonomous unmanned aerial vehicles (UAVs). A multicast secure group communication architecture for the low earth orbit (LEO) satellite environment is evaluated to determine if it can be effectively adapted to a swarm of UAVs and provide secure, scalable, and efficient communications. The performance of the proposed security architecture is evaluated with two other commonly used architectures using a discrete event computer simulation developed using MATLAB. Performance is evaluated in terms of the scalability and efficiency of the group key distribution and management scheme when the swarm size, swarm mobility, multicast group join and departure rates are varied. The metrics include the total keys distributed over the simulation period, the average number of times an individual UAV must rekey, the average bandwidth used to rekey the swarm, and the average percentage of battery consumed by a UAV to rekey over the simulation period. The proposed security architecture can successfully be applied to a swarm of autonomous UAVs using current technology. The proposed architecture is more efficient and scalable than the other tested and commonly used architectures. Over all the tested configurations, the proposed architecture distributes 55.2–94.8% fewer keys, rekeys 59.0–94.9% less often per UAV, uses 55.2–87.9% less bandwidth to rekey, and reduces the battery consumption by 16.9–85.4%. Published in 2008 by John Wiley & Sons, Ltd.

IPv6 over IEEE 802.16 (WiMAX) Networks: Facts and Challenges

Deploying the new generation Protocol (IPv6) over 802.16-based wireless networks is facing an important challenge as the IEEE 802.16 standard is failing to support IPv6 functionalities. In fact, unlike the other 802 standards, the IEEE 802.16 is based on a point-to- multipoint (PMP) communication model, where no direct connection (at the MAC layer) is possible between two stations, all communications pass through the Base Station. As a result, the 802.16 standard is unable to handle any form of IP multicast (group) communication, and hence it can not sustain the new functionality of IPv6, namely auto- configuration mechanism, which particularly relies on IP multicast communication. In this paper, we present different architectures to consider when deploying IPv6 over wireless broadband network, such as WiMAX. Also, we point out challenges and solutions related to this deployment, by focusing particularly on solutions proposed by the 16ng IETF group, which aims to establish an Internet RFC on deploying IPv6 over IEEE 802.16.

SeReRoM: Secured Reliable Routing Scheme for Multicasting

This paper proposes a multipath routing scheme SeReRoM for a multicast group communication with a single source and multiple destinations. SeReRoM provides an environment that tackles the twin issues of security and reliability. In SeReRoM the message to be sent is divided into 'k' packets. An error correcting scheme used to provide reliability converts the 'k' packets into 'n' packets (n ＞ k) and the 'n' packets are transmitted through 'n' node disjoint multicast distribution trees to reach all the destinations in the group. The reception of 'k' packets out of 'n' packets will enable the destination user to recover the original message. Thus failure of (n-k) distribution tree will not affect the regular communication in the group. Any hacker listening to one single tree will not be able to retrieve the entire portion of the message from the source node, thus providing security in addition to the secure key management scheme that exist for the multicast group. The functionalities of the proposed routing scheme are verified and the performance results of the proposed multicasting scheme are presented in this paper.

Secure Hypergraphs: Privacy from Partial Broadcast

A broadcast channel enables one processor to send the same message---simultaneously and privately---to a fixed subset of processors. Suppose that a collection of processors are connected by an arbitrary network of partial broadcast channels (a hypergraph). We initiate the study of necessary and sufficient conditions, complexity bounds, and protocols for individual processors to exchange private messages across this network. Private message exchange, in turn, enables the realization of general secure computation primitives. The model (motivated by various environments such as multicast network architectures and group communication in distributed systems) is an intermediate setting between the private channels model and the full information model, both of which have been investigated extensively in the last few years. We assume a computationally unlimited adversary (i.e., the information theoretic notion of security), and our techniques are combinatorial. Both the possibility and the polynomial-time feasibility of private message exchange are investigated.

실시간 멀티캐스팅 정보보안을 위한 그룹키 관리

실시간 데이터를 사용자 그룹에게 전송하는 멀티캣그트는 유니캐스트에 비해 링크의 수가 많으므로 부당한 침입자로부터 신분위장, 서비스 거부 공격 등의 많은 공격을 받기 쉽다. 이를 방지하기 위해 제시된 기존의 그룹키 관리 구조는 비교적 규모가 큰 구조에 맞는 라우팅 프로토콜에 적합하도록 설계되었다. 따라서 소규모의라우팅 구조에 적용된 기존 그룹키 관리 구조는 항상 기본적인 코어 트리를 요구하거나 키 분배에 따른 많은 부하를 갖는 문제점을 갖게 된다. 이에 본 논문에서는 소규모 라우팅 구조에 적용된 기존 그룹키 관리 구조는 항상 기본적인 코어 트리를 요구하거나 키 분배에 따른 많은 부하를 갖는 문제점을 갖게 된다. 이에 본 논문에서는 소규모 라우팅 구조에 적합한 PIM-SM 라우팅을 이용하여, 안전한 멀티캐스트 통신이 가능한 그룹키 관리 구조를 제안한다. 제안한 방식은 멀티캐스트 통신 그룹을 RP(Rendezvous-Point) 단위의 부그룹으로 나누고, 각 RP에 부그룹 키 관리자를 부여하여 송/수신자간에 그룹키를 주고 받도록 한다. 이로서 송/수신자간에 보호채널이 설정되고 안전한 데이터 전송이 가능하게 한다. 이는 그룹키에 따른 데이터 변환작업이 필요하지 않고 경로 변경에 따른 새로룬 키 분배가 불필요하게 되어 데이터 전송시간이 단축되는 장점을 갖게 된다. The multicast transmitting the real-time data to groups may easily have many attacks from abnormal attacks because it has many links as compared to the unicast. The existing group key management architectures for preventing these problems are designed for protocols suitable for a large scale. Thus these architectures applied to a small scale routing protocols may have many overheads with key distribution and a constant core tree. Therefore this paper proposes a groups key management protocol for a secure multicast in PIM-SM multicast group communication. The proposed method divide multicast groups with RO(Rendezvous-Point), and subgroup key managers are established in each RP and can be transmitted groups keys between senders and receivers, so the security cannel is set up for secure data transfer, And this does not have needs of the data translation for group keys and the new key distribution for path change. As a result of this, the data transmission time can be reduced.

A multicast group communication protocol, engine, and bridge for CORBA

AbstractMulticast group communication is needed for fault‐tolerant distributed systems and, in particular, for the new Fault Tolerant CORBA standard, to maintain strong replica consistency. However, different multicast group communication protocols are appropriate for different environments, which makes it difficult to define a single standard multicast protocol. In this paper, we present a multicast group communication engine and bridge for CORBA that allows multiple group communication protocols to be used concurrently. We also present the Fault Tolerant Multicast Protocol, a group communication protocol that allows different fault tolerance systems to interoperate.The group communication engine and bridge places Lamport timestamps on messages, and multicasts messages to groups, using one or more group communication protocols. The group communication protocols reliably deliver the timestamped messages in timestamp order to the group communication engine, which integrates these streams of messages into a single stream for delivery in timestamp order. The Fault Tolerant Multicast Protocol operates over IP Multicast, and consists of the Reliable Multicast Protocol which provides reliable source‐ordered message delivery, the Reliable Ordered Multicast Protocol which provides reliable totally ordered message delivery, and the Host Group Membership Protocol which provides host group membership services. Copyright © 2001 John Wiley & Sons, Ltd.

Object-Oriented Design of QoS Multicast Communications

Multicast (group) communications have been widely recognized by current research and industry. Multicast is very useful for various network applications such as distributed (replicated) database, video/audio conference, information distribution and server locations, etc. But design and implementation of such multicast communication systems in networks are complicated tasks, especially when quality of services (QoS) of applications such as real-time and reliability are desired. To quick design and implement multicast communication, good tools are crucial and must be facilitated. This paper presents a novel object-oriented (O-O) QoS driven approach for the quick design and prototyping of multicast communication systems under certain QoS requirements for multicast message transmission and receptions such as real-time, total ordering, atomicity and fault-tolerance, etc.

Byzantine-Resistant Total Ordering Algorithms

Multicast group communication protocols are used extensively in fault-tolerant distributed systems. For many such protocols, the acknowledgments for individual messages define a causal order on messages. Maintaining the consistency of information, replicated on several processors to protect it against faults, is greatly simplified by a total order on messages. We present algorithms that incrementally convert a causal order on messages into a total order and that tolerate both crash and Byzantine process faults. Varying compromises between latency to message ordering and resilience to faults yield four distinct algorithms. All of these algorithms use a multistage voting strategy to achieve agreement on the total order and exploit the random structure of the causal order to ensure probabilistic termination.

Multimedia group communications: towards new services

Interpersonal communication among a group of users employing different media types is becoming more and more widespread in computing and telecommunications. Group communication places a variety of new requirements onto the underlying communications architecture and although many existing protocols and services do offer some limited support for multicast group communication, these new requirements make it difficult to find efficient and comprehensive solutions. The impact of multimedia group communication on the communication system and the way in which existing systems, international standardization bodies and researchers cope with these challenges is the subject of this paper. First the characteristics and requirements of multimedia group applications are discussed and illustrated by examples of existing group applications. Subsequently a survey of the kind of support available in today's communication system is presented. In addition the ongoing discussion about the standardization of group communication within ISO and ITU and the direction these efforts take is briefly summarized. Further, some selected examples of research projects which deal with different communication and protocol related aspects of multimedia group communication are presented which give an indication of the trends in this area.