• ETRI Journal
• /
• 제43권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1790-1806
• /
• 2015

Utility-based routing is a special type of routing approach using a composite utility metric when making routing decisions in ad hoc and sensor networks. Previous studies on the utility-based routing all use fixed retry limit and a very simple distance related energy model, which makes the utility maximization less efficient and the implementation separated from practice. In this paper, we refine the basic utility model by capturing the correlation of the transmit power, the retry limit, the link reliability and the energy cost. A routing algorithm based on the refined utility model with adaptive transmit power and retry limit allocation is proposed. With this algorithm, packets with different priorities will automatically receive utility-optimal delivery. The design of this algorithm is based on the observation that for a given benefit, there exists a utility-maximum route with optimal transmit power and retry limit allocated to intermediate forwarding nodes. Delivery along the utility-optimal route makes a good balance between the energy cost and the reliability according to the value of the packets. Both centralized algorithm and distributed implementations are discussed. Simulations prove the satisfying performance of the proposed algorithm.

• Journal of IKEEE
• /
• 제24권1호
• /
• pp.326-332
• /
• 2020

This paper presents the design of a routing metric for energy-efficient and low-delay path selection and a new routing protocol utilizing the metric in duty-cycyled wireless sensor networks. The new routing metric based on duty cycle, EDW, can reduce the energy and delay of transmission paths, which represents total waiting time from source to destination due to duty cycle. Therefore, in this paper, we propose a new multipath routing protocol based on cross-layer information utilizing the new routing metric, and simulation results show that the proposed protocol shows better performance of end-to-end delay and energy consumption.

• Proceedings of the Korea Society for Simulation Conference
• /
• 한국시뮬레이션학회 2005년도 춘계학술대회 논문집
• /
• pp.144-148
• /
• 2005

The sensor network consists of sensor nodes which communicate wirelessly. It requires energy-efficient routing protocols. We measure requirements in routing protocols by using simulation techniques. In this paper, we propose a random routing algorithm and evaluate it by simulation.

• Journal of information and communication convergence engineering
• /
• 제22권1호
• /
• pp.1-6
• /
• 2024

Energy efficiency in wireless sensor networks (WSNs) is a critical issue because batteries are used for operation and communication. In terms of scalability, energy efficiency, data integration, and resilience, WSN-cluster-based routing algorithms often outperform routing algorithms without clustering. Low-energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol with a high transmission efficiency to the base station. In this paper, we propose an energy consumption model for LEACH and compare it with the existing LEACH, advanced LEACH (ALEACH), and power-efficient gathering in sensor information systems (PEGASIS) algorithms in terms of network lifetime. The energy consumption model comprises energy-sensitive cluster formation and a cluster head selection technique. The setup and steady-state phases of the proposed model are discussed based on the cluster head selection. The simulation results demonstrated that a low-energy-consumption network was introduced, modeled, and validated for LEACH.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2009년도 춘계학술발표대회
• /
• pp.1167-1169
• /
• 2009

Multipath routing in wireless sensor networks has been proven to provide with increased data delivery ratio, security, robustness to node and link failures, network throughput, etc. However, the energy cost for multiple routes construction and their maintenance is very high. This paper proposes a sink-initiated, node-disjoint multipath routing protocol for static wireless sensor networks that significantly minimizes the route construction messages and thereby saves the critical batter energy of sensor nodes. It also distributes the traffic load spatially over many nodes in the forwarding paths, which ensures balanced energy consumption in the network and thereby increases the network lifetime. The simulation results show that it decreases the routing overhead as well as the standard deviation of nodes' residual energies.

• Journal of Convergence Society for SMB
• /
• 제4권1호
• /
• pp.7-15
• /
• 2014

In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권4호
• /
• pp.529-546
• /
• 2010

Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local information to forward packets to the destination and does not have to maintain the routing table, and thus it takes small overhead and has excellent scalability. However, the signal intensity reduces exponentially with the distance in realistic wireless sensor network, and greedy forwarding consumes a lot of energy, since it forwards the packets to the neighbor node closest to the destination. Previous proposed greedy forwarding protocols are the sender-based greedy forwarding that a sender selects a neighbor node to forward packets as the forwarding node and hence they cannot guarantee energy efficient forwarding in unpredictable wireless environment. In this paper, we propose the receiver-based greedy forwarding called RGF where one of the neighbor nodes that received the packet forwards it by itself. In RGF, sender selects several energy efficient nodes as candidate forwarding nodes and decides forwarding priority of them in order to prevent unnecessary transmissions. The simulation results show that RGF improves delivery rate up to maximum 66.8% and energy efficiency, 60.9% compared with existing sender-based greedy forwarding.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.269-294
• /
• 2010

The interconnection of mobile devices in urban environments can open up a lot of vistas for collaboration and content-based services. This will require setting up of a network in an urban environment which not only provides the necessary services to the user but also ensures that the network is secure and energy efficient. In this paper, we propose a secure, energy efficient dynamic routing protocol for heterogeneous wireless sensor networks in urban environments. A decision is made by every node based on various parameters like longevity, distance, battery power which measure the node and link quality to decide the next hop in the route. This ensures that the total load is distributed evenly while conserving the energy of battery-constrained nodes. The protocol also maintains a trusted population for each node through Dynamic Trust Factor (DTF) which ensures secure communication in the environment by gradually isolating the malicious nodes. The results obtained show that the proposed protocol when compared with another energy efficient protocol (MMBCR) and a widely accepted protocol (DSR) gives far better results in terms of energy efficiency. Similarly, it also outdoes a secure protocol (QDV) when it comes to detecting malicious nodes in the network.

• Journal of Korea Multimedia Society
• /
• 제24권8호
• /
• pp.1068-1075
• /
• 2021

Wireless sensor network (WSN) can be usefully used in battlefields requiring rapid installation and operation by enabling surveillance and reconnaissance using small sensors in areas where any existing network infrastructure is not formed. As WSN uses battery, energy efficiency acts as a very important issue in network survivability. Layer-based routing protocols have been studied a lot in the aspect of energy efficiency. Many research selected LEACH and PEGASIS protocols as their comparison targets. This study examines the two protocols and LECEEP, a protocol designed by combining their advantages, and proposes a new protocol, A-LECEEP, which is more energy efficient than the others. The proposed protocol can increase energy efficiency compared to the existing ones by eliminating unnecessary transmissions with multiple chains configuration.