The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, an innovative scheduling scheme is proposed for interference-limited wireless multi-hop networks with non-deterministic fading channels. The scheduling problem is considered as a network utility maximization (NUM) problem subject to link rate constraints. By jointly taking into account of the link scheduling and the statistical variations of signal and interference power, the convex...
This paper proposes an efficient uplink scheduling algorithm that can perfectly support various VoIP CODECs with VAD/DTX/CNG in M-WiMAX considering the variants of silence duration between different voice users, solving the problems of uplink resources wastes and overwhelmingly large overhead that caused during silence period. In our proposed algorithm, efficient schemes is proposed to implement the...
With the utilization of concurrent transmission strategy, a throughput-enhanced scheduling scheme is devised for multicast service in wireless multi-hop mesh networks. Since the performance of a multicast mechanism is constrained in a wireless setting due to the interference among local wireless transmissions, the interference relationships are first characterized by introducing a graph transformation...
In order to reduce the influence of the jitter of hard real-time task caused by scheduling to the stability and reliability of device-level operation system, a model with preemption segment threshold-RJPS is presented. According to the effect on jitter and latency brought by threshold and the analysis of the scheduling on this model, two minimum threshold assigned algorithms are designed. One of them...
In this paper, an innovative scheduling is designed for multi-hop multicast in wireless mesh networks, with utilization of concurrent transmission strategy. Since the performance of a multicast mechanism is constrained in a wireless setting due to the interference among local wireless transmissions, we analyze the interference relationships firstly among the transmissions by introducing a graph transformation...
Wireless mesh networks have promised to provide high-speed access for residential or mobile customers. And concurrent transmission is an effective way to enhance system throughput in wireless mesh networks. The objective of this paper is to provide an effective concurrent transmission method to enlarge throughput with specific QoS fairness guarantee in wireless mesh networks. Firstly, link relationship...
Due to discontinuity of traffic, traffic distribution strategy in each intermediate node and each flow's state before transmission should be considered in non-full load wireless mesh networks when scheduling. In this paper, an activeness-labelled concurrent transmission method with unselfish traffic distribution is designed to enlarge throughput in non-full load wireless mesh networks. Firstly, the...
This paper seek to devise a new scalable and efficient solution to the problem of determining the throughput range using concurrent transmission in wireless mesh networks. After consideration of the conditions for the concurrent transmission scheduling, an easy and efficient algorithm in greedy mode is developed for scenario construction based on the analysis of the interference relationship. Simulation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.