• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.225-234
• /
• 2012

In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.576-579
• /
• 2011

Wireless sensor network are widely all over different fields. Because of its distinguished characteristics, we must take account of the factor of energy consumed when designing routing protocol. Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors sends data from the CH (Cluster Head) and then to the BS (Base Station). BCDCP works well in a smallscale network however is not preferred in a large scale network since it uses much energy for long distance wireless communication. TBRP can be used for large scale network, but it weakness lies on the fact that the nodedry out of energy easily since it uses multi-hops transmission data to the Base Station. Here, we proposed a routing protocol. A Cluster Based Energy Efficient Tree Routing Protocol (CETRP) in Wireless Sensor Networks (WSNs) to prolong network life time through the balanced energy consumption. CETRP selects Cluster Head of cluster tree shape and uses maximum two hops data transmission to the Cluster Head in every level. We show CETRP outperforms BCDCP and TBRP with several experiments.

• Journal of Advanced Marine Engineering and Technology
• /
• v.38 no.5
• /
• pp.566-572
• /
• 2014

Recently, indoor navigation has been applied in large convention centers by using wireless sensor networks (WSNs), which provide not only a user's path to be traveled but also orientation and shopping information to increase user's convenience. This paper presents the localization system for estimating relative coordinates without pre-deployment of the reference node based on ultra wide band (UWB) ranging system, which is relatively suitable for indoor localization compared to other wireless communications, and azimuth sensor. The proposed localization system which consists of an azimuth sensor and a mobile node composed of three nodes estimates relative coordinates of the reference node without applying any recursive and time consumption algorithms. Also, in the process of estimating relative coordinates of the reference node, ranging errors are minimized through the proposed technique and the number of nodes can be reduced. Experimental results show the feasibility and validity of the proposed system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.901-923
• /
• 2017

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2433-2452
• /
• 2017

Recently, the pipeline-forwarding has been proposed as a new technique to resolve the end-to-end latency problem of the duty-cycle MAC protocols in Wireless Sensor Networks (WSNs). Some protocols based on this technique such as PMAC and PRI-MAC have shown an improvement not only in terms of reducing end-to-end latency but also in terms of reducing power consumption. In these protocols, however, the sensor nodes still waste a significant amount of energy for unnecessary idle listening during contention period of upstream nodes to check the channel activity. This paper proposes a new pipeline-forwarding duty-cycle MAC protocol, named RP-MAC (Reduced Pipelined duty-cycle MAC), which tries to reduce the waste of energy. By taking advantage of ACK mechanism and shortening the handshaking procedure, RP-MAC minimizes the time for checking the channel and therefore reduces the energy consumption due to unnecessary idle listening. When comparing RP-MAC with the existing solution PRI-MAC and RMAC, our QualNet-based simulation results show a significant improvement in term of energy consumption.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.845-858
• /
• 2020

This paper proposes a modified end-to-end secure low energy adaptive clustering hierarchy (ME-LEACH) algorithm for enhancing the lifetime of a wireless sensor network (WSN). Energy limitations are a major constraint in WSNs, hence every activity in a WSN must efficiently utilize energy. Several protocols have been introduced to modulate the way a WSN sends and receives information. The end-to-end secure low energy adaptive clustering hierarchy (E-LEACH) protocol is a hierarchical routing protocol algorithm proposed to solve high-energy dissipation problems. Other methods that explore the presence of the most powerful nodes on each cluster as cluster heads (CHs) are the sparsity-aware energy efficient clustering (SEEC) protocol and an energy efficient clustering-based routing protocol that uses an enhanced cluster formation technique accompanied by the fuzzy logic (EERRCUF) method. However, each CH in the E-LEACH method sends data directly to the base station causing high energy consumption. SEEC uses a lot of energy to identify the most powerful sensor nodes, while EERRCUF spends high amounts of energy to determine the super cluster head (SCH). In the proposed method, a CH will search for the nearest CH and use it as the next hop. The formation of CH chains serves as a path to the base station. Experiments were conducted to determine the performance of the ME-LEACH algorithm. The results show that ME-LEACH has a more stable and higher throughput than SEEC and EERRCUF and has a 35.2% better network lifetime than the E-LEACH algorithm.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.153-160
• /
• 2009

One of the major challenges of designing a dissemination protocol for Wireless Sensor Networks(WSNs) is energy efficiency. Recently, this issue has received much attention from the research community, and SPMS, which outperforms the well-known protocol SPIN, specially is a representative protocol. In addition, one of many characters of SPMS is the use of the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path as the shortest path, the maximizing of the network lifetime is impossible, though it reduces the energy consumption. In this paper, we propose a dissemination protocol using probability-based clustering which guarantees energy-efficient data transmission and maximizes network lifetime. The proposed protocol solves the network lifetime problem by a novel probability function, which is related to the residual energy and the transmission radius between nodes. The simulation results show that it guarantees energy-efficient transmission and moreover increases the network lifetime by approximately 78% than that of SPMS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2889-2909
• /
• 2017

Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.13-14
• /
• 2007

We propose HERAH(Hierarchical Energy-Aware Routing Algorithm for Heterogeneous Wireless Sensor Networks) that is the hierarchical routing algorithm in WSNs and is established on heterogeneous environment. HERAH performs CH selection by considering residual energy level and uses multi-hop communication within cluster. So, HERAH makes improvements in the energy savings and the network lifetime compared with LEACH.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.77-87
• /
• 2018

Many researches have been focused on localization in WSNs. However, the solutions for localization in static WSN are hard to apply to the mobile WSN. The solutions for mobile WSN localization have the assumption that there are a significant number of anchor nodes in the networks. In the resource limited situation, these solutions are difficult in applying to the static and mobile mixed WSN. Without using the anchor nodes, a localization service cannot be provided in efficient, accurate and reliable way for mixed wireless sensor networks which have a combination of static nodes and mobile nodes. Also, accuracy is an important consideration for localization in the mixed wireless sensor networks. In this paper, we presented a method to satisfy the requests for the accuracy of the localization without anchor nodes in the wireless sensor networks. Hop coordinates measurements are used as an accurate method for anchor free localization. Compared to the other methods with the same data in the same category, this technique has better accuracy than other methods. Also, we applied a minimum spanning tree algorithm to satisfy the requests for the efficiency such as low communication and computational cost of the localization without anchor nodes in WSNs. The Java simulation results show the correction of the suggested approach in a qualitative way and help to understand the performance in different placements.