• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.1
• /
• pp.18-25
• /
• 2006

In mobile ad-hoc networks(MANETs), nodes are mobile and network topology changes very frequently. The mobility of nodes does affect the system performance. There has been considerable attention on the mobility models, however, most work is confined to the simulation or test-bed. In this paper, we propose an analytical method to evaluate the performances of MANETs such as the average radio range dwell time of mobile nodes, link holding time, and transmission failure probability considering the node's mobility. In the proposed model, MANETs consist of the multi-hop and multicasting routing paths. A simulation is done to validate our proposed analytical model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.7
• /
• pp.845-851
• /
• 2019

We design, implement, and evaluate a user-level ad hoc network routing protocol on the COTS (commercial off-the-shelf) mobile devices. In situations such as disaster recovery, emergency communication between mobile devices is necessary. For wide deployability and usability of such a system, we design and implement the networking protocols on the user level instead of modifying the kernel of mobile devices. In order to support reliable data transfer in high mobility scenarios, we selected to implement AODV (Ad Hoc On-Demand Distance Vector) as the routing protocol and TCP as the transport layer protocol. With our implementation of ad hoc networking stack on COTS smartphones, we conducted experiments in various networking environments. Our experimental results show that ad hoc networking is possible in up to 12 hops in a line topology and 5 concurrent devices in a star topology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.411-417
• /
• 2008

This paper proposes BSFP (Bluetooth Scatternet Formation Protocol), which establishes a multi-hop bluetooth scatternet. BSFP independently operates on each bluetooth device, does not require any information on neighbor devices at the very beginning, and can establish a scatternet even though all the devices are spreaded beyond the bluetooth transmission range. BSFP is composed of the following three stages; 1) Init stage to investigate neighbor nodes, 2) Ready stage to establish a scatternet using gathered local information at each node, and 3) Complete stage to use the determined scatternet links. In BSFP, the scatternet formation time does not significantly affected by the number of bluetooth devices and a robust mobile ad hoc network is formed because BSFP formulates a scatternet with many adjacent links to neighbor devices.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.91-98
• /
• 2013

Node which plays the role of cache server does not exist in the wireless ad-hoc network consisting of only mobile nodes. Even if it exists, it is difficult to provide cache services due to the movement of nodes. Therefore, the cooperative cache technique is necessary in order to improve the efficiency of information access by reducing data access time and use of bandwidth in the wireless ad-hoc network. In this paper, the whole network is divided into zones which don't overlap and master node of each zone is elected. General node of each zone has ZICT and manages cache data to cooperative cache and gateway node use NZCT to manage cache information of neighbor zone. We proposed security structure which can accomplish send and receive in the only node issued id key in the elected master node in order to prepare for cache consistent attack which is vulnerability of distributed caching techniques. The performance of the proposed method in this paper could confirm the excellent performance through comparative experiments of GCC and GC techniques.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1433-1436
• /
• 2004

The ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure of centralized administration. Load-Balanced Ad hoc Routing(LBAR) protocol is an on-demand routing protocol intended for delay-sensitive applications where users are most concern with packet transmission delay. Although LBAR mechanism is a novel load balancing routing protocol for ad hoc network, it has own limitation in route path maintenance phase. Therefore, in this paper, we propose Advanced Load-Balanced Ad hoc Routing(A-LBAR) that is delay-sensitive and has an efficient path maintenance scheme. The robust path maintenance scheme is maintained by considering about nodal loads all over network and misbehavior of overloaded or selfish nodes. The proposed scheme provides good performance over DSR and AODV in terms of packet delay and packet loss rate when some misbehaving nodes exist in the network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.11
• /
• pp.27-34
• /
• 2005

Mobile Ad Hoc Networks (MANETs) are self-organized networks that do not rely in their operation on wired infrastructure. As in any networking technology, security is an essential element in MANET as well, for proliferation of this type of networks. But supporting secure communication in MANETs proved to be a significant challenge, mainly due to the fact that the set of nodes in the network can change frequently and rapidly and due to the lack of access to the wired infrastructure. In particular, the trust model and the authentication protocols, which were developed for wired and infrastructure-based networks, cannot be used in MANETs. In this paper, we address the problem of efficient authentication of distributed mobile users in geographically large networks. In particular, we propose a new authentication scheme for this case of MANETs. The proposed scheme exploits Randomized Groups to efficiently share authentication information among nodes that together implement the function of a distributive Certification Authority (CA). We then evaluate the performance of authentication using Randomized Groups.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.680-699
• /
• 2015

The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

• Journal of Industrial Technology
• /
• v.27 no.B
• /
• pp.37-42
• /
• 2007

A mobile ad hoc network (MANET) is a kind of wireless ad hoc network. It is a self-configuring network of mobile nodes connected by wireless links. Infostation is a lower cost and low power system that provides very high bit rate with limited coverage. In this study, we propose search and rescue system that combines MANET of climbers with Infostations. A climber shares location information of climbers with other climbers while climbing, and delivers the information to Infostations. This system is an intermittent network due to the mobility of nodes. From the system, we can track the locations of missing climbers. Ultimately, proposed system achieves low cost and reduces memory requirement using Infestations. We also analyze the performance of the proposed system by simulation. From the performance analysis results, we expect that the proposed system will be very useful to early detect climbers' locations in emergency situations in Korea mountain areas.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1139-1142
• /
• 2006

Mobile Ad-hoc 네트워크(MANET)에서 각 노드들은 한정된 배터리에 의존하여 통신한다. 이와 같은 제한사항을 극복하기 위해 링크의 안정성을 유지하거나 파워 소모를 고려한 프로토콜에 대한 연구들이 활발히 이루어져 왔다. 하지만 링크의 안정성 또는 파워 소모의 어느 한 측면만을 고려함으로써 링크의 안정성은 높일 수 있으나 파워 소모가 효율적이지 못했다. 반면에 전체 파워소모는 줄일 수 있었으나 파워소모의 균형을 이루지 못함으로써 네트워크 수명을 오래 지속시킬 수 없는 문제점이 발생 했다. 본 논문에서는 배터리 잔량에 대한 threshold를 적용함과 동시에 신호세기를 고려하여 각 노드들의 균형된 파워소모와 네트워크 전체의 파워 소모를 최소화함으로써 네트워크 수명을 오래 지속시키기 위한 프로토콜인 PRTRS(Power Aware Routing Protocol based on Both Threshold by Residual Battery Capacity and Signal Strength in Mobile Ad-hoc Network)를 제안한다. PRTRS는 AODV(Ad-hoc On-demand Distance Vector Routing)를 기반으로 하였다. NS-2 네트워크 시뮬레이션 결과 PRTRS는 특정 노드로 집중되는 트래픽을 분산시켜 파워소모의 균형을 이루고 네트워크 전체의 파워소모를 최소화함으로써 네트워크 수명이 연장됨을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1330-1347
• /
• 2018

Mobile Ad hoc Network (MANET) is a collection of nodes or communication devices that wish to communicate without any fixed infrastructure and predetermined organization of available links. The effort has been made by proposing a scheme to overcome the critical security issue in MANET. The insufficiency of security considerations in the design of Ad hoc On-Demand Distance Vector protocol makes it vulnerable to the threats of collaborative black hole attacks, where hacker nodes attack the data packets and drop them instead of forwarding. To secure mobile ad hoc networks from collaborative black hole attacks, we implement our scheme and considered sensor's energy as a key feature with a better packet delivery ratio, less delay time and high throughput. The proposed scheme has offered an improved solution to diminish collaborative black hole attacks with high performance and benchmark results as compared to the existing schemes EDRIAODV and DRIAODV respectively. This paper has shown that throughput and packet delivery ratio increase while the end to end delay decreases as compared to existing schemes. It also reduces the overall energy consumption and network traffic by maintaining accuracy and high detection rate which is more safe and reliable for future work.