• DocumentCode
    2998848
  • Title

    An Energy-Optimum and Communication-Time Efficient Protocol for Allocation, Scheduling and Routing in Wireless Networks

  • Author

    Neves, Thiago F. ; Caetano, Marcos F. ; Bordim, Jacir L.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Brasilia, Brasilia, Brazil
  • fYear
    2012
  • fDate
    21-25 May 2012
  • Firstpage
    848
  • Lastpage
    854
  • Abstract
    The growing demand for mobile wireless access has stimulated the emergence of new communication technologies. Opportunistic Spectrum Access (OSA) is viewed as a promising alternative to overcome the problems caused by static spectrum assignment. Opportunistic access allows dynamic mapping of the transmission needs and communication opportunities. However, performing this task efficiently is not trivial. Indeed, it has been shown to be NP-complete. In this context, this paper presents an efficient heuristic for solving the problem of channel allocation and routing, according to the opportunities and channels available. The proposed heuristic is optimal in terms of energy consumption, being close to the optimum, about 5% above, in terms of transmission time.
  • Keywords
    communication complexity; energy consumption; protocols; radio networks; scheduling; telecommunication network routing; NP-complete; OSA; channel allocation; communication-time efficient protocol; energy consumption; energy-optimum efficient protocol; mobile wireless access; opportunistic spectrum access; routing; scheduling; transmission time; wireless networks; Complexity theory; Energy consumption; Image color analysis; Network topology; Protocols; Resource management; Routing; Energy Optimum Protocols; Multi-Channel Allocation; Network Protocols; OSA; Routing; Scheduling; Wireless Networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-1-4673-0974-5
  • Type

    conf

  • DOI
    10.1109/IPDPSW.2012.104
  • Filename
    6270727