Transmission scheduling based on a new conflict graph model for multicast in multihop wireless networks

Maggie Cheng, Quanmin Ye

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

In multicast applications, the end-to-end delay from the source to a group member is determined by the multicast tree topology and the waiting time at each relay node. This paper addresses when the multicast tree is given how to schedule wireless nodes for transmission so that network delay is minimized. We first model the conflict relation among wireless transmissions in a conflict graph, and then we compute a transmission schedule based on an Integer Linear Programming (ILP) model. Since solving ILP problem is NP-hard, a heuristic is designed to solve the ILP problem. The resulting schedule is conflict-free, which is guaranteed by the feasibility of the ILP model. Simulation results show significant reduction of delay when compared with a First Come First Serve (FCFS) scheduling policy.

Original languageEnglish (US)
Title of host publication2012 IEEE Global Communications Conference, GLOBECOM 2012
Pages5717-5722
Number of pages6
DOIs
StatePublished - Dec 1 2012
Event2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA, United States
Duration: Dec 3 2012Dec 7 2012

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other2012 IEEE Global Communications Conference, GLOBECOM 2012
Country/TerritoryUnited States
CityAnaheim, CA
Period12/3/1212/7/12

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Transmission scheduling based on a new conflict graph model for multicast in multihop wireless networks'. Together they form a unique fingerprint.

Cite this