Digital Library[ Search Result ]
Evaluation of Interest Point Detectors for Data Authentication in Wireless Multimedia Sensor Network (WMSN)
http://doi.org/10.5626/JOK.2019.46.2.184
In Wireless Multimedia Sensor Networks (WMSNs), authentication of multimedia data is very important because the data can be used in making crucial decisions. This study evaluates interest point detectors in terms of resilience to channel error occurred in WMSNs, robustness to JPEG compression, and sensitivity to image tampering. SIFT, SURF, ORB, AKAZE, SADDLE and HOG were evaluated with USC-SIPI image database by computing recall and precision between the original images and modified images by channel errors and JPEG compression and tampering. In addition, median filter and Gaussian filter were applied to reduce channel error and quantization errors from JPEG compression respectively and produced significant performance. AKAZE showed best performance for all conditions of experiments. The evaluation of interest point detectors showed the possibility of their application to authentication in WMSNs.
A Competitive Multipath Routing Protocol for delay-sensitive applications in Wireless Sensor Networks
http://doi.org/10.5626/JOK.2018.45.6.589
The key performance of various data delivery applications studied in wireless sensor networks is the timeliness and reliability of transmission. Both performances may be required simultaneously depending on the type of application and information. However, because of the limited nature of resources in wireless sensor networks, these requirements are not easy to meet. One way to overcome this problem is by multipath routing method. Traditional multi-path routing protocols exploit a method of generating additional independent paths or branching an existing path to satisfy the required performance. These methods can waste too many network resources in an irregular network environment. In order to solve this problem, this paper proposes an energy-efficient multipath routing method that can satisfy the requirement of emergency application by using the competition and cooperation between paths in irregular wireless sensor networks. Finally, this paper compares and analyzes the routing performance of the proposed method by means of simulation.
Improved Real-time Transmission Scheme using Temporal Gain in Wireless Sensor Networks
Taehun Yang, Hyunchong Cho, Sangdae Kim, Cheonyong Kim, Sang-Ha Kim
http://doi.org/10.5626/JOK.2017.44.10.1062
Real-time transmission studies in wireless sensor networks propose a mechanism that exploits a node that has a higher delivery speed than the desired delivery speed in order to satisfy real-time requirement. The desired delivery speed cannot guarantee real-time transmission in a congested area in which none of the nodes satisfy the requirement in one hop because the desired delivery speed is fixed until the packet reaches the sink. The feature of this mechanism means that the packet delivery speed increases more than the desired delivery speed as the packet approaches closer to the sink node. That is, the packet can reach the sink node earlier than the desired time. This paper proposes an improved real-time transmission by controlling the delivery speed using the temporal gain which occurs on the packet delivery process. Using the received data from a previous node, a sending node calculates the speed to select the next delivery node. The node then sends a packet to a node that has a higher delivery speed than the recalculated speed. Simulation results show that the proposed mechanism in terms of the real-time transmission success ratio is superior to the existing mechanisms.
Cooperative Detection of Moving Source Signals in Sensor Networks
Minh N. H. Nguyen, Pham Chuan, Choong Seon Hong
http://doi.org/10.5626/JOK.2017.44.7.726
In practical distributed sensing and prediction applications over wireless sensor networks (WSN), environmental sensing activities are highly dynamic because of noisy sensory information from moving source signals. The recent distributed online convex optimization frameworks have been developed as promising approaches for solving approximately stochastic learning problems over network of sensors in a distributed manner. Negligence of mobility consequence in the original distributed saddle point algorithm (DSPA) could strongly affect the convergence rate and stability of learning results. In this paper, we propose an integrated sliding windows mechanism in order to stabilize predictions and achieve better convergence rates in cooperative detection of a moving source signal scenario.
A Real-time Multicasting Protocol using Time Deadline in Wireless Sensor Networks
Cheonyong Kim, Taehun Yang, Sangdae Kim, Hyunchong Cho, Sang-Ha Kim
Real-time multicasting is a packet transmission scheme ensuring that multiple destinations receive a packet within the desired time line. In wireless sensor networks, a packet can be delivered to a limited distance under a given deadline, since the end-to-end delay tends to be proportional to the end-to-end physical distance. Existing real-time multicasting protocols select the distance between the source and the furthest destination as the distance limitation and construct a multicasting tree guaranteeing delivery paths to each destination within the distance limitation. However, the protocols might lead to real-time delivery failures and energy efficiency degradation due to the fixed distance limitation. In this study, we proposed a real-time multicasting protocol using time deadline. The proposed protocol obtains the maximum transmittable distance with a given time deadline and subsequently constructs a multicasting tree using the maximum transmittable distance. The form of the multicasting tree varies according to the given time deadline to trade off the energy efficiency against the real-time delivery success ratio. The simulation results showed that the proposed scheme is superior to the existing protocols in terms of energy efficiency and real-time delivery success ratio under various time deadlines.
Local Grid-based Multipath Routing Protocol for Mobile Sink in Wireless Sensor Networks
Taehun Yang, Sangdae Kim, Hyunchong Cho, Cheonyong Kim, Sang-Ha Kim
A multipath routing in wireless sensor networks (WSNs) provides advantage such as reliability improvement and load balancing by transmitting data through divided paths. For these reasons, existing multipath routing protocols divide path appropriately or create independent paths efficiently. However, when the sink node moves to avoid hotspot problem or satisfy the requirement of the applications, the existing protocols have to reconstruct multipath or exploit foot-print chaining mechanism. As a result, the existing protocols will shorten the lifetime of a network due to excessive energy consumption, and lose the advantage of multipath routing due to the merging of paths. To solve this problem, we propose a multipath creation and maintenance scheme to support the mobile sink node. The proposed protocol can be used to construct local grid structure with restricted area and exploit grid structure for constructing the multipath. The grid structure can also be extended depending on the movement of the sink node. In addition, the multipath can be partially reconstructed to prevent merging paths. Simulation results show that the proposed protocol is superior to the existing protocols in terms of energy efficiency and packet delivery ratio.
Efficient Spectrum Sensing for Cognitive Radio Sensor Networks via Optimization of Sensing Time
In cognitive radio sensor networks (CRSNs), secondary users (SUs) can occupy licensed bands opportunistically without causing interferences to primary users (PUs). SUs perform spectrum sensing to detect the presence of PUs. Sensing time is a critical parameter for spectrum sensing that can yield a tradeoff between sensing performance and secondary throughput. In this study, we investigate new approaches for spectrum sensing by exploring the tradeoff from a) spectrum sensing for PU detection (SSPD) and b) spectrum sensing for secondary throughput (SSST). In the proposed scheme, the first sensing result of the current frame determines the dynamic performance of the second spectrum sensing. Energy constraint in CRSNs leads to maximized network energy efficiency via optimization of sensing time. Simulation results show that the proposed scheme of SSPD and SSST improves network performance in terms of energy efficiency and secondary throughput, respectively.
A Sensing Node Selection Scheme for Energy-Efficient Cooperative Spectrum Sensing in Cognitive Radio Sensor Networks
Fanhua Kong, Zilong Jin, Jinsung Cho
Cognitive radio technology can allow secondary users (SUs) to access unused licensed spectrums in an opportunistic manner without interfering with primary users (PUs). Spectrum sensing is a key technology for cognitive radio (CR). However, few studies have examined energy-efficient spectrum sensing in cognitive radio sensor networks (CRSNs). In this paper, we propose an energy-efficient cooperative spectrum sensing nodes selection scheme for cluster-based cognitive radio sensor networks. In our proposed scheme, false alarm probability and energy consumption are considered to minimize the number of spectrum sensing nodes in a cluster. Simulation results show that by applying the proposed scheme, spectrum sensing efficiency is improved with a decreased number of spectrum sensing nodes. Furthermore, network energy efficiency is guaranteed and network lifetime is substantially prolonged.
Energy-aware Selective Compression Scheme for Solar-powered Wireless Sensor Networks
Min Jae Kang, Semi Jeong, Dong Kun Noh
Data compression involves a trade-off between delay time and data size. Greater delay times require smaller data sizes and vice versa. There have been many studies performed in the field of wireless sensor networks on increasing network life cycle durations by reducing data size to minimize energy consumption; however, reductions in data size result in increases of delay time due to the added processing time required for data compression. Meanwhile, as energy generation occurs periodically in solar energy-based wireless sensor networks, redundant energy is often generated in amounts sufficient to run a node. In this study, this excess energy is used to reduce the delay time between nodes in a sensor network consisting of solar energy-based nodes. The energy threshold value is determined by a formula based on the residual energy and charging speed. Nodes with residual energy below the threshold transfer data compressed to reduce energy consumption, and nodes with residual energy above the threshold transfer data without compression to reduce the delay time between nodes. Simulation based performance verifications show that the technique proposed in this study exhibits optimal performance in terms of both energy and delay time compared with traditional methods.
Cluster-based Energy-aware Data Sharing Scheme to Support a Mobile Sink in Solar-Powered Wireless Sensor Networks
Hong Seob Lee, Jun Min Yi, Jaeung Kim, Dong Kun Noh
In contrast with battery-based wireless sensor networks (WSNs), solar-powered WSNs can operate for a longtime assuming that there is no hardware fault. Meanwhile, a mobile sink can save the energy consumption of WSN, but its ineffective movement may incur so much energy waste of not only itself but also an entire network. To solve this problem, many approaches, in which a mobile sink visits only on clustering-head nodes, have been proposed. But, the clustering scheme also has its own problems such as energy imbalance and data instability. In this study, therefore, a cluster-based energy-aware data-sharing scheme (CE-DSS) is proposed to effectively support a mobile sink in a solar-powered WSN. By utilizing the redundant energy efficiently, CE-DSS shares the gathered data among cluster-heads, while minimizing the unexpected black-out time. The simulation results show that CE-DSS increases the data reliability as well as conserves the energy of the mobile sink.
Search
Journal of KIISE
- ISSN : 2383-630X(Print)
- ISSN : 2383-6296(Electronic)
- KCI Accredited Journal
Editorial Office
- Tel. +82-2-588-9240
- Fax. +82-2-521-1352
- E-mail. chwoo@kiise.or.kr