English
Related papers

Related papers: Deriving Pareto-optimal performance bounds for 1 a…

200 papers

This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Optimal relay subset selection with the objective of maximizing…

Information Theory · Computer Science 2008-05-23 Caleb K. Lo , Sriram Vishwanath , Robert W. Heath

Delay tolerant Ad-hoc Networks make use of mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information…

Networking and Internet Architecture · Computer Science 2009-01-19 Eitan Altman , Francesco De Pellegrini

This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by time-division multihop (TDMH), MAC-layer…

Information Theory · Computer Science 2009-02-16 Chun-Hung Liu , Feng Xue , Jeffrey G. Andrews

Two-way relaying is a promising technique to improve network throughput. However, how to apply it to a wireless network remains an unresolved issue. Particularly, challenges lie in the joint design between the physical layer and the routing…

Information Theory · Computer Science 2012-07-31 Shanshan Wu , Xudong Wang

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

We consider optimal/efficient power allocation policies in a single/multihop wireless network in the presence of hard end-to-end deadline delay constraints on the transmitted packets. Such constraints can be useful for real time voice and…

Networking and Internet Architecture · Computer Science 2017-02-17 Satya V Kumar , Vinod Sharma

We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio…

Information Theory · Computer Science 2011-08-19 Jasper Goseling , Ruytaroh Matsumoto , Tomohiko Uyematsu , Jos H. Weber

In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…

Information Theory · Computer Science 2015-03-19 Zhou Zhang , Hai Jiang

In this paper we provide a performance analysis framework for wireless industrial networks by deriving a service curve and a bound on the delay violation probability. For this purpose we use the (min,x) stochastic network calculus as well…

Performance · Computer Science 2016-07-28 Neda Petreska , Hussein Al-Zubaidy , Barbara Staehle , Rudi Knorr , James Gross

We consider a full-duplex decode-and-forward system, where the wirelessly powered relay employs the time-switching protocol to receive power from the source and then transmit information to the destination. It is assumed that the relay node…

Information Theory · Computer Science 2016-11-15 Mohammadali Mohammadi , Himal A. Suraweera , Gan Zheng , Caijun Zhong , Ioannis Krikidis

In this paper, we formulate two multi-objective optimization problems (MOOPs) in orthogonal frequency-division multiple access (OFDMA)-based in-band full-duplex (IBFD) wireless communications.~The aim of this study is to exploit the…

Information Theory · Computer Science 2020-07-29 Ata Khalili , Mohammad Robat Mili , Derrick Wing Kwan Ng

Energy efficiency (EE) and spectral efficiency (SE) are two of the key performance metrics in future wireless networks, covering both design and operational requirements. For previous conventional resource allocation techniques, these two…

We consider a multi-pair amplify-and-forward relay network where the energy-constrained relays adopting time-switching protocol harvest energy from the radio frequency signals transmitted by the users for assisting user data transmission.…

Information Theory · Computer Science 2018-10-16 Kien-Giang Nguyen , Quang-Doanh Vu , Le-Nam Tran , Markku Juntti

Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility models have been established in [23], where we showed that the optimal trade-offs can be achieved using rate-less codes when the required delay guarantees are sufficient…

Networking and Internet Architecture · Computer Science 2007-07-13 Lei Ying , R. Srikant

We consider a multiple-input multiple-output (MIMO) interference channel (IC), where a single data stream per user is transmitted and each receiver treats interference as noise. The paper focuses on the open problem of computing the…

Information Theory · Computer Science 2017-04-26 Pan Cao , Eduard A. Jorswieck , Shuying Shi

In this paper, we derive UWB version of (i) general best achievable rate for the relay channel with decode-andforward strategy and (ii) max-flow min-cut upper bound, such that the UWB relay channel can be studied considering the obtained…

Information Theory · Computer Science 2011-09-15 Maryam Faramarzi Yazd , Ghosheh Abed Hodtani

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim

Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of…

Information Theory · Computer Science 2008-11-11 Salah A. Aly , Vishal Kapoor , Jie Meng , Andreas Klappenecker

Wireless sensor networks have been increasingly used for real-time surveillance over large areas. In such applications, it is important to support end-to-end delay constraints for packet deliveries even when the corresponding flows require…

Networking and Internet Architecture · Computer Science 2012-04-23 I-Hong Hou

We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual information from every packet transmission. This enables a…

Optimization and Control · Mathematics 2011-10-18 Rahul Urgaonkar , Michael J. Neely