• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2181-2202
• /
• 2016

In Wireless Sensor Networks (WSNs) and even in the Internet of Things (IoT) ecosystem, the reconfiguration of sensor variables is an important problem when the role of a system (or application) program's sensor nodes needs to be adjusted in a particular situation. For example, the outdoor temperature in a volcanic zone, which is usually updated in a system every 10 s, should be updated every 1 s during an emergency situation. To solve this problem, this paper proposes a novel approach based on changing only a set of sensor variables in a part of a program, rather than modifying the entire program, in order to reduce both network congestion and the sensor nodes' battery consumption. To validate our approach, we demonstrate an implementation of a proof-of-concept prototype system and also present results of comparative studies showing the performance and effectiveness of our proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.338-348
• /
• 2009

The Wireless Sensor Network (WSN) has recently attracted considerable attention due to the low price and ease to deploy it. In particular, in a hostile or harsh regions where sensors cannot be deployed manually, WSNs can be established just by dropping sensors from the air. In this case, however, most likely sensors are not placed at optimal positions, although the location of sensors does have a drastic impact on the WSN performance. Moreover, randomized deployment algorithm can leave holes in terms of coverage in the sensing area. This paper proposes a sensor relocation scheme where mobile sensors move to patch up the holes by appropriate coverage. Simulation results show that the proposed algorithm outperforms prior existing schemes in terms of coverage and lifespan of WSNs.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.247-255
• /
• 2015

In this paper, we propose an adaptive time division multiple access based medium access control (MAC) protocol, called bitmap-assisted shortest job first based MAC (BS-MAC), for hierarchical wireless sensor networks (WSNs). The main contribution of BS-MAC is that: (a) It uses small size time slots. (b) The number of those time slots is more than the number of member nodes. (c) Shortest job first (SJF) algorithm to schedule time slots. (d) Short node address (1 byte) to identify members nodes. First two contributions of BS-MAC handle adaptive traffic loads of all members in an efficient manner. The SJF algorithm reduces node's job completion time and to minimize the average packet delay of nodes. The short node address reduces the control overhead and makes the proposed scheme an energy efficient. The simulation results verify that the proposed BS-MAC transmits more data with less delay and energy consumption compared to the existing MAC protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5014-5034
• /
• 2016

This paper discusses how to effectively guarantee the coverage and connectivity quality of wireless sensor networks when joint perception model is used for the nodes whose communication ranges are multi-level adjustable in the absence of position information. A Connect Coverage Algorithm Based on Joint Sensing model (CCAJS) is proposed, with which least working nodes are chosen based on probability model ensuring the coverage quality of the network. The algorithm can balance the position distribution of selected working nodes as far as possible, as well as reduce the overall energy consumption of the whole network. The simulation results show that, less working nodes are needed to ensure the coverage quality of networks using joint perception model than using the binary perception model. CCAJS can not only satisfy expected coverage quality and connectivity, but also decrease the energy consumption, thereby prolonging the network lifetime.

• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.108-117
• /
• 2009

Data aggregation is one of the well-known techniques to reduce the energy consumption for information transmission over wireless sensor networks (WSN). As the WSNs are deployed in untrusted or even hostile environments, the data aggregation becomes problematic when end-to-end data privacy including data confidentiality and integrity between sensor nodes and base station, is required. Meanwhile, data homomorphic cryptoschemes have been investigated recently and recommended to provide the end-to-end privacy in the hostile environments. In order to assure both data confidentiality and integrity for data aggregation, this paper analyzes the existing homomorphic cryptoschemes and digital signature schemes, proposes possible combinations, and evaluates their performance in terms of CPU overheads and communication costs.

• International Journal of Computer Science & Network Security
• /
• v.22 no.9
• /
• pp.327-333
• /
• 2022

Wireless Sensor Networks (WSNs) plays an important role in our everyday life. WSN is distributed in all the places. Nowadays WSN devices are developing our world as smart and easy to access and user-friendly. The sensor is connected to all the resources based on the uses of devices and the environment [1]. In WSN, Quality of Service is based on time synchronization and scheduling. Scheduling is important in WSN. The schedule is based on time synchronization. Min-Max data size scheduling is used in this proposed work. It is used to reduce the Delay & Energy. In this proposed work, Two-hop neighboring node is used to reduce energy consumption. Data Scheduling is used to identify the shortest path and transmit the data based on weightage. The data size is identified by three size of measurement Min, Max and Medium. The data transmission is based on time, energy, delivery, etc., the data are sent through the first level shortest path, then the data size medium, the second level shortest path is used to send the data, then the data size is small, it should be sent through the third level shortest path.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3889-3903
• /
• 2017

Fast and accurate localization of randomly deployed nodes is required by many applications in wireless sensor networks (WSNs). However, mobile nodes localization in WSNs is more difficult than static nodes localization since the nodes mobility brings more data. In this paper, we propose a Range-based Monte Carlo Box (RMCB) algorithm, which builds upon the Monte Carlo Localization Boxed (MCB) algorithm to improve the localization accuracy. This algorithm utilizes Received Signal Strength Indication (RSSI) ranging technique to build a sample box and adds a preset error coefficient in sampling and filtering phase to increase the success rate of sampling and accuracy of valid samples. Moreover, simplified Particle Swarm Optimization (sPSO) algorithm is introduced to generate new samples and avoid constantly repeated sampling and filtering process. Simulation results denote that our proposed RMCB algorithm can reduce the location error by 24%, 14% and 14% on average compared to MCB, Range-based Monte Carlo Localization (RMCL) and RSSI Motion Prediction MCB (RMMCB) algorithm respectively and are suitable for high precision required positioning scenes.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.1291-1293
• /
• 2007

Due to dense deployment and innumerable amount of traffic flow in wireless sensor networks (WSNs), congestion becomes more common phenomenon from simple periodic traffic to unpredictable bursts of messages triggered by external events. Even for simple network topology and periodic traffic, congestion is a likely event due to dynamically time varying wireless channel condition and contention caused due to interference by concurrent transmissions. In this paper, we have proposed three mechanisms: upstream source count and buffer based rate control and snoop based MAC level ACK scheme to avoid congestion. The simulation results show that our proposed mechanism achieves around 80% delivery ratio even under bursty traffic condition

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4781-4803
• /
• 2017

Environmental monitoring systems using Wireless Sensor Networks (WSNs) face the challenge of high power consumption, due to the high levels of multi-hop data communication involved. In order to overcome the issue of fast energy depletion, a proof-of-concept implementation proves that adopting a clustering algorithm in environmental monitoring applications will significantly reduce the total power consumption for environment sensor nodes. In this paper, an energy-efficient WSN-based environmental monitoring system is proposed and implemented, using eight sensor nodes deployed over an area of $1km^2$, which took place in the city of Tabuk in Saudi Arabia. The effectiveness of the proposed environmental monitoring system has been demonstrated through adopting a number of real experimental studies.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.72-76
• /
• 2012

In this paper, the capacity criteria have been proposed in order to select a cooperative relay node in WSNs, under the environment where direct path has a poor link gain. This process may ensure the efficiency improvement of signal transfer between source and destination and reduction of energy consumption as well. Two criteria are incorporated to select a cooperative relay node. Firstly, calculate the energy gain ratio between the relay path and the direct path. Secondly, investigate the effects of relay node's usage in WSNs through the simulation in terms of energy consumption. In the simulation, the relationship between energy consumption and direct path gain, uniformly generated in the certain range and its positive effects have been identified.