• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.65-71
• /
• 2011

In this paper, the RFID / USN-based ad-hoc network structure is presented for efficient operation of a container terminal yard. Communication between fixed or mobile devices in the container terminal yard is accomplished through the ad-hoc node, to collect the status information of a container in real time. Any outside shipper of the container as well as central server allows to share the status information of a container through ad-hoc communication. In addition, to predict the maximum wireless transmission range of nodes by RFID tag position in the yard, LAODV (Location based AODV) routing protocol is proposed. The validity is proved by performance evaluation via computer simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.1
• /
• pp.31-37
• /
• 2008

In this paper, we propose an entropy-based routing protocol to effectively support both stable route construction and route lifetime in Mobile Ad-hoc Wireless Sensor Networks (MAWSN). The basic idea and feature of the proposed routing protocol are as follows. First, we construct the stable routing routes based on entropy concept using mobility of mobile nodes. Second, we consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed routing protocol is performed via simulation using OPNET(Optimized Network Engineering Tool) and analysis. The results of the performance evaluation show that the proposed routing protocol can efficiently support both the construction of stable route and route lifetime in mobile ad-hoc wireless networks.

• Convergence Security Journal
• /
• v.21 no.1
• /
• pp.129-135
• /
• 2021

Greedy protocols show good performance in Vehicular Ad-hoc Networks (VANETs) environment in general. But they make longer routes causing by surroundings or turn out routing failures in some cases when there are many traffic signals which generate empty streets temporary, or there is no merge roads after a road divide into two roads. When a node selects the next node simply using the distance to the destination node, the longer route is made by traditional greedy protocols in some cases and sometimes the route ends up routing failure. Most of traditional greedy protocols just take into account the distance to the destination to select a next node. Each node needs to consider not only the distance to the destination node but also the direction to the destination while routing a packet because of geographical environment. The proposed routing scheme considers both of the distance and the direction for forwarding packets to make a stable route. And the protocol can configure as the surrounding environment. We evaluate the performance of the protocol using two mobility models and network simulations. Most of network performances are improved rather than in compared with traditional greedy protocols.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.583-585
• /
• 2002

Mobile Ad Hoc Network에서는 무선으로 연결된 호스트들이 쉽게 이동할 수 있으며 미리 설치된 유선망을 이용하는 셀롤러망과 달리 이동 호스트 사이의 통신만으로 이루어진 망이다. Mobile Ad Hoc Network에서는 각각의 노드들의 이동성이 높기 때문에 이 각각의 노드들의 라우팅 경로를 결정하는 것이 중요하다. 이에 따라 Mobile Ad Hoc Network를 위한 많은 라우팅 프로토콜이 제안되었다. 본 논문에서는 기존에 제안된 Cluster Based Routing Protocol(CBRP)극 변형하여 마치 셀롤러망에서의 셀과 같이 고정된 위치를 하나의 셀로 정의하고 그 하나의 셀이 클러스터를 형성하여 라우팅 오버 헤드를 줄일 수 있는 기법을 제안한다.

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

In this paper, the RFID-based ad-hoc network is presented for the efficient yard management of the container terminal. The loading and unloading work is performed through the ad-hoc communication between YT and GC, YT and TC within the yard without the control of the central server. That makes the efficient operation of the yard with real task correspondence. Using the location information of the RFID tag, we have proposed the routing protocol which is suitable for the yard environment of the container terminal. The performance evaluation has been carried out through the network simulator and gained an effective results.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.422-431
• /
• 2006

This paper proposes an adaptive routing protocol called ARCA for converged ad-hoc and cellular network (CACN). Due to the limitation of both bandwidth and transmission range in a cell, a mobile host (MH) may not be able to make a call during busy time. CACN offers a flexible traffic diversion mechanism that allows a MH to use the bandwidth in another cell to ease the congestion problem and increase the throughput in a cellular network. Based on the presentation of CACN's physical characteristics, the paper details the design issues and operation of the adaptive routing protocol for CACN (ARCA). Detailed numerical analysis is presented in terms of both route request rejection rate and routing overhead, which, along with the simulation results, have indicated the effectiveness and efficiency of the ARCA protocol.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.118-120
• /
• 2002

Ad-hoc 네트워크에서의 라우팅 프로토콜은 현재 사용중인 경로가 혼잡하다 하더라도 네트워크 토폴로지가 변하기 이전에는 새로운 경로를 설정하지 못하므로, 노드의 이동성이 낮은 환경에서는 트래픽의 집중 현상이 심화된다. 이동 기기들은 그 성능과 배터리에 한계가 있기 때문에 일부 소수 노드들에게 트래픽 집중되는 경우 다른 노드들에 대한 데이터 중계 서비스를 제공하는데 자신의 자원 대부분을 낭비하도록 강요받게 된다. 따라서 본 논문에서 혼잡 상태의 노드는 더 이상의 데이터 패킷 중계를 포기하고 이를 해당 소스에게 알림으로써 소스가 새로운 우회경로를 설정하도록 하여 트래픽의 집중 현상을 완화시키는 새로운 프로토콜인 SLAP(Simple Load-balanced Ad-hoc routing Protocol)을 제안한다.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.117-121
• /
• 2008

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.