Relevant bibliographies by topics / Multicasting techniques

Academic literature on the topic 'Multicasting techniques'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multicasting techniques.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "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
More sources

Dissertations / Theses on the topic "Multicasting techniques"

1

Khisti, Ashish 1979. "Coding techniques for multicasting." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28546.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (leaves 74-77).
We study some fundamental limits of multicasting in wireless systems and propose practical architectures that perform close to these limits. In Chapter 2, we study the scenario in which one transmitter with multiple antennas distributes a common message to a large number of users. For a system with a fixed number (L) of transmit antennas, we show that, as the number of users (K) becomes large, the rate of the worst user decreases as O(K-(1/L)). Thus having multiple antennas provides significant gains in the performance of multicasting system with slow fading. We propose a robust architecture for multicasting over block fading channels, using rateless erasure codes at the application layer. This architecture provides new insights into the cross layer interaction between the physical layer and the application layer. For systems with rich time diversity, we observe that it is better to exploit the time diversity using erasure codes at the application layer rather than be conservative and aim for high reliability at the physical layer. It is known that the spatial diversity gains are not significantly high in systems with rich time diversity. We take a step further and show that to realize these marginal gains one has to operate very close to the optimal operating point. Next, we study the problem of multicasting to multiple groups with a multiple antenna transmitter. The solution to this problem motivates us to study a multiuser generalization of the dirty paper coding problem. This generalization is interesting in its own right and is studied in detail in Chapter 3. The scenario we study is that of one sender and many receivers, all interested in a common message. There is additive interference on the channel of each receiver, which is known only to the sender.
(cont.) The sender has to encode the message in such the way that it is simultaneously 'good' to all the receivers. This scenario is a non-trivial generalization of the dirty paper coding result, since it requires that the sender deal with multiple interferences simultaneously. We prove a capacity theorem for the special case of two user binary channel and derive achievable rates for many other channel modes including the Gaussian channel and the memory with defects model. Our results are rather pessimistic since the value of side information diminishes as the number of users increase.
by Ashish Khisti.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
2

Koneni, Madhu. "Key Management Techniques for Dynamic Secure Multicasting." Thesis, Virginia Tech, 2003. http://hdl.handle.net/10919/33061.

Full text
Abstract:
Most of the Internet applications today require multicasting. For example, software updates, multimedia content distribution, interacting gaming and stock data distribution require multicast services. All of these applications require privacy and authenticity of the participants. Most of the multicasting groups are dynamic and some of them are large in number. Only those users who belong to the multicasting group should receive the information and be able to decrypt it. New users joining the group should receive information immediately but should not understand the information that was released prior to their joining. Similarly, if users leave the group, they should not receive any further information and should not be able to decrypt it. Keys need to be distributed to the users belonging to the current session and hence some kind of key management is required. Existing schemes for secure multicasting are limited to small and static groups. To allow large and dynamic groups to use the services of multicasting, some protocols have been developed: Multicast Trees, Spanning Tree, Centralized Tree-Based Key Management, Flat-key Management and Distributed Key Management. Some of these schemes are better than others with respect to the speed, memory consumption, and amount of communication needed to distribute the keys. All these schemes are limited in performance with respect to the speed, memory consumption, and amount of communication needed in distributing the keys. In this thesis, a number of public and private key algorithms and key management techniques for secure and dynamic multicasting are studied and analyzed. The thesis is focused on the secure lock method developed by Chiou and Chen, using the Chinese Remainder Theorem. The protocol is implemented for a small group of users and its performance is studied. While, the secure lock method works well for a small group of users and the performance is degraded when the group grows in size. A protocol is proposed for a large and dynamic group, based on the idea of the Chinese Remainder Theorem. A performance study is carried out by comparing our proposed protocol with the existing multicasting protocols. The analysis shows that the proposed protocol works well for large and dynamic groups and gives significantly better performance.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
3

Sheta, Khalid H. "Design and performance evaluation of techniques for multicasting support in broadband communication networks /." The Ohio State University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487947501134772.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Venkatachalaiah, Suresh, and suresh@catt rmit edu au. "Mobility prediction and Multicasting in Wireless Networks: Performance and Analysis." RMIT University. Electrical and Computer Engineering, 2006. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20070301.130037.

Full text
Abstract:
Handoff is a call handling mechanism that is invoked when a mobile node moves from one cell to another. Such movement may lead to degradation in performance for wireless networks as a result of packet losses. A promising technique proposed in this thesis is to apply multicasting techniques aided by mobility prediction in order to improve handoff performance. In this thesis, we present a method that uses a Grey model for mobility prediction and a fuzzy logic controller that has been fine-tuned using evolutionary algorithms in order to improve prediction accuracy. We also compare the self-tuning algorithm with two evolutionary algorithms in terms of accuracy and their convergence times. Our proposed method takes into account signal strengths from the base stations and predicts the signal strength of the next candidate base station in order to provide improved handover performance. The primary decision for mobility prediction is the accurate prediction of signal strengths obtained from the base stations and remove any unwanted errors in the prediction using suitable optimisation techniques. Furthermore, the model includes the procedures of fine-tuning the predicted data using fuzzy parameters. We also propose suitable multicasting algorithms to minimise the reservation of overall network resource requirements during handoff with the mobility prediction information. To be able to efficiently solve the problem, the situation is modelled using a multicast tree that is defined to maintain connectivity with the mobile node, whilst ensuring bandwidth guarantees and a minimum hop-count. In this approach, we have tried to solve the problem by balancing two objectives through putting a weight on each of two costs. We provide a detailed description of an algorithm to implement join and prune mechanisms, which will help to build an optimal multicast tree with QoS requirements during handoff as well as incorporating dynamic changes in the positions of mobile nodes. An analysis of how mobility prediction helps in the selection of potential Access Routers (AR) with QoS requirements - which affects the multicast group size and bandwidth cost of the multicast tree -- is presented. The proposed technique tries to minimise the number of multicast tree join and prune operations. Our results show that the expected size of the multicast group increases linearly with an increase in the number of selected destination AR's for multicast during handoff. We observe that the expected number of joins and prunes from the multicast tree increases with group size. A special simulation model was developed to demonstrate both homogeneous and heterogeneous handoff which is an emerging requirement for fourth generation mobile networks. The model incorporates our mobility prediction model for heterogeneous handoff between the Wireless LAN and a cellular network. The results presented in this thesis for mobility prediction, multicasting techniques and heterogeneous handoff include proposed algorithms and models which aid in the understanding, analysing and reducing of overheads during handoff.
APA, Harvard, Vancouver, ISO, and other styles
5

Tsang, Cheuk-man Mark, and 曾卓敏. "Multicast techniques for bandwidth-demanding applications in overlay networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2008. http://hub.hku.hk/bib/B40687508.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tsang, Cheuk-man Mark. "Multicast techniques for bandwidth-demanding applications in overlay networks." Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B40687508.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fariba, Farhad. "An investigation of multicasting techniques in an ATM network to support multilateral multimedia desktop conferencing." Thesis, University of Salford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xu, Donghua. "Scalability and Composability Techniques for Network Simulation." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10450.

Full text
Abstract:
Simulation has become an important way to observe and understand various networking phenomena under various conditions. As the demand to simulate larger and more complex networks increases, the limited computing capacity of a single workstation and the limited simulation capability of a single network simulator have become apparent obstacles to the simulationists. In this research we develop techniques that can scale a simulation to address the limited capacity of a single workstation, as well as techniques that can compose a simulation from different simulator components to address the limited capability of a single network simulator. We scale a simulation with two different approaches: 1) We reduce the resource requirement of a simulation substantially, so that larger simulations can fit into one single workstation. In this thesis, we develop three technqiues (Negative Forwarding Table, Multicast Routing Object Aggregation and NIx-Vector Unicast Routing) to aggregate and compress the large amount of superfluous or redundant routing state in large multicast simulations. 2) The other approach to scale network simulations is to partition a simulation model in a way that makes the best use of the resources of the available computer cluster, and distribute the simulation onto the different processors of the computer cluster to obtain the best parallel simulation performance. We develop a novel empirical methodology called BencHMAP (Benchmark-Based Hardware and Model Aware Partitioning) that runs small sets of benchmark simulations to derive the right formulas of calculating the weights that are used to partition the simulation on a given computer cluster. On the other hand, to address the problem of the limited capability of a network simulator, we develop techniques for building complex network simulations by composing from independent components. With different existing simulators good at different protocol layers/scenarios, we can make each simulator execute the layers where it excels, using a simulation backplane to be the interface between different simulators. In this thesis we demonstrate that these techniques enable us to not only scale up simulations by orders of magnitude with a good performance, but also compose complex simulations with high fidelity.
APA, Harvard, Vancouver, ISO, and other styles
9

Shen, Tzu-Ching, and 沈子晉. "Rateless Unequal Erasure Protection Coding Techniques Using on H.264/SVC Video Multicasting." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/89844925739294730448.

Full text
Abstract:
碩士
國立交通大學
網路工程研究所
98
In this thesis, we propose a rateless cascade channel coding system with Unequal Erasure Protection capability using on H.264/SVC transport for real time transport because so far most of researches does not provide a specific method about how to design a short-length rateless unequal erasure protection code which is (1) with good UEP capability and graceful degradation (2) each UEP layer size is adjustable (3) protection capability for each UEP layer is adjustable (4) the coding system is practical to use on a real H.264/SVC transport. The coding scheme we provide in this thesis is composed by an UEP Precoder, Interleaver/Multiplexer, and an UEP rateless Postcoder, and we also describe how to design, adjust parameters to optimize performance of them.
APA, Harvard, Vancouver, ISO, and other styles
10

Bhardwaj, Kshitij. "On Multicast in Asynchronous Networks-on-Chip: Techniques, Architectures, and FPGA Implementation." Thesis, 2018. https://doi.org/10.7916/D81279JK.

Full text
Abstract:
In this era of exascale computing, conventional synchronous design techniques are facing unprecedented challenges. The consumer electronics market is replete with many-core systems in the range of 16 cores to thousands of cores on chip, integrating multi-billion transistors. However, with this ever increasing complexity, the traditional design approaches are facing key issues such as increasing chip power, process variability, aging, thermal problems, and scalability. An alternative paradigm that has gained significant interest in the last decade is asynchronous design. Asynchronous designs have several potential advantages: they are naturally energy proportional, burning power only when active, do not require complex clock distribution, are robust to different forms of variability, and provide ease of composability for heterogeneous platforms. Networks-on-chip (NoCs) is an interconnect paradigm that has been introduced to deal with the ever-increasing system complexity. NoCs provide a distributed, scalable, and efficient interconnect solution for today’s many-core systems. Moreover, NoCs are a natural match with asynchronous design techniques, as they separate communication infrastructure and timing from the computational elements. To this end, globally-asynchronous locally-synchronous (GALS) systems that interconnect multiple processing cores, operating at different clock speeds, using an asynchronous NoC, have gained significant interest. While asynchronous NoCs have several advantages, they also face a key challenge of supporting new types of traffic patterns. Once such pattern is multicast communication, where a source sends packets to arbitrary number of destinations. Multicast is not only common in parallel computing, such as for cache coherency, but also for emerging areas such as neuromorphic computing. This important capability has been largely missing from asynchronous NoCs. This thesis introduces several efficient multicast solutions for these interconnects. In particular, techniques, and network architectures are introduced to support high-performance and low-power multicast. Two leading network topologies are the focus: a variant mesh-of-trees (MoT) and a 2D mesh. In addition, for a more realistic implementation and analysis, as well as significantly advancing the field of asynchronous NoCs, this thesis also targets synthesis of these NoCs on commercial FPGAs. While there has been significant advances in FPGA technologies, there has been only limited research on implementing asynchronous NoCs on FPGAs. To this end, a systematic computeraided design (CAD) methodology has been introduced to efficiently and safely map asynchronous NoCs on FPGAs. Overall, this thesis makes the following three contributions. The first contribution is a multicast solution for a variant MoT network topology. This topology consists of simple low-radix switches, and has been used in high-performance computing platforms. A novel local speculation technique is introduced, where a subset of the network’s switches are speculative that always broadcast every packet. These switches are very simple and have high performance. Speculative switches are surrounded by non-speculative ones that route packets based on their destinations and also throttle any redundant copies created by the former. This hybrid network architecture achieved significant performance and power benefits over other multicast approaches. The second contribution is a multicast solution for a 2D-mesh topology, which is more complex with higher-radix switches and also is more commonly used. A novel continuous-time replication strategy is introduced to optimize the critical multi-way forking operation of a multicast transmission. In this technique, a multicast packet is first stored in an input port of a switch, from where it is sent through distinct output ports towards different destinations concurrently, at each output’s own rate and in continuous time. This strategy is shown to have significant latency and energy benefits over an approach that performs multicast using multiple distinct serial unicasts to each destination. Finally, a systematic CAD methodology is introduced to synthesize asynchronous NoCs on commercial FPGAs. A two-fold goal is targeted: correctness and high performance. For ease of implementation, only existing FPGA synthesis tools are used. Moreover, since asynchronous NoCs involve special asynchronous components, a comprehensive guide is introduced to map these elements correctly and efficiently. Two asynchronous NoC switches are synthesized using the proposed approach on a leading Xilinx FPGA in 28 nm: one that only handles unicast, and the other that also supports multicast. Both showed significant energy benefits with some performance gains over a state-of-the-art synchronous switch.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Multicasting techniques"

1

Transmission techniques for emergent multicast and broadcast systems. Boca Raton, FL: CRC Press / Taylor & Francis, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Multicasting techniques"

1

Dammicco, Giacinto, and Ugo Mocci. "Program caching and multicasting techniques in VoD networks." In Interactive Distributed Multimedia Systems and Telecommunication Services, 65–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0000340.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Min, Chin Teck, and Lim Tong Ming. "Totally Sender- And File-Order Recovery Technique For Reliable Multicasting Solutions Using Heartbeat." In Innovations and Advances in Computer Sciences and Engineering, 555–59. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-90-481-3658-2_97.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pugalenthi, R., V. R. Rajasekar, U. Sakthi, and S. Preetham. "Multicasting of Images Resized Using Enhanced Seam Carving Technique in Hierarchical Group Communication." In Communications in Computer and Information Science, 250–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35211-9_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Xiao, and Jie Wu. "Multicasting Techniques in Mobile Ad Hoc Networks." In Electrical Engineering Handbook. CRC Press, 2002. http://dx.doi.org/10.1201/9781420040401.ch2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shrestha, Anish Prasad, and Kyung Sup Kwak. "Physical Layer Security in Multiuser Wireless Networks." In Developing Next-Generation Countermeasures for Homeland Security Threat Prevention, 263–81. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-0703-1.ch012.

Full text
Abstract:
Physical layer (PHY) security has recently gained considerable attention as an alternative option to cryptographic techniques since it can provide unconditional perfect secrecy. This chapter presents brief concept about PHY security and solutions along with quantitative measurement of secrecy performance for multiuser wireless networks. A typical transmitter in wireless communication may be required to send a confidential message to either a single or several users simultaneously. Aiming to provide comprehensive investigation of secrecy performance in such multiuser network, secure multicasting and opportunistic scheduling techniques are presented. Furthermore, to look into the effects of multiple antennas, system model under consideration employ maximal ratio combining at receiver.
APA, Harvard, Vancouver, ISO, and other styles
6

Osawa, Noritaka, and Kikuo Asai. "Multipoint Multimedia Conferencing System for Efficient and Effective Remote Collaboration." In Advances in Distance Education Technologies, 126–46. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-934-2.ch009.

Full text
Abstract:
A multipoint, multimedia conferencing system called FocusShare is described. It uses IPv6/IPv4 multicasting for real-time collaboration, enabling video, audio, and group-awareness and attention-sharing information to be shared. Multiple telepointers provide group-awareness information and make it easy to share attention and intention. In addition to pointing with the telepointers, users can add graphical annotations to video streams and share them with one another. The system also supports attention-sharing using video processing techniques. FocusShare is a modularly designed suite consisting of several simple tools, along with tools for remotely controlling them. The modular design and flexible management functions enable the system to be easily adapted to various situations entailing different numbers of displays with different resolutions at multiple sites. The remote control tools enable the chairperson or conference organizer to simultaneously change the settings for a set of tools distributed at multiple sites. Evaluation showed that the implemented attention-sharing techniques are useful: FocusShare was more positively evaluated than conventional video conferencing systems.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multicasting techniques"

1

Yan Sun and K. J. Ray Liu. "Transmit diversity techniques for multicasting over wireless networks." In 2004 IEEE Wireless Communications and Networking Conference. IEEE, 2004. http://dx.doi.org/10.1109/wcnc.2004.1311613.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ali, Qutaiba I., and Basil Sh Mahmood. "Enhancement of Industrial Ethernet Performance Using Multicasting/VLAN techniques." In Communication Technologies: from Theory to Applications (ICTTA). IEEE, 2008. http://dx.doi.org/10.1109/ictta.2008.4530180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bhattacharjee, Suman, Ranit Chatterjee, Tamal Pal, and Sipra DasBit. "Implementing Multicasting and Broadcasting of Multimedia Data in ONE Simulator." In SIMUTOOLS '17: 10th EAI International Conference on Simulation Tools and Techniques. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3173519.3173540.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Abdelkader, A., M. Pesavento, and A. B. Gershman. "Orthogonalization techniques for single group multicasting in cooperative amplify-and-forward networks." In 2011 4th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). IEEE, 2011. http://dx.doi.org/10.1109/camsap.2011.6135989.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Swetha, P. K., and Uma Maheswari B. "An Improved Cluster based Multicasting Technique on Vehicular Adhoc Network." In 2018 Second International Conference on Green Computing and Internet of Things (ICGCIoT). IEEE, 2018. http://dx.doi.org/10.1109/icgciot.2018.8753067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Micanti, Paolo, Giuseppe Baruffa, and Fabrmzio Frescura. "A packetization technique for D-Cinema contents multicasting over metropolitan wireless networks." In 2007 IEEE Mobile WiMAX Symposium. IEEE, 2007. http://dx.doi.org/10.1109/wimax.2007.348707.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Atallah, Michael, and Georges Kaddoum. "Secrecy Analysis of Cooperative Network with Untrustworthy Relays Using Location-Based Multicasting Technique." In 2017 IEEE 5th International Conference on Future Internet of Things and Cloud: Workshops (W-FiCloud). IEEE, 2017. http://dx.doi.org/10.1109/ficloudw.2017.74.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hsiao, Chang-Lung, Jiann-Ching Guey, Wern-Ho Sheen, and Ren-Jr Chen. "A New Transmit Beamforming Technique for Physical-Layer Multicasting in Cellular Downlink Systems." In 2014 IEEE 80th Vehicular Technology Conference (VTC Fall). IEEE, 2014. http://dx.doi.org/10.1109/vtcfall.2014.6965822.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ansari, A. Q., and V. K. Nangia. "Efficient electricity grid management for distributed generation using a fuzzy logic-based multicasting technique." In 2010 Power India. IEEE, 2010. http://dx.doi.org/10.1109/pedes.2010.5712478.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gopalakrishnan, S., and P. GaneshKumar. "Secure and efficient transmission in wireless network using key authentication based secured multicasting technique." In 2015 International Conference on Advanced Computing and Communication Systems (ICACCS). IEEE, 2015. http://dx.doi.org/10.1109/icaccs.2015.7324064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Multicasting techniques' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography