English
Related papers

Related papers: Distributed Algorithm for Dynamic Cognitive Ad-hoc…

200 papers

Next-generation networks are expected to be ultra-dense with a very high peak rate but relatively lower expected traffic per user. For such scenario, existing central controller based resource allocation may incur substantial signaling…

Networking and Internet Architecture · Computer Science 2020-04-02 Sumit J. Darak , Manjesh K. Hanawal

Next generation networks are expected to be ultradense and aim to explore spectrum sharing paradigm that allows users to communicate in licensed, shared as well as unlicensed spectrum. Such ultra-dense networks will incur significant…

Networking and Internet Architecture · Computer Science 2019-07-12 Sumit J Darak , Manjesh K. Hanawal

We consider an ad hoc network where multiple users access the same set of channels. The channel characteristics are unknown and could be different for each user (heterogeneous). No controller is available to coordinate channel selections by…

Machine Learning · Computer Science 2019-09-02 Harshvardhan Tibrewal , Sravan Patchala , Manjesh K. Hanawal , Sumit J. Darak

In recent years there is a growing effort to provide learning algorithms for spectrum collaboration. In this paper we present a medium access control protocol which allows spectrum collaboration with minimal regret and high spectral…

Networking and Internet Architecture · Computer Science 2024-02-08 Tomer Boyarski , Wenbo Wang , Amir Leshem

We consider the problem of dynamic spectrum access for network utility maximization in multichannel wireless networks. The shared bandwidth is divided into K orthogonal channels. In the beginning of each time slot, each user selects a…

Networking and Internet Architecture · Computer Science 2018-11-06 Oshri Naparstek , Kobi Cohen

We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate…

Networking and Internet Architecture · Computer Science 2016-11-15 Yufang Xi , Edmund M. Yeh

A stochastic multi-user multi-armed bandit framework is used to develop algorithms for uncoordinated spectrum access. In contrast to prior work, it is assumed that rewards can be non-zero even under collisions, thus allowing for the number…

Information Theory · Computer Science 2021-01-13 Meghana Bande , Akshayaa Magesh , Venugopal V. Veeravalli

Channel allocation is the task of assigning channels to users such that some objective (e.g., sum-rate) is maximized. In centralized networks such as cellular networks, this task is carried by the base station which gathers the channel…

Information Theory · Computer Science 2019-12-05 S. M. Zafaruddin , Ilai Bistritz , Amir Leshem , Dusit Niyato

With new applications for radar networks such as automotive control or indoor localization, the need for spectrum sharing and general interoperability is expected to rise. This paper describes the application of multi-player bandit…

Information Theory · Computer Science 2021-02-02 William W. Howard , Charles E. Thornton , Anthony F. Martone , R. Michael Buehrer

Communication networks shared by many users are a widespread challenge nowadays. In this paper we address several aspects of this challenge simultaneously: learning unknown stochastic network characteristics, sharing resources with other…

Machine Learning · Computer Science 2018-08-16 Orly Avner , Shie Mannor

Over the past decade we have witnessed a rapid growth and development in wireless communication systems, to the point that conventional spectrum allocation policies may not be able to fulfill them all. Federal Communications Commission…

Networking and Internet Architecture · Computer Science 2013-02-11 Armin Banaei , Costas N. Georghiades

We consider distributed optimization over orthogonal collision channels in spatial random access networks. Users are spatially distributed and each user is in the interference range of a few other users. Each user is allowed to transmit…

Networking and Internet Architecture · Computer Science 2016-10-26 Kobi Cohen , Angelia Nedich , R. Srikant

Distributed opportunistic scheduling (DOS) protocols are proposed for multiple-input multiple-output (MIMO) ad-hoc networks with contention-based medium access. The proposed scheduling protocols distinguish themselves from other existing…

Information Theory · Computer Science 2016-11-17 Man-On Pun , Weiyan Ge , Dong Zheng , Junshan Zhang , H. Vincent Poor

In an attempt to utilize spectrum resources more efficiently, protocols sharing licensed spectrum with unlicensed users are receiving increased attention. From the perspective of cellular networks, spectrum underutilization makes spatial…

Networking and Internet Architecture · Computer Science 2013-12-10 Brett Kaufman , Jorma Lilleberg , Behnaam Aazhang

Distributed Opportunistic Scheduling (DOS) techniques have been recently proposed to improve the throughput performance of wireless networks. With DOS, each station contends for the channel with a certain access probability. If a contention…

Networking and Internet Architecture · Computer Science 2014-12-16 Andres Garcia-Saavedra , Albert Banchs , Pablo Serrano , Joerg Widmer

This paper presents a novel distributed low-rank scheme and adaptive algorithms for distributed estimation over wireless networks. The proposed distributed scheme is based on a transformation that performs dimensionality reduction at each…

Information Theory · Computer Science 2017-10-03 Rodrigo C. de Lamare

Efficient utilization of licensed spectrum in the cognitive radio network is challenging due to lack of coordination among the Secondary Users (SUs). Distributed algorithms proposed in the literature aim to maximize the network throughput…

Signal Processing · Electrical Eng. & Systems 2018-11-19 Suneet Sawant , Rohit Kumar , Manjesh K. Hanawal , Sumit J. Darak

In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-17 Paolo Di Lorenzo , Sergio Barbarossa

Multi-armed bandit problems are receiving a great deal of attention because they adequately formalize the exploration-exploitation trade-offs arising in several industrially relevant applications, such as online advertisement and, more…

Machine Learning · Computer Science 2013-11-05 Nicolò Cesa-Bianchi , Claudio Gentile , Giovanni Zappella

We address the joint problem of learning and scheduling in multi-hop wireless network without a prior knowledge on link rates. Previous scheduling algorithms need the link rate information, and learning algorithms often require a…

Networking and Internet Architecture · Computer Science 2023-12-11 Daehyun Park , Sunjung Kang , Changhee Joo
‹ Prev 1 2 3 10 Next ›