• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.888-893
• /
• 2012

Quality of Service (QoS) provisioning is an important issue in the design of next generation wireless network. In visible light communication (VLC) networks, link switching is a solution to maintain or improve the quality of communication. In this paper, we propose a novel link switching scheme using the location of mobile nodes (MNs). The current serving transmitter uses location history of the MN to find out which neighbor transmitter the MN is approaching. This neighbor transmitter is chosen to inform the MN as the next serving transmitter. The simulation results show that our proposed scheme gains better performance than non-predictive link switching scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.2
• /
• pp.382-389
• /
• 2009

As the use of mobile device is popularized, the needs of variable services of WiMAX technique and the importance of security is increasing. There is a problem that can be easily attacked from a malicious attack because the action is achieved connectionlessly between neighbor link establishing procedure and TEK exchange procedure in mobile WiMAX even though typical 1 hop network security technique is adapted to WiMAX for satisfying these security requirement. In this paper, security connected mechanism which safely connects neighbor link establishing procedure of WiMAX and TEK exchange procedure additional to the basic function provided by IEEE 802.16e standard to satisfy security requirement of mobile WiMAX is proposed. The proposed mechanism strengthens the function of security about SS and BS by application random number and private value which generated by SS and BS to public key of neighbor link establishing procedure and TEK exchange procedure. Also, we can prevent from inside attack like man-in-the-middle which can occur in the request of TEK through cryptographic connection of neighbor link establishing procedure and TEK exchange procedure.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.771-772
• /
• 2006

IPv6 nodes use the Neighbor Discovery Protocol (NDP) to discover other nodes on the link, to determine their link-layer addresses to find routers, and to maintain reachability information about the paths to active neighbors. If not secured, NDP is vulnerable to various attacks. This document specifies security mechanisms for NDP. Unlike those in the original NDP specifications, these mechanisms do not use IPsec.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2223-2242
• /
• 2019

Distance Vector-Hop (DV-Hop) algorithm is widely used in node localization. It often suffers the wormhole attack. The current researches focus on Double-Wormhole-Node-Link (DWNL) and have limited attention to Multi-Wormhole-Node-Link (MWNL). In this paper, we propose a security DV-Hop algorithm (AMLDV-Hop) to resist MWNL. Firstly, the algorithm establishes the Neighbor List (NL) in initialization phase. It uses the NL to find the suspect beacon nodes and then find the actually attacked beacon nodes by calculating the distances to other beacon nodes. The attacked beacon nodes generate and broadcast the conflict sets to distinguish the different wormhole areas. The unknown nodes take the marked beacon nodes as references and mark themselves with different numbers in the first-round marking. If the unknown nodes fail to mark themselves, they will take the marked unknown nodes as references to mark themselves in the second-round marking. The unknown nodes that still fail to be marked are semi-isolated. The results indicate that the localization error of proposed AMLDV-Hop algorithm has 112.3%, 10.2%, 41.7%, 6.9% reduction compared to the attacked DV-Hop algorithm, the Label-based DV-Hop (LBDV-Hop), the Secure Neighbor Discovery Based DV-Hop (NDDV-Hop), and the Against Wormhole DV-Hop (AWDV-Hop) algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.8
• /
• pp.17-29
• /
• 1999

Inter-Satellite Links(ISL) technique in the Polar Orbit Satellite plays the key role in the communication methods in IRIDIUM system, where the ISL is commonly established between neighbor satellites. The system has major drawbacks in maintaining the multi-hopping link connectivities while the satellite nodes are communicating each other. The proposed system is newly designed to allow diagonal link connections between the satellites and shows how it does improve the performance. The optimized number of satellites in the terms of their altitudes and visible distance are calculated. The traffic parameters and the probability of blocking are analyzed to compare the visible satellite link method with the neighbor link method mathermatically.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.53-60
• /
• 2012

Nearest-neighbor classification predicts the class of an input data with the most frequent class among the near training data of the input data. Even though nearest-neighbor classification doesn't have a training stage, all of the training data are necessary in a predictive stage and the generalization performance depends on the quality of training data. Therefore, as the training data size increase, a nearest-neighbor classification requires the large amount of memory and the large computation time in prediction. In this paper, we propose a prototype selection algorithm that predicts the class of test data with the new set of prototypes which are near-boundary training data. Based on Tomek links and distance metric, the proposed algorithm selects boundary data and decides whether the selected data is added to the set of prototypes by considering classes and distance relationships. In the experiments, the number of prototypes is much smaller than the size of original training data and we takes advantages of storage reduction and fast prediction in a nearest-neighbor classification.

• Journal of Intelligence and Information Systems
• /
• v.21 no.3
• /
• pp.37-52
• /
• 2015

The recent global trends display expansion and growing solidity in both cooperative collaboration between industry, education, and research and R&D network systems. A greater support for the network and cooperative research sector would open greater possibilities for the evolution of new scholar and industrial fields and the development of new theories evoked from synergized educational research. Similarly, the national need for a strategy that can most efficiently and effectively support R&D network that are established through the government's R&D project research is on the rise. Despite the growing urgency, due to the habitual dependency on simple individual personal information data regarding R&D industry participants and generalized statistical data references, the policies concerning network system are disappointing and inadequate. Accordingly, analyses of the relationships involved for each subject who is participating in the R&D industry was conducted and on the foundation of an educational-industrial-research network system, possible changes within and of the network that may arise were predicted. To predict the R&D network transitions, Common Neighbor and Jaccard's Coefficient models were designated as the basic foundational models, upon which a new prediction model was proposed to address the limitations of the two aforementioned former models and to increase the accuracy of Link Prediction, with which a comparative analysis was made between the two models. Through the effective predictions regarding R&D network changes and transitions, such study result serves as a stepping-stone for an establishment of a prospective strategy that supports a desirable educational-industrial-research network and proposes a measure to promote the national policy to one that can effectively and efficiently sponsor integrated R&D industries. Though both weighted applications of Common Neighbor and Jaccard's Coefficient models provided positive outcomes, improved accuracy was comparatively more prevalent in the weighted Common Neighbor. An un-weighted Common Neighbor model predicted 650 out of 4,136 whereas a weighted Common Neighbor model predicted 50 more results at a total of 700 predictions. While the Jaccard's model demonstrated slight performance improvements in numeric terms, the differences were found to be insignificant.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.61-64
• /
• 2001

The concept of IPv6 stateless address autoconfiguration lends itself easily to mobile ad hoc networks. However, the Neighbor Discovery protocol (NDP)-based mechanism described in [1] does not fit well for the multi-link environments in the mobile ad hoc network. In this document, we extend the current SAA mechanism to be suitable for mobile ad hoc networks.

• Journal of Korean Society of Transportation
• /
• v.26 no.2
• /
• pp.101-107
• /
• 2008

Traffic speed data may be missed due to detector malfunction or network problems. In this paper we have proposed effective methods to estimate the data which could not be collected through loop detectors. Our proposed algorithm has three steps. First step is to find the most similar neighbor data record by coefficient of correlation. Second step is to make some data records which is calculated by the 5 kinds of estimation methods. Third step is to compare the data records with history data record of observation link and thus the best method is selected. The proposed method is useful for estimating travel time.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.415-422
• /
• 2007

In this paper, we proposed a new dynamic channel allocation algorithm for TD-SCDMA with cross time slots. In order to reduce the interference in cross time slot, the mobile stations (MSs) are divided into two groups: the Near Group consisting of MSs near by the base station(BS) and the Far Group including the MSs far from the BS. The reverse link for MSs in the Near Group and forward link for MSs in the Far Group are allocated to the cross time slot. In cellular systems, a BS has multiple neighbor BSs. Some of neighbor BSs can operate in the same direction link while the others have cross time slot. Thus, it is required to determine which BS has the most significant impact in terms of interference. We divide each cell into 6 areas based on the direction of arrival of smart antenna and the most significant neighbor sector is determined with this division. The proposed allocation method and area division method can avoid the severe interference in cross time slots and increase the system capacity about 2%~9% compared to FCA, and 0.5%~1.3% compared to RCA.