• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.2
• /
• pp.28-34
• /
• 2008

This paper reports the problem in the previous routing protocol, EAR, and proposes an energy aware routing protocol to solve the problem in it. Proposed routing protocol considers the number of hops, the possibility of node exhaustion, and the node energy amount at the same time from the source to the sink. Thereby, it could efficiently solve the potential network separation problem and the sensing hole problem in EAR. Proposed routing protocol could remove the problems in the previous routing protocols but it still gets the advantages in them.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.571-573
• /
• 2009

Mobile Ad-hoc Network(MANET) needs efficient node management because the wireless network has energy constraints. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. Previously proposed a hybrid routing CACH prolong the network lifetime and decrease latency. However the algorithm has a problem when node density is increase. In this paper, we propose a new method that the CACHE(Context-aware Clustering Hierarchy and Energy efficient) algorithm. The proposed analysis could not only help in defining the optimum depth of hierarchy architecture CACH utilize, but also improve the problem about node density.

• Journal of KIISE:Information Networking
• /
• v.33 no.5
• /
• pp.395-406
• /
• 2006

In ad hoc networks, the limited battery capacity of nodes affects a lifetime of network Recently, a large variety of power-aware routing protocols have been proposed to improve an energy efficiency of ad hoc networks. Existing power-aware routing protocols basically consider the residual battery capacity and transmission power of nodes in route discovery process. This paper proposes a new power-aware routing protocol, TDPR(Traffic load & lifetime Deviation based Power-aware Routing protocol), that does not only consider residual battery capacity and transmission power, but also the traffic load of nodes and deviation among the lifetimes of nodes. It helps to extend the entire lifetime of network and to achieve load balancing. Simulations using ns-2[14] show the performance of the proposed routing protocol in terms of the load balancing of the entire network, the consumed energy capacity of nodes, and an path's reliability TDPR has maximum 72% dead nodes less than AODV[4], and maximum 58% dead nodes less than PSR[9]. And TDPR consumes residual energy capacity maximum 29% less than AODV, maximum 15% less than PSR. Error messages are sent maximum 38% less than PSR, and maximum 41% less than AODV.

• ETRI Journal
• /
• v.43 no.4
• /
• pp.674-683
• /
• 2021

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.451-466
• /
• 2003

Untethered nodes in mobile ad-hoc networks strongly depend on the efficient use of their batteries. In this paper, we propose a new metric, the drain rate, to forecast the lifetime of nodes according to current traffic conditions. This metric is combined with the value of the remaining battery capacity to determine which nodes can be part of an active route. We describe new route selection mechanisms for MANET routing protocols, which we call the Minimum Drain Rate (MDR) and the Conditional Minimum Drain Rate (CMDR). MDR extends nodal battery life and the duration of paths, while CMDR also minimizes the total transmission power consumed per packet. Using the ns-2 simulator and the dynamic source routing (DSR) protocol, we compare MDR and CMDR against prior proposals for power-aware routing and show that using the drain rate for power-aware route selection offers superior performance results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.624-629
• /
• 2008

Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an Energy-aware Tree Routing Protocol (ETRP) for Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23.5% in network lifetime.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.177-180
• /
• 2011

In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.62-66
• /
• 2008

In this paper we have proposed a power aware location based routing protocol for wireless ad hoc network. The existing greedy perimeter stateless routing (GPSR) has some problems which are certain node overloaded and void situation. The proposed power aware greedy perimeter stateless routing (PAGPSR) protocol gives a solution for these problems in GPSR. PAGPSR uses power aware and geographically informed neighbor selection to route a packet towards the destination. It also gives a solution for the fundamental problem in geographical routing called communication void. It considers residual energy of battery and distance to the destination for the next hope node selection. When it encounters a void it starts limited-flooding to select next hop node. To evaluate the performance of our protocol we simulated PAGPSR in ns-2. Our simulation results show that our protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR).

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.122-129
• /
• 2010

Energy conservation is one of the most important issues for evaluating the performance of wireless sensor network (WSN) applications. Generally speaking, hierarchical clustering protocols such as LEACH, LEACH-C, EEEAC, and BCDCP are more efficient in energy conservation than flat routing protocols. However, these typical protocols still have drawbacks of unequal and high energy depletion in cluster heads (CHs) due to the different transmission distance from each CH to the base station (BS). In order to minimize the energy consumption and increase the network lifetime, we propose a new hierarchical routing protocol, distance aware intelligent clustering protocol (DAIC), with the key concept of dividing the network into tiers and selecting the high energy CHs at the nearest distance from the BS. We have observed that a considerable amount of energy can be conserved by selecting CHs at the nearest distance from the BS. Also, the number of CHs is computed dynamically to avoid the selection of unnecessarily large number of CHs in the network. Our simulation results showed that the proposed DAIC outperforms LEACH and LEACH-C by 63.28% and 36.27% in energy conservation respectively. The distance aware CH selection method adopted in the proposed DAIC protocol can also be adapted to other hierarchical clustering protocols for the higher energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4844-4864
• /
• 2017

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay.