• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.47-54
• /
• 2007

Since impulse-radio-based ultra wideband (IR-UWB) do not use carrier frequency but use very short pulse to transmit data it sends data not continuously but discretely and this feature gives the potential to reduce collision in multi-user environment. In this paper, we analyse characteristic of IR-UWB and propose a new collision paradigm, Collision Distribution which changes collision level from packet to pulse. In Collision Distribution mechanical each node sends data with its own pulse interval in random time, distributed manner. It prevents packet drop due to packet collision. We show that Collision Distribution can reduce packet error and can provide real time packet transmission with analysis.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.135-145
• /
• 2002

Active networks represent a new approach to network architecture. Nodes(routers, switches, etc.) can perform computations on user data, while packets can carry programs to be executed on nodes and potentially change the state of them. While active networks provide a flexible network iufrastructure, they are more complex than traditional networks and raise considerable security problems. Nodes are Public resources and are essential to the proper and contract running of many important systems. Therefore, security requirements placed upon the computational environment where the code of packets will be executed must be very strict. Trends of research for active network security are divided into two categories: securing active nodes and securing active packets. For example, packet authentication or monitoring/control methods are for securing active node, but some cryptographic techniques are for the latter. This paper is for transferring active packets securely between active nodes. We propose a new method that can transfer active packets to neighboring active nodes securely, and execute executable code included in those packets in each active node. We use both public key cryptosystem and symmetric key cryptosystem in our scheme

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1054-1062
• /
• 1991

In this paper a communication system using direct sequence spread spectrum (DS/SS) technique is constructed to transmit burst format data over power line channel with impulsive noise and narrowband interferences. Fast code synchronization is acquired by digital matched filter and data decision is accomplished by sampling pulses. In order to examine the performance of the power line communication system, but error rate and packet loss rate are measured over the simulation channel with various noise sources. When the packet composed of 1-bit preamble and 63-bit data is transmitted under very high burst impulsive noise, the bit error rate is about 10$^3$-10$^4$ and the packet loss rate is below 0.07.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1824-1837
• /
• 1994

Broadband ISDN will support advanced communication services such as multimedia conference, VOD and electronic news service. Because many of these advanced services require multimedia data delivery, future communication networks must have flexible and efficient multiparty communications capabilities. In this paper we propose a new multicasting method which uses packer filtering capabilities both in a physical network and in a logical network layers. This new scheme has potential to reduce the transmission and packet processing overheads of multicast communications. For the new multicasting method, we develop a group matching algorithm which finds a suitable set of groups that covers multiple target hosts. We show the application of the multicasting method and the group matching algorithm with two simple examoles.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3B
• /
• pp.143-152
• /
• 2007

In order to provide new value-added services such as a policy-based routing and the quality of services in next generation network, the Internet routers need to classify packets into flows for different treatments, and it is called a packet classification. Since the packet classification should be performed in wire-speed for every packet incoming in several hundred giga-bits per second, the packet classification becomes a bottleneck in the Internet routers. Therefore, high speed packet classification algorithms are required. In this paper, we propose an efficient packet classification architecture based on a hierarchical binary search fee. The proposed architecture hierarchically connects the binary search tree which does not have empty nodes, and hence the proposed architecture reduces the memory requirement and improves the search performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1399-1405
• /
• 2003

This paper proposes an MAC protocol for fair packet data services in stoned CDMA system. In slotted CDMA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are entirely caused by multiple access interference. Therefore, in order to get the optimal system throughput, the number of simultaneously transmitted Packets should be kept at a proper level. In the proposed protocol, the base station calculates the new and retransmitted packet transmission probability of mobile stations according to the offered load and then broadcasts these probabilities. Mobile stations, which have a packet, attempt to transmit packet with the received probabilities. Simulation results show that the proposed scheme can offer better system throughput than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.315-322
• /
• 2000

네트워크에서 QoS를 보장하기 위해 최근에 제안되는 패킷 스케줄링 알고리즘은 대부분 우선 순위에 입각한 패킷 전송 서비스를 한다. 이러한 우선 순위를 유지하기 위한 큐의 관리에는 많은 비용이 들므로 QoS를 보장하는 네트워크에서 우선 순위 큐의 관리 비용을 줄이는 노력이 필요하다. 패킷 스케줄링 알고리즘 중 RPO+(Rotate Priority Queue)는 우선 순위 FIFO(First in first out)큐를 사용하여 주기 적으로 재명명되는 패킷 스케줄링 알고리즘이다. FIFO 큐에 패킷들을 근사 정렬하여 패킷의 우선 순위를 유지하므로 계산 복잡도를 줄이지만, 패킷 우선 순위를 유지하기 위해 2배(2P)의 큐를 필요로 한다.[1] 본 논문에서는 필요한 큐의 개수를 P개의 큐로 제한하여 큐에 대한 관리 비용을 줄였으며 엔터프라이즈 환경에서 애플리케이션이 요구하는 서비스 특성에 따라 클래스로 구분하여 적합한 패킷 스케줄링 서비스를 제공하는 알고리즘을 제시한다. 본 기법은 추가적인 오버플로우 큐를 관리하고 패킷 어드미션 컨트롤러를 통해 패킷 전송 지연 시간을 제한함으로 다양한 애플리케이션의 네트워크 QoS 요구를 보장하고 패킷 전손 효율을 높였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.416-418
• /
• 2014

WAVE (Wireless Access in Vehicular Environments) 시스템 환경은 차량 간 무선통신을 가능하게 해주는 환경이다. 무선통신의 활용이 증가하면서 그에 따른 공격 방법도 증가하여, 통신 시 제3자에 의해 패킷이 변조될 수 있다. 제3자로부터 패킷을 보호하기 위해 통신 전 차량은 CA (Certificate Authority)로부터 자신이 적합한 호스트라는 것을 인증 받아야 한다. 본 논문에서는 차량과 CA의 통신 과정에서 Diffie-Hellman Key Exchange 알고리즘과 AES (Advanced Encryption Standard) 알고리즘 등을 이용하여 패킷의 기밀성과 무결성을 보장하는 프로토콜을 설계하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1646-1652
• /
• 2010

The communication in wireless sensor network is divided into several layers, because of each of them do their role, the wireless communication is possible, the MAC (Medium Access Control) layer of the one of sensor network communications layer is used to the data errors, control flow, and manage resources. Using MAC Protocol, it ensures the communication between sensor node. In this paper, highlighted the energy efficiency of the S-MAC, T-MAC protocol it emphasized the efficiency of energy by lessening the woken time of all nods effectively, transmitting and receiving the control packet on only necessary nods through use of a method that RTS packet is added to SYNC packet and making other nods sleep. On sending SYNC+RTS packet and receiving the packet, nod noticed that it wasn't necessary to be awaked on this period, would be in Sleep mode, demonstrated mathematically that energy is more effective than existing protocol, and simulated with MATLAB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1151-1168
• /
• 2009

Improving packet loss does not necessarily coincide with the improvement in user perceivable QoS because each frame carries different degree of importance. We propose Significance-aware packet scheduling (SAPS) to maximize user perceivable QoS. SAPS carries out two fundamental issues of packet scheduling: "What to transmit" and "When to transmit?" To adapt to the available bandwidth, it is necessarily to transmit the subset of the data packets if the entire set of packets can not be transmitted. "Packet Significance" quantifies the importance of the frame by elaborately incorporating frames' dependency. Greedy approach is used in selecting packets and transmission schedule is determined based on the Packet Significance. The proposed scheme is tested using publicly available MPEG-4 video clips. Decoding engine is embedded in the simulation software and user perceivable QoS is exposeed in termstermiSNR. Throughout the simulation based experiment, the performance of the proposed scheme is compared two other schemes: Size-based packet scheduling and Bit-rate based best effort packet scheduling. SAPS successfully incorporates the semantics of a packet and improves user perceivable QoS significantly. It successfully provides unequal protection to more important packets.