• Journal of Computing Science and Engineering
• /
• 제9권4호
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• International Journal of Contents
• /
• 제7권1호
• /
• pp.8-13
• /
• 2011

For energy-efficiency in Wireless Sensor Networks (WSNs), when a sensor node detects events, the sensing period for collecting the detailed information is likely to be short. The lifetime of WSNs decreases because communication modules are used excessively on a specific sensor node. To solve this problem, the TARP decentralized network packets to neighbor nodes. It considered the average data transmission rate as well as the data distribution. However, since the existing scheme did not consider the energy consumption of a node in WSNs, its network lifetime is reduced. In this paper, we propose an energy awareness congestion control scheme based on genetic algorithms in WSNs. The proposed scheme considers the remaining amount of energy and the transmission rate on a single node in fitness evaluation. Since the proposed scheme performs an efficient congestion control, it extends the network lifetime. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through performance evaluation. It is shown that the proposed scheme enhances the data fairness and improves the network lifetime by about 27% on average over the existing scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.805-821
• /
• 2011

Wireless Sensor Networks (WSNs) are rapidly emerging because of their potential applications available in military and civilian environments. Due to unattended and hostile deployment environments, shared wireless links, and inherent resource constraints, providing high level security services is challenging in WSNs. In this paper, we revisit various security attack models and analyze them by using a well-known standard notation, Unified Modeling Language (UML). We provide a set of UML collaboration diagram and sequence diagrams of attack models witnessed in different network layers: physical, data/link, network, and transport. The proposed UML-based analysis not only can facilitate understanding of attack strategies, but can also provide a deep insight into designing/developing countermeasures in WSNs.

• ETRI Journal
• /
• 제32권5호
• /
• pp.704-712
• /
• 2010

Authentication is an important service in wireless sensor networks (WSNs) for an unattended environment. Recently, Das proposed a hash-based authentication protocol for WSNs, which provides more security against the masquerade, stolen-verifier, replay, and guessing attacks and avoids the threat which comes with having many logged-in users with the same login-id. In this paper, we point out one security weakness of Das' protocol in mutual authentication for WSN's preservation between users, gateway-node, and sensor nodes. To remedy the problem, this paper provides a secrecy improvement over Das' protocol to ensure that a legal user can exercise a WSN in an insecure environment. Furthermore, by presenting the comparisons of security, computation and communication costs, and performances with the related protocols, the proposed protocol is shown to be suitable for higher security WSNs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1238-1259
• /
• 2019

Saving energy is a big challenge for Wireless Sensor Networks (WSNs), which becomes even more critical in large-scale WSNs. Most energy waste is communication related, such as collision, overhearing and idle listening, so the schedule-based access which can avoid these wastes is preferred for WSNs. On the other hand, clustering technique is considered as the most promising solution for topology management in WSNs. Hence, providing interference-free clustering is vital for WSNs, especially for large-scale WSNs. However, schedule management in cluster-based networks is never a trivial work, since it requires inter-cluster cooperation. In this paper, we propose a clustering method, called Interference-Free Clustering Protocol (IFCP), to partition a WSN into interference-free clusters, making timeslot management much easier to achieve. Moreover, we model the clustering problem as a multi-objective optimization issue and use non-dominated sorting genetic algorithm II to solve it. Our proposal is finally compared with two adaptive clustering methods, HEED-CSMA and HEED-BMA, demonstrating that it achieves the good performance in terms of delay, packet delivery ratio, and energy consumption.

• Journal of Information Processing Systems
• /
• 제11권2호
• /
• pp.205-228
• /
• 2015

In this paper, we present a virtual laboratory platform (VLP) baptized Mercury allowing students to make practical work (PW) on different aspects of mobile wireless sensor networks (WSNs). Our choice of WSNs is motivated mainly by the use of real experiments needed in most courses about WSNs. These experiments require an expensive investment and a lot of nodes in the classroom. To illustrate our study, we propose a course related to energy efficient and safe weighted clustering algorithm. This algorithm which is coupled with suitable routing protocols, aims to maintain stable clustering structure, to prevent most routing attacks on sensor networks, to guaranty energy saving in order to extend the lifespan of the network. It also offers a better performance in terms of the number of re-affiliations. The platform presented here aims at showing the feasibility, the flexibility and the reduced cost of such a realization. We demonstrate the performance of the proposed algorithms that contribute to the familiarization of the learners in the field of WSNs.

• Journal of Communications and Networks
• /
• 제17권5호
• /
• pp.506-516
• /
• 2015

Wireless sensor networks (WSNs) are generally comprised of densely deployed sensor nodes, which results in highly redundant sensor data transmissions and energy waste. Since the sensor nodes depend on batteries for energy, previous studies have focused on designing energy-efficient medium access control (MAC) protocols to extend the network lifetime. However, the energy-efficient protocols induce an extra end-to-end delay, and therefore recent increase in focus on WSNs has led to timely and reliable communication protocols for mission-critical applications. In this paper, we propose an energy efficient and delay guaranteeing node scheduling scheme inspired by biological systems, which have gained considerable attention as a computing and problem solving technique.With the identification of analogies between cellular signaling systems and WSN systems, we formulate a new mathematical model that considers the networking challenges of WSNs. The proposed bio-inspired algorithm determines the state of the sensor node, as required by each application and as determined by the local environmental conditions and the states of the adjacent nodes. A control analysis shows that the proposed bio-inspired scheme guarantees the system stability by controlling the parameters of each node. Simulation results also indicate that the proposed scheme provides significant energy savings, as well as reliable delay guarantees by controlling the states of the sensor nodes.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2022년도 춘계학술발표대회
• /
• pp.94-97
• /
• 2022

The emerging energy harvesting technology, which has been successfully integrated into Wireless Sensor Networks, enables sensor batteries to be charged using renewable energy sources. In the meantime, the problem of Minimum Latency Aggregation Scheduling (MLAS) in battery-powered WSNs has been well studied. However, because sensors have limited energy harvesting capabilities, captured energy is limited and varies greatly between nodes. As a result, all previous MLAS algorithms are incompatible with Battery-Free Wireless Sensor Networks (BF-WSNs). We investigate the MLAS problem in BF-WSNs in this paper. To make the best use of the harvested energy, we build an aggregation tree that leverages the energy harvesting rates of the sensor nodes with an intuitive explanation. The aggregation tree, which determines sender-receiver pairs for data transmission, is one of the two important phases to obtain a low data aggregation latency in the BF-WSNs.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.443-450
• /
• 2012

As for cluster-based wireless sensor networks (WSNs), cluster lifetime is one of the most important subjects in recent researches. Besides reducing the energy consumptions of the clusters, it is necessary to make the clusters achieve equal lifetimes so that the whole network can survive longer. In this paper, we focus on the cluster lifetimes in multi-hop WSNs with cooperative multi-input single-output scheme. With a simplified model of multi-hop WSNs, we change the transmission schemes, the sizes and transmission distances of clusters to investigate their effects on the cluster lifetimes. Furthermore, linear and uniform data aggregations are considered in our model. As a result, we analyze the cluster lifetimes in different situations and discuss the requirements on the sizes and transmission distances of clusters for equal lifetimes.

• 전기전자학회논문지
• /
• 제20권4호
• /
• pp.449-453
• /
• 2016

열악한 자연환경에 무작위로 배포되는 무선센서 네트워크(Wireless Sensor Networks : WSNs)의 센서 노드(node)에서의 고장은 필수적으로 발생하며, 무선센서 네트워크의 설계시 고려되어야 할 핵심과제이다. 본 논문에서는 센서노드에서 발생 가능한 고장모델을 분류하였다. 특히 CH(Cluster Head) 노드에 고장이 발생할 경우 고장을 복구 가능한 새로운 코드방식을 제안하고, 고장 복구 알고리즘을 제시하였다. 제안한 코드 방식은 기존 해밍코드대비 정보길이 16비트 이하에서 동등한 크기의 패리티 비트를 가지며, 코드 발생이 아주 간단한 장점을 가진다. 이것은 전력효율을 높이면서 WSN의 안정성을 유지하는 데 매우 중요하다.