Academic literature on the topic 'Random Network Codes'

Abstract In this paper, two transmission schemes for batched sparse(BATS) codes based on a multicast protocol in a butterfly network are studied. For both of the schemes, a source file is first segmented into several packets at the source node, which are then coded with outer coder of the BATS codes to generate potentially unlimited batches. Rather than the linear network, in which the packets are directly transmitted to the next node, the packets will be forwarded to multiple nodes in the butterfly network. All the intermediate nodes which receive the packets recode them with random linear network coding (RLNC). At the destination node receivers, the sink node decodes the packets transmitted from different links. The Scheme I requires the intermediate nodes to recode the packets until all of them are received. On the contrary, the intermidate nodes of Scheme II just recode the packets as soon as receiving them and forward the recoded packets to the next node immediately. The Belief Propagation(BP) decoders of these two schemes are studied and applied to Scheme I and Scheme II respectively. The simulation results show that Scheme I consumed fewer batches than Scheme II, which indicates Scheme I outperforms Scheme II.

ABSTRAKPada jaringan masa depan melibatkan komunikasi antara mesin dan manusia. Penelitian ini mengusulkan konsep coding dalam jaringan menggunakan Maximum Distance Separable (MDS) codes. Desain sub-optimal degree distribution untuk memprioritaskan manusia menggunakan proyeksi EXIT Chart. Pada penelitian ini dasar dari skema multiple akses untuk jaringan super-padat menggunakan Coded Random Access (CRA). Usulan model jaringan menggunakan Binary Erasure Channel (BEC). Evaluasi performansi untuk grup manusia dan mesin diukur berdasarkan throughput dan packet-loss-rate dan hasilnya juga dibuktikan menggunakan frequency-flat Rayleigh fading. Sub-optimal degree distribusi yang diusulkan ℎ􁈺𝑥􁈻􀵌􁈼􁉀􀵫8,2􀵯,1􁉁􁈽 dan Λ 􀯠􁈺𝑥􁈻􀵌􁈼􁉀􀵫3,2􀵯,0.2􁈻,􁈺􀵫4,2􀵯,0.8􁈻􁉁􁈽 dengan hasil throughput sebelum fading Th 􀵌0.35 paket/slot dan Tm 􀵌0.32 paket/slot, sedangkan setelah fading Th 􀵌0.34 paket/slot dan Tm 􀵌0.22 paket/slot.Kata kunci : MDS codes, CRA, human, machines, EXIT chart ABSTRACTFuture wireless network involving machines and human communications.This research proposed new concept of network coding based on Maximum Distance Separable (MDS) codes. Designed optimally sub-optimal degree distribution for prioritizing human using projected EXIT chart. This research fundamental multiple access scheme for wireless super-dense network using Coded Random Access (CRA). In this research, proposed scheme under Binary Erasure Channel (BEC) to model a network. We evaluate the performance for human and machines group in terms of throughput and packet-loss-rate, and the result are then verified using frequency-flat Rayleigh fading. We have proposed sub-optimal degree distributions are Λ ℎ􁈺𝑥􁈻􀵌􁈼􁉀􀵫8,2􀵯,1􁉁􁈽 and Λ 􀯠􁈺𝑥􁈻􀵌􁉄􁉀􀵫3,2􀵯,0.2􁈻,􁈺􀵫4,2􀵯,0.8􁈻􁉁􁉅, the resulting throughput Th 􀵌0.35 packet/slot and Tm 􀵌0.32 packet/slot under fading and without fading Th 􀵌0.34 packet/slot and Tm 􀵌0.22 packet/slot.Keywords: MDS codes, CRA, human, machines, EXIT chart

Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
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.

Random linear network coding is widely proposed as the solution for practical network coding applications due to the robustness to random packet loss, packet delays as well as network topology and capacity changes. In order to implement random linear network coding in practical scenarios where the encoding and decoding methods perform efficiently, the computational complex coding algorithms associated with random linear network coding must be overcome. This research contributes to the field of practical random linear network coding by presenting new, low complexity coding algorithms with low decoding delay. In this thesis we contribute to this research field by building on the current solutions available in the literature through the utilisation of familiar coding schemes combined with methods from other research areas, as well as developing innovative coding methods. We show that by transmitting source symbols in predetermined and constrained patterns from the source node, the causality of the random linear network coding network can be used to create structure at the receiver nodes. This structure enables us to introduce an innovative decoding scheme of low decoding delay. This decoding method also proves to be resilient to the effects of packet loss on the structure of the received packets. This decoding method shows a low decoding delay and resilience to packet erasures, that makes it an attractive option for use in multimedia multicasting. We show that fountain codes can be implemented in RLNC networks without changing the complete coding structure of RLNC networks. By implementing an adapted encoding algorithm at strategic intermediate nodes in the network, the receiver nodes can obtain encoded packets that approximate the degree distribution of encoded packets required for successful belief propagation decoding. Previous work done showed that the redundant packets generated by RLNC networks can be used for error detection at the receiver nodes. This error detection method can be implemented without implementing an outer code; thus, it does not require any additional network resources. We analyse this method and show that this method is only effective for single error detection, not correction. In this thesis the current body of knowledge and technology in practical random linear network coding is extended through the contribution of effective decoding techniques in practical network coding networks. We present both analytical and simulation results to show that the developed techniques can render low complexity coding algorithms with low decoding delay in RLNC networks.
Thesis (PhD (Computer Engineering))--North-West University, Potchefstroom Campus, 2013

Wireless digital broadcasting applications such as digital audio broadcast (DAB) and digital video broadcast (DVB) are becoming increasingly popular since the digital format allows for quality improvements as compared to traditional analogue broadcast. The broadcasting is commonly based on packet transmission. In this thesis, we consider broadcasting over packet erasure channels. To achieve reliable transmission, error-control schemes are needed. By carefully designing the error-control schemes, transmission efficiency can be improved compared to traditiona lautomatic repeat-request (ARQ) schemes and rateless codes. Here, we first study the application of a novel binary deterministic rateless (BDR) code. Then, we focus on the design of network coding for the wireless broadcasting system, which can significantly improve the system performance compared to traditional ARQ. Both the one-hop broadcasting system and a relay-aided broadcasting system areconsidered. In the one-hop broadcasting system, we investigate the application of systematic BDR (SBDR) codes and instantaneously decodable network coding (IDNC). For the SBDR codes, we determine the number of encoded redundancy packets that guarantees high broadcast transmission efficiencies and simultaneous lowcomplexity. Moreover, with limited feedback the efficiency performance can be further improved. Then, we propose an improved network coding scheme that can asymptotically achieve the theoretical lower bound on transmission overhead for a sufficiently large number of information packets. In the relay-aided system, we consider a scenario where the relay node operates in half duplex mode, and transmissions from the BS and the relay, respectively, are over orthogonal channels. Based on random network coding, a scheduling problem for the transmissions of redundancy packets from the BS and the relay is formulated. Two scenarios; namely instantaneous feedback after each redundancy packet, and feedback after multiple redundancy packets are investigated. We further extend the algorithms to multi-cell networks. Besides random network coding, IDNC based schemes are proposed as well. We show that significant improvements in transmission efficiency are obtained as compared to previously proposed ARQ and network-coding-based schemes.
QC 20110907

Optimising the throughput performance for wireless networks is one of the challenging tasks in the objectives of communication engineering, since wireless channels are prone to errors due to path losses, random noise, and fading phenomena. The transmission errors will be worse in a multihop scenario due to its accumulative effects. Network Coding (NC) is an elegant technique to improve the throughput performance of a communication network. There is the fact that the bit error rates over one modulation symbol of 16- and higher order- Quadrature Amplitude Modulation (QAM) scheme follow a certain pattern. The Scattered Random Network Coding (SRNC) system was proposed in the literature to exploit the error pattern of 16-QAM by using bit-scattering to improve the throughput of multihop network to which is being applied the Random Linear Network Coding (RLNC). This thesis aims to improve further the SRNC system by using Forward Error Correction (FEC) code; the proposed system is called Joint RLNC and FEC with interleaving. The first proposed system (System-I) uses Convolutional Code (CC) FEC. The performances analysis of System-I with various CC rates of 1/2, 1/3, 1/4, 1/6, and 1/8 was carried out using the developed simulation tools in MATLAB and compared to two benchmark systems: SRNC system (System-II) and RLNC system (System- III). The second proposed system (System-IV) uses Reed-Solomon (RS) FEC code. Performance evaluation of System IV was carried out and compared to three systems; System-I with 1/2 CC rate, System-II, and System-III. All simulations were carried out over three possible channel environments: 1) AWGN channel, 2) a Rayleigh fading channel, and 3) a Rician fading channel, where both fading channels are in series with the AWGN channel. The simulation results show that the proposed system improves the SRNC system. How much improvement gain can be achieved depends on the FEC type used and the channel environment.

The objective of this research is to develop a Markovian model in the form of a discrete-time queueing network to assess the performance of random access code division multiple access networks (CDMA). An approximation method called equilibrium point analysis (EPA) has been used to solve the model. The CDMA protocol IS an important application of spread spectrum communications that allows simultaneous transmission of multiple users to occupy a wideband channel with small interference. This is done by assigning each user a unique pseudo noise code sequence. These codes have low cross-correlation between each pair of sequences. Both slotted direct sequence CDMA (DS) and frequency hopping CDMA (FH) are considered with an emphasis on DS-CDMA systems. The EPA method has previously been used to evaluate the performance of other random access systems such as the ALOHA protocol, but has not previously been used in the context of a CDMA protocol. Throughput and mean packet delay of random access CDMA networks are evaluated, since these two measures are usually used in the study of the performance assessment of mUltiple access protocols. The analytical results of the random access model are validated against a discrete-event simulation which is run for large number of slots. The study then proceeds by using the model to examine the effect on performance of introducing error correcting codes to the DS-CDMA systems. Optimum error correcting codes that give the best performances in terms of the throughput and the delay are determined. The perfonnance of random access CDMA systems applied to radio channels, as in packet radio networks, is then studied, and the effect of multipath fading on the perfonnance is evaluated. Finally, the perfonnance of DS-CDMA with different user classes (non-identical users case) is investigated. An extended equilibrium point analysis (EEPA) method has been used to solve the Markovian model in this situation. This extended model is used to assess the effects on perfonnance of the unequal powers due to varying distances of the users to an intended receiver or to a base station (near-far problem).

This thesis investigates a graph and information theoretic approach to design and analysis of low-density parity-check (LDPC) codes and wireless networks. In this work, both LDPC codes and wireless networks are considered as random graphs. This work proposes solutions to important theoretic and practical open problems in LDPC coding, and for the first time introduces a framework for analysis of finite wireless networks. LDPC codes are considered to be one of the best classes of error-correcting codes. In this thesis, several problems in this area are studied. First, an improved decoding algorithm for LDPC codes is introduced. Compared to the standard iterative decoding, the proposed decoding algorithm can result in several orders of magnitude lower bit error rates, while having almost the same complexity. Second, this work presents a variety of bounds on the achievable performance of different LDPC coding scenarios. Third, it studies rate-compatible LDPC codes and provides fundamental properties of these codes. It also shows guidelines for optimal design of rate-compatible codes. Finally, it studies non-uniform and unequal error protection using LDPC codes and explores their applications to data storage systems and communication networks. It presents a new error-control scheme for volume holographic memory (VHM) systems and shows that the new method can increase the storage capacity by more than fifty percent compared to previous schemes. This work also investigates the application of random graphs to the design and analysis of wireless ad hoc and sensor networks. It introduces a framework for analysis of finite wireless networks. Such framework was lacking from the literature. Using the framework, different network properties such as capacity, connectivity, coverage, and routing and security algorithms are studied. Finally, connectivity properties of large-scale sensor networks are investigated. It is shown how unreliability of sensors, link failures, and non-uniform distribution of nodes affect the connectivity of sensor networks.

The intent of this research is to provide a performance analysis of multiple access protocols in packet-switched Very Small Aperture Terminal (VSAT) satellite communication networks. This research consisted of three major thrusts. First, we analyzed the average time delay of the broadcast Time Division Multiplexing (TDM) outbound channel (hub to VSAT). Second, a throughput performance analysis of an asynchronous Direct-Sequence Code Division Multiple Access (DS-CDMA) communication system is carried out for the inbound line (VSAT to hub). Each channel was characterized by its bit error probability, and transmits fixed-length packets generated according to a Poisson process in an unslotted environment. Third, we presented a delay analysis of the ALOHA DS-CDMA/TDM channel to determine the total service time of a packet originating from either the VSAT or the hub station. In addition to its multiple access capability, this thesis is concerned with the use of direct-sequence spread-spectrum signaling primarily because of its ability to combat interference. Emphasis is placed on average throughput performance, and on the average packet delay after solving for the steady state probability generating function of the station queue size. Then, a discussion of the effect of finite buffer size, and an analysis relating the probability of buffer overflow to packet statistics and buffer size is presented. Because of the bursty nature of a traffic originating from the VSAT’s, the Automatic Repeat Request (ARQ) technique used for error control is the Stop-and-Wait (SW) protocol. It is used as a retransmission strategy in both the Asynchronous Time Division Multiplexing (ASTDM) and the ALOHA DS-CDMA channels.
M.S.

Ce manuscrit est centré sur la conception, l'amélioration et l'évaluation des protocoles des couches RESEAU, MAC et PHY. En particulier, nous nous focalisons sur la conception de nouveaux protocoles distribués pour une utilisation optimale/améliorée des ressources radio disponibles. Par ailleurs, nous caractérisons les performances des réseaux ad hoc à accès aléatoire au canal en utilisant des paramètres de plusieurs couches avec aptitude de transfert d'information (data forwarding). La majeure partie de nos analyses se base sur le concept d'interaction entre les couches OSI (cross-layer). En effet, cette nouvelle et attractive approche est devenue en peu de temps omniprésente dans le domaine de recherche et développement et dans le domaine industriel. Les métriques de performances qui nous intéressent sont la stabilité des files d'attentes de transfert, le débit, le délai et la consommation d'énergie. Principalement, la compréhension de l'interaction entre les couches MAC/PHY et routage du standard IEEE 802.11e DCF/EDCF, d'une part, et l'interaction entre noeuds en terme d'interférences, d'autre part, constituent le coeur central de notre travail

La quinta generación de redes móviles (5G) se encuentra a la vuelta de la esquina. Se espera provea de beneficios extraordinarios a la población y que resuelva la mayoría de los problemas de las redes 4G actuales. El éxito de 5G, cuya primera fase de estandarización ha sido completada, depende de tres pilares: comunicaciones tipo-máquina masivas, banda ancha móvil mejorada y comunicaciones ultra fiables y de baja latencia (mMTC, eMBB y URLLC, respectivamente). En esta tesis nos enfocamos en el primer pilar de 5G, mMTC, pero también proveemos una solución para lograr eMBB en escenarios de distribución masiva de contenidos. Específicamente, las principales contribuciones son en las áreas de: 1) soporte eficiente de mMTC en redes celulares; 2) acceso aleatorio para el reporte de eventos en redes inalámbricas de sensores (WSNs); y 3) cooperación para la distribución masiva de contenidos en redes celulares. En el apartado de mMTC en redes celulares, esta tesis provee un análisis profundo del desempeño del procedimiento de acceso aleatorio, que es la forma mediante la cual los dispositivos móviles acceden a la red. Estos análisis fueron inicialmente llevados a cabo por simulaciones y, posteriormente, por medio de un modelo analítico. Ambos modelos fueron desarrollados específicamente para este propósito e incluyen uno de los esquemas de control de acceso más prometedores: access class barring (ACB). Nuestro modelo es uno de los más precisos que se pueden encontrar en la literatura y el único que incorpora el esquema de ACB. Los resultados obtenidos por medio de este modelo y por simulación son claros: los accesos altamente sincronizados que ocurren en aplicaciones de mMTC pueden causar congestión severa en el canal de acceso. Por otro lado, también son claros en que esta congestión se puede prevenir con una adecuada configuración del ACB. Sin embargo, los parámetros de configuración del ACB deben ser continuamente adaptados a la intensidad de accesos para poder obtener un desempeño óptimo. En la tesis se propone una solución práctica a este problema en la forma de un esquema de configuración automática para el ACB; lo llamamos ACBC. Los resultados muestran que nuestro esquema puede lograr un desempeño muy cercano al óptimo sin importar la intensidad de los accesos. Asimismo, puede ser directamente implementado en redes celulares para soportar el tráfico mMTC, ya que ha sido diseñado teniendo en cuenta los estándares del 3GPP. Además de los análisis descritos anteriormente para redes celulares, se realiza un análisis general para aplicaciones de contadores inteligentes. Es decir, estudiamos un escenario de mMTC desde la perspectiva de las WSNs. Específicamente, desarrollamos un modelo híbrido para el análisis de desempeño y la optimización de protocolos de WSNs de acceso aleatorio y basados en cluster. Los resultados muestran la utilidad de escuchar el medio inalámbrico para minimizar el número de transmisiones y también de modificar las probabilidades de transmisión después de una colisión. En lo que respecta a eMBB, nos enfocamos en un escenario de distribución masiva de contenidos, en el que un mismo contenido es enviado de forma simultánea a un gran número de usuarios móviles. Este escenario es problemático, ya que las estaciones base de la red celular no cuentan con mecanismos eficientes de multicast o broadcast. Por lo tanto, la solución que se adopta comúnmente es la de replicar e contenido para cada uno de los usuarios que lo soliciten; está claro que esto es altamente ineficiente. Para resolver este problema, proponemos el uso de esquemas de network coding y de arquitecturas cooperativas llamadas nubes móviles. En concreto, desarrollamos un protocolo para la distribución masiva de contenidos, junto con un modelo analítico para su optimización. Los resultados demuestran que el modelo propuesto es simple y preciso, y que el protocolo puede reducir el con
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

AbstractTransforming sketches into digital 3D models has been an enduring practice in the design process since the first digital turn in architecture. However, 3D modeling is time-consuming, and 3D modeling software usually has a cumbersome interface. Aiming to bridge the gap between sketch and 3D model, we propose a framework that can turn a hand-drawn 2D sketch into a 3D mesh. The user can draw a sketch on the canvas through a web-based interface, and the corresponding 3D model will automatically be generated and shown aside. The 3D model can be downloaded or synchronized into the Rhino directly through Grasshopper.The proposed framework uses a machine learning-based approach to generate a 3D mesh from a single hand-drawn sketch by deforming a template shape. Since the generated models have an uneven surface, we apply an optimization step to refine the form, creating a more usable architectural 3D model with planar faces and sharper edges. We create the Simple House Dataset, which consists of 5000 single-volume houses, to train the neural network. We defined five categories of house typologies - distinguished by roof shape and other geometric properties - and generated 1000 models for each class with parameters chosen randomly. Each model includes a 3D mesh and 20 perspective line drawings from different angles.Although the limitation of the generalization ability makes it unlikely to replace the conventional 3D modeling software today, the fast sketch to 3D transformation allows architects to explore the possibility of various architectural forms and may speed up the design process in the early stage. The code of this project and the Simple House dataset has been published on Github [29].

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.

The interdisciplinary field of neuroscience has made significant progress in recent decades, providing the scientific community in general with a new level of understanding on how the brain works beyond the store-and-fire model found in traditional neural networks. Meanwhile, Machine Learning (ML) based on established models has seen a surge of interest in the High Performance Computing (HPC) community, especially through the use of high-end accelerators, such as Graphical Processing Units(GPUs), including HPC clusters of same. In our work, we are motivated to exploit these high-performance computing developments and understand the scaling challenges for new–biologically inspired–learning models on leadership-class HPC resources. These emerging models feature sparse and random connectivity profiles that map to more loosely-coupled parallel architectures with a large number of CPU cores per node. Contrasted with traditional ML codes, these methods exploit loosely-coupled sparse data structures as opposed to tightly-coupled dense matrix computations, which benefit from SIMD-style parallelism found on GPUs. In this paper we introduce a hybrid Message Passing Interface (MPI) and Open Multi-Processing (OpenMP) parallelization scheme to accelerate and scale our computational model based on the dynamics of cortical tissue. We ran computational tests on a leadership class visualization and analysis cluster at Argonne National Laboratory. We include a study of strong and weak scaling, where we obtained parallel efficiency measures with a minimum above 87% and a maximum above 97% for simulations of our biologically inspired neural network on up to 64 computing nodes running 8 threads each. This study shows promise of the MPI+OpenMP hybrid approach to support flexible and biologically-inspired computational experimental scenarios. In addition, we present the viability in the application of these strategies in high-end leadership computers in the future.

Intra-refresh macroblocks and data partitioning are two error-resilience tools aimed at video streaming over wireless networks. Intra-refresh macroblocks avoids the repetitive delays associated with periodic intra-coded frames, while also arresting temporal error propagation. Data-partitioning divides a compressed data stream according to the data importance, allowing packet prioritization schemes to be designed. This chapter reviews these and other error-resilience tools from the H.264 codec. As an illustration of the use of these tools, the chapter demonstrates a wireless access scheme that selectively drops packets that carry intra-refresh macroblocks. This counter-intuitive scheme actually results in better video quality than if packets containing transform coefficients were to be selectively dropped. Dropping only occurs when in the presence of wireless network congestion, as at other times the intra-coded macroblocks protect the video against random bit errors. Any packet dropping takes place under IEEE 802.11e, which is a quality-of-service addition to the IEEE 802.11 standard for wireless LANs. The chapter shows that, by this scheme, when congestion occurs, it is possible to gain up to 2 dB in video quality over assigning a stream to a single IEEE 802.11e access category. The scheme is shown to be consistently advantageous in indoor and outdoor wireless scenarios over other ways of assigning the partitioned data packets to different access categories. The chapter also contains a review of other research ideas using intra-refresh macroblocks and data-partitioning, as well as a look at the research outlook, now that the High Efficiency Video Codec (HEVC) has been released.