• Title/Summary/Keyword: Distributed resource allocation

Search Result 113, Processing Time 0.024 seconds

A Channel Assignment Technique for OFDMA-based Wireless Mesh Network with Different Time Delays (서로 다른 지연 시간을 갖는 OFDMA 기반 Wireless Mesh Network에서의 채널 할당 기법)

  • Yoo, Hyun-Il;Park, Chang-Hwan;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6A
    • /
    • pp.568-576
    • /
    • 2011
  • In this paper, a channel assignment technique to mitigate interferences due to ISI(Inter Symbol Interference) and ICI(Inter Carrier Interference) caused by TDoA(Time Difference of Arrival) among distributed MRs(Mesh Routers) in OFDMA(Orthogonal Frequency Division Multiple Access)-based WMN(Wireless Mesh Network) is proposed. The SINR(Signal to Interference and Noise Ratio) associated with the channel assignment for each MR is defined to minimize the effect of ISI and ICI due to TDoA in WMN, which is then used to propose an channel assignment technique considering fairness constraint. It is verified by computer simulation that the proposed channel assignment technique can improve the performance of BER(Bit Error Rate) in WMNs with compared to the conventional technique.

Dynamic Threshold-Based Multicast Scheme for N-Screen Services in Indoor and Ship Area Networks (선박 및 실내 N-스크린 서비스를 위한 동적 Threshold 기반 멀티캐스트 기술)

  • Hur, Kyeong;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1369-1376
    • /
    • 2015
  • A wireless bridge is essential to transmit control and managing information to sensors or instruments from a central integrated ship area network station. In this paper, a WiMedia Distributed-MAC(D-MAC) protocol is adopted for development of a seamless N-Screen wireless service in Indoor and Ship Area Networks. Furthermore, to provide the OSMU(One Source Multi Use) N-screen service through P2P streaming in the seamless D-MAC protocol, a Dynamic Threshold-based Multicast(DTM) technology is proposed and analyzed. For this technology, a new Hard/Soft Vertical Region(HVR-SVR) based time slot allocation and a multicast resource reservation scheme are combined. From simulation results, proposed DTM scheme expands the number of time slots available for unicast and multicast realtime N-Screen reservations with various service time interval requests. Furthermore, it enhances performances in vewpoints of realtime N-Screen data reservation conflict and throughput.

Asynchronous Traffic Multi-Hop Transmission Scheme for N-Screen Services in Indoor and Ship Area Networks (선박 및 실내 N-스크린 서비스를 위한 비동기 트래픽 멀티홉 전송 기술)

  • Hur, Kyeong;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.5
    • /
    • pp.950-956
    • /
    • 2015
  • In this paper, a WiMedia Distributed-MAC (D-MAC) protocol is adopted for development of a seamless N-screen wireless service in Indoor and Ship Area Networks. Furthermore, to provide the OSMU (One Source Multi Use) N-screen service through P2P streaming in the seamless D-MAC protocol, a ATMT (Asynchronous Traffic Multi-hop Transmission) technology is proposed and analyzed. In this system, a WiMedia ATMT D-MAC bridge transmits control and managing information to various sensors and instruments, from a central integrated ship area network station. For this technology, a time slot allocation scheme for WiMedia asynchronous traffic and a multi-hop resource reservation scheme are combined to evaluate the performance of each scheme. From simulation results, the proposed ATMT scheme enhances performances in viewpoints of N-screen asynchronous data latency and throughput, compared to the conventional WiMedia D-MAC system.

A Multi-hop Relaying Transmission Scheme in Cognitive Radio System (Cognitive Radio 시스템 환경에서의 다중 홉 릴레이 전송 기법)

  • Lee, Dong-Kyu;Shin, Jung-Chae;Lim, Eun-Taek;Lee, Hyun-Woo;Cho, Ho-Shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9A
    • /
    • pp.853-866
    • /
    • 2008
  • In this paper, a multi-hop relaying transmission scheme is analyzed regarding its feasibility and potentiality in the IEEE 802.22-based cognitive radio (CR) environment. Shortly, basic design issues are addressed such as relay station (RS) deployment and a frame structure of physical channel to escape inter-hop interference. This paper mainly develops a radio resource management scheme based on spectrum sensing results aggregated from CR secondary nodes and improves the opportunistic spectrum sharing efficiency. In particular, a decision rule about a channel availability is made using a distributed sensing method. Subsequently, spectrum allocation and routing path decision procedures are proposed to establish a link from source to destination with a hop-by-hop manner. Simulation results show that the proposed multi-hop relaying scheme is substantially profitable in CR environments if the number of hops and RS deployment are designed in such a way that the spectrum sharing gain is larger than spectrum division loss which is inherently induced in multi-hop relaying systems.

A Multiple-Way Partitioning of a Network When the Cost of the Net Which Connects K Subsets is K(K-1)/2 (K개의 집합에 연결이 있는 네트에 K(K-1)/2의 비용을 주는 경우의 네트워크의 다중 분할)

  • Jang, Woo-Choul;Kim, In-Ki;Kim, Kyung-Sik
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.11
    • /
    • pp.20-26
    • /
    • 1994
  • In this paper, we propose an algorithm on partitioning a network into several subsets where the cost of a net which connects nodes in k subsets is given as k(k-1)/2 indicating the typical pattern of complete graphs. This problem is one of generalizations for multiple-way partitioning proposed by Sanchis. $^{[5]}$ Its solution can be applied to resource allocation problem in distributed systems. The proposed algorithm expanded the algorithm of Fiduccia and Mattheyses$^{[3]}$ to handle the multiple-way partitioning simultaneously. It has time and space complexity linear to the size of the network. To evaluate the performance of the proposed algorithm, we implemented also a traditional cluster growth method which groups connected nodes for nets, and compared experimental results with those of the proposed algorithm. The proposed algorithm shows some enhancement made.

  • PDF

Local Government Fiscal Consolidation Measures-Focusing on Cheonan- (지방정부 재정건전화 방안-천안시를 중심으로-)

  • Park, Jong Gwan
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.10
    • /
    • pp.112-123
    • /
    • 2014
  • This Study aims to establish better sound fiscal plan by investigating perception of local government officials. Local government fiscal consolidation is affected by a combination of factors, including social, economic, demographic, political financial health of local governments. We derived the financial situation of the government-related indicators, financial health-related indicators, the indicators to improve the financial health on the basis of this study are an existing discussion. To ensure the financial soundness of the Cheonan, it is necessary to increase the efficiency of financial management including financial monitoring and control devices provided the locals, investment screening analysis system to enable it. In addition, fiscal controls should be strengthened in order to effectively autonomous government debt management. You must cuts expense of local government to prepare for expansion of local government finance, it is necessary to realize that the fee rates. It should be made through a blend of autonomy and control in the central government, network of local government and the development of local financial operations. You should also to be distributed to the residents welfare and community development funds are invested substantially to establish a systematic planning, resource allocation, evaluation, and reflux system.

Enabling Performance Intelligence for Application Adaptation in the Future Internet

  • Calyam, Prasad;Sridharan, Munkundan;Xu, Yingxiao;Zhu, Kunpeng;Berryman, Alex;Patali, Rohit;Venkataraman, Aishwarya
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.591-601
    • /
    • 2011
  • Today's Internet which provides communication channels with best-effort end-to-end performance is rapidly evolving into an autonomic global computing platform. Achieving autonomicity in the Future Internet will require a performance architecture that (a) allows users to request and own 'slices' of geographically-distributed host and network resources, (b) measures and monitors end-to-end host and network status, (c) enables analysis of the measurements within expert systems, and (d) provides performance intelligence in a timely manner for application adaptations to improve performance and scalability. We describe the requirements and design of one such "Future Internet performance architecture" (FIPA), and present our reference implementation of FIPA called 'OnTimeMeasure.' OnTimeMeasure comprises of several measurement-related services that can interact with each other and with existing measurement frameworks to enable performance intelligence. We also explain our OnTimeMeasure deployment in the global environment for network innovations (GENI) infrastructure collaborative research initiative to build a sliceable Future Internet. Further, we present an applicationad-aptation case study in GENI that uses OnTimeMeasure-enabled performance intelligence in the context of dynamic resource allocation within thin-client based virtual desktop clouds. We show how a virtual desktop cloud provider in the Future Internet can use the performance intelligence to increase cloud scalability, while simultaneously delivering satisfactory user quality-of-experience.

Method of Location Decision far a Transfer Center Distributing a Necessary Resource Item while Considering Characteristics of the Material in Wartime (전시 군수물자의 효율적 분배와 수송을 위한 TC 위치선정 방법론 연구)

  • Jung, Byung-Ho;Kim, Ik-Ki
    • Journal of the military operations research society of Korea
    • /
    • v.35 no.2
    • /
    • pp.1-14
    • /
    • 2009
  • During wartime, the Air Force have to plan where, and how much, and what need to be distributed to surrounding local area from a chosen central bases. Each base, which has surplus more than needed amount of a certain material collected from near area of the base, is expected to distribute such surplus to other bases in shortage of it. By sending such surplus to other bases in shortage of the material, every base may get sufficient amount of all kinds of materials needed for each base during wartime. Because number of items of materials needed in each military bases during wartime are usually quite large and the frequencies of delivery from a place to other place are also pretty large if each item is delivered from a surplus place to other places in shortage, the Head Quarter of Air Force or the Logistics Command will face to difficulty to decide a reasonable delivery plan between bases for efficient and fast allocation of all materials needed to all bases during wartime. Therefore, this study suggests a solving algorithm with an established TC (transfer center: collecting and distributing center for all materials) to solve such a distribution and transportation problem.

Active Distribution System Planning for Low-carbon Objective using Cuckoo Search Algorithm

  • Zeng, Bo;Zhang, Jianhua;Zhang, Yuying;Yang, Xu;Dong, Jun;Liu, Wenxia
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.2
    • /
    • pp.433-440
    • /
    • 2014
  • In this study, a method for the low-carbon active distribution system (ADS) planning is proposed. It takes into account the impacts of both network capacity and demand correlation to the renewable energy accommodation, and incorporates demand response (DR) as an available resource in the ADS planning. The problem is formulated as a mixed integer nonlinear programming model, whereby the optimal allocation of renewable energy sources and the design of DR contract (i.e. payment incentives and default penalties) are determined simultaneously, in order to achieve the minimization of total cost and $CO_2$ emissions subjected to the system constraints. The uncertainties that involved are also considered by using the scenario synthesis method with the improved Taguchi's orthogonal array testing for reducing information redundancy. A novel cuckoo search (CS) is applied for the planning optimization. The case study results confirm the effectiveness and superiority of the proposed method.

A Stochastic Study for the Emergency Treatment of Carbon Monoxide Poisoning in Korea (일산화탄소중독(一酸化炭素中毒)의 진료대책(診療對策) 수립(樹立)을 위한 추계학적(推計學的) 연구(硏究))

  • Kim, Yong-Ik;Yun, Dork-Ro;Shin, Young-Soo
    • Journal of Preventive Medicine and Public Health
    • /
    • v.16 no.1
    • /
    • pp.135-152
    • /
    • 1983
  • Emergency medical service is an important part of the health care delivery system, and the optimal allocation of resources and their efficient utilization are essentially demanded. Since these conditions are the prerequisite to prompt treatment which, in turn, will be crucial for life saving and in reducing the undesirable sequelae of the event. This study, taking the hyperbaric chamber for carbon monoxide poisoning as an example, is to develop a stochastic approach for solving the problems of optimal allocation of such emergency medical facility in Korea. The hyperbaric chamber, in Korea, is used almost exclusively for the treatment of acute carbon monoxide poisoning, most of which occur at home, since the coal briquette is used as domestic fuel by 69.6 per cent of the Korean population. The annual incidence rate of the comatous and fatal carbon monoxide poisoning is estimated at 45.5 per 10,000 of coal briquette-using population. It offers a serious public health problem and occupies a large portion of the emergency outpatients, especially in the winter season. The requirement of hyperbaric chambers can be calculated by setting the level of the annual queueing rate, which is here defined as the proportion of the annual number of the queued patients among the annual number of the total patients. The rate is determined by the size of the coal briquette-using population which generate a certain number of carbon monoxide poisoning patients in terms of the annual incidence rate, and the number of hyperbaric chambers per hospital to which the patients are sent, assuming that there is no referral of the patients among hospitals. The queueing occurs due to the conflicting events of the 'arrival' of the patients and the 'service' of the hyperbaric chambers. Here, we can assume that the length of the service time of hyperbaric chambers is fixed at sixty minutes, and the service discipline is based on 'first come, first served'. The arrival pattern of the carbon monoxide poisoning is relatively unique, because it usually occurs while the people are in bed. Diurnal variation of the carbon monoxide poisoning can hardly be formulated mathematically, so empirical cumulative distribution of the probability of the hourly arrival of the patients was used for Monte Carlo simulation to calculate the probability of queueing by the number of the patients per day, for the cases of one, two or three hyperbaric chambers assumed to be available per hospital. Incidence of the carbon monoxide poisoning also has strong seasonal variation, because of the four distinctive seasons in Korea. So the number of the patients per day could not be assumed to be distributed according to the Poisson distribution. Testing the fitness of various distributions of rare event, it turned out to be that the daily distribution of the carbon monoxide poisoning fits well to the Polya-Eggenberger distribution. With this model, we could forecast the number of the poisonings per day by the size of the coal-briquette using population. By combining the probability of queueing by the number of patients per day, and the probability of the number of patients per day in a year, we can estimate the number of the queued patients and the number of the patients in a year by the number of hyperbaric chamber per hospital and by the size of coal briquette-using population. Setting 5 per cent as the annual queueing rate, the required number of hyperbaric chambers was calculated for each province and for the whole country, in the cases of 25, 50, 75 and 100 per cent of the treatment rate which stand for the rate of the patients treated by hyperbaric chamber among the patients who are to be treated. Findings of the study were as follows. 1. Probability of the number of patients per day follows Polya-Eggenberger distribution. $$P(X=\gamma)=\frac{\Pi\limits_{k=1}^\gamma[m+(K-1)\times10.86]}{\gamma!}\times11.86^{-{(\frac{m}{10.86}+\gamma)}}$$ when$${\gamma}=1,2,...,n$$$$P(X=0)=11.86^{-(m/10.86)}$$ when $${\gamma}=0$$ Hourly arrival pattern of the patients turned out to be bimodal, the large peak was observed in $7 : 00{\sim}8 : 00$ a.m., and the small peak in $11 : 00{\sim}12 : 00$ p.m. 2. In the cases of only one or two hyperbaric chambers installed per hospital, the annual queueing rate will be at the level of more than 5 per cent. Only in case of three chambers, however, the rate will reach 5 per cent when the average number of the patients per day is 0.481. 3. According to the results above, a hospital equipped with three hyperbaric chambers will be able to serve 166,485, 83,242, 55,495 and 41,620 of population, when the treatmet rate are 25, 50, 75 and 100 per cent. 4. The required number of hyperbaric chambers are estimated at 483, 963, 1,441 and 1,923 when the treatment rate are taken as 25, 50, 75 and 100 per cent. Therefore, the shortage are respectively turned out to be 312, 791. 1,270 and 1,752. The author believes that the methodology developed in this study will also be applicable to the problems of resource allocation for the other kinds of the emergency medical facilities.

  • PDF