English
Related papers

Related papers: Location-Based Optimum Relay Selection in Random S…

200 papers

This paper studies the performance and key structural properties of the optimum location-based relay selection policy for wireless networks consisting of homogeneous Poisson distributed relays. The distribution of the channel quality…

Signal Processing · Electrical Eng. & Systems 2021-07-13 Hazer Inaltekin , Saman Atapattu , Jamie S. Evans

Our work is motivated by the need for impromptu (or "as-you-go") deployment of relay nodes (for establishing a packet communication path with a control centre) by fire-men/commandos while operating in an unknown environment. We consider a…

Networking and Internet Architecture · Computer Science 2012-07-27 Abhishek Sinha , Arpan Chattopadhyay , K. P. Naveen , Marceau Coupechoux , Anurag Kumar

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

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

Relay nodes are used to improve the throughput, delay and reliability performance of energy harvesting networks by assisting both energy and information transfer between information nodes and access point. Previous studies on radio…

Networking and Internet Architecture · Computer Science 2020-02-04 Aysun Gurur Onalan , Elif Dilek Salik , Sinem Coleri

We propose a selection region based multi-hop routing protocol for random mobile ad hoc networks, where the selection region is defined by two parameters: a reference distance and a selection angle. At each hop, a relay is chosen as the…

Information Theory · Computer Science 2010-07-20 Di Li , Changchuan Yin , Changhai Chen , Shuguang Cui

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

In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the…

Information Theory · Computer Science 2015-03-20 Nikola Zlatanov , Robert Schober , Petar Popovski

Relaying can improve the coverage and performance of wireless access networks. In presence of a localisation system at the mobile nodes, the use of such location estimates for relay node selection can be advantageous as such information can…

Networking and Internet Architecture · Computer Science 2015-05-08 Jimmy J. Nielsen , Rasmus L. Olsen , Tatiana K. Madsen , Bernard Uguen , Hans-Peter Schwefel

We consider a source-destination pair assisted by parallel regenerative decode-and-forward relays operating in orthogonal channels. We investigate distributed power allocation strategies for this system with limited channel state…

Information Theory · Computer Science 2008-01-07 Min Chen , Semih Serbetli , Aylin Yener

We consider stochastic motion planning in single-source single-destination robotic relay networks, under a cooperative beamforming framework. Assuming that the communication medium constitutes a spatiotemporal stochastic field, we propose a…

Systems and Control · Computer Science 2016-03-22 Dionysios S. Kalogerias , Athina P. Petropulu

This paper considers trajectory planning for a mobile robot which persistently relays data between pairs of far-away communication nodes. Data accumulates stochastically at each source, and the robot must move to appropriate positions to…

Robotics · Computer Science 2022-08-24 Winston Hurst , Yasamin Mostofi

Consider a communication network with a source, a relay and a destination. Each time interval, the source may dynamically choose between a few possible coding schemes, based on the channel state, traffic pattern and its own queue status.…

Information Theory · Computer Science 2017-02-09 Asaf Cohen , Dennis Goeckel , Omer Gurewitz , Daniel S. Menasche , Mark Shifrin

Unpredictable nature of fading channels and difficulty in tracking channel state information pose major challenge in wireless energy harvesting communication system design. In this work, we address relay selection problem for wireless…

Networking and Internet Architecture · Computer Science 2020-02-27 M. Majid Butt , Galymzhan Nauryzbayev , Nicola Marchetti

We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed via N orthogonal channels. This, for example, is the case when orthogonal frequency division multiplexing…

Information Theory · Computer Science 2013-02-20 Youngwook Ko , Masoud Ardakani , Sergiy A. Vorobyov

In this work, we address the relay selection problem for the wireless powered communication networks, where the relays harvest energy from the source radio frequency signals. A single source-destination pair is considered without a direct…

Networking and Internet Architecture · Computer Science 2016-08-29 M. Majid Butt , Ioannis Krikidis , Nicola Marchetti

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a sink node. The achievable rate formulas that we…

Networking and Internet Architecture · Computer Science 2015-03-20 Arpan Chattopadhyay , Abhishek Sinha , Marceau Coupechoux , Anurag Kumar

The use of existing network devices as relays has a potential to improve the overall network performance. In this work, we consider a two-hop wireless relay setting, where the channels between the source and relay nodes to the destination…

Networking and Internet Architecture · Computer Science 2017-04-11 Mehdi Salehi Heydar Abad , Ozgur Ercetin , Eylem Ekici

We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have suggested that, in such a scenario, selection, i.e., a single…

Information Theory · Computer Science 2009-03-16 Sachin Kadloor , Raviraj Adve

In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in…

Information Theory · Computer Science 2015-02-10 Yang Liu , Yi Ouyang , Mingyan Liu
‹ Prev 1 2 3 10 Next ›