Wireless industrial sensor networks are wireless sensor networks which have been adapted to industrial applications. Most techniques for wireless sensor networks can be applied to wireless industrial sensor networks. However, for industrial applications of wireless industrial sensor networks, new requirements such as real-time, reliable delivery need to be considered. In this paper, we propose EARQ, which is a novel routing protocol for wireless industrial sensor networks. It provides real-time, reliable delivery of a packet, while considering energy awareness. In EARQ, a node estimates the energy cost, delay and reliability of a path to the sink node, based only on information from neighboring nodes. Then, it calculates the probability of selecting a path, using the estimates. When packet forwarding is required, it randomly selects the next node. A path with lower energy cost is likely to be selected, because the probability is inversely proportional to the energy cost to the sink node. To achieve real-time delivery, only paths that may deliver a packet in time are selected. To achieve reliability, it may send a redundant packet via an alternate path, but only if it is a source of a packet. Experimental results show that EARQ is suitable for industrial applications, due to its capability for energy efficient, real-time, reliable communications.
Recently, various technologies for utilizing unmanned aerial vehicles have been studied. Drones are a kind of unmanned aerial vehicle. Drone-based mobile surveillance systems can be applied for various purposes such as object recognition or object tracking. In this paper, we propose a mobility-aware dynamic computation offloading scheme, which can be used for tracking and recognizing a moving object on the drone. The purpose of the proposed scheme is to reduce the time required for recognizing and tracking a moving target object. Reducing recognition and tracking time is a very important issue because it is a very time critical job. Our dynamic computation offloading scheme considers both the dwell time of the moving target object and the network failure rate to estimate the response time accurately. Based on the simulation results, our dynamic computation offloading scheme can reduce the response time required for tracking the moving target object efficiently.
In most file systems, if a file is deleted, only the metadata of the file is deleted or modified and the file's data is still stored on the physical media. Some users require that deleted files no longer be accessible. This requirement is more important in embedded systems that employ flash memory as a storage medium. In this paper, we have designed a NAND flash file system that has a secure deletion functionality. We modified YAFFS to support secure deletion. Our method uses encryption to delete files and forces all keys of a specific file to be stored in the same block. Therefore, only one erase operation is required to securely delete a file. The proposed method securely deletes not only keys but also all of the metadata of that file. Our simulation results show that the number of block erases due to file creation and file modification is very low and the amortized number of block erases is lower than the simple encryption method. Even though we applied our method only to the YAFFS, our method can be easily applied to other NAND flash file systems.