• Journal of Applied Reliability
• /
• v.6 no.4
• /
• pp.297-306
• /
• 2006

In this paper, We presented the algorithm for estimating a reliability between nodes in wireless distributed sensor networks (DSN). To estimate the reliability between nodes, we first modeled DSN as probability graph. Links of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp operation to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.326-336
• /
• 2019

A wireless power transfer technique can solve the power capacity problem in wireless rechargeable sensor networks (WRSNs). The charging strategy is a wide-spread research problem. In this paper, we propose a demand-based charging strategy (DBCS) for WRSNs. We improved the charging programming in four ways: clustering method, selecting to-be-charged nodes, charging path, and charging schedule. First, we proposed a multipoint improved K-means (MIKmeans) clustering algorithm to balance the energy consumption, which can group nodes based on location, residual energy, and historical contribution. Second, the dynamic selection algorithm for charging nodes (DSACN) was proposed to select on-demand charging nodes. Third, we designed simulated annealing based on performance and efficiency (SABPE) to optimize the charging path for a mobile charging vehicle (MCV) and reduce the charging time. Last, we proposed the DBCS to enhance the efficiency of the MCV. Simulations reveal that the strategy can achieve better performance in terms of reducing the charging path, thus increasing communication effectiveness and residual energy utility.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.29-36
• /
• 2016

A wireless passive sensor network is a network which, by letting separate RF sources supply energy to sensor nodes, is able to live an eternal life without batteries. Against expectations about an eternal life, however, a wireless passive sensor network still has many problems; scarcity of energy, non-simultaneity of energy reception and data transmission and inefficiency in resource allocation. In this paper, we focus on a wireless passive sensor network providing a packet service which is tolerable to packet losses but requires timely delivery of packets. Perceiving the practical constraints, we then consider a contending-type MAC scheme, rooted in framed and slotted ALOHA, for supporting many sensor nodes to deliver packets to a sink node. Next, we investigate the network-wide throughput achieved by the MAC scheme when the packets transmitted by geographically scattered sensor nodes experience path losses hence capture phenomena. Especially, we derive an exact formula of network-wide throughput in a closed form when 2 sensor nodes reside in the network. By controlling design parameters, we finally optimize the contending-type MAC scheme as to attain the maximum network-wide throughput.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.15-24
• /
• 2008

In this paper, we propose a Cross-Layer Transmission Architecture (CLTA) to support power saving high-speed multimedia services in mobile ad-hoc wireless sensor networks(MAWSN). The main goals of this paper are in showing and proposing how the routing routes are decided on route stability based on mobility of mobile nodes to increase the operational lifetime of routes as well as how the transmit power can be saved in mobile ad-hoc wireless sensor networks. To obtain these goals, we propose a cross-layer architecture strategy which combines network layer technology with physical layer technology to get synergy effects in the view of transmission power saving. We consider a realistic approach, in the points of view of the MAWSN, based on mobile sensor nodes as well as fixed sensor nodes in sensor fields while the conventional research for sensor networks focus on mainly fixed sensor nodes. The performance evaluation of the proposed CLTA is performed via simulation and analysis.

• Journal of Sensor Science and Technology
• /
• v.20 no.2
• /
• pp.137-144
• /
• 2011

Wireless sensor network(WSN) has the potential to greatly effect many aspects of u-healthcare. By outfitting the potential with WSN, wearable sensor node can collects real-time data on physiological status and transmits through base station to server PC. However, there is a significant gap between WSN and healthcare. WSN has the limited resource about computing capability and data transmission according to bio-sensor sampling rates and channels to apply healthcare system. If a wearable node transmits ECG and accelerometer data of 4 channel sampled at 100 Hz, these data may occur high loss packets for transmitting human activity and ECG to server PC. Therefore current wearable sensor nodes have to solve above mentioned problems to be suited for u-healthcare system. Most WSN based activity and ECG monitoring system have been implemented some algorithms which are applied for signal vector magnitude(SVM) algorithm and ECG noise algorithm in server PC. In this paper, A wearable sensor node using integrated ECG and 3-axial accelerometer based on wireless sensor network is designed and developed. It can form multi-hop network with relay nodes to extend network range in WSN. Our wearable nodes can transmit 1-channel activity data processed activity classification data vector using SVM algorithm to 3-channel accelerometer data. ECG signals are contaminated with high frequency noise such as power line interference and muscle artifact. Our wearable sensor nodes can remove high frequency noise to clear original ECG signal for healthcare monitoring.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.446-457
• /
• 2007

In wireless sensor network, to provide the proper responses quickly for diverse events, wireless sensor nodes have to cooperate with each other. For successful cooperation, the time synchronization among sensor nodes is an important requirement for application execution. In the wireless sensor network, the message packets including time information are used for the time synchronization. However, the transmission of many message packets will exhaust the battery of wireless sensor nodes. Since wireless sensor nodes works on the limited battery capacity, the excessive transmission of message packets has an negative impact upon their lifetime. In this paper, the Reference Interpolation Protocol (RIP) is proposed to reduce the number of message packets for the time synchronization. The proposed method performs the time interpolation between the reference packet's time and the global time of the base station. The proposed method completes the synchronization operation with only 2 message packets when compared to the previous Reference Broadcast Synchronization (RBS) technique. Due to the simple synchronization procedure, our method greatly reduces the number of synchronization messages and showed the 12.7 times less power consumption than the RBS method. From the decrease in the transmission of message packets, the convergence time among wireless sensor nodes is shortened and the lifetime of wireless sensor nodes is also prolonged as much as the amount of saved battery energy.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.169-180
• /
• 2009

With fixed sinks, the network stability could be improved while the network life time could be decreased by the rapid energy dissipation around the fixed sink because of the concentrated network traffic from sensor nodes to the fixed sink in wireless sensor network. To address this problem, mobile sinks, which decentralize the network traffic, has received a lot of attention from many researchers recently. Since a mobile sink has a limited period to communicate with each sensor nodes, it is necessary for a scheduling algorithm to provide the fairness of data collection from each sensor nodes. In the paper, we propose the new scheduling algorithm, ASF(Availability based Scheduling scheme for Fair data collection), for the fair data collection by a mobile in the sensor networks. The ASF takes account of the distance between each sensor nodes and the mobile sink as scheduling metric, as well as the amount of collected data from each sensor nodes. Experiment results shows that the ASF improves the fairness of data collection among the sensor nodes, comparing to existing algorithm.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.629-636
• /
• 2009

Since all sensor nodes in wireless sensor networks work by their own embedded batteries, if a node runs out of its battery, the sensor network can not operate normally. In this situation we should employ the routing protocols which can consume the energy of nodes efficiently. Many protocols for energy efficient routing in sensor networks have been suggested but LEACH and PEGASIS are most well known protocols. However LEACH consumes energy heavily in the head nodes and the head nodes tend to die early and PEGASIS - which is known as a better energy efficient protocol - has a long transfer time from a source node to sink node and the nodes close to the sink node expend energy sharply since it makes a long hop of data forwarding. We proposed a new hybrid protocol of LEACH and PEGASIS, which uses the clustering mechanism of LEACH and the chaining mechanism of PEGASIS and it makes the life time of sensor networks longer than other protocols and we improved the performance 33% and 18% higher than LEACH-C and PEGASIS respectively.

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

In Underwater Linear Sensor Networks (UW-LSN) routing process, nodes without proper address make it difficult to determine relative sensor details specially the position of the node. In addition, it effects to determine the exact leakage position with minimized delay for long range underwater pipeline monitoring. Several studies have been made to overcome the mentioned issues. However, little attention has been given to minimize communication delay using dynamic addressing schemes. This paper presents the novel solution called Hop-by-Hop Dynamic Addressing based Routing Protocol for Pipeline Monitoring (H2-DARP-PM) to deal with nodes addressing and communication delay. H2-DARP-PM assigns a dynamic hop address to every participating node in an efficient manner. Dynamic addressing mechanism employed by H2-DARP-PM differentiates the heterogeneous types of sensor nodes thereby helping to control the traffic flows between the nodes. The proposed dynamic addressing mechanism provides support in the selection of an appropriate next hop neighbour. Simulation results and analytical model illustrate that H2-DARP-PM addressing support distribution of topology into different ranges of heterogeneous sensors and sinks to mitigate the higher delay issue. One of the distinguishing characteristics of H2-DARP-PM has the capability to operate with a fewer number of sensor nodes deployed for long-range underwater pipeline monitoring.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.645-648
• /
• 2016

Cluster based wireless sensor networks have a characteristic that the cluster heads collect and aggregate data from sensor nodes and send data to sink node. In addition, between the adjacent sensor nodes deployed in the same area is characterized to the similar sensing data. In this paper, we propose a transmission algorithm for improving the energy efficiency using these two features in the cluster-based wireless sensor networks. Adjacent neighboring nodes form a pair and the two nodes sense data on shifts for one round. Additionally, two cluster heads are selected in a cluster and one of them alternately collects data from nodes and transmits data to the sink. This paper describes a transmission rounding method and a transmission frame for increasing energy efficiency and compared with conventional methods. We perform computer simulations to evaluate the performance of the proposed algorithm, and show better performance in terms of energy efficiency as compared with the LEACH algorithm.