• DocumentCode
    1995474
  • Title

    Dynamic Single-Row Routing Technique for Channel Assignments

  • Author

    Salleh, Shaharuddin ; Sarmin, Nor Haniza

  • Author_Institution
    Dept of Math., Univ. Teknol. Malaysia, Skudai
  • fYear
    2009
  • fDate
    27-29 April 2009
  • Firstpage
    41
  • Lastpage
    46
  • Abstract
    Channel assignments in a wireless cellular network is a discrete-time event process involving the correct mapping of the channels to the caller-receiver pairs. The channels are assigned in such a way that they are constantly reused once a particular assignment is completed. In this work, a dynamic single-row routing technique is proposed to handle channel assignments for wireless cellular networks. The dynamic technique refers to the constantly changing shape of the single-row network over time as a result of its transformation from its base graph. The base graph is formed from the caller-receiver pairs in the cellular network whose shape is determined from factors such as their cellular location and duration of calls. This graph is transformed into a single-row network where the pins in the network become the channels. The transformation process is conducted dynamically over time to produce a dynamic single-row network as part of the circuitry in the multi-switching center.
  • Keywords
    cellular radio; channel allocation; graph theory; radio networks; telecommunication network routing; base graph; caller-receiver pair; channel assignment; discrete-time event process; dynamic single-row routing technique; wireless cellular network; Cellular networks; Circuit simulation; Electronic components; Information technology; Land mobile radio cellular systems; Pins; Receivers; Routing; Shape; Telephony; Single-row routing; channel assignments; discrete-time simulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology: New Generations, 2009. ITNG '09. Sixth International Conference on
  • Conference_Location
    Las Vegas, NV
  • Print_ISBN
    978-1-4244-3770-2
  • Electronic_ISBN
    978-0-7695-3596-8
  • Type

    conf

  • DOI
    10.1109/ITNG.2009.316
  • Filename
    5070590