• Title/Summary/Keyword: header information

Search Result 391, Processing Time 0.024 seconds

Malware Analysis and Policy Counterplan Against a Transformation of HTTP Header Information (HTTP Header 정보의 변조를 통한 악성코드 분석과 대응방안)

  • Lim, Won-Gyu;Heo, Geon-Il;Park, Won-Hyung;Kook, Kwang-Ho
    • Convergence Security Journal
    • /
    • v.10 no.2
    • /
    • pp.43-49
    • /
    • 2010
  • Nowadays, the occurrence of Malware is steadily increasing. The Malware is also becoming more intelligent, advanced and changing into various types. With the development of the information industry, the economic and monetary value of the information is going up and the damage due to the leaked information by the Malware is also increasing. This paper investigates the general usage of the User Agent in the HTTP Header, studies the Malware production techniques by transformation of the User-Agent information and suggests the technical and political counterplan against them.

An Efficient Scheme for Electing Cluster Header Using Remaining Electric Energy in Ad Hoc Networks (Ad Hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤더 선출 기법)

  • Park, Hye-Ran;Kim, Wu-Woan;Jang, Sang-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.6
    • /
    • pp.1173-1178
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header.

Improved Cluster Routing Algorithm Using Remaining Electric Energy Based on CBRP (CBRP 기반 잔여전력량을 이용한 개선된 클러스터 라우팅 기법)

  • Park, Hyeran;Kim, Wuwoan;Jang, Sangdong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.1
    • /
    • pp.63-71
    • /
    • 2013
  • In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other member nodes do because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exist problems that the cluster header has short average lifetime, and a new cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases the problem of re-electing the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header any more because the remaining energy level goes low, it sends a beacon message to neighbor member nodes, then the second header will serve as the cluster header.

A Study on SCTP Header Compression using the ROHC Method (ROHC 압축 기법을 적용한 SCTP 헤더 압축 연구)

  • Song, Hee-Ok;Choi, Moon-Seok;Choi, Seong-Gon;Shin, Byung-Cheol;Lee, In-Sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.76-87
    • /
    • 2005
  • In this paper, we propose a new profile, ROHC(RObust Header Compression) profile 7, for SCTP with ROHC for applying robust header compression SCTP, which is a transport layer protocol. The proposed new profile 7 adds a new field of 1 or 2 byte size on the existing SCTP packet header, which can make the SCTP stream to be diveded into acknowledgement stream and data stream. In addition, the classification of the stream can be used for recovering fault context. Consequently, in the case of using proposed ROHC-SCTP, it is possible to reduce the SCTP header overhead rate and also can be saved bandwidth.

A Comparative Study on Metadata Formats of Digital Contents (디지털콘텐츠 메타데이터 포맷의 비교 연구)

  • Cho, Yoon-Hee
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.37 no.2
    • /
    • pp.135-152
    • /
    • 2003
  • With the rapid growth of the Internet, digital contents have increased in a geometric progression and the types also became much varied. In order to make it easier to identify and search digital contents on the Internet, which is basically a distributed network environment, it is essential to organize and manage metadata. In this study, we have comparatively analyzed the data elements of the meta data formats currently approached from different aspects in diverse fields, so as to provide basic materials for securing interoperability of the meta data formats. We selected Dublin Core, Semantic Header, MARC, IAFA Templates, and TEI Header as the general metadata formats of digital contents used widely in all areas, and we carried out comparisons and analyses based on the literature.

Uniform Sensor-node Request Scheme for the Recovery of Sensing Holes on IoT Network (IoT 네트워크의 센싱홀 복구를 위한 센서 이동 균등 요청 방법)

  • Kim, Moonseong;Park, Sooyeon;Lee, Woochan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.16 no.4
    • /
    • pp.9-17
    • /
    • 2020
  • When IoT sensor nodes are deployed in areas where data collection is challenging, sensors must be relocated if sensing holes occur due to improper placement of sensors or energy depletion, and data collection is impossible. The sensing hole's cluster header transmits a request message for sensor relocation to an adjacent cluster header through a specific relay node. However, since a specific relay node is frequently used, a member sensor located in a specific cluster area adjacent to the sensing hole can continuously receive the movement message. In this paper, we propose a method that avoids the situation in which the sensing hole cluster header monopolizes a specific relay node and allows the cluster header to use multiple relay nodes fairly. Unlike the existing method in which the relay node immediately responds to the request of the header, the method proposed in this paper solves a ping-pong problem and a problem that the request message is concentrated on a specific relay node by applying a method of responding to the request of the header using a timer. OMNeT++ simulator was used to analyze the performance of the proposed method.

OATM/WDM Optical Access Network Using Header Decoder-Based Router for Next-Generation Communications

  • Park, Kihwan
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.3
    • /
    • pp.335-342
    • /
    • 2016
  • We demonstrate an optical asynchronous transfer mode/wavelength division multiplexing (OATM/WDM) optical access network, using a router based on an optical header decoder to conduct next-generation communications. The router consists of a decoder or hardware analysis processing of the header bit and switches. The router in the OATM/WDM optical access network is a key technology by which to satisfy subscribers’ requests, including reliability, cost efficiency, high speed, large-capacity transmission, and elevated information security. In this study, we carry out experiments in which a header decoder delivers to 16 and 32 subscribers with a single wavelength in the router. These experiments confirm the decoder’s successful operation via hardware using 4 and 5 header bits. We propose that this system may significantly contribute toward the realization of an optical access network that provides high-quality service to subscribers of next-generation communications.

An Efficient Cluster Header Election Technique in Zigbee Environments (Zigbee환경에서 효율적인 Cluster Header 선출 기법)

  • Lee, Joo-Hyun;Lee, Kyung-Hwa;Lee, Jun-Bok;Shin, Yong-Tae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.346-350
    • /
    • 2010
  • Since sensor nodes have restriction of using resources in Zigbee network, number of study on improving efficiency is currently ongoing[1]. Clustering mechanism based on hierarchy structure provides a prevention of duplicated information and a facility of a network expansion[2]. however overheads can occurs when the cluster header is elected and the election of a incorrect cluster header causes to use resources inefficiently. In this paper, we propose that the cluster header election mechanism using distances between nodes and density of nodes in accordance with the operation of the central processing system in which the sync nodes are having information of location and energy with respect to general nodes based on hierachy clustering mechanism.

An Efficient Cluster header Election Scheme Using Remain Energy in Ad hoc network (Ad hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤드 선출 기법)

  • Park, Hye-Ran;Kim, Wu-Woan;Jang, Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.224-227
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP), a cluster header in each cluster is selected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP selects a cluster header without considering the remaining energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be selected frequently. In this paper, we propose the advanced protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining energies of all of nodes are compared with one another, and the node with the highest energy is selected as the cluster header.

  • PDF

Improved ROHC Optimistic Mode for Efficient Utilization of the Resources in Mobile WiMAX (모바일 와이맥스 환경에서의 효율적인 무선링크 자원 활용을 위한 ROHC Optimistic 모드의 개선 방안)

  • Kim, Joo-Young;Woo, Hyun-Je;Lee, Mee-Jeong;Kwon, Jeong-Min
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.57-64
    • /
    • 2009
  • In order to efficiently provide IP based Wireless Broadband services in Mobile WiMAX, schemes for more efficiently utilizing a limited bandwidth in radio links are needed. Robust Header Compression (ROHC), a standard header compression scheme proposed by IETF, Bi-directional Optimistic (O) mode provides higher compression efficiency and robustness compared with Payload Header Suppression (PHS) which is an optional header compression scheme for mobile WiMAX [1, 2]. However, if consecutive packet losses occur because of a Shadow Region of Mobile WiMAX or bit errors, header decompression failure rate of the ROHC O mode increases due to inconsistency of the compression information between the Compressor and the Decompressor. Therefore, a complementary mechanism is needed. In this paper, we propose an approach for the dynamic adjustment of an optimistic parameter, which has an effect on both the compression efficiency and the robustness, for improving the performance of ROHC O mode. We also analyze the performance of the proposed approach using an OPNET simulator.