tailieunhanh - Báo cáo hóa học: " Minimum-length scheduling with rate control in wireless networks: a shortest path approach"

Tuyển tập các báo cáo nghiên cứu về hóa học được đăng trên tạp chí hóa hoc quốc tế đề tài : Minimum-length scheduling with rate control in wireless networks: a shortest path approach | Pantelidou and Ephremides EURASIP Journal on Wireless Communications and Networking 2011 2011 115 EURASIP Journal on http content 2011 1 115 Wireless Communications and Networking 1 1 1 1 a SpringerOpen Journal RESEARCH Open Access Minimum-length scheduling with rate control in wireless networks a shortest path approach Anna Pantelidou1 and Anthony Ephremides2 Abstract In this paper the minimum-length scheduling problem in wireless networks is studied where each source of traffic has a finite amount of data to deliver to its corresponding destination. Our objective is to obtain a joint scheduling and rate control policy to minimize the total time required to deliver this finite amount of data from all sources. First networks with time-invariant channels are considered. An optimal solution is provided by formulating the minimum-length scheduling problem as finding a shortest path on a single-source directed acyclic graph. However finding the shortest paths is computationally hard since the number of vertices and edges of the graph increases exponentially in the number of network nodes as well as in the initial traffic demand values. Toward this end a simplified version of the problem is considered for which we explicitly characterize the optimal solution. Next our results are generalized to time-varying channels. First it is shown that in case of time-varying channels the minimum-length scheduling problem can be formulated as a stochastic shortest path problem and then an optimal policy is provided that is based on stochastic control. Finally our analytical results are illustrated with a set of numerical examples. Keywords Cross-layer design Minimum-length scheduling Rate control Stochastic shortest paths I. Introduction The problem of minimum-length scheduling involves obtaining a sequence of activations of wireless nodes so that a finite amount of data residing at a subset of the nodes in the network reaches its intended destinations in .

TÀI LIỆU LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.