• 전자공학회논문지A
• /
• 제32A권2호
• /
• pp.11-18
• /
• 1995

Error detection in ARQ(Automatic Repeat Request) protocols is very important in wireless data communication systems. The throughput efficiency of ARQ protocols can be improved by dynamically adapting the protocol packet length so that it approaches the optimum value for throuhput efficiency. In this paper, a simple and novel adaptive packet length allocation method is proposed which transmits the packets with variable length by dyanmically estimating the channel codition. The simulation results show that the average of throughput is improved by 315.4% in the stop-and-wait protocol, 41.4% in the go-back-N protocol and 155.9% in the selective repeat protocol respectively. And the throughput performances of adaptive packet length allocation method approximately approach the theoritically optimal throughput performances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2047-2066
• /
• 2016

In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.

• International Journal of Computer Science & Network Security
• /
• 제21권12호
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

• ETRI Journal
• /
• 제34권6호
• /
• pp.922-931
• /
• 2012

With the increasing demands for mobile wireless sensor networks in recent years, designing an energy-efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near-optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near-optimal energy-efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy-efficient routing technique produces a longer network lifetime and achieves better energy efficiency.

• 한국멀티미디어학회논문지
• /
• 제17권4호
• /
• pp.458-465
• /
• 2014

In this paper, we propose a strategy to distribute the energy consumption over the network. The proposed strategy is based on geographic routing. We use a smart base station that maintains the residual energy and location information of sensor nodes and selects a head node and an anchor node using this information. A head node gathers and aggregates data from the sensor nodes in a target region that interests the user. An anchor node then transmits the data that was forwarded from the head node back to the smart base station. The smart base station extends network lifetime by selecting an optimal head node and an optimal anchor node. We simulate the proposed protocol and compare it with the LEACH protocol in terms of energy consumption, the number of dead nodes, and a distribution map of dead node locations.

• 한국통신학회논문지
• /
• 제19권9호
• /
• pp.1641-1647
• /
• 1994

본 논문에서는 고속통신망에 적합한 통신 프로토콜을 설계하고 그 성능을 분석하였다. 제안된 프로토콜은 ATM 전송방식을 기본으로 하고, 분산큐 방식 및 동적대역폭 할당구조를 사용하여 고속의 전송속도 및 다양한 서비스 지원이 가능하다. 다양한 통신망 환경에 따른 성능분석과 컴퓨터 시뮬레이션 결과를 고찰하여 제안된 구조의 우수성을 입증하였다.

• ETRI Journal
• /
• 제33권3호
• /
• pp.458-461
• /
• 2011

With the introduction of the new generation RFID technology, EPCglobal Class-1 Generation-2, there is considerable interest in improving the performance of the framed slotted Aloha (FSA)-based tag collision arbitration protocol. We suggest a novel time-optimal anti-collision algorithm for the FSA protocol. Our performance evaluation demonstrates that our algorithm outperforms other tag collision arbitration schemes.

• 대한방사선기술학회지:방사선기술과학
• /
• 제42권4호
• /
• pp.279-284
• /
• 2019

The purpose of this study was to find the best protocol for balance of image quality and dose in brain CT scan. Images were acquired using dual-source CT and AAPM water phantom, noise and dose were measured, and effective dose was calculated using computer simulation program ALARA(S/W). In order to determine the ratio of image quality and dose by each protocol, FOM (figure of merits) equation with normalized DLP was presented and the result was calculated. judged that the ratio of image quality and dose was excellent when the FOM maximized. Experimental results showed that protocol No. 21(120 kVp, 10 mm, 1.5 pitch) was the best, the organ with the highest effective dose was the brain(33.61 mGy). Among organs with high radiosensitivity, the thyroid gland was 0.78 mGy and breast 0.05 mGy. In conclusion, the optimal parameters and the organ dose in the protocol were also presented from the experiment, It may be helpful to clinicians who want to know the protocol about the optimum state of image quality and dose.

• International Journal of Computer Science & Network Security
• /
• 제22권2호
• /
• pp.209-213
• /
• 2022

Key exchange protocol (KEP) is an essential setup to secure authenticates transmission among two or more users in cyberspace. Digital files protected and transmitted by the encryption of the files over public channels, a single key communal concerning the channel parties and utilized for both to encrypt the files as well as decrypt the files. If entirely done, this impedes unauthorized third parties from imposing a key optimal on the authorized parties. In this article, we have suggested a new KEP term as isokey interchange protocol based on generalization of modern mathematics term as isomathematics by utilizing isonumbers for corresponding isounits over the Block Upper Triangular Isomatrices (BUTI) which is secure, feasible and extensible. We also were utilizing arithmetic operations like Isoaddition, isosubtraction, isomultiplication and isodivision from isomathematics to build iso-key interchange protocol for network communication. The execution of our protocol is for two isointegers corresponding two elements of the group of isomatrices and cryptographic performance of products eachother. We demonstrate the protection of suggested isokey interchange protocol against Brute force attacks, Menezes et al. algorithm and Climent et al. algorithm.

• 자원ㆍ환경경제연구
• /
• 제26권1호
• /
• pp.85-101
• /
• 2017

나고야의정서 또는 ABS의 목적은 생물유전자원의 이용에 따르는 대가를 실현시킴으로써 생물다양성을 유지하는데 있으나 아직까지 구체적으로 실현된 사례가 드물다. 이는 이익공유 방식을 둘러싼 논란과 생물유전자원 보유국과 이용국 또는 이용기업간의 정보 비대칭이 존재하기 때문이다. 본고에서는 주인-대리인 모형을 이용하여 정보 불확실성 하에서의 이익공유 방식을 분석하였다. 고정지출계약과 매출액 기준 로열티 방식 중 후자의 방식이 생물유전자원의 가치증대와 자원보전 측면에 우수한 인센티브 계약인 것으로 나타났다. 이는 향후 나고야의 정서 하에서 로열티 중심으로 상호협정조건 가이드라인이 마련될 필요가 있음을 시사한다.