English
Related papers

Related papers: Wireless Capacity with Oblivious Power in General …

200 papers

We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…

Information Theory · Computer Science 2011-08-09 Urs Niesen

In this paper, the optimal spectral efficiency (data rate divided by the message bandwidth) that minimizes the probability of causing disruptive interference for ad hoc wireless networks or cognitive radios is investigated. Two basic…

Information Theory · Computer Science 2015-03-18 Daniel W. Bliss , Siddhartan Govindasamy

Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be significantly smaller than the power consumed in decoding. This…

Information Theory · Computer Science 2011-02-17 Pulkit Grover , Kristen Ann Woyach , Anant Sahai

Battery powered transmitters face energy constraint, replenishing their energy by a renewable energy source (like solar or wind power) can lead to longer lifetime. We consider here the problem of finding the optimal power allocation under…

Systems and Control · Computer Science 2011-10-12 Abhinav Sinha , Prasanna Chaporkar

We consider a broadcast scenario where one transmitter communicates with two receivers under quality-of-service constraints. The transmitter initially employs superposition coding strategies with arbitrarily distributed signals and sends…

Information Theory · Computer Science 2016-03-09 Marwan Hammouda , Sami Akin , Jürgen Peissig

Characterizing the fundamental tradeoffs for maximizing energy efficiency (EE) versus spectrum efficiency (SE) is a key problem in wireless communication. In this paper, we address this problem for a point-to-point additive white Gaussian…

Information Theory · Computer Science 2013-02-06 Jie Xu , Rui Zhang

This paper considers the optimum single cell power-control maximizing the aggregate (uplink) communication rate of the cell when there are peak power constraints at mobile users, and a low-complexity data decoder (without successive…

Information Theory · Computer Science 2011-05-31 Hazer Inaltekin , Stephen V. Hanly

In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the…

Information Theory · Computer Science 2010-12-02 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

This paper investigates the capacity of a wireless two way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-theoretic sense as the maximum information exchange rate…

Information Theory · Computer Science 2008-04-22 Zhang Shengli , Soung Chang Liew

In this paper, we study wireless networks where nodes have two energy sources, namely a battery and radio frequency (RF) energy harvesting circuitry. We formulate two optimization problems with different objective functions, namely…

Information Theory · Computer Science 2017-10-03 Mohamed A. Abd-Elmagid , Tamer ElBatt , Karim G. Seddik

This thesis focuses on link scheduling in wireless mesh networks by taking into account physical layer characteristics. The assumption made throughout is that a packet is received successfully only if the Signal to Interference and Noise…

Networking and Internet Architecture · Computer Science 2008-12-31 Ashutosh Deepak Gore

We consider a fundamental problem concerning the deployment of a wireless robotic network: to fulfill various end-to-end performance requirements, a "sufficient" number of robotic relays must be deployed to ensure that links are of…

Robotics · Computer Science 2016-11-28 Pradipta Ghosh , Bhaskar Krishnamachari

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. An scheme achieving the…

Information Theory · Computer Science 2016-11-17 Seyed Pooya Shariatpanahi , Babak Hossein Khalaj , Kasra Alishahi , Hamed Shah-Mansouri

In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of links in the network are independent. In…

Information Theory · Computer Science 2007-08-23 Zhenning Kong , Salah A. Aly , Emina Soljanin , Edmund M. Yeh , Andreas Klappenecker

A central problem in the operation of large wireless networks is how to deal with interference -- the unwanted signals being sent by transmitters that a receiver is not interested in. This thesis looks at ways of combating such…

Information Theory · Computer Science 2011-09-07 Matthew Aldridge

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

We derive a fast and optimal algorithm for solving practical weighted max-min SINR problems in cell-free massive MIMO networks. For the first time, the optimization problem jointly covers long-term power control and distributed beamforming…

Information Theory · Computer Science 2022-09-01 Lorenzo Miretti , Renato Luis Garrido Cavalcante , Slawomir Stanczak

Signal-strength models of wireless communications capture the gradual fading of signals and the additivity of interference. As such, they are closer to reality than other models. However, nearly all theoretic work in the SINR model depends…

Networking and Internet Architecture · Computer Science 2014-02-21 Marijke H. L. Bodlaender , Magnús M. Halldórsson

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

In this paper, we investigate the capacity of a multiple-input multiple-output (MIMO) optical intensity channel (OIC) under per-antenna peak- and average-intensity constraints. We first consider the case where the average intensities of…

Information Theory · Computer Science 2024-01-10 Ru-Han Chen , Longguang Li , Jia-Ning Guo , Xu Yang , Jian Zhang , Lin Li
‹ Prev 1 4 5 6 7 8 10 Next ›