File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/INFOCOM.2015.7218564
- Scopus: eid_2-s2.0-84954241356
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A new upper bound on the control information required in multiple access communications
Title | A new upper bound on the control information required in multiple access communications |
---|---|
Authors | |
Issue Date | 2015 |
Publisher | IEEE. 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? |
Abstract | The 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 Identifier | http://hdl.handle.net/10722/217388 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chuai, J | - |
dc.contributor.author | Li, VOK | - |
dc.date.accessioned | 2015-09-18T05:58:10Z | - |
dc.date.available | 2015-09-18T05:58:10Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | The 2015 IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China, 26 April-1 May 2015. In Conference Proceedings, 2015, p. 1822-1830 | - |
dc.identifier.isbn | 9781479983810 | - |
dc.identifier.uri | http://hdl.handle.net/10722/217388 | - |
dc.description.abstract | The 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.language | eng | - |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359 | - |
dc.relation.ispartof | INFOCOM, IEEE Computer and Communications Societies, IEEE Annual Joint Conference | - |
dc.relation.ispartof | http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7172813 | - |
dc.title | A new upper bound on the control information required in multiple access communications | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Li, VOK: vli@eee.hku.hk | - |
dc.identifier.authority | Li, VOK=rp00150 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/INFOCOM.2015.7218564 | - |
dc.identifier.scopus | eid_2-s2.0-84954241356 | - |
dc.identifier.hkuros | 254303 | - |
dc.identifier.spage | 1822 | - |
dc.identifier.epage | 1830 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 151119 | - |