• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.65-75
• /
• 2009

A Vehicular Ad-Hoc Network (VANET) is a form of Mobile ad-hoc network, to provide temporary communications among nearby vehicles. Mobile node of VANET consumes energy and resource with participating in the member of network. Some node tends to have a selfishness to place one's own profits above cooperation with others. As result of selfish node, it reduces data accessibility and the efficiency of networks. In this paper, we propose noble method, Friendship-VaR that excludes selfish nodes from a group of VANET. Friendship-VaR enables to improve data accessibility by eliminating selfish nodes and sharing data among reliable nodes. Friendship-VaR determines selfishness of nodes by simple data exchange. The experiments shows proposed method outperform existing method in terms of data accessibility.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.1-6
• /
• 2010

Simulation analysis may be the essential means to either evaluate performance of systems or optimize system parameters for new design. Including many variations for design and implementation, MANET (Mobile Ad-hoc NETwork) is one target area of such an analysis. Since every node, however, included in the network has mobility, one MANET could be overlapped or merged with another one which use a different transport protocol. In order to communicate among nodes in this case, the new merged network should configure paths and addresses in advance. Configuring paths and addresses generates much overheads which ultimately cause delay in communicating data. Performance analysis is required to improve the data transport performance by minimizing overheads. This paper proposes a sound address auto-configuration method which is based on an on-demand manner and then presents modeling and performance analysis of the method. NS-2 simulation results verify that the proposed method can not only alleviate overheads, which are inevitably generated for address auto-configuration processes, and but also decentralize them in time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.561-565
• /
• 2006

무선 모바일 애드 혹 네트워크에서 에너지 효율을 위한 많은 라우팅 알고리즘이 연구되어 왔다. 이러한 제안된 다른 알고리즘들을 살펴보면, 에너지 효율 뿐 만 아니라 성능의 향상을 위한 노력도 기울여 왔다. 일반적으로 목적지 노드가 전송받은 RREQ의 메트릭을 통하여 에너지 효율적인 경로를 선택 하게 되는데, 이것은 결국 데이터 전송 지연이 발생하게 된다. 그리고 경로가 설정된 이후에 경로를 유지하는데 있어서, 노드의 이동이나 배터리의 소진으로 링크가 끊기게 되면 경로를 다시 찾는 과정에서 제어 패킷을 다시 플러딩 하기 때문에 여러 노드의 에너지 소비를 초래하게 된다. 본 논문에서는 이러한 문제들을 해결하기 위해 기존의 AODV(On-Demand Distance Vector Routing) 프로토콜을 기반으로 다음과 같은 방법을 제안한다. 먼저 RREQ를 받은 노드가 남은 배터리의 양을 고려하여 전송의 여부를 결정하는 방법을 제안하고, 경로를 유지하는데 있어서 전송의 세기를 통해 노드의 이동성을 인지하고 링크가 끊기기 전에 다른 노드로 경로를 대체함으로써 경로 재설정을 통한 에너지 소비를 줄이는 방안을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.923-930
• /
• 2007

This paper presents MAPER, a media-aware power efficient routing algorithm over mobile ad hoc networks. Generally, multimedia services need various quality of service over the network according to their characteristics and applications. But it is not easy to guarantee quality of service over mobile ad hoc networks since the resources are very limited and time-varying. Furthermore only a limited power is available at mobile nodes, which makes the problem more challenging. Now, we propose an effective routing algorithm over mobile ad hoc networks that provides the stable end-to-end quality of service with the minimum total power consumption. Finally, experimental results are provided to show the performance of the proposed algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.241-244
• /
• 2012

In mobile ad-hoc networks, it should be the most important issue to reduce the power consumption of communications, because the resource of a node is limited in these networks. In existing cluster-based routing protocols, cluster headers participate in almost all communication processes. Therefore the lifetime of the cluster header is shortened and it does not have the effective route. In the proposed cluster-based routing protocol, the cluster header transmits a control packet which gives the route information to member nodes. This makes that the cluster header decreases the number of participating in communications, and that node members do not have to communicate trough the cluster header. This results in extending the lifetime of the cluster header, and having the effective route, data transmission rate and improved stability of routes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.34-45
• /
• 2013

Due to its self-configuring nature, the tactical mobile ad hoc network is used for communications between tactical units and the command and control center (CCC) in battlefields, where communication infrastructure is not available. However, when a tactical unit moves far away from the CCC or there are geographical constraints, the data link between two communicating nodes can be broken, which results in an invalid data route from the tactical units to CCC. In order to address this problem, in this paper we propose a hierarchical connectivity maintenance scheme, namely ADLCoM (Autonomous Data Link Connectivity Maintenance). In ADLCoM, each tactical unit has one or more GW (gateway), which checks the status of data links between tactical units. If there is a possibility of link breakage, GWs request ground or aerial unmanned vehicles to become a relay for the data link. The simulation results, based on tactical scenarios, show that the proposed scheme can significantly improve the network performance with respect to data delivery ratio.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.16-27
• /
• 2014

In this paper, we propose an efficient grid based routing scheme using the location information in order to reduce the routing cost in mobile ad-hoc networks. In our proposed scheme, all nodes can be a candidate to forward messages to the specified destination node and reduce the management cost of head nodes because they do not exist. The intermediate nodes determine the next hop relaying messages on the basis of location relations between a node and a grid zone. The proposed scheme explores the routing path considering the direction of a node using the coordinate of a grid zone and neighbor node information. It also maintains the routing path considering connectivities among the nodes. In order to show the superiority of the proposed routing scheme, we compare it with the existing grid based routing scheme in terms of the overhead of message, the success rate of transmission.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.68-75
• /
• 2017

In this paper, we propose an energy entropy based multipath routing protocol using dynamic forwarding range in mobile ad-hoc wireless sensor networks. The main features and contributions of the proposed routing protocol are as follows. First, can select stable routing routes by using the calculated route entropy based on energy information of sensor nodes. Second, using dynamic forwarding range based on the route stability of route entropy can reduce energy, control overhead, delay for route establishment, finally improve data transmission efficiency. The performance evaluation using OPNET shows that the proposed routing protocol can efficiently support PDR.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.366-369
• /
• 2007

위치정보는 사용자에게 유용한 서비스를 제공하는데 필요한 주요 컨텍스트 중의 하나로, 이를 얻기 위해 GPS(Global Positioning System)가 널리 사용되고 있다. GPS는 위성신호를 이용하기 때문에 별도의 기지국이 필요 없고 전 세계를 포함하는 넓은 가용범위를 갖지만, 도심과 같이 높은 건물이 많은 지역에서는 수신이 어렵다는 단점이 있다. 본 논문은 주변기기들의 위치정보를 공유 받아 모바일 기기의 GPS 정보손실을 복구하는 알고리즘을 제안한다. 먼저 주변의 모바일 기기나 기지국의 유효한 위치정보를 근거리 통신의 애드혹 네트워크인 스캐터넷을 통해 공유받는다. 그 후, 근거리 통신의 가용범위와 지도상의 지형정보를 함께 고려하여 복구 알고리즘을 통해 자신의 위치를 추측한다. 본 논문에서는 최근 모바일 기기에 기본으로 장착되는 근거리 통신기술인 블루투스(Bluetooth)를 가정하여 시뮬레이션 환경을 모델링 하였으며, 실험결과 제안하는 방법을 통해 손실된 GPS 정보의 상당부분이 복구되는 것을 확인하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.41-46
• /
• 2019

In this paper, it is necessary to study the bandwidth and network system for efficient image transmission in the current era of drone imaging, and to design routing protocols to round out and cluster two or more multi-drones. First, we want to construct an ad hoc network to control the multidrone. Several studies are underway for the clustering of drones. The aircraft ad hoc network (FANET) is an important foundation for this research. A number of routing protocols have been proposed to design a FANET, and these routing protocols show different performances in various situations and environments. The routing protocol used to design the FANET is tested using the routing protocol used in the existing mobile ad hoc network (MANET). Therefore, we will use MANET to simulate the routing protocol to be used in the FANET, helping to select the optimal routing protocol for future FANET design. Finally, this paper describes the routing protocols that are mainly used in MANET and suitable for FANET, and the performance comparison of routing protocols, which are mainly used in FANET design.