• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2A
• /
• pp.153-164
• /
• 2010

In this paper, we propose a multi-channel MAC protocol to improve the channel efficiency and network performance in wireless ad hoc networks. There are two main problems encountered in designing multi-channel MAC protocols. The first problem is the rendezvous problem and the second is multi-channel hidden node problem. In order to solve these problems, most of previous researches that have considered multi-channel MAC protocols use a common control channel to exchange control packets. However, they have a bottleneck problem at common control channel as increasing the number of data channels. The proposed MAC protocol solves the multi-channel hidden node problem using a TDMA scheme and increases the network throughput because transmitting and receiving data at the same time is possible. Also, since there is no common control channel, the network does not suffer from the common control channel saturation problem. Moreover, it achieves energy savings by allowing nodes that are not involved in communication to go into sleep mode. Simulation results show that the proposed MAC protocol improves the network throughput and channel efficiency and provides energy savings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.267-277
• /
• 2011

Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2B
• /
• pp.76-81
• /
• 2008

LEACH (Low Energy Adaptive Clustering Hierarchy) has been proposed as a routing protocol with a hierarchical structure, in order to achieve the energy efficiency that is of primary importance in the wireless sensor networks. A wireless sensor network adopting LEACH is composed of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node that is connected to a backbone network. A head node in a cluster allocates TDMA slots to its member nodes without taking into account whether they have data to transmit or not, thus resulting in inefficiency of energy usage of head node that remains in active mode during the entire round time. This motivates us to propose a scheme to improve the energy efficiency of LEACH, by assigning TDMA slots only to those member nodes who have data to send. As a result, the head node can remain sleep during the period of no data transmission from member nodes, leading to the substantial energy saving. By using the ns-2 simulator, we evaluate the performance of the proposed scheme in comparison with the original LEACH. Experimental results validate our scheme, showing a better performance than original LEACH in terms of the number of outliving nodes and the quantity of energy consumption as time evolves.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.101-108
• /
• 2004

The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.

• Korean Journal of Biological Psychiatry
• /
• v.24 no.2
• /
• pp.68-74
• /
• 2017

Objectives It is well known that problem drinking is associated with alterations of brain structures and functions. Brain functions related to alcohol consumption can be determined by the resting state functional connectivity in various resting state networks (RSNs). This study aims to ascertain the alcohol effect on the structures forming predetermined RSNs by assessing their cortical thickness. Methods Twenty-six abstinent male patients with alcohol dependence and the same number of age-matched healthy control were recruited from an inpatient mental hospital and community. All participants underwent a 3T MRI scan. Averaged cortical thickness of areas constituting 7 RSNs were determined by using FreeSurfer with Yeo atlas derived from cortical parcellation estimated by intrinsic functional connectivity. Results There were significant group differences of mean cortical thicknesses (Cohen's d, corrected p) in ventral attention (1.01, < 0.01), dorsal attention (0.93, 0.01), somatomotor (0.90, 0.01), and visual (0.88, 0.02) networks. We could not find significant group differences in the default mode network. There were also significant group differences of gray matter volumes corrected by head size across the all networks. However, there were no group differences of surface area in each network. Conclusions There are differences in degree and pattern of structural recovery after abstinence across areas forming RSNs. Considering the previous observation that group differences of functional connectivity were significant only in networks related to task-positive networks such as dorsal attention and cognitive control networks, we can explain recovery pattern of cognition and emotion related to the default mode network and the mechanisms for craving and relapse associated with task-positive networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.295-303
• /
• 2004

In this Paper, we discuss an active TCP link of unsynchronized transmission mode network in two-way traffic and the Improvement of its traffic patron thorough the network pathway of protocol is shown. This is because the traffic pattern is performed on the basis of existing windows which are distributing information in several periods of time in the way of interfacing LTS control module, which is controlling by an information of exceeding the time limit of feedback loop determined by RTP, with TCP. The simulation to utilize this efficiently is performed with the circumstance of bench mark based on physical modeling of the self-similarity traffic in the performance of TCP. In this paper, we use a methodology to understand and evaluate the effect of change of transmitting protocol in sticks under the condition of the self-similar traffic in two-way network and it is shown that an improvement of congestion control by self-similarity under a heavy condition.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.189-196
• /
• 2002

IPSec is a protocol which provides data encryption, message authentication and data integrity on public and open network transmission. In IPSec, ESP protocol is used when it needs to Provide data encryption, authentication and integrity in real transmission Packets. ESP protocol uses DES-CBC encryption mode when sender encrypts packets and receiver decrypts data through this mode IV is used at that tome. This vague has many risks of attack during transmission by attacker because it is transferred clean and opened. If IV value is modified, then decryption of ESP data is impossible and higher level information is changed. In this paper we propose a new algorithm that it encrpty IV values using DES-ECB mode for preventing IV attack and checks integrity of whole ESP data using message authentication function. Therefore, we will protect attacks of IV and data, and guarantee more safe transmission on the public network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.1254-1257
• /
• 2017

LoRa는 저전력 및 장거리 작동을 위해 설계된 새로운 ISM 대역 무선 기술이며, LoRaWAN은 LoRa에서 정의된 광역 네트워크 프로토콜이다. 본 논문에서는 실제 환경에서 LoRaWAN 기술의 통신 성능을 검증하는 것을 목표로 한다. 이를 위해, 캠퍼스 내에 LoRaWAN 실험을 위한 실제 테스트 베드를 구축했다. 사용자들이 사용하는 실제 환경을 만들기 위해 통신 게이트웨이를 실내에 설치하였고, 캠퍼스의 실내외 다수 위치에서 데이터를 P2P 방식으로 게이트웨이에게 전송한다. 실험에서는 대역폭, 코딩 속도, 확산 계수 및 전송 전력을 변화시켰으며, 성능 검증을 위해 신호대잡음비와 패킷 전송률을 측정하여 결과를 분석한다.

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

변화하는 인터넷 환경에서의 005 보장은 빼놓을 수 없는 중요한 과제로 각종 제안들이 나오고 있다. 본 논문에서는 IETF(Internet Engineering Task Force)에서 제안한 Diffserv 네트워크에서 Host-to-Host의 QoS 보장에 관하여 다루었으며, DSCP(Differentiated Service Codepoint)값의 설정을 Edge Router가 아닌 Host에서 수행하여 경계라우터의 Traffic 부하를 줄이고, MWRR2(Modified Weighted Round Robin Mode2) 방식의 스케줄링을 통해 더욱더 향상된 Diffserv network에서의 Host-to-Host QoS를 제공하는 것이 목적이다. 본 논문은 IETF에서 제안된 Diffserv 방식과 본 논문에서 제안된 Diffserv 방식의 효율성 입증을 위하여, ns2 시뮬레이션을 사용하여, 비교 분석하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.62-65
• /
• 2018

This paper comes out with the study on sensing data collection strategy in a Software-Defined Mobile Edge vehicular networking. The two cooperative data dissemination are Direct Vehicular cloud mode and edge cell trajectory prediction decision mode. In direct vehicular cloud, the vehicle observe its neighboring vehicles and sets up vehicular cloud for cooperative sensing data collection, the data collection output can be transmitted from vehicles participating in the cooperative sensing data collection computation to the vehicle on which the sensing data collection request originate through V2V communication. The vehicle on which computation originate will reassemble the computation out-put and send to the closest RSU. The SDMEVN (Software Defined Mobile Edge Vehicular Network) Controller determines how much effort the sensing data collection request requires and calculates the number of RSUs required to support coverage of one RSU to the other. We set up a simulation scenario based on realistic traffic and communication features and demonstrate the scalability of the proposed solution.