SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "L773:1229 2370 OR L773:1976 5541 srt2:(2015-2019)"

Sökning: L773:1229 2370 OR L773:1976 5541 > (2015-2019)

  • Resultat 1-8 av 8
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Huang, Song, et al. (författare)
  • Bandwidth Partition and Allocation for Efficient Spectrum Utilization in Cognitive Communications
  • 2019
  • Ingår i: Journal of Communications and Networks. - : KOREAN INST COMMUNICATIONS SCIENCES (K I C S). - 1229-2370 .- 1976-5541. ; 21:4, s. 353-364
  • Tidskriftsartikel (refereegranskat)abstract
    • Conventional cognitive communications rely heavily on the smartness of secondary (unlicensed) users (SUs) to achieve high spectrum utilization, which involves the optimization of the SUs policies and behaviors for dynamic spectrum access, power allocation among multiple channels, etc. Due to the inherent randomness of the primary users (PUs) transmission, those efforts inevitably increase the implementation complexity and sensing overheads of the SUs, and in turn lower the spectrum utilization efficiency. In this paper, we try to change the focus from SU to PU. A cooperative traffic allocation strategy for PU, together with the non-uniform bandwidth partition, is employed to regularize the PUs resource occupancy pattern without compromising its performance, and to maximize the spare bandwidth for the SU at the same time. We first study the capacity based optimization problem (COP) together with the fully polynomial time approximation scheme (FPTAS) for an approximation guarantee of the global optimum. Then we analyze the subcarrier based optimization problem as the surrogate problem of COP, which can be solved by a greedy algorithm exactly. Both the theoretical analysis and the numerical simulations demonstrate the effectiveness of those methods to achieve the performance that almost identical to that of the global optimum solution.
  •  
2.
  • Kosta, Antzela, et al. (författare)
  • Age of Information Performance of Multiaccess Strategies with Packet Management
  • 2019
  • Ingår i: Journal of Communications and Networks. - : KOREAN INST COMMUNICATIONS SCIENCES (K I C S). - 1229-2370 .- 1976-5541. ; 21:3, s. 244-255
  • Tidskriftsartikel (refereegranskat)abstract
    • We consider a system consisting of N source nodes communicating with a common receiver. Each source node has a buffer of infinite capacity to store incoming bursty traffic in the form of status updates transmitted in packets, which should maintain the status information at the receiver fresh. Packets waiting for transmission can be discarded to avoid wasting network resources for the transmission of stale information. We investigate the age of information (AoI) performance of the system under scheduled and random access. Moreover, we present analysis of the AoI with and without packet management at the transmission queue of the source nodes, where as packet management we consider the capability to replace unserved packets at the queue whenever newer ones arrive. Finally, we provide simulation results that illustrate the impact of the network operating parameters on the age performance of the different access protocols.
  •  
3.
  • Pappas, Nikolaos, et al. (författare)
  • Effect of Energy Harvesting on Stable Throughput in Cooperative Relay Systems
  • 2016
  • Ingår i: Journal of Communications and Networks. - : KOREAN INST COMMUNICATIONS SCIENCES (K I C S). - 1229-2370 .- 1976-5541. ; 18:2, s. 261-269
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, the impact of energy constraints on a two hop network with a source, a relay and a destination under random medium access is studied. A collision channel with erasures is considered, and the source and the relay nodes have energy harvesting capabilities and an unlimited battery to store the harvested energy. Additionally, the source and the relay node have external traffic arrivals and the relay forwards a fraction of the source nodes traffic to the destination; the cooperation is performed at the network level. An inner and an outer bound of the stability region for a given transmission probability vector are obtained. Then, the closure of the inner and the outer bound is obtained separately and they turn out to be identical. This work is not only a step in connecting information theory and networking, by studying the maximum stable throughput region metric but also it taps the relatively unexplored and important domain of energy harvesting and assesses the effect of that on this important measure.
  •  
4.
  • Pappas, Nikolaos, 1982-, et al. (författare)
  • Wireless Network-Level Partial Relay Cooperation: A Stable Throughput Analysis
  • 2018
  • Ingår i: Journal of Communications and Networks. - 1229-2370 .- 1976-5541. ; 20:1, s. 93-101
  • Tidskriftsartikel (refereegranskat)abstract
    • In this work, we study the benefit of partial relay cooperation. We consider a two-node system consisting of one source and one relay node transmitting information to a common destination. The source and the relay have external traffic and in addition, the relay is equipped with a flow controller to regulate the incoming traffic from the source node. The cooperation is performed at the network level. A collision channel with erasures is considered. We provide an exact characterization of the stability region of the system and we also prove that the system with partial cooperation is always better or at least equal to the system without the flow controller. 
  •  
5.
  • Setterqvist, Eric, 1980-, et al. (författare)
  • Real-Time Communication Systems based on Taut Strings
  • 2018
  • Ingår i: Journal of Communications and Networks. - : IEEE. - 1229-2370 .- 1976-5541. ; 20:2, s. 207-218
  • Tidskriftsartikel (refereegranskat)abstract
    • We consider buffered real-time communication over channels with time-dependent capacities which are known in advance. The real-time constraint is imposed in terms of limited transmission time between sender and receiver. For a network consisting of a single channel it is shown that there is a coding rate strategy, geometrically characterized as a taut string, which minimizes the average distortion with respect to all convex distortionrate functions. Utilizing the taut string characterization further, an algorithm that computes the optimal coding rate strategy is provided. We then consider more general networks with several connected channels in parallel or series with intermediate buffers. It is shown that also for these networks there is a coding rate strategy, geometrically characterized as a taut string, which minimizes the average distortion with respect to all convex distortion-rate functions. The optimal offline strategy provides a benchmark for the evaluation of different coding rate strategies. Further, it guides us in the construction of a simple but rather efficient strategy for channels in the online setting which alternates between a good and a bad state.
  •  
6.
  • Xing, Weijun, et al. (författare)
  • Multi-Source Network-Coded D2D Cooperative Content Distribution Systems
  • 2018
  • Ingår i: Journal of Communications and Networks. - : KOREAN INST COMMUNICATIONS SCIENCES (K I C S). - 1229-2370 .- 1976-5541. ; 20:1, s. 69-84
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we investigate the information transmission in a typical 5G device-to-device (D2D) communication application scenario, i.e., a content distribution system with a number of information sources intending to broadcast their messages to multiple destinations in the vicinity. Due to the dynamic nature of wireless signal propagation links, it is hard to guarantee a satisfactory performance by direct source-destination transmissions, especially when the system is operating in a reuse-mode. Relays can be introduced to the system to solve this problem. However, adopting the conventional repetition coding at relays inefficiently utilizes the available resources, for the considered multi-source scenario. Therefore, we investigate applying a class of finite-field network codes at the relays, when potentially three types of relays are deployed to assist the information distribution process. We proposed the algorithms to derive the system outage probability and analyze the trade-off between energy efficiency and spectral efficiency. Our analytical and numerical results clearly demonstrate the potential of exploiting network-coded cooperative communications in future 5G D2D systems.
  •  
7.
  • Arikan, Erdal, et al. (författare)
  • Challenges and some new directions in channel coding
  • 2015
  • Ingår i: Journal of Communications and Networks. - 1229-2370. ; 17:4, s. 328-338
  • Tidskriftsartikel (refereegranskat)abstract
    • Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: spatially coupled Low-Density Parity-Check (LDPC) codes, non-binary LDPC codes, and polar coding.
  •  
8.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-8 av 8

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy