• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2293-2300
• /
• 2008

In ad-hoc sensor network, AODV routing information is disclosed to other nodes because AODV protocol doesn't have any security mechanisms. The problem of AODV is that an attacker can falsify the routing information in RREQ packet. If an attacker broadcasts the falsified packet, other nodes will update routing table based on the falsified one so that the path passing through the attacker itself can be considered as a shortest path. In this paper, we design the routing-information-spoofing attack such as falsifying source sequence number and hop count fields in RREQ packet. And we suggest an efficient scheme for detecting the attackers and isolating those nodes from the network without extra security modules. The proposed scheme doesn't employ cryptographic algorithm and authentication to reduce network overhead. We used NS-2 simulation to evaluate the network performance. And we analyzed the simulation results on three cases such as an existing normal AODV, AODV under the attack and proposed AODV. Simulation results using NS2 show that the AODV using proposed scheme can protect the routing-information-spoofing attack and the total n umber of received packets for destination node is almost same as the existing norm at AODV.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.232-239
• /
• 2009

Emerging social networking services provide a new paradigm for human-to-human communication. However, these services are centralized and managed by single service provider. In this paper, we propose MicroPost, a decentralized event notification service architecture for social applications based on publish/subscribe model. In our design space, event brokers are structured as an overlay network which provides the substrate of distributed peer-to-peer lookup service for storing and retrieving subscriptions with hashed keys. Event clients interact with event brokers to publish or subscribe social messages over the wide-area network. Using XML standards, we present an efficient algorithm to forward events for rendezvous-based matching in this paper. In our design space, the cost of routing is O(${\omega}log_kN$), where N is the number of event brokers, ${\omega}$ is the number of meta-data obtained from event messages, and k is a constant, which is selected by our design, to divide the identifier space and to conquer the lookup of given key. Consequently, what we achieved is an asynchronous social messaging service architecture which is decentralized, efficient, scalable, and flexible.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.383-389
• /
• 2003

In this paper, we propose a solution, called M_DQDMR, for generating delay-constrained boundwidth-appropriated multicast routing trees to reduce the delay and conserved boundwidth resources of nodes in mobile computing environment. At the current router installation, we according the routing table and the information of link which neighboring rude to guarantee QoS(Quality of Service). When we construct multicast tree, M_DQDMR algorithm dynamically adjusts its appropriate tree construction policy based on how far the destination node from the delay bound and boundwidth our QoS requirement. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that M_DQDMR can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve boundwidth resources.

• Journal of Computing Science and Engineering
• /
• v.2 no.4
• /
• pp.412-427
• /
• 2008

We propose ID-exchange protocol for Connectionless Location-Awareness Service (CLAS) to locate mobile nodes in indoor sensor network. When adapting location-awareness service to sensor network, the target system must be designed in accordance with various metrics which reflect the system requirement. We especially consider sustainability of the existing service which has been provided for its original purpose, such as environmental monitoring. The detailed meaning of sustainability here is that, even if location-awareness service is newly added to the existing service, the system must be assured to retain a stable network condition, and to deal with newly caused traffic properly. The CLAS ID-exchange protocol is especially designed for fixture and mobile nodes communication to achieve these properties. The protocol operates on 802.15.4 MAC layer to make mobile node work independently of the procedure to build routing table of fixture node, so a stable routing condition can be achieved even if there are many mobile nodes. Moreover, the dedicated frequency channel is assigned only for this protocol, so that traffic caused by location-awareness service can be distributed to another channel. A real system adapting the protocol was implemented to monitor fire and authorities' positions. We verified the overhead and elapsed time for location-awareness. The result shows the proposed protocol has a high performance in detecting speed, traffic distribution, and stability of overall network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2871-2877
• /
• 2014

Real-time communication and diversification of multimedia application services using high-capacity data over the Internet demand high speed connection, and real-time and high-speed access internet service such as multimedia make Internet traffic increase rapidly. Meanwhile, QoS (Quality of Service) of internet service is not satisfied. In this situation, ISP (Internet Service Provider) has been required to improve service quality and extend network according to the user's needs. This request includes issue of extending network focused on increasing router and the number of routing table as well as simply extending bandwidth.

• Convergence Security Journal
• /
• v.13 no.4
• /
• pp.41-46
• /
• 2013

Routing protocol using in the existing wire network cannot be used as it is for efficient data transmission in MANET. Because it consists of only mobile nodes, network topology is changing dynamically. Therefore, each mobile node must perform router functions. Variety of routing attack like DoS in MANET is present owing to these characteristic. In this paper, we proposed cooperative-based detection method to improve detection performance of flooding attack which paralyzes network by consuming resource. Accurate attack detection is done as per calculated adaptively threshold value considered the amount of all network traffic and the number of nodes. All the mobile nodes used a table called NHT to perform collaborative detection and apply cluster structure to the center surveillance of traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1100-1105
• /
• 2003

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth. Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.628-645
• /
• 2014

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1178-1181
• /
• 2009

Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.889-892
• /
• 2008

최근 이동 중에도 인터넷을 사용하고자하는 사용자의 요구에 맞추어 노드의 이동성을 제공하기 위한 기술들이 개발되고 있다. 그 중 대표적인 기술이 네트워크 계층에서의 이동성 관리 기법인 Mobile IP 기술이다. Mobile IP 기술은 크게 두 가지 분류로 나눌 수 있다. 하나는 호스트가 직접 핸드오프에 대한 시그널링을 수행하는 호스트 기반 이동성 관리 기술이고, 다른 하나는 네트워크 엔터티가 호스트를 대신하여 호스트의 이동에 따른 시그널링을 수행하는 네트워크 기반 이동성 관리 기술이다. 전자의 대표적인 프로토콜은 Mobile IPv6, Fast Mobile IPv6, Hierarchical Mobile IPv6가 있고, 후자의 대표적인 프로토콜은 Proxy Mobile IPv6 기법이 있다. 그 중, 최근 가장 주목 받고 있는 기술은 Proxy Mobile IPv6이다. 네트워크 기반 이동성 관리라는 개념이 서비스 제공자와 기기 제조사에게 모두 이득을 주는 방식이기 때문이다. 하지만 Proxy Mobile IPv6는 아직 개발 중인 기법이라 최적화에 대한 논의가 끝나지 않았다. 특히 Proxy Mobile IPv6 도메인 내에서의 라우팅 최적화에 대한 논의는 활발하게 이루어지고 있다. 본 논문에서는 Proxy Mobile IPv6의 네트워크 엔터티인 Mobile Access Gateway의 라우팅 테이블을 이용한 라우팅 최적화 기법을 제안한다. 또한 제안한 기법이 가져오는 성능향상과 효과에 대해 분석한다.