skip to main content
research-article

Energy-efficient broadcast in multihop cognitive radio networks

Published: 01 December 2015 Publication History

Abstract

Broadcast is an important operation in Cognitive Radio Networks (CRNs). How to achieve broadcast in an energy-efficient way is important since users in CRNs are usually battery-powered. Existing single-channel broadcast mechanisms are not suitable for CRNs because multiple channels can be used in a CRN. Most existing multi-channel broadcast schemes rely on a common control channel (CCC) to support broadcast. However, finding such a CCC in a CRN is difficult because an unlicensed user's available channels are changed over time and space. In this paper, we focus on an environment where no broadcast structure or CCC is established in advance while a node is equipped with one CR transceiver and does not aware of the locations and distances to other nodes. We have defined the one-hop Minimum Multichannel Set Cover (MMSC) problem and the multi-hop Minimum Cost Broadcast (MCB) problem in such an environment. Both problems are NP-hard and we have proposed a heuristic solution, the Energy-Efficient Broadcast (EEB) protocol, to solve them. Considering the uncertain primary user occupancy issue, the EEB protocol features a distributed solution that uses only local information. Simulation results verify that EEB effectively reduces energy consumption and achieves high packet delivery ratio.

References

[1]
http://www.openautomation.net/uploadsproductos/micaz_datasheet.pdf.
[2]
C.J.L. Arachchige, S. Venkatesan, R. Chandrasekaran, N. Mittal, Minimal time broadcasting in cognitive radio networks, 2011.
[3]
K. Bian, J.-M.J. Park, Asynchronous channel hopping for establishing rendezvous in cognitive radio networks, 2011.
[4]
K. Bian, J.-M.J. Park, R. Chen, A quorum-based framework for establishing control channels in dynamic spectrum access networks, 2009.
[5]
A. Busson, Analysis and simulation of a message dissemination algorithm for VANET, Int. J. Commun. Syst., 24 (September 2011) 1212-1229.
[6]
Y. Cai, K.A. Hua, A. Phillips, Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks, April 2005.
[7]
C.-M. Chao, H.-Y. Fu, Providing complete rendezvous guarantee for cognitive radio networks by quorum systems and Latin Squares, April 2013.
[8]
C.-M. Chao, T.-Y. Hsiao, Design of structure-free and energy-balanced data aggregation in wireless sensor networks, J. Network Comput. Appl. (2013). http://dx.doi.org/10.1016/j.jnca.2013.02.013
[9]
C.-M. Chao, Y.-W. Lee, A quorum-based energy-saving MAC protocol design for wireless sensor networks, IEEE Trans. Veh. Technol., 59 (2010) 813-822.
[10]
B. Chen, K. Jamieson, H. Balakrishnan, R. Morris, Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks, 2001.
[11]
F. Dai, J. Wu, An extended localized algorithm for connected dominating set formation in ad hoc wireless networks, IEEE Trans. Parallel Distrib. Syst., 15 (2004) 908-920.
[12]
FCC, Et docket no. 03-222 notice of proposed rule making and order (December 2003).
[13]
M.R. Garey, D.S. Johnson, Freeman, New York, 1979.
[14]
J. Hong, C. Jiannong, L. Wenzhong, L. Sanglu, C. Daoxu, Minimum-transmission broadcast in uncoordinated duty-cycled wireless ad hoc networks, IEEE Trans. Veh. Technol., 59 (2010) 307-318.
[15]
M. Impett, M.S. Corson, V. Park, A receiver-oriented approach to reliable broadcast in ad hoc networks, September 2000.
[16]
S. Ji, R. Beyah, Z. Cail, Minimum-latency broadcast scheduling for cognitive radio networks, 2013.
[17]
A. Kailas, N. Pari, M. Nogueira, Bio-inspired time synchronization for cognitive radio ad hoc networks, 2012.
[18]
S. Kaneko, S. Nomoto, T. Ueda, S. Nomura, K. Takeuchi, Predicting radio resource availability in cognitive radio - an experimental examination, 2008.
[19]
A. Laouiti, A. Qayyum, L. Viennot, Multipoint relaying: an efficient technique for flooding in mobile wireless networks, 2001.
[20]
H. Lim, C. Kim, Multicast tree construction and flooding in wireless ad hoc networks, 2000.
[21]
H. Liu, J. Xiaohua, W. Peng-Jun, L. Xinxin, F.F. Yao, A distributed and efficient flooding scheme using 1-hop information in mobile ad hoc networks, IEEE Trans. Parallel Distrib. Syst., 18 (2007) 658-671.
[22]
B. Lo, I. Akyildiz, A. Al-Dhelaan, Efficient recovery control channel design in cognitive radio ad hoc networks, Proc. IEEE Trans. Veh. Technol., 59 (2010) 4513-4526.
[23]
W. Lou, W. Jie, Double-covered broadcast (DCB): a simple reliable broadcast algorithm in MANETs, 2004.
[24]
W. Lou, J. Wu, On reducing broadcast redundancy in ad hoc wireless networks, IEEE Trans. Mob. Comput., 1 (2002) 111-122.
[25]
K. M., I.F. Blake, V.K. Bhargava, Local broadcast algorithms in wireless ad hoc networks: reducing the number of transmissions, IEEE Trans. Mob. Comput., 11 (2012) 402-413.
[26]
S.Y. Ni, Y.C. Tseng, Y.S. Chen, J.P. Sheu, The broadcast storm problem in a mobile ad hoc network, 1999.
[27]
J. Nieminen, R. Jäntti, L. Qian, Time synchronization of cognitive radio networks, 2009.
[28]
J. Nieminen, L. Qian, R. Jäntti, Network-wide time synchronization in multi-channel wireless sensor networks, Wireless Sens. Network, 3 (2011) 39-53.
[29]
J. Pach, P.K. Agarwal, Wiley, 2007.
[30]
W. Peng, X. Lu, On the reduction of broadcast redundancy in mobile ad hoc networks, 2000.
[31]
A. Qayyum, L. Viennot, A. Laouiti, Multipoint relaying for flooding broadcast messages in mobile wireless networks, 2002.
[32]
K.Y. R., P. Agrawal, Selective broadcasting in multi-hop cognitive radio networks, 2008.
[33]
Y. Sasson, D. Cavin, A. Schiper, Probabilistic broadcast for flooding in wireless mobile ad hoc networks, 2003.
[34]
S. Shaw, Y. Ghamri-Doudane, A. Santos, M. Nogueira, A reliable and distributed time synchronization for cognitive radio networks, 2012.
[35]
C.-F. Shih, W.T. Ying, L. Wanjiun, DH-MAC: a dynamic channel hopping MAC protocol for cognitive radio networks, 2010.
[36]
Y. Song, J. Xie, A distributed broadcast protocol in multi-hop cognitive radio ad hoc networks without a common control channel, 2012.
[37]
I. Stojmenovic, M. Seddigh, J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, 2002.
[38]
M.T. Sun, W.C. Feng, T.H. Lai, Location aided broadcast in wireless ad hoc networks, 2001.
[39]
W. W., K.L. Yeung, A new phase for screening redundant broadcast nodes in source-independent broadcasting protocols, 2011.
[40]
P.-J. Wan, K. Alzoubi, O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, 2002.
[41]
J. Wu, F. Dai, Broadcasting in ad hoc networks based on self-pruning, 2003.
[42]
C.-C. Yang, C.-Y. Chen, A reachability-guaranteed approach for reducing the broadcast storms in MANETs, 2002.
[43]
L. Yongkang, L.X. Cai, S. Xuemin, Joint channel selection and opportunistic forwarding in multi-hop cognitive radio networks, 2011.
[44]
Y. Zhang, Q. Li, G. Yu, B. Wang, ETCH: Efficient channel hopping for communication rendezvous in dynamic spectrum access networks, 2011.

Cited By

View all
  1. Energy-efficient broadcast in multihop cognitive radio networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Computer Communications
    Computer Communications  Volume 72, Issue C
    December 2015
    143 pages

    Publisher

    Elsevier Science Publishers B. V.

    Netherlands

    Publication History

    Published: 01 December 2015

    Author Tags

    1. Broadcast
    2. Channel hopping
    3. Cognitive radio networks
    4. Energy-efficient

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 30 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media