• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1447-1454
• /
• 2017

The realtime test data topic means that process for the data efficiently from many kinds of measurement device at the test range. There are many measurement devices in test range. The test range require accurate observation and determine on test object. In this realtime test data slaving framework system, the system can produce variety of test informations and all these data also must be transmitted to test information management or display system in realtime. Using RTI DDS(Data Distribution Service) middle ware Ver 5.2, we can product the efficiency of system usability and QoS(Quality of Service) requirements. So the application user enables to concentrate on applications, not middle ware. As the reason, Complex function is provided by the DDS, not the application such as Visualization Software. In this paper, I suggest the realtime test data topic on slaving framework of realtime test data based on DDS at the test range system.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.1-7
• /
• 2020

In modern society, as technology has advanced and human life area has expanded, there has been an increasing demand for high-quality voice and video communications services without restrictions on time and place. In response to this demand, satellite communications systems that provide a wide range of communications and that offer multiple access are evolving day by day. In satellite communications systems such as Digital Video Broadcasting - Return Channel Via Satellite (DVB-RCS) and Warfighter Information Network-Tactical (WIN-T), the multi-frequency time division multiple access (MF-TDMA) demand assigned multiple access (DAMA) scheme is used for efficient resource allocation. In this scheme, since the satellite terminals periodically request resources from the network controller, and the network controller dynamically allocates resources, it is necessary to arrange resource allocation information from time to time. Shortening of the alignment time is a more important factor in a satellite communications system in which a long transmission delay occurs due to long-distance transmission and reception. In this paper, we propose a sorting algorithm variable-selection scheme that shortens the sorting time by cross-selecting the sorting algorithm based on a threshold value, while setting the number of frames in the MF-TDMA DAMA satellite communications system as the threshold value.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.751-759
• /
• 2008

Carrier Ethernet backbone network integrates distributed layer-2 based metro networks. In this networks, Multiple Spanning Tree Protocol (MSTP) has been uscd as a main routing protocol that allows multiple spanning trees in a network. A better routing protocol called IEEE802.1aq - Shortest Path Bridging (SPB) is recently proposed, that generates the shortest spanning tree per a destination node. As SPB provides a routing path per a destination node, there is no way to adapt network traffic at normal condition. If we are free from the principle of "a spanning tree per a destination node", we can achieve adaptive routing. Based on this philosophy, we propose a new spanning tree based protocol - Edge Node Divided Spanning Tree (ENDIST). ENDIST divides an edge node into sub-nodes as many as connecting links from the node and each sub-node generates a single shortest path tree based on SPB. Depending on network or nodal status, ENDIST chooses a better routing path by flow-basis. This added traffic engineering ability contributes to enhanced throughput and reduced delay in backbone networks. The simulation informs us that ENDIST's throughput under heavy load performs about 3.4-5.8 and 1.5-2.0 times compared with STP's and SPB's one respectively. Also, we verified that ENDIST's throughput corresponds to the theoretical upper bound at half of cases we investigated. This means that the proposed ENDIST is a dramatically enhanced and the close-to-perfect spanning tree based routing schemes.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.12
• /
• pp.427-436
• /
• 2016

Due to disasters such as earthquakes and landslides in urban areas, persons have been buried inside collapsed buildings and structures. Rescuers have mainly utilized detection equipment by applying sound, video and electric waves, but these are expensive and due to the directional approaches onto the collapsed site, secondary collapse risk can arise. In addition, due to poor utilization of such equipment, new human detection technology with quick and high reliability has not been utilized. To address these issues, this study develops a wireless signal-based human detection module that can be loaded into an Unmanned Aerial Vehicle (UAV). The human detection module searches for the 3D location for buried persons by collecting Wi-Fi signal and barometer sensors data transmitted from the mobile phones. This module can gain diverse information from mobile phones for buried persons in real time. We present a development framework of the module that provides 3D location data with more reliable information by delivering the collected data into a local computer in the ground. This study verified the application feasibility of the developed module in a real collapsed area. Therefore, it is expected that these results can be used as a core technology for the quick detection of buried persons' location and for relieving them after disasters that induce building collapses.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.12-21
• /
• 2012

IEEE 802.11 MAC protocol standard, DCF(CSMA/CA), is originally designed to ensure the fair channel access between mobile nodes sharing the local wireless channel. It has been, however, revealed that some misbehavior nodes transmit more data than other nodes through artificial means in hot spot area spreaded rapidly. The misbehavior nodes may modify the internal process of their MAC protocol or interrupt the MAC procedure of normal nodes to achieve more data transmission. This problem has been referred to as a selfish node problem and almost literatures has proposed methods of analyzing the MAC procedures of all mobile nodes to detect the selfish nodes. However, these kinds of protocol analysis methods is not effective at detecting all kinds of selfish nodes enough. This paper address this problem of detecting selfish node using Tsallis-Entropy which is a kind of statistical method. Tsallis-Entropy is a criteria which can show how much is the density or deviation of a probability distribution. The proposed algorithm which operates at a AP node of wireless LAN extracts the probability distribution of data interval time for each node, then compares the one with a threshold value to detect the selfish nodes. To evaluate the performance of proposed algorithm, simulation experiments are performed in various wireless LAN environments (congestion level, how selfish node behaviors, threshold level) using ns2. The simulation results show that the proposed algorithm achieves higher successful detection rate.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.799-806
• /
• 2004

A growing diversity of pervasive devices is gaming access to the Internet and other information. However, much of the rich multimedia contents cannot be easily handled by the client devices because of the limited communication, processing, storage and display capabilities. The in-tegration of voice, data and video service modified the target of networking technologies. Networks must have some the capabilities for in-tegration of various services and also for QoS support as required by each of those service. Because of these reasons, we developed EAGIS(Efficient ATM Gateway for real time Internet Service) to provide seamless multimedia service between the ATM network and the Internet. EAGIS consists of the interworking unit, content server, transcoding server, and the serveice broker to provide seamless multimedia service be-tween the ATM network and the Internet. In this paper, we design the architecture and transcoding service scenario of the EAGIS. When the RTP is used for the bi-directional communication, transcoding time is configured by the time-stamp of RTCP. When HTTP is used for unidirec-tional communication, self-timer is used. By using these reference time, standard transcoding method is applicable according to the frame trans-mission rate and network traffic load. And we can also assure the QoS of the multiple users` effective bandwidth by our algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.42-48
• /
• 2002

In broadband wireless networks, the effective meeting of the QoS guarantees may strongly depend on the Contention Resolution Algorithm used in the uplink contention period. The time it takes a station to transmit a successful request to the base station, or request delay, must be kept low even during periods of high contention. If a request suffers many collisions, it cannot rely on the preemptive scheduler to receive low access delays. However, the conventional collision resolution algorithm has a problem that all collided stations are treated equally regardless of their delay from previous contention periods. Some requests may have very long request delay caused by continuous collisions. In this paper, we propose an adaptive collision resolution algorithm for fast random access in broadband wireless networks. The design goal is to provide quick access to the request with a high number of collisions. To do this, the proposed algorithm separates the whole contention region into multiple sub regions and permits access through each sub region only to the requests with equal number of collisions. The sub region is adaptively created according to the feedback information of previous random access. By simulation, the proposed algorithm can improve the performance in terms of throughput, random delay and complementary distribution of random delay by its ability to isolate higher priorities from lower ones. We can notice the algorithm provides efficiency and random access delay in random access environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2181-2190
• /
• 1997

The synchronous stream cipher has the problem of synchronization loss by cycle slip. Synchronization loss make the state which sender and receiver can't communicate and it may make the receiving system disordered. To lessen the risk, we usually use a continuous resynchronization which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get effectively resynchronizationby continuous resynchronization, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using LAPB protocol. It is able to solve the problem of the continunous resynchronization.The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of LAPB. It measure the receiving rate of the address field in the decesion duration. If the receiving rate is smaller than threshold value, it make resynchronization or not. By using adaptively resynchronization, it solves the problems of continunous resynchronization. When the proposed adaptive algorithm is applied to the synchronous stream cipher system which is used in X.25 packet network, it reduced the time for resynchronization by ten times. It means that 11.3% of total data for transmit is compressed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.378-387
• /
• 2003

Digital watermarking is the technique that embeds invisible signalsincluding owner identification information, specific code, or pattern into multimedia data such as image, video and audio. Watermarking techniques can be classified into two groups; robust watermarking and fragile(semi-fragile) watermarking. The main purpose of the robust watermarking is the protection of copyright, whereas fragile(semi-fragile) watermarking prevents image or video data from illegal modifications. To achieve this goal watermark should survive from unintentional modifications such as random noise or compression, but it should be fragile for malicious manipulations. In this paper, an invertible semi-fragile watermarkingalgorithm for authentication and detection of manipulated location in MPEG-2 bit-stream is proposed. The proposed algorithm embeds two kinds of watermarks, which are embedded into quantized DCT coefficients. So it can be applied directly to the compressed bit-stream. The first watermark is used for authentication of video data. The second one is used for detection of malicious manipulations. It can distinguish transcodingin bit-stream domain from malicious manipulation and detect the block-wise locations of manipulations in video data. Also, since the proposed algorithm has an invertible property, recovering original video data is possible if the watermarked video is authentic.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.12-26
• /
• 2004

In the past, geographic data is constructed and serviced through independent formats of its own according to each GIS(Geographic Information System). Recently the provision of interoperability in GIS is important to efficiently apply the various geographic data between conventional GIS's. Whereupon OGC(Open GIS Consortium) proposed GML(Geography Markup Language) to offer the interoperability between heterogeneous GISs in distributed environments. The GML is an XML encoding for the transport and storage of geographic information, including both the spatial and non-spatial properties of geographic features. Also, the GML includes Web Map Server Implementation Specification to service the GML documents. Accordingly the prototype to provide the reciprocal interchange of geographic information between conventional GIS's and GML documents is widely studied. In this paper, we propose a mapping method of geographic in formation between spatial database and GML for the prototype to support the interoperability between heterogeneous geographic information. For this method, firstly the scheme of converting geographic in Formation of the conventional spatial database into the GML document according to the GML specification is explained, and secondly the scheme to transform geographic information of GML documents to geographic data of spatial database is showed. Consequently, the proposed method is applicable to the framework for integrated geographic information services based on Web by making an offer the interoperability between already built geographic information of conventional GIS's using a mapping method of geographic information between spatial database and GML.