Journal articles: 'Multicast Networks'

1

Chen, Yue, Hongyong Jia, Kaixiang Huang, Julong Lan, and Xincheng Yan. "A Secure Network Coding Based on Broadcast Encryption in SDN." Mathematical Problems in Engineering 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/7145138.

Full text

Abstract:

By allowing intermediate nodes to encode the received packets before sending them out, network coding improves the capacity and robustness of multicast applications. But it is vulnerable to the pollution attacks. Some signature schemes were proposed to thwart such attacks, but most of them need to be homomorphic that the keys cannot be generated and managed easily. In this paper, we propose a novel fast and secure switch network coding multicast (SSNC) on the software defined networks (SDN). In our scheme, the complicated secure multicast management was separated from the fast data transmission based on the SDN. Multiple multicasts will be aggregated to one multicast group according to the requirements of services and the network status. Then, the controller will route aggregated multicast group with network coding; only the trusted switch will be allowed to join the network coding by using broadcast encryption. The proposed scheme can use the traditional cryptography without homomorphy, which greatly reduces the complexity of the computation and improves the efficiency of transmission.

APA, Harvard, Vancouver, ISO, and other styles

2

Zhou, Ze Shun, Yi Xu, Jun Jie Yan, Zhong Wei Nie, and La Yuan Li. "A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks." Applied Mechanics and Materials 347-350 (August 2013): 553–58. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.553.

Full text

Abstract:

Routing problem is one of the most important issues to a wireless sensor network (WSN). It is the key problem to find an efficient energy strategy for prolonging network's lifetime because power supply might be impossible. This paper discusses the multicast routing problem of WSN with multiple QoS constraints, which may deal with the delay, bandwidth, hop count and packet reception rat and surplus energy metrics, and finds a minimum resource consumption path while satisfying multiple constraints optimization conditions, and describes a network model for researching the multicast routing problem. It presents a dynamic multicast routing algorithm with multiple QoS constraints (MCQoSRA). The MCQoSRA successfully solves the QoS routing problems when multicast nodes change dynamically in the networks. The MCQoSRA only requires the local state information of the link (or node), but does not require any global network sate to be maintained. In MCQoSRA, a multicast group member can join or leave the multicast session dynamically. The MCQoSRA can effectively decrease the overhead for constructing a multicast tree and the delay of the nodes, and improve the success ratio of seeking links. Simulation results show that the MCQoSRA provides an available means to implement multicast routing, and adapt to all kinds of the topology networks, and have better expansibility.

APA, Harvard, Vancouver, ISO, and other styles

3

Liu, Huanlin, Qinren Shen, and Yong Chen. "An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks." International Journal of Optics 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/693807.

Full text

Abstract:

Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the formerKshortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

APA, Harvard, Vancouver, ISO, and other styles

4

Si, Jing Jing. "A Hierarchical Multicast Scheme for Heterogeneous Receivers." Advanced Materials Research 108-111 (May 2010): 57–62. http://dx.doi.org/10.4028/www.scientific.net/amr.108-111.57.

Full text

Abstract:

We investigate inter-session network coding for networks with heterogeneous receivers in this paper. Based on layered source coding, we define the hierarchical inter-layer random network codes, and propose a hierarchical multicast scheme. Moreover, we compare our hierarchical multicast scheme with the layered multicast schemes in theory and with simulations. Simulation results show that our hierarchical multicast scheme can achieve the optimal aggregate throughput for some networks where the layered multicast schemes are suboptimal.

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Ling Xiu, and Ye Wen Cao. "Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks." Advanced Materials Research 204-210 (February 2011): 1399–402. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1399.

Full text

Abstract:

IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.

APA, Harvard, Vancouver, ISO, and other styles

6

Hussen, Hassen Redwan, Sung-Chan Choi, Jong-Hong Park, and Jaeho Kim. "Predictive geographic multicast routing protocol in flying ad hoc networks." International Journal of Distributed Sensor Networks 15, no. 7 (July 2019): 155014771984387. http://dx.doi.org/10.1177/1550147719843879.

Full text

Abstract:

In the past decades, the unmanned aerial systems have been utilized only for military operations. However, recently, the potential uses and applicability of unmanned aerial vehicles (commonly known as drones) in civilian application domains are becoming a fast-growing phenomenon. A flying ad hoc network is a wireless ad hoc network specifically designed for the communication of unmanned aerial vehicles. Multicast routing is one of the vital aspects in wireless ad hoc networks. Using multicast transmission approaches, flying ad hoc network applications may need to send the same message to a specific group of flying nodes. The multicast communication approaches can benefit flying ad hoc network applications in conserving the scarce resources of flying nodes. Research works have been proposed to tackle the challenges in multicast routing with multi-hop communication in ad hoc network environments. Nevertheless, the conventional multicast routing mechanisms incur excessive control message overhead when a large number of nodes experience frequent topological changes. A scalable geographic multicast routing mechanism, which specially require localized operation and reduced control packet overhead, is necessary. Multicast routing in flying ad hoc networks is extremely challenging because of the dynamic topology changes and network disconnection resulted from frequent mobility of nodes. In this article, we present and implement a scalable and predictive geographic multicast routing mechanism in flying ad hoc networks. In uniform and random deployment scenarios, the MATLAB-based evaluation result has revealed that when the communication range increases, the probability of finding one-hop predicted forwarders to reach multicast destinations also increases. The implementation of scalable and predictive geographic multicast routing mechanism in flying ad hoc network is done using Optimizing Network Engineering Tools Modeler 16.0. We have added the scalable and predictive geographic multicast routing mechanism in flying ad hoc network as a new routing scheme in the Mobile Ad hoc Network routing protocol groups of the Optimizing Network Engineering Tools Modeler. Then, the performance of scalable and predictive geographic multicast routing mechanism in flying ad hoc network is compared with two of the existing Mobile Ad hoc Network routing protocols (Geographic Routing Protocol and Dynamic Source Routing). Eventually, we present two instance scenarios regarding the integration of scalable and predictive geographic multicast routing mechanism in flying ad hoc network scheme in the Internet of Things platform.

APA, Harvard, Vancouver, ISO, and other styles

7

Yue, Xue Jun, Tian Sheng Hong, Kun Cai, and Jia Nian Li. "Study on Schemes for Seamless Multicast Handover in the Proxy Mobile IPv6 Based on Wireless Networks." Advanced Materials Research 129-131 (August 2010): 1405–9. http://dx.doi.org/10.4028/www.scientific.net/amr.129-131.1405.

Full text

Abstract:

The research was carried on centered about the key technology in the Proxy Mobile Ipv6 networks. The frame based on multi-level domains multicast agent was proposed. And the multi-level domains multicast agent who can be collocated easily was also introduced. The different service area of multi-level domains multicast agent is overlapped which can avoid “single point of failure.” The router advertisements of Ipv6 discovered the dynamic change of availed multi-level domains multicast agent and network topology. An ASMM (Auto Study Mobile Multicast) program was proposed on the based frame of multi-level domains multicast agent. The way of sending multicast data in outer region can be chosen neatly taking advantage of the number of mobile host in outer region according to the network situation in this program instead of sending multicast data in only one mode which achieved seamless handover. In recent years, the rapid development of internet and mobile networks makes people demand the combination of internet and mobile networks more and more eagerly which can provide extensive business for mobile users. And multicast is a very promising technology in mobile network. It can enable a group of mobile users to receive the message from the same business source at the same time which improved network efficiency greatly [1]. The mobile multicast technology is facing many problems. Firstly, all multicast technology was designed for fixed host; the multicast tree established on these agreements can be changed easily. And it will cost much if it is changed; Secondly, The mobile multicast technology not only considers the dynamic change of every group members but also the location dynamic change of every group members [2, 3]. So, the mobile multicast technology is a research focus at present. IETF and many researchers proposed much mobile multicast agreement. But these agreements have different inadequateness.

APA, Harvard, Vancouver, ISO, and other styles

8

Daru, Pan, and Zhang Han. "Wireless Multicast Opportunistic Routing with Dual Network Coding." Key Engineering Materials 474-476 (April 2011): 1173–78. http://dx.doi.org/10.4028/www.scientific.net/kem.474-476.1173.

Full text

Abstract:

Wireless Multicast is one of the important problems with applications to opportunistic networks, such as delay-tolerant networks (DTNs), personal, pocket-switched networks (PSNs) etc. Network Coding has received many attentions because it improves potential network throughput and robustness by the way of combining multiple packets in the routers and reducing the transmissions. This paper combines network coding with opportunistic routing to improve the throughput of wireless multicast, where an Inter-coding and Intra-coding scheme is introduced to the traditional multicast routing algorithm (OR-DNC, Opportunistic Routing with Dual Network Coding). Compared with traditional multicast routing without coding and MORE-M, OR-DNC performs better in terms of throughput, transmission reduction and coding gain.

APA, Harvard, Vancouver, ISO, and other styles

9

Yin, Wen Hua, Xiang Yu Bai, and Xue Bin Ma. "Multicast Routing Protocols in Delay Tolerant Networks." Applied Mechanics and Materials 614 (September 2014): 490–96. http://dx.doi.org/10.4028/www.scientific.net/amm.614.490.

Full text

Abstract:

Delay Tolerant Networks (DTNs) are characterized by intermittent connectivity, frequent partitions and extremely high latency. As a result, multicast routing protocols are difficult to implement in DTNs. Multicast can not only save network bandwidth, but also can reduce communication cost and improve the efficiency of data transfer. In recent years, various multicast routing protocols are proposed for DTNs. In order to provide a comprehensive understanding of these multicast routing protocols designed for DTNs, a survey of the multicast routing protocols was discussed in this paper. We analyzed two types of multicast routing protocols: the knowledge-based multicast routing protocol and the probability-based multicast protocol. We conclude the future research directions by discussing the advantages and disadvantages of various multicast routing protocols for DTNs, and provide some reference value for the further studies of multicast routing protocols of DTNs. Furthermore, in order to resolve the existing problems of DTNs (such as energy optimization); we will propose a social-aware energy constrained multicast routing algorithm in the future.

APA, Harvard, Vancouver, ISO, and other styles

10

Li, Guozhi, Songtao Guo, Guiyan Liu, and Yuanyuan Yang. "Application and Analysis of Multicast Blocking Modelling in Fat-Tree Data Center Networks." Complexity 2018 (2018): 1–12. http://dx.doi.org/10.1155/2018/7563170.

Full text

Abstract:

Multicast can improve network performance by eliminating unnecessary duplicated flows in the data center networks (DCNs). Thus it can significantly save network bandwidth. However, the network multicast blocking may cause the retransmission of a large number of data packets and seriously influence the traffic efficiency in data center networks, especially in the fat-tree DCNs with multirooted tree structure. In this paper, we build a multicast blocking model and apply it to solve the problem of network blocking in the fat-tree DCNs. Furthermore, we propose a novel multicast scheduling strategy. In the scheduling strategy, we select the uplink connecting to available core switch whose remaining bandwidth is close to and greater than the three times of bandwidth multicast requests so as to reduce the operation time of the proposed algorithm. Then the blocking probability of downlink in the next time-slot is calculated in multicast subnetwork by using Markov chains theory. With the obtained probability, we select the optimal downlink based on the available core switch. In addition, theoretical analysis shows that the multicast scheduling algorithm has close to zero network blocking probability as well as lower time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm.

APA, Harvard, Vancouver, ISO, and other styles

11

Chiang, Tzu Chiang, Hua Yi Lin, and Jia Lin Chang. "A Rendezvous-Location Based Multicast Secure Communication in Ad Hoc Networks." Advanced Materials Research 121-122 (June 2010): 657–62. http://dx.doi.org/10.4028/www.scientific.net/amr.121-122.657.

Full text

Abstract:

Mobile ad-hoc networking (MANET) is a collection of mobile nodes that want to communicate to each others, but has no fixed links like wireless infrastructure networks to provide group applications and services. Therefore we need concern about providing each node with a secure and efficient key management system for dynamically discovering other nodes which can directly communicate with. Due to the network topology of an ad hoc network changes frequently and unpredictable, so the security of multicast routing becomes more challenging than the traditional networks. In this paper, we describe how any users in the multicast group can compose the group keys and propose a hierarchical group key management to securely multicast data from the multicast source to the rest of the multicast members in wireless ad hoc networks. This approach has a hierarchical structure where the group members are partitioned into rendezvous-location based clusters which can reduce the cost of key management. It not only provides the multicast routing information, but also fits the robustness of the wireless networks and reduces the overhead for the security management.

APA, Harvard, Vancouver, ISO, and other styles

12

Guo, Qin, Mingxing Luo, Lixiang Li, and Yixian Yang. "A Computational Perspective on Network Coding." Mathematical Problems in Engineering 2010 (2010): 1–11. http://dx.doi.org/10.1155/2010/436354.

Full text

Abstract:

From the perspectives of graph theory and combinatorics theory we obtain some new upper bounds on the number of encoding nodes, which can characterize the coding complexity of the network coding, both in feasible acyclic and cyclic multicast networks. In contrast to previous work, during our analysis we first investigate the simple multicast network with source rateh=2, and thenh≥2. We find that for feasible acyclic multicast networks our upper bound is exactly the lower bound given by M. Langberg et al. in 2006. So the gap between their lower and upper bounds for feasible acyclic multicast networks does not exist. Based on the new upper bound, we improve the computational complexity given by M. Langberg et al. in 2009. Moreover, these results further support the feasibility of signatures for network coding.

APA, Harvard, Vancouver, ISO, and other styles

13

Myung-Ki Shin, Ki-Il Kim, Dong-Kyun Kim, and Sang-Ha Kim. "Multicast delivery using explicit multicast over IPv6 networks." IEEE Communications Letters 7, no. 2 (February 2003): 91–93. http://dx.doi.org/10.1109/lcomm.2002.808396.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Xiao, Hua-gang Shao, and Wei-nong Wang. "Topology-aware overlay multicast over IP multicast networks." Journal of Shanghai Jiaotong University (Science) 13, no. 1 (February 2008): 91–96. http://dx.doi.org/10.1007/s12204-008-0091-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Brooks, R. R., Brijesh Pillai, Michele C. Weigle, and Matthew Pirretti. "Optimal Layout of Multicast Groups Using Network Embedded Multicast Security in Ad Hoc Sensor Networks." International Journal of Distributed Sensor Networks 3, no. 3 (July 2007): 273–87. http://dx.doi.org/10.1080/15501320601062080.

Full text

Abstract:

This paper considers the security of sensor network applications. Our approach creates multicast regions that use symmetric key cryptography for communications. Each multicast region contains a single keyserver that is used to perform key management and maintain the integrity of a multicast region. Communications between two multicast regions is performed by nodes that belong to both regions. To ease the network management burden, it is desirable for the networks to self-organize into regions and dynamically select their keyservers. This paper shows how to determine the number of keyservers ( k) to use and the size in the number of hops ( h) of their multicast regions. We find that power consumption issues provide a natural trade-off that determines optimal values for these parameters. Analysis of one application shows an increase in system security with 70-80% less power overhead than existing security approaches.

APA, Harvard, Vancouver, ISO, and other styles

16

Xuan, Yuanzhe, and Chin-Tau Lea. "Network-Coding Multicast Networks With QoS Guarantees." IEEE/ACM Transactions on Networking 19, no. 1 (February 2011): 265–74. http://dx.doi.org/10.1109/tnet.2010.2062533.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Pattavina, A., and G. Tesei. "Multicast nonblocking switching networks." IEEE Transactions on Communications 50, no. 8 (August 2002): 1240–43. http://dx.doi.org/10.1109/tcomm.2002.801492.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Kim, Dongsoo S., and Ding-Zhu Du. "Multirate multicast switching networks." Theoretical Computer Science 261, no. 2 (June 2001): 241–51. http://dx.doi.org/10.1016/s0304-3975(00)00142-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Varshney, Upkar. "Multicast over wireless networks." Communications of the ACM 45, no. 12 (December 2002): 31–37. http://dx.doi.org/10.1145/585597.585598.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Im, Illkyun, and Jongpil Jeong. "Cost-Effective and Fast Handoff Scheme in Proxy Mobile IPv6 Networks with Multicasting Support." Mobile Information Systems 10, no. 3 (2014): 287–305. http://dx.doi.org/10.1155/2014/131030.

Full text

Abstract:

With recent advancements in wireless communication technologies, mobile multicasting is becoming important, in an effort to use network resources more efficiently. In the past, when various mobile IP-based multicast techniques were proposed, the focus was on the costs needed for network delivery to provide multicast services, as well as on minimizing the multicast handover delay. However, it is fundamentally difficult to resolve the problems of handover delay and tunnel convergence for techniques using MIPv6 (Mobile IPv6), a host-based mobility management protocol. To resolve these problems, the network-based mobility management protocol PMIPv6 (Proxy Mobile IPv6) was standardized. Although performance is improved in PMIPv6 over MIPv6, it still suffers from problems of handover delay and tunnel convergence. To overcome these limitations, a technique called LFH (Low-cost and Fast Handoff) is proposed in this paper, for fast and low-cost mobility management with multicasting support in PMIPv6 networks. To reduce the interactions between the complex multicast routing protocol and multicast messages, a simplified proxy method called MLD (Multicast Listener Discovery) is implemented and modified. Furthermore, a TCR (Tunnel Combination and Reconstruction) algorithm was used in the multicast handover procedure within the LMA (Local Mobility Anchor) domain, as well as in the multicast handover procedure between domains, in order to overcome the problem of tunnel convergence. It was found that, compared to other types of multicast techniques, LFH reduces multicast delay, and requires lower cost.

APA, Harvard, Vancouver, ISO, and other styles

21

Jiao, Yang. "Research of Tree-based Multicast Routing Protocols for Ad Hoc Networks." MATEC Web of Conferences 232 (2018): 01038. http://dx.doi.org/10.1051/matecconf/201823201038.

Full text

Abstract:

Multicast is an important function of Ad Hoc network. It is a point to multipoint or multipoint to multipoint packet transmitting mode. Group management and maintenance, multicast packet routing are two factors of multicast protocol. This paper analyzes the classification of multicast protocols and focuses on tree based multicast protocols, compares several protocols and analyzes the advantages and disadvantages of tree based multicast protocols.

APA, Harvard, Vancouver, ISO, and other styles

22

Do-Duy, Tan, Trang Dang Phuoc Hai, Phuc Truong Quang, Loc Nguyen Van Thanh, Phuc Nguyen Van, and Thanh Le Minh. "Optimal Throughput for Multicast over MANET-Satellite Networks." Journal of Technical Education Science, no. 68 (February 28, 2022): 74–81. http://dx.doi.org/10.54644/jte.68.2022.1112.

Full text

Abstract:

The convergence of MANET and satellite networks has been considered as one of the potential solutions to provide emergency communication and disaster relief services. However, unreliable MANET and satellite links may inﬂuence seriously to data transmission. In this paper, we study the application of packet-level coding for enhancing network throughput for multicast services over integrated MANET-satellite networks. First, we characterize the performance of multicast networks in terms of the probability of packet delivery under different packet-level codes. We then formulate and solve the coding optimization problem for typical values of computational resources at the network nodes given some target probability of successful delivery to the receivers. Finally, several simulation results show signiﬁcant gains in the average achievable rate at the receivers with respect to routing for representative scenarios with different types of network devices given a strictly-high probability of successful delivery of the multicast networks. Furthermore, the devices with higher computational resources can obtain significantly better throughput gain.

APA, Harvard, Vancouver, ISO, and other styles

23

Kim, Daehee, Sejun Song, and Baek-Young Choi. "Energy-Efficient Adaptive Geosource Multicast Routing for Wireless Sensor Networks." Journal of Sensors 2013 (2013): 1–14. http://dx.doi.org/10.1155/2013/142078.

Full text

Abstract:

We propose an energy-efficient adaptive geosource multicast routing (EAGER) for WSNs. It addresses the energy and scalability issues of previous location based stateless multicast protocols in WSNs. EAGER is a novel stateless multicast protocol that optimizes location-based and source-based multicast approaches in various ways. First, it uses the receiver's geographic location information to save the cost of building a multicast tree. The information can be obtained during the receiver's membership establishment stage without flooding. Second, it reduces packet overhead, and in turn, energy usage by encoding with a small sized node ID instead of potentially large bytes of location information and by dynamically using branch geographic information for common source routing path segments. Third, it decreases computation overhead at each forwarding node by determining the multicast routing paths at a multicast node (or rendezvous point (RP)). Our extensive simulation results validate that EAGER outperforms existing stateless multicast protocols in computation time, packet overhead, and energy consumption while maintaining the advantages of stateless protocols.

APA, Harvard, Vancouver, ISO, and other styles

24

FERRARI, TIZIANA, ANTONIO PINIZZOTTO, MARCO SOMMANI, and DAMIR POBRIC. "DEPLOYMENT OF NATIVE IP MULTICAST ROUTING SERVICES ON THE ITALIAN ACADEMIC AND RESEARCH NETWORK." International Journal of Modern Physics C 12, no. 04 (May 2001): 469–79. http://dx.doi.org/10.1142/s0129183101002577.

Full text

Abstract:

In 1993 the GARR (Italian Academic and Research Network) was connected to MBONE (worldwide IP multicast enabled network backbone). Since then, and especially in the last few years, this network has been used to test and develop new IP multicast routing protocols and applications. However it was a tunnel-based solution, not suitable for taking advantage of the new potential of IP multicast nor for use by a large community. This paper describes the work done for a migration to a native IP multicast routing deployment, highlighting the solutions adopted when dealing with the implementation problems and the complex wide area network management. The aim of this work is also to ensure a native IP multicast connection with the other Research Networks and the rest of Internet.

APA, Harvard, Vancouver, ISO, and other styles

25

Brooks, R. R., Brijesh Pillai, Matthew Pirretti, and Michele C. Weigle. "Multicast Encryption Infrastructure for Security in Sensor Networks." International Journal of Distributed Sensor Networks 5, no. 2 (March 1, 2009): 139–57. http://dx.doi.org/10.1080/15501320601062114.

Full text

Abstract:

Designing secure sensor networks is difficult. We propose an approach that uses multicast communications and requires fewer encryptions than pairwise communications. The network is partitioned into multicast regions; each region is managed by a sensor node chosen to act as a keyserver. The keyservers solicit nodes in their neighborhood to join the local multicast tree. The keyserver generates a binary tree of keys to maintain communication within the multicast region using a shared key. Our approach supports a distributed key agreement protocol that identifies the compromised keys and supports membership changes with minimum system overhead. We evaluate the overhead of our approach by using the number of messages and encryptions to estimate power consumption. Using data from field tests of a military surveillance application, we show that our multicast approach needs fewer encryptions than pair-wise keying approaches. We also show that this scheme is capable of thwarting many common attacks.

APA, Harvard, Vancouver, ISO, and other styles

26

Qabajeh, Mohammad M. "A Novel Approach to Support Scalable Multicast Routing in Wireless Ad Hoc Networks." International Journal of Interactive Mobile Technologies (iJIM) 16, no. 07 (April 5, 2022): 182–88. http://dx.doi.org/10.3991/ijim.v16i07.29195.

Full text

Abstract:

Nowadays, group communications over Mobile Ad hoc Networks (MANETs) have received significant attention. Multicasting plays an important role in simultaneous delivery of information to group of receivers. Thus, it is necessary to design efficient and effective multicast routing protocol to support group communication applications. Several efforts have been put to improve multicast routing. However, they do not consider scalability issue. This paper introduces a a novel Scalable Geographic Multicast Routing Protocol (SGMRP). The main objective of this protocol is to design a lightweight scalable multicast routing scheme irrespective of the number of multicast members and network size. To achieve this, a virtual clustering strategy has been introduced. This strategy based on partitioning the network into sectorial zones. The proposed solution performs efficient packet forwarding with reduced communication overhead. The proposed scheme eliminates the duplicate packets between clusters and reduces the number of participating nodes

APA, Harvard, Vancouver, ISO, and other styles

27

Sun, Shimin, Xinchao Zhang, Wentian Huang, Aixin Xu, Xiaofan Wang, and Li Han. "QoS-Based Multicast Routing in Network Function Virtualization-Enabled Software-Defined Mobile Edge Computing Networks." Mobile Information Systems 2021 (April 15, 2021): 1–12. http://dx.doi.org/10.1155/2021/5590963.

Full text

Abstract:

Mobile Edge Computing (MEC) technology brings the unprecedented computing capacity to the edge of mobile network. It provides the cloud and end user swift high-quality services with seamless integration of mobile network and Internet. With powerful capability, virtualized network functions can be allocated to MEC. In this paper, we study QoS guaranteed multicasting routing with Network Function Virtualization (NFV) in MEC. Specifically, data should pass through a service function chain before reaching destinations along a multicast tree with minimal computational cost and meeting QoS requirements. Furthermore, to overcome the problems of traditional IP multicast and software-defined multicasting approaches, we propose an implementable multicast mechanism that delivers data along multicast tree but uses unicast sessions. We finally evaluate the performance of the proposed mechanism based on experimental simulations. The results show that our mechanism outperforms others reported in the literature.

APA, Harvard, Vancouver, ISO, and other styles

28

Wu, Jing Jing, Lei Guo, Wei Gang Hou, and Zhao Long Ning. "Multicast Grooming Algorithms in Waveband Switching Multi-Domain Optical Networks." Advanced Materials Research 433-440 (January 2012): 671–75. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.671.

Full text

Abstract:

In this paper, we study the multicast waveband grooming in multi-domain optical networks and propose three heuristic algorithms, Per-Domain Multicast Grooming (PDMG), Virtual Topology Multicast Grooming (VTMG) and Hierarchical Multi-domain Multicast Grooming (HMMG). Simulation results show that, comparing with PDMG and VTMG, HMMG has the best performance of ports savings and the lowest blocking probability.

APA, Harvard, Vancouver, ISO, and other styles

29

Shi, Lianmin, Yihuai Wang, Zhengqing Wen, and Tao Peng. "Secure Data Delivery with Linear Network Coding for Multiple Multicasts with Multiple Streams in Internet of Things." Security and Communication Networks 2018 (June 13, 2018): 1–13. http://dx.doi.org/10.1155/2018/3729046.

Full text

Abstract:

With the rapid developments of Internet of Things (IoT), tremendous number of sensors are deployed in the environment to monitor and collect different types of information. When a group of sensors located with the same location (or area) should deliver their data to a set of users and they have connected with the same network device, e.g., base station or access point, the data delivery between them and their users can be treated as a single source multicast in the core network from the network device connected with them to the network devices connected with their users. Generally, in such a case, multiple multicast sessions exist in the network simultaneously. In this paper, we study two major considerations, i.e., transmission throughput and information security, for multiple multicasts with multiple streams in IoT by using linear network coding (LNC). Specifically, we jointly consider the transmission rate allocation, transmission topology selection, and secure LNC design for multiple multicasts to maximize the total secure weighted throughput (SWT), which is referred to as the secure delivery for multiple multicasts with multiple streams (SMMS) problem. To this end, we firstly consider the SMMS problem in the case that each sensor is connected with a fixed network device. We then study the SMMS problem when the source of each multicast can be selected from a set of nodes. For the first case, we formulate it to be a linear programming (LP), based on which we give the MORT algorithm to optimally solve it. On the other hand, for the second case, we first formulate it to be an integer linear programming (ILP) and then propose an efficient MBLP algorithm based on linear programming relaxation to obtain a suboptimal solution. Finally, we conduct extensive simulations to show the effectiveness and efficiency of the proposed algorithms.

APA, Harvard, Vancouver, ISO, and other styles

30

Yuan, Peiyan, Ming Li, Shuhong Li, Chunhong Liu, and Xiaoyan Zhao. "Maximizing the Capacity of Edge Networks with Multicasting." Applied Sciences 13, no. 14 (July 21, 2023): 8424. http://dx.doi.org/10.3390/app13148424.

Full text

Abstract:

Edge networks employ local computing and caching resources to process data, thus alleviating the bandwidth pressure on backbone networks and improve users’ quality of experience. System capacity is one of the key metrics to evaluate the performance of edge networks. However, maximizing system capacity in edge scenarios faces challenges due to the dynamical user sessions and the changing content popularity. This study reports on the influence of multicast communication on the capacity of edge caching networks. When large amounts of content are requested simultaneously or over a short period, one-to-one unicast transmission will consume copious network resources due to repetitious transmission. To solve this problem, this study used the one-to-many multicast scheme to realize cooperative transmission between edge servers. First, multiple copies of the content are distributed to multiple small base stations (SBSs) based on the content’s popularity and the SBSs’ cache sizes. Second, a multicast tree is constructed by using, as the root node, the SBS that stores the content. Third, the content is transmitted along the path of the multicast tree to each end-user. Finally, a simulation platform is constructed to analyze the performance of the two transmission schemes. The results of simulating on edge caching networks show that multicast communication responds well to users’ requests even when the requested content requires sudden transmission, is highly popular or is requested often within short time. This system’s capacity has been significantly improved compared to the classical methods.

APA, Harvard, Vancouver, ISO, and other styles

31

REN, YAOZHONG, FRANCIS C. M. LAU, CHI K. TSE, and HAIRONG DONG. "IMPACT OF TOPOLOGY ON THE MAXIMUM MULTICAST THROUGHPUT IN COMMUNICATION NETWORKS WITH NETWORK CODING." International Journal of Bifurcation and Chaos 21, no. 09 (September 2011): 2741–48. http://dx.doi.org/10.1142/s0218127411030088.

Full text

Abstract:

Network coding has been shown to be an effective coding technique to improve the throughput of a multicast session in a communication network. In general, an undirected network can be used to model a communication network in which nodes at both ends of a link can exchange messages. For a single multicast session in an undirected network with network coding, the maximum throughput can be estimated based on the minimum maxflow between the source node and the destination nodes. In this letter, we evaluate the impact of the network topology on the maximum multicast throughput of a network-coded communication network. In particular, the scalefree network, which represents the topology of most man-made networks including the Internet, will be compared with the random network. The maximum throughputs of the multicast sessions are evaluated for different choices of source and destination nodes. It is found that network coding can achieve better throughput of a scalefree network only if the source and destination nodes are chosen from high-degree nodes.

APA, Harvard, Vancouver, ISO, and other styles

32

Matam, Rakesh, and Somanath Tripathy. "Secure Multicast Routing Algorithm for Wireless Mesh Networks." Journal of Computer Networks and Communications 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/1563464.

Full text

Abstract:

Multicast is an indispensable communication technique in wireless mesh network (WMN). Many applications in WMN including multicast TV, audio and video conferencing, and multiplayer social gaming use multicast transmission. On the other hand, security in multicast transmissions is crucial, without which the network services are significantly disrupted. Existing secure routing protocols that address different active attacks are still vulnerable due to subtle nature of flaws in protocol design. Moreover, existing secure routing protocols assume that adversarial nodes cannot share an out-of-band communication channel which rules out the possibility of wormhole attack. In this paper, we propose SEMRAW (SEcure Multicast Routing Algorithm for Wireless mesh network) that is resistant against all known active threats including wormhole attack. SEMRAW employs digital signatures to prevent a malicious node from gaining illegitimate access to the message contents. Security of SEMRAW is evaluated using the simulation paradigm approach.

APA, Harvard, Vancouver, ISO, and other styles

33

Guo, Yang, Yong Gang Ji, and Jia Xu. "Study on Utility Maximization Effectiveness in Packet Network Coding." Applied Mechanics and Materials 182-183 (June 2012): 2091–94. http://dx.doi.org/10.4028/www.scientific.net/amm.182-183.2091.

Full text

Abstract:

In this paper, the coding for multicast packet network call, the network utility maximiza- tion problem, when multicast call, given coding subgraph case modeling, Coded packet networks set up to maximize the effectiveness of modeling .Then use the duality theory, the distributed gradient projection algorithm that can solve the problem of modeling the network utility maximization

APA, Harvard, Vancouver, ISO, and other styles

34

Jiang, Ding De, Ya Li, Wei Han Zhang, Wen Pan Li, and Chun Ping Yao. "A Network Coding-Based Energy-Efficient Multicast Routing in Multi-Hop Wireless Networks." Advanced Materials Research 765-767 (September 2013): 1775–79. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1775.

Full text

Abstract:

In this paper, an energy-efficient multicast routing algorithm in multi-hop wireless networks is proposed aiming at new generation wireless communications. Different from the previous methods, this paper targets maximizing the energy efficiency of networks. In order to get the optimal energy efficiency to build the network multicast route, our proposed method tries to maximize the network throughput and minimize the network energy consumption by exploiting network coding and sleeping scheme. Simulation results show that the proposed algorithm has better energy efficiency and performance improvements comparing with the existing methods.

APA, Harvard, Vancouver, ISO, and other styles

35

DUATO, JOSÉ. "ON THE DESIGN OF DEADLOCK-FREE ADAPTIVE MULTICAST ROUTING ALGORITHMS." Parallel Processing Letters 03, no. 04 (December 1993): 321–33. http://dx.doi.org/10.1142/s0129626493000368.

Full text

Abstract:

Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. Two multicast wormhole routing methods have been presented in [13] for multicomputers with 2D-mesh and hypercube topologies. Also, a theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in [7, 8]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. This paper analyses the additional channel dependencies produced by multicast routing algorithms on wormhole networks. Then, the theory proposed in [7, 8] is extended by considering them. As an example, the multicast routing algorithms presented in [13] are extended, taking advantage of the alternative paths offered by the network.

APA, Harvard, Vancouver, ISO, and other styles

36

Kou, Wenlong, Wei You, Sheng Li, Xiaoping Shi, Ruhui Ma, and Chao Guo. "An Efficient Authentication and Key Distribution Protocol for Multicast Service in Space-Ground Integration Network." Security and Communication Networks 2022 (March 28, 2022): 1–14. http://dx.doi.org/10.1155/2022/2200546.

Full text

Abstract:

Satellite communication technology has attracted the attention of researchers in the study of the sixth-generation (6G) mobile communication network because of its advantages of achieving global coverage with high cost-effectiveness and not being affected by terrain factors and human activities. In order to achieve efficient interconnection between terminals and networks, it is a new development trend of communication technology to integrate satellite communication networks and ground communication networks to construct the Space-Ground Integration Network (SGIN). Multicast service is widely used by network service providers to provide business services to users. Due to the characteristics of higher delay of space communication and unstable link compared with the ground network, if the ground multimedia multicast security protocol is directly applied to the space communication, it is difficult to guarantee the efficiency of the corresponding business service. The existing security protocols in the space information network are usually designed to ensure the security of end-to-end communication, and there are few studies on the security of multimedia multicast services. In view of the above situation, we design a new multicast service security protocol for the SGIN to realize the secure and efficient transmission in multicast services. In the protocol, we first design a key derivation scheme for the shared key between UE and BM-SC based on the existing 5G-AKA mechanism. Then, we propose a group-based multicast service registration mechanism. Finally, we propose a secure and efficient key distribution and update process of multicast service group key based on China Remainder Theorem (CRT). The formal verification tool Scyther is employed to analyze the security of the proposed protocol, and the results show that our scheme has valid security properties. We analyze the performance of the scheme by comparing it with the existing schemes in three aspects, such as signaling overhead, computational overhead, and bandwidth overhead. The comparison results show that our scheme is superior to other existing schemes. Finally, we build an experimental environment and test the delay, transmission rate, and CPU usage of the proposed system. The results show that our scheme improves the efficiency of multicast services while ensuring network security.

APA, Harvard, Vancouver, ISO, and other styles

37

Lee, Sang Hyun, and Sriram Vishwanath. "Distributed Rate Allocation for Network-Coded Multicast Networks." IEEE Communications Letters 17, no. 11 (November 2013): 2204–7. http://dx.doi.org/10.1109/lcomm.2013.100913.131615.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Chi, Kaikai, Xiaohong Jiang, Susumu Horiguchi, and Minyi Guo. "Topology Design of Network-Coding-Based Multicast Networks." IEEE Transactions on Parallel and Distributed Systems 19, no. 5 (May 2008): 627–40. http://dx.doi.org/10.1109/tpds.2007.70743.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Chi, Kaikai, Xiaohong Jiang, and Susumu Horiguchi. "Network coding-based reliable multicast in wireless networks." Computer Networks 54, no. 11 (August 2010): 1823–36. http://dx.doi.org/10.1016/j.comnet.2010.02.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Jiang, Dexia, and Leilei Li. "Node Selection Algorithm for Network Coding in the Mobile Wireless Network." Symmetry 13, no. 5 (May 10, 2021): 842. http://dx.doi.org/10.3390/sym13050842.

Full text

Abstract:

In the multicast network, network coding has proven to be an effective technique to approach maximum flow capacity. Although network coding has the advantage of improving performance, encoding nodes increases the cost and delay in wireless networks. Therefore, minimizing encoding nodes is of great significance to improve the actual network’s performance under a maximum multicast flow. This paper seeks to achieve partial improvements in the existing selection algorithm of encoding nodes in wireless networks. Firstly, the article gives the condition for an intermediate node to be an encoding node. Secondly, a maximum flow algorithm, which depends on the depth-first search method, is proposed to optimize the search time by selecting the larger augmentation flow in each step. Finally, we construct a random graph model to simulate the wireless network and the maximum multicast flow algorithm to analyze the statistical characteristics of encoding nodes. This paper aims at the optimization to find the minimal number of required coding nodes which means the minimum energy consumption. Meanwhile, the simulations indicate that the curve of coding nodes tends to be a geometric distribution, and that the curve of the maximum flow tends to be symmetric as the network scale and the node covering radius increase.

APA, Harvard, Vancouver, ISO, and other styles

41

Sun, Baolin, Chao Gui, Qifei Zhang, and Hua Chen. "Fuzzy Controller Based QoS Routing Algorithm with a Multiclass Scheme for MANET." International Journal of Computers Communications & Control 4, no. 4 (December 1, 2009): 427. http://dx.doi.org/10.15837/ijccc.2009.4.2458.

Full text

Abstract:

A mobile ad hoc network (MANET) consists of a set of mobile hosts that can communicate with each other without the assistance of base stations. Due to the dynamic nature of the network topology and restricted resources, quality of service (QoS) and multicast routing in MANET are challenging tasks which attract the interests of many people. In this paper, we present a fuzzy controller based QoS routing algorithm with a multiclass scheme (FQRA) in mobile ad hoc networks. The performance of this scheduler is studied using NS2 (Network Simulator version 2) and evaluated in terms of quantitative measures such as packet delivery ratio, path success ratio and average end-to-end delay. Simulations show that the approach is efficient, promising and applicable in ad hoc networks.

APA, Harvard, Vancouver, ISO, and other styles

42

Tian, Zhenyu, Jiali You, and Linlin Hu. "A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method." Future Internet 15, no. 5 (April 23, 2023): 156. http://dx.doi.org/10.3390/fi15050156.

Full text

Abstract:

Network layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining a multicast group, a group member first sends a request to a designated router (DR). Then, the DR selects a node in the existing multicast tree (known as a multicast joining node, or MJN) to establish a multicast distribution path from the MJN to itself. The MJN selection method runs on the DR and has a significant impact on the distribution of the multicast tree, that directly affects the load distribution in the network. However, the current MJN selection method cannot effectively detect the load status of the downlink multicast path in the case of asymmetric routing, leading to network congestion and limiting the number of multicast groups that the network can accommodate (multicast capacity). To solve this problem, we propose an MJN selection method based on the reverse shortest path tree (RSPT). RSPT can effectively detect the load status of downlink multicast paths in case of routing asymmetry. Based on the detection results of RSPT, DR can select the MJN with the lowest path load to join the multicast tree. Our experimental results indicate that compared to existing multicast methods, our method has a lower cost and delay, and can effectively balance the network load in the case of asymmetric routing, increasing multicast capacity by more than two times.

APA, Harvard, Vancouver, ISO, and other styles

43

Zhu, Yun, Jie Gao, Xue Qiong Zhang, and Fan Wang. "Outage Probability Analysis for Opportunistic Network-Coded Cooperative Multicast Transmission in Clustered Wireless Sensor Networks." Advanced Materials Research 756-759 (September 2013): 1418–22. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1418.

Full text

Abstract:

Cluster-based protocols attempt to solve this problem by load balancing within the cluster and rotating the job of cluster head every few rounds in wireless sensor networks. In this paper, we derive the formulation of the outage probability for opportunistic network-coded cooperative multicast schemes. Simulation results show that our approach can remarkably improve the performance of outage probability than direct multicast.

APA, Harvard, Vancouver, ISO, and other styles

44

Ou, Kaiqian, Yinlong Xu, Xiumin Wang, and Wang Liu. "Utility-Based Joint Routing, Network Coding, and Power Control for Wireless Ad Hoc Networks." International Journal of Digital Multimedia Broadcasting 2011 (2011): 1–12. http://dx.doi.org/10.1155/2011/786915.

Full text

Abstract:

Energy saving and high delivery reliability are two essential metrics in wireless ad hoc networks. In this paper, we propose a joint power control and network coding (PCNC) scheme which regulates the transmission power to reduce the overall energy usage and uses network coding to improve reliability by reducing the number of packet retransmissions. To argue for PCNC scheme, we investigate both unicast and multicast routing scenarios. To evaluate routing optimality, we adopt expected utility as a metric, which integrates energy cost, reliability, and benefit value. Based on the expected utility, we explore the optimality in both unicast and multicast routing. For unicast routing, we propose an optimal algorithm. We show the NP-hardness of multicast routing problem, and also design a heuristic solution. Results from simulations demonstrate that PCNC improves the performance in terms of expected utility compared with existing techniques.

APA, Harvard, Vancouver, ISO, and other styles

45

Lin, X., and L. M. Ni. "Multicast communication in multicomputer networks." IEEE Transactions on Parallel and Distributed Systems 4, no. 10 (1993): 1105–17. http://dx.doi.org/10.1109/71.246072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Yuanyuan Yang, Jianchao Wang, and Chunming Qiao. "Nonblocking WDM multicast switching networks." IEEE Transactions on Parallel and Distributed Systems 11, no. 12 (2000): 1274–87. http://dx.doi.org/10.1109/71.895793.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

De Marco, Gianluca, Luisa Gargano, and Ugo Vaccaro. "Concurrent multicast in weighted networks." Theoretical Computer Science 259, no. 1-2 (May 2001): 359–77. http://dx.doi.org/10.1016/s0304-3975(00)00018-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Yuanyuan Yang and Jianchao Wang. "Nonblocking k-fold multicast networks." IEEE Transactions on Parallel and Distributed Systems 14, no. 2 (February 2003): 131–41. http://dx.doi.org/10.1109/tpds.2003.1178877.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Maier, Guido, and Achille Pattavina. "Multicast three-stage Clos networks." Computer Communications 33, no. 8 (May 2010): 923–28. http://dx.doi.org/10.1016/j.comcom.2010.01.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Maxemchuk, N. F. "Video distribution on multicast networks." IEEE Journal on Selected Areas in Communications 15, no. 3 (April 1997): 357–72. http://dx.doi.org/10.1109/49.564134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Multicast Networks'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles