Дисертації з теми "Random Network Codes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-18 дисертацій для дослідження на тему "Random Network Codes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Lee, Anna H. "Simplified random network codes for multicast networks." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33306.
Повний текст джерелаIncludes bibliographical references (p. 43).
Network coding is a method of data transmission across a network which involves coding at intermediate nodes. Network coding is particularly attractive for multicast. Building on the work done on random linear network codes, we develop a constrained, simplified code construction suitable for multicast in wireless networks. We analyze bounds on sufficient code size and code success probability via an algebraic framework for network coding. We also present simulation results that compare generalized random network codes with our code construction. Issues unique to the simplified code are explored and a relaxation of the code to improve code performance is discussed.
by Anna H. Lee.
M.Eng.and S.B.
Von, Solms Suné. "Design of effective decoding techniques in network coding networks / Suné von Solms." Thesis, North-West University, 2013. http://hdl.handle.net/10394/9544.
Повний текст джерелаThesis (PhD (Computer Engineering))--North-West University, Potchefstroom Campus, 2013
Lu, Lu. "Wireless Broadcasting with Network Coding." Licentiate thesis, KTH, Kommunikationsteori, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-40472.
Повний текст джерелаQC 20110907
Susanto, Misfa. "Network Coding for Multihop Wireless Networks: Joint Random Linear Network Coding and Forward Error Correction with Interleaving for Multihop Wireless Networks." Thesis, University of Bradford, 2015. http://hdl.handle.net/10454/14864.
Повний текст джерелаKhoudro, Nader. "Modelling and performance evaluation of random access CDMA networks." Thesis, Loughborough University, 1997. https://dspace.lboro.ac.uk/2134/12385.
Повний текст джерелаPishro-Nik, Hossein. "Applications of Random Graphs to Design and Analysis of LDPC Codes and Sensor Networks." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7722.
Повний текст джерелаBadri, Moncef. "Performance analysis of star architecture packet-switched VSAT networks using random code division multiple access." Thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/91081.
Повний текст джерелаM.S.
Ni, Jian. "Connectivity, dynamic performance of random radio networks & state independent uniquely decodable codes, codeword synchronisation of collaborative coding multiple access communications." Thesis, University of Warwick, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282534.
Повний текст джерелаSabir, Essaïd. "MAC protocols design and a cross-layered QoS framework for next generation wireless networks." Phd thesis, Université d'Avignon, 2010. http://tel.archives-ouvertes.fr/tel-00544071.
Повний текст джерелаLeyva, Mayorga Israel. "On reliable and energy efficient massive wireless communications: the road to 5G." Doctoral thesis, Universitat Politècnica de València, 2019. http://hdl.handle.net/10251/115484.
Повний текст джерелаLa cinquena generació de xarxes mòbils (5G) es troba molt a la vora. S'espera que proveïsca de beneficis extraordinaris a la població i que resolga la majoria dels problemes de les xarxes 4G actuals. L'èxit de 5G, per a la qual ja ha sigut completada la primera fase del qual d'estandardització, depén de tres pilars: comunicacions tipus-màquina massives, banda ampla mòbil millorada, i comunicacions ultra fiables i de baixa latència (mMTC, eMBB i URLLC, respectivament, per les seues sigles en anglés). En aquesta tesi ens enfoquem en el primer pilar de 5G, mMTC, però també proveïm una solució per a aconseguir eMBB en escenaris de distribució massiva de continguts. Específicament, les principals contribucions són en les àrees de: 1) suport eficient de mMTC en xarxes cel·lulars; 2) accés aleatori per al report d'esdeveniments en xarxes sense fils de sensors (WSNs); i 3) cooperació per a la distribució massiva de continguts en xarxes cel·lulars. En l'apartat de mMTC en xarxes cel·lulars, aquesta tesi realitza una anàlisi profunda de l'acompliment del procediment d'accés aleatori, que és la forma mitjançant la qual els dispositius mòbils accedeixen a la xarxa. Aquestes anàlisis van ser inicialment dutes per mitjà de simulacions i, posteriorment, per mitjà d'un model analític. Els models van ser desenvolupats específicament per a aquest propòsit i inclouen un dels esquemes de control d'accés més prometedors: el access class barring (ACB). El nostre model és un dels més precisos que es poden trobar i l'únic que incorpora l'esquema d'ACB. Els resultats obtinguts per mitjà d'aquest model i per simulació són clars: els accessos altament sincronitzats que ocorren en aplicacions de mMTC poden causar congestió severa en el canal d'accés. D'altra banda, també són clars en què aquesta congestió es pot previndre amb una adequada configuració de l'ACB. No obstant això, els paràmetres de configuració de l'ACB han de ser contínuament adaptats a la intensitat d'accessos per a poder obtindre unes prestacions òptimes. En la tesi es proposa una solució pràctica a aquest problema en la forma d'un esquema de configuració automàtica per a l'ACB; l'anomenem ACBC. Els resultats mostren que el nostre esquema pot aconseguir un acompliment molt proper a l'òptim sense importar la intensitat dels accessos. Així mateix, pot ser directament implementat en xarxes cel·lulars per a suportar el trànsit mMTC, ja que ha sigut dissenyat tenint en compte els estàndards del 3GPP. A més de les anàlisis descrites anteriorment per a xarxes cel·lulars, es realitza una anàlisi general per a aplicacions de comptadors intel·ligents. És a dir, estudiem un escenari de mMTC des de la perspectiva de les WSNs. Específicament, desenvolupem un model híbrid per a l'anàlisi de prestacions i l'optimització de protocols de WSNs d'accés aleatori i basats en clúster. Els resultats mostren la utilitat d'escoltar el mitjà sense fil per a minimitzar el nombre de transmissions i també de modificar les probabilitats de transmissió després d'una col·lisió. Pel que fa a eMBB, ens enfoquem en un escenari de distribució massiva de continguts, en el qual un mateix contingut és enviat de forma simultània a un gran nombre d'usuaris mòbils. Aquest escenari és problemàtic, ja que les estacions base de la xarxa cel·lular no compten amb mecanismes eficients de multicast o broadcast. Per tant, la solució que s'adopta comunament és la de replicar el contingut per a cadascun dels usuaris que ho sol·liciten; és clar que això és altament ineficient. Per a resoldre aquest problema, proposem l'ús d'esquemes de network coding i d'arquitectures cooperatives anomenades núvols mòbils. En concret, desenvolupem un protocol per a realitzar la distribució massiva de continguts de forma eficient, juntament amb un model analític per a la seua optimització. Els resultats demostren que el model proposat és simple i precís
The 5th generation (5G) of mobile networks is just around the corner. It is expected to bring extraordinary benefits to the population and to solve the majority of the problems of current 4th generation (4G) systems. The success of 5G, whose first phase of standardization has concluded, relies in three pillars that correspond to its main use cases: massive machine-type communication (mMTC), enhanced mobile broadband (eMBB), and ultra-reliable low latency communication (URLLC). This thesis mainly focuses on the first pillar of 5G: mMTC, but also provides a solution for the eMBB in massive content delivery scenarios. Specifically, its main contributions are in the areas of: 1) efficient support of mMTC in cellular networks; 2) random access (RA) event-reporting in wireless sensor networks (WSNs); and 3) cooperative massive content delivery in cellular networks. Regarding mMTC in cellular networks, this thesis provides a thorough performance analysis of the RA procedure (RAP), used by the mobile devices to switch from idle to connected mode. These analyses were first conducted by simulation and then by an analytical model; both of these were developed with this specific purpose and include one of the most promising access control schemes: the access class barring (ACB). To the best of our knowledge, this is one of the most accurate analytical models reported in the literature and the only one that incorporates the ACB scheme. Our results clearly show that the highly-synchronized accesses that occur in mMTC applications can lead to severe congestion. On the other hand, it is also clear that congestion can be prevented with an adequate configuration of the ACB scheme. However, the configuration parameters of the ACB scheme must be continuously adapted to the intensity of access attempts if an optimal performance is to be obtained. We developed a practical solution to this problem in the form of a scheme to automatically configure the ACB; we call it access class barring configuration (ACBC) scheme. The results show that our ACBC scheme leads to a near-optimal performance regardless of the intensity of access attempts. Furthermore, it can be directly implemented in 3rd Generation Partnership Project (3GPP) cellular systems to efficiently handle mMTC because it has been designed to comply with the 3GPP standards. In addition to the analyses described above for cellular networks, a general analysis for smart metering applications is performed. That is, we study an mMTC scenario from the perspective of event detection and reporting WSNs. Specifically, we provide a hybrid model for the performance analysis and optimization of cluster-based RA WSN protocols. Results showcase the utility of overhearing to minimize the number of packet transmissions, but also of the adaptation of transmission parameters after a collision occurs. Building on this, we are able to provide some guidelines that can drastically increase the performance of a wide range of RA protocols and systems in event reporting applications. Regarding eMBB, we focus on a massive content delivery scenario in which the exact same content is transmitted to a large number of mobile users simultaneously. Such a scenario may arise, for example, with video streaming services that offer a particularly popular content. This is a problematic scenario because cellular base stations have no efficient multicast or broadcast mechanisms. Hence, the traditional solution is to replicate the content for each requesting user, which is highly inefficient. To solve this problem, we propose the use of network coding (NC) schemes in combination with cooperative architectures named mobile clouds (MCs). Specifically, we develop a protocol for efficient massive content delivery, along with the analytical model for its optimization. Results show the proposed model is simple and accurate, and the protocol can lead to energy savings of up to 37 percent when compared to the traditional approach.
Leyva Mayorga, I. (2018). On reliable and energy efficient massive wireless communications: the road to 5G [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/115484
TESIS
Afifi, Mohammed Ahmed Melegy Mohammed. "TCP FTAT (Fast Transmit Adaptive Transmission): A New End-To- End Congestion Control Algorithm." Cleveland State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=csu1414689425.
Повний текст джерелаGadouleau, Maximilien. "Algebraic codes for random linear network coding." 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3354746.
Повний текст джерелаEslami, Ali. "A non-asymptotic approach to the analysis of communication networks: From error correcting codes to network properties." 2013. https://scholarworks.umass.edu/dissertations/AAI3589018.
Повний текст джерелаOu, Huang-Ren, and 歐煌仁. "Random Network Coded Multipath TCP for DASH Streaming." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/95265a.
Повний текст джерела國立中央大學
通訊工程學系
107
With the evolution of network technology, many people watch streaming videos by their mobile devices. As the increasing of video data traffic, the network condition of mobile users become important. If mobile users watch a high resolution video under a worse network condition, it will impact their experience. To solve this problem, there are many streaming techniques to come out with a newly strategy for a better solution. Dynamic Adaptive Streaming over HTTP (DASH) is now a common streaming technique that provide a suitable segment bitrate for video users to watch their videos. But, it will still be an issue while the resolution remain lower which may influence the user’s experience. When a DASH client is watching a VR streaming service, the unstable network will cause the representation of video contents. Otherwise, to offer a higher network transmission, multipath TCP (MPTCP) becomes a method to provide video user’s a higher link capacity. As many devices support MPTCP and the higher link capacity can cover the video traffic. But, many studies show that some of problems in MPTCP transmission should be concerned, such as scheduling, congestion control and path conditions. In this work, we aim to discuss when a DASH client watch their streaming under unstable MPTCP transmission and propose an SNC-MPTCP (Segment Network Coding over MPTCP) algorithm to overcome several network situations. In our method, we apply the network coding to protect loss packets and use the theoretical formulation to estimate decoding probability. Then, we also make an implementation in NS-3. The scenarios include general video and VR dataset under limited link capacity and cross traffic situations. Finally, we observe that SNC-MPTCP can handle different condition and get higher performance compared with single TCP, naive MPTCP and NC-MPTCP in the DASH transmission.
Susanto, Misfa, Yim Fun Hu, and Prashant Pillai. "Joint random linear network coding and convolutional code with interleaving for multihop wireless network." 2013. http://hdl.handle.net/10454/9737.
Повний текст джерелаAbstract: Error control techniques are designed to ensure reliable data transfer over unreliable communication channels that are frequently subjected to channel errors. In this paper, the effect of applying a convolution code to the Scattered Random Network Coding (SRNC) scheme over a multi-hop wireless channel was studied. An interleaver was implemented for bit scattering in the SRNC with the purpose of dividing the encoded data into protected blocks and vulnerable blocks to achieve error diversity in one modulation symbol while randomising errored bits in both blocks. By combining the interleaver with the convolution encoder, the network decoder in the receiver would have enough number of correctly received network coded blocks to perform the decoding process efficiently. Extensive simulations were carried out to study the performance of three systems: 1) SRNC with convolutional encoding, 2) SRNC; and 3) A system without convolutional encoding nor interleaving. Simulation results in terms of block error rate for a 2-hop wireless transmission scenario over an Additive White Gaussian Noise (AWGN) channel were presented. Results showed that the system with interleaving and convolutional code achieved better performance with coding gain of at least 1.29 dB and 2.08 dB on average when the block error rate is 0.01 when compared with system II and system III respectively.
"Applications of Random Graphs to Design and Analysis of LDPC Codes and Sensor Networks." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7464.
Повний текст джерелаKuo, Yao-Hsin, and 郭耀新. "Random Assignment of Shifted Carrier-Hopping Prime Codes to Enhance Confidentiality in Wavelength-Time Optical CDMA Networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/31095077491792455741.
Повний текст джерела國立成功大學
電腦與通信工程研究所
97
Conventional optical code division multiple access (OCDMA) techniques suffer from inherent security disadvantages has been studied. In order to overcome vulnerability to eavesdropping of on-off-keying based OCDMA scheme, we propose a new scheme for confidentiality enhancement based on multi-code (M-code) keying approach of wavelength-hopping/time-spreading (WH/TS) OCDMA networks and applied to code reconfiguration mechanism. The code reconfiguration is achieved by exclusively assigning to each user a set of M shifted carrier-hopping prime codes (CHPC) and randomly selecting code word among M codes to represent user’s data bits. In addition, a central controller monitors network condition and regulates transmitter/receiver to perform code word selection. To integrate M-code keying with code reconfiguration mechanism, we utilize an optical switch not only switches symbol-to-symbol performing M-ary data modulation but following central controller’s instruction performing code changing. Hence, the assignment of code word and changing code word mechanism is more flexibility and easy to implement. In this thesis, we also analyze the security performance of proposed system. Evaluating the probability of code word interception is quantified the degree of data confidentiality. The result shows that the probability of error-free code detection gets worse when M increases and the eavesdropper processes code word detection more difficult, thus data confidentiality could be significantly increased. In addition, the proposed scheme using shifted CHPC appears to be a promising coding type for generating OCDMA code space that are large enough to prevent successful brute force code search attacks. Moreover, rapid code reconfiguration mechanism can increase the difficulty of interception but also makes the network management more difficult.
Motahari, Seyed Abolfazl. "Interference Management in Non-cooperative Networks." Thesis, 2009. http://hdl.handle.net/10012/4824.
Повний текст джерела