File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Medium access control algorithm based on parallel graph coloring for wireless mesh networks

TitleMedium access control algorithm based on parallel graph coloring for wireless mesh networks
Authors
Zhang, XDHong, JZhang, LLi, VOKShan, XM
KeywordsDistributed Scheduling Algorithm
Medium Access Control
Parallel Graph Coloring
Wireless Mesh Networks
Issue Date2007
Citation
Beijing Youdian Daxue Xuebao/Journal Of Beijing University Of Posts And Telecommunications, 2007, v. 30 n. 6, p. 36-39+50 How to Cite?
AbstractThe transmission scheduling of wireless mesh networks (WMNs) is modeled as a problem of conflict graph coloring. A new distributed time division multiple access (TDMA) medium access control algorithm based on parallel graph coloring is proposed. The algorithm utilizes the advantages of mesh routers and backbone networks, and only depends on local topology and traffic load information. Simulation demonstrates that the proposed scheme achieves significant throughput enhancement approaching optimal scheduling in WMNs, and enjoys very low communication overhead.
Persistent Identifierhttp://hdl.handle.net/10722/155431
ISSN
1007-5321
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorZhang, XDen_US
dc.contributor.authorHong, Jen_US
dc.contributor.authorZhang, Len_US
dc.contributor.authorLi, VOKen_US
dc.contributor.authorShan, XMen_US
dc.date.accessioned2012-08-08T08:33:27Z-
dc.date.available2012-08-08T08:33:27Z-
dc.date.issued2007en_US
dc.identifier.citationBeijing Youdian Daxue Xuebao/Journal Of Beijing University Of Posts And Telecommunications, 2007, v. 30 n. 6, p. 36-39+50en_US
dc.identifier.issn1007-5321en_US
dc.identifier.urihttp://hdl.handle.net/10722/155431-
dc.description.abstractThe transmission scheduling of wireless mesh networks (WMNs) is modeled as a problem of conflict graph coloring. A new distributed time division multiple access (TDMA) medium access control algorithm based on parallel graph coloring is proposed. The algorithm utilizes the advantages of mesh routers and backbone networks, and only depends on local topology and traffic load information. Simulation demonstrates that the proposed scheme achieves significant throughput enhancement approaching optimal scheduling in WMNs, and enjoys very low communication overhead.en_US
dc.languageengen_US
dc.relation.ispartofBeijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunicationsen_US
dc.subjectDistributed Scheduling Algorithmen_US
dc.subjectMedium Access Controlen_US
dc.subjectParallel Graph Coloringen_US
dc.subjectWireless Mesh Networksen_US
dc.titleMedium access control algorithm based on parallel graph coloring for wireless mesh networksen_US
dc.typeArticleen_US
dc.identifier.emailLi, VOK:vli@eee.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-38549172286en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-38549172286&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume30en_US
dc.identifier.issue6en_US
dc.identifier.spage36en_US
dc.identifier.epage39+50en_US
dc.identifier.scopusauthoridZhang, XD=23010977600en_US
dc.identifier.scopusauthoridHong, J=36052637200en_US
dc.identifier.scopusauthoridZhang, L=11040255900en_US
dc.identifier.scopusauthoridLi, VOK=7202621685en_US
dc.identifier.scopusauthoridShan, XM=7101712454en_US
dc.identifier.issnl1007-5321-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats