• Title/Summary/Keyword: Network packet

Search Result 2,657, Processing Time 0.031 seconds

A Study of Future Internet Testbed Construction using NetFGA/OpenFlow Switch on KOREN/KREONET (KOREN/KREONET기반 NetFPGA/OpenFlow 스위치를 이용한 미래인터넷 테스트 베드 구축 방안 연구)

  • Park, Man-Kyu;Jung, Whoi-Jin;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.7
    • /
    • pp.109-117
    • /
    • 2010
  • Building a large-scale testbed for Future Internet is very important to evaluate a new protocol and new network architecture designed by clean-slate approach. In Korea, new Future Internet testbed project, called FIRST (Future Internet Research for Sustainable Testbed), has been started since Mar. 2009 to design and test new protocols. This project is working together with ETRI and 5 universities. The FIRST@PC is to implement a virtualized hardware-accelerated PC-node by extending the functions of NetFPGA card and build a Future Internet testbed on the KOREN and KREONET for evaluating newly designed protocols and interesting applications. In this paper, we first briefly introduce FIRST@PC project and explain a 'MAC in IP Capsulator' user-space program using raw-socket in Linux to interconnect OpenFlow enabled switch sites on the KOREN and KREONET. After that, we address test results for TCP throughput performance for varying packet size. The test results show that the software based capsulator can support a reasonable bandwidth performance for most of applications.

The Self-regulating Fire Prevention System in Korea: with the Focus on the Role of Insurance System (자율예방체계의 구축 -규제개혁의 차원에서 보험의 역할을 중심으로-)

  • 김태윤
    • Fire Science and Engineering
    • /
    • v.15 no.1
    • /
    • pp.55-65
    • /
    • 2001
  • This paper's purpose is three-folded: modeling the self-regulating fire prevention system, developing a packet of practical fire prevention measures and regulations, and reviewing the applicability of fire insurance system in Korea as a main components of the self-regulating fore prevention system. The so called self-regulating fire prevention system is defined as a grand national fire prevention framework based on and promoted by the vitality and creativeness of the market (or private sector). This drastically contrasts with the existing government-led fire prevention system in Korea. The self-regulating fire prevention system has three grounds: the principle of self-responsibility, the redefinition of the fire service as a public goods, and the principle of self-selection. It seems natural that the self-regulating fire prevention system requires the function of fire insurance institution as a pivoting mechanism providing individual decision makers with a system of incentives, resulting in rational behaviors in the part of each individuals and in the well-balanced fire prevention network in the part of the overall public. In this regard, this pilfer examines the institutions and performance of the fire insurance industry in Korea and reviews the limitation of the industry as an instant replacement mechanism of the current government-led fire prevention system in Korea.

  • PDF

Design and Implementation of ISO/IEEE 11073 DIM Transmission Structure Based on oneM2M for IoT Healthcare Service (사물인터넷 헬스케어 서비스를 위한 oneM2M기반 ISO/IEEE 11073 DIM 전송 구조 설계 및 구현)

  • Kim, Hyun Su;Chun, Seung Man;Chung, Yun Seok;Park, Jong Tae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.4
    • /
    • pp.3-11
    • /
    • 2016
  • In the environment of Internet of Things (IoT), IoT devices are limited by physical components such as power supply and memory, and also limited to their network performance in bandwidth, wireless channel, throughput, payload, etc. Despite these limitations, resources of IoT devices are shared with other IoT devices. Especially, remote management of the information of devices and patients are very important for the IoT healthcare service, moreover, providing the interoperability between the healthcare device and healthcare platform is essential. To meet these requirements, format of the message and the expressions for the data information and data transmission need to comply with suitable international standards for the IoT environment. However, the ISO/IEEE 11073 PHD (Personal Healthcare Device) standards, the existing international standards for the transmission of health informatics, does not consider the IoT environment, and therefore it is difficult to be applied for the IoT healthcare service. For this matter, we have designed and implemented the IoT healthcare system by applying the oneM2M, standards for the Internet of Things, and ISO/IEEE 11073 DIM (Domain Information Model), standards for the transmission of health informatics. For the implementation, the OM2M platform, which is based on the oneM2M standards, has been used. To evaluate the efficiency of transfer syntaxes between the healthcare device and OM2M platform, we have implemented comparative performance evaluation between HTTP and CoAP, and also between XML and JSON by comparing the packet size and number of packets in one transaction.

Simple Mobility Management Protocol Based on P2P for Global IP Mobility Support (글로벌 IP 이동성 지원을 위한 P2P 기반 간단한 이동성 관리 프로토콜)

  • Chun, Seung-Man;Nah, Jae-Wook;Park, Jong-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.12
    • /
    • pp.17-27
    • /
    • 2011
  • Most of the previous mobility management protocols such as IETF MIPv4/6 and its variants standardized by the IETF do not support global seamless handover because they require partially changes of the existing network infrastructure. In this article, we propose a simple mobility management protocol (SMMP) which can support global seamless handover between homogeneous or heterogeneous wireless networks. To do this, the SMMP employs separate location management function as DMMS to support global user and service mobility and the bidirectional tunnels are dynamically constructed to support seamless IP mobility by using the IEEE MIH extension server, which is extended the IEEE 802.21 MIH standards. The detailed architecture and functions of the SMMP have been designed. Finally, the mathematical analysis and the simulation have been done. The performance results show the proposed SMMP outperforms the existing MIPv6 and HMIPv6 in terms of handover latency, packet loss, pear signal noise ratio (PSNR).

USB Device Authentication Protocol based on OTP (OTP 기반의 USB 디바이스 인증 프로토콜)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.8
    • /
    • pp.1735-1742
    • /
    • 2011
  • Now a days, as a mass-storage USB becomes comfortable to carry, function of USB is being developed fast. However, there is a problem that the personal information which is stored in USB could be exposed being used with negative purpose without other certification process. This paper suggests OTP(One-Time Password)-based certification protocol of USB to securely protect personal information stored in USB without additional certification information. The proposed OTP based certification protocol of USB not only demands low calculations but also prevents physical approach of USB of other network and does not allow unnecessary service access of user because it conducts simple action and uses one-way hash function. Therefore, communication overhead and service delay is improved. In the experiment, the proposed protocol compares and evaluates throughput of certification server according to the numbers of USB and delay time of packet certification with a device(USB driver) which simply save device and a device(USB Token) which can calculate by oneself. As a result, it is improved as the number of 12.5% in the certification delay time on average and is improved as the number of 10.8% in the throughput of certification server according to the numbers of USB.

Energy Efficient Clustering Algorithm for Surveillance and Reconnaissance Applications in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 감시·정찰 응용의 클러스터링 알고리즘 연구)

  • Kong, Joon-Ik;Lee, Jae-Ho;Kang, Jiheon;Eom, Doo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1170-1181
    • /
    • 2012
  • Wireless Sensor Networks(WSNs) are used in diverse applications. In general, sensor nodes that are easily deployed on specific areas have many resource constrains such as battery power, memory sizes, MCUs, RFs and so on. Hence, first of all, the efficient energy consumption is strongly required in WSNs. In terms of event states, event-driven deliverly model (i.e. surveillance and reconnaissance applications) has several characteristics. On the basis of such a model, clustering algorithms can be mostly used to manage sensor nodes' energy efficiently owing to the advantages of data aggregations. Since a specific node collects packets from its child nodes in a network topology and aggregates them into one packet to relay them once, amount of transmitted packets to a sink node can be reduced. However, most clustering algorithms have been designed without considering can be reduced. However, most clustering algorithms have been designed without considering characteristics of event-driven deliverly model, which results in some problems. In this paper, we propose enhanced clustering algorithms regarding with both targets' movement and energy efficiency in order for applications of surveillance and reconnaissance. These algorithms form some clusters to contend locally between nodes, which have already detected certain targets, by using a method which called CHEW (Cluster Head Election Window). Therefore, our proposed algorithms enable to reduce not only the cost of cluster maintenance, but also energy consumption. In conclusion, we analyze traces of the clusters' movements according to targets' locations, evaluate the traces' results and we compare our algorithms with others through simulations. Finally, we verify our algorithms use power energy efficiently.

Dynamic States Consideration for Next Hop Nodes Selection Method to Improve Energy Efficiency in LEAP based Wireless Sensor Networks (LEAP기반의 무선 센서 네트워크에서 가변적 상태를 고려한 에너지 효율적 다음 홉 노드 선택 기법)

  • Nam, Su-Man;Cho, Tae-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.6
    • /
    • pp.558-564
    • /
    • 2013
  • Wireless sensor networks (WSNs) contain limited energy resources and are left in open environments. Since these sensor nodes are self-operated, attacks such as sinkhole attacks are possible as they can be compromised by an adversary. The sinkhole attack may cause to change initially constructed routing paths, and capture of significant information at the compromised node. A localized encryption and authentication protocol (LEAP) has been proposed to authenticate packets and node states by using four types of keys against the sinkhole attack. Even though this novel approach can securely transmits the packets to a base station, the packets are forwarded along the constructed paths without checking the next hop node states. In this paper, we propose the next hop node selection method to cater this problem. Our proposed method evaluates the next hop node considering three factors (i.e., remaining energy level, number of shared keys, and number of filtered false packets). When the suitability criterion for next hop node selection is satisfied against a fix threshold value, the packet is forwarded to the next hop node. We aim to enhance energy efficiency and a detour of attacked areas to be effectively selected Experimental results demonstrate validity of the proposed method with up to 6% energy saving against the sinkhole attack as compared to the LEAP.

MP-AODV : A New Multipath Routing Protocol Based on AODV in Mobile Ad Hoc Networks (MP-AODV : AODV 기반 모바일 Ad-Hoc 네트워크에서의 다중경로 라우팅 프로토콜)

  • Lee, Yun-Sung;Chung, Sang-Hwa
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.6
    • /
    • pp.131-142
    • /
    • 2011
  • In this paper, we propose a new multipath routing protocol and compare it with other multipath routing protocols in mobile ad hoc network (MANET) environments. The new multipath routing establishes the main route using a mechanism based on Ad Hoc On-demand Distance Vector(AODV), after which data transmission starts immediately. The backup route search process takes place while data are transmitted, to reduce the transmission delay. The protocol can also operate in a hybrid node-disjoint/link-disjoint mode, where the protocol finds the node-disjoint backup route first; if the node-disjoint does not exist, the protocol discovers the link-disjoint backup route from the main route. When either of the main route or the backup route is broken, data are transmitted continuously through the other route and the broken route is recovered by the route maintenance process. The results of simulations, based on the Qualnet simulator, show that the proposed multipath routing protocol increases the packet transmission success rate and reduces end-to-end delays, when compared with AODV and AOMDV protocols.

Performance Analysis of RS codes for Low Power Wireless Sensor Networks (저전력 무선 센서 네트워크를 위한 RS 코드의 성능 분석)

  • Jung, Kyung-Kwon;Choi, Woo-Seung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.4
    • /
    • pp.83-90
    • /
    • 2010
  • In wireless sensor networks, the data transmitted from the sensor nodes are susceptible to corruption by errors which caused of noisy channels and other factors. In view of the severe energy constraint in Sensor Networks, it is important to use the error control scheme of the energy efficiently. In this paper, we presented RS (Reed-Solomon) codes in terms of their BER performance and power consumption. RS codes work by adding extra redundancy to the data. The encoded data can be stored or transmitted. It could have errors introduced, when the encoded data is recovered. The added redundancy allows a decoder to detect which parts of the received data is corrupted, and corrects them. The number of errors which are able to be corrected by RS code can determine by added redundancy. The results of experiment validate the performance of proposed method to provide high degree of reliability in low-power communication. We could predict the lifetime of RS codes which transmitted at 32 byte a 1 minutes. RS(15, 13), RS(31, 27), RS(63, 57), RS(127,115), and RS(255,239) can keep the days of 173.7, 169.1, 163.9, 150.7, and 149.7 respectively. The evaluation based on packet reception ratio (PRR) indicates that the RS(255,239) extends a sensor node's communication range by up about 3 miters.

Developing an Adaptive Multimedia Synchronization Algorithm using Leel of Buffers and Load of Servers (버퍼 레벨과 서버부하를 이용한 적응형 멀티미디어 동기 알고리즘 개발)

  • Song, Joo-Han;Park, Jun-Yul;Koh, In-Seon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.6
    • /
    • pp.53-67
    • /
    • 2002
  • The multimedia synchronization is one of the key issues to be resolved in order to provide a good quality of multimedia related services, such as Video on Demands(VoD), Lecture on Demands(LoD), and tele-conferences. In this paper, we introduce an adaptive multimedia synchronization algorithm using the level of buffers and load of servers, which are modeled and analyzed by ExSpect, a Petri net based simulation tool. In the proposed algorithm, the audio and video buffers are divided to 5 different levels, and the pre-defined play-out speed controller tries to make the buffer level to be normal in different temporal relations between multimedia streams using buffer levels and server loads. Because each multimedia packet is played by the pre-defined play-out speed, the media data can be reproduced within the permissible limit of errors while preserving the level of buffers to be normal. The proposed algorithm is able to handle and support various communication restrictions between providers and users, and offers little jitter play-out to many users in networks with the limited transmission capability. The performance of the developed algorithm is analyzed in various network conditions using a Petri net simulation tool.