File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A new upper bound on the control information required in multiple access communications

TitleA new upper bound on the control information required in multiple access communications
Authors
Issue Date2015
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
Citation
The 2015 IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China, 26 April-1 May 2015. In Conference Proceedings, 2015, p. 1822-1830 How to Cite?
AbstractThe minimum amount of information that should be supplied to transmitters to resolve traffic conflicts in a multiple access system is investigated in this paper. The arriving packets are modeled as the random points of a homogeneous Poisson point process distributed within a unit interval. The minimum information required is equal to the minimum entropy of a random partition that separates the points of the Poisson point process. Only a lower bound of this minimum is known in previous work. We provide an upper bound of this minimum entropy, and the gap with the existing lower bound is shown to be smaller than log2 e bits. The upper bound asymptotically achieves the minimum entropy required to resolve per unit traffic. We then analyze the control information used to resolve the traffic conflicts in the splitting algorithm and in the slotted-ALOHA protocol, and identify their gaps with the theoretic bound.
Persistent Identifierhttp://hdl.handle.net/10722/217388
ISBN
Awardlink_to_OA_fulltext

 

DC FieldValueLanguage
dc.contributor.authorChuai, J-
dc.contributor.authorLi, VOK-
dc.date.accessioned2015-09-18T05:58:10Z-
dc.date.available2015-09-18T05:58:10Z-
dc.date.issued2015-
dc.identifier.citationThe 2015 IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China, 26 April-1 May 2015. In Conference Proceedings, 2015, p. 1822-1830-
dc.identifier.isbn978-1-4799-8381-0-
dc.identifier.urihttp://hdl.handle.net/10722/217388-
dc.description.abstractThe minimum amount of information that should be supplied to transmitters to resolve traffic conflicts in a multiple access system is investigated in this paper. The arriving packets are modeled as the random points of a homogeneous Poisson point process distributed within a unit interval. The minimum information required is equal to the minimum entropy of a random partition that separates the points of the Poisson point process. Only a lower bound of this minimum is known in previous work. We provide an upper bound of this minimum entropy, and the gap with the existing lower bound is shown to be smaller than log2 e bits. The upper bound asymptotically achieves the minimum entropy required to resolve per unit traffic. We then analyze the control information used to resolve the traffic conflicts in the splitting algorithm and in the slotted-ALOHA protocol, and identify their gaps with the theoretic bound.-
dc.languageeng-
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359-
dc.relation.ispartofINFOCOM, IEEE Computer and Communications Societies, IEEE Annual Joint Conference-
dc.relation.ispartofhttp://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7172813-
dc.rightsINFOCOM, IEEE Computer and Communications Societies, IEEE Annual Joint Conference. Copyright © IEEE.-
dc.rights© IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.titleA new upper bound on the control information required in multiple access communications-
dc.typeConference_Paper-
dc.identifier.emailLi, VOK: vli@eee.hku.hk-
dc.identifier.authorityLi, VOK=rp00150-
dc.identifier.doi10.1109/INFOCOM.2015.7218564-
dc.identifier.hkuros254303-
dc.identifier.spage1822-
dc.identifier.epage1830-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 151119-
dc.description.awardlink_to_OA_fulltext-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats