• Journal of Ubiquitous Convergence Technology
• /
• v.1 no.1
• /
• pp.35-41
• /
• 2007

In mobile ad-hoc wireless networks, one of the most important challenging issues is how to conserve energy, maximizing the lifetime of route(networks) in the view points of both power and mobility of nodes. However, many transmission methods presented in the previous works can not satisfy these two objectives simultaneously. To obtain these two goals, in this paper we propose an architecture to support power saving transmission services with route stability in mobile ad-hoc wireless networks. The proposed architecture consists of two parts, the underlying route stability method to support route(network) lifetime and the power saving transmission methods. The performance evaluation of the proposed architecture is achieved via simulation and analysis.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.23-32
• /
• 2005

This paper proposes a new algorithm for the energy constraint ad-hoc network which efficiently spread the energy usage over the network through the backup route scheme in order to increase the network lifetime. Recently, the various energy-efficient routing algorithms based on On-demanding method are proposed. Among them, PSR(Power-aware Source Routing) increased the network lifetime through the periodical route alternation depended on the use of the battery while DSR(Dynamice Source Routing) uses only the route selected during the route discovery phase. But PSR has a problem that it increases the route overhead because of the frequent flooding for the route alternation. For solving this problem, we propose HPSR(Hierarchical Power-aware Source Routing) which uses the backup route set during the route discovery in order to alternation the route without the flooding. HPSR increases the network lifetime due to the frequent route alternation using backup route while it decreases the routing overhead due to the reduced flooding. In this paper, we also prove the performance of HPSR through the simulation using OPNET.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.23-28
• /
• 2008

In this paper, we propose location-aided cooperative routing protocol (LACARP) for supporting power saving and stable route lifetime in mobile ad-hoc wireless sensor networks. The main ideas and features of the proposed routing protocol are as follows. First, the definition of the area of route search using location-based information to support power saving transmission. Second, the expect zone-based establishment of routing route within the area of route search. Third, the cooperative-aided transmission method. In the operation of data transmission over the established rout the datas are transmitted via both the established route and cooperative route aided by neighbor nodes. The performance evaluation using OPNET(Optimized Network Engineering Tool) shows the LACARP can improve the packet delivery ratio and power saving transmission efficiently.

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

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.87-93
• /
• 2016

In this paper, we propose a RF energy harvesting based routing protocol in mobile ad-hoc wireless sensor networks. The main features and contributions of the proposed routing protocol are as follows. First, establishment of routing route based on both remaining energy of mobile sensor nodes and RF energy harvesting. Second, establishment of routing route by considering availability and stability of route based on energy of mobile sensor nodes to increase lifetime of networks and route. The performance evaluation of the proposed routing protocol using OPNET shows that the routing method considering both route availability and route stability based on RF energy harvesting can increase efficiently route lifetime.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.55-65
• /
• 2010

We present a method for increasing network lifetime without link failure due to lack of battery capacity of nodes in wireless ad-hoc networks with low mobility. In general, a node with larger remaining battery capacity represents the one with lesser traffic load. Thus, a modified AODV routing protocol is proposed to determine a possible route by considering a remaining battery capacity of a node. Besides, the total energy consumption of all nodes increase rapidly due to the huge amount of control packets which should be flooded into the network. To reduce such control packets efficiently, a source node can store information about alternative routes to the destination node into its routing table. When a link failure happens, the source node should retrieve the route first with the largest amount of the total remaining battery capacity from its table entries before initiating the route rediscovery process. To do so, the possibility of generating unnecessary AODV control packets should be reduced. The method proposed in this paper increases the network lifetime by 40% at most compared with the legacy AODV and MMBCR.

• Journal of the Korea Society for Simulation
• /
• v.13 no.2
• /
• pp.53-63
• /
• 2004

In ad hoc networks, the link survivability is firstly considered if a routing between two mobile nodes takes place through wireless environments, because all of mobile nodes participating in a connection dynamically move to anywhere. Also, mobile nodes have multi-role to implement a communication without a static system supported by wired networks. Hence, it is difficult that all mobile nodes continuously provide a reliable connection when the nodes operate each role for the connection. Therefore, it is desired to maximize the lifetime of a route as long as possible for the reliable communication. In this paper, we propose a proactive link management scheme that can provide the continuous route supported by the link handover. It consider the wireless link quality and the power lifetime of a node so that the link handover is implemented for the link survivability without disconnecting the route on the communication.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.2
• /
• pp.156-161
• /
• 1997

In this thesis, based on Genetic Algorithm, a new route search algorithm is presented to search an optimal route between the origin and the destination in intelligent route guidance systems in order to minimize the route traveling time. The proposed algorithm is effectively employed to complex road networks which have diverse turn constrains, time-delay constraints due to cross signals, and stochastic traffic volume. The algorithm is also shown to significantly promote search efficiency by changing the population size of path individuals that exist in each generation through the concept of age and lifetime to each path individual. A virtual road-traffic network with various turn constraints and traffic volume is simulated, where the suggested algorithm promptly produces not only an optimal route to minimize the route cost but also the estimated travel time for any pair of the origin and the destination, while effectively avoiding turn constraints and traffic jam.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.25-37
• /
• 2007

The existing route re-establishment methods which intend to extend the lifetime of the network attempt to find new routes in order not to overly consume energy of certain nodes. These methods outperform other routing algorithms in the network lifetime extension aspect because they try to consume energy evenly for the entire network. However, these algorithms involve heavy signaling overheads because they find new routes based on the flooding method and route re-acquisition occurs often. Because of the overhead they often can not achieve the level of performance they intend to. In this paper, we propose a new route re-acquisition algorithm ARROW which takes into account the cost involved in the packet transmission and the route re-acquisition. Since the proposed algorithm considers future route re-acquisition costs when it first finds the route, it spends less energy to transmit given amount of data while evenly consuming the energy as much as possible. Using 2-dimensional Markov Chain model, we compare the performance of the proposed algorithm and that of other algorithms. Analysis results show that the proposed algorithm outperforms the existing route re-acquisition methods in the signaling overhead and network lifetime aspects.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.611-620
• /
• 2007

Distributing the routing path over the entire network is an important factor to maintain the lifetime of wireless sensor network as long as possible. This paper proposes a fuzzy routing protocol that decides a routing path based on the fuzzy control rules. The fuzzy controller receives the energy values, distances, and hop counts of possible route paths as input, and the inference engine produces the contribution factors for each of route paths. The route path with the largest contribution factor is elected as the final routing path. The nodes contained in the routing path reduce their energy after transmitting a data packet so as to prevent the same route path from being selected repeatedly. It makes the network traffic spreaded over the network resulting longer network lifetime. The computer simulations on TinyOS have shown that the fuzzy routing protocol is more energy efficient and has longer network lifetime compared to the existing routing protocols.