• Title/Summary/Keyword: Bandwidth assignment

Search Result 87, Processing Time 0.02 seconds

Multi-Channel Switching Protocol Using Channel Busy Degree in Ad Hoc Wireless Networks with Multi-Interfaces (다중-인터페이스를 갖는 애드 혹 무선 네트워크에서 채널 혼잡도를 이용한 다중-채널 스위칭 프로토콜)

  • Lim, Hunju;Joung, Sookyoung;Lee, Sungwha;Park, Inkap
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.239-247
    • /
    • 2013
  • In network based on multi-interface, there are needed channel assignment strategy that reduce interference and improve bandwidth efficiency by assigning each interface to available channels in order to utilize effectively multiple wireless interfaces on each node. MCS protocol had been proposed, which improve capacity and throughput of network by using hybrid assignment. MCS uses as the criterion to assign channel the number of node that use the same channel in contention area. but there have an problem that this information exactly does not reflect actually offered channel load. in this paper, we proposes CAMCS protocol to assign channel by that the channel busy degree to indicate the occupancy rate of channel by nodes as well as the number of nodes that use the same channel in inference area is used as criterion for estimation channel load, and conform performance improvement effect by simulation.

Study of Radio Resource Allocation Method for Wireless Broadband Internet System (휴대인터넷 무선자원 할당 연구)

  • Kook Kwang-Ho;Kim Kyung-Hee;Baek Jang-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.3
    • /
    • pp.145-154
    • /
    • 2006
  • WiBro (Wireless Broadband Internet) system is going to be 9ot down to commercialization. The high portable internet system is able to be connected to the high-speed internet using 2.3 GHz frequency bandwidth, anytime and anywhere. An effective scheduling for UGS, rtPS, nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that are the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities with each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

Study of the radio resource allocation method of the Wireless Broadband Internet System (휴대인터넷 무선자원 할당 연구)

  • Guk, Gwang-Ho;Kim, Gyeong-Hui;Baek, Jang-Hyeon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.347-353
    • /
    • 2005
  • WiBro (Wireless Broadband Internet) system is going to be commercialized before long. The high portable internet system is abie to be connected to the high-speed internet using 2.3 CHz frequency bandwidth, anytime and anywhere. An effective scheduling for UCS, rtPS. nrtPS and BE requiring different QoS, which are service types of the WiBro, is necessary to increase the efficiency of radio channels that arc the limiting resource. This paper researches an uplink scheduling that plays a role in assignment for the radio channels from subscribers to base stations. The suggested scheduling provides priorities With each service type considering QoS of them but reserves some bandwidth for lower priory services. After deciding effective amount of bandwidth for reservation, we suggest analytical result on mean delayed time of packet transmission for each terminal, transmission rate for the data, and capacity for uplink. This research can be used as basic data for the standard in the high portable internet system and as data to predict the capacity of base stations.

  • PDF

Design of Dynamic Slot Assignment Protocol for Wireless Multimedia Communication (무선 멀티미디어 통신을 위한 동적 슬롯 할당 MAC 프로토콜 설계)

  • Yoe Hyun;Kang Sang-Wook;Koh Jin-Gwang
    • Journal of Internet Computing and Services
    • /
    • v.4 no.5
    • /
    • pp.61-68
    • /
    • 2003
  • In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and Maximizing channel utilization. Data terminals with random data packets are not provided slot reservation with PRMA protocol. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, and contended their quality of service, Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. So the terminal which wants to request for ABR type service, is allocated a minimum bandwidth from system for the first time, If the system have some extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot, As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization high.

  • PDF

A study on the Improvement of Fairness of DQDB Network (DQDB 망에서 공정성 개선에 관한 연구)

  • 박종재;조영창;강상욱
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2001.05a
    • /
    • pp.237-246
    • /
    • 2001
  • In this paper we introduce a solution to improve the unfairness problem and to remove the waste of bandwidth in the distributed queue dual bus system. This solution requires only a minor modification of the current protocol and further shows no bandwidth wastes when we try to resolve the unfairness problem occurred in current DQDB protocol. There has been many problem in DQDB system in terms of fairness of sending message in each node. In order to solve this problem, Bandwidth Balancing technic and proportional assignment technic have been introduced. It is, however, to note that the waste of bandwidth problem is still existing in those technics, even though there has been significant improvement as to the fairness problem. In this paper we introduce a new solution to remove the waste of bandwidth problem while we are still obtaining the improved fairness of the network. By following this new solution, the simulation result shows higher throughput and lower message delay than previously proposed technics.

  • PDF

An Efficient Broadcasting Channel Assignment Scheme for Mobile VOD Services (모바일 VOD 서비스를 위한 브로드캐스팅 채널할당 기법)

  • Choi, Young
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.5
    • /
    • pp.685-691
    • /
    • 2008
  • Recently with the rapid evolution of the mobile computing and communication technologies, mobile VOD service becomes increasingly important for wireless mobile users. The VOD service is being widely used in various areas of application, such as education, entertainment and business, because it provides users convenience in easily having access to video information at any time in any places. However, in reality, the mobile system has many difficulties in providing the smooth VOD service owing to frequent transfers and cutoffs of clients. The importance of a technique to transmit broadcasting is being stressed as a method for providing stabler mobile VOD service to a large number of clients. This paper is aimed at showing how to reduce demands for server bandwidth and delay of earlier service through performance analysis by suggesting an effective VOD broadcasting transmission technique through channel division in the mobile atmosphere. Many researches have been made about regular broadcasting techniques in particular. This study divides the methods used for assigning channels which have been decided by the size of segments into a group of regular channels and assistant channels using wireless gap-fillers to provide effective VOD services to a large number of clients at the mobile environment using small bandwidth resources. The regular channels transfer regular streams, while assistant channels repeatedly transfer the first segment to reduce early service delay time to receive regular streams. In this way, the study suggests a technique to reduce server bandwidth demand and early service delay time. Through the proposed technique, the server bandwidth demand could be reduced by more than 30 percent and the study continuously shows reduced early service delay time through conducting performance analysis.

  • PDF

Time Slot Assignment Algorithm with Graph Coloring (그래프 채색에 의한 타임 슬롯 할당 알고리즘)

  • Kwon, Bo-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.5
    • /
    • pp.52-60
    • /
    • 2008
  • A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

A Study on Demand Assignment Multiple Access Algorithm based on Seperated Reservation Channel (분리된 예약채널에 의한 요구할당 다중접근방법에 관한 연구)

  • 한정항;송주석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.7
    • /
    • pp.696-708
    • /
    • 1992
  • In this study, we have several objectives. First, In spite of a fixed bandwidth waste of reservation channel, we maximize the efficiency of transmission channel by the multiple access algorithm that performs channel reservation and data transmission independently, eliminating the frame structure of transmission channel and reserving it by the slot unit . Second, In order to improve the entire system performance, we accommodate the variation of traffic at each earth station more effectively, and accomplish the stable delay characteristics and the equlity of service #or users. For this purpose, we design the satellite channel that consists of reservation channel and transmission channel which are logically separate and operate Independently. We also design a demand assignment multiple access algorithm based on the satellite channel structure.

  • PDF

Common Spectrum Assignment for low power Devices for Wireless Audio Microphone (WPAN용 디지털 음향기기 및 통신기기간 스펙트럼 상호운용을 위한 채널 할당기술에 관한 연구)

  • Kim, Seong-Kweon;Cha, Jae-Sang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.724-729
    • /
    • 2008
  • This paper presents the calculation of the required bandwidth of common frequency bandwidth applying queueing theory for maximizing the efficiency of frequency resource of WPAN(Wireless Personal Area Network) based Digital acoustic and communication devices. It assumed that LBT device(ZigBee) and FH devices (DCP, RFID and Bluetooth) coexist in the common frequency band for WPAN based Digital acoustic and communication devices. Frequency hopping (FH) and listen before talk (LBT) have been used for interference avoidance in the short range device (SRD). The LBT system transmits data after searching for usable frequency bandwidth in the radio wave environment. However, the FH system transmits data without searching for usable frequency bandwidth. The queuing theory is employed to model the FH and LBT system, respectively. As a result, the throughput for each channel was analyzed by processing the usage frequency and the interval of service time for each channel statistically. When common frequency bandwidth is shared with SRD using 250mW, it was known that about 35 channels were required at the condition of throughput 84%, which was determined with the input condition of Gaussian distribution implying safety communication. Therefore, the common frequency bandwidth is estimated with multiplying the number of channel by the bandwidth per channel. These methodology will be useful for the efficient usage of frequency bandwidth.

An efficient channel assignment meghod for real-time service in the IEEE 802.11 wireless LAN system (IEEE 802.11 무선 LAN 환경에서 실시간 서비스를 제공하기 위한 채널 구간 할당 방안)

  • 박중신;류시훈;강태원;이준호;이재용;이상배
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.5
    • /
    • pp.1249-1259
    • /
    • 1998
  • This paper proposes an efficient channel assignment method for real-time service in the IEEE 802.11 Wireless LAN system, and analyzes the supportability to real-time service and the channel utilzation of that through computer simulations. The improved MAC(Medium Access Control) protocol employing the proposed channel assignment method achieved good throughput over contention period as well as contention-free period by making real-time terminals transmit the information about their desiring value before starts of data transmissions. For performance evaluation of the proposed method, a simulation analyzing the variation of allocated bandwidths to terminals using real-time service and their buffer sizes wasexecuted. Real-time data traffics was modeled s 7-stae transition VBR sources, and asynchronous data traffics modeled as Poisson processes. In the simulation, the proposed method showed smaller variation of the bandwidth of each terminal and samller buffer size than the existing method, and also recorded good throughput over contention period.

  • PDF