Artigos de revistas: "Communication multicast"

1

Maihöfer, Christian. "Multicast Communication". Computer Communications 25, n.º 3 (fevereiro de 2002): 342. http://dx.doi.org/10.1016/s0140-3664(01)00343-7.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Jafary, Peyman, Antti Supponen e Sami Repo. "Network Architecture for IEC61850-90-5 Communication: Case Study of Evaluating R-GOOSE over 5G for Communication-Based Protection". Energies 15, n.º 11 (25 de maio de 2022): 3915. http://dx.doi.org/10.3390/en15113915.

Texto completo da fonte

Resumo:

The smart grid includes wide-area applications in which inter-substation communication is required to realize innovative monitoring, protection, and control solutions. Internet-based data exchange, i.e., communication over Internet Protocol (IP), is regarded as the latest trend for inter-substation communication. Interoperability can be achieved via the use of standardized IEC 61850-90-5 messages communicating over IP. Wide-area applications can obtain benefits from IP-multicast technologies and use a one-to-many communication model among substations communicating across a communication network. Cellular Internet is being considered as a potential cost-efficient solution which can be used for the IP-multicast communication. However, it requires knowledge of communicating uncommon IP-multicast traffic over the Internet. Moreover, it presents challenges in terms of cybersecurity and real-time requirements. These challenges must be overcome to realize authentic and correct operation of the wide-area applications. There is thus a need to examine communication security and to evaluate if the communication network characteristics satisfy the application real-time requirement. This paper investigates the secure communication of IEC61850-90-5 multicast messages over the public communication network and proposes two network architectures using the Generic Routing Encapsulation (GRE) tunnel and multipoint GRE (mGRE) within Dynamic Multipoint VPN (DMVPN). Additionally, this paper evaluates the feasibility of cellular (5G and 4G) Internet for the communication of multicast Routable Generic Object Oriented Substation Events (R-GOOSE) messages in wide-area protection applications. For this purpose, we introduce a lab setup to experiment the transmission of R-GOOSE messages within the proposed network architectures. The lab setup contains both software and hardware components. A software application is developed to publish multicast R-GOOSE with a fresh timestamp acquired from time synchronization equipment. These messages are transmitted over the Internet by computer networking devices that support cellular communication. The communication latency of the transmitted messages is measured and analyzed statistically. The statistical analysis results are discussed to evaluate performance of R-GOOSE over cellular Internet for two communication-based protection applications: Logic Selectivity and Loss-of-Main protection schemes.

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

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

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

YANG, C. S., Y. M. TSAI e C. Y. LIU. "PERFORMANCE EVALUATION OF MULTICAST WORMHOLE ROUTING IN 2D-TORUS MULTICOMPUTERS". Parallel Processing Letters 02, n.º 02n03 (setembro de 1992): 161–70. http://dx.doi.org/10.1142/s0129626492000283.

Texto completo da fonte

Resumo:

Most recently, multicast communication has been included in multicomputer systems. Multicast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. The performance of multicomputers is highly dependent on the message routing scheme and the communication mechanism. Wormhole routing is the most promising switching technique used in the new generation multicomputers. In this paper, we propose a multicast wormhole routing algorithm for 2D-torus multicomputers. The multicast routing algorithm is based on a path-like routing scheme and offers deadlock-free routing. Our simulation which compared the 2D-mesh multicomputers shows that the multipath routing algorithm for 2D-torus multicomputers can reduce the communication traffic and the maximum distance in multicast communication.

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Wang, Hao, e Ling Wu. "Design and Simulation of Multicast Communication Model Based on 2D Torus Network on Chip". Advanced Materials Research 630 (dezembro de 2012): 276–82. http://dx.doi.org/10.4028/www.scientific.net/amr.630.276.

Texto completo da fonte

Resumo:

In order to avoid the deadlock and high transmission delay of network on chip in multicast communication, this paper put forward a solution of multicast communication model. First, the author carried out a formalized description for the multicast communication model. Secondly, illustrate the deadlock caused by the loop circuit waiting. To solve this problem, the NOC multicast communication model was proposed based on the 2D Torus topology. In addition, this paper also presented an example to validate its correctness. Finally, simulate and apply this model simulation to the NOC of 2D Torus topology structure by the OPNET Modeler. The test results show that this multicast communication model has lower transmission delay and higher throughput volume compared with the unicast routing strategy using XY routing.

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Fourour, Said, e Yahia Lebbah. "Equitable Optimization for Multicast Communication". International Journal of Decision Support System Technology 12, n.º 3 (julho de 2020): 1–25. http://dx.doi.org/10.4018/ijdsst.2020070101.

Texto completo da fonte

Resumo:

Multicast communication is characterized by the multiplicity of streams defining different groups, where each stream has multiple sources. A multicast communication tends to flood the network with a large number of flows that can overload some nodes and unload others. This imbalance in the load distribution weakens network performance and could produce bottlenecks around overloaded nodes. We propose in this article an approach based on a combination of a flow approach and a multi-agent optimization to resolve the load balancing issue of multicast communication. We use ordered weighted average (OWA), a multi-criteria optimization method, to balance the degree of the nodes, ensuring a balanced load distribution across the network. The experiments conducted on a series of networks show that our approach provides a better equitable load assignment.

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Frank, A. J., L. D. Wittie e A. J. Bernstein. "Multicast Communication on Network Computers". IEEE Software 2, n.º 3 (maio de 1985): 49–61. http://dx.doi.org/10.1109/ms.1985.230701.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Garcia-Molina, Hector, e AnneMarie Spauster. "Ordered and reliable multicast communication". ACM Transactions on Computer Systems (TOCS) 9, n.º 3 (agosto de 1991): 242–71. http://dx.doi.org/10.1145/128738.128741.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Kompella, V. P., J. C. Pasquale e G. C. Polyzos. "Multicast routing for multimedia communication". IEEE/ACM Transactions on Networking 1, n.º 3 (junho de 1993): 286–92. http://dx.doi.org/10.1109/90.234851.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Arepalli, Gopi, e Suresh Babu Erukula. "Secure Multicast Routing Protocol in Manets Using Efficient ECGDH Algorithm". International Journal of Electrical and Computer Engineering (IJECE) 6, n.º 4 (1 de agosto de 2016): 1857. http://dx.doi.org/10.11591/ijece.v6i4.9941.

Texto completo da fonte

Resumo:

An Ad-hoc Network covers a set of autonomous mobile nodes that communicates through wireless communication in an infrastructure-less environment. Mostly MANETs are used in group communication mechanisms like military applications, emergency search, rescue operations, vehicular ad-hoc communications and mining operations etc. In such type of networks, group communication is takes place by multicasting technique. Communication and collaboration is necessary among the nodes in the groups in multicast protocols. PUMA has the best multicast routing protocol compared to tree and mesh based multicast protocols although it suffers from security issues. PUMA mainly suffers from Man In The middle attack. MITM attack generates traffic flow, drop the packets and miscommunicate the neighbor nodes with false hop count. So defending from MITM attack we designed a new mechanism called Elliptic Curve Group Diffie-Hellman (ECGDH). This paper compares results of PUMA [1] routing protocol with legitimate, under attack and after providing security against attack. Finally we observed ECGDH [2] gives efficient results even attack has happened.

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Arepalli, Gopi, e Suresh Babu Erukula. "Secure Multicast Routing Protocol in Manets Using Efficient ECGDH Algorithm". International Journal of Electrical and Computer Engineering (IJECE) 6, n.º 4 (1 de agosto de 2016): 1857. http://dx.doi.org/10.11591/ijece.v6i4.pp1857-1865.

Texto completo da fonte

Resumo:

An Ad-hoc Network covers a set of autonomous mobile nodes that communicates through wireless communication in an infrastructure-less environment. Mostly MANETs are used in group communication mechanisms like military applications, emergency search, rescue operations, vehicular ad-hoc communications and mining operations etc. In such type of networks, group communication is takes place by multicasting technique. Communication and collaboration is necessary among the nodes in the groups in multicast protocols. PUMA has the best multicast routing protocol compared to tree and mesh based multicast protocols although it suffers from security issues. PUMA mainly suffers from Man In The middle attack. MITM attack generates traffic flow, drop the packets and miscommunicate the neighbor nodes with false hop count. So defending from MITM attack we designed a new mechanism called Elliptic Curve Group Diffie-Hellman (ECGDH). This paper compares results of PUMA [1] routing protocol with legitimate, under attack and after providing security against attack. Finally we observed ECGDH [2] gives efficient results even attack has happened.

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Carlier, Matthias, Kris Steenhaut e An Braeken. "Symmetric-Key-Based Security for Multicast Communication in Wireless Sensor Networks". Computers 8, n.º 1 (19 de março de 2019): 27. http://dx.doi.org/10.3390/computers8010027.

Texto completo da fonte

Resumo:

This paper presents a new key management protocol for group-based communications in non-hierarchical wireless sensor networks (WSNs), applied on a recently proposed IP-based multicast protocol. Confidentiality, integrity, and authentication are established, using solely symmetric-key-based operations. The protocol features a cloud-based network multicast manager (NMM), which can create, control, and authenticate groups in the WSN, but is not able to derive the actual constructed group key. Three main phases are distinguished in the protocol. First, in the registration phase, the motes register to the group by sending a request to the NMM. Second, the members of the group calculate the shared group key in the key construction phase. For this phase, two different methods are tested. In the unicast approach, the key material is sent to each member individually using unicast messages, and in the multicast approach, a combination of Lagrange interpolation and a multicast packet are used. Finally, in the multicast communication phase, these keys are used to send confidential and authenticated messages. To investigate the impact of the proposed mechanisms on the WSN, the protocol was implemented in ContikiOS and simulated using COOJA, considering different group sizes and multi-hop communication. These simulations show that the multicast approach compared to the unicast approach results in significant smaller delays, is a bit more energy efficient, and requires more or less the same amount of memory for the code.

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Jain, Rituraj, e Manish Varshney. "A Critical Study on Group Key Management Protocols and Security Aspects For Non-Networks". Journal of Applied Engineering and Technological Science (JAETS) 4, n.º 2 (5 de junho de 2023): 783–94. http://dx.doi.org/10.37385/jaets.v4i2.1947.

Texto completo da fonte

Resumo:

The rise in internet usage and advanced communication systems has led to an increase in security issues. The need for more robust and flexible secure communication has led to the introduction of mobile non-network multicast communication systems like MANET or VANET. Multicasting is increasingly being used for group-oriented applications such as video conferencing, interactive games, TV over Internet, e-learning, etc. To address the security concerns, this paper highlighted the confidentiality, authentication, and access control for non-network multicast communication systems like MANET or VANET. For this, paper explores the group key management protocols. The paper concluded that centralized and asymmetric group key management protocol (GKMP) is most effective for designing secure, and efficient communication models for non-networks. The key findings of the paper are that in group key management protocols (GKMPs) for multicast communication systems adoption of asymmetric GKMPs provides better security, and reduces computational overhead. Therefore, this paper help to improve the robustness and security of multicast communication systems and meet the growing demands of group-oriented applications over the internet.

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Choi, Won Hyuck, e Min Seok Jie. "A Study on the Use of Multicast Protocol Traffic Overload for Active Network". Applied Mechanics and Materials 339 (julho de 2013): 323–28. http://dx.doi.org/10.4028/www.scientific.net/amm.339.323.

Texto completo da fonte

Resumo:

Multicast requires reliability in one-to-one or multi-counterpart communication services and such demand for reliability becomes more and more an important factor to manage the whole network. In addition, it requires link of broadband network, real-time transmission, and much effective multicast protocol in order to support application of multimedia that has become a dominant figure recently. Communication method for multicast is a way of communication for a transmitter that provides multicast data to every registered member in the transmitters group, and it can be classified into the traditional and the reliable communication methods in general. The traditional communication method is very fast in connection but quality of service is poor. In contrast, the reliable communication method provides good quality in service but its speed is somewhat poor. Thus to enhance such demerits, this thesis proposes communication method of multicast by using active network method. In this thesis, a fair and practical bandwidth is used for data packet transmission along with the use of active network. The bandwidth and data processing capability filters out the transmitted data from an active router through transmission packet and upgrades multimedia data packet more effectively. Therefore, recipients in various levels receive the effective data packet and based on these facts, the study actualizes and evaluates efficiency of a router, which is able to transmit the fair bandwidth from active router in a simulation.

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Manjul, Manisha, e Rajesh Mishra. "Multiple Operations for Secure Multicast Communication". International Journal of Computer Applications 86, n.º 7 (16 de janeiro de 2014): 26–30. http://dx.doi.org/10.5120/14998-3077.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Uyoata, Uyoata, Joyce Mwangama e Mqhele Dlodlo. "Robust beamforming for D2D multicast communication". Physical Communication 43 (dezembro de 2020): 101217. http://dx.doi.org/10.1016/j.phycom.2020.101217.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Hughes, Larry. "Gateway designs for internetwork multicast communication". Computer Communications 12, n.º 3 (junho de 1989): 123–30. http://dx.doi.org/10.1016/0140-3664(89)90108-4.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Shrimpton, David H., e Christopher S. Cooper. "Multicast communication on the Unison network". Computer Communications 13, n.º 8 (outubro de 1990): 460–68. http://dx.doi.org/10.1016/0140-3664(90)90129-5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Biswas, Pratik K. "A Formal Framework for Multicast Communication". IEEE Systems Journal 4, n.º 3 (setembro de 2010): 353–62. http://dx.doi.org/10.1109/jsyst.2010.2050364.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Lashkari, Yezdezard, Viswanath Ramachandran, Sanjay Malpani e S. L. Mehndiratta. "Vartalaap: A distributed multicast communication system". Software: Practice and Experience 23, n.º 7 (julho de 1993): 799–811. http://dx.doi.org/10.1002/spe.4380230707.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Xu, Haishui, Xianji Li e Richard W. Nau. "Performance of multicast communication on hypercubes". Journal of Computer Science and Technology 8, n.º 4 (outubro de 1993): 374–78. http://dx.doi.org/10.1007/bf02939546.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Mckinley, P. K. "Multicast Communication in Staircase Multichannel Networks". Journal of Parallel and Distributed Computing 23, n.º 1 (outubro de 1994): 60–71. http://dx.doi.org/10.1006/jpdc.1994.1119.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

BONASTRE, O. M., S. NEVILLE e C. E. PALAU. "MULTICAST CONGESTION CONTROL SRMSH APPROACH USING COMMUNICATING REAL-TIME STATE MACHINES". International Journal of Bifurcation and Chaos 20, n.º 09 (setembro de 2010): 2965–73. http://dx.doi.org/10.1142/s0218127410027519.

Texto completo da fonte

Resumo:

New real-time applications frequently involve timing constraints related to accurate services from communication protocols. Concretely, real-time communication protocols utilize timers to implement these constraints between system event occurrences. In this context, the study of congestion control for Internet reliable multicast is at present an active research field related to real-time protocols. In this paper, the authors present an innovative real-time transport protocol named Scalable Reliable Multicast Stair Hybrid (SRMSH) as new hybrid multiple layer mechanism for multicast congestion control providing detection and recovery loss. This work is focused on formal specification of SRMSH approach using Communicating Real-Time State Machines as a formal method. Besides, SRMSH validation is presented within a formal proof framework in order to check the functional safety and liveness properties. As a result, authors outline a dynamical system framework in order to model behavior of their presented solution.

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Geithner, Thomas, e Fikret Sivrikaya. "Transmission Rate Sampling and Selection for Reliable Wireless Multicast". Wireless Communications and Mobile Computing 2020 (29 de setembro de 2020): 1–22. http://dx.doi.org/10.1155/2020/8850198.

Texto completo da fonte

Resumo:

The multicast communication concept offers a scalable and efficient method for many classes of applications; however, its potential remains largely unexploited when it comes to link-layer multicasting in wireless local area networks. The fundamental lacking feature for this is a transmission rate control mechanism that offers higher transmission performance and lower channel utilization, while ensuring the reliability of wireless multicast transmissions. This is much harder to achieve in a scalable manner for multicast when compared with unicast transmissions, which employs explicit acknowledgment mechanisms for rate control. This article introduces EWRiM, a reliable multicast transmission rate control protocol for IEEE 802.11 networks. It adapts the transmission rate sampling concept to multicast through an aggregated receiver feedback scheme and combines it with a sliding window forward error correction (FEC) mechanism for ensuring reliability at the link layer. An inherent novelty of EWRiM is the close interaction of its FEC and transmission rate selection components to address the performance-reliability tradeoff in multicast communications. The performance of EWRiM was tested in three scenarios with intrinsically different traffic patterns; namely, music streaming scenario, large data frame delivery scenario, and an IoT scenario with frequent distribution of small data packets. Evaluation results demonstrate that the proposed approach adapts well to all of these realistic multicast traffic scenarios and provides significant improvements over the legacy multicast- and unicast-based transmissions.

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Matam, Rakesh, e 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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Wu, Dan, Yuqi Fei, Jianbang Gao, Fei Wang e Guowang Gao. "Large-Scale Multicast Group Secure Transmission Scheme Based on Multi-Carrier FDA". Sensors 23, n.º 23 (23 de novembro de 2023): 9358. http://dx.doi.org/10.3390/s23239358.

Texto completo da fonte

Resumo:

Aiming at the problem that the traditional physical layer technology cannot realize secure transmission due to the large number of users and wide dispersion in the multicast system, a layered transmission method is proposed, and a scheme for the secure transmission of the multicast group physical layer is designed. Firstly, the hierarchical transmission system model is established. Then, the array weighted vector of each layer is optimized according to the design criterion of maximizing the artificial noise interference power. At the same time, in the case where the number of users in a single multicast group is greater than the number of transmitting antennas, a multicast grouping strategy is introduced, and the singular value decomposition and Lagrange multiplier algorithms are utilized to obtain the optimal solution. Simulation results show that the proposed method can realize the secure communication of users with different distances in the same direction and can distinguish the multicast users with the same direction angle and different distances under the premise of mutual non-interference, thus realizing the secure communication of large-scale multicast users.

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Et.al, M. Satish Kumar. "Multicast Through Device to Device Communication using Enhanced Diffie-Hellman Algorithm". Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, n.º 3 (11 de abril de 2021): 3594–96. http://dx.doi.org/10.17762/turcomat.v12i3.1638.

Texto completo da fonte

Resumo:

The mobile device demand has been increased and it is estimated that in upcoming 10 years, the wireless cellular demand will increase up to 500 times. And it is not possible only with the cellular networks to satisfy this huge demand. To meet the huge requirement from the mobile end user, 5G networks enabled device to device communication can be applied. Device to Device (D2D) connection is the direct link among the two devices without the intervention of main station. Thus, D2D reduces the latency. And 5G are supported for the high data rates. Furthermore, for efficient transmission, multicast device to device communication is used. Multicast distrubutes the messages to multiple users of the restricted geographical area. Trustworthy communication is necessary for multicast D2D communication. Enhanced Diffie-Hellman algorithm is used for the trustworthiness.

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Senthamarai, N., e M. Vijayalakshmi. "Multicast Utility Maximization with Load Balanc-ing in Private Cloud Environment". International Journal of Engineering & Technology 7, n.º 2.19 (17 de abril de 2018): 12. http://dx.doi.org/10.14419/ijet.v7i2.19.12099.

Texto completo da fonte

Resumo:

Multicast is a technique for one-to-many communication over the network. It plays important role in cloud computing and reduces the transmission overhead in the private cloud environment. In this paper, build an efficient multicast tree for the multicast routing problem in which a network consists of different categories of nodes, where each category can have one or more nodes of the same characteristic which is different from the characteristics of nodes from other categories. So it is used to reduce the message traffic in such a network, to build a multicast tree and minimize the queuing delay using multicast selection algorithm.

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Fujita, Satoshi. "Optimal Neighborhood Broadcast in Star Graphs". Journal of Interconnection Networks 04, n.º 04 (dezembro de 2003): 419–28. http://dx.doi.org/10.1142/s0219265903000957.

Texto completo da fonte

Resumo:

In this paper, we consider the problem of constructing a multicast tree in star interconnection networks under the single-port communication model. Unlike previous schemes for constructing space-efficient multicast trees, we adopt the completion time of each multicast as the objective function to be minimized. In particular, we study a special case of the problem in which all destination vertices are immediate neighbors of the source vertex, and propose a multicast scheme of [Formula: see text] time units for the star graph of dimension n.

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

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

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Liu, Dongsheng, Sai Zhao, Quanzhong Li e Jiayin Qin. "Rate Maximization for Suspicious Multicast Communication Networks with Full-Duplex Proactive Monitoring". Mobile Information Systems 2020 (10 de julho de 2020): 1–6. http://dx.doi.org/10.1155/2020/7847623.

Texto completo da fonte

Resumo:

In this paper, we investigate the optimization of the monitoring rate for a suspicious multicast communication network with a legitimate full-duplex (FD) monitor, where the FD monitor is proactive to jam suspicious receivers and eavesdrop from the suspicious transmitter simultaneously. To effectively monitor the suspicious communication over multicast networks, we maximize the monitoring rate under the outage probability constraint of the suspicious multicast communication network and the jamming power constraint at the FD monitor. The formulated optimization problem is nonconvex, and its global optimal solution is hard to obtain. Thus, we propose a constrained concave convex procedure- (CCCP-) based iterative algorithm, which is able to achieve a local optimal solution. Simulation results demonstrate that the proposed proactive eavesdropping scheme with optimal jamming power outperforms the conventional passive eavesdropping scheme.

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Nekovee, Maziar, Marinho P. Barcellos e Michael Daw. "Reliable multicast for the Grid: a case study in experimental computer science". Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 363, n.º 1833 (18 de julho de 2005): 1775–91. http://dx.doi.org/10.1098/rsta.2005.1606.

Texto completo da fonte

Resumo:

In its simplest form, multicast communication is the process of sending data packets from a source to multiple destinations in the same logical multicast group. IP multicast allows the efficient transport of data through wide-area networks, and its potentially great value for the Grid has been highlighted recently by a number of research groups. In this paper, we focus on the use of IP multicast in Grid applications, which require high-throughput reliable multicast. These include Grid-enabled computational steering and collaborative visualization applications, and wide-area distributed computing. We describe the results of our extensive evaluation studies of state-of-the-art reliable-multicast protocols, which were performed on the UK's high-speed academic networks. Based on these studies, we examine the ability of current reliable multicast technology to meet the Grid's requirements and discuss future directions.

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Banerjee, S., e B. Bhattacharjee. "Scalable secure group communication over IP multicast". IEEE Journal on Selected Areas in Communications 20, n.º 8 (outubro de 2002): 1511–27. http://dx.doi.org/10.1109/jsac.2002.803986.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Clark, Russell J., e Mostafa H. Ammar. "Providing scalable Web services using multicast communication". Computer Networks and ISDN Systems 29, n.º 7 (agosto de 1997): 841–58. http://dx.doi.org/10.1016/s0169-7552(97)00005-6.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Wang, Junxing, Zhigang Chen e Yuan Yao. "Energy-efficient Relay Selection for Multicast Communication". AASRI Procedia 5 (2013): 98–105. http://dx.doi.org/10.1016/j.aasri.2013.10.064.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Rajagopalan, Bala. "Reliability and scaling issues in multicast communication". ACM SIGCOMM Computer Communication Review 22, n.º 4 (outubro de 1992): 188–98. http://dx.doi.org/10.1145/144191.144275.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Tahir, Muhammad Atif, Asif Jamshed, Habib-ur Rehman e Yassine Daadaa. "Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees". Journal of Intelligent Systems 24, n.º 4 (1 de dezembro de 2015): 479–89. http://dx.doi.org/10.1515/jisys-2014-0043.

Texto completo da fonte

Resumo:

AbstractIn a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Qi, Fei, Xuetian Zhu, Xinran Zhang e Songlin Sun. "Hybrid Multicast Transmission for Public Safety Network in 5G". Mobile Information Systems 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/4306356.

Texto completo da fonte

Resumo:

We investigate the application of wireless multicast technology in public safety network (PSN) in future wireless communication system. The hybrid unicast/multicast transmission system is proposed and analyzed in 3D massive multi-input multioutput (MIMO) channel. The mutual coupling channel model is adopted under the different antenna array configuration scenarios. The proposed hybrid system adopts multicast beamforming in the multicast groups as well as multiuser-MIMO (MU-MIMO) linear precoding in the unicast group to increase system throughput. The null space method based interference cancellation is further performed between each group to eliminate signal leakage generated from each group. Comparisons between two types of antenna array configurations, different channel models, linear precoding as well as multicast beamforming, and user grouping strategies for multicast services are presented and analyzed by simulation.

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Xu, Yanli. "A Device-to-Device Multicast Scheme for Delay-Constraint Content Delivery". Mobile Information Systems 2017 (2017): 1–12. http://dx.doi.org/10.1155/2017/8012517.

Texto completo da fonte

Resumo:

Motivated by the explosive increase of mobile traffic, study on the device-to-device (D2D) communication is kicked off for content delivery through proximal transmission among users. D2D multicast has advantage on serving multiple users simultaneously with less resource cost. However, when D2D multicast is appropriate for content delivery and how to make it serve delay-constraint traffic are still unclear. In this paper, parameters impacting on D2D multicast content delivery is investigated to find good chances for utilizing D2D multicast. Furthermore, some rules to be obeyed are proposed for the content caching and delivery of D2D multicast to satisfy delay constraints. Based on these analyses, a delay-aware multicast scheme is proposed to maximize the network performance utility while satisfying delay constraints of contents. Simulations results verify our analyses and show that the proposed scheme can significantly improve multicast efficiency with guaranteed delay.

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Li, Bo, Jinlin Wang, Xiaoyong Zhu, Jiali You e Linlin Hu. "An Adaptive Hierarchical Hybrid Multicast Based on Information-Centric Networking". Electronics 10, n.º 23 (2 de dezembro de 2021): 3002. http://dx.doi.org/10.3390/electronics10233002.

Texto completo da fonte

Resumo:

Many information-centric services have emerged, such as IPTV and video conferencing. These services put a lot of demands on scalable multicast communication. However, traditional IP multicast has low adoption because of its poor scalability. Therefore, some stateless multicast methods were proposed, which encapsulate the destination’s information into the packet header without requiring routers to maintain the multicast forwarding state. However, stateless multicast also faces some problems, such as ingress router overload, high forwarding overhead, packet redundancy, etc. In addition, most multicast methods cannot optimize the multicast tree because the multicast flow is simply forwarded along the shortest path tree from the source to receivers. This paper proposes an Adaptive Hierarchical Hybrid Multicast (AHHM) based on Information-Centric Networking. To balance the forwarding states and forwarding overhead, AHHM is designed as a two-layer structure, in which the upper layer establishes a stateful main tree and the lower layer establishes several stateless sub trees. The router on the main tree is defined as the multicast join node (MJN), and AHHM uses the Name Resolution System to maintain the mapping between each multicast group name and corresponding MJNs. To optimize the multicast transmission path, we designed the minimum cost selection strategy for users to select the appropriate MJN to join. Simulation results show that compared with Source-Specific Multicast (SSM) and Bit Index Explicit Replication (BIER), AHHM can not only reduce the multicast forwarding states but also reduce the control overhead and link load.

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Janakiraman, Sengathir. "An enhanced hybrid Pareto metaheuritic algorithm-based multicast tree estimation for reliable multicast routing in VANETs". APTIKOM Journal on Computer Science and Information Technologies 3, n.º 3 (23 de janeiro de 2020): 100–105. http://dx.doi.org/10.34306/csit.v3i3.82.

Texto completo da fonte

Resumo:

Prompt and reliable data dissemination among the vehicular nodes of the network is indispensable as its mobility rate and limited coverage characteristics introduce the possibility of frequent topology changes. The effective and efficient sharing of critical information in the event of emergency necessitates either direct interaction or Road Side Units (RSUs)-based vehicular communication in the primitive place. Multicast routing is confirmed to be the significant scheme of data transfer since they establish reliable data dissemination between the source and destination vehicular nodes by estimating an optimal multicast tree. Moreover, QoS-constraint enforced meta-heuristic approaches are considered to be excellent for determining optimal multicast tree under multicasting. An Enhanced Hybrid Pareto Metaheuritic Algorithm-based Multicast Tree Estimation Scheme (EHPMA-MTES) is contributed for reliable multicast routing. The proposed EHPMA-MTES is confirmed to reduce the cost of transmission by 28% through the minimization of the multicast tree count formed during the process of multicast routing.

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Janakiraman, Sengathir. "An enhanced hybrid Pareto metaheuritic algorithm-based multicast tree estimation for reliable multicast routing in VANETs". APTIKOM Journal on Computer Science and Information Technologies 3, n.º 3 (1 de novembro de 2018): 100–105. http://dx.doi.org/10.11591/aptikom.j.csit.143.

Texto completo da fonte

Resumo:

Prompt and reliable data dissemination among the vehicular nodes of the network is indispensable as its mobility rate and limited coverage characteristics introduce the possibility of frequent topology changes. The effective and efficient sharing of critical information in the event of emergency necessitates either direct interaction or Road Side Units (RSUs)-based vehicular communication in the primitive place. Multicast routing is confirmed to be the significant scheme of data transfer since they establish reliable data dissemination between the source and destination vehicular nodes by estimating an optimal multicast tree. Moreover, QoS-constraint enforced meta-heuristic approaches are considered to be excellent for determining optimal multicast tree under multicasting. An Enhanced Hybrid Pareto Metaheuritic Algorithm-based Multicast Tree Estimation Scheme (EHPMA-MTES) is contributed for reliable multicast routing. The proposed EHPMA-MTES is confirmed to reduce the cost of transmission by 28% through the minimization of the multicast tree count formed during the process of multicast routing.

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Lee, Jong-Sung, Dae-Hee Lee, Sung-Jin Kim e Chang-Heon Oh. "An LED-based visible light communication system for multicast". Indonesian Journal of Electrical Engineering and Computer Science 13, n.º 1 (1 de janeiro de 2019): 265. http://dx.doi.org/10.11591/ijeecs.v13.i1.pp265-271.

Texto completo da fonte

Resumo:

<p>Visible Light Communication is a communication method that transmits data through light by pulsing an LED at high speed, performing broadcast communication for all devices existing in its coverage. Broadcast-based Visible Light Communication is limited to application to Internet of Things services, where various applications exist, although all receivers can communicate within the range of light sources. Therefore, this paper proposes an LED based Visible Light Communication system for multicast. The proposed system performs individual multicast by participating in communication only with receivers configured to use a specified ID value input at the transmitting side during data transmission. Experimental results show that the receiver can receive files individually according to a specified ID value.</p>

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Ouyang, Ruiqi, Xuanrui Xiong, Mingkai Fu, Jie Wang, Shixiong Chen e Osama Alfarraj. "A Scalable Video Multicast Scheme Based on User Demand Perception and D2D Communication". Sensors 23, n.º 17 (22 de agosto de 2023): 7325. http://dx.doi.org/10.3390/s23177325.

Texto completo da fonte

Resumo:

With the widespread application of 5G technology, there has been a significant surge in wireless video service demand and video traffic due to the proliferation of smart terminal devices and multimedia applications. However, the complexity of terminal devices, heterogeneous transmission channels, and the rapid growth of video traffic present new challenges for wireless network-based video applications. Although scalable video coding technology effectively improves video transmission efficiency in complex networks, traditional cellular base stations may struggle to handle video transmissions for all users simultaneously, particularly in large-scale networks. To tackle this issue, we propose a scalable video multicast scheme based on user demand perception and Device-to-Device (D2D) communication, aiming to enhance the D2D multicast network transmission performance of scalable videos in cellular D2D hybrid networks. Firstly, we analyze user interests by considering their video viewing history and factors like video popularity to determine their willingness for video pushing, thereby increasing the number of users receiving multicast clusters. Secondly, we design a cluster head selection algorithm that considers users’ channel quality, social parameters, and video quality requirements. Performance results demonstrate that the proposed scheme effectively attracts potential request users to join multicast clusters, increases the number of users in the clusters, and meets diverse user demands for video quality.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Artigos de revistas sobre o tema "Communication multicast"

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos