<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

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

Author: search.filters.author.Chen, ChienSubject: search.filters.subject.channel assignment

Search Results

Now showing 1 - 3 of 3
  • 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,
    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,
    Multicast Routing and Channel Assignment in Wireless Mesh Networks
    (2009)
    Chou, Chia-Sheng
    ;
    Chen, Chien
    ;
    Chen, Ying-Yu
    ;
    Jan, Rong-Hong
    ;
    Hsieh, Cheng-Chung
    This paper studies the problem of multicast routing and channel assignment in multi-channel and multi-interface wireless mesh networks. The advantage of the wireless broadcast's nature is used to reduce interference and improve network throughput. The employed network model is first described. Next, a heuristic channel assignment algorithm that makes use of the wireless broadcast's advantage is presented. Simulation results reveal that the proposed heuristic algorithm can reduce interference and increase the network throughput in multi-channel multi-interface wireless mesh networks.