A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels

Date

2010-03-19

Author

Sridharan, Arun
Koksal, C. Emre
Uysal, Elif

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

171
views

0
downloads

Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node respectively. In this paper, we address the problem of link scheduling in multihop wireless networks containing nodes with BC and MAC capabilities. We first propose an interference model that extends protocol interference models, originally designed for point to point channels, to include the possibility of BC and MAC. Due to the high complexity of optimal link schedulers, we introduce the Multiuser Greedy Maximum Weight algorithm for link scheduling in multihop wireless networks containing BCs and MACs. Given a network graph, we develop new local pooling conditions and show that the performance of our algorithm can be fully characterized using the associated parameter, the multiuser local pooling factor. We provide examples of some network graphs, on which we apply local pooling conditions and derive the multiuser local pooling factor. We prove optimality of our algorithm in tree networks and show that the exploitation of BCs and MACs improve the throughput performance considerably in multihop wireless networks.

URI

https://hdl.handle.net/11511/55362

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple-Access and Broadcast Channels Sridharan, Arun; Koksal, C. Emre; Uysal, Elif (Institute of Electrical and Electronics Engineers (IEEE), 2012-02-01) Information-theoretic broadcast channels (BCs) and multiple-access channels (MACs) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node, respectively. In this paper, we address the problem of link scheduling in multihop wireless networks containing nodes with BC and MAC capabilities. We first propose an interference model that extends protocol interference models, originally designed for point-to-point channels, to includ...
A clustering algorithm that maximizes throughput in 5G heterogeneous F-RAN networks Balevi, Eren; Gitlin, Richard D. (2018-07-27) © 2018 IEEE.In this paper, a clustering algorithm is proposed that dynamically determines the locations of fog nodes in 5G wireless networks, which are upgraded from small cells, in order to maximize throughput assuming the number of fog nodes and small cells are given as a priori information. The proposed algorithm dynamically clusters the small cells around the fog nodes. The approach is based on a soft clustering model where one small cell can be connected to many fog nodes. The numerical results demonst...
A Link delay computation method for the quality of service support in software defined networks Balo, Efe; Güran Schmidt, Ece.; Department of Electrical and Electronics Engineering (2019) Packet switched networks cannot provide tight delay bounds that are required by certain types of applications despite facilitating high throughput. Therefore, delay measurementtechniquesforpacket-switchednetworkshavealwaysgrabbedtheattention of the community to both utilize advantages of packet-switched networks and provide a realistic end to end delay prediction of packets. Software Deﬁned Networking (SDN) isa new paradigmofpacket-switchednetworkingwhichgathersmanagement functionality of network in a logic...
A Bound Based Method for Beamformer Design in Downlink Cloud Radio Access Networks Kadan, Fehmi Emre; Yılmaz, Ali Özgür (2021-10-01) Cloud Radio Access Network is a candidate solution in 5G and beyond where we intend to serve as many users as possible with minimum transmit power and minimum fronthaul data transmission. In this study, we aim to maximize a mixed expression of the number of users served, the number of fronthaul links used, and the total transmitted power by beamforming optimization under imperfect channel state information. We find a theoretical upper bound and propose a method based on the bound derivation. We compare its ...
A Distributed Fault-Tolerant Topology Control Algorithm for Heterogeneous Wireless Sensor Networks Bagci, Hakki; KÖRPEOĞLU, İBRAHİM; Yazıcı, Adnan (Institute of Electrical and Electronics Engineers (IEEE), 2015-04-01) This paper introduces a distributed fault-tolerant topology control algorithm, called the Disjoint Path Vector (DPV), for heterogeneous wireless sensor networks composed of a large number of sensor nodes with limited energy and computing capability and several supernodes with unlimited energy resources. The DPV algorithm addresses the k-degree Anycast Topology Control problem where the main objective is to assign each sensor's transmission range such that each has at least k-vertex-disjoint paths to superno...

Citation Formats

A. Sridharan, C. E. Koksal, and E. Uysal, “A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels,” 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55362.