Applying graph coloring in resource coordination for a high-density wireless environment

Zheng, L; Hoang, DB

Applying graph coloring in resource coordination for a high-density wireless environment

Zheng, L Hoang, DB

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008, 2008, pp. 664 - 669
Issue Date:: 2008-09-22

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (432.25 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Zheng, L	en_US
dc.contributor.author	Hoang, DB https://orcid.org/0000-0003-1798-4926	en_US
dc.date.issued	2008-09-22	en_US
dc.identifier.citation	Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008, 2008, pp. 664 - 669	en_US
dc.identifier.isbn	9781424423583	en_US
dc.identifier.uri	http://hdl.handle.net/10453/11193
dc.description.abstract	In a high density wireless environment, channel interference among users of many overlapped Basic Service Sets (OBSSs) is a serious problem. Our solution for the problem relies on a resource coordination scheme that utilizes the spatial distribution of the transceivers for channel reuse and time-slot division multiplexing for downlink transmission sharing among all participating BSSs. In this paper we show that an OBSS environment can be modeled by a planar graph and the OBSS group coordination assignment problem can be considered as a vertex coloring problem whose solution involves at most four colors. The graph coloring solution algorithm for the OBSS group coordination assignment is presented. The actual coloring is demonstrated, using a heuristics of Maximum Degree First. Performance simulation results of the coordination algorithm are also presented. © 2008 IEEE.	en_US
dc.relation.ispartof	Proceedings - 2008 IEEE 8th International Conference on Computer and Information Technology, CIT 2008	en_US
dc.relation.isbasedon	10.1109/CIT.2008.4594754	en_US
dc.title	Applying graph coloring in resource coordination for a high-density wireless environment	en_US
dc.type	Conference Proceeding
utslib.for	0806 Information Systems	en_US
dc.location.activity	Sydney, Australia	en_US
dc.location.activity	Sydney, AUSTRALIA
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US

Abstract:

In a high density wireless environment, channel interference among users of many overlapped Basic Service Sets (OBSSs) is a serious problem. Our solution for the problem relies on a resource coordination scheme that utilizes the spatial distribution of the transceivers for channel reuse and time-slot division multiplexing for downlink transmission sharing among all participating BSSs. In this paper we show that an OBSS environment can be modeled by a planar graph and the OBSS group coordination assignment problem can be considered as a vertex coloring problem whose solution involves at most four colors. The graph coloring solution algorithm for the OBSS group coordination assignment is presented. The actual coloring is demonstrated, using a heuristics of Maximum Degree First. Performance simulation results of the coordination algorithm are also presented. © 2008 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/11193