File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: CP-TDMA: Coloring- and probability-based TDMA scheduling for wireless ad hoc networks

TitleCP-TDMA: Coloring- and probability-based TDMA scheduling for wireless ad hoc networks
Authors
KeywordsEdge-Coloring
Explicit Conflict
Implicit Conflict
Probability Theory
Tdma Scheduling
Wireless Ad Hoc Networks
Issue Date2008
PublisherInstitute of Electronics, Information and Communication Engineers. The Journal's web site is located at http://www.ieice.or.jp/
Citation
IEICE Transactions on Communications, 2008, v. E91-B n. 1, p. 322-326 How to Cite?
AbstractThis paper addresses the issue of transmission scheduling in wireless ad hoc networks. We propose a Time Division Multiple Access (TDMA) scheduling scheme based on edge coloring and probabilistic assignment, called CP-TDMA. We categorize the conflicts suffered by wireless links into two types: explicit conflicts and implicit conflicts, and utilize two different strategies to deal with them. Explicit conflicts are avoided completely by a simple distributed edge-coloring algorithm μ-M, and implicit conflicts are minimized by applying probabilistic time slot assignments to links. We evaluate CP-TDMA analytically and numerically, and find that CP-TDMA, which requires only local information exhibits a better performance than previous work. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.
Persistent Identifierhttp://hdl.handle.net/10722/155503
ISSN
2015 Impact Factor: 0.3
2015 SCImago Journal Rankings: 0.184
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Xen_US
dc.contributor.authorHong, Jen_US
dc.contributor.authorZhang, Len_US
dc.contributor.authorShan, Xen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2012-08-08T08:33:49Z-
dc.date.available2012-08-08T08:33:49Z-
dc.date.issued2008en_US
dc.identifier.citationIEICE Transactions on Communications, 2008, v. E91-B n. 1, p. 322-326en_US
dc.identifier.issn0916-8516en_US
dc.identifier.urihttp://hdl.handle.net/10722/155503-
dc.description.abstractThis paper addresses the issue of transmission scheduling in wireless ad hoc networks. We propose a Time Division Multiple Access (TDMA) scheduling scheme based on edge coloring and probabilistic assignment, called CP-TDMA. We categorize the conflicts suffered by wireless links into two types: explicit conflicts and implicit conflicts, and utilize two different strategies to deal with them. Explicit conflicts are avoided completely by a simple distributed edge-coloring algorithm μ-M, and implicit conflicts are minimized by applying probabilistic time slot assignments to links. We evaluate CP-TDMA analytically and numerically, and find that CP-TDMA, which requires only local information exhibits a better performance than previous work. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.en_US
dc.languageengen_US
dc.publisherInstitute of Electronics, Information and Communication Engineers. The Journal's web site is located at http://www.ieice.or.jp/en_US
dc.relation.ispartofIEICE Transactions on Communicationsen_US
dc.subjectEdge-Coloringen_US
dc.subjectExplicit Conflicten_US
dc.subjectImplicit Conflicten_US
dc.subjectProbability Theoryen_US
dc.subjectTdma Schedulingen_US
dc.subjectWireless Ad Hoc Networksen_US
dc.titleCP-TDMA: Coloring- and probability-based TDMA scheduling for wireless ad hoc 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.doi10.1093/ietcom/e91-b.1.322en_US
dc.identifier.scopuseid_2-s2.0-58349121440en_US
dc.identifier.hkuros152492-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-58349121440&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volumeE91-Ben_US
dc.identifier.issue1en_US
dc.identifier.spage322en_US
dc.identifier.epage326en_US
dc.identifier.isiWOS:000252617100041-
dc.publisher.placeJapanen_US
dc.identifier.scopusauthoridZhang, X=23010977600en_US
dc.identifier.scopusauthoridHong, J=36052637200en_US
dc.identifier.scopusauthoridZhang, L=11040255900en_US
dc.identifier.scopusauthoridShan, X=7101712454en_US
dc.identifier.scopusauthoridLi, VOK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats