文章基本信息

标题：A Survey on Best Scheduling Policies for Multihop Wireless Networks
本地全文：下载
作者：S.Venkateswarlu ; B.Arunkumar ; N.Nagakumari 等
期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：3
期号：2
页码：995-998
语种：English
出版社：Ayushmaan Technologies
摘要：Complex networks routing between source to destination is quite difficult. In multi-hop Adhoc network with multiple flows, each having exogenous arrivals at the source, Causes bottleneck problem that leads to delay , so we develop a new queue algorithms to schedule the packets to handle bottle neck problem and to reduce the delay. The delay performance of any scheduling policy is primarily limited by the interference, which causes many bottlenecks to be formed in the network. We evaluate the use of exclusive sets for the purpose of deriving lower bounds on delay for a wireless network with single hop traffic. We further generalize the typical notion of a bottleneck. We define a (K, X)-bottleneck to be a set of links X such that no more than K of them can simultaneously transmit. In this paper, we develop new analytical techniques that focus on the queuing due to the (K, X)- bottlenecks. One of the techniques, which we call the “reduction technique”. simplifies the analysis of the queuing upstream of a (K, X)-bottleneck to the study of a single queue system with K servers.