Academic literature on the topic 'Cooperative Multicast System'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Cooperative Multicast System.'

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 "Cooperative Multicast System"

1

Kumar, Divya, and Arun Kumar. "Outage Probability Analysis of Multihop-Multicast Cooperative System." International Journal of Computer Applications 148, no. 5 (August 16, 2016): 1–5. http://dx.doi.org/10.5120/ijca2016911104.

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

Zhu, Yun, Jie Gao, Lin Zhang, and Shao Lan Sun. "System Modeling for Opportunistic Network-Coded Cooperative Multicast Transmission in Clustered Wireless Sensor Networks." Advanced Materials Research 756-759 (September 2013): 1413–17. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1413.

Full text
Abstract:
Wireless sensor networks are formed by connected sensors that each have the ability to collect, process, and store environmental information as well as communicate with others via inter-sensor wireless communication. The many-to-one communication pattern used by sensor nodes in most of the data gathering applications leads to such unbalanced energy consumption. Cluster-based protocols attempt to solve this problem by load balancing within the cluster and rotating the job of cluster head every few rounds. In this paper, in order to achieve efficient utilization of wireless resources, we propose an opportunistic network-coded cooperative multicast scheme, which can select appropriate relays by synthetically considering location and instantaneous channel state information to improve the network performance than direct multicast with non additional power consumption.
APA, Harvard, Vancouver, ISO, and other styles
3

Wen, Chih-Chao, and Cheng-Shong Wu. "QoS Supported IPTV Service Architecture over Hybrid-Tree-Based Explicit Routed Multicast Network." International Journal of Digital Multimedia Broadcasting 2012 (2012): 1–11. http://dx.doi.org/10.1155/2012/263470.

Full text
Abstract:
With the rapid advance in multimedia streaming and multicast transport technology, current IP multicast protocols, especially PIM-SM, become the major channel delivery mechanism for IPTV system over Internet. The goals for IPTV service are to provide two-way interactive services for viewers to select popular program channel with high quality for watching during fast channel surfing period. However, existing IP multicast protocol cannot meet above QoS requirements for IPTV applications between media server and subscribers. Therefore, we propose a cooperative scheme of hybrid-tree based on explicit routed multicast, called as HT-ERM to combine the advantages of shared tree and source tree for QoS-supported IPTV service. To increase network utilization, the constrained shortest path first (CSPF) routing algorithm is designed for construction of hybrid tree to deliver the high-quality video stream over watching channel and standard quality over surfing channel. Furthermore, the Resource Reservation Protocol- Traffic Engineering (RSVP-TE) is used as signaling mechanism to set up QoS path for multicast channel admission control. Our simulation results demonstrated that the proposed HT-ERM scheme outperforms other multicast QoS-based delivery scheme in terms of channel switching delay, resource utilization, and blocking ratio for IPTV service.
APA, Harvard, Vancouver, ISO, and other styles
4

Weng, Chenfan, Dingcheng Yang, Jun Wan, Lin Xiao, and Chuanqi Zhu. "Transmission Strategy Design and Resource Allocation in D2D Multicast Cooperative Communications with SWIPT." Wireless Communications and Mobile Computing 2018 (November 1, 2018): 1–10. http://dx.doi.org/10.1155/2018/6790978.

Full text
Abstract:
This paper proposes a new transmission strategy for device-to-device (D2D) multicast cooperative communication systems based on Simultaneous Wireless Information and Power Transfer (SWIPT) technology. The transmission block is divided into two slots. In the first slot, the source user transmits the information and energy to the help user by SWIPT. In the second slot, the help user uses the cellular spectrum and forwards the information to multiple receivers by using harvested energy. In this paper, we aim to maximize the total system rate, and to tackle the problem, we propose a two-step scheme: In the first step, the resource allocation problem is solved by linear programming. In the second step, the power-splitting coefficient value is obtained by taking the benefit of help user into account. Numerical results show that the proposed strategy not only effectively improves the overall throughput and spectrum efficiency but also motivates the cooperation.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Yufang, Xiaoxiang Wang, Dongyu Wang, Qiang Zhao, and Yibo Zhang. "A Range-Division User Relay Selection Scheme and Performance Analysis in NOMA-based Cooperative Opportunistic Multicast Systems." Electronics 8, no. 5 (May 15, 2019): 544. http://dx.doi.org/10.3390/electronics8050544.

Full text
Abstract:
The original user relay (UR) selection scheme of non-orthogonal multiple access-based cooperative opportunistic multicast scheme, which realizes inter-group cooperation between two multicast groups, ignores the distribution trend of candidate UR in the cell and adopts fixed efficient relay selection range (ERSR) to select UR. It results in high UR selection ratio. Then the coverage efficiency, defined as the ratio of successfully received users to URs, is low. To tackle this problem, a range-division user relay (RDUR) selection scheme is proposed in this paper. Firstly, it divides the circular coverage range of base station into several continuous annular areas (AAs). Secondly, different ERSRs are assigned to unsuccessfully received users in different AAs. Under different ERSR assignments, the performances of UR selection ratio and coverage ratio are analyzed. Lastly, the radius set of ERSR that optimizes system coverage efficiency is used to perform UR selection. From simulation results, with different radius sets, analytical results of UR selection ratio and coverage ratio match well with their simulated ones. It is proved that ERSR allocation affects UR selection ratio and coverage ratio. With RDUR scheme, coverage efficiency increases by at least 14% and capacity efficiency has also been improved.
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Jun, and Wen Chen. "On the diversity-multiplexing tradeoff of cooperative multicast system with wireless network coding." Journal of Communications and Networks 12, no. 1 (February 2010): 11–18. http://dx.doi.org/10.1109/jcn.2010.6388430.

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

WANG, Cheng-jin, Xi LI, Lin ZHANG, and Hong JI. "Optimization scheme with pre-processing for cooperative relay multicast networks in cellular system." Journal of China Universities of Posts and Telecommunications 18, no. 3 (June 2011): 16–21. http://dx.doi.org/10.1016/s1005-8885(10)60057-x.

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

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

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

Zhang, Yibo, Xiaoxiang Wang, Dongyu Wang, Yufang Zhang, and Yanwen Lan. "Analysis and Design of SCMA-Based Hybrid Unicast-Multicast Relay-Assisted Networks." Sensors 19, no. 2 (January 15, 2019): 329. http://dx.doi.org/10.3390/s19020329.

Full text
Abstract:
This paper studies a multi-user network model based on sparse code multiple access (SCMA), where both unicast and multicast services are considered. In the direct transmission scheme, the communication between the base station (BS) and the users is completed with one stage, in which the relay is inexistent. In the two-stage cooperative transmission scheme, any number of relays are placed to improve the reliability of wireless communication system. The BS broadcasts the requested message to users and relays in the first stage, and the successful relays forward the message to unsuccessful users in the second stage. To characterize the performance of these two schemes, we derive the exact and approximate expressions of average outage probability. Furthermore, to take full advantage of the cooperative diversity, an optimal power allocation and relay location strategy in the high signal-to-noise ratio (SNR) regime is studied. The outage probability reaches the minimum value when the first stage occupies half of the total energy consumed. Simulation and analysis results are presented to demonstrate the performance of these two schemes. The results show that the two-stage cooperative scheme effectively reduce the average outage probability in SCMA network, especially in the high SNR region.
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Jheng-Sian, Jyh-Horng Wen, Chung-Hua Chiang, and Chien-Erh Weng. "Performance on Multiple Pilot-Based Grouping Methods in Satellite-Terrestrial Cooperative Wireless Networks." Electronics 11, no. 3 (January 30, 2022): 430. http://dx.doi.org/10.3390/electronics11030430.

Full text
Abstract:
The grouping method is an efficient transmitting strategy in a spatial diversity system. In this paper, relay-based grouping methods in satellite terrestrial cooperative wireless networks are proposed. The proposed methods focus on finding out the best two signals received from relay stations in a user’s neighborhood and use the advantage of space diversity to overcome the effect of channel fading. A grouping method, called the pilot-based grouping method was proposed in our previous work. In order to improve the grouping success rate and the channel capacity, a modified grouping method is proposed. In addition, for a single relay the modified grouping method can achieve better results than the pilot-based grouping method. In the end, several analysis strategies of the grouping method for multimedia broadcast and multicast services in satellite terrestrial cooperative networks are proposed. The simulation results show the performance improvement and the system evaluation for different quality of services in the demanded relay-based cooperative networks. The proposed modified grouping methods can be widespread in any relay-based cooperative networks.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Cooperative Multicast System"

1

Lorenzo, Veiga B. (Beatriz). "New network paradigms for future multihop cellular systems." Doctoral thesis, Oulun yliopisto, 2012. http://urn.fi/urn:isbn:9789514298554.

Full text
Abstract:
Abstract The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a number of new network paradigms are proposed in this thesis. First, a new algorithm for efficient relaying topology control is presented to jointly optimize the relaying topology, routing and scheduling resulting in a two dimensional or space time routing protocol. The algorithm is aware of intercell interference (ICI), and requires coordinated action between the cells to jointly choose the relaying topology and scheduling to minimize the system performance degradation due to ICI. This framework is extended to include the optimization of power control. Both conventional and cooperative relaying schemes are considered. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Seeking for a more tractable network model to effectively use context awareness and relying on the latest results on network information theory, we apply a hexagonal tessellation for inner partition of the cell into smaller subcells of radius r. By using only one single topology control parameter (r), we jointly optimize routing, scheduling and power control to obtain the optimum trade-off between throughput, delay and power consumption in multicast MCNs. This model enables high resolution optimization and motivates the further study of network protocols for MCNs. A new concept for route discovery protocols is developed and the trade-off between cooperative diversity and spatial reuse is analyzed by using this model. Finally, a new architecture for MCN is considered where multihop transmissions are performed by a Delay Tolerant Network, and new solutions to enhance the performance of multicast applications for multimedia content delivery are presented. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks
Tiivistelmä Tiedonsiirron ja tiedonsiirtonopeuksien suuri kasvu sekä tehonkulutuksen pieneneminen tulevien sukupolvien matkapuhelinjärjestelmissä tekevät monihyppyiset matkapuhelinverkot houkutteleviksi vaihtoehdoiksi. Tässä työssä esitetään uusia tiedonsiirtoverkkojen paradigmoja monihyppyisten matkapuhelinverkkojen hyödyntämiseksi. Työssä esitellään uusi algoritmi tehokkaaseen releointitopologian hallintaan, joka optimoi yhtäaikaisesti topologian, reitityksen sekä lähetyshetkien ajoituksen ja mahdollistaa tila-aika-reititysprotokollan toteutuksen. Esitetty algoritmi huomioi solujen keskinäishäiriön ja vaaditulla solujen välisellä koordinoidulla hallinnalla saadaan yhdessä valittua topologia ja ajoitus, jotka minimoivat solujen keskinäisistä häiriöistä johtuvan suorituskyvyn heikentymisen. Myöhemmin tätä viitekehystä on laajennettu lisäämällä siihen tehonsäädön optimointi. Työssä on tutkittu sekä perinteisiä että kooperatiivisia releointimenetelmiä. Lisäksi työssä esitetään uusi geneettinen algoritmi heuristiseksi approksimaatioksi verkon liikenteen muutoksen vaatimaan releointitopologian uudelleen järjestelyyn. Työssä tarkastellaan lisäksi verkkokoodausta ylä- ja alasuuntaan tapahtuvan tiedonsiirron yhdistämiseksi sisällyttämällä se solujen keskinäishäiriön huomioivaan kahdensuuntaiseen releointiin. Etsittäessä paremmin mukautuvaa ja kontekstitietoisuutta hyödyntävää verkkomallia, joka käyttää hyväkseen viimeisimpiä verkkojen informaatioteoreettisia tuloksia, voidaan verkon solut pilkkoa pienempiin kuusikulmaisiin alisoluihin. Käyttämällä ainoastaan näiden alisolujen sädettä r voidaan puolestaan verkon reititys, ajoitus ja tehon säätö optimoida yhtäaikaisesti saavuttaen paras mahdollinen kompromissi verkon läpäisyn, viiveen ja tehonkulutuksen välillä. Kehitetty malli mahdollistaa korkean resoluution optimoinnin ja motivoi uusien verkkoprotokollien kehitystä monihyppyisissä matkapuhelinverkoissa. Tätä mallia käyttäen esitellään myös uusi konsepti reitinetsintäprotokollille sekä analysoidaan kooperatiivisen diversiteetin ja tila-avaruudessa tapahtuvan uudelleenkäytön välistä kompromissiratkaisua. Lopuksi työssä tarkastellaan monihyppyisen matkapuhelinverkon uutta arkkitehtuuria, jossa monihyppylähetykset suoritetaan viivesietoisella verkolla ja esitetään uusia ratkaisuja multimediasisällön monilähetysten tehokkuuden parantamiseksi. Työssä saadut tulokset osoittavat, että ehdotetut algoritmit parantavat järjestelmien suorituskykyä verrattuna aiemmin tiedossa olleisiin tuloksiin. Työn tuloksilla voidaan olettaa myös olevan suuri vaikutus tulevaisuuden matkapuhelinverkkojen analysointiin ja suunnitteluun
APA, Harvard, Vancouver, ISO, and other styles
2

Gopala, Praveen Kumar. "Feedback in wireless networks cross-layer design, secrecy and reliability /." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1189452535.

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

Som, Pritam. "Performance Analysis of Space Shift Keying in Cooperative Relaying Systems." Thesis, 2014. http://etd.iisc.ac.in/handle/2005/4111.

Full text
Abstract:
Spatial modulation (SM) is a relatively new and attractive modulation technique for multi-antenna wireless systems. In SM, only one among ns = 2m available transmit antennas, chosen on the basis of m information bits, is activated at a time. A symbol from a conventional modulation alphabet (e.g., PSK) is transmitted through this chosen antenna. Space shift keying (SSK) is a special case of SM. In SSK, instead of sending a symbol from an alphabet, a signal known to the receiver, say a ‘+1’, is transmitted through the chosen antenna. SSK has the advantage of simple detection at the receiver. In this thesis, we are concerned with the performance analysis of SSK in cooperative relaying systems. We consider decode-and-forward (DF) relaying protocol, where the relays decode the received signal and forward the decoded signal towards the destina-tion. We consider three different models of cooperative relaying, namely, i) dual-hop relaying, ii) multi-hop relaying, and iii) cooperative multicasting. We also consider a cyclic-prefix single carrier (CPSC) communication system in a point-to-point chan-nel, and analyze the performance of both SM and SSK in that system under frequency selective fading. Dual-hop relaying: First, we consider a cooperative relaying system consisting of a source node, a destination node, and a relay node. We consider two commonly used re-laying techniques at the relay, namely, i) incremental relaying, and ii) threshold based relaying. We adopt selection combining at the destination. One way to perform se-lection combining operation is to use the knowledge of instantaneous signal-to-noise-ratio (SNR) as a metric for selection. However, in SSK, instantaneous SNR is difficult to be ascertained at the receiver side despite the availability of channel knowledge, be-cause the transmit antenna index itself is not known. To overcome this difficulty, we propose a new metric specific to SSK to carry out selection among the competing links. For the considered relaying schemes, we derive exact analytical expressions for the end-to-end average bit error probability (ABEP) for binary SSK (i.e., SSK with ns = 2) in closed-form. Simulations validate the end-to-end ABEP predicted by the analytical expressions. We then consider a dual-hop cooperative relaying system which consists of multiple relays. We propose a relay selection scheme for this system. In this system too, the des-tination adopts selection combining. Here, we use the proposed metric for both relay selection as well as selection combining. For this system, we derive an exact analytical expression for the end-to-end ABEP in closed-form for binary SSK. Analytical results agree with simulation results. For non-binary SSK (i.e., SSK with ns > 2), we derive an approximate closed-form expression for the end-to-end ABEP. The analytical ABEP results follow the simulated ABEP results closely. Multi-hop relaying: Next, we consider SSK in multi-hop multiple-input multiple-output (MIMO) networks. We consider two different systems of multi-hop coopera-tion, where each node has multiple antennas and employs SSK. In system I, a multi-hop diversity relaying scheme is considered. In system II, a multi-hop multi-branch relaying scheme is considered. In both the systems, we adopt DF relaying, where each relay forwards the signal only when it decodes correctly. We analyze the end-to-end ABEP and diversity order of SSK in both the systems. For binary SSK, our analytical ABEP expression is exact, and our numerical results show that the ABEPs evaluated through the analytical expression overlap with those obtained through simulations. For non-binary SSK, we derive an approximate ABEP expression, where the analyt-ically evaluated ABEP results closely follow the simulated ABEP results. We present comparisons between the ABEPs of SSK and conventional PSK, and show the instances where SSK outperforms PSK. We also present the diversity analyses for SSK in systems I and II, which predict the achievable diversity orders as a function of system parame-ters. Cooperative multicast: Next, we consider SSK in dual-hop DF cooperative multicast networks, where a source node communicates with multiple destination nodes with the help of relay nodes. We consider two different systems of cooperative multicast, namely, system III and system IV, where each node has multiple antennas and employs SSK, and communication happens in two phases. In system III, multiple relay nodes exist between the source and destination nodes. The relays that decode correctly can forward the signal to the destination nodes. We propose and analyze a relay selection scheme for this system. In system IV, the destination nodes can act as relays. Specifically, the destination nodes that decode correctly from the signal received on the direct path from source in the first phase forward to other destination nodes that did not decode correctly. For system III, we derive an exact closed-form expression of end-to-end ABEP for binary SSK, and an approximate closed-form expression of ABEP for non-binary SSK. We also present the diversity analysis for system III which predicts the achievable diversity order as a function of the system parameters. For system IV, we derive approximate closed-form ABEP expressions. The ABEP results obtained through the approximate analysis closely follow those obtained from simulations for both binary and non-binary SSK. Single carrier system: Finally, we study SM and SSK in CPSC systems on MIMO inter-symbol interference (ISI) channels. We present a diversity analysis of MIMO-CPSC systems under SSK and SM signaling. Our analysis shows that the diversity order achieved by (nt, nr ) SSK scheme and (nt, nr , ΘM ) SM scheme in MIMO-CPSC systems under maximum-likelihood detection is nr , where nt and nr denote the number of transmit and receive antennas, respectively, and ΘM denotes the modulation alpha-bet of size M . Bit error rate simulation results validate this predicted diversity order. Simulation results also show that MIMO-CPSC with SM and SSK achieves better per-formance compared to MIMO-OFDM with SM and SSK.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Cooperative Multicast System"

1

Kang, SeokHoon. "Video-on-Demand System Using Multicast and Web-Caching Techniques." In Grid and Cooperative Computing, 273–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24679-4_59.

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

Liu, Wei, Yueyun Chen, and Yudong Yao. "Multi-point Cooperative Fountain Codes Multicast for LTE Cellular System." In Internet of Things, Smart Spaces, and Next Generation Networking, 216–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32686-8_20.

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

Yang, Mengkun, and Zongming Fei. "Cooperative Failure Detection in Overlay Multicast." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, 881–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_71.

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

Zhang, Yuandong, and Liuguo Yin. "Transmission Quality Improvement Algorithms for Multicast Terrestrial-Satellite Cooperation System." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 308–26. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22968-9_27.

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

Bokor, László. "Novel Results on MBMS Service Provisioning in UMTS/WLAN Heterogeneous Architectures." In Networking and Telecommunications, 1753–80. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-986-1.ch113.

Full text
Abstract:
The support of broadcasting and multicasting as an efficient L3-based service poses rigorous requirements to the next generation mobile communication architectures. When IP multicasting has been seriously considered in mobile systems, soon has emerged the proposal of Multimedia Broadcast Multicast Service (MBMS) for 3G networks and beyond. However, with the spreading of versatile heterogeneous wireless systems, like the cooperation of European 3G (UMTS) and Wireless Local Area Network (WLAN), the problem of wireless IP datacasting arises in more complicated ways. In order to extend MBMS for UMTS/WLAN heterogeneous architectures we approach a novel framework along with a suitable and efficient WLAN MAC (Media Access Control) extension. In this work we also evaluate the performance of our proposal using a discrete event simulation environment called OMNeT++.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cooperative Multicast System"

1

Wang, Cheng-gang, and Zi-zhen Wang. "Cooperative Relay Multicast Technology in Cellular Mobile System and Algorithm Design for Multicast Tree." In 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2010. http://dx.doi.org/10.1109/wicom.2010.5601001.

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

Chen, Yang, Bei-xing Deng, and Xing Li. "Rainbow: A Locality-aware Peer-to-Peer Overlay Multicast System." In 2006 Fifth International Conference on Grid and Cooperative Computing Workshops. IEEE, 2006. http://dx.doi.org/10.1109/gccw.2006.76.

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

Liu, Yang, Wenbo Wang, Mugen Peng, and Dongyan Wei. "On Performance of Cooperative Multicast System with Wireless Network Coding." In GLOBECOM 2010 - 2010 IEEE Global Communications Conference. IEEE, 2010. http://dx.doi.org/10.1109/glocom.2010.5683676.

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

Zhang Guoyan, Li Yonghua, and Lin Jiaru. "Optimal energy consumption for dynamic network coding in cooperative multicast system." In 2013 20th International Conference on Telecommunications (ICT). IEEE, 2013. http://dx.doi.org/10.1109/ictel.2013.6632069.

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

Cheng-jin, Wang, Wang Wen-jie, and Ji Hong. "Cross-Layer Ant Colony Algorithm for Cooperative Relay Multicast Tree in Cellular Mobile System." In 2009 Fifth International Conference on Natural Computation. IEEE, 2009. http://dx.doi.org/10.1109/icnc.2009.244.

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

Alay, Ozgu, Ran Ding, Elza Erkip, Yao Wang, and Anna Scaglione. "Layered randomized cooperation for multicast." In 2008 42nd Asilomar Conference on Signals, Systems and Computers. IEEE, 2008. http://dx.doi.org/10.1109/acssc.2008.5074668.

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

Indumathi, G., K. Usha Rupnit, and K. Murugesan. "Cooperative multicast transmission scheduling with adaptive modulation and coding." In International Conference on Sustainable Energy and Intelligent Systems (SEISCON 2011). IET, 2011. http://dx.doi.org/10.1049/cp.2011.0437.

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

Alay, Ozgu, Xin Pan, Elza Erkip, and Yao Wang. "Layered randomized cooperative multicast for lossy data: A superposition approach." In 2009 43rd Annual Conference on Information Sciences and Systems (CISS). IEEE, 2009. http://dx.doi.org/10.1109/ciss.2009.5054740.

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

Yan Mei and Ling Qiu. "Joint rate and power allocation for cooperative layered video multicast systems." In 2013 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2013. http://dx.doi.org/10.1109/wcnc.2013.6554562.

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

Ping-Heng Kuo and Pang-An Ting. "Dynamic power allocation for multicast/broadcast services with cooperative distributed antenna systems." In 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC 2011). IEEE, 2011. http://dx.doi.org/10.1109/pimrc.2011.6139892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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