<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

1998 - 199912000 - 2009102010 - 20194

Settings

🏛️國立陽明交通大學機構典藏

Subject: search.filters.subject.channel assignment

Search Results

Now showing 1 - 10 of 15
  • Thumbnail Image
    Item type:Item,
    Link-preserving channel assignment game for wireless mesh networks
    (2019-01-01)
    Yen, Li-Hsing
    ;
    Ye, Bo-Rong
    ;
    資訊工程學系
    ;
    Department of Computer Science
    To deliver user traffic in a wireless mesh network (WMN), mesh stations equipped with multiple interfaces communicate with one another utilising multiple orthogonal channels. Channel assignment is to assign one channel to each interface to minimise co-channel interference among wireless links while preserving link connectivity. The interference and connectivity objectives are generally conflicting. This paper first analyses the probability of link connectivity when channels are randomly assigned to interfaces. We then propose a game-theoretic approach that jointly considers the two objectives with a unified payoff function. We prove that the proposed approach is an exact potential game, which guarantees stability in a finite time. We also prove the link-preserving property of the approach. Simulation results show that the proposed approach generally outperforms counterparts in terms of network interference when a moderate number of channels are available. For fairness of link interference, both the proposed approach and its variant outperform the counterparts.
  • Thumbnail Image
    Item type:Item,
    Link-Preserving Channel Assignment Game for Wireless Mesh Networks
    (2016-01-01)
    Yen, Li-Hsing
    ;
    Ye, Bo-Rong
    ;
    資訊工程學系
    ;
    Department of Computer Science
    To deliver user traffic in a wireless mesh network, mesh stations equipped with multiple wireless interfaces communicate with one another utilizing multiple orthogonal channels. Channel assignment in such an environment is to assign one channel to each interface to minimize co-channel interference among wireless links while preserving link connectivity. The interference and connectivity objectives are generally conflicting. This paper proposes a game-theoretic approach that jointly considers the two objectives with a unified payoff function. We prove that the proposed approach is an exact potential game, which guarantees stability in a finite time. We also prove the link-preserving property of the approach. Simulation results show that the proposed approach generally outperforms counterparts in terms of network interference when a moderate number of channels are available.
  • Thumbnail Image
    Item type:Item,
    Interface Constraint Aware Modeling in Wireless Mesh Networks Using Mixed Hypergraph
    (2015)
    Chen, Ying-Yu
    ;
    Chen, Chien
    ;
    資訊工程學系
    ;
    Department of Computer Science
    This paper focuses on channel assignment in wireless mesh networks. Since nodes have only a limited number of radio interfaces, channel assignment must ensure that the interface constraint is obeyed. Although many channel assignment heuristics have been proposed, the interface constraint is usually treated as a separate constraint that is not well incorporated in the heuristics themselves. In this paper, we propose a mixed hypergraph model that captures the interface constraint on nodes and the interference between links. We propose a greedy-based channel assignment algorithm that minimizes the interference between links while conforming to the interface constraint. Simulation results show that our proposed algorithm performs especially well when the number of network interface cards is small.
  • Thumbnail Image
    Item type:Item,
    A combined channel assignment mechanism for hierarchical cellular systems
    (1998-09-01)
    Lo, KR
    ;
    Chang, CJ
    ;
    Chang, C
    ;
    Shung, CB
    ;
    電子工程學系及電子研究所
    This paper proposes a combined channel assignment (CCA) mechanism for hierarchical cellular systems with overlaying macrocells and overlaid microcells. The proposed CCA mechanism combines overflow, underflow, and reversible schemes, where new or handoff calls having no available channel to use in the overlaid microcell can overflow to use free channels in the overlaying macrocell, handoff calls from a neighboring macrocell can underflow to use free channels in the overlaid microcell, and handoff attempts from a macrocell-only region to an overlaid microcell can be reversed to use free channels in the microcell. We apply the CCA mechanism in two different hierarchical cellular systems of Strip type and Manhattan type and compare the CCA with the overflow channel assignment (OCA) scheme. Simulation results show that the CCA mechanism outperforms the OCA scheme by once in forced termination probability, by several times in new call blocking probability, and by 4.7% in system utilization for a hierarchical cellular system, and the CCA mechanism is more suitable for the Manhattan type than for the Strip type. (C) 1998 Elsevier Science B.V.
  • Thumbnail Image
    Item type:Item,
    Load-balancing channel assignment for dual-band PCS networks
    (2002-03-01)
    Chang, MF
    ;
    Li, LS
    ;
    資訊工程學系
    ;
    Department of Computer Science
    This paper investigates the channel assignment problem of dual-band PCS systems where single-band and dual-band handsets co-exist. Load-balancing channel assignment schemes are proposed to improve the system performance. To balance the loads of both bands, the BSC selects a band to serve a call request of a dual-band handset based on the loads of both bands. In addition, a channel re-assignment scheme is used to further improve the system capacity. Analytic models and computer simulations have been developed to evaluate the performance of the load-balancing schemes. The results indicate that both load-balancing and channel re-assignment techniques significantly increase the system capacity as the percentage of dual-band handsets increases. Furthermore, the load-balancing with channel re-assignment scheme that combines both techniques achieves the best system performance even when the percentage of dual-band handset is as low as 25%. In addition, we describe an approach to reduce the signal overhead of the load-balancing schemes. Copyright (C) 2002 John Wiley Sons, Ltd.
  • Thumbnail Image
    Item type:Item,
    Two-stage dynamic uplink channel and slot assignment for GPRS
    (2003-09-01)
    Hsu, YC
    ;
    Lin, YD
    ;
    Chiang, MY
    ;
    資訊工程學系
    ;
    Department of Computer Science
    General packet radio service (GPRS) uses a two-stage mechanism to allocate uplink radio resource to mobile stations (MSs). In stage-1, the base station (BS) assigns several packet data channels (PDCHs) to an MS. Furthermore, a PDCH may be assigned to multiple MSs. In stage-2, therefore, the BS selects one of the multiplexed MSs in a PDCH to use the radio resource. In this paper, maintaining a load balance between PDCHs in stage-1 is examined and several selection schemes to lower the mis-selection rate in stage-2 are proposed. From our simulation results, the cost deduced from the poor load balancing and selection schemes render a lower system throughput and a non-negligible increase in packet queuing delay. Among the various stage-2 selection policies, round robin with linearly-accumulated adjustment (RRLAA) has the lowest mis-selection rate and outperforms the one without any heuristic by up to 50%.
  • Thumbnail Image
    Item type:Item,
    Repacking on demand for two-tier wireless local loop
    (2004-05-01)
    Hung, HN
    ;
    Lin, YB
    ;
    Peng, NF
    ;
    Tsai, HM
    ;
    統計學研究所
    This paper proposes a radio channel assignment scheme called repacking on demand (RoD) for two-tier wireless local loop (WLL) networks. A two-tier WLL overlays a macrocell with several microcells. When a new call arrives at a two-tier WLL with RoD, if no idle channel is available in both the microcell and the macrocell, repacking is performed (i.e., a call in the macrocell is moved to its corresponding microcell), and then the reclaimed macrocell channel is used to serve the new call. An analytic model is proposed to compute the call blocking probability of the two-tier WLL with repacking. This analytic model is validated against simulation experiments.We prove that the blocking probability is not affected by the call holding time distributions, but is only dependent on the mean of the call holding times. Compared with some previous proposed schemes, RoD has low blocking probability and significantly reduces repacking rate.
  • Thumbnail Image
    Item type:Item,
    Repacking on demand for speed-sensitive channel assignment
    (2005-01-14)
    Tsai, HM
    ;
    Pang, AC
    ;
    Lin, YC
    ;
    Lin, YB
    ;
    資訊工程學系
    In mobile telecommunications networks, radio channels are limited resources that should be carefully allocated. To increase network capacity, channel assignment can be exercised in a hierarchical cellular network (HCN). By considering the speeds of MSs, we propose an HCN channel assignment approach called repacking on demand (RoD). A simulation model is developed to investigate the performance of RoD and some previously proposed approaches for HCN. Our study quantitatively shows that RoD significantly outperforms the previous proposed approaches. (C) 2004 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Item type:Item,
    Impact of Interface Constraint on Channel Assignment in Wireless Mesh Networks
    (2013)
    Chen, Ying-Yu
    ;
    Chen, Chien
    ;
    Jan, Rong-Hong
    ;
    資訊工程學系
    ;
    Department of Computer Science
    We consider the channel assignment problem in wireless mesh networks. Due to the limited number of radio interfaces that each node is equipped with, channel assignment must ensure that the interface constraint is obeyed, i.e., the number of different channels assigned to the links incident on a node must be no greater than the number of interfaces the node is equipped with. However, interface constraint may be one of the causes that hinder the performance of some of the existing heuristics. In this paper, we use simulated annealing to solve the channel assignment problem in wireless mesh networks. We propose two neighbor generating approaches that handle the interface constraint in different ways. The first approach starts with an infeasible random solution, and by using the penalty function technique the solution finally converges to a feasible one. The second approach, on the contrary, allows only feasible solutions to be generated during the simulated annealing process. Simulations are conducted that compare our proposed simulated annealing algorithms together with a tabu-based algorithm under different network traffic scenarios. The results show that our algorithms exhibit lower network interference than the tabu-based algorithm.
  • Thumbnail Image
    Item type:Item,
    A novel interference-resolving algorithm to support asymmetric services in TDD-CDMA systems with directional antennas
    (2002)
    Wang, LC
    ;
    Huang, SY
    ;
    Tseng, YC
    ;
    電信工程研究所
    ;
    Institute of Communications Engineering
    This paper presents a new cross-slot interference-resolving algorithm for supporting unbalance traffic between downlink and uplink in TDD-CDMA systems. To avoid cross-slot interference between downlink and uplink, traditional algorithms typically require a global control on the transmission direction in each time slot among all cells. Obviously, this requirement significantly limits one of the key advantages in the TDD system -- enabling different rate asymmetry. We observe that the tri-sector cellular architecture possesses additional orthogonality inherently due to the directivity of directional antenna, which can provide an additional degree of freedom in allocating radio resource (i.e., time slots). Thus we propose a new distributed slot allocation algorithm based on the tri-sector cellular architecture. The advantage of the proposed algorithm is to enable a TDD-CDMA system to provide asymmetric services with different rates of asymmetry in all cells, thereby having more flexibility in handling uniform traffic patterns.