English
Related papers

Related papers: A Fair Relay Selection Scheme for a DF Cooperative…

200 papers

In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and…

Information Theory · Computer Science 2014-05-16 Andres Altieri , Leonardo Rey Vega , Pablo Piantanida , Cecilia G. Galarza

The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve over time.To address this issue, bandwidth sharing techniques…

Networking and Internet Architecture · Computer Science 2017-11-28 Zaid Allybokus , Konstantin Avrachenkov , Jérémie Leguay , Lorenzo Maggi

User-to-network relaying enabled via Device-to-Device communications (D2D) is a promising technique for improving the performance of cellular networks. Since in practice relays are in mobility, a dynamic relay selection scheme is…

Information Theory · Computer Science 2020-10-26 Rita Ibrahim , Mohamad Assaad , Berna Sayrac

The hybrid half-duplex/full-duplex (HD/FD) relaying scheme is an effective paradigm to overcome the negative effects of the self-interference incurred by the full-duplex (FD) mode. However, traditional hybrid HD/FD scheme does not consider…

Information Theory · Computer Science 2018-02-23 Cheng Li , Bin Xia , Zhiyong Chen

In fading channels, power allocation over channel state may bring a rate increment compared to the fixed constant power mode. Such a rate increment is referred to power allocation gain. It is expected that the power allocation gain varies…

Information Theory · Computer Science 2014-12-25 Zhengchuan Chen , Pingyi Fan , Dapeng Wu , Liquan Shen

The current framework of network utility maximization for distributed rate allocation assumes fixed channel code rates. However, by adapting the physical layer channel coding, different rate-reliability tradeoffs can be achieved on each…

Networking and Internet Architecture · Computer Science 2007-05-23 Jang-Won Lee , Mung Chiang , A. Robert Calderbank

This paper investigates the resource scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside infrastructure and other…

Networking and Internet Architecture · Computer Science 2016-03-14 Yu Zhang , Ke Xiong , Fengping An , Xiaofei DI , Jingtao SU

In this paper, we investigate an opportunistic relaying scheme where the selected relay assists the source-destination (direct) communication. In our study, we consider a regenerative opportunistic relaying scheme in which the direct path…

Performance · Computer Science 2011-01-28 Kamel Tourki , Hong-Chuan Yang , Mohamed-Slim Alouni

The number of users adopting Tor to protect their online privacy is increasing rapidly. With a limited number of volunteered relays in the network, the number of clients' connections sharing the same relays is increasing to the extent that…

Networking and Internet Architecture · Computer Science 2020-11-17 Lamiaa Basyoni , Aiman Erbad , Amr Mohamed , Ahmed Refaey , Mohsen Guizani

Fair division is typically framed from a centralized perspective. However, in practice resource allocation often occurs via decentralized networks. We study a decentralized variant of fair division inspired by altruistic dynamics observed…

Computer Science and Game Theory · Computer Science 2026-03-02 Joel Miller , Rishi Advani , Ian Kash , Chris Kanich , Lenore Zuck

Cooperative communication is an effective approach to improve spectrum utilization. In order to reduce outage probability of communication system, most studies propose various schemes for relay selection and power allocation, which are…

Systems and Control · Electrical Eng. & Systems 2021-01-29 Yuanzhe Geng , Erwu Liu , Rui Wang , Yiming Liu

An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time…

Networking and Internet Architecture · Computer Science 2020-02-14 Dimitrios J. Vergados , Natalia Amelina , Yuming Jiang , Katina Kralevska , Oleg Granichin

In this work, we propose buffer-aided distributed space-time coding (DSTC) schemes and relay selection algorithms for cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We first devise a relay pair selection…

Information Theory · Computer Science 2016-10-04 J. Gu , R. C. de Lamare

This paper focuses on the design of an optimal resource allocation scheme to maximize the energy efficiency (EE) in a simultaneous wireless information and power transfer (SWIPT) enabled two-way decode-and-forward (DF) relay network under a…

Information Theory · Computer Science 2019-03-20 Liqin Shi , Yinghui Ye , Rose Qingyang Hu , Hailin Zhang

In this paper, for a fading decode-and-forward full-duplex relay channel, we analytically derive optimum power allocations. Individual power constraints for the source and the relay are assumed and the related optimization problem is…

Information Theory · Computer Science 2012-02-07 Arash Gholami Davoodi , Mohammad Javad Emadi , Mohammad Reza Aref

Relaying is an effective technique to achieve reliable wireless connectivity in harsh communication environment. However, most of the existing relaying schemes are based on relays with fixed locations, or \emph{static relaying}. In this…

Information Theory · Computer Science 2016-04-12 Yong Zeng , Rui Zhang , Teng Joon Lim

Focusing on the joint relay selection and power control problem with a view to maximizing the sum-rate, we propose a novel sub-optimal algorithm that iterates between relay selection and power control. The relay selection is performed by…

Information Theory · Computer Science 2024-01-17 Shalanika Dayarathna , Rajitha Senanayake , Jamie Evans

Imposing fairness in resource allocation incurs a loss of system throughput, known as the Price of Fairness ($PoF$). In wireless scheduling, $PoF$ increases when serving users with very poor channel quality because the scheduler wastes…

Networking and Internet Architecture · Computer Science 2018-01-08 Apostolos Destounis , Georgios S. Paschos , David Gesbert

Performance of cooperative diversity schemes at Low Signal to Noise Ratios (LSNR) was recently studied by Avestimehr et. al. [1] who emphasized the importance of diversity gain over multiplexing gain at low SNRs. It has also been pointed…

Information Theory · Computer Science 2007-07-13 Ketan Rajawat , Adrish Banerjee

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. When a node (referred to as the source)…

Networking and Internet Architecture · Computer Science 2011-01-21 K. P. Naveen , Anurag Kumar
‹ Prev 1 4 5 6 7 8 10 Next ›