• Title/Summary/Keyword: 인터넷 보안 시뮬레이션

Search Result 85, Processing Time 0.026 seconds

An Uplink Scheduling Algorithm for VoIP in IEEE 802.16d Systems (IEEE 802.160에서 상향링크 VoIP 스케줄링 알고리즘 방식 연구)

  • Kang, Min-Seok;Jang, Jae-Shin
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.3
    • /
    • pp.87-91
    • /
    • 2006
  • With the growth of the internet, the number of wireless internet users has increased continuously up to date. However, mobile communications could not support high speed transmission rate with cheap communication fee and wireless LAN has problems in providing terminal mobility and wide area connectivity, respectively. So the WMAN standard has been newly designed to make up for these limits. The initial 802.16 specification effectively offers a solution for providing fixed users with high speed wireless communication but it does not offer terminal mobility. So the 802.16d and 802.16e have been developed as the next generation solution that can support various PHY layer (SC, SCa, OFDM, OFDMA) and offer the terminal mobility. In this paper, we propose an effective uplink scheduling algorithm for VoIP with using UGS, and we show that our proposed algorithm is superior in view of average delay and management of uplink bandwidth to conventional rtPS algorithm and the scheme in reference, with using NS-2 network simulator.

  • PDF

A Study of Security Rule Management for Misuse Intrusion Detection Systems using Mobile Agen (오용침입탐지시스템에서보바일에이전트를이용한보안규칙관리에관한연구)

  • Kim, Tae-Kyoung;Seo, Hee-Suk;Kim, Hee-Wan
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.8
    • /
    • pp.781-790
    • /
    • 2004
  • This paper describes intrusion detection rule mangement using mobile agents. Intrusion detection can be divided into anomaly detection and misuse detection. Misuse detection is best suited for reliably detecting known use patterns. Misuse detection systems can detect many or all known attack patterns, but they are of little use for as yet unknown attack methods. Therefore, the introduction of mobile agents to provide computational security by constantly moving around the Internet and propagating rules is presented as a solution to misuse detection. This work presents a new approach for detecting intrusions, in which mobile agent mechanisms are used for security rules propagation. To evaluate the proposed appraoch, we compared the workload data between a rules propagation method using a mobile agent and a conventional method. Also, we simulated a rules management using NS-2(Network Simulator) with respect to time.

  • PDF

A New Secure Multicast Protocol in Micro-Mobility Environments using Secure Group Key (마이크로 모빌리티 환경에서 보안 그룹키를 이용한 안전한 멀티캐스트 프로토콜)

  • Kang, Ho-Seok;Shim, Young-Chul
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.573-586
    • /
    • 2008
  • The improved performance and miniaturization of computer and the improvement of wireless communication technology have enabled the emergence of many high quality services. Among them multicast services are receiving much attention and their usage is increasing due to the increase of Internet multimedia services such as video conference, multimedia stream, internet TV, etc. Security plays an important role in mobile multicast services. In this paper, we proposed a secure multicast protocol for a hierarchical micro-mobility environment. The proposed secure multicast protocol provides security services such as authentication, access control, confidentiality and integrity using mechanisms including symmetric/asymmetric key crypto-algorithms and capabilities. To provide forward/backward secrecy and scalability, we used sub-group keys based on the hierarchical micro-mobility environment. With this security services, it is possible to guard against all kinds of security attacks performed by illegal mobile nodes. Attacks executed by internal nodes can be thwarted except those attacks which delete packet or cause network resources to be wasted. We used simulator to measure the performance of proposed protocol. As a result, the simulation showed that effect of these security mechanisms on the multicast protocol was not too high.

Performance Analysis of the Amplify-and-Forward Scheme under Interference Constraint and Physical Layer Security (물리 계층 보안과 간섭 제약 환경에서 증폭 후 전송 기법의 성능 분석)

  • Pham, Ngoc Son;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.179-187
    • /
    • 2014
  • The underlay protocol is a cognitive radio method in which secondary or cognitive users use the same frequency without affecting the quality of service (QoS) for the primary users. In addition, because of the broadcast characteristics of the wireless environment, some nodes, which are called eavesdropper nodes, want to illegally receive information that is intended for other communication links. Hence, Physical Layer Security is applied considering the achievable secrecy rate (ASR) to prevent this from happening. In this paper, a performance analysis of the amplify-and-forward scheme under an interference constraint and Physical Layer Security is investigated in the cooperative communication mode. In this model, the relays use an amplify-and- forward method to help transmit signals from a source to a destination. The best relay is chosen using an opportunistic relay selection method, which is based on the end-to-end ASR. The system performance is evaluated in terms of the outage probability of the ASR. The lower and upper bounds of this probability, based on the global statistical channel state information (CSI), are derived in closed form. Our simulation results show that the system performance improves when the distances from the relays to the eavesdropper are larger than the distances from the relays to the destination, and the cognitive network is far enough from the primary user.

Scheduling Algorithms for QoS Provision in Broadband Convergence Network (광대역통합 네트워크에서의 스케쥴링 기법)

  • Jang, Hee-Seon;Cho, Ki-Sung;Shin, Hyun-Chul;Lee, Jang-Hee
    • Convergence Security Journal
    • /
    • v.7 no.2
    • /
    • pp.39-47
    • /
    • 2007
  • The scheduling algorithms to provide quality of service (QoS) in broadband convergence network (BcN) are compared and analysed. The main QoS management methods such as traffic classification, traffic processing in the input queue and weighted queueing are first analysed, and then the major scheduling algorithms of round robin, priority and weighted round robin under recently considering for BcN to supply real time multimedia communications are analysed. The simulation results by NS-2 show that the scheduling algorithm with proper weights for each traffic class outperforms the priority algorithm.

  • PDF

Implementation of fast stream cipher AA128 suitable for real time processing applications (실시간 처리 응용에 적합한 고속 스트림 암호 AA128 구현)

  • Kim, Gil-Ho;Cho, Gyeong-Yeon;Rhee, Kyung Hyune;Shin, Sang Uk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.10
    • /
    • pp.2207-2216
    • /
    • 2012
  • Recently, wireless Internet environment with mobile phones and wireless sensor networks with severe resource restrictions have been actively studied. Moreover, an overall security issues are essential to build a reliable and secure sensor network. One of secure solution is to develop a fast cryptographic algorithm for data encryption. Therefore, we propose a 128-bit stream cipher, AA128 which has efficient implementation of software and hardware and is suitable for real-time applications such as wireless Internet environment with mobile phones, wireless sensor networks and Digital Right Management (DRM). AA128 is stream cipher which consists of 278-bit ASR and non-linear transformation. Non-linear transformation consists of Confusion Function, Nonlinear transformation(SF0 ~ SF3) and Whitening. We show that the proposed stream cipher AA128 is faster than AES and Salsa20, and it satisfies the appropriate security requirements. Our hardware simulation result indicates that the proposed cipher algorithm can satisfy the speed requirements of real-time processing applications.

A Study on Scalable PBFT Consensus Algorithm based on Blockchain Cluster (블록체인을 위한 클러스터 기반의 확장 가능한 PBFT 합의 알고리즘에 관한 연구)

  • Heo, Hoon-Sik;Seo, Dae-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.45-53
    • /
    • 2020
  • Blockchain can control transactions in a decentralized way and is already being considered for manufacturing, finance, banking, logistics, and medical industries due to its advantages such as transparency, security, and flexibility. And it is predicted to have a great economic effect. However, Blockchain has a Trilemma that is difficult to simultaneously improve scalability, decentralization and security characteristics. Among them, the biggest limitation of blockchain is scalability, which is very difficult to cope with the constantly increasing number of transactions and nodes. To make the blockchain scalable, higher performance should be achieved by modifying existing consensus methods or by improving the characteristics and network efficiency that affect many ways of scaling. Therefore, in this paper, we propose a cluster-based scalable PBFT consensus algorithm called CBS-PBFT which reduces the message complexity O(n2) of PBFT to O(n), which is a representative consensus algorithm of blockchain, and the validity is verified through simulation experiments.

XML Signature System on Mobile Environment (모바일 환경에서 XML 전자서명 시스템)

  • Cao, Ke-Rang;Kim, Chang-Su;Jung, Hoe-Kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1441-1447
    • /
    • 2008
  • It is possible to transfer huge data in mobile device by advancing mobile technology, and so in this base, various services are offered. Especially, E-commerce service is offering on mobile environment, and this service is based on XML(eXtensible Markup Language) Signature. XML Signature assure that process integrity, message authentication, and/or signer authentication. And WIPI(Wireless Internet Protocol for Interoperability) that is mobile internet integration platform was proposed to integrate mobile device platform. However, because WIPI transmits and exchanges message by tort of XML base, encryption of XML document and necessity of XML signature are increasing because of weakness of security. Therefor in this paper, Encryption and XML signature module of XML document that satisfy standard requirement in WIPI platform base design and implementation. System that was proposed in this paper used standard encryption and XML signature algorithm and supports safe encryption and XML signature through doing security simulation applied various algorithm for XML document of mobile environment.

Lightweight Key Escrow Scheme for Internet of Battlefield Things Environment (사물인터넷 환경을 위한 경량화 키 위탁 기법)

  • Tuan, Vu Quoc;Lee, Minwoo;Lim, Jaesung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.12
    • /
    • pp.1863-1871
    • /
    • 2022
  • In the era of Fourth Industrial Revolution, secure networking technology is playing an essential role in the defense weapon systems. Encryption technology is used for information security. The safety of cryptographic technology, according to Kerchoff's principles, is based on secure key management of cryptographic technology, not on cryptographic algorithms. However, traditional centralized key management is one of the problematic issues in battlefield environments since the frequent movement of the forces and the time-varying quality of tactical networks. Alternatively, the system resources of each node used in the IoBT(Internet of Battlefield Things) environment are limited in size, capacity, and performance, so a lightweight key management system with less computation and complexity is needed than a conventional key management algorithm. This paper proposes a novel key escrow scheme in a lightweight manner for the IoBT environment. The safety and performance of the proposed technique are verified through numerical analysis and simulations.

A Distributed Indexing Scheme for Wireless Data Broadcasting of Health Information FHIR Resources (의료 정보 FHIR 리소스 무선 데이터 방송을 위한 분산 인덱싱 기법)

  • Im, Seokjin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.23-28
    • /
    • 2017
  • FHIR, next-generation standard for health information exchange, allows to exchange health information fast and to provide various health services. In this paper, we propose an indexing scheme of FHIR resources for adopting the resources to wireless data broadcasting with a secure channel. That scheme keeps the information of users to support to download FHIR resources from the secure wireless broadcast channel and the information on the resources. Using the proposed index, massive users can download their desired FHIR resources with less energy in short time. With simulation studies, we show the proposed indexing scheme outperforms other scheme broadcasting FHIR resources.