• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2C
• /
• pp.188-195
• /
• 2012

Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1571-1589
• /
• 2016

Nodes in MANETs are battery powered which makes energy an invaluable resource. In OLSR, MPRs are special nodes that are selected by other nodes to relay their data/control traffic which may lead to high energy consumption of MPR nodes. Therefore, employing energy efficient MPR selection mechanism is imperative to ensure prolonged network lifetime. However, misbehaving MPR nodes tend to preserve their energy by dropping packets of other nodes instead of forwarding them. This leads to huge energy loss and performance degradation of existing energy efficient MPR selection schemes. This paper proposes an energy efficient secure MPR selection (ES-MPR) technique that takes into account both energy and security metrics for MPR selection. It introduces the concept of 'Composite Eligibility Index' (CEI) to examine the eligibility of a node for being selected as an MPR. CEI is used in conjunction with willingness to provide distinct selection parameters for Flooding and Routing MPRs. Simulation studies reveal the efficiency of ES-MPR in selection of energy efficient secure and stable MPRs, in turn, prolonging the network operational lifetime.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.76-90
• /
• 2006

Sensor network consists of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it. The life time of each node in the sensor network significantly affects the life time of whole sensor network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all sensor nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Cluster-Based Power-Efficient Routing (CBPER) Protocol which provides scalable and efficient data delivery to multiple mobile sinks. Previous r(luting protocols, such as Directed Diffusion and TTDD, need to flood many control packets to support multiple mobile sinks and many sources, causing nodes to consume their battery. In CBPER, we use the fact that sensor nodes are stationary and location-aware to construct and maintain the permanent grid structure, which makes nodes live longer by reducing the number of the flooding control packets. We have evaluated CBPER performance with TTDD. Our results show that CBPER is more power-efficient routing protocol than TTDD.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.12
• /
• pp.455-462
• /
• 2016

Wireless sensor networks have been researched to gather data about events on sensor fields from sources at sinks. Multipath routing is one of attractive approaches to reliably send data against the problem of frequent breakages on paths from sources to sinks due to node and link failures. As mobile events such as humans, animals, and vehicles are considered, sources may be continuously generated according to the movement of the mobile event. Thus, mobile events provide new challenging issue in multipath routing. However, the research on multipath routing mainly focus on both efficient multipath construction from sources to static sinks and fast multipath reconstruction against path breakages. Accordingly, the previous multipath routing protocols request each source continuously generated by a mobile event to construct individual multipath from the source to sinks. This induces the increase of multipath construction cost in the previous protocols in proportion to the number of source. Therefore, we propose efficient multipath routing protocol for supporting continuous sources generated by mobile events. In the proposed protocol, new source efficiently reconstructs its multipath by exploiting the existing multipath of previous sources. To do this, the proposed protocol selects one among three reconstruction methods: a local reconstruction, a global partial one, and a global full one. For a selection decision, we provide an analytical energy consumption cost model that calculates the summation of both the multipath reconstruction cost and the data forwarding cost. Simulation results show that the proposed protocol has better performance than the previous protocol to provide multipath routing for mobile events.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.4
• /
• pp.1969-1975
• /
• 2013

ICN (Information-Centric Network) is a next generation Internet communication technology for converting existing Internet communication paradigm to information-based communication paradigm to efficiently use a large amount of information that exists on the Internet. Therefore, unlike existing Internet communication technologies focused on the process of communication using the host address, ICN focuses on the purpose of communication for each information by defining the information of everything that exists on the Internet. For this purpose, ICN uses NbR (Name-based Routing) methods that assign a name to each piece of information, all routers participating in ICN have the physical storage so that they are able to share information with each other. NbR methods on ICN are divided into one-phase routing and two-phase routing depending on how to reach at the storage of each router. However, currently proposed NbR methods cause many problems because they do not reflect the unique characteristics of ICN. Therefore, this paper looked at various NbR issues from caching, access time, distribution, mobility, scaliability, and dissemination of information for an efficient NbR method, and analyzed existing methods proposed for ICN. This paper also proposed a research direction to study the efficient NbR for ICN based on the analysis information.

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

This paper presents an efficient overlay multicast routing protocol (ROMP) and its architecture. ROMP using GPS and region map stands on the basis of scalable 2-tiered multicast architecture and maintains a global overlay multicast tree through reactive fashion. With this approach, the coarse-grain location-awareness for an efficient overlay multicasting and the determination of hot-spot area for efficient data delivery are feasible. The simulation results show that the localized control packets of ROMP prevent the overlay control packets from squandering the physical network resources.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1729-1735
• /
• 2009

The hierarchical routing could cause a lot of energy consumption for transferring data by assigning hierarchical routes although actual nodes could be located in physically near spots. Also, when Node Failure or Association Error occurs, the Hierarchical routing could waste more energy to deliver the control messages. This paper evaluate performance of SHP(Shortest Hop Routing) algorithm that suggests short-cut routing algorithm using NL(Neighbor List) and Redirect_ACK message to improve problem of hierarchical routing algorithm. We do a computer simulation by the size of network, deployment of sensor nodes, sink position and POS. As a result of simulation, SHP has better performance than Zigbee Hierarchical routing and HiLow.

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

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.438-450
• /
• 2006

Geographic routing protocols are very attractive choice for routing in wireless sensor networks because they have been shown to scale better than other alternatives. Under certain ideal conditions, geographic routing works correctly and efficiently. The most commonly used geographic routing protocols include greedy forwarding coupled with face routing. Existing face routing algorithms use planarization techniques that rely on the unit-graph assumption. In real world, many conditions violate the unit-graph assumption of network connectivity, such as location errors, communication voids and radio irregularity, cause failure in planarization and consequently face routing. In this paper, we propose the direction-based geographic routing, which enables energy efficient routing under realistic conditions without planarization techniques. Our proposed approach is for the case in which many sensors need to collect data and send it to a central node. Simulation results show that the protocol exhibits superior performances in terms of energy consumption, delivery success rate, and outperforms the compared protocols.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.262-268
• /
• 2007

The efficient node-energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing total energy consumption of the overall network. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. In this paper, we submit an efficient energy aware routing protocol based on AODV ad hoc routing protocol for wireless sensor networks to increase its lifetime without degrading network performance. The proposed protocol is designed to avoid traffic congestion on minor specific nodes at data transfer and to make the node power consumption be widely distributed to increase the lifetime of the network. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime and end-to-end delay.