• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.262-268
• /
• 2007

The efficient node-energy utilization in wireless sensor networks has been studied because sensor nodes operate with limited power based on battery. To extend the lifetime of the wireless sensor networks, maintaining balanced power consumption between sensor nodes is more important than reducing total energy consumption of the overall network. Since a large number of sensor nodes are densely deployed and collect data by cooperation in wireless sensor network, keeping more sensor nodes alive as possible is important to extend the lifetime of the sensor network. In this paper, we submit an efficient energy aware routing protocol based on AODV ad hoc routing protocol for wireless sensor networks to increase its lifetime without degrading network performance. The proposed protocol is designed to avoid traffic congestion on minor specific nodes at data transfer and to make the node power consumption be widely distributed to increase the lifetime of the network. The performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of network lifetime and end-to-end delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.482-491
• /
• 2007

This paper proposes a k-disjoint-path routing algorithm that provides energy efficient and reliable message transmission in wireless sensor networks. The proposed algorithm sends messages through a single path without the occurrence of critical events. However, it sends through k disjoint paths(k>1) under the occurrence of critical events. The proposed algorithm detects the occurrence of critical events by monitoring changing data patterns, and calculates k from a well-defined fault model and the target-delivery ratio. Our simulations reveal that the proposed algorithm is more resilient to node failure than other routing algorithms, and it also decreases energy consumption and reduces the average delay much more than multi-path and path-repair algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.377-380
• /
• 2010

MANET(Mobile Ad-hoc Network) has been proposed as a infrastructure-less network using distributed algorithm for remote environment monitoring and control. The mobility of MANET would make the topology change frequently compared with a static network and a node is resource-constrained. Hence, to improve the routing protocol in MANET, energy efficient routing protocol is required as well as considering the mobility would be needed. In this paper, we extend RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) structure by a modifying the level of cluster. We call this network protocol CACH-RODMRP. Our contribution consists estimating the optimal level of clustering depth with considering node position and reducing the network residual energy. The simulation results of proposal algorithm show that the energy is significantly reduced compared with the previous clustering based routing algorithm for the MANET.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.5
• /
• pp.419-428
• /
• 2015

Multipath routing technique is recognized as one of the effective approaches to improve the reliability of data forwarding. However, the traditional multipath routing focuses only on how many paths are needed to ensure a desired reliability. For this purpose, the protocols construct additional paths and thus cause significant energy consumption. These problems have motivated the study for the energy-efficient and reliable data forwarding. Thus, this paper proposes an energy-efficient cooperative multipath routing protocol with a small number of paths based on an inter path communication. The inter path communication (namely, cooperative multipath routing) in the proposed protocol helps to reinforce the multipath reliability and reduce the use of network resources. In addition, the proposed protocol provides a reliable end-to-end transmission time by using a transmission recovery method based on the local decision for the path or transmission failures.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.10
• /
• pp.269-276
• /
• 2021

Recently, smart sensors are used in various environments, and the implementation of ad-hoc sensor networks (ASNs) is a hot research topic. Unfortunately, traditional sensor network routing algorithms focus on specific control issues, and they can't be directly applied to the ASN operation. In this paper, we propose a new routing protocol by using the Q-learning technology, Main challenge of proposed approach is to extend the life of ASNs through efficient energy allocation while obtaining the balanced system performance. The proposed method enhances the Q-learning effect by considering various environmental factors. When a transmission fails, node penalty is accumulated to increase the successful communication probability. Especially, each node stores the Q value of the adjacent node in its own Q table. Every time a data transfer is executed, the Q values are updated and accumulated to learn to select the optimal routing route. Simulation results confirm that the proposed method can choose an energy-efficient routing path, and gets an excellent network performance compared with the existing ASN routing protocols.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.466-469
• /
• 2008

The existing routing protocols in USN environment, PEGASIS is more efficient than LEACH, which is a hierarchical routing protocol, for network configuration based on power consumption. Despite its merit that it can reduce energy consumption per node, however, the PEGASIS protocol also has a weakness that it is less responsive to frequent changes that occur in the configuration of sensor network due to BS nodes that keep changing, which is a typical characteristic of the sensor network. To address this problem, this paper proposes to select sub-cluster heads and have them serve as intermediate nodes. This paper presents and analyses that this method can resolve the aforementioned problem of the PEGASIS algorithm.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.276-283
• /
• 2012

Nowadays, wireless sensor networks (WSNs) comprise a tremendously growing infrastructure for monitoring the physical or environmental conditions of objects. WSNs pose challenges to mitigating energy dissipation by constructing a reliable and energy saving network. In this paper, we propose a novel network construction and routing method by defining three different duties for sensor nodes, that is, node gateways, cluster heads, and cluster members, and then by applying a hierarchical structure from the sink to the normal sensing nodes. This method provides an efficient rationale to support the maximum coverage, to recover missing data with node mobility, and to reduce overall energy dissipation. All this should lengthen the lifetime of the network significantly.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.504-527
• /
• 2015

Underwater wireless sensor networks (UWSNs) are similar to the terrestrial sensor networks. Nevertheless, there are different characteristics among them such as low battery power, limited bandwidth and high variable propagation delay. One of the common major problems in UWSNs is determining an efficient and reliable routing between the source node and the destination node. Therefore, researchers tend to design efficient protocols with consideration of the different characteristics of underwater communication. Furthermore, many routing protocols have been proposed and these protocols may be classified as location-based and location-free routing protocols. Pressure-based routing protocols are a subcategory of the location-free routing protocols. This paper focuses on reviewing the pressure-based routing protocols that may further be classified into non-void avoidance protocols and void avoidance protocols. Moreover, non-void avoidance protocols have been classified into single factor based and multi factor based routing protocols. Finally, this paper provides a comparison between these protocols based on their features, performance and simulation parameters and the paper concludes with some future works on which further study can be conducted.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.29-42
• /
• 2011

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.