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

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.191-198
• /
• 2013

It is required to transmit data through shorter path between sensor and base node for real time intrusion detection in wireless sensor networks (WSN) with a mobile base node. Because minimum Wiener index spanning tree (MWST) based routing approach guarantees lower average hop count than that of minimum spanning tree (MST) based routing method in WSN, it is known that MWST based routing is appropriate for real time intrusion detection. However, the minimum Wiener index spanning tree problem which aims to find a spanning tree which has the minimum Wiener index from a given weighted graph was proved to be a NP-hard. And owing to its high dependency on certain nodes, minimum Wiener index tree based routing method has a shorter network lifetime than that of minimum spanning tree based routing method. In this paper, we propose a multi-objective ant colony optimization algorithm to tackle these problems, so that it can be used to detect intrusion in real time in wireless sensor networks with a mobile base node. And we compare the results of our proposed method with MST based routing and MWST based routing in respect to average hop count, network energy consumption and network lifetime by simulation.

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

센서 네트워크는 센서 디바이스를 이용해 원하는 정보를 수집하고 전달하는 일종의 애드혹 (Ad-Hoc)네트워크이다. 현재 센서 네트워크의 기술은 많은 분야에서 응용이 예상되고 있지만 센서의 여러 특성에 의해 기존의 애드혹 라우팅 기법을 적용하기에 적합하지 않아 여러 가지의 라우팅 기법이 제안 되고 있다. 제안된 여러 기법 중 체인기반 프로토콜(Chain-Based Protocol)인 PEGASIS(Power-Efficient GAthering in Sensor Information Systems) 라우팅 기법은 헤드 노드의 선택과정에 있어서 BS(Base Station)의 위치를 고려하지 않고 체인으로 연결된 노드들 중에 하나가 헤드 노드로 선택됨으로써 불필요한 데이터의 이동이 발생하게 된다. 본 논문에서는 PEGASIS라우팅 기법의 성능향상을 위해 BS 노드의 위치를 고려한 데이터 이동의 방향성에 기반한 라우팅을 통해 향상된 PEGASIS 라우팅을 제안한다. 데이터의 이동의 방향성에 기반한 라우팅은 데이터의 불필요한 이동 경로를 줄임으로써 기존의 라우팅보다 에너지 효율면에서 뛰어난 성능을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.652-659
• /
• 2006

The routing algorithm is one of the key research areas in ad hoc networks. The most of existing routing algorithms depends on current availability of wireless link when finding the feasible path. Dependence on current information may mislead to a fragile communication path. Some routing approaches that take statistical average on received signal power enhance the possibility to find the most stable path, but have limitation on considering only the average power level. In this paper, we propose routing algorithm based on link stability for ad hoc network. The proposed algorithm not only takes statistical average, but also traces the degree of variations in received signal power. The simulation result support that the proposed algorithm is more likely to find the most stable path under the severe communication environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.694-702
• /
• 2009

Geographical routing protocol, where nodes only need local information exchange to make routing decisions, is a very efficient routing scheme for wireless sensor networks in scalability. However, pure geographical routing does not take account of wireless link condition. If wireless link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose geographical routing scheme considering wireless link condition, where reliable data transmission is made and the consumed energy is minimized.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.433-442
• /
• 2005

An increase In traffic has a large Influence on the performance of a total network. Therefore, traffic management has become an important issue of network management. In this paper, we propose a new routing algorithm that attempts to analyze network conditions using time series prediction models and to propose predictive optimal routing decisions. Traffic congestion is assumed when the predicting result is bigger than the permitted bandwidth. By collecting traffic in real network, the predictable model is obtained when it minimizes statistical errors. In order to predict network traffic based on time series models, we assume that models satisfy a stationary assumption. The stationary assumption can be evaluated by using ACF(Auto Correlation Function) and PACF(Partial Auto Correlation Function). We can obtain the result of these two functions when it satisfies the stationary assumption. We modify routing oaths by predicting traffic in order to avoid traffic congestion through experiments. As a result, Predicting traffic and balancing load by modifying paths allows us to avoid path congestion and increase network performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1535-1541
• /
• 2009

In this paper, we suggest an efficient path searching algorithm that reduces the hop count when each node sends a data in ZigBee networks. As the hop count reduces, the network traffic is also reduces and leads to less energy consumption. This enables the sensor network live longer with limited node power. The proposed path searching algorithm consists of two sub-algorithms. One for upstream process and the other for downstream process. When a node selects its proper routing path, the node not only uses the information of the parent and child node, but it also uses the neighbor nodes for each node. In the simulation, we changed various network environment factors such as network parameters, number of nodes, and number of neighbor nodes and observed their performances. We compare the performance to the previous ZigBee Tree routing algorithm with separate two algorithms, the upstream and the downstream, and then compare the performance when all two algorithms are applied.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.11
• /
• pp.2187-2192
• /
• 2016

A data-centric routing protocol considering a data aggregation technique at relay nodes is required to increase the lifetime of wireless sensor networks. An energy-efficient data-centric routing algorithm is proposed by considering a tradeoff between acquisition time and energy consumption in the wireless sensor network. First, the proposed routing scheme decides the sink node among all sensor nodes in order to minimize the maximum distance between them. Then, the proposed routing extends its tree structure in a way to minimize the link cost between the connected nodes for reducing energy consumption while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed data-centric routing algorithm has short information acquisition time and low energy consumption; thus, it achieves high energy efficiency in the wireless sensor network compared to conventional routing algorithms.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.62-70
• /
• 2005

In this paper, we present an architecture for supporting QoS multicast routing in mobile ad-hoc networks. The proposed architecture consists of three parts as follows. The first part is a mobility-based clustering as underlying structure for supporting stable multicast services. In the second part, a framework which can support and evaluate the stability of route and network for supporting QoS routing is presented. In the third part, we describe a method which uses two structures of the first and second parts for supporting QoS multicast routing services. The performance evaluation of our proposed architecture is accomplished via modeling and simulation using the Optimized Network Engineering tool(OPNET).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.736-741
• /
• 2005

The highly popular algorithm to determine routing path for the multi-hopping wireless sensor network is DSR(Dynamic Source Routing), which is one of the Demand-Driven way to makes the route only when there is a request for sending data. However, because DSR attaches the route's record on the sending packet, the bigger number of sensor node is, the heavier packet in DSR becomes. In this paper, we try to propose the new optimal routing path selecting algorithm which does not make the size of packet bigger by using proper routing table even though the number of sensor node increases, and we try to show our algorithm is more stable and reliable because it is based on the cost function considering some network resources of each sensor node such as power consumption, mobility, traffic in network, distance(hop) between source and destination.