• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.101-108
• /
• 2007

Parallel processing algorithms, coupled with advanced networking and distributed computing architectures, improve the overall computational performance, dependability, and versatility of a digital signal processing system In this paper, novel parallel algorithms are introduced and investigated for advanced sonar algorithm, conventional matched-field processing (CMFP). Based on a specific domain, each parallel algorithm decomposes the sequential workload in order to obtain scalable parallel speedup. Depending on the processing requirement of the algorithm, the computational performance of the parallel algorithm reveals different characteristics. The high-complexity algorithm, CMFP shows scalable parallel performance on the array of DSP processors. The impact on parallel performance due to workload balancing, communication scheme, algorithm complexity, processor speed, network performance, and testbed configuration is explored.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.251-255
• /
• 2009

Network coding is a promising technology that increases the system throughput via reducing the number of transmission for a packet delivered from the source node to the destination node. Nevertheless, it suffers from the metrics of end-to-end delay. Network Coding scheme takes more processing delay which occurs as coding node encodes (XOR) a certain number of packets that relayed by the coding node, and more queuing delay which occurs as a packet waits for other packets to be encoded with. Therefore, in this paper, we analyze the dependency of the queuing delay to the arrival rate of each packet. In addition, we analyze and compare the delay in DCF without XOR and DCF with XOR under dynamic traffic.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.231-242
• /
• 2009

The EPC-Discovery Service (EPC-DS) is a good representative of the RFID Track & Trace. But this mechanism has several problems. EPC-DS uses centralized server scheme which may arise bottle-neck state and that cannot provide detail trace information of a RFID object. In addition, a trace node requires direct access method to a RFID object or an element which has information of the RFID object for Track & Trace. In this paper, we propose a novel RFID Track & Trace mechanism which based on the SIP presence model and SIP event notification. This mechanism can provide detail trace information and monitoring function, and also can rid the bottle-neck section by combination of SIP methods instead of centralized element.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1487-1493
• /
• 2016

The susceptible, exposed, infectious, and recovered model (SEIR) is used extensively in the field of epidemiology. On the other hand, dissemination information among users through internet grows exponentially. This information spreading can be modeled as an epidemic. In this paper, we derive the mathematical model of SEIR in viral communication from the view of optimal control theory. Overall the methods based on classical calculus, In order to solve the optimal control problem, proved to be more efficient and accurate. According to Pontryagin's minimum principle (PMP) the Hamiltonian function must be optimized by the control variables at all points along the solution trajectory. We present our method based on the PMP and forward backward algorithm. In this algorithm, one should integrate forward in time for the state equations then integrate backward in time for the adjoint equations resulting from the optimality conditions. The problem is mathematically analyzed and numerically solved as well.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.146-157
• /
• 2004

In order to provide continuous QoS guaranteed to a mobile user, it is required to deploy some kind of mechanisms which reserves resources in advance at the locations to which the mobile user is expected to move. An important issue with regards to these mechanisms is to minimize the waste of resources caused by redundant reservations while keeping up the QoS guaranteed services to the user In this paper, we propose a wireless network domain structure which deploys a special cell, called “a gray cell”. The boundaries of two or more neighboring domains are surrounded by the gray cells, and the gray cells are supposed to belong to all of its neighboring domains. Based on this wireless domain structure, we propose a mechanism which completely removes the waste of redundant resource reservation in the wireless network domain while greatly reducing the risk of reservation disruption caused by inter-domain handover. Using simulation, it is shown that the proposed mechanism can deal with inter-domain handover as effectively as it does with intra-domain handover. It is also presented that the proposed mechanism outperforms existing mechanisms with respect to reservation disruption time and packet losses caused by handovers.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.156-164
• /
• 2006

The SCTP (Stream Control Transmission Protocol) implementation with the DAR (Dynamic Address Reconfiguration) extension is called the mSCTP (Mobile SCTP) that is proposed recently for mobility support in transport layer. The mSCTP does not satisfy short handover latency for real-time applications and it has no specific handover decision mechanisms. In this paper, we propose fast handover schemes for mobile nodes that are moving into different subnet using pre-acquisition RA (Router Advertisement) and L3 trigger for improving handover performance. Furthermore, we introduce three specific methods which are RA cache, FMIPv6 (Fast Handovers for Mobile IPv6) and dual interface and how proposed scheme can be interoperated with handover process respectively. Finally, we show two experimental results which are the mSCTP and the mSCTP using FMIPv6 on Linux platforms. Experimental results show that handover performance is improved with reducing the time of receiving RA which takes most of total handover latency.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.131-138
• /
• 2006

To achieve security in wireless sensor networks(WSN), it is important to be able to encrypt and authenticate messages sent among sensor nodes. Due to resource constraints, many key agreement schemes used in general networks such as Diffie-Hellman and public-key based schemes are not suitable for wireless sensor networks. The current pre-distribution of secret keys uses q-composite random key and it randomly allocates keys. But there exists high probability not to be public-key among sensor nodes and it is not efficient to find public-key because of the problem for time and energy consumption. To remove problems in pre-distribution of secret keys, we propose a new cryptographic key management protocol, which is based on the clustering scheme but does not depend on probabilistic key. The protocol can increase efficiency to manage keys because, before distributing keys in bootstrap, using public-key shared among nodes can remove processes to send or to receive key among sensors. Also, to find outcompromised nodes safely on network, it selves safety problem by applying a function of lightweight attack-detection mechanism.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.196-206
• /
• 2004

In the Next Generation Internet(NGI) backbone network, a Dense Wavelength Division Multiplexing (DWDM) technology has been more and more highlighted to cover the increasing subscribers and bandwidth requirement. For such a DWDM network, Routine and Wavelength Assignment (RWA) is the essential problem to establish the optimal path and assign a wavelength efficiently to the selected path in resource utilization. However, the existing RWA algorithms do not consider the congestion in the network so that the performance of then is so limited. To solve this problem, in this paper, we introduce a new RWA algorithm, called Multi Wavelength-Minimum Interference path Routing (MW-MIPR) that establishes a routing path to minimize the interference for many potential future connection setup request. And then, we also propose a wavelength-routed QoS routing scheme based on differentiated QoS classes with applying MW-MIPR algorithm. Simulation results are also given to prove the efficiency of the proposed algorithms.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.243-251
• /
• 2004

This paper proposes a digital image watermarking scheme, which is robust to geometrical attacks. The method improves image normalization-based watermarking (INW) technique that doesn't effectively deal with geometrical attacks with cropping. Image normalization is based on the moments of the image, however, in general, geometrical attacks bring the image boundary cropping and the moments are not preserved original ones. Thereafter the normalized images of before and after are not same form, i.e., the synchronization is lost. To solve the cropping problem of INW, Invariant Centroid (IC) is proposed in this paper. IC is a gravity center of a central area on a gray scale image that is invariant although an image is geometrically attacked and the only central area, which has less cropping possibility by geometrical attacks, is used for normalization. Experimental results show that the IC-based method is especially robust to geometrical attack with cropping.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.192-201
• /
• 2014

User scheduling boosts the Multi-User Multi-Input Multi-Output (MU-MIMO) gain by selecting an optimal set of users to increase the 802.11 Wi-Fi system capacities. Many kinds of user scheduling algorithms, however, fail to realize the advantages of MU-MIMO due to formidable Channel State Information (CSI) overhead. In this paper, we propose a user scheduling method considering such CSI exchange overhead and its MAC protocol, called ACE (Active CSI Exchange based User Scheduling for MU-MIMO Transmission). Unlike most proposals, where user scheduling is performed after an Access Point (AP) receives CSI from all users, ACE determines the best user set during the CSI exchange phase. In particular, the AP broadcasts a channel hint about previously scheduled users, and the remaining users actively send CSI reports according to their Effective Channel Gains (ECGs) calculated from the hint. Through trace-driven MATLAB simulations, we prove that the proposed scheme improves the throughput gain significantly.