• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.327-334
• /
• 2004

In this paper, we make MAC protocol improvements for performance enhancement of multi-hop ad-hoc wireless networks. A node in ad-hoc wireless networks can transmit a packet only when the medium is available, and while a packet is being transmitted, no other nodes are allowed to transmit a packet if they are in carrier sensing range. Carrier sensing range can be divided into two disjoint areas of transmission range and carrier sensing zone(9), and we address the importance of the protocol behavior when a node is in carrier sensing zone. The characteristic of the carrier sensing zone is that a node can not know when the remaining time of the on-going transmission session expires or exactly when the media becomes available. Current MAC protocol does not behave in much different way between when a node is in transmission range and in carrier sensing zone. We have conducted a comprehensive simulation to study the performance improvements. The simulation results indicate that the performance is increased and the number of dropped packets due to collision is significantly reduced as much as a half.

• The Journal of the Korea Contents Association
• /
• v.9 no.8
• /
• pp.49-56
• /
• 2009

In this paper, we propose a method of energy level, node degree and selection information based CDS(Connected Dominating Set) construction algorithm for more efficient routing in ad-hoc wireless networks. Constructing CDS in ad-hoc wireless network, it is necessary to make more efficient algorithm that is faster, more simple and has low power consumption. A CDS must be minimized because nodes in the CDS consume more energy in order to handle various bypass traffics than nodes outside the set. It is better not to reconstruct CDS after constructing the most efficient CDS. To overcome this problem, we proposed the CDS construction algorithms based on EL+ND+Sel method. We compared and estimated the performance in each situation of EL + ND and EL + ND + Sel.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.535-542
• /
• 2005

This paper proposes an on-demand ad hoc routing protocol, Node Density Based Routing (NDBR), which enhances the routing performance applying a new method to establish alternate patlis. It is important to reserve alternate paths for the route from source to destination in mobile ad hoc networks that are susceptible to failure due to the movement or the power exhaustion of mobile nodes. NDBR aims to establish a route that contains more alternate paths toward the destination by involving intermediate nodes with relatively more adjacent nodes in a possible route, and introduces a new routing criterion called 'node density.' This approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. This paper describes the route setup procedure using node density and the route re-configuration procedures employing alternate path information at the intermediate nodes. We show the performance of our routing schemes through a series of simulations using the Network Simulator 2 (ns-2).

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.364-366
• /
• 2004

보안은 유ㆍ무선 환경에서 가장 이슈가 되는 분야이다. 현재 이동 애드혹 망은 보안에 대한 고려 없이 진행이 되어있다. 고정된 기반구조를 가지고 있지 않기 때문에 보안은 이동 애드 혹 망에서 가장 취약한 점이며 많은 논문에서 ADOV 혹은 DSR 같은 프로토콜의 위협적인 요소들에 대해 문제점을 제시 하여왔다. 본 논문에서는 가장 가볍고 처리 속도가 빠른 메시지 인증 코드를 사용함으로써 AODV 라우팅(routing) 프로토골(protocol)에 보안기능을 제안하였다.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.75-84
• /
• 2004

Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.175-181
• /
• 2014

With rapid growth of the wireless mobile computing network technologies, various mobile ad hoc network applications converged with other related technologies are rapidly disseminated nowadays. Vehicular Ad Hoc Networks are self-organizing mobile ad hoc networks that typically have moving vehicle nodes with high speeds and maintaining its topology very short with unstable communication links. Therefore, VANETs are very vulnerable for the malicious noise of sensors and anomalies of the nodes in the network system. In this paper, we propose an anomaly detection method by using big data techniques that efficiently identify malicious behaviors or noises of sensors and anomalies of vehicle node activities in these VANETs, and the performance of the proposed scheme is evaluated by a simulation study in terms of anomaly detection rate and false alarm rate for the threshold ${\epsilon}$.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.643-658
• /
• 2004

Mobile ad hoc networks(MANET) have recently attrarted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on the various problems of MANET in data link and network layers, we consider, in this paper, how to efficiently support applications such as service discovery on top of MANET. Peer-to-Peer(P2P) overlay network can be adopted to service discovery mechanism because P2P and MANET share certain similarities, primarily the fact that both arc instances of self-organizing decentralized systems. Especially, distributed hash table(DHT) systems used for r2r overlay network can be effective in reducing the communication overhead in service discovery. However, since overlay network is independent of physical network topology and existing topology-aware mechanisms are based on the wired network, they are inefficient in MANET. We propose a proximity-based overlay network routing to overcome the inefficiency of routing in overlay network. In the proximity-based overlay network routing, each node collects information of physically close nodes by using one hop broadcast and routes messages to the logically closest node to destination. In a detailed ns-2 simulation study, we show that the proximity-based overlay network routing reduces the number of physical hops comparable to the flooding-based mechanism with low communication overhead. We also find that the proposed scheme works well in the mobile environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.310-312
• /
• 2004

이동 애드혹 망은 기반구조가 없는, 즉, 고정된 라우터나 백본망 같은 기반구조가 없는 무선 이동 노드들로 구성된 망이다. 현재 이동 애드혹 망은 기반구조가 없어 보안이 가장 취약한 부분이다. 본 논문에서는 클러스터 구조 기반의 이동 애드혹 환경에서 안전하고 효율적인 방법으로 그룹의 세션키를 공유하는 패스워드 기반의 그룹키 동의 프로토콜을 제안한다. 그룹키 동의 프로토콜은 일련의 그룹을 형성하는 다수의 통신 참여자들이 공개된 통신망에서 안전하고 효율적인 방법으로 그룹의 세션키를 설정한다. 하지만 기존의 연구는 모두 상당한 양의 통신부하를 유발한다. 따라서 제안 프로토콜은 이동 애드혹 망에 적합한 대칭키 기반으로, 최적의 전송 메시지 복잡도와 2번의 통신 라운드를 요구하기 때문에 매우 효율적이다. 또한 그룹 구성원의 변경이 가능한 동적 특성과 전방향 안전성을 제공한다.

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

Ad-Hoc 네트워크는 임의 디바이스들이 무선 통신을 통해서 임의 네트워크 망을 구성하여 통신 서비스를 제공받는 것을 말한다. 특히 유비쿼터스 환경에서의 언제 어디서나 통신을 하기 위해서는 이동성과 자유로운 네트워크의 조인 및 탈퇴가 이루어져야 한다. 또한 통신에서 제 3자의 위장이나 정보의 도청 그리고 안전성을 제공하기 위해서 암호화 통신이 필수적으로 요구된다. 특히 Ad-Hoc 네트워크의 디바이스간의 라우팅 구성이 유동적이라서 구성하는 디바이스간의 인증 및 키 생성과정이 필요하며, 라우팅에 대한 보안 기술의 연구는 국내/외에서 진행되어져 왔다. 본 논문에서는 기존의 안전한 라우팅 방안에 대하여 알아보고 디바이스 인증 및 키 설립을 제공하는 방식에 대하여 제안한다. 본 방식은 세션키를 설립을 위해서 키 생성 및 아이디를 기반으로 한 인증 방안을 이용한다. 그로 인해 인증서를 이용하거나 디바이스간의 인증 정보 및 상호 공유된 비밀 정보가 필요하지 않는 장점을 가지고 있다. 이와 같은 방식을 이용하므로 임의 네트워크에 조인하더라도 보안 기술을 제공할 수 있는 방안이다. 본 연구를 이용하므로 유비쿼터스 환경에서의 안전한 서비스를 제공할 수 있는 기술로 활용할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.242-244
• /
• 2003

이동적응망에서의 안전하고 신뢰성있는 통신을 위하여 안전한 라우팅 프로토콜은 필수적이다. 본 논문에서는 안전한 라우팅 프로토콜을 제안한다. 제안 프로토콜은 기존의 프로토콜과는 달리 ID 기반 암호시스템을 사용하여 전체 경로길이에 관계없이 상수개의 암호학적 인자로서 경로상의 모든 단말의 인증이 가능하며, 이에 따라 경로 발견 과정시 소모되는 네트워크 자원의 양이 이전보다 감소하게 되는 장점이 있다.