• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.9-19
• /
• 2008

This paper propose the issue of connecting nested NEMO (Network Nobility) networks to global IPv6 networks, while supporting IPv6 mobility. Specifically, we consider a self-addressing including topology information IPv6-enabled NEMO infrastructure. The proposed self-organization addressing protocol automatically organized mobile routers into free architecture and configuration their global IPv6 addresses. BU(binding update) to MR own HA and internal rouging, hosed on longest prefix matching and soft state routing cache, are specially designed for IPv6-based NEMO. In conclusion, numeric analysis ore conducted to show more efficiency of the proposed routing protocols than other RO (Route Optimization) approaches.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.4
• /
• pp.61-68
• /
• 2015

MANET has various vulnerability in wireless network and is more vulnerable in security because central management is not performed. In particular, routing attack may decrease performance of the overall network because the mobile node acts as a router. In this paper, we proposed authentication technique for improving the reliability of the network by increasing the integrity of the routing control packet and blocking effectively attacks that occur frequently in the inside. The proposed technique is consisted of two authentication methods of ZCN and N2N. ZCN authentication method is to elect CA nodes and monitor the role of the CA nodes. N2N authentication method is for an integrity check on the routing packets between nodes. Index key is determined by combining the hop count value to shared key table issued from CA in order to increase the robustness of the internal attack. Also, the overhead of key distribution was reduced by distributing a shared key to nodes certificated from CA. The excellent performance of the proposed method was confirmed through the comparison experiments.

• Convergence Security Journal
• /
• v.13 no.6
• /
• pp.11-16
• /
• 2013

Mobile node must move optionally and perform the router and the host functions at the same time. These characteristics of nodes have become a potential threatening element of a variety of attacks. In particular, a black hole which malicious node causes packet loss among them is one of the most important issues. In this paper, we propose distributed detection technique using monitoring tables in all node and cooperative detection technique based cluster for an efficient detection of black hole attack. The proposed technique performs by dividing into local detection and cooperative detection process which is composed of process of step 4 in order to improve the accuracy of the attack detection. Cluster head uses a black hole list to cooperative detection. The performance of the proposed technique was evaluated using ns-2 simulator and its excellent performance could be confirmed in the experiment result.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1485-1488
• /
• 2008

Lawful Interception (LI) 이란 합법적인 형태의 도청을 말하며, 전통적인 Wired tapping 뿐만 아니라, 최근의 복잡해진 인터넷 및 통신환경의 여러 형태의 데이터들에 대한 감청이 포함 될 수 있다. 미국과 유럽 중심으로 개발 된 감청 표준들은 3 세대 통신망 위주의 감청을 위한 표준들이 대부분이며, 802.16e 기술중의 하나인 모바일 WiMax 를 위한 합법적 감청 표준 개발은 진행 중에 있는 실정이다. 특히, Wibro 와 같이 모바일 유닛(MU)이 Radio Access Contro (RAS)와 Access Control Router (ACR)를 자유롭게 이동하는 상황에서 패킷들에 대한 지속적인 추적은 합법적 감청 분야의 중요한 이슈 중의 하나이다. 따라서, 본 논문에서는 국내의 802.16e/WiBro 네트워크 사용자의 증가 및 그에 따른 보안위협 발생의 가능성 증가에 따라 합법적인 감청을 위한 효과적인 아키텍처를 제안하고자 한다. 본 논문에서 제안하는 아키텍처는 802.16e/WiBro 망내의 합법적 감청을 위하여 네트워크상에서의 효과적인 감청 관련 정보 교환을 위한 기본적인 메커니즘을 포함하고 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.169-177
• /
• 2007

Existing wireless access (mobile) routers are based commonly on the network address and port translation (NAPT) technique which permits simultaneously sharing a subscriber's connection to the network with multiple users. However, the NAPT architecturally makes the users invisible on the network side, thus becoming a user-oriented connection technique. In this paper, we propose a novel service provider-oriented unlicensed nomadic access relay station (WiNNERS) for helping wireless broadband network service providers to make their business more lucrative by accommdating unlicensed band users as subscribers into their network. The WiNNERS offers service providers the capability to directly manage each of the unlicensed band users at the network side. This direct management allows the service providers to flexibly and simply handle QoS, access control, and billing for each user. In order to distinguish each of the unlicensed band users the WiNNERS constructs a virtual tunnel from each user's terminal to the network access router using connection identifiers which is defined for service flow management within the WiBro system, Consequently, our proposed service provider-oriented relay station can be included into the WiBro network system with minimum modifications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.7
• /
• pp.630-642
• /
• 2013

To transmit vital signal stream of mobile patients remotely, it requires mobility of patient and watcher, sensing function of patient's abnormal symptom and self-organizing service binding of related computing resources. In the existing relative researches, the vital signal stream is transmitted as a centralized approach which exposure the single point of failure itself and incur data traffic to central server although it is localized service. Self-organizing middleware platform based on heterogenous overlay network is a middleware platform which can transmit real-time data from sensor device(including vital signal measure devices) to Smartphone, TV, PC and external system through overlay network applied self-organizing mechanism. It can transmit and save vital signal stream from sensor device autonomically without arbitration of management server and several receiving devices can simultaneously receive and display through interaction of nodes in real-time.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.5
• /
• pp.155-162
• /
• 2014

We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.101-110
• /
• 2011

WMN is highlighted as a next generation network technology due to relatively reasonable cost to be built, compared with the pre-existing wireless network. It also enables same kind of network or even other kind of network to be integrated. Some WMN researches support mobility using router protocol such as AODV and DSR because WMN has the similar features with Ad-hoc network in terms of operation. However, WMN has got different operations with additional functions of multi-interface and internet connect, it can't be a good method to manage efficient mobility any more. This study suggests method to apply MAP function of HMIPv6 to WMN as a way to manage WMN mobility. Through simulation, operation was verified and function was appreciated. Through the results of evaluation, the suggest mobility management had shorter handover delay and packet loss reduced, which improved whole network throughput rate, compared with mobility management using AODV.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.241-260
• /
• 2011

In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.632-635
• /
• 2015

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was found superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.