• Journal of KIISE
• /
• v.42 no.4
• /
• pp.530-540
• /
• 2015

Industrial WSNs need great performance and reliable communication. In industrial WSNs, cluster structure reduces the cost to form a network, and the reservation-based MAC is a more powerful and reliable protocol than the contention-based MAC. Depth-based TDMA assigns time slots to each sensor node in a cluster-based network and it works in a distributed manner. DB-TDMA is a type of depth-based TDMA and guarantees scalability and energy efficiency. However, it cannot allocate time slots in parallel and cannot perfectly avoid a collision because each node does not know the total network information. In this paper, we suggest an improved distributed algorithm to reduce the end-to-end delay of DB-TDMA, and the proposed algorithm is compared with DRAND and DB-TDMA.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.608-610
• /
• 2003

Ethernet PON(Passive Optical Network)에서 핵심 기술 중의 하나인 MAC(Media Access Control) 프로토콜은 ONU(Optical Network틴nit)들이 상향으로 트래픽을 전송할 때 공유되어 있는 링크상의 충돌을 방지하고, 효율적인 대역폭을 할당하기 위한 스케줄링 알고리즘을 포함하고 있다. 본 논문에서는 차세대 가입자 망인 Ethernet PON에서 상향으로의 대역폭 부족을 개선하기 위하여, n개의 파장을 사용한 가변 슬롯 할당 TDMA(Time Division Multiple Access) 방식의 MAC 프로토콜을 제안한다. 이를 검증하기 위하여 OPNET 시뮬레이션 도구를 이용해 Ethernet PON 모델을 설계하고 시뮬레이션 한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.57-62
• /
• 2017

Recently, the use of electronic control units in vehicle has increased. The ECUs are connected to in vehicle networks to process a large amount of information. In this paper, for an actuator that is interconnected to CAN and FlexRay, a FlexRay-CAN gateway is presented and a data packing algorithm with a bisection method of a FlexRay slot is proposed. And, a network based actuator control system and packing map is implemented. With the proposed packing method, contact force sensor data are transferred within the maximum allowed delay to ensure the stability. The proposed method is useful for control of distributed system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1252-1260
• /
• 1999

The HFC network has a architecture of a star topology in fiber optic trunks, and tree and branch topology is used in the part of coaxial cable. It is well known that the HFC upstream channel is noisy. Ingress, common mode distortion and impulse noise exist in the upstream channel. In order to provide Quality of Service(QoS) to users with real-time data such as voice, video and interactive services, the evolving IEEE 802.14 standard for HFC networks must include an effective priority scheme. The scheme separates and resolves collisions between stations in a priority order. It is important to simulate protocols under a practical environment. The proposed algorithm in this paper is simulated with the assumption that the collision detector made certain mistake due to noises. Simulation results show that the proposed algorithm is more efficient than existing tree-based algorithm under practical environment.

• Proceedings of the Safety Management and Science Conference
• /
• 2002.05a
• /
• pp.73-80
• /
• 2002

본 연구는 U자형 생산라인(U라인)에서의 라인밸런싱 문제를 해결하기 위한 유전알고리즘을 제시한다. U라인에서는 사이클 타임 내에 제품이 들어가는 방향과 나오는 방향의 작업을 한 작업자가 수행 할 수 있어서, 재공품 수량을 일정하게 유지한다거나 작업부하를 평활화 하는 등의 라인관리가 기존 직선라인에 비해 용이하다. U라인은 JIT(Just-ln-Time)생산 시스템에서 흔히 볼 수 있다. 본 연구는 U라인에서 사이클 타임이 고정되었을 때 작업장 또는 작업자의 수를 최소로 하면서 동시에 작업장에 할당된 작업들 간의 관련성을 최대화하는 라인밸런싱 문제를 다루었다. 라인밸런싱에 관한 기존 연구는 대부분 직선라인에 관한 것으로 U라인의 장점을 충분히 활용하지 못한다. 특히, 라인의 작업장의 수를 최소화하는 문제는 많은 대안해가 있음에도 불구하고, 작업관련성을 고려하여 해를 구하는 기법에 관한 연구는 아직 미미한 실정이다. 실제 조립라인에서는 가능한 한 관련된 작업들을 동일한 작업자에 할당하는 것이 바람직하며, 이러한 작업편성은 작업자의 작업능률을 향상시킬 수 있다. 유전알고리즘은 자연계의 적자생존과 생물학적 진화과정을 모방한 탐색기법으로 조합최적화 문제에 효과적인 기법으로 널리 알려져 있다. 본 연구는 유전알고리즘을 이용하여 U라인에서 작업관련성을 고려한 라인밸런싱 문제를 해결하기 위한 기법을 개발하였다. 문제의 목적에 적합한 개체의 평가함수가 제시되었으며, 개체의 형질을 효과적으로 자손에 유전할 수 있고 유전 연산이 용이한 개체의 표현방법과 개체의 해석방법이 제시되었다. 컴퓨터 실험을 통하여 개발한 알고리즘의 성능을 보였다.월 초순부터 중순에 각각 최고 성기를 나타내었다. H. papariensis의 암컷과 수컷의 발광양상을 분석하고자 정지발광과 구애 발광을 구분하여 조사하였고 각각의 발광지속시간과 발광주기를 구분하여 측정하였다. 수컷의 발광지속시간은 정지발광(0.12초)보다 구애발광(0.17초)에서 1.4배 증가하였으며 암컷의 발광지속시간은 정지발광(0.15초)보다 구애발광(0.19초)에서 1.5배 증가하였다. 발광주기는 수컷에서 정지발광(1.26초)보다 구애발광(1.12초)에서 0.88배 감소하였고, 암컷에서 정지발광(2.99초)보다 구애발광(1.06초)에서 0.35배 감소하였다. 발광양상에서 발광주파수는 수짓의 정지발광에서 0.8 Hz, 수컷 구애발광에서 0.9 Hz, 암컷의 정지발광에서 0.3 Hz, 암컷의 구애발광에서 0.9 Hz로 각각 나타났다. H. papariensis의 발광파장영역은 400 nm에서 700 nm에 이르는 모든 영역에서 확인되었으며 가장 높은 첨두치는 600 nm에 있고 500에서 600 nm 사이의 파장대가 가장 두드러지게 나타났다. 발광양상과 어우러진 교미행동은 Hp system과 같은 결과를 얻었다.하는 방법을 제안한다. 즉 채널 액세스 확률을 각 슬롯에서 예약상태에 있는 음성 단말의 수뿐만 아니라 각 슬롯에서 예약을 하려고 하는 단말의 수에 기초하여 산출하는 방법을 제안하고 이의 성능을 분석하였다. 시뮬레이션에 의해 새로 제안된 채널 허용 확률을 산출하는 방식의 성능을 비교한 결과 기존에 제안된 방법들보다 상당한 성능의 향상을 볼 수 있었다., 인삼이 성장될 때 부분적인 영양상태의 불충분이나 기후 등에 따른 영향을

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.717-724
• /
• 2005

In this paper, we Propose an efficient scheduler well suited for the next-generation wireless networks that can support multimedia traffic having various requirements. The scheduler is designed to provide each of multimedia classes with differentiated services. In particular, the scheduler is intended to maximize throughput and minimize packet loss ratio. To apply the scheduler, we suppose that the wireless network is based on TDD/CDMA system The scheduler assigns a packet in a dedicated uplink-slot to the user within a frame to operate scheduling of packets transmitted by the users belonging to the specific class in an efficient manner. Such a manner also enables the scheduler to meet different QoS requirements. The paper also includes performance comparison with other schemes and analysis of the proposed scheduling algorithm by using simulation. We also analyze the proposed scheme by using simulation. The simulation compares the proposed scheduling algerian with previously proposed schemes in terms of the performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2191-2204
• /
• 1997

An efficient packet transmit scheduling algorithm should be able to allocate the resource to each connection fairly based on the bandwidth and quality of service requirements negotiated during the call admission procedure and it should be able to isolate the effects of users that are behaving badly. In this paper, we propose an effective round-robin packet transmit scheduling mechanism, which we call the delay tolerant packet reserving scheme (DTPRS) based on delay QoS requirments. The proposed scheme can not only provide fairness and but also reduce delay, delay variation, and packet loss rate by reserving output link time slots of delay tolerant packets and assigning the reserved slotsto delay urgent packets. Our scheme is applicable to high speed networks including ATM network because it only requires O(1) work to process a packet, and is simple enough to implement.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.370-376
• /
• 2020

In this study, we consider a group-based random access method for group connection and delivery by grouping devices when H2H devices and large-scale M2M devices coexist in a cell in NB-IoT environment. H2H devices perform individual random access, but M2M devices are grouped according to a NPRACH transmission period, and a leader of each group performs random access. The preamble is allocated using the variable preamble allocation algorithm of the Disjoint Allocation(DA) method. The proposed preamble allocation algorithm is an algorithm that preferentially allocates preambles that maximizes throughput of H2H to H2H devices and allocates the rest to M2M devices. The access distribution of H2H and M2M devices was set as Poisson distribution and Beta distribution, respectively, and throughput, collision probability and resource utilization were analyzed. As the random access transmission slot is repeated, the proposed preamble allocation algorithm decreases the collision probability from 0.93 to 0.83 and 0.79 when the number M2M device groups are 150. In addition, it was found that the amount of increase decreased to 33.7[%], 44.9[%], and 48.6[%] of resource used.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.692-700
• /
• 2012

The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC) protocol based on UWB for high speed wireless home networks and Wireless USB. In this paper, firstly, the fair SoQ-based Distributed Reservation Protocol (DRP) for D-MAC is analyzed. And a novel SoQ-based relay transmission protocol is proposed to overcome DRP conflicts fast. In the proposed protocol, each device executes the Satisfaction of QoS (SoQ) time slot allocation algorithm independently. And, in order to give the loser device due to DRP conflicts another chance to maintain QoS resources, the proposed relay transmission protocol helps the device reserve another indirect link maintaining the required QoS resources via a relay node.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.323-335
• /
• 2015

Mobile healthcare is a fusion of information technology and biotechnology and is a new type of health management service to keep people's health at anytime and anywhere without regard to time and space. The WBAN(Wireless Body Area Network) technology that collects bio signals and the data analysis and monitoring technology using mobile devices are essential for serving mobile healthcare. WBAN consisting of users with mobile devices meet another WBAN during movement, WBANs transmit data to the other media. Because of WBAN conflict, several nodes transmit data in same time slot so a collision will occur, resulting in the data transmission being failed and need more energy for re-transmission. In this thesis, we proposed a MAC protocol for WBAN with mobility to solve these problems. First, we proposed a superframe structure for WBAN. The proposed superframe consists of a TDMA(Time Division Muliple Access) based contention access phase with which a node can transmit data in its own time slot and a contention phase using CSMA/CA algorithm. Second, we proposed a network merging algorithm for conflicting WBAN based on the proposed MAC protocol. When a WBAN with mobility conflicts with other WBAN, data frame collision is reduced through network reestablishment. Simulations are performed using a Castalia based on the OMNeT++ network simulation framework to estimate the performance of the proposed superframe and algorithms. We estimated the performance of WBAN based on the proposed MAC protocol by comparing the performance of the WBAN based on IEEE 802.15.6. Performance evaluation results show that the packet transmission success rate and energy efficiency are improved by reducing the probability of collision using the proposed MAC protocol.