• Title/Summary/Keyword: hop-based channel assignment

Search Result 8, Processing Time 0.036 seconds

A Study of Distributed Channel Assignment Algorithm Based on Traffic-Awareness in the Wireless Mesh Network (무선 메쉬 네트워크 환경에서 트래픽 가중치에 따른 분산 채널 할당 알고리즘에 관한 연구)

  • Kim, Jae-Wan;Yoon, Jun-Yong;Yang, Chang-Mo;Lee, Seung-Beom;Eom, Doo-Seop
    • Journal of Information Technology Services
    • /
    • v.11 no.2
    • /
    • pp.291-306
    • /
    • 2012
  • Recently, Wireless Mesh Network (WMN) technology recently has been used in various industries. Especially, a number of multi-channel assignment schemes have been presented to improve the throughput of IEEE 802.11-based multi-hop WMN. However, performance of the conventional multi-channel assignment schemes is not enough to satisfy the industry requirements. We, thus, should study more about the multi-channel assignment scheme in order to enhance the performance. This paper proposes a novel channel assignment scheme that employs Multi-channel and Multi-Interface in the WMN. The proposed scheme can obtain the traffic information of the network and the efficient channel assignment result without any message exchanges. We verify the efficiency of the proposed scheme through the mathematical modeling and the real-world experiments. The results show that the proposed scheme improves the throughput of the network compared with the conventional schemes.

Distributed Multi-channel Assignment Scheme Based on Hops in Wireless Mesh Networks (무선 메쉬 네트워크를 위한 홉 기반 분산형 다중 채널 할당 방안)

  • Kum, Dong-Won;Choi, Jae-In;Lee, Sung-Hyup;Cho, You-Ze
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.1-6
    • /
    • 2007
  • In wireless mesh networks (WMNs), the end-to-end throughput of a flow decreases drastically according to the traversed number of hops due to interference among different hops of the same flow in addition to interference between hops of different flows with different paths. This paper proposes a distributed multi-channel assignment scheme based on hops (DMASH) to improve the performance of a static WMN. The proposed DMASH is a novel distributed multi-channel assignment scheme based on hops to enhance the end-to-end throughput by reducing interference between channels when transmitting packets in the IEEE 802.11 based multi-interface environments. The DMASH assigns a channel group to each hop, which has no interference between adjacent hops from a gateway in channel assignment phase, then each node selects its channel randomly among the channel group. Since the DMASH is a distributed scheme with unmanaged and auto-configuration of channel assignment, it has a less overhead and implementation complexity in algorithm than centralized multi-channel assignment schemes. Simulation results using the NS-2 showed that the DMASH could improve remarkably the total network throughput in multi-hop environments, comparing with a random channel assignment scheme.

A Cluster Based Multi-channel Assignment Scheme for Adaptive Tactical Wireless Mesh Network (무선 메쉬 네트워크의 군 환경 적용을 위한 클러스터 기반 멀티채널 할당 기법)

  • Kim, Young-An
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.5
    • /
    • pp.880-887
    • /
    • 2011
  • The Wireless Mesh Network(WMN) technology is able to provide an infrastructure for isolated islands, in which it is difficult to install cables or wide area such as battlefield. Therefore, WMN is frequently used to satisfy needs for internet connection and active studies and research on them are in progress. However, as a result of increase in number of hops under hop-by-hop communication environment has caused a significant decrease in throughput and an increase in delay. Considering the heavy traffic of real-time data, such as voice or moving pictures to adaptive WMN, in a military environment. Such phenomenon might cause an issue in fairness index. In order to resolve this issue, we proposed a Cluster Based Multi-channel Assignment Scheme(CB-MAS) for adaptive tactical wireless mesh network. In the CB-MAS, the communication between the Cluster-Head(CH) and cluster number nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-MAS can minimize the interference within multi-channel environments. Our Simulation results showed that CB-MAS achieves improved the throughput and fairness index in WMN.

Load-Aware Channel Switching Algorithm for Multi-Channel Multi-Hop Wireless Network (멀티 채널 멀티 홉 무선 네트워크에서 부하 인지 채널 변경 기술)

  • Kang, Min-Su;Lee, Young-Suk;Kang, Nam-Hi;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.110-118
    • /
    • 2007
  • In multi-hop wireless network, multi-channel makes it possible to enhance network performance because it reduces channel interferences md contentions. Recently several schemes have been proposed in the literatures to use multi-channel. Especially, MCR(Multi channel routing protocol), which utilize hybrid interface assignment, is a prominent routing protocol. MCR uses simple way to change channel but efficiently reduce channel interferences. In this paper, we propose a load-aware channel selection algorithm called LCS that enhances the channel switching algerian used in MCR protocol. In LCS, channel of a node is assigned based on collected information about queue length of neighbors. Moreover this paper evaluates the performance of in by using simulation test and testbed demonstration. Test results show that the MCR with LCS outperforms the naive MCR.

Cluster-based Cooperative Data Forwarding with Multi-radio Multi-channel for Multi-flow Wireless Networks

  • Aung, Cherry Ye;Ali, G.G. Md. Nawaz;Chong, Peter Han Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.12
    • /
    • pp.5149-5173
    • /
    • 2016
  • Cooperative forwarding has shown a substantial network performance improvement compared to traditional routing in multi-hop wireless network. To further enhance the system throughput, especially in the presence of highly congested multiple cross traffic flows, a promising way is to incorporate the multi-radio multi-channel (MRMC) capability into cooperative forwarding. However, it requires to jointly address multiple issues. These include radio-channel assignment, routing metric computation, candidate relay set selection, candidate relay prioritization, data broadcasting over multi-radio multi-channel, and best relay selection using a coordination scheme. In this paper, we propose a simple and efficient cluster-based cooperative data forwarding (CCDF) which jointly addresses all these issues. We study the performance impact when the same candidate relay set is being used for multiple cross traffic flows in the network. The network simulation shows that the CCDF with MRMC not only retains the advantage of receiver diversity in cooperative forwarding but also minimizes the interference, which therefore further enhances the system throughput for the network with multiple cross traffic flows.

Contention-based Reservation Protocol Using a Counter for Detecting a Source Conflict in WDM Single-hop Optical Network with Non-equivalent Distance

  • Sakuta, Makoto;Nishino, Yoshiyuki;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.3 no.4
    • /
    • pp.365-373
    • /
    • 2001
  • We propose a new channel reservation protocol which can reduce message delay by using a counter for detection of d source conflict in a WDM single-hop network with non-equivalent propagation delay. A source convict occurs when a source node has the right to transmit more than or equal to two messages simultaneously, which are transmitted using different wavelengths. In such a case, the source node has to newly obtain the right to transmit the message. In the proposed protocol, by using a source conflict counter a source node can detect a source conflict before a wave-length assignment is performed. Therefore, the source node can start a procedure to newly obtain the right to transmit the message which cannot be transmitted due to a source conflict. We analyse the throughput performance by taking the effect of a source conflict into account, and show that the approximate analysis and the computer simulated results are close. Also, from computer simulated results, we show that our proposed protocol can reduce mean message delay dramatically without degrading throughput performance as the offered load becomes large.

  • PDF

A Model-based Rate Separation Algorithm Using Multiple Channels in Multi-Radio Ad Hoc Networks (멀티 라디오 애드혹 네트워크에서의 멀티 채널을 이용한 모델 기반 레이트 분할 알고리즘)

  • Kim, Sok-Hyong;Kim, Dong-Wook;Suh, Young-Joo;Kwon, Dong-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1A
    • /
    • pp.73-81
    • /
    • 2011
  • IEEE 802.11 PHY and MAC layer provide multiple channels and data rates. To improve the performance of IEEE 802.11 multi-radio ad hoc networks, it is required to utilize available channels and data rates efficiently. However, in IEEE 802.11 multi-rate networks, the rate anomaly (RA) problem occurs that the network performance is severely degraded as low-rate links affect high-rate links. Hence, in this paper, we propose a model-based rate separation (MRS) algorithm that uses multiple channels to separate different data rate links so that the RA problem is mitigated. MRS algorithm utilizes an existing throughput model that estimates the throughput of IEEE 802.11 single-hop networks to separate low-rate links and high-rate links. Through simulations, we demonstrate that the MRS algorithm shows improved network performance compared with existing algorithms in multi-radio ad hoc networks.

Coalition Formation Game Based Relay Selection and Frequency Sharing for Cooperative Relay Assisted Wireless D2D Networks with QoS Constraints

  • Niu, Jinxin;Tang, Wei;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5253-5270
    • /
    • 2016
  • With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.