Relevant bibliographies by topics / Cooperative Multicast Networks

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Cooperative Multicast Networks'

Author: Grafiati
Published: 6 September 2023

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 Networks.'

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 Networks"

1

Zhao, Lindong, Lei Wang, Xuguang Zhang, and Bin Kang. "Social-Aware Cooperative Video Distribution via SVC Streaming Multicast." Wireless Communications and Mobile Computing 2018 (October 25, 2018): 1–9. http://dx.doi.org/10.1155/2018/9315357.

Full text
Abstract:
Scalable Video Coding (SVC) streaming multicast is considered as a promising solution to cope with video traffic overload and multicast channel differences. To solve the challenge of delivering high-definition SVC streaming over burst-loss prone channels, we propose a social-aware cooperative SVC streaming multicast scheme. The proposed scheme is the first attempt to enable D2D cooperation for SVC streaming multicast to conquer the burst-loss, and one salient feature of it is that it takes fully into account the hierarchical encoding structure of SVC in scheduling cooperation. By using our scheme, users form groups to share video packets among each other to restore incomplete enhancement layers. Specifically, a cooperative group formation method is designed to stimulate effective cooperation, based on coalitional game theory; and an optimal D2D links scheduling scheme is devised to maximize the total decoded enhancement layers, based on potential game theory. Extensive simulations using real video traces corroborate that the proposed scheme leads to a significant gain on the received video quality.
APA, Harvard, Vancouver, ISO, and other styles
2

Weizhao Wang, Xiang-Yang Li, Yu Wang, and Zheng Sun. "Designing Multicast Protocols for Non-Cooperative Networks." IEEE Journal on Selected Areas in Communications 26, no. 7 (September 2008): 1238–49. http://dx.doi.org/10.1109/jsac.2008.080920.

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

Binglai Niu, Hai Jiang, and H. V. Zhao. "A Cooperative Multicast Strategy in Wireless Networks." IEEE Transactions on Vehicular Technology 59, no. 6 (July 2010): 3136–43. http://dx.doi.org/10.1109/tvt.2010.2046431.

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

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

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

CHEN, L., L. JIN, F. HE, H. CHENG, and L. WU. "Dynamic Network Selection for Multicast Services in Wireless Cooperative Networks." IEICE Transactions on Communications E91-B, no. 10 (October 1, 2008): 3069–76. http://dx.doi.org/10.1093/ietcom/e91-b.10.3069.

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

Wu, Fei, Cunqing Hua, Hangguan Shan, and Aiping Huang. "Cooperative multicast with moving window network coding in wireless networks." Ad Hoc Networks 25 (February 2015): 213–27. http://dx.doi.org/10.1016/j.adhoc.2014.10.011.

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

Yang, Bin, Yulong Shen, Xiaohong Jiang, and Tarik Taleb. "Generalized Cooperative Multicast in Mobile Ad Hoc Networks." IEEE Transactions on Vehicular Technology 67, no. 3 (March 2018): 2631–43. http://dx.doi.org/10.1109/tvt.2017.2771286.

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

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
9

Zhang, Guopeng, Kun Yang, Qingsong Hu, Peng Liu, and Enjie Ding. "Bargaining Game Theoretic Framework for Stimulating Cooperation in Wireless Cooperative Multicast Networks." IEEE Communications Letters 16, no. 2 (February 2012): 208–11. http://dx.doi.org/10.1109/lcomm.2011.112311.111518.

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

Marabissi, Dania, Giulio Bartoli, Romano Fantacci, and Luigia Micciullo. "Energy efficient cooperative multicast beamforming in ultra dense networks." IET Communications 12, no. 5 (March 20, 2018): 573–78. http://dx.doi.org/10.1049/iet-com.2017.0618.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Cooperative Multicast Networks"

1

Li, Fulu 1970. "Cooperative multicast in wireless networks." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/32507.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2005.
Includes bibliographical references (p. 102-106).
Wireless communication has fundamental impairments due to multi-path fading, attenuation, reflections, obstructions, and noise. More importantly, it has historically been designed to mimic a physical wire; in concept other communicators in the same region are viewed as crossed wires. Many systems overcome these limitations by either speaking more loudly, or subdividing the space to mimic the effect of a separate wire between each pair. This thesis will construct and test the value of a cooperative system where the routing and transmission are done together by using several of the radios in the space to help, rather than interfere. The novel element is wireless, cooperative multicast that could be the basis for a new broadcast distribution paradigm. In the first part of the thesis,. we investigate efficient ways to construct multicast trees by exploring cooperation among local radio nodes to increase throughput and conserve energy (or battery power), whereby we assume single transmitting node is engaged in a one-to-one or one-to-many transmission. In the second part of the thesis, we further investigate transmit diversity in the general context of cooperative routing, whereby multiple nodes are allowed for cooperative transmissions. Essentially, the techniques presented in the second part of the thesis can be further incorporated in the construction of multicast trees presented in the first part.
by Fulu Li.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
2

Sebastian, Alvin. "Efficient safety message dissemination for cooperative collision warning via context modelling." Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/50793/1/Alvin_Sebastian_Thesis.pdf.

Full text
Abstract:
A Cooperative Collision Warning System (CCWS) is an active safety techno- logy for road vehicles that can potentially reduce traffic accidents. It provides a driver with situational awareness and early warnings of any possible colli- sions through an on-board unit. CCWS is still under active research, and one of the important technical problems is safety message dissemination. Safety messages are disseminated in a high-speed mobile environment using wireless communication technology such as Dedicated Short Range Communication (DSRC). The wireless communication in CCWS has a limited bandwidth and can become unreliable when used inefficiently, particularly given the dynamic nature of road traffic conditions. Unreliable communication may significantly reduce the performance of CCWS in preventing collisions. There are two types of safety messages: Routine Safety Messages (RSMs) and Event Safety Messages (ESMs). An RSM contains the up-to-date state of a vehicle, and it must be disseminated repeatedly to its neighbouring vehicles. An ESM is a warning message that must be sent to all the endangered vehi- cles. Existing RSM and ESM dissemination schemes are inefficient, unscalable, and unable to give priority to vehicles in the most danger. Thus, this study investigates more efficient and scalable RSM and ESM dissemination schemes that can make use of the context information generated from a particular traffic scenario. Therefore, this study tackles three technical research prob- lems, vehicular traffic scenario modelling and context information generation, context-aware RSM dissemination, and context-aware ESM dissemination. The most relevant context information in CCWS is the information about possible collisions among vehicles given a current vehicular traffic situation. To generate the context information, this study investigates techniques to model interactions among multiple vehicles based on their up-to-date motion state obtained via RSM. To date, there is no existing model that can represent interactions among multiple vehicles in a speciffic region and at a particular time. The major outcome from the first problem is a new interaction graph model that can be used to easily identify the endangered vehicles and their danger severity. By identifying the endangered vehicles, RSM and ESM dis- semination can be optimised while improving safety at the same time. The new model enables the development of context-aware RSM and ESM dissemination schemes. To disseminate RSM efficiently, this study investigates a context-aware dis- semination scheme that can optimise the RSM dissemination rate to improve safety in various vehicle densities. The major outcome from the second problem is a context-aware RSM dissemination protocol. The context-aware protocol can adaptively adjust the dissemination rate based on an estimated channel load and danger severity of vehicle interactions given by the interaction graph model. Unlike existing RSM dissemination schemes, the proposed adaptive scheme can reduce channel congestion and improve safety by prioritising ve- hicles that are most likely to crash with other vehicles. The proposed RSM protocol has been implemented and evaluated by simulation. The simulation results have shown that the proposed RSM protocol outperforms existing pro- tocols in terms of efficiency, scalability and safety. To disseminate ESM efficiently, this study investigates a context-aware ESM dissemination scheme that can reduce unnecessary transmissions and deliver ESMs to endangered vehicles as fast as possible. The major outcome from the third problem is a context-aware ESM dissemination protocol that uses a multicast routing strategy. Existing ESM protocols use broadcast rout- ing, which is not efficient because ESMs may be sent to a large number of ve- hicles in the area. Using multicast routing improves efficiency because ESMs are sent only to the endangered vehicles. The endangered vehicles can be identified using the interaction graph model. The proposed ESM protocol has been implemented and evaluated by simulation. The simulation results have shown that the proposed ESM protocol can prevent potential accidents from occurring better than existing ESM protocols. The context model and the RSM and ESM dissemination protocols can be implemented in any CCWS development to improve the communication and safety performance of CCWS. In effect, the outcomes contribute to the realisation of CCWS that will ultimately improve road safety and save lives.
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

Exposito, Victor. "Réseaux de multidiffusion avec coopération interactive entre récepteurs." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC006.

Full text
Abstract:
La présente thèse s’intéresse aux communications descendantes, plus spécifiquement aux canaux de multidiffusion, pour lesquels un émetteur diffuse un message commun destiné à tous les utilisateurs d’un groupe. Pour que le débit ne soit pas limité par le plus faible utilisateur en terme de qualité de canal, différentes solutions reposant sur des techniques entrées multiples sorties multiples massives ou multi-débit ont été proposées dans la littérature. Cependant, si tous les utilisateurs souhaitaient obtenir le même niveau de qualité, le plus faible utilisateur établirait le débit et/ou nécessiterait une quantité de ressources démesurée, ce qui impacterait tout le groupe. Les études récentes portant sur les communications d’appareil à appareil ouvrent la voie à la coopération entre utilisateurs proches, ce qui pourrait bénéficier à tous les utilisateurs, en garantissant le même niveau de qualité tout en maintenant un faible coût en ressource et en énergie. C’est pour ces raisons que cette thèse s’intéresse aux canaux de multidiffusion avec coopération entre récepteurs. La théorie de l’information formalise l’étude de ces réseaux et fournit des bornes universelles portant sur le débit transmissible. Le schéma de coopération proposé se base sur une superposition appropriée d’opérations de compresse-relaie (CF) et décode-relaie (DF), et il est prouvé que ses performances surpasse celles des schémas de coopérations non-interactifs pour le scénario à deux récepteurs. Les propriétés de la coopération interactive émergent de l’asymétrie de construction du schéma de coopération, ce qui permet d’adapter l’ordre des CFs et DFs en fonction de la qualité du canal. L’idée derrière cette interaction, les intuitions concernant les points clés de la construction, et des résultats numériques sont donnés pour des réseaux de petites tailles. Des simulations au niveau du système illustrent le gain potentiel que la coopération entre récepteurs pourrait apporter pour des réseaux de plus grandes tailles
The present thesis concentrates on downlink communications. In order to tackle one part of this challenging problem, we focus on the multicast channel in which one transmitter broadcasts a common message intended to a whole group of users. To ensure that the transmission rate is not limited by the weakest user in terms of channel quality, different solutions using massive multiple-input multiple-output or multirate strategies have been proposed in the literature. However, if all users wish to obtain the same content quality, the weakest user would set the rate and/or require a disproportionate amount of resource, and thus impact the whole group. With the recent study of device-to-device mechanisms, user cooperation in close proximity becomes possible and would benefit to all users by ensuring the same content quality while maintaining a low cost in terms of amount of resource and energy. Consequently, this thesis is centered around the multicast network with receiver cooperation. Information-theoretic tools formalize the study of the network considered and provide general bounds on the achievable transmission rate. The proposed cooperation scheme is based on an appropriate superposition of compress-forward (CF) and decode-forward (DF) operations, and provenly outperform non-interactive schemes in the two-receiver scenario. Properties of the interactive cooperation emerge from the asymmetric construction of the scheme which permits to adapt the order of CFs and DFs according to the channel condition. The core idea of the interaction, some insights on key construction points, and numerical results are given for small size networks. System level simulations illustrate the potential gain of receiver cooperation for larger networks
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

Weng, Jeng-Feng, and 翁建峰. "Multicast and Cooperative Relay in Next-Generation Wireless Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/60619217735152579772.

Full text
Abstract:
博士
國立清華大學
資訊工程學系
100
Multimedia Broadcast-Multicast Services are emerging applications for smart phones in 4G networks. Besides, cooperative relay networks play an important role in next-generation wireless networks. In this thesis, we study the issues of multicast and cooperative relay in next-generation wireless networks. First, we present the multicast architectures and perations defined in 3GPP and 3GPP2. This thesis provides a systematic comparison of them. In addition to system architectures, various issues including mobility, QoS, and security are discussed. Moreover, we discuss the challenges in Radio Resource Management (RRM), power control, scalability, and complexity. In multicast key management, key storages and computational cost are two most important issues to update security keys. In this thesis, we study how to reduce the cost of computation and storage to update the security keys in 3GPP Multimedia Broadcast-Multicast Services (MBMS) and 3GPP2 Broadcast-Multicast Service (BCMCS).We propose the Logical Key Hierarchy (LKH) and Hybrid-LKH approaches with dynamic rekeying for MBMS and BCMCS, the numerical results show that the computational cost and the key storages can be reduced significantly. The mean waiting time and service disciplines between the erroneous MS and the Helper MS are two important issues in next-generation cooperative relay wireless networks. This thesis presents two models to analyze the mean waiting time for a two-queue model with limited services (TQLS). The first model is an analytical model which contains the Riemann-Hilbert Boundary Value Problem approach. The second model is a numerical model that includes the Discrete Fourier Transforms (DFT’s) technique and the Power Series Algorithm (PSA) . In terms of the numerical analysis, simulation results and the conservation law, we show that the (I, J)-Limited service discipline is the best for the TQLS to balance the mean waiting time between the erroneous MS and the Helper MS.
APA, Harvard, Vancouver, ISO, and other styles
7

"Opportunistic Scheduling, Cooperative Relaying and Multicast in Wireless Networks." Doctoral diss., 2011. http://hdl.handle.net/2286/R.I.8840.

Full text
Abstract:
abstract: This dissertation builds a clear understanding of the role of information in wireless networks, and devises adaptive strategies to optimize the overall performance. The meaning of information ranges from channel/network states to the structure of the signal itself. Under the common thread of characterizing the role of information, this dissertation investigates opportunistic scheduling, relaying and multicast in wireless networks. To assess the role of channel state information, the problem of opportunistic distributed opportunistic scheduling (DOS) with incomplete information is considered for ad-hoc networks in which many links contend for the same channel using random access. The objective is to maximize the system throughput. In practice, link state information is noisy, and may result in throughput degradation. Therefore, refining the state information by additional probing can improve the throughput, but at the cost of further probing. Capitalizing on optimal stopping theory, the optimal scheduling policy is shown to be threshold-based and is characterized by either one or two thresholds, depending on network settings. To understand the benefits of side information in cooperative relaying scenarios, a basic model is explored for two-hop transmissions of two information flows which interfere with each other. While the first hop is a classical interference channel, the second hop can be treated as an interference channel with transmitter side information. Various cooperative relaying strategies are developed to enhance the achievable rate. In another context, a simple sensor network is considered, where a sensor node acts as a relay, and aids fusion center in detecting an event. Two relaying schemes are considered: analog relaying and digital relaying. Sufficient conditions are provided for the optimality of analog relaying over digital relaying in this network. To illustrate the role of information about the signal structure in joint source-channel coding, multicast of compressible signals over lossy channels is studied. The focus is on the network outage from the perspective of signal distortion across all receivers. Based on extreme value theory, the network outage is characterized in terms of key parameters. A new method using subblock network coding is devised, which prioritizes resource allocation based on the signal information structure.
Dissertation/Thesis
Ph.D. Electrical Engineering 2011
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, I.-Ta, and 李易達. "A Cooperative Multicast Routing Protocol for Mobile Ad Hoc Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/33584720213070705058.

Full text
Abstract:
碩士
國立清華大學
資訊工程學系
98
隨著近年在行動隨意網路中的群組服務蓬勃發展，群播路由協定的設計也漸漸受到重視。傳統的群播路由協定通常受到節點移動造成的頻繁連結中斷及多餘路由路徑產生的高通訊負擔這些問題的影響，為了克服這些問題，本研究提出了一個合作式群播路由協定。合作式群播路由協定採用跨實體層、媒介存取控制層及網路層的設計。更詳細的說，實體層應用了多點解碼轉送合作式傳輸來提供可靠的連結；媒介存取控制層將網路節點分類為多個叢集，根據這樣的層級架構，合作式群播路由協定可以有效地減輕通訊負擔；在網路層，我們設計了一個被動式、基於源點的群播路由協定，此協定將多樣性加入路徑建立時的考量，因此可提供強健的網路連線。並且，合作式群播路由協定解決了一個以往研究忽略的非對稱合作式傳輸問題。實驗結果指出，合作式群播路由協定在訊息負擔，傳輸成功率及能源消耗上皆有優於傳統群播路由協定的表現。
APA, Harvard, Vancouver, ISO, and other styles
9

Zeng, Sin-Man, and 曾馨漫. "Assignment of censorial relays in multicast and multiple source-destination cooperative communication networks." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/33474797540487043390.

Full text
Abstract:
碩士
國立臺灣科技大學
電子工程系
101
Cooperative communication is an effective technique recently proposed to enhance signal reliability and get spatial diversity in the field of wireless communications. In a cooperative wireless communication system, the source node broadcast data to the relay node and destination node. Then the relay forwards the received signal to the destination. This transmission technology can reduce the probability of missing data. In the proposed schemes,first the relay checks the reliability of the received signal. Then it relays the data bit to the destination only if the reliability is high enough. Otherwise, the data bits is censored. We use the linear weight combining in the destination node to make decision for received signals. We assume that channel information is perfectly known. Then, we derive the closed-form BER(bit error rate) expression for cooperative networks with multiple source-destination pairs and cooperative multicast systems. Using the closed-form BER expression, the optimal censoring threshold, combining weight and relays assignment can be found. Simulation results match theoretical values closely. Our system has better BER performance than existing technologies found in the literature .
APA, Harvard, Vancouver, ISO, and other styles
10

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 Networks"

1

Zhang, Qi, and Frank H. P. Fitzek. "Cooperative Retransmission for Reliable Wireless Multicast Services." In Cognitive Wireless Networks, 485–98. Dordrecht: Springer Netherlands, 2007. http://dx.doi.org/10.1007/978-1-4020-5979-7_25.

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

Jiang, Tingyao, and Aling Zhong. "A Multicast Routing Algorithm for P2P Networks." In Grid and Cooperative Computing, 452–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24679-4_83.

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

Fanelli, Angelo, Michele Flammini, Giovanna Melideo, and Luca Moscardelli. "Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves." In Lecture Notes in Computer Science, 363–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11821069_32.

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

Yu, Ying, Youshen Xia, and Mohamed Kamel. "Cooperative Recurrent Neural Network for Multiclass Support Vector Machine Learning." In Advances in Neural Networks – ISNN 2009, 276–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01510-6_32.

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

Yu, Meng, Jing (Tiffany) Li, and Haidong Wang. "Network Coding for Multi-Hop Wireless Networks." In Cooperative Communications for Improved Wireless Network Transmission, 187–205. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-665-5.ch006.

Full text
Abstract:
We consider practical network coding, a useful generalization of routing, in multi-hop multicast wireless networks. The model of interest comprises a set of nodes transmitting data wirelessly to a set of destinations across an arbitrary, unreliable, and possibly time-varying network. This model is general and subsumes peer-to-peer, ad-hoc, sensory, and mobile networks. It is first shown that, in the singlehop case, the idea of adaptively matching code-on-graph with network-on-graph, first developed in the adaptive-network-coded-cooperation (ANCC) protocol, provides a significant improvement over the conventional strategies. To generalize the idea to the multi-hop context, we propose to transform an arbitrarily connected network to a possibly time-varying “trellis network,” such that routing design for the network becomes equivalent to path discovery in the trellis. Then, exploiting the distributed, real-time graph-matching technique in each stage of the trellis, a general network coding framework is developed. Depending on whether or not the intermediate relays choose to decode network codes, three practical network coding categories, progress network coding, concatenated network coding and hybrid network coding, are investigated. Analysis shows that the proposed framework can be as dissemination-efficient as those with random codes, but only more practical.
APA, Harvard, Vancouver, ISO, and other styles
7

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 Networks"

1

Wang, Xinmu, Hewu Li, Mingkai Tong, Kang Pan, and Qian Wu. "Network Coded Cooperative Multicast in Integrated Terrestrial-Satellite Networks." In 2019 IEEE Symposium on Computers and Communications (ISCC). IEEE, 2019. http://dx.doi.org/10.1109/iscc47284.2019.8969770.

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

Dartmann, Guido, Xitao Gong, and Gerd Ascheid. "Low Complexity Cooperative Multicast Beamforming in Heterogeneous Networks." In 2013 IEEE 77th Vehicular Technology Conference (VTC Spring). IEEE, 2013. http://dx.doi.org/10.1109/vtcspring.2013.6692618.

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

Dartmann, Guido, Xitao Gong, and Gerd Ascheid. "Low Complexity Cooperative Multicast Beamforming in Multiuser Multicell Downlink Networks." In 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications. IEEE, 2011. http://dx.doi.org/10.4108/icst.crowncom.2011.245846.

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

Zhang, Hongming, Chunxiao Jiang, Linling Kuang, Yi Qian, and Song Guo. "Cooperative QoS Beamforming for Multicast Transmission in Terrestrial-Satellite Networks." In 2017 IEEE Global Communications Conference (GLOBECOM 2017). IEEE, 2017. http://dx.doi.org/10.1109/glocom.2017.8254790.

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

Jayaram, Madhumitha, and Bhagyaveni Marchala Anjaneyulu. "Opportunistic Cooperative Cognitive Multicast Routing Protocol for Ad Hoc Networks." In 2022 International Conference on Wireless Communications Signal Processing and Networking (WiSPNET). IEEE, 2022. http://dx.doi.org/10.1109/wispnet54241.2022.9767116.

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

Miliotis, V., L. Alonso, and C. Verikoukis. "Multicast performance bounds exploiting cooperative Physical Layer Network Coding." In 2012 IEEE 17th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD). IEEE, 2012. http://dx.doi.org/10.1109/camad.2012.6335314.

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

Miliotis, V., L. Alonso, C. Skianis, and C. Verikoukis. "The impact of cooperative physical layer network coding on multicast short range networks." In ICC 2013 - 2013 IEEE International Conference on Communications. IEEE, 2013. http://dx.doi.org/10.1109/icc.2013.6655101.

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

Hou, F., L. X. Cai, J. She, P. H. Ho, X. Shen, and J. Zhang. "Cooperative Multicast Scheduling Scheme for IPTV Service over IEEE 802.16 Networks." In 2008 IEEE International Conference on Communications. IEEE, 2008. http://dx.doi.org/10.1109/icc.2008.486.

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

Sun, Jianan, Ping Dong, Xiaojiang Du, Tao Zheng, Yajuan Qin, and Mohsen Guizani. "Cluster-based Cooperative Multicast for Multimedia Data Dissemination in Vehicular Networks." In 2020 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2020. http://dx.doi.org/10.1109/wcnc45663.2020.9120629.

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

Hao, Hao, Changqiao Xu, Mu Wang, Lujie Zhong, and Dapeng Oliver Wu. "Stochastic Cooperative Multicast Scheduling for Cache-Enabled and Green 5G Networks." In ICC 2019 - 2019 IEEE International Conference on Communications (ICC). IEEE, 2019. http://dx.doi.org/10.1109/icc.2019.8761402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Cooperative Multicast Networks' 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