- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
[IEEE 2019 PhotonIcs & Electromagnetics Research Symposium - Spring (PIERS-Spring) - Rome, Italy (2019.6.17-2019.6.20)] 2019 PhotonIcs & Electromagnetics Research Symposium - Spring (PIERS-Spring) - Analog Radio-over-fiber WDM-PON Architecture for 5G Millimeter-wave Interface
摘要： As the standardization of network-assisted device-to-device (D2D) communications by the Third Generation Partnership Project progresses, the research community has started to explore the technology potential of new advanced features that will largely impact the performance of 5G networks. For 5G, D2D is becoming an integrative term of emerging technologies that take an advantage of the proximity of communicating entities in licensed and unlicensed spectra. The European 5G research project Mobile and Wireless Communication Enablers for the 2020 Information Society (METIS) has identified advanced D2D as a key enabler for a variety of 5G services, including cellular coverage extension, social proximity, and communicating vehicles. In this paper, we review the METIS D2D technology components in three key areas of proximal communications—network-assisted multi-hop, full-duplex, and multi-antenna D2D communications—and argue that the advantages of properly combining cellular and ad hoc technologies help to meet the challenges of the information society beyond 2020.
关键词： vehicular communications,MIMO systems,full duplex,Device-to-device communications,network coding,cooperative communications
更新于2025-09-23 15:21:01
-
[IEEE 2019 Photonics & Electromagnetics Research Symposium - Fall (PIERS - Fall) - Xiamen, China (2019.12.17-2019.12.20)] 2019 Photonics & Electromagnetics Research Symposium - Fall (PIERS - Fall) - Low-voltage Si-Ge Avalanche Photodiodes for Datacom
摘要： Vector linear network coding (LNC) is a generalization of the conventional scalar LNC, such that the data unit transmitted on every edge is an L-dimensional vector of data symbols over a base field GF(q). Vector LNC enriches the choices of coding operations at intermediate nodes, and there is a popular conjecture on the benefit of vector LNC over scalar LNC in terms of alphabet size of data units: there exist (single-source) multicast networks that are vector linearly solvable of dimension L over GF(q) but not scalar linearly solvable over any field of size q' ≤ q^L. This paper introduces a systematic way to construct such multicast networks, and subsequently establish explicit instances to affirm the positive answer of this conjecture for infinitely many alphabet sizes p^L with respect to an arbitrary prime p. On the other hand, this paper also presents explicit instances with the special property that they do not have a vector linear solution of dimension L over GF(2) but have scalar linear solutions over GF(q') for some q' < 2^L, where q' can be odd or even. This discovery also unveils that over a given base field, a multicast network that has a vector linear solution of dimension L does not necessarily have a vector linear solution of dimension L' > L.
关键词： alphabet size,direct sum,scalar network coding,multicast networks,Vector network coding
更新于2025-09-23 15:19:57
-
[IEEE 2019 Photonics & Electromagnetics Research Symposium - Fall (PIERS - Fall) - Xiamen, China (2019.12.17-2019.12.20)] 2019 Photonics & Electromagnetics Research Symposium - Fall (PIERS - Fall) - Adjustable Dual-frequency FSS-amplifier Metasurface
摘要： Asynchronous network coding has the potential to improve wireless network performance compared with simple routing. However, to achieve the maximum network coding gain, the encoding node consumes a few computing and storage resources that may be unaffordable for wireless sensor networks such as CubeSats. An analogous threshold strategy, called best effort network coding (BENC), which requires only minimal storage resources and no computing resources, is investigated in this paper as an efficient and convenient method of network coding. In this strategy, a new packet arrival evicts the head packet when the queue is full to avoid excessively long waits. Moreover, in contrast to other methods that require a queue for each flow, the BENC uses only one queue for the two coded flows. In addition, the problem of time interval distribution for the output flow, which combines two independent flows, is investigated, and the network coding gain is then analyzed. While the maximum coding gain requires infinite buffer capacity under two independent Poisson arrivals with the same transmission rates, the calculation results show that the BENC needs only 4 buffers to achieve 90% of the maximum coding gain and can reach 99% of the maximum coding gain using 50 buffers. These results are verified by numerical simulations.
关键词： wireless sensor networks,queue capacity,best effort,queueing analysis,Network coding
更新于2025-09-23 15:19:57
-
Resonant Beam Communications with Photovoltaic Receiver for Optical Data and Power Transfer
摘要： Asynchronous network coding has the potential to improve wireless network performance compared with simple routing. However, to achieve the maximum network coding gain, the encoding node consumes a few computing and storage resources that may be unaffordable for wireless sensor networks such as CubeSats. An analogous threshold strategy, called best effort network coding (BENC), which requires only minimal storage resources and no computing resources, is investigated in this paper as an efficient and convenient method of network coding. In this strategy, a new packet arrival evicts the head packet when the queue is full to avoid excessively long waits. Moreover, in contrast to other methods that require a queue for each flow, the BENC uses only one queue for the two coded flows. In addition, the problem of time interval distribution for the output flow, which combines two independent flows, is investigated, and the network coding gain is then analyzed. While the maximum coding gain requires infinite buffer capacity under two independent Poisson arrivals with the same transmission rates, the calculation results show that the BENC needs only 4 buffers to achieve 90% of the maximum coding gain and can reach 99% of the maximum coding gain using 50 buffers. These results are verified by numerical simulations.
关键词： queueing analysis,queue capacity,Network coding,wireless sensor networks,best effort
更新于2025-09-23 15:19:57
-
A New High-Frequency Characterization for Coupled Transmission Lines Fabricated on Lossy Organic Substrates
摘要： In the current study of cognitive relay networks, most related works focus on the effect of interference from secondary users (SUs) to primary receivers (PRs), while neglecting the links from primary transmitters (PTs) to SUs. In this paper, the interference both from SUs to PRs and from PTs to SUs is considered in the analysis of cognitive two-way relay networks with opportunistic relay selection. The exact closed-form expression for the outage probability of the secondary system is derived over Rayleigh fading channels, which is verified through various Monte Carlo simulations. Meanwhile, an asymptotic expression and diversity order are also derived to reveal additional insights into the effect of the mutual interference between the primary and secondary systems on the diversity. Above all, based on the analysis, the effects of the positions of the PT, the PR, and secondary relays on the outage performance of the secondary system are studied. Our results reveal that network placement planning is desperately necessary to achieve a better outage performance. It is shown that the position of relays has a strong impact on the performance, particularly when the number of relays is large. However, when the relative position between the primary system and secondary systems is fixed, the positions of the PT have a very slight impact on the outage performance, which can be neglected. Hence, in practical deployment, when performing cognitive two-way relaying with opportunistic relay selection, proper network placement planning should be carefully addressed.
关键词： physical-layer network coding (PNC),opportunistic relay selection,Cognitive two-way relay networks,system outage performance
更新于2025-09-23 15:19:57
-
Compact Three Phase Multilevel Inverter for Low and Medium Power Photovoltaic Systems
摘要： Asynchronous network coding has the potential to improve wireless network performance compared with simple routing. However, to achieve the maximum network coding gain, the encoding node consumes a few computing and storage resources that may be unaffordable for wireless sensor networks such as CubeSats. An analogous threshold strategy, called best effort network coding (BENC), which requires only minimal storage resources and no computing resources, is investigated in this paper as an efficient and convenient method of network coding. In this strategy, a new packet arrival evicts the head packet when the queue is full to avoid excessively long waits. Moreover, in contrast to other methods that require a queue for each flow, the BENC uses only one queue for the two coded flows. In addition, the problem of time interval distribution for the output flow, which combines two independent flows, is investigated, and the network coding gain is then analyzed. While the maximum coding gain requires infinite buffer capacity under two independent Poisson arrivals with the same transmission rates, the calculation results show that the BENC needs only 4 buffers to achieve 90% of the maximum coding gain and can reach 99% of the maximum coding gain using 50 buffers. These results are verified by numerical simulations.
关键词： wireless sensor networks,queue capacity,best effort,queueing analysis,Network coding
更新于2025-09-23 15:19:57
-
[IEEE 2019 Photonics & Electromagnetics Research Symposium - Fall (PIERS - Fall) - Xiamen, China (2019.12.17-2019.12.20)] 2019 Photonics & Electromagnetics Research Symposium - Fall (PIERS - Fall) - Dynamically Tunable Four Band Filtering Attenuator Based on Graphene Integrated Microstrip Multi-mode Resonator
摘要： In the current study of cognitive relay networks, most related works focus on the effect of interference from secondary users (SUs) to primary receivers (PRs), while neglecting the links from primary transmitters (PTs) to SUs. In this paper, the interference both from SUs to PRs and from PTs to SUs is considered in the analysis of cognitive two-way relay networks with opportunistic relay selection. The exact closed-form expression for the outage probability of the secondary system is derived over Rayleigh fading channels, which is verified through various Monte Carlo simulations. Meanwhile, an asymptotic expression and diversity order are also derived to reveal additional insights into the effect of the mutual interference between the primary and secondary systems on the diversity. Above all, based on the analysis, the effects of the positions of the PT, the PR, and secondary relays on the outage performance of the secondary system are studied. Our results reveal that network placement planning is desperately necessary to achieve a better outage performance. It is shown that the position of relays has a strong impact on the performance, particularly when the number of relays is large. However, when the relative position between the primary system and secondary systems is fixed, the positions of the PT have a very slight impact on the outage performance, which can be neglected. Hence, in practical deployment, when performing cognitive two-way relaying with opportunistic relay selection, proper network placement planning should be carefully addressed.
关键词： physical-layer network coding (PNC),Cognitive two-way relay networks,system outage performance,opportunistic relay selection
更新于2025-09-23 15:19:57
-
[IEEE 2019 PhotonIcs & Electromagnetics Research Symposium - Spring (PIERS-Spring) - Rome, Italy (2019.6.17-2019.6.20)] 2019 PhotonIcs & Electromagnetics Research Symposium - Spring (PIERS-Spring) - Solution-Processed Electrodes for Flexible Organic and Perovskite Solar Cells
摘要： In an acyclic multicast network, it is well known that a linear network coding solution over GF(q) exists when q is sufficiently large. In particular, for each prime power q no smaller than the number of receivers, a linear solution over GF(q) can be efficiently constructed. In this paper, we reveal that a linear solution over a given finite field does not necessarily imply the existence of a linear solution over all larger finite fields. In particular, we prove by construction that: 1) for every ω ≥ 3, there is a multicast network with source outdegree ω linearly solvable over GF(7) but not over GF(8), and another multicast network linearly solvable over GF(16) but not over GF(17); 2) there is a multicast network linearly solvable over GF(5) but not over such GF(q) that q > 5 is a Mersenne prime plus 1, which can be extremely large; 3) a multicast network linearly solvable over GF(q m1 ) and over GF(q m2 ) is not necessarily linearly solvable over GF(q m1+m2 ); and 4) there exists a class of multicast networks with a set T of receivers such that the minimum field size qmin for a linear solution over GF(qmin) is lower bounded by (cid:3)( |T |), but not every larger field than GF(qmin) suffices to yield a linear solution. The insight brought from this paper is that not only the field size but also the order of subgroups in the multiplicative group of a finite field affects the linear solvability of a multicast network.
关键词： multicast network,field size,lower bound,Linear network coding,Mersenne prime
更新于2025-09-19 17:13:59
-
[IEEE 2018 International Conference Laser Optics (ICLO) - St. Petersburg (2018.6.4-2018.6.8)] 2018 International Conference Laser Optics (ICLO) - Investigation of the Magneto-Optical Properties of Europium Containing Fluorides
摘要： Compute-and-forward (C&F) relaying in a multi-source multirelay network is studied in this letter and two novel algorithms are proposed, addressing choice of integer matrix, taking into account the effect of singularity. The first algorithm assumes that there is no co-operation between the nodes for choosing proper integer vectors in the relay nodes; this method is referred to as “blind C&F” and an algorithm is proposed which guarantees that each relay chooses the best integer vector that contains information from at least m source nodes. In the second algorithm that is described as “partially coordinated C&F,” we assume that partial cooperation between the relay nodes and propose to exchange a single variable with which the relays are sorted for transmission. The performance of the proposed algorithm is nearly equivalent with optimal relaying, which requires significant overhead signaling.
关键词： Computation Rate,Physical layer Network Coding,Compute-and-Forward
更新于2025-09-19 17:13:59
-
[IEEE 2019 IEEE International Conference on Signal and Image Processing Applications (ICSIPA) - Kuala Lumpur, Malaysia (2019.9.17-2019.9.19)] 2019 IEEE International Conference on Signal and Image Processing Applications (ICSIPA) - Real-time Motion Detection in Extremely Subsampled Compressive Sensing Video
摘要： Asynchronous network coding has the potential to improve wireless network performance compared with simple routing. However, to achieve the maximum network coding gain, the encoding node consumes a few computing and storage resources that may be unaffordable for wireless sensor networks such as CubeSats. An analogous threshold strategy, called best effort network coding (BENC), which requires only minimal storage resources and no computing resources, is investigated in this paper as an efficient and convenient method of network coding. In this strategy, a new packet arrival evicts the head packet when the queue is full to avoid excessively long waits. Moreover, in contrast to other methods that require a queue for each flow, the BENC uses only one queue for the two coded flows. In addition, the problem of time interval distribution for the output flow, which combines two independent flows, is investigated, and the network coding gain is then analyzed. While the maximum coding gain requires infinite buffer capacity under two independent Poisson arrivals with the same transmission rates, the calculation results show that the BENC needs only 4 buffers to achieve 90% of the maximum coding gain and can reach 99% of the maximum coding gain using 50 buffers. These results are verified by numerical simulations.
关键词： wireless sensor networks,queue capacity,best effort,queueing analysis,Network coding
更新于2025-09-19 17:13:59