• Title/Summary/Keyword: Loss Allocation

Search Result 247, Processing Time 0.026 seconds

A Performance Analysis of the MAC Protocol Considering the Cell Structures and the QOS in Wireless ATM Networks (무선 ATM 망에서 셀 구조 및 QOS를 고려한 매체 접근 제어 프로토콜의 성능 분석)

  • 안계현;박혁규;이동은;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.8A
    • /
    • pp.1195-1207
    • /
    • 1999
  • Wireless channel has high error rate and limited bandwidth. In order to guarantee the quality of service for multimedia through wireless channel, wireless ATM network requires the cell structure with error control schemes and an efficient medium access control protocol. In this paprt, an efficient medium access control protocol, which is considered of cell structure and the QOS, is proposed for wireless ATM networks. Many kinds of ATM cell structures are analyzed in terms of cell error rate and cell loss rate to choose the proper cell structures for this proposed MAC protocol. And a bandwidth allocation algorithm is also designed to satisfy the priority of services. The performance of proposed MAC protocol are evaluated in terms of channel utilization, call blocking and packet discard probability accotding to different kinds of cell structure through simulation.

  • PDF

Satellite Mobility Pattern Scheme for Centrical and Seamless Handover Management in LEO Satellite Networks

  • Tuysuz, Aysegul;Alagoz, Fatih
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.451-460
    • /
    • 2006
  • Since low earth orbit (LEO) satellite constellations have important advantages over geosynchronous earth orbit (GEO) systems such as low propagation delay, low power requirements, and more efficient spectrum allocation due to frequency reuse between satellites and spotbeams, they are considered to be used to complement the existing terrestrial fixed and wireless networks in the evolving global mobile network. However, one of the major problems with LEO satellites is their higher speed relative to the terrestrial mobile terminals, which move at lower speeds but at more random directions. Therefore, handover management in LEO satellite networks becomes a very challenging task for supporting global mobile communication. Efficient and accurate methods are needed for LEO satellite handovers between the moving footprints. In this paper, we propose a new seamless handover management scheme for LEO satellites (SeaHO-LEO), which utilizes the handover management schemes aiming at decreasing latency, data loss, and handover blocking probability. We also present another interesting handover management model called satellite mobility pattern based handover management in LEO satellites (PatHO-LEO) which takes mobility pattern of both satellites and mobile terminals into account to minimize the handover messaging traffic. This is achieved by the newly introduced billboard manager which is used for location updates of mobile users and satellites. The billboard manager makes the proposed handover model much more flexible and easier than the current solutions, since it is a central server and supports the management of the whole system. To show the performance of the proposed algorithms, we run an extensive set of simulations both for the proposed algorithms and well known handover management methods as a baseline model. The simulation results show that the proposed algorithms are very promising for seamless handover in LEO satellites.

Architecture and Characteristics of Multi-Ring based Optical Network with Single-Hop between Edge Nodes (Edge Node간 단일 홉을 갖는 다중링 기반의 광네트워크 구성 및 특성)

  • Lee, Sang-Hwa;Lee, Heesang;Han, Chimoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.6 s.324
    • /
    • pp.69-78
    • /
    • 2004
  • This paper proposes architecture and characteristics of a multi-ring based optical network with single-hop between edge nodes using the concept of circuit switching and multi-wavelength label switching to solve delay problem caused by applying crossconnectors as transit nodes in the wavelength division multiplexing(WDM) network. We suggest multi-ring based architecture composed single and multiple wavelength-bands with multi-wavelength labels, and analyze characteristics of two models. To avoid the packet collision in output ports of edge nodes due to output contention, the static and dynamic allocation scheme, which packets are allocated in time slots, is provided. Based on our analysis, it shows that delay only occur in not core nodes but edge nodes in the proposed architecture. In addition, we evaluate the probabilities of delay, packet loss, and call blocking in the proposed optical packet network.

Overall Cell Data Rates Analysis for Heterogenous Network Under Adaptive Modulation (이종 네트워크에서 적응변조 사용시 주파수 공유에 따른 데이터 전송률 분석)

  • Kwon, Tae-Hoon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.4
    • /
    • pp.394-400
    • /
    • 2018
  • A heterogenous network is the one of key technologies for 5G, where one cell is divided into small cells in order to extend coverage and support high data rates. Divided cells aggravates the intercell interference problem as the cell edge increases. In order to avoid the intercell interference, it is the best to allocate the different spectrum for each cells. However, it also decreases the spectral efficiency. Therefore, the trade-off between the spectral efficiency gain and the signal quality loss by the interference should be considered for an efficient spectrum sharing in the heterogenous network. The adaptive modulation is the method to change the transmitted bit according to the channel quality, which is adopted as the standard in the most practical communication systems. It should be considered to applied the performance analysis into the practical systems. In this paper, the overall cell data rates is analyzed for the heterogenous network under the adaptive modulation. The Monte Carlo simulation results verify the correctness of the analysis.

Estimating the Economic Burden of Premature Mortality Caused by Cancer in Iran: 2006-2010

  • Karami-Matin, Behzad;Najafi, Farid;Rezaei, Satar;Khosravi, Ardashir;Soofi, Moslem
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.4
    • /
    • pp.2131-2136
    • /
    • 2016
  • Background: Cancer is currently one of the main public health problems all over the world and its economic burden is substantial both for health systems and for society as a whole. To inform priorities for cancer control, we here estimated years of potential life lost (YPLL) and productivity losses due to cancer-related premature mortality in Iran from 2006 to 2010. Materials and Methods: The number of cancer deaths by sex and age groups for top ten leading cancers in Iran were obtained from the Ministry of Health and Medical Education. To estimate the YPLL and the cost of productivity loss due to cancer-related premature mortality, the life expectancy method and the human capital approach were used, respectively. Results: There were 138,228 cancer-related deaths in Iran (without Tehran province) of which 76 % (106,954) were attributable to the top 10 ranked cancers. Some 63 % of total cancer-related deaths were of males. The top 10 ranked cancers resulted in 106,766,942 YPLL in total, 64,171,529 (60 %) in males and 42,595,412 (40%) in females. The estimated YPPLL due to top 10 ranked cancers was 58,581,737 during the period studied of which 32,214,524 (54%) was accounted for in males. The total cost of lost productivity caused by premature deaths because of top 10 cancers was 1.68 billion dollars (US$) from 2006 to 2010, ranging from 251 million dollars in 2006 to 283 million dollars in 2010. Conclusions: This study showed that the economic burden of premature mortality attributable to cancer is significant for Iranian society. The findings provide useful information about the economic impact of cancer for health system policy/decision makers and should facilitate planning of preventive intervention and effective resource allocation.

Networked Airborne Relay-Based Positioning Scheme and Performance Enhancement Study Based on TDMA Networks (시분할다중접속 네트워크 기반의 공중 중계 기반 융합 측위 기법 및 성능 향상 연구)

  • Lee, Kyuman;Noh, Hongjun;Park, Hyungwon;Lim, Jaesung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1824-1833
    • /
    • 2016
  • In this paper, we propose networked airborne relay-based positioning scheme (N-ARPS) based on time division multiple access (TDMA) networks to improve the performance of relative navigation (RelNav). To integrate the ARPS into TDMA, there are three problems such as slot allocation, selection of airborne relays, and method for signal loss to be solved. A subframe of N-ARPS is designed to assign the slots for broadcast and relay of navigation signals consecutively to minimize the effect of mobility. The selection algorithm determines the optimum set of airborne relays by selecting evenly distributed nodes depending on their distances to the master station. Finally, we uses precise position location information (PPLI) messages, which are received in data transmission period, to estimate a user position when the navigation signals are missing. The simulation results indicate that N-ARPS significantly improves user accuracy over RelNav.

Direction Prediction Based Resource Reservation in Mobile Communication Networks for Telematics (텔레매틱스를 위한 이동통신망에서 이동 방향 추정에 근거한 자원 예약)

  • Lee, Jong-Chan;Park, Ki-Hong;Lee, Yang-Weon
    • Journal of Internet Computing and Services
    • /
    • v.8 no.1
    • /
    • pp.1-14
    • /
    • 2007
  • IF handoff events are occurred during the transmission of multimedia traffic, the efficient resource allocation and handoff procedures are necessary to maintain the same QoS of transmitted multimedia traffic because the QoS may be defected by some delay and information loss, This paper proposes a handoff scheme to accommodate multimedia traffic based on the resource reservation procedure using direction estimation, This scheme uses a novel mobile tracking method based on Fuzzy Multi Criteria Decision Making, in which uncertain parameters such as PSS (Pilot Signal Strength), the distance between the mobile and the base station, the moving direction, and the previous location are used in the decision process using the aggregation function in fuzzy set theory, With the position information, the moving direction is determined, The handoff requests for real time sessions are handled based on the direction prediction and the resource reservation scheme, The resources in the estimated adjacent cells should be reserved and allocated to guarantee the continuity of the real time sessions, Through simulation results, we show that our proposed resource reservation method provides a better performance than that of the conventional method.

  • PDF

Radio Resource Management of CoMP System in HetNet under Power and Backhaul Constraints

  • Yu, Jia;Wu, Shaohua;Lin, Xiaodong;Zhang, Qinyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3876-3895
    • /
    • 2014
  • Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

Packet Delay and Loss Analysis of Traffic with Delay Priority in a DBA Scheme of an EPON (EPON의 DBA방안에서 지연 우선순위를 갖는 트래픽의 재킷 손실률과 지연 성능 분석)

  • Park Chul-Geun;Shim Se-Yong;Jung Ho-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8B
    • /
    • pp.507-513
    • /
    • 2005
  • As the rapid increasement of the number of internet users has occured recently, many multimedia application services have been emerging. To improve quality of service, traffic can be suggested to be classified with priority in EPON(Ethernet Passive Optical Network), which is supporting the multimedia application services. In this paper, multimedia application services treat bandwidth classifying device in serving both delay sensitive traffic for real-time audio, video and voice data such as Von(Voice over Internet Protocol), and for real-time traffic such as BE(Best Effort). With looking through existing mechanisms, new mechanism to improve the quality will be suggested. The delay performances and packet losses of traffic achieved by supporting bandwidth allocation of upstream traffic in suggested mechanism will be analized with simulations.

Design the Time-Interval Based Fairness Partitioning Method in DVE (DVE에서 시간 기반 균등 부하 분산 방식 설계)

  • Won, Dong-Kee;An, Dong-Un;Chung, Seung-Jong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.1
    • /
    • pp.48-54
    • /
    • 2008
  • MMORPGs may involve a great number of concurrent players, and those servers usually have to manage hundred, or even thousands of avatars co-existing in the same virtual world. So if failing to send a command or an event message, or sending it too late may cause damages to the avatar evolution(death, injury, loss of resources), and may result in unjustified penalties for the player. Many policies could be defined to realize a ranking evaluation of available servers. Unfortunately, due to the highly dynamic characteristics of server loads and network performances, any optimal allocation would soon become sub-optimal. In order to solve those problems we propose the "time-interval based fairness partitioning method"(TIP). TIP will distribute the avatar to the game server equally with time-interval in order to avoid the problems form the unfairness of game servers load.