Journal articles: 'Multicasting techniques'

1

Sayed, Rosni, and Asaduzzaman Shobug. "Wireless Multicasting with Diversity Combining Techniques." IOSR Journal of Electronics and Communication Engineering 11, no. 05 (May 2016): 103–9. http://dx.doi.org/10.9790/2834-110501103109.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sudharani, D., and K. Amrutasagar. "Cyclic Group Key Administration Techniques for Multicasting in VANETs." International Journal of Computer Applications 168, no. 13 (June 22, 2017): 11–13. http://dx.doi.org/10.5120/ijca2017914552.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Qadir, Junaid, Adeel Baig, Asad Ali, and Quratulain Shafi. "Multicasting in cognitive radio networks: Algorithms, techniques and protocols." Journal of Network and Computer Applications 45 (October 2014): 44–61. http://dx.doi.org/10.1016/j.jnca.2014.07.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

5

Oprea, Simona, Valeria Leggieri, and Chefi Triki. "Reduction Techniques for the Minimum Power Multicasting Problem in Wireless Networks." Journal of Applied Sciences 11, no. 4 (February 1, 2011): 731–36. http://dx.doi.org/10.3923/jas.2011.731.736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Osemwegie, Omoruyi, Samuel John, Adewale Adeyinka, Etinosa Noma-Osaghae, and Kennedy Okokpujie. "Comparative analysis of routing techniques in chord overlay network." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 5 (October 1, 2021): 4361. http://dx.doi.org/10.11591/ijece.v11i5.pp4361-4372.

Full text

Abstract:

Overlay networks are not a new field or area of study. This domain of computing will someday drive P2P systems in various application areas such as block-chain, energy trading, video multicasting, and distributed file storage. This study highlights the two widely known methods of routing information employed in one of such overlay networks called chord. In this study, simulations of both routing modes (iterative and recursive) and their variations under no-churn (leaving and joining of nodes) and churn conditions was carried out. The routing parameter (successor list size) was varied for each of the routing techniques in a simulation study. The results obtained show that semi recursive routing gives a better routing performance under churn scenarios.

APA, Harvard, Vancouver, ISO, and other styles

7

Tekli, Joe, Ernesto Damiani, and Richard Chbeir. "Using XML-Based Multicasting to Improve Web Service Scalability." International Journal of Web Services Research 9, no. 1 (January 2012): 1–29. http://dx.doi.org/10.4018/jwsr.2012010101.

Full text

Abstract:

Web services’ (WS) emphasis on open standards provides substantial benefits over previous application integration techniques. A major WS feature is SOAP, a simple, robust and extensible XML-based protocol for the exchange of messages. For this reason, SOAP WS on virtual hosts are now widely used to provide shared functionalities on clouds. Unfortunately, SOAP has two major performance-related drawbacks: i) verbosity, related to XML, that leads to increased network traffic, and ii) high computational burden of XML parsing and processing, that leads to high latency. In this paper, we address these two issues and present new results regarding our framework for Differential SOAP Multicasting (DSM). The main idea behind our framework is identifying the common pattern and differences between SOAP messages, modeled as trees, so as to multicast similar messages together. Our method is based on the well known concept of Tree Edit Distance, built upon a novel filter-differencing architecture to reduce message aggregation time, identifying only those messages which are relevant (i.e., similar enough) for similarity evaluation. In this paper we focus on recent improvements to the filter-differencing architecture, including a dedicated differencing output format designed to carry the minimum amount of diff information, in the multicast message, so as to minimize the multicast message size, and therefore reduce the network traffic. Simulation experiments highlight the relevance of our method in comparison with traditional and dedicated multicasting techniques.

APA, Harvard, Vancouver, ISO, and other styles

8

Uribe, Bernardo, Luis Miguel Méndez, Andrés Tovar, Jean Pierre Charalambos, Olmedo Arcila, and Álvaro David López. "Mixed Reality Boundaries in Museum Preservation Areas." International Journal of Art, Culture and Design Technologies 3, no. 2 (July 2013): 63–74. http://dx.doi.org/10.4018/ijacdt.2013070105.

Full text

Abstract:

The paper presents a work in the field of ‘mixed reality boundaries’ applied to the visualization of museum collections in order to display the collections ‘live’ as a way to extend virtually the preservation areas of museum collections. To achieve this goal, it was set out to integrate several virtual-studio techniques with multicasting IP in the web and the ‘tectonics’ of museums architecture were also redesigned to turn this sort of new infrastructure into what will be a new typology of mixed architectures for museum preservation areas. Dynamic lighting for Chroma-keying techniques were adapted to the real time applications and a MR J3D collision tool was added to the remote motion control of the video camera´s 3d scene live navigation.

APA, Harvard, Vancouver, ISO, and other styles

9

Alhaisoni, Majed, Mohammed Ghanbari, and Antonio Liotta. "Localized Multistreams for P2P Streaming." International Journal of Digital Multimedia Broadcasting 2010 (2010): 1–12. http://dx.doi.org/10.1155/2010/843574.

Full text

Abstract:

Streaming video over the Internet, including cellular networks, has now become a commonplace. Network operators typically use multicasting or variants of multiple unicasting to deliver streams to the user terminal in a controlled fashion. P2P streaming is an emerging alternative, which is theoretically more scalable but suffers from other issues arising from the dynamic nature of the system. Users' terminals become streaming nodes but they are not constantly connected. Another issue is that they are based on logical overlays, which are not optimized for the physical underlay infrastructure. An important proposition is to find effective ways to increase the resilience of the overlay whilst at the same time not conflicting with the network. In this article we look at the combination of two techniques, redundant streaming and locality awareness, in the context of both live and video-on-demand streaming. We introduce a new technique and assess it via a comparative, simulation-based study. We find that redundancy affects network utilization only marginally if traffic is kept at the edges via localization techniques.

APA, Harvard, Vancouver, ISO, and other styles

10

Madhusudhanan, B., S. Chitra, and C. Rajan. "Mobility Based Key Management Technique for Multicast Security in Mobile Ad Hoc Networks." Scientific World Journal 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/801632.

Full text

Abstract:

In MANET multicasting, forward and backward secrecy result in increased packet drop rate owing to mobility. Frequent rekeying causes large message overhead which increases energy consumption and end-to-end delay. Particularly, the prevailing group key management techniques cause frequent mobility and disconnections. So there is a need to design a multicast key management technique to overcome these problems. In this paper, we propose the mobility based key management technique for multicast security in MANET. Initially, the nodes are categorized according to their stability index which is estimated based on the link availability and mobility. A multicast tree is constructed such that for every weak node, there is a strong parent node. A session key-based encryption technique is utilized to transmit a multicast data. The rekeying process is performed periodically by the initiator node. The rekeying interval is fixed depending on the node category so that this technique greatly minimizes the rekeying overhead. By simulation results, we show that our proposed approach reduces the packet drop rate and improves the data confidentiality.

APA, Harvard, Vancouver, ISO, and other styles

11

Hammood, Omar A., Mohd Nizam Mohmad Kahar, Waleed A. Hammood, Raed Abdulkareem Hasan, Mostafa Abdulghfoor Mohammed, Ayoob A. Yoob, and Tole Sutikno. "An effective transmit packet coding with trust-based relay nodes in VANETs." Bulletin of Electrical Engineering and Informatics 9, no. 2 (April 1, 2020): 685–97. http://dx.doi.org/10.11591/eei.v9i2.1653.

Full text

Abstract:

Vehicular ad-hoc networks (VANETs) are characterized by limited network resources such as limited bandwidth and battery capacity. Hence, it is necessary that unnecessary use of network resources (such as unnecessary packet transfers) is reduced in such networks so that the available power can be conserved for efficient multicast communications. In this paper, we have presented a Transmit Packet Coding (TPC) Network Coding in VANET to ensure reliable and efficient multicasting. With network coding, the number of transmitted packets over the network can be reduced, ensuring efficient utilization of network devices and resources. Here, the trust-based graph optimization is performed using Cuckoo search algorithm to select the secure relay nodes. The experimental results showed the superiority of the presented approach compared to the existing techniques in terms of throughput, latency, hop delay, packet delivery ratio, network decoder outage probability, and block error rate.

APA, Harvard, Vancouver, ISO, and other styles

12

CORES, F., A. RIPOLL, X. Y. YANG, B. QAZZAZ, R. SUPPI, P. HERNANDEZ, and E. LUQUE. "IMPROVING BANDWIDTH EFFICIENCY IN DISTRIBUTED VIDEO-ON-DEMAND ARCHITECTURES." Parallel Processing Letters 13, no. 04 (December 2003): 589–600. http://dx.doi.org/10.1142/s0129626403001537.

Full text

Abstract:

Distributed Video-on-Demand (DVoD) systems are proposed as a solution to the limited streaming capacity and null scalability of centralized systems. In a previous work, we proposed a fully distributed large-scale VoD architecture, called Double P-Tree, which has shown itself to be a good approach to the design of flexible and scalable DVoD systems. In this paper, we present relevant design aspects related to video mapping and traffic balancing in order to improve Double P-Tree architecture performance. Our simulation results demonstrate that these techniques yield a more efficient system and considerably increase its streaming capacity. The results also show the crucial importance of topology connectivity in improving multicasting performance in DVoD systems. Finally, a comparison among several DVoD architectures was performed using simulation, and the results show that the Double P-Tree architecture incorporating mapping and load balancing policies outperforms similar DVoD architectures.

APA, Harvard, Vancouver, ISO, and other styles

13

Tao, Binglin, Mingyu Xiao, and Jingyang Zhao. "Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 01 (April 3, 2020): 938–45. http://dx.doi.org/10.1609/aaai.v34i01.5441.

Full text

Abstract:

Network survivability has drawn certain interest in network optimization. However, the demand for full protection of a network is usually too restrictive. To overcome the limitation of geographical environments and to save network resources, we turn to establish backup networks allowing a few common nodes. It comes out the problem of finding k link-disjoint paths between a given pair of source and sink in a network such that the number of common nodes shared by at least two paths is bounded by a constant and the total link weight of all paths is minimized under the above constraints. For the case k = 2, where we have only one backup path, several fast algorithms have been developed in the literature. For the case k > 2, little results are known. In this paper, we first establish the NP-hardness of the problem with general k. Motivated by the situation that each node in a network may have a capability of multicasting, we also study a restricted version with one more requirement that each node can be shared by at most two paths. For the restricted version, we build an ILP model and design a fast algorithm by using the techniques of augmenting paths and splitting nodes. Furthermore, experimental results on synthetic and real networks show that our algorithm is effective in practice.

APA, Harvard, Vancouver, ISO, and other styles

14

Tarhani, Mehdi, Sanjib Sarkar, Morad Khosravi Eghbal, and Mehdi Shadaram. "Efficient multicasting technique for elastic optical network." IET Networks 10, no. 1 (December 22, 2020): 34–42. http://dx.doi.org/10.1049/ntw2.12003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Kaur, Jaspreet. "Trust Based Technique for the Multicasting in IoT." International Journal of Emerging Trends in Engineering Research 8, no. 8 (August 25, 2020): 4574–79. http://dx.doi.org/10.30534/ijeter/2020/86882020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Kaur, Sukhpreet, and Er Sharad. "Multicasting technique for path establishment in vehicular ad hoc networks." International Journal of Engineering & Technology 7, no. 2.4 (March 10, 2018): 204. http://dx.doi.org/10.14419/ijet.v7i2.4.13040.

Full text

Abstract:

The vehicular adhoc network is the decentralized type of network in which vehicles can move from one location to another. In the network two type of communication is possible which are vehicle to vehicle and vehicle to infrastructure. In the vehicle to vehicle type of path establishment is the major issue of the network. In this research work, multicasting routing technique is proposed for the path establishment from source to destination. The proposed technique is implemented in NS2 and simulation results shows improvement in network delay for path establishment

APA, Harvard, Vancouver, ISO, and other styles

17

Kaur, Jaspreet. "A Review of Trust based Multicasting Technique for IoT." International Journal for Research in Applied Science and Engineering Technology 8, no. 5 (May 31, 2020): 2226–31. http://dx.doi.org/10.22214/ijraset.2020.5364.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Kaur, Tarnjeet. "Multicasting Node Selection Technique for path establishment in VANETs." International Journal for Research in Applied Science and Engineering Technology V, no. VIII (August 30, 2017): 1139–44. http://dx.doi.org/10.22214/ijraset.2017.8160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Padmavathi, G., and S. Annadurai. "Improved Key Management Technique for Secure Multicasting over IP." Journal of Network and Systems Management 13, no. 3 (September 2005): 293–308. http://dx.doi.org/10.1007/s10922-005-6266-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

HEMMINGER, THOMAS L., and CARLOS A. POMALAZA-RAEZ. "USING NEURAL NETWORKS TO SOLVE THE MULTICAST ROUTING PROBLEM IN PACKET RADIO NETWORKS." International Journal of Neural Systems 07, no. 05 (November 1996): 617–26. http://dx.doi.org/10.1142/s0129065796000609.

Full text

Abstract:

The primary function of a packet radio network is the efficient transfer of information between source and destination nodes using minimal bandwidth and end-to-end delay. Many researchers have investigated the problem of minimizing the end-to-end delay from a single source to a single destination for a variety of networks; however, very little work is reported about routing mechanisms for the common case where a particular information packet is intended to be sent to more than one destination in the network. This is known as multicasting. A simplified version of the problem is to ignore the packet delay at each node, then the problem becomes one of finding solutions which require the least number of transmissions. Determination of an optimal solution is NP-complete meaning that suboptimal solutions are frequently tolerated. The problem becomes more rigorous if packet delays are included in the network topology. This paper describes a practical technique for the computation of optimum or near optimum solutions to the multicasting problem with and without packet delay. The method is based on the Hopfield neural network and experiment has shown this method to yield near optimal solutions while requiring a minimum of CPU time.

APA, Harvard, Vancouver, ISO, and other styles

21

Constantinou, Costas K., and Georgios Ellinas. "A load balancing technique for efficient survivable multicasting in mesh optical networks." Optical Switching and Networking 22 (November 2016): 1–8. http://dx.doi.org/10.1016/j.osn.2016.03.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Polaczyk, Bartosz, Piotr Chołda, and Andrzej Jajszczyk. "Peer-to-Peer Multicasting Inspired by Huffman Coding." Journal of Computer Networks and Communications 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/312376.

Full text

Abstract:

Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast P2P overlays is presented in this paper. To create the appropriate multicast tree topology, a round-trip-time (RTT) value is used as a parameter distinguishing peers capabilities. The multicast tree construction is based on the Huffman source coding algorithm. First, a centrally managed version is presented, and then an effective use of a distributed paradigm is shown. Performance evaluation results prove that the proposed approach considerably improves the overlay efficiency from the viewpoint of end-users and content providers. Moreover, the proposed technique ensures a high level of resilience against gateway-link failures and adaptively reorganizes the overlay topology in case of dynamic, transient network fluctuations.

APA, Harvard, Vancouver, ISO, and other styles

23

AlQarni, Bander H., and Ahmad S. AlMogren. "Reliable and Energy Efficient Protocol for MANET Multicasting." Journal of Computer Networks and Communications 2016 (2016): 1–13. http://dx.doi.org/10.1155/2016/9146168.

Full text

Abstract:

A mobilead hocnetwork (MANET) consists of a self-configured set of portable mobile nodes without any central infrastructure to regulate traffic in the network. These networks present problems such as lack of congestion control, reliability, and energy consumption. In this paper, we present a new model for MANET multicasting called Reliable and Energy Efficient Protocol Depending on Distance and Remaining Energy (REEDDRE). Our proposal is based on a tone system to provide more efficiency and better performance, and it combines solutions over the Medium Access Control (MAC) layer. The protocol consists of a new construction method for mobile nodes using a clustering approach that depends on distance and remaining energy to provide more stability and to reduce energy consumption. In addition, we propose an adjustment to the typical multicast flow by adding unicast links between clusters. We further present in our model a technique to provide more reliability based on a busy tone system (RMBTM) to reduce excessive control overhead caused by control packets in error recovery. We simulate our proposal using OPNET, and the results show enhancement in terms of reliability, packet delivery ratio (PDR), energy consumption, and throughput.

APA, Harvard, Vancouver, ISO, and other styles

24

Agrawal, J. P., and N. Yammanaka. "Extended multicasting technique to allow multiple destinations per output port in ATM switches." IEEE Communications Letters 1, no. 4 (July 1997): 117–18. http://dx.doi.org/10.1109/4234.602602.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Contestabile, G., N. Calabretta, R. Proietti, and E. Ciaramella. "Double-stage cross-gain modulation in SOAs: an effective technique for WDM multicasting." IEEE Photonics Technology Letters 18, no. 1 (January 2006): 181–83. http://dx.doi.org/10.1109/lpt.2005.861626.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Rao, A. Narayana, and Ch D. V. Subba Rao. "QoS-Aware Service Selection and Multicast Framework for Wireless Mesh Networks." International Journal of Business Data Communications and Networking 12, no. 1 (January 2016): 1–15. http://dx.doi.org/10.4018/ijbdcn.2016010101.

Full text

Abstract:

Wireless Mesh Network (WMN) is a multi-hop, multi-path network that has become the most favored method in delivering end-to-end data, voice and video. Data transmission through WMN has the security and reliability, same as the conventional wired networks. Since, WMN has a decentralized topology, maintaining QoS is very crucial. Hence in this work, we propose to develop a WMN that selects services based on high QoS. In order to avoid redundancy in data transmission, in this work we propose to develop an efficient framework for multicasting by determining the most effective path for transmitting the same data towards multiple destination nodes. By simulation results, we show that the proposed technique provides better QoS in terms of throughput and packet delivery ratio.

APA, Harvard, Vancouver, ISO, and other styles

27

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

28

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

29

SHIH, TIMOTHY K., JIUNG-YAO HUANG, and JASON C. HUNG. "EVCS — A COMPLETE ELECTRONIC VIRTUAL CONFERENCE SYSTEM." International Journal of Software Engineering and Knowledge Engineering 11, no. 01 (February 2001): 55–81. http://dx.doi.org/10.1142/s0218194001000426.

Full text

Abstract:

Electronic activities are realized on the Internet due to the growth of the Internet. As conference organization is getting more popular, we proposed an electronic virtual conference system (EVCS) to handle all activities of real-world conferences. The EVCS includes a virtual conference management system (VCMS) and a mobile conferencing system (MCS). Video conferencing is a trend of future communications. With the improvement of broadband network technologies, video conferencing becomes possible in the global society. It is feasible to use video conferencing technologies to organize future international conferences. As such, transportation and accommodation costs are saved. This paper proposed a total solution toward virtual conferencing. We use a mobile server/storage pre-broadcasting technique, as well as a communication network optimization algorithm, which is based on a graph computation mechanism. The system also relies on a network bandwidth reservation facility as well as a multicasting control function. With the assistance of the virtual conference management system, the system is able to support virtual conferencing in the future academic society.

APA, Harvard, Vancouver, ISO, and other styles

30

Yousif, Raghad Z., Rami S. Youeel, and Ferman I. Kareem. "A proposed P2P Kurdistan Academic Network Backbone (KANB), Based on Random Linear Network Coding." Kurdistan Journal of Applied Research 2, no. 3 (August 27, 2017): 50–55. http://dx.doi.org/10.24017/science.2017.3.19.

Full text

Abstract:

The current rate of growth in computer network usage is a problematic issue motivates the inspiration to investigate less conventional solutions, similar to Network Coding (NC) which has attracted a lot of attention lately, to improve the bandwidth utilization and latency in computer networks. The objective of this paper is to show that the usage of Network coding is possible on enhancing the execution of Kurdistan Academic Network Backbone (KANB) to associate the primary ten urban communities in Kurdistan Region that almost contains a greater part of academic institutions. The proposed model applies peer to peer (P2P) multicasting on KANB, which does not require any centralized knowledge about the topology of the network. The Random Linear Network Coding (RLNC) has been utilized for its superior properties to address the problems of delay, throughput and lake of security associated with store-and-forward based classical networks. Simulation results point out the advantages of using network coding over the classical (store and forward) technique in term of improving the throughput gain and latency reduction. Hawler city the capital and greatest city in Kurdistan Region have been chosen as a source node while Slemani city has been elected as a sink, node. Thus, Network coding is applied at intermediate nodes.

APA, Harvard, Vancouver, ISO, and other styles

31

Wang, Kan, Ruijie Wang, Junhuai Li, and Meng Li. "Joint V2V-Assisted Clustering, Caching, and Multicast Beamforming in Vehicular Edge Networks." Wireless Communications and Mobile Computing 2020 (November 19, 2020): 1–12. http://dx.doi.org/10.1155/2020/8837751.

Full text

Abstract:

As an emerging type of Internet of Things (IoT), Internet of Vehicles (IoV) denotes the vehicle network capable of supporting diverse types of intelligent services and has attracted great attention in the 5G era. In this study, we consider the multimedia content caching with multicast beamforming in IoV-based vehicular edge networks. First, we formulate a joint vehicle-to-vehicle- (V2V-) assisted clustering, caching, and multicasting optimization problem, to minimize the weighted sum of flow cost and power cost, subject to the quality-of-service (QoS) constraints for each multicast group. Then, with the two-timescale setup, the intractable and stochastic original problem is decoupled at separate timescales. More precisely, at the large timescale, we leverage the sample average approximation (SAA) technique to solve the joint V2V-assisted clustering and caching problem and then demonstrate the equivalence of optimal solutions between the original problem and its relaxed linear programming (LP) counterpart; and at the small timescale, we leverage the successive convex approximation (SCA) method to solve the nonconvex multicast beamforming problem, whereby a series of convex subproblems can be acquired, with the convergence also assured. Finally, simulations are conducted with different system parameters to show the effectiveness of the proposed algorithm, revealing that the network performance can benefit from not only the power saving from wireless multicast beamforming in vehicular networks but also the content caching among vehicles.

APA, Harvard, Vancouver, ISO, and other styles

32

Kaur, Kulwinder, and Simar Preet Singh. "Multicasting Technique to Enhance the Performance of DSR Routing Protocol Using Various Performance Metrics under Different Traffic Conditions in Mobile Ad hoc Networks." International Journal of Future Generation Communication and Networking 9, no. 4 (April 30, 2016): 103–44. http://dx.doi.org/10.14257/ijfgcn.2016.9.4.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

"Implementation of New MOD System Using On-demand Multicasting Technique." KIPS Transactions:PartB 10B, no. 7 (December 1, 2003): 847–52. http://dx.doi.org/10.3745/kipstb.2003.10b.7.847.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

"Cuckoo Search and M-Tree based Multicast Ad hoc On-demand Distance Vector Protocol for MANET." International Journal of Recent Technology and Engineering 8, no. 2S3 (August 10, 2019): 876–79. http://dx.doi.org/10.35940/ijrte.b1164.0782s319.

Full text

Abstract:

The proposed work, Cuckoo Search (CS) and M-Tree based Multicast Ad hoc On-demand Distance Vector (MAODV), is a two-step process, which involves M-Tree construction and optimal multicast route selection. Divisional based Cluster (DIVC), a technique of clustering inspired from Divisive clustering, builts the M-Tree using three constraints, destination flag, path-inclusion factor, and multi-factor. This paper aims to provide optimal multicasting with multiple objectives, such as energy, link lifetime, distance and delay

APA, Harvard, Vancouver, ISO, and other styles

35

Khan, Tayyab, Karan Singh, and Kamlesh C. Purohit. "ICMA: AN EFFICIENT INTEGRATED CONGESTION CONTROL APPROACH." Recent Patents on Engineering 14 (December 31, 2019). http://dx.doi.org/10.2174/1872212114666191231150916.

Full text

Abstract:

Background: With the growing popularity of various group communication applications such as file transfer, multimedia events, distance learning, email distribution, multiparty video conferencing and teleconferencing, multicasting seems to be a useful tool for efficient multipoint data distribution. An efficient communication technique depends on the various parameters like processing speed, buffer storage, and amount of data flow between the nodes. If data exceeds beyond the capacity of a link or node, then it introduces congestion in the network. A series of multicast congestion control algorithms have been developed, but due to the heterogeneous network environment, these approaches do not respond nor reduce congestion quickly whenever network behavior changes. Objective: Multicasting is a robust and efficient one-to-many (1: M) group transmission (communication) technique to reduced communication cost, bandwidth consumption, processing time and delays with similar reliability (dependability) as of regular unicast. This patent presents a novel and comprehensive congestion control method known as integrated multicast congestion control approach (ICMA) to reduce packet loss. Methods: The proposed mechanism is based on leave-join and flow control mechanism along with proportional integrated and derivate (PID) controller to reduce packet loss, depending on the congestion status. In the proposed approach, Proportional integrated and derivate controller computes expected incoming rate at each router and feedback this rate to upstream routers of the multicast network to stabilize their local buffer occupancy. Results: Simulation results on NS-2 exhibit the immense performance of the proposed approach in terms of delay, throughput, bandwidth utilization, and packet loss than other existing methods. Conclusion: The proposed congestion control scheme provides better bandwidth utilization and throughput than other existing approaches. Moreover, we have discussed existing congestion control schemes with their research gaps. In the future, we are planning to explore the fairness and quality of service issue in multicast communication.

APA, Harvard, Vancouver, ISO, and other styles

36

Gaba, Seema, Kavita ., Sahil Verma, and Monica Sood. "Multicasting Data Routing for Vehicular Ad hoc Network using Fog Computing." International Journal of Wireless and Ad Hoc Communication, 2021, 37–48. http://dx.doi.org/10.54216/ijwac.030104.

Full text

Abstract:

A group of vehicles either mobile or stationery that is interconnected through a wireless network generate a vehicular ad hoc network (VANET). Providing comfort as well as safety to the drivers in vehicular scenarios is the main importance of VANETs. Since there is an increase in the number of autonomous vehicles, these networks are now being considered as an infrastructure for an intelligent transportation system. Fog computing can be provided low latent information sharing and more background knowledge by localizing one of the features. This research work is related to data aggregation in vehicular ad hoc networks. In this research work, the technique of multicasting will be proposed for the data aggregation in VANETs. The Network Simulator 2 is used to perform experiments and few performance measures are used for analysing the outcomes.

APA, Harvard, Vancouver, ISO, and other styles

37

"Multi Rate Multicast Routing in Fixed Gateway Multi Channel and Multi Radio Wireless Mesh Network." International Journal of Innovative Technology and Exploring Engineering 8, no. 12 (October 10, 2019): 5846–52. http://dx.doi.org/10.35940/ijitee.l3767.1081219.

Full text

Abstract:

WMN is the wireless mesh network is having real type of application in the current time for the multicasting type of networking. Where one sender and there is a group of people who receives the message. But the bandwidth constraints will make the network to be on the slower side because the lowest speed channel will be allotted to the receiver automatically. The proposed algorithm with fixed gateway position with multichannel and multi radio wireless mesh network can create efficiency into the network. The proposed algorithm is having ability to get maximum throughput with the balancing of the different gateways with multichannel and multi radio wireless mesh network. The proposed algorithm has been tested in node count of 15 and 30 with variable channel and with variable number of receivers. The performance of the network is enhanced compared to the MGMR with variable number of gateway. Optimization based technique if applied for the identification of the optimal node. The simulated results are optimal in all the scenarios.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Multicasting techniques'

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