• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.334-342
• /
• 2014

Military communications for future warfare have limited resources but highly requirements. MANET has a lot of advantages for future military network due to easily deploying without infrastructure and supporting dynamic topology in restricted environments. But, one of the biggest issues for MANET is difficulty of transmitting data due to link failure in dynamic topology. Content Centric Networking is a future Internet paradigm which solves various IP network problem. In this paper, we propose a future military communication routing scheme using CCN in military tactical MANET. Simulation results show our scheme gets lower control message overhead and faster data downloads as number of node increases and mobile speed increases than other two schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.514-524
• /
• 2005

In optical burst switching(OBS) networks, the ingress edge router assembles packets in the same class queue into the appropriate size of burst. A burst control packet(BCP) is generated for channel reservation of corresponding data burst and sent earlier than the corresponding data burst with an offset time. Offset time is determined considering the number of hops from source to destination and the required quality of service(QoS). After offset time, the burst data is passed through tile pre-configured optical switches without any O/E/O conversion. But a failure in OBS networks may lead to the loss of bursts until the ingress nodes receive the failure indication signal. This results in a significant degradation in QoS. Therefore, in this paper, we propose a fault-tolerant node architecture based on sub-carrier multiplexing to reduce the effects of failure in OBS networks. The Performance of the proposed fault-tolerant node architecture exhibits considerable improvement as compared with the previous ones.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.367-380
• /
• 2013

A secure data gathering in a Wireless Sensor Network(WSN) has given attention to one of security issues. In general, the process of secure data gathering causes difficulties: one process is exchanging the secured data and the other is constructing secured data path. The previous studies have been resolving the difficulties in terms of two problems: security and data gathering in WSNs. However, a WSN requires a protocol that has to guarantee a security of path between sensors and sink, or a cluster head. Thus how to gather data securely is an important issue. In this paper, we propose a secure data gathering protocol over WSNs, which consists of hierarchical key settlement and secure path construction, and aims at tackling two problems. The proposed protocol causes little overhead to sensor nodes for secured key settlement and path construction. This work provides security analysis focused on the key settlement protocol and evaluates network performance for the proposed data gathering protocol through simulation.

• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.182-196
• /
• 2008

The location estimation using sensor network has been considerably researched. The methods taking the differences of the forms of location estimation between indoors and outdoors into consideration have been studied. While it is possible for outdoor location to be estimated because outdoor location estimation has a consistent distribution during unit period through the value of RSSI(Received Signal Strength Indication) on outdoor location estimation, Indoor location estimation is difficult since multi-path and interference indoors are higher than those outdoors and indoor location estimation can be affected by other factors. In this paper, we revise the information of RSSI changed by multi-path and interference through the Moving Average method and K-means algorithm and propose the method of estimation for the value of RSSI with reliability in the group of signals received during unit period. We also suggest the way to put some weights on fixed nodes in network using a snooping node on location estimation and then evaluate the efficiency of location awareness as compared with the existing method by implementing proposed method on system through the reconfiguration of network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.607-614
• /
• 2016

In generating station, cable spreading design is a very important task, which is very much time consuming, due to the type of cable used in generating station is very diverse. The raceway means the cable line section from source equipment to destination, and consists of cable tray and conduit. The process of existing cable spreading design was written in by hand. Thereby, there are grossly inefficient gain such as cable omission and unfixed fill value by a personal and time investment. In this paper, we proposed and implemented the automated cable route design based flexible cable fill check in generating station, and proposed the automated cable route design can be calculated the cable fill with flexible changing of raceway. Some experimental result shows that implemented cable route design is well performed and conducted as the design specifications, and it will be able to reduce the cable spreading design time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.27-37
• /
• 2003

In the next generation Internet(NGI) based on dense wavelength division multiplexing(DWDM) technology, QoS RWA considering various QoS parameters of DWDM networks is regard as one of the key issues in providing real-time multimedia services. However, finding a qualified path meeting multi-constraints is generally NP-complete problem. It is insufficient for QoS RWA researches in DWDM networks that must consider QoS parameter as well as wavelength-continuity constraint. This paper proposes qualified path routing (QPR) algorithm with minimum computation and implementation complexity based on flooding method to accomplish QoS routing and wavelength assignment (RWA). We also introduce a QoS-based RWA mechanism considering multi-constraint such as optical signal quality attributes, survivability and wavelength-continuity constraint combined with proposed routing algorithm. Simulation results show superior efficiency of the proposed algorithms in terms of blocking probability, routing overhead and survivability ratio.

• The Journal of the Korea Contents Association
• /
• v.11 no.10
• /
• pp.457-466
• /
• 2011

In general, drivers need a self-interest information to decide their routes. So, non-governmental sectors, such as Internet Portal Company, make and provide user-oriented contents for drivers in a hurry. But, VMS which is the typical public media always provides traffic-information for drivers without weighting personal characteristics and considering transportation conditions. So in this research, we searched importance and preference of traffic-information contents as IPA(Importance-Performance Analysis)result. We can draw the conclusion that the improvement of traffic-information contents focused on users(drivers) is needed. Specially, we proposed the strategy of VMS according to traffic conditions.

• Journal of Navigation and Port Research
• /
• v.37 no.5
• /
• pp.487-492
• /
• 2013

Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes, LDPC codes and convolutional code based on BCJR algorithm are dominant channel coding schemes in recent. Therefore this paper analyzed the performance of iterative codes based on turbo equalizer with the same coding rate and similar codeword length. The performances of three kinds of iterative codes were evaluated in the environment of underwater acoustic communication channel that are real data collected in Korean east sea. The distance of transmitter and receiver was 5Km and data rate was 1Kbps. As a result, convolutional code based on BCJR algorithm has better performance in underwater channel than turbo codes and LDPC codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1148-1161
• /
• 2012

Recently, developments in the field of communication and network technologies induced new paradigm in the defense weapon system. As a consequence, military authorities develop the Tactical Information Communication Network(TICN) system to adapt to the changing paradigm. One of the most important functions of TICN is real-time communication. As a result, TICN system needs to receive real-time information from the battlefield, and the key technology to support these features is MANET(Mobile Ad-Hoc Network) routing protocol. In this paper, we analyze problems of the shortest path scheme in tactical Ad-Hoc networks, which is widely used in common Ad-Hoc networks. We propose efficient routing protocol for tactical MANET by considering the environment of small combat units, such as node position, speed and data size. The proposed algorithm shows reliable data transfer and low latency in battlefield.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1120-1129
• /
• 2006

It is very important to maximize the battery durability of mobile host in wireless ad-hoc network environments, because it extends the durability and Performance of the system. Since mobile hosts play a routing role, the network structure and the location of mobile hosts create a difference of energy consumption of mobile hosts. In this paper, each mobile host maintains energy tree and evaluates the amount of the energy of the neighboring mobile hosts by using message tree packet by periods. When mobile host sets up a routing path to send a packet, it selects the most proper path in order to consume energy effectively by using energy tree and breadth first search. In this paper, we suggest that, in wireless ad-hoc network environments, if each mobile host consumes balanced energy, mobile hosts of which energy capacity is limited can work as long as it can. Therefore, the durability and performance of the system can be extended.