• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.620-628
• /
• 2014

Various on-demand manner routing protocols have been proposed for efficient energy consumption in mobile ad-hoc networks. Some of the protocols tried to extend the network lifetime by periodically rerouting paths according to the energy consumption rate of nodes. However, those protocols suffer from frequent flooding and high overhead. This paper proposed a new routing protocol called ALPMR (Adaptive Local Path Modification Routing) that extends the network lifetime by using local path rerouting. The proposed ALPMR protocol performs local rerouting around nodes with little remaining energy as well as data congestion, thus reduces flooding and routing overhead and can extend the network lifetime. The performance of ALPMR protocol is observed using ns-2 simulator.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.2
• /
• pp.48-62
• /
• 2006

In recent years, wireless sensor networks(WSNs) have emerged as a new fast-growing application domain for wireless distributed computing and embedded systems. Recent Progress in computer and communication technology has made it possible to organize wireless sensor networks composed tiny sensor nodes. Furthermore, ad-hoc network protocols do not consider the characteristics of wireless sensor nodes, making existing ad-hoc network protocols unsuitable for the wireless sensor networks. First, we propose power-aware routing protocols based on energy-centered routing metrics. Second, we describe power management techniques for wireless sensor nodes using the spatial locality of sensed data. Many nodes can go into a power-down mode without sacrificing the accuracy of sensed data. Finally, combining the proposed techniques, we describe an overall energy-efficient protocol for data collection. Experimental results show that the proposed routing protocol can extend the routing path lifetime more than twice. The average energy consumption per sensing period is reduced by up to 30%.

• Journal of Information Technology Services
• /
• v.6 no.1
• /
• pp.141-149
• /
• 2007

Sensor node's mobility brings new challenges to data dissemination in large sensor networks. Frequent location updates of sensor nodes can lead to both excessive drain of sensor's limited battery supply and increased collisions in wireless transmissions. Conventional studies for routing protocols in wireless sensor networks are not enough to cover energy consumption and migration of sensor nodes. This study proposes a dynamic routing protocol based on the SPIN considering energy consumption and the migration, and also shows the effectiveness of the proposed routing protocol.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.974-985
• /
• 2016

Riverbed Modeler, which is a commercial packet-level discrete event simulator is used to model, design, and simulate complicated communication protocols and large-scale network. Riverbed Modeler got credit for its reliability in field of network simulation. In the MANET simulation environment using Riverbed Modeler, it is very complicated to add a new routing protocol into existing architecture of routing protocols because it is required lots of modifications of protocol recognition. In this paper, we propose Routing Adding Framework which can reduce errors or mistakes during modifying the existing routing support architecture. Routing Adding Framework is provided as a adapter API for protocol recognition. and it is only minimum modifications for protocol identifiers when a new routing protocol is added to the child process of manet_mgr process which manages routing protocols for IP layer. With Routing Adding Framework, we can reduce less than half modification. Then, we shows an example of implementation of a hybrid routing protocol AntHocNet using Routing Adding Framework, and we verify its design and application of the Routing Adding Framework by obtaining simulation result with similar result given by AntHocNet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1226-1237
• /
• 2007

This paper proposes QoS mesh routing protocol for IEEE 802.16 based wireless mesh networks. QoS mesh routing protocol proposed in this paper is a proactive hop-by-hop QoS routing protocol. The goal of our routing protocol is not only to find a route from a source to a destination, but also optimal route that satisfies QoS requirements, given in terms of bandwidth and delay as default QoS parameters. In this paper, we first analyze possible types of routing protocols that have been studied for MANET and show proactive hop-by-hop routing protocols are the most appropriate for wireless mesh networks. Then, we present a network model for IEEE 802.16 based wireless mesh networks and propose a proactive hop-by-hop QoS routing protocol. Through our simulation, we represent that our routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.629-636
• /
• 2009

Since all sensor nodes in wireless sensor networks work by their own embedded batteries, if a node runs out of its battery, the sensor network can not operate normally. In this situation we should employ the routing protocols which can consume the energy of nodes efficiently. Many protocols for energy efficient routing in sensor networks have been suggested but LEACH and PEGASIS are most well known protocols. However LEACH consumes energy heavily in the head nodes and the head nodes tend to die early and PEGASIS - which is known as a better energy efficient protocol - has a long transfer time from a source node to sink node and the nodes close to the sink node expend energy sharply since it makes a long hop of data forwarding. We proposed a new hybrid protocol of LEACH and PEGASIS, which uses the clustering mechanism of LEACH and the chaining mechanism of PEGASIS and it makes the life time of sensor networks longer than other protocols and we improved the performance 33% and 18% higher than LEACH-C and PEGASIS respectively.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.103-112
• /
• 2006

Since sensor node has a limited energy supply in a wireless sensor network, it is very important to maximize the network lifetime through energy-efficient routing. Thus, many routing protocols have been developed for wireless sensor networks and can be classified into flat and hierarchical routing protocols. Recent researches focus on hierarchical routing scheme and LEACH is a representative hierarchical routing protocol. In this paper, we investigated the problems of the LEACH and proposed a novel energy efficient routing scheme, called ENTER(ENergy efficient Two-tiEr Routing protocol), to resolve the problem. ENTER reduces an energy consumption and increases a network lifetime by organizing clusters by the same distributed algerian as in the LEACH and establishing paths among cluster-heads to transmit the aggregated data to the sink node. We compared the performance of the ENTER with the LEACH through simulation and showed that the ENTER could enhance the network lifetime by utilizing the resources more efficiently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.768-777
• /
• 2020

In this paper, we describe recent research results on AODV routing protocol, which is widely deployed at mobile ad hoc networks, and AODV related routing protocols with multi-path routing schemes. We suggest the critical problems which minimum hop routing schemes have, such as AODV routing protocol, and then, propose a new C-AODV routing protocol with two routing metrics: the primary metric is the hop count, the secondary metric is the sum of link delay times. We implemented C-AODV protocol by modifying AODV at the NS-3, and thus, elaborate on how we change the original AODV source code of NS-3 in order to implement the C-AODV scheme. We show numerical comparison of C-AODV scheme with the original AODV scheme and then, discuss how much the C-AODV enhances routing performance over AODV protocol. In conclusion, we present future research items.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.257-269
• /
• 2007

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different coflict probabilities are conducted.