Supply chain management (SCM) governance is the streamline of the IoT product life cycle from its production to delivery. Integrating blockchain with supply chain management is essential to ensure end-to-end tracking, trustiness between manufacturers and customers, fraud and counterfeit elimination, and customizing administrative costs and paperwork. This paper proposes an RFID ownership transfer protocol with the help of zk-SNARKs (Zero Knowledge-Succinct Noninteractive Arguments of Knowledge) using Ethereum blockchain. When the owner performs RFID transfer, the transferred information will be recorded on the blockchain using smart contracts. When using a smart contract to transfer ownership on the Ethereum blockchain, because the content on the blockchain will not be tampered with, all accounts in the Ethereum can view the transfer results and verify them. The privacy of the supply chain is attained by generating the proof of product code via zk-SNARKs algorithm. This algorithm also enhances the scalability of the supply chain system by creating a trusted setup in off-chain mode.

In current years, drowsy driver detection is the most necessary procedure to prevent any road accidents, probably worldwide. The aim of this study was to construct a smart alert technique for building intelligent vehicles that can automatically avoid drowsy driver impairment. But drowsiness is a natural phenomenon in the human body that happens due to different factors. Hence, it is required to design a robust alert system to avoid the cause of the mishap. In this proposed paper, we address a drowsy driver alert system that has been developed using such a technique in which the Video Stream Processing (VSP) is analyzed by eye blink concept through an Eye Aspect Ratio (EAR) and Euclidean distance of the eye. Face landmark algorithm is also used as a proper way to eye detection. When the driver’s fatigue is detected, the IoT module issues a warning message along with impact of collision and location information, thereby alerting with the help of a voice speaking through the Raspberry Pi monitoring system.

To access location-based service (LBS) and query surrounding points of interest (POIs), smartphone users typically use built-in positioning functions of their phones when traveling at unfamiliar places. However, when a query is submitted, personal information may be leaked when they provide their real location. Current LBS privacy protection schemes fail to simultaneously consider real map conditions and continuous querying, and they cannot guarantee privacy protection when the obfuscation algorithm is known. To provide users with secure and effective LBSs, we developed an unchained regional privacy protection method that combines query logs and chained cellular obfuscation areas. It adopts a multiuser anonymizer architecture to prevent attackers from predicting user travel routes by using background information derived from maps (e.g., traffic speed limits). The proposed scheme is completely transparent to users when performing continuous location-based queries, and it combines the method with actual road maps to generate unchained obfuscation areas that conceal the actual locations of users. In addition to using a caching approach to enhance performance, the proposed scheme also considers popular tourist POIs to enhance the cache data hit ratio and query performance.

Abstract Radio Frequency Identification (RFID) has been widely deployed for its high capabilities in simple computation, storage, long scan distance, and simultaneous reading. With the combination of mobile devices and readers in recent years, it has been transformed to mobile RFID providing wider services for its users and mobility for its readers. E‐commerce, for instance, has applied many of mobile RFID's deriving services, one of which is the transfer of a tagged item's ownership. To secure such transfer in a mobile RFID environment, we propose a new approach for ownership transfer across different authorities and prove it able to stand most threats for RFID and to prevent Denial of Service (DoS) attacks that derive from asynchrony. Another contribution in this paper is that we can assign transfer targets, which, except our scheme, can only be achieved by Yanget al.'s Cross Authority Ownership Transfer (CAOT) protocol. That scheme, however, involves heavy computation and is not suitable for lightweight tags, whereas this scheme is designed for lightweight tags and has been proved viable on low‐cost passive tags and has better performance than any known ownership transfer schemes. Copyright © 2011 John Wiley & Sons, Ltd.

Because the Internet has been widely applied in various fields, more and more network security issues emerge and catch people's attention. However, adversaries often hide themselves by spoofing their own IP addresses and then launch attacks. For this reason, researchers have proposed a lot of traceback schemes to trace the source of these attacks. Some use only one packet in their packet logging schemes to achieve IP tracking. Others combine packet marking with packet logging and therefore create hybrid IP traceback schemes demanding less storage but requiring a longer search. In this paper, we propose a new hybrid IP traceback scheme with efficient packet logging aiming to have a fixed storage requirement for each router (under 320 KB, according to CAIDA's skitter data set) in packet logging without the need to refresh the logged tracking information and to achieve zero false positive and false negative rates in attack-path reconstruction. In addition, we use a packet's marking field to censor attack traffic on its upstream routers. Lastly, we simulate and analyze our scheme, in comparison with other related research, in the following aspects: storage requirement, computation, and accuracy.

In a flooding-based distributed denial-of-service (DDoS) attack, an adversary attempts to exhaust a target's computing resource. To detect DDoS attacks in a network environment, IP traceback methods are deployed to determine the origin of attacking packets. With the increase in bandwidth of wireless networks, attackers may choose this medium from which to launch attacks. However, tracing the attackers in wireless networks is more difficult since intermediate nodes may move or attackers may change their location to hide themselves. Thus, conventional traceback schemes for wired networks cannot apply directly to the wireless network infrastructure because the intermediate routers could be compromised by an adversary. Therefore, we propose a flexible and lightweight traceback scheme to determine the source of attacking packets in a mobile ad-hoc environment. We will demonstrate our method's ability to track the movement of an attacker and recognize attack traffic launched by the same attacker from different locations.

One way to broadcast a popular/hot video is to let multiple users share a few channels. The stress on the scarce channels can be alleviated without sacrificing viewer waiting time. One common approach is to partition the video into fixed-length segments, which are broadcast on several channels periodically. Two representative approaches are the fast broadcasting scheme and the PAGODA scheme, which can broadcast a video using k channels by having new viewers wait no longer than /spl Theta/(D/2/sup k/) and /spl Theta/(D/5/sup k/2/) time, respectively, where D is the length of the video. In this paper, we propose a new scheme, called recursive frequency splitting (RFS), that significantly improves on existing schemes in terms of viewer waiting time. Some lower bounds on the viewers' waiting time are also developed.

This paper considers the location tracking problem in PCS networks. How a solution to this problem performs in fact highly, depends on the mobility patterns of users. In this paper we propose a new traveling salesman mobility (TSM) model, in the hope of catching the mobility patterns of a large group of users. The TSM model is characterized by features of "stop-or-move", "infrequent transition" "memory of roaming direction", and "oblivious in different moves". Then a location tracking strategy based on this TSM model is developed. The scheme only needs to keep very little information for each user. Analyses and simulations are provided, which show that the strategy is very prospective.

One way to broadcast a popular video is to use a number of dedicated channels, each responsible for broadcasting some portion of the video periodically in a predefined way. The stress on the channels can be alleviated, and new viewers do not have to wait long to start their playback. Many approaches falling in this category have been proposed. One such scheme that interests us is the fast broadcasting (FB) scheme, which can broadcast a video using k channels by incurring at most O(D/2/sup k/) waiting time on new-coming viewers, where D is the length of the video. We consider a set of videos, each being broadcast by the FB scheme. Since the demand levels on these videos may change with time, it is sometimes inevitable to change the numbers of channels assigned to some videos. We propose a novel seamless channel transition enhancement on top of the FB scheme to dynamically change the number of channels assigned to a video on-the-fly. Clients currently viewing this video will not experience any disruption because of the transition. A channel allocation scheme is also proposed based on the arrival rates of videos to minimize the average waiting experienced by all viewers. From the system manager's point of view, the enhancement will make the FB scheme more attractive.

This paper considers the multi-node multicast problem in a multi-dimensional wormhole-routed torus/mesh, where there are an arbitrary number of source nodes each intending to multicast a message to an arbitrary set of destinations. This problem requires a large amount of bandwidth, and thus typically incurs heavy contention and congestion. Evenly balancing the traffic load around the network is a critical issue to achieve good performance. We show how to use a network-partitioning approach to achieve this goal. Simulation results show significant improvement over existing results in 3D tori and meshes. This work is an extension of our earlier work (2000) from 2D tori/meshes to higher dimensional ones.

One way to broadcast a popular video is to let multiple users share fewer channels. The stress on channel demand can be alleviated without sacrificing viewers' waiting time. One such scheme that interests us is the fast broadcasting (FB) scheme (Juhn et al., 1997, 1998), which can broadcast a popular video using k channels without keeping newcoming viewers waiting for more than O(D/2/sup k/) time, where D is the length of the video. In this paper, we propose two enhancements to the FB scheme. First, since the level of demand on a video may change by time, we show how to dynamically change the number of channels assigned to the video and seamlessly perform this transition. Clients currently viewing this video will not experience any disruption during the transition. Second, given a set of channels and a set of popular videos, we propose a scheme to assign these channels to the videos such that the average viewers' waiting time is minimal. From the system manager's point of view, these enhancements will make the FB scheme more attractive.

Recently, wormhole routers with multidestination capability have been proposed to support fast multicast in a multicomputer network. To avoid communication deadlock, existing results have proposed to construct a Hamilton path, Euler path, trip, or their variants in the network, perhaps with some degree of support of virtual channels. In this paper, we identify that a network which is itself Eulerian or is Eulerian after some links are removed, can enjoy the multidestination capability without support of virtual channels. From this definition, we then develop several techniques to achieve fault-tolerant multicast in a torus/mesh of any dimension with regular fault patterns (such as single node, block, L-shape, T-shape, +-shape, U-shape, and H-shape) and even irregular fault patterns. The result improves over existing results on the requirement of support of virtual channels and fault-tolerant capability. Simulation results on tori are presented.

Recently, wormhole routers with multi-destination capability have been proposed to support fast multicast in a multi-computer network. In this paper, we develop a new multicasting model for such networks based on the concept of Euler path/circuit in graph theory. The model can support multiple concurrent multicasts freely from deadlock and can be applied to any network which is Eulerian or is Eulerian after some links being removed. No virtual channels are needed. In particular, we demonstrate the potential of this model by showing its fault-tolerant capability in supporting multicasting in the currently popular torus/mesh topology of any dimension with regular fault patterns (such as single node, block, L-shape, +-shape, U-shape, and H-shape) and even irregular fault patterns. The result has improved over existing fault-tolerant routing algorithms for meshes/tori in at least one of the following aspects: the number of faults tolerable, the shape of fault patterns, the number of deactivated healthy nodes, the requirement of support of virtual channels, and the range of network topology acceptable.