• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2020-2037
• /
• 2017

In order to improve the energy efficiency of n-Epidemic routing protocol in opportunistic networks, in which a stable end-to-end forwarding path usually does not exist, a novel adjustment strategy for parameter n is proposed using learning atuomata principle. First, nodes dynamically update the average energy level of current environment while moving around. Second, nodes with lower energy level relative to their neighbors take larger n avoiding energy consumption during message replications and vice versa. Third, nodes will only replicate messages to their neighbors when the number of neighbors reaches or exceeds the threshold n. Thus the number of message transmissions is reduced and energy is conserved accordingly. The simulation results show that, n-Epidemic routing protocol with the proposed adjustment method can efficiently reduce and balance energy consumption. Furthermore, the key metric of delivery ratio is improved compared with the original n-Epidemic routing protocol. Obviously the proposed scheme prolongs the network life time because of the equilibrium of energy consumption among nodes.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.1-9
• /
• 2010

Recently, wireless sensor networks(WSNs) technology has been considered as one of the most critical issues in the ubiquitous computing age. The sensor nodes have limited battery power, so they should consume low energy through their operation for the long-lasting lifetime. Therefore, it is essential to use energy efficient routing protocol. For this, we propose a location-based energy-efficient routing protocol which constructs the energy efficient route by considering the quantity of Energy consumed. In addition, we propose a route reconstruction algorithm to handle the disconnection of message transmission. Finally, we show from performance analysis using TOSSIM that our protocol outperforms the existing location based routing protocols in terms of energy efficiency.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.120-129
• /
• 2010

MANET(Mobile Ad Hoc NETwork) is a collection of mobile nodes that are free to move and organize themselves in an arbitrary manner without any fixed infrastructures. These mobile nodes are connected by wireless links and act as routers for all other nodes in the network. As a router each node in MANET consumes its batteries when forwarding a message, and the selection of the best path to minimize the total power needed to route packets is needed to maximize the lifetime of all nodes. In this paper, we propose a routing protocol considering the remaining battery capacity of nodes in the routing paths. The proposed scheme prevents the battery of each node from being overused and increases the lifetime of the network.

• International Journal of Computer Science & Network Security
• /
• v.22 no.9
• /
• pp.389-395
• /
• 2022

A Mobile Sensor Network is widely used in real time applications. A critical need in Mobile Sensor Network is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes"EERA: Energy Efficient Routing Algorithm for Mobile Sensor Network" is divided into five phases. 1, Cluster Formation 2.Cluster head and Transmission head selection 3.Path Establishment / Route discovery and 4,Data Transmission. Experimental Analysis has been done and is found that the proposed method performs better than the existing method with respect to four parameters.

• Journal of the Korea Society for Simulation
• /
• v.13 no.4
• /
• pp.55-69
• /
• 2004

In MANET(Mobile Ad-hoc Network), unlike in wired networks, a path configuration should be in advance of data transmission along a routing path. Frequent movement of mobile nodes, however, makes it difficult to maintain the configured path and requires re-configuration of the path very often. It may also leads to serious problems such as deterioration of QoS in mobile ad-hoc networks. In this paper, we proposed a Reactive Routing Keyword (RRK) routing procedure to solve those problems. Firstly, we noticed it is possible in RRK routing to assign multiple routing paths to the destination node. We applied this feature into active networks and SNMP information based routing by storing unique keywords in cache of mobile nodes corresponding to present and candidate routings in a path configuration procedure. It was shown that the deterioration of QoS which may observed in Dynamic Source Routing(DSR) protocol was greatly mitigated by using the proposed routing technique.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.9-17
• /
• 2007

Network Mobility basic support protocol (NEMO Basic) extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To manage the mobility of the mobile network, it is important to minimize packet overhead, to optimize routing, and to reduce the volume of handoff signals over the nested mobile network. This paper proposes en aggregate router-assisted route optimization (ARARO) scheme for nested mobile networks support which introduces a local anchor router in order to localize handoff and to optimize routing. With ARARO, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to aggregate router (AGR) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new architecture and mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead. To evaluate the scheme, we present the results of simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.777-780
• /
• 2014

The sensor network technology for core technology of ubiquitous computing is in the spotlight recently, the research on sensor network is proceeding actively which is composed many different sensor node. The major traffic patterns of plenty of sensor networks are composed of collecting types of single directional data, which is transmitting packets from several sensor nodes to sink node. One of the important condition for design of sensor node is to extend for network life which is to minimize power-consumption under the limited resources of sensor network. In this work, we analysis adapted routing protocols using the network simulation that was used exiting network and network provider needs will be able to solve the problem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.934-942
• /
• 2005

MANET(Mobile Ad hoc NETwork) routing protocols have merits and demerits under the specific situations. Because it is not clear which protocol is the best under all situations, a suitable routing protocol should be selected depending on the traffic and moving characteristics of nodes. The aim of this paper is to select an appropriate routing protocol to be used by the Korea Coal Corporation. So we designed working scenarios such as coal mining and tunnel supporting that reflected mobile characteristics of nodes. We constructed coal mining and tunnel supporting topology, and analyzed the performance of MANET routing protocols. This result can be used as a basis to select a MANET routing protocol in underground tunnel environment and other mine of the Korea Coal Corporation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1586-1605
• /
• 2012

With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1561-1567
• /
• 2015

Nodes of Mobile ad-hoc network usually use the energy-limited battery. Balanced energy consumptionis important to maintain path's stability. In this paper, we focus on improving the stability of the routing path in mobile ad-hoc networks. For that purpose, we propose a new routing protocol to find the highest minimum node residual energy path among shortest paths. The largest path of minimum value of the remain energy has a longer life than other paths to improve the reliability to data-transmission. Using ns-3 simulator, we show that the proposed routing protocol can provide more long-life stable routing path than AODV and EA-AODV.