• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.310-317
• /
• 2005

In opposition to conventional networks, mobile ad hoc networks usually do not offer trust about nodes or online access through certificate authorities or centralized servers. But, nodes in those systems need process that can search path as well as trust each other to exchange data in safety For these reasons, traditional security measures that require online trusted authorities or certificate storages are not well-suited for securing ad hoc networks. In this paper, I propose a secure and effective method to search the optimized path using profitable flooding techniques on certificate chains in MANETS(Mobile Ad hoc NETworks). This system includes not only using routing protocols that are generally broadcasting packets but also finding nodes securely and verifing the process through tiust relationships between nodes that are searched.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.95-101
• /
• 2005

In this paper, some performance characteristics of multimedia traffic for mobile ad-hoc networks is studied with simulations. Synthetic streaming video is considered as the multimedia traffic for MPEG-coded video in the simulation. The synthetic video stream is generated with a video stream generation algorithm. The algorithm generate VBR traffics for MPEG video streams with special predefined GOP(group of pictures) patterns that is consisted of a sequence of I(intra-coded), P(predicted-coded) and B(bidirectional-coded) frames. The synthetic VBR streams is transmitted through UDP protocol with on-demand mobile ad-hoc network routing protocols like as AODV and DSR. And performances for video streams through mobile ad-hoc networks is evaluated, the throughputs is compared between data and video traffics.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.281-290
• /
• 2010

In geographic forwarding algorithms, traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors. In beacon message based forwarding scheme, a longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces control overheads.Therefore, the fixed or dynamic interval scheme based forwarding schemes cannot adapt well to different mobility environments. Also, existing schemes result in the uncertainty of neighbor node's position in the forwarding table of mobile node. Therefore, this paper presents a self-adaptive location checking mechanism based proactive geo-routing algorithm for beacon-based geographic routing. Simulation results show that the proposed routing algorithm not only significantly increases the relay transmission rate but also guarantees the high end-to-end packet delivery in low and high mobility environments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.525-530
• /
• 2007

기술의 발전과 함께 최근의 모바일 장치들은 복수의 서로 다른 우선 인터페이스를 동시에 장착한 멀티라디오 환경을 가지게 되었고, 이러한 장치들로 구성된 애드 혹 네트워크는 유비쿼터스 컴퓨팅 환경에서 새로운 요구와 항께 다양한 활용 가능성을 가지고 있다. 유비쿼터스 컴퓨팅 환경에서는 사용자나 서비스, 장치에 따라 상황정보가 다양하게 나타날 수 있고, 그것을 네트워킹에 반영하기 위한 수단으로 멀티라디오 환경이 사용될 수 있으므로, 멀티 라디오 환경의 특성을 정확히 파악하고 어떻게 그 특성을 활용 할 수 있는가를 분석하는 것이 필요하다. 본 연구에서는 멀티 라디오 애드 혹 네트워킹에 관한 관련 연구 분석과 함께 기존의 연구가 지원하지 못한 멀티 라디오 환경의 특성을 지적하고, 시뮬레이션을 통하여 멀티 라디오 환경의 특성과 활용 요소에 대여 분석하였다. 시뮬레이션 결과는 시나리오에 따라 인터페이스의 선택이 가지는 trade-off를 보여주고 서로 다른 인터페이스의 혼합된 사용이 네트워크에 미치는 영향에 대해 설명하고 있으며 결과적으로 시뮬레이션을 통해 얻은 멀티 라디오의 특성을 상황인지 애드 혹 네트워킹에 활용할 수 있는 시스템 디자인을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.39-45
• /
• 2009

With the rapid growth of recent wireless mobile computing application technology and handheld mobile terminal device development technology, one of the big issue in these fields is to design online games in wireless mobile ad hoc network environment. Online games in mobile computing environment have lots of constraints for developing online games because mobile terminals have many limitations such as low performance of processor, limited memory space, small bandwidth of wireless communication, and confined life of battery power. Therefore, most of mobile games are restrictive in the function of online and multi-play up to date. In this paper, the online MMORPG game, capable of multi-play with many other mobile users using mobile terminals in wireless mobile computing environment, is designed and implemented. Proposed mobile online game uses bluetooth to construct temporary wireless mobile ad hoc network with other mobile clients, and designed to carry out online MMORPG game with these clients. It also supports multi-play among them.

• Journal of Advanced Navigation Technology
• /
• v.11 no.1
• /
• pp.118-126
• /
• 2007

An ad hoc network is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies allowing people and devices to internetwork without any preexisting communication infrastructure. Although ad hoc network is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; ad hoc networks are known to be particularly vulnerable to security attack. It is difficult to establish a centralized key distribution center and a trusted certification authority to provide cryptographic keys and digital certificates to nodes. To prevent attacks in ad hoc routing protocols, many algorithms have been used. In this paper, we have depicted a secure framework for multipath routing in wireless multihop network, which is comprehensive solution for secure data forwarding in wireless multihop networks. With the simulation results, the proposed scheme is compared with existing source routing scheme.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.6
• /
• pp.109-116
• /
• 2007

The lack of load-balancing functionality in most existing ad hoc routing protocols often causes congestion resulting in bad performance and short lifetime of participating nodes. We present an auxiliary scheme for reactive routing protocols to discover an unloaded route, thereby decreasing possibility of congestion. The scheme allows an intermediate node to determine whether to be a relaying node for a newly constructed route autonomously based on the occupancy of its queue. Thus the scheme does not require network-wide load information. Simulation results show that the proposed scheme distributes traffic load well.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.5
• /
• pp.71-80
• /
• 2009

Ad-hoc network consists f mobile nodes, which they are together in the communication. However, if some misbehaving nodes are in network, it is faced to many threats. Therefore, detection and management of misbehaving node are necessary to make confident in Ad-hoc networks. To solve this problem, we use Node Weight Management Server(NWMS), which it manage each node's weight in local area. When NWMS detect misbehaving node, it adds the node's weight and if the node's weight exceeds threshold then NWMS broadcasts the node's information to isolate in network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.111-118
• /
• 2008

In this paper a novel medium access control mechanism is investigated as a means to support real-time services. The primary goal is to provide constant-bit-rate voice call services to pairs of autonomous mobile nodes operating in ad hoc networks. Here, a time-slot reservation based MAC is considered to provide real-time voice calls and a new MAC called the time-slot reservation coordination function(TRCF) is presented. In addition to this isochronous type MAC protocol development, the proposed protocol is modeled using a Markov chain in order to predict its behavior. The performance of TRCF is analytically derived and the performance measures such as average wait time taken for a call connection and throughput are obtained.

• The KIPS Transactions:PartC
• /
• v.18C no.3
• /
• pp.167-178
• /
• 2011

As the growth of ubiquitous services, various types of ad hoc networks have emerged. In particular, wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are widely known ad hoc networks, but there are also other kinds of wireless ad hoc networks in which the characteristics of the aforementioned two network types are mixed together. This paper proposes a variant of the Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol modified to be suitable in such a combined network environment. That is, the proposed routing protocol provides node detection and route discovery/maintenance in a network with a large number of mobile sensor nodes, while preserving node mobility, network connectivity, and energy efficiency. The proposed routing protocol is implemented with a multi-hop multi-path algorithm, a topology reconfiguration technique using node movement estimation and vibration sensors, and an efficient path selection and data transmission technique for a great many moving nodes. In the experiments, the performance of the proposed protocol is demonstrated by comparing it to the conventional LEACH protocol.