• Title/Summary/Keyword: Channel Assignment Algorithm

Search Result 98, Processing Time 0.028 seconds

Channel assignment for 802.11p-based multi-radio multi-channel networks considering beacon message dissemination using Nash bargaining solution (802.11p 기반 다중 라디오 다중채널 네트워크 환경에서 안전 메시지 전송을 위한 내쉬 협상 해법을 이용한 채널할당)

  • Kwon, Yong-Ho;Rhee, Byung-Ho
    • Journal of Internet Computing and Services
    • /
    • v.15 no.3
    • /
    • pp.63-69
    • /
    • 2014
  • For the safety messages in IEEE 802.11p vehicles network environment(WAVE), strict periodic beacon broadcasting requires status advertisement to assist the driver for safety. WAVE standards apply multiple radios and multiple channels to provide open public road safety services and improve the comfort and efficiency of driving. Although WAVE standards have been proposed multi-channel multi-radio, the standards neither consider the WAVE multi-radio environment nor its effect on the beacon broadcasting. Most of beacon broadcasting is designed to be delivered on only one physical device and one control channel by the WAVE standard. also conflict-free channel assignment of the fewest channels to a given set of radio nodes without causing collision is NP-hard, even with the knowledge of the network topology and all nodes have the same transmission radio. Based on the latest standard IEEE 802.11p and IEEE 1609.4, this paper proposes an interference aware-based channel assignment algorithm with Nash bargaining solution that minimizes interference and increases throughput with wireless mesh network, which is deigned for multi-radio multi-cahnnel structure of WAVE. The proposed algorithm is validated against numerical simulation results and results show that our proposed algorithm is improvements on 8 channels with 3 radios compared to Tabu and random channel allocation algorithm.

An Unequal Protection FEC Scheme for Video over Optical Access Networks

  • Cao, Yingying;Chen, Xue;Wang, Liqian;Li, Xicong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.6
    • /
    • pp.1463-1479
    • /
    • 2013
  • In this paper, we propose an unequal protection physical coding sub-layer (PCS) forward error correction (FEC) scheme for efficient and high-quality transmission of video data over optical access networks. Through identifying and resolving the unequal importance of different video frames and passing this importance information from MAC-layer to PCS, FEC scheme of PCS can be adaptive to application-layer data. Meanwhile, we jointly consider the different channel situations of optical network unit (ONU) and improve the efficiency of FEC redundancy by channel adaptation. We develop a theoretical algorithm and a hardware method to achieve efficient FEC assignment for the proposed unequal protection scheme. The theoretical FEC assignment algorithm is to obtain the optimal FEC redundancy allocation vector that results in the optimum performance index, namely frame error rate, based on the identified differential importance and channel situations. The hardware method aims at providing a realistic technical path with negligible hardware cost increment compared with the traditional FEC scheme. From the simulation results, the proposed Channel and Application-layer data Adaptation Unequal Protection (CAAUP) FEC scheme along with the FEC ratio assignment algorithm and the hardware method illustrates the ability of efficient and high-quality transmission of video data against the random errors in the channel of optical access networks.

Two phase algorithm for frequency assignment in cellular mobile systems with maximal distance of channel interference

  • Kim, Sehun;Kim, Seong-Lyun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1994.04a
    • /
    • pp.291-300
    • /
    • 1994
  • In this paper we consider the frequency assignment problem (FAP) in a cellular mobile communication system which has a maximal distance of channel interference. This special structure is observed in most cellular systems. To handle the considered FAP, we use the pattern approach which fits naturally to the problem. Based on this approach, we are able to formulate the considered FAP into a manageable optimization problem and propose a two phase heuristic algorithm for the problem. Computational experiments show that our algorithm performs much better in both solution quality and computational time than the recently developed algorithms for FAP. Since the considered FAP well reflects most cellular systems, our algorithm can be applied to many practical situations.

A Real-Time Algorithm for Timeslot Assignment in ISM System with DVB-RCS

  • Lee, Ik-Sun;Sung, Chang-Sup;Jin, Gwang-Ja;Han, Ki-Seop
    • ETRI Journal
    • /
    • v.29 no.3
    • /
    • pp.329-335
    • /
    • 2007
  • This paper considers a timeslot assignment problem in an interactive satellite multimedia (ISM) system with digital video broadcast-return channel via satellite (DVB-RCS). The timeslot assignment problem is formulated as a binary integer programming to maximize the overall weighted throughput and is shown to be NP-hard. Thus, three real-time heuristic algorithms including ratio-based, packet-size (PS)-based, and transmission gain (TG)-based are derived, and some computational experiments are made. Considering the results, the ratio-based heuristic algorithm is demonstrated to be the most effective and efficient. We propose adapting the ratio-based heuristic algorithm to the timeslot assignment problem to greatly improve the ISM system utilization.

  • PDF

B-DCS Fiber-Optic Network Design Algorithm Considering Network Survivability (생존도가 보장된 B-DCS 광전송망 설계 알고리즘)

  • 이인행;이영옥;정순기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1899-1909
    • /
    • 1999
  • Considering survivability in fiber-optic transmission networks using B-DCS(Broadband Digital Cross-connect System), a network design problem consists of WCAP(Working Channel Assignment Problem) and SCAP(Spare Channel Assignment Problem). WCAP has not been studied intensively as a part of a network design problem to minimize total network cost while SCAP has been studied in the several papers as an independent problem. In this study, we developed a WSCAP(Working and Spare Channel Assignment Problem) algorithm which is to minimize the total number of spare channels and working channels. After problem description, an IP(Integer Programming) model is formulated and several heuristic algorithms are presented. Finally, the result of a case study is described.

  • PDF

A Cluster-Based Channel Assignment Algorithm for IEEE 802.11b/g Wireless Mesh Networks (IEEE 802.11b/g 무선 메쉬 네트워크를 위한 클러스터 기반 채널 할당 알고리즘)

  • Cha, Si-Ho;Ryu, Min-Woo;Cho, Kuk-Hyun;Jo, Min-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.87-93
    • /
    • 2009
  • Wireless mesh networks (WMNs) are emerging technologies that provide ubiquitous environments and wireless broadband access. The aggregate capacity of WMNs can be improved by minimizing the effect of channel interference. The IEEE 802.11b/g standard which is mainly used for the network interface technology in WMNs provides 3 multiple channels. We must consider the channel scanning delay and the channel dependency problem to effectively assign channels in like these multi-channel WMNs. This paper proposes a cluster-based channel assignment (CB-CA) algorithm for multi-channel WMNs to solve such problems. The CB-CA does not perform the channel scanning and the channel switching through assigning co-channel to the inter-cluster head (CH) links. In the CB-CA, the communication between the CH and cluster member (CM) nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-CA can minimize the interference within multi-channel environments. Our simulation results show that CB-CA can improve the performance of WMNs.

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

  • Zakaria, Omar M.;Hashim, Aisha-Hassan Abdalla;Hassan, Wan Haslina;Khalifa, Othman Omran;Azram, Mohammad;Goudarzi, Shidrokh;Jivanadham, Lalitha Bhavani;Zareei, Mahdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.146-170
    • /
    • 2017
  • Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.

A Distributed Dynamic Channel Assignment Algorithm in Highway Microcells

  • Lee, Chae-Young;Park, Hyun-Jeong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.2
    • /
    • pp.187-201
    • /
    • 1996
  • A distributed dynamic channel assignment is proposed and its performance is examined in a highway microcellular radio environment. In the two step ordered local packing (TOLP) scheme, channels are assigned on an ordered basis under cochannel utilization in congested microcell region. A selection criterion is employed to decide the cell from which a free channel is borrowed. Simulation results show that the proposed scheme outperforms existing methods is channel utilization and call blocking probabilities, especially under asymmetric call arrivals with a lower call switching requirement.

  • PDF

A New Fast P2P Video Transmission Method Applied in Asymmetrical Speed Channel Environment

  • Wang, Zhang;Zhang, Jixian;Li, Haitao;Liu, Jian
    • Journal of Communications and Networks
    • /
    • v.12 no.3
    • /
    • pp.209-215
    • /
    • 2010
  • In an asymmetrical speed channel environment like asymmetric digital subscriber line, the up-link bandwidth is normally smaller than the down-link bandwidth, which will lead to extremely low utilization of down-link bandwidth when current P2P video transmission is applied. To overcome this, a new fast P2P video transmission method applied in an asymmetrical speed channel environment is proposed in this paper. On the basis of the many-to-one concept, the proposed method uses a new multipeer aggregation technique to enhance the utilization of down-link bandwidth. In addition, an adaptive peer assignment algorithm is also introduced in order to minimize the overall transmission time. Experimental results show that by using our proposed method, the utilization of down-link bandwidth is significantly improved, and the overall transmission time is greatly reduced.

Universal and Can be Applied Wireless Channel Assignment Algorithm (범용 적용이 가능한 무선채널할당알고리즘)

  • Heo, Seo-Jung;Son, Dong-Cheul;Kim, Chang-Suk
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.375-381
    • /
    • 2012
  • If a mobile station requests a channel allocation in its mobile networks, the switching center assigns a channel to a mobile station that belongs to each base station. There are three kinds of channel allocation schemes; a fixed channel allocation, a dynamic channel allocation and a hybrid combination of these two forms. In assigning a good frequency, it is our intention to provide quality service to our customers as well as to use resources efficiently. This paper proposes methods of assigning frequencies that minimize interference between channels and that also minimize the amount of searching time involved. In this paper, we propose an algorithm to per specific equipment, regardless of the number of channels that can be used as a general-purpose system, such as base stations, control stations, central office model is proposed, the existing operators manner similar to the fixed channel allocation based statistics and assigned when the conventional method and the improved method is proposed. Different ways and compared via simulations to verify the effectiveness of the proposed approach.