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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5442-5463
• /
• 2016

Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1618-1637
• /
• 2014

Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4738-4753
• /
• 2018

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.69-76
• /
• 2009

The construction of Internet IP-based Network is composed of router and switch models in a variety of companies. The construction by various models causes the complexity of the management and control as different types of CLI is used by different company to filter out abnormal traffics like worm, virus, and DDoS. To improve this situation, IETF is working on enacting XML based configuration standards from NETCONF working group, but currently few commands processing at the level of operation layer on NETCONF are only standardized and it's hard for unified control operation process between different make of system as different company has different XML command to filter out abnormal traffics. This thesis proposes ways to prevent abnormal attacks and increase efficiency of network by re-routing the abnormal traffics coming thru unified control for different make of systems into Sinkhole router and designing a control system to efficiently prevent various attacks after checking the possibility of including abnormal traffics from unified control operation.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.139-146
• /
• 2007

Mobile Sensor Network(MSN) is actively studied due to the advent of mobile sensors such as Robomote and Robotic Sensor Agents(RSAs), However, existing studies on MSN have mainly focused on coverage hole problem which occurs in Stationary Sensor Network(SSN). To address coverage hole problem, these studies make mobile sensors move temporarily so that they do not make the best use of the mobility of mobile sensors, Thus, a mechanism utilizing the continuous movement of mobile sensors is proposed to improve the network coverage performance. However, this mechanism is presently immature and does not explain how to make routing path and send data from mobile sensors to a sink node, Therefore, to efficiently make routing path and send data from mobile sensors to a sink node, we propose a communication protocol for mobile sensor network where mobile sensors continuously move. The proposed protocol deploys not only mobile sensors but also stationary sensors which send sensing data to a sink node instead of mobile sensors. Simulation results show that the proposed protocol improves the performance in terms of network coverage and traffic overhead, compared to conventional SSN protocols.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.414-426
• /
• 2021

In the task of data routing in Internet of Things enabled volatile underwater environments, providing better transmission and maximizing network communication performance are always challenging. Many network issues such as void holes and network isolation occur because of long routing distances between nodes. Void holes usually occur around the sink because nodes die early due to the high energy consumed to forward packets sent and received from other nodes. These void holes are a major challenge for I-UWSANs and cause high end-to-end delay, data packet loss, and energy consumption. They also affect the data delivery ratio. Hence, this paper presents an energy efficient watchman based flooding algorithm to address void holes. First, the proposed technique is formally verified by the Z-Eves toolbox to ensure its validity and correctness. Second, simulation is used to evaluate the energy consumption, packet loss, packet delivery ratio, and throughput of the network. The results are compared with well-known algorithms like energy-aware scalable reliable and void-hole mitigation routing and angle based flooding. The extensive results show that the proposed algorithm performs better than the benchmark techniques.