Distributed scheduling scheme for video streaming over multi-channel multi-radio multi-hop wireless networks

Zhou, Liang; Wang, Xinbing; Tu, Wei; Muntean, Gabriel‐Miro; Geller, Benoît

doi:10.1109/jsac.2010.100412

Cited by 240 publications

(134 citation statements)

References 28 publications

Supporting

Mentioning

134

Contrasting

Order By: Relevance

“…To formulate the routing problem in WMN as a search-based problem, three tasks need to be carried out: first is the representation of problem which is agreeable to symbolic manipulation, second is a fitness function specifying integrity of available options, and third is the set of manipulation operators. The authors in [15] have proposed distributed scheduling scheme for video streaming over multi-channel, multi-radio, multi-hop wireless networks and formulated the scheduling as a convex optimization problem. The schemes used in [15] mainly focus on applications having video streaming, while our work focus on link quality regardless of any application constraints.…”

Section: Optimization and Search-based Problemsmentioning

confidence: 99%

“…The authors in [15] have proposed distributed scheduling scheme for video streaming over multi-channel, multi-radio, multi-hop wireless networks and formulated the scheduling as a convex optimization problem. The schemes used in [15] mainly focus on applications having video streaming, while our work focus on link quality regardless of any application constraints.…”

Section: Optimization and Search-based Problemsmentioning

confidence: 99%

See 1 more Smart Citation

Search-based routing in wireless mesh network

Mahmood

Nazir

Khan

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

Wireless technology is emerging as a key technology for the future networks. Wireless mesh networks (WMNs) have emerged as an indispensable technology for deployment of wireless services for various applications in personal, enterprise, and metropolitan areas. Researchers are working actively in different fields of WMNs for providing better services. Routing protocols play a vital role in WMNs to provide reliable configuration and maintenance of topology of the network. Designing a suitable cost metric for routing protocols to provide quality links for data transmission is the backbone of WMNs. Many cost metrics have been proposed for WMNs and is still an active research topic as new performance metrics need to be discovered due to the dynamics of this field. This paper considers the genetic algorithm-based routing technique for WMN. We have studied the existing cost metrics and proposed a genetic algorithm technique for routing in WMN. To evaluate the genetic algorithm, and to determine the relative performance of the genetic algorithm in the context of routing in WMN, we carry out experiments on two test systems. We have evaluated the quality of the results produced by our algorithm with the traditional hop count metric results. Our results show that routing in WMN using genetic algorithm produces better results as compared to traditional hop count metric results. Finally, we carry out a detailed analysis of results, which help us in gaining an insight into the suitability of genetic algorithm for routing in WMN.

show abstract

Section: Optimization and Search-based Problemsmentioning

confidence: 99%

Section: Optimization and Search-based Problemsmentioning

confidence: 99%

Search-based routing in wireless mesh network

Mahmood

Nazir

Khan

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The sharing wireless channel and its dynamic nature have been witnessed to make the traditional strict layered design difficult in providing efficient QoS support [47,48]. The problem is more severe in our joint scheme.…”

Section: Cross-layer Designmentioning

confidence: 99%

Joint QoS provisioning and congestion control for multi-hop wireless networks

Chen

Guan

Jiang

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

The capability of quality-of-service (QoS) provisioning is of particular importance for multi-hop wireless networks when the real-time applications boost in current days. The scheduling and delivery of data packets in a deficient method may probably cause network congestion, which will in turn decrease the capability of QoS provisioning in the network. To this end, we propose a joint QoS provisioning and congestion control scheme for multi-hop wireless network in this paper based on our previous works of Differentiated Queueing Service (DQS) and Semi-TCP, which provide per-packet granular QoS and carry out efficient hop-by-hop congestion control, respectively. While DQS and Semi-TCP are studied separately, we investigate the arising issues in the joint scheme and propose possible solutions accordingly, including a fast estimation of the latest departure time, a method to handle overdue packets, and an adaptive ACK scheme, as well as the design of a shared database cross-layer architecture for the implementation in the protocol stack. Simulation results show that our proposal improves the network performance in terms of goodput, delivery ratio, and end-to-end delay significantly, particularly in the scenario of mobile users. Our discussion and simulation results both indicate that the proposed joint scheme is flexible and adaptive to the dynamic multi-hop wireless network environment.

show abstract

“…Then, the paths with lower delays are assigned to data packets carrying higher relevant data. Still concerning the media contents, the work in [13] proposes a transmission scheduling scheme for multi-radio and multi-hop wireless networks, where the video contents are considered when selecting the multiple available transmission channels.…”

Section: Related Workmentioning

confidence: 99%

A routing mechanism based on the sensing relevancies of source nodes for time-critical applications in visual sensor networks

Costa

Guedes

Vasques

et al. 2012

2012 IFIP Wireless Days

View full text Add to dashboard Cite

-Wireless sensor networks may be deployed to retrieve visual information from the monitored field, enriching monitoring and control applications. Whenever a set of cameraenabled sensor nodes are deployed for time-critical monitoring, visual information as still images and video streams may need to reach the sink as soon as possible, requiring a differentiated treating of the network when compared with non-critical visual data. In such way, considering that source nodes may have different sensing relevancies for the application, according to the desired monitoring tasks and the current sensors' poses and fields of view, we propose a delay-aware multihop routing mechanism where higher relevant visual data packets are routed through paths with lower end-to-end delay. As sensor nodes are expected to be energy-constrained, transmitting only highrelevant packets through shorter/faster paths may prolong their lifetime and assure longer time-critical delivering, with low impact to the overall monitoring quality.

show abstract

Distributed scheduling scheme for video streaming over multi-channel multi-radio multi-hop wireless networks

Cited by 240 publications

References 28 publications

Search-based routing in wireless mesh network

Search-based routing in wireless mesh network

Joint QoS provisioning and congestion control for multi-hop wireless networks

A routing mechanism based on the sensing relevancies of source nodes for time-critical applications in visual sensor networks

Contact Info

Product

Resources

About