• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4002-4014
• /
• 2015

ITU-R M.1842-1, as a well-known specification dedicated to maritime mobile applications, has standardized wireless transmission protocols according to the particular characteristics of a maritime communications scenario. A time division multiple access (TDMA) frame structure, along with modulation schemes to achieve a high data rate, has been described clearly in ITU-R M.1842-1. However, several specification items are still under "to be decided" status, which brings ambiguity to research works. In addition, the current version of ITU-R M.1842-1 is focused mainly on maritime transmissions in open-sea areas, where the cyclic prefix (CP) is set to zero and only 16-QAM is used in the multi-carrier (MC) system. System performance might be dramatically degraded in coastline areas due to the inter-symbol interference (ISI) caused by selective fading. This is because there is a higher probability that the signal will be reflected by obstacles in coastline areas. In this paper, we introduce the transmission resource block (TRB) dedicated to ITU-R M.1842-1 for a ship ad-hoc network (SANET), where the pilot pattern of TRB is based on the terrestrial trunked radio (TETRA). After that, we evaluated SANET performance under the maritime channel model in a coastline area. In order to avoid noise amplification and to overcome the ISI caused by selective fading, several strategies are suggested and compared in the channel estimation and equalization procedures, where the link-level simulation results finally validate our proposals.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1153-1160
• /
• 2021

This paper proposes a routing algorithm that determines the optimal path using deep reinforcement learning in software-defined networks. The deep reinforcement learning model for learning is based on DQN, the inputs are the current network state, source, and destination nodes, and the output returns a list of routes from source to destination. The routing task is defined as a discrete control problem, and the quality of service parameters for routing consider delay, bandwidth, and loss rate. The routing agent classifies the appropriate service class according to the user's quality of service profile, and converts the service class that can be provided for each link from the current network state collected from the SDN. Based on this converted information, it learns to select a route that satisfies the required service level from the source to the destination. The simulation results indicated that if the proposed algorithm proceeds with a certain episode, the correct path is selected and the learning is successfully performed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1317-1340
• /
• 2024

With the rapid development of information technology, people's demands on precise indoor positioning are increasing. Wireless sensor network, as the most commonly used indoor positioning sensor, performs a vital part for precise indoor positioning. However, in indoor positioning, obstacles and other uncontrollable factors make the localization precision not very accurate. Ultra-wide band (UWB) can achieve high precision centimeter-level positioning capability. Inertial navigation system (INS), which is a totally independent system of guidance, has high positioning accuracy. The combination of UWB and INS can not only decrease the impact of non-line-of-sight (NLOS) on localization, but also solve the accumulated error problem of inertial navigation system. In the paper, a fused UWB and INS positioning method is presented. The UWB data is firstly clustered using the Fuzzy C-means (FCM). And the Z hypothesis testing is proposed to determine whether there is a NLOS distance on a link where a beacon node is located. If there is, then the beacon node is removed, and conversely used to localize the mobile node using Least Squares localization. When the number of remaining beacon nodes is less than three, a robust extended Kalman filter with M-estimation would be utilized for localizing mobile nodes. The UWB is merged with the INS data by using the extended Kalman filter to acquire the final location estimate. Simulation and experimental results indicate that the proposed method has superior localization precision in comparison with the current algorithms.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.375-383
• /
• 2004

As wireless mobile networks have been widely adopted due to their convenience for deployment, the research for improving their performance has been actively conducted. Since their throughput is restrained by the packet corruption rate not by congestion as in wired networks, however, network simulations for performance evaluation need to select the appropriate wireless channel model representing the behavior of propagation errors for the evaluated channel. The selection of the right model should depend on various factors such as the adopted frequency band, the level of signal power, the existence of obstacles against signal propagation, the sensitivity of protocols to bit errors, and etc. This paper analyzes 10-day bit traces collected from real sensor channels exhibiting the high bit error rate to determine a suitable sensor channel model. For selection, it also evaluates the performance of two error recovery algorithms such as a link layer FEC algorithm and three TCPs (Tahoe, Reno, and Vegas) over several channel models. The comparison analysis shows that CM(Chaotic Map) model predicts 3-time less BER variance and 10-time larger PER(Packet Error Rate) than traces while these differences between the other models and traces are larger than 10-time. The simulation experiments, furthermore, prove that CM model evaluates the performance of these algorithms over sensor channels with the precision at least 10-time more accurate than any other models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1210-1230
• /
• 1997

In this paper, we suggest an architecture of DS/CDMA tranceiver composed of one pilot channel used as reference and multiple traffic channels. The pilot channel-an unmodulated PN code-is used as the reference signal for synchronization of PN code and data demondulation. The coherent demodulation architecture is also exploited for the reverse link as well as for the forward link. Here are the characteristics of the suggested DS/CDMA system. First, we suggest an interlaced quadrature spreading(IQS) method. In this method, the PN coe for I-phase 1st channel is used for Q-phase 2nd channels and the PN code for Q-phase 1st channel is used for I-phase 2nd channel, and so on-which is quite different from the eisting spreading schemes of DS/CDMA systems, such as IS-95 digital CDMA cellular or W-CDMA for PCS. By doing IQS spreading, we can drastically reduce the zero crossing rate of the RF signals. Second, we introduce an adaptive threshold setting for the synchronization of PN code, an initial acquistion method that uses a single PN code generator and reduces the acquistion time by a half compared the existing ones, and exploit the state machines to reduce the reacquistion time Third, various kinds of functions, such as automatic frequency control(AFC), automatic level control(ALC), bit-error-rate(BER) estimator, and spectral shaping for reducing the adjacent channel interference, are introduced to improve the system performance. Fourth, we designed and implemented the DS/CDMA MODEM to be used for variable transmission rate applications-from 16Kbps to 1.024Mbps. We developed and confirmed the DS/CDMA MODEM architecture through mathematical analysis and various kind of simulations. The ASIC design was done using VHDL coding and synthesis. To cope with several different kinds of applications, we developed transmitter and receiver ASICs separately. While a single transmitter or receiver ASC contains three channels (one for the pilot and the others for the traffic channels), by combining several transmitter ASICs, we can expand the number of channels up to 64. The ASICs are now under use for implementing a line-of-sight (LOS) radio equipment.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.27-34
• /
• 2012

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and will be remarkably increased in the near future. For that reason, the energy saving topics of ICT networks are actually studying in various research institutes. This paper studies the possible energy saving methods assuring the QoS of networks on network level. This paper assumed the energy consumption models according to energy profiles of node and link in IP networks. Especially it formulates the energy problem of a minimum energy consumption with various energy profile models and suggests the methods of energy-aware QoS routing under energy saving and network QoS sustaining condition. It shows the large difference of energy saving according to energy profiles and the possibility of energy saving by using the appropriate energy profile model in the simulation experiment. This paper shows that min_used_path(MP) heuristic of energy-aware QoS routing is the excellent method compared with other heuristic methods as view of reduction ratio of nodes and links and energy saving effect under network QoS sustaining condition. As a result, this paper confirms that the min_used_path(MP) heuristic of energy-aware QoS routing can get energy saving and sustaining of network QoS in IP networks.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.282-292
• /
• 2003

This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.31 no.4
• /
• pp.173-181
• /
• 2018

Recently composite materials have dominated most engineering fields, owing to their better performance, increased durability and flexibility to be customized and designed for a specific required property. This has given them unprecedented superiority over conventional materials. With the help of the ever increasing computational capabilities of computers, researchers have been trying to develop accurate material models for the complex and integrated properties of these composites. This has led to advances in virtual testing of composite materials as a supplement or a possible replacement of laboratory experiments to predict the properties and responses of composite materials and structures. This paper presents a review on the complex multi-scale modelling framework of the virtual testing machines, which involve computational mechanics at various length-scales starting with nano-mechanics and ending in structure level computational mechanics, with a homogenization technique used to link the different length scales. In addition, the paper presents the features of some of the biggest integrated virtual testing machines developed for study of concrete, including a multiscale modeling scheme for the simulation of the constitutive properties of nanocomposites. Finally, the current challenges and future development potentials for virtual test machines are discussed.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.1
• /
• pp.64-71
• /
• 2020

eFuse OTP memory IP is required to trim the analog circuit of the gate driving chip of the power semiconductor device. Conventional NMOS diode-type eFuse OTP memory cells have a small cell size, but require one more deep N-well (DNW) mask. In this paper, we propose a small PMOS-diode type eFuse OTP memory cell without the need for additional processing in the CMOS process. The proposed PMOS-diode type eFuse OTP memory cell is composed of a PMOS transistor formed in the N-WELL and an eFuse link, which is a memory element and uses a pn junction diode parasitic in the PMOS transistor. A core driving circuit for driving the array of PMOS diode-type eFuse memory cells is proposed, and the SPICE simulation results show that the proposed core circuit can be used to sense post-program resistance of 61㏀. The layout sizes of PMOS-diode type eFuse OTP memory cell and 512b eFuse OTP memory IP designed using 0.13㎛ BCD process are 3.475㎛ × 4.21㎛ (= 14.62975㎛2) and 119.315㎛ × 341.95㎛ (= 0.0408mm2), respectively. After testing at the wafer level, it was confirmed that it was normally programmed.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.656-667
• /
• 2003

Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as MTCP and TRAMCC are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, TMRCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network condition changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly The performance of the proposed scheme is evaluated using ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra- session fairness and shows good level of responsiveness, TCP-friendliness, and scalability. In addition, we implemented the proposed scheme by integrating with GAM that is one of many-to-many reliable multicast protocols and evaluated the performance in a laboratory-wide testbed.