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

Download

index.pdf

Date

2012-02-01

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

184
views

90
downloads

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 include the possibility of BCs and MACs. 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.

Subject Keywords

Computer Networks and Communications, Electrical and Electronic Engineering, Software, Computer Science Applications

URI

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

Journal

IEEE-ACM TRANSACTIONS ON NETWORKING

DOI

https://doi.org/10.1109/tnet.2011.2157356

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels Sridharan, Arun; Koksal, C. Emre; Uysal, Elif (2010-03-19) 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 t...
Optimal number of routing paths in multi-path routing to minimize energy consumption in wireless sensor networks İncebacak, Davut; Tavlı, Bulent; Bıcakçı, Kemal; Altın-Kayhan, Ayşegül (Springer Science and Business Media LLC, 2013-10-30) In wireless sensor networks, multi-path routing is proposed for energy balancing which prolongs the network lifetime as compared to single-path routing where utilization of a single route between a source node and the base station results in imbalanced energy dissipation. While it is evident that increasing the number of routing paths mitigates the problem of energy over-utilization in a subset of nodes acting as relays, the net effect of the proliferation of multiple routing paths on energy balancing remai...
WAKE-UP RECEIVERS FOR WIRELESS SENSOR NETWORKS: BENEFITS AND CHALLENGES Demirkol, Ilker; Ersoy, Cem; Onur, Ertan (Institute of Electrical and Electronics Engineers (IEEE), 2009-08-01) For successful data delivery, the destination nodes should be listening to the medium to receive data when the sender node starts data communication. To achieve this synchronization, there are different rendezvous schemes, among which the most energy-efficient is utilizing wake-up receivers. Current hardware technologies of wake-up receivers enable us to evaluate them as a promising solution for wireless sensor networks. In this article the benefits achieved with wake-up receivers are investigated along wit...
A temporal neural network model for constructing connectionist expert system knowledge bases Alpaslan, Ferda Nur (Elsevier BV, 1996-04-01) This paper introduces a temporal feedforward neural network model that can be applied to a number of neural network application areas, including connectionist expert systems. The neural network model has a multi-layer structure, i.e. the number of layers is not limited. Also, the model has the flexibility of defining output nodes in any layer. This is especially important for connectionist expert system applications.
A simple and effective mechanism for stored video streaming with TCP transport and server-side adaptive frame discard Gurses, E; Akar, Gözde; Akar, N (Elsevier BV, 2005-07-15) Transmission control protocol (TCP) with its well-established congestion control mechanism is the prevailing transport layer protocol for non-real time data in current Internet Protocol (IP) networks. It would be desirable to transmit any type of multimedia data using TCP in order to take advantage of the extensive operational experience behind TCP in the Internet. However, some features of TCP including retransmissions and variations in throughput and delay, although not catastrophic for non-real time data...

Citation Formats

A. Sridharan, C. E. Koksal, and E. Uysal, “A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple-Access and Broadcast Channels,” IEEE-ACM TRANSACTIONS ON NETWORKING, pp. 100–113, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39581.