TY - GEN
T1 - Resilient large-scale cognitive radio ad hoc networking using path-time codes
AU - Chen, Yi Chi
AU - Lai, I. Wei
AU - Chen, Kwang Cheng
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/28
Y1 - 2017/7/28
N2 - Cognitive radio ad hoc networks (CRAHNs) emerge as a spectrum efficient networking technology to enable autonomous machine-to-machine communication among massive number of IoT devices. However, spectrum sharing results in opportunistic links and CRAHN becomes a kind of opportunistic networks. To reduce latency in CRAHN and to achieve overall spectrum efficiency by avoiding tremendous feedback signaling, CRAHNs of open-loop physical layer transmission open a new avenue under massive operations. The new technology challenge associated with such new CRAHNs lies in error control with only local networking information without relying on feedback control over each opportunistic link. Path-time codes virtually realizing multi-input-multi-output over network layer have been innovated to resolve such a dilemma. However, effective multipath routing considering interference remains unclear. In this paper, be taking network topological factors and interference into account, we analytically derive SINR approximations to design power control and multi-path greedy routing. By stochastic geometry analysis, we also show that the resilient operation for large-scale CRAHNs can be facilitated with the aid of path-time codes.
AB - Cognitive radio ad hoc networks (CRAHNs) emerge as a spectrum efficient networking technology to enable autonomous machine-to-machine communication among massive number of IoT devices. However, spectrum sharing results in opportunistic links and CRAHN becomes a kind of opportunistic networks. To reduce latency in CRAHN and to achieve overall spectrum efficiency by avoiding tremendous feedback signaling, CRAHNs of open-loop physical layer transmission open a new avenue under massive operations. The new technology challenge associated with such new CRAHNs lies in error control with only local networking information without relying on feedback control over each opportunistic link. Path-time codes virtually realizing multi-input-multi-output over network layer have been innovated to resolve such a dilemma. However, effective multipath routing considering interference remains unclear. In this paper, be taking network topological factors and interference into account, we analytically derive SINR approximations to design power control and multi-path greedy routing. By stochastic geometry analysis, we also show that the resilient operation for large-scale CRAHNs can be facilitated with the aid of path-time codes.
KW - Internet of things (IoT)
KW - Poisson point process (PPP)
KW - cognitive radio ad hoc networks (CRAHNs)
KW - machine-to-machine communication
KW - path-time code (PTC)
KW - space-time code
KW - stochastic geometry
KW - virtual multiple-input multiple-output (MIMO)
UR - http://www.scopus.com/inward/record.url?scp=85028303889&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028303889&partnerID=8YFLogxK
U2 - 10.1109/ICC.2017.7996413
DO - 10.1109/ICC.2017.7996413
M3 - Conference contribution
AN - SCOPUS:85028303889
T3 - IEEE International Conference on Communications
BT - 2017 IEEE International Conference on Communications, ICC 2017
A2 - Debbah, Merouane
A2 - Gesbert, David
A2 - Mellouk, Abdelhamid
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Communications, ICC 2017
Y2 - 21 May 2017 through 25 May 2017
ER -