International Journal of Distributed Sensor Networks

Wei, Min; Zhang, Shuaidong; Wang, Ping; Kim, Keecheon

doi: 10.1177/1550147718754793pmid: N/A

As an industrial communication data interaction specification, OPC Unified Architecture effectively solves the industrial Internet of Things system integration problem. This article designs an authentication and key agreement scheme based on implicit certificate using the security model provided by OPC Unified Architecture. It establishes the secure channel and provides a guarantee for secure session for the OPC Unified Architecture server and client. Then, the test verification platform is implemented to verify the feasibility of the scheme. The result shows that the mechanism is feasible, and the system security and availability are effectively improved.

Kim, Jonghyuk; Hwangbo, Hyunwoo; Kim, Soyean

doi: 10.1177/1550147718755290pmid: N/A

Connected cars, which are vehicles connected to wireless networks through the convergence of automotive and information technologies, have become an important topic of academic and industrial research on automobiles. In this research, we conducted a field experiment to understand vehicle maintenance mechanisms of a connected car platform. Specifically, we investigated the feasibility of prognostics and health management under different driving circumstances, with varying vehicle models, vehicle conditions, drivers’ propensity for speeding, and road conditions. We collected sensor data through a two-stage model of vehicle communication using an on-board diagnostics scanner and data transmission using wireless communication. We found that device defects can be predicted based on driving situations such as the driving mode, mechanical characteristics, and a driver’s speeding propensity.

Yang, Zhiwei; Wu, Weigang; Chen, Yishun; Lin, Xiaola; Cao, Jiannong

doi: 10.1177/1550147718756872pmid: N/A

With the advance in mobile network-based systems, dynamic system has become one of the hotspots in fundamental study of distributed systems. In this article, we consider the dynamic system with frequent topology changes arising from node mobility or other reasons, which is also referred to as “dynamic network.” With the model of dynamic network, fundamental distributed computing problems, such as information dissemination and election, can be formally studied with rigorous correctness. Our work focuses on the node counting problem in dynamic environments. We first define two new dynamicity models, named (Q, S)-distance and (Q, S)*-distance, which describe dynamic changes of information propagation time against topology changes. Based on these two models, we design three different counting algorithms which basically adopt the approach of diffusing computation. These algorithms mainly differ in communication cost due to different information collection procedures. The correctness of all the algorithms is formally proved and their performance is evaluated via both theoretical analysis and experimental simulations.

Sodhro, Ali Hassan; Chen, Li; Sekhari, Aicha; Ouzrout, Yacine; Wu, Wanqing

doi: 10.1177/1550147717750030pmid: N/A

This article presents comparison between data rate or rate control, that is, video transmission rate control algorithm and transmission power control algorithms for two different cases. First, energy consumption due to high peak variable data rates in video transmission. Second, energy depletion due to high transmission power consumption and dynamic nature of wireless on-body channel. The former one focuses on constant (fixed) transmission power level and variable data rate (“severe” conditions), for example, medical monitoring of the emergency patients. The latter considers variable transmission power level and constant (fixed) data rate (“less severe” conditions), for example, electrocardiography measurement for patients in wireless body sensor networks. Besides, energy efficiency comparison analysis of battery-driven or video transmission rate control algorithm and transmission power control–driven or power control algorithm is presented. Finally, proposed algorithms are analyzed and categorized as energy-efficient and battery-friendly for medical applications in wireless body sensor networks.

Wu, Wenlan; Wen, Xianbin; Xu, Haixia; Yuan, Liming; Meng, Qingxia

doi: 10.1177/1550147718756274pmid: N/A

In this article, a novel range-free localization algorithm is proposed based on the modified expected hop progress for heterogeneous wireless sensor networks where all nodes’ communication ranges are different. First, we construct the new cumulative distribution function expression of expected hop progress to reduce the computational complexity. Then, the elliptical distance correction method is used to improve the accuracy of the estimation distance and simultaneously decrease overhead. Finally, using the modified distance, the coordinate of the unknown node can be obtained by maximum likelihood estimation. Compared with other algorithms for heterogeneous wireless sensor network, the proposed algorithm is superior in the localization accuracy and efficiency when used in random and uniform placement of nodes.

Wei, Dawei; Ning, Huansheng; Qian, Yuke; Zhu, Tao

doi: 10.1177/1550147718754968pmid: N/A

To apply the algorithms in Internet of Things for physical world objects, the relationship between physical objects is becoming more and more complicated. As we know, social relationship is widely used in human world and social Internet of Things to solve the multiple object problems. Thus, a way via combining social relationship with physical object to solve the problem with a huge number of objects or complicated interactions among objects has been analyzed. This article proposes a new concept of “Physical Objects’ Social Relationship” for describing, managing, and predicting the relationships between physical objects in Internet of Things. The classification method for physical objects’ social relationships is proposed using the spatial-temporal attribute of social relationships. Moreover, the logical expression method for physical objects’ social relationships is discussed.

Chi, Tao; Chen, Ming

doi: 10.1177/1550147718756014pmid: N/A

With the rapid development of wireless communications for network of things, more and more models for such networks-on-chip architectures have been created and used in a wide range of applications. In this article, the behaviors of wireless communications for such networks-on-chip architectures are analyzed at two layers. The physical layer behaviors consist of what frequency is used, how and when signals are transmitted, and how transceivers’ responses are decoded. The medium access control layer behavior consists of how to provide a reliable link between two peer medium access control entities. For the optimization objective of each layer, the specific problems surrounding the design of combined radio frequency identification/Bluetooth/Wi-Fi chips are considered at their respective layer, and then, corresponding optimization methods are carried out. The problem of optimization is defined as a linear programming problem in which each active transceiver is assigned to a channel on condition that all the constraint is met on every link. Each optimization procedure proposed in this article is performed through the adaptation of its objective, from each one of these layers, in order to minimize interference previously specified. In principle, the optimization can be made layer by layer separately. The optimization criteria consist of a specification of the behaviors of wireless communications (radio frequency identification, Bluetooth, Wi-Fi) and a set of constraints and goals. Our approach is to perform it independently within the given task, where the given task can be achieved with its sequencing graph entities, including automate selection, binding, and scheduling. We have implemented our algorithms on a field-programmable gate array and applied them to some off-the-shelf products. This methodology looks promising, not only for the results presented and obtained through computer simulations but also for its generality concerning to the kind of wireless network system used. Therefore, such methodology is expandable either to multi-core networks-on-chip architecture or also to the off-the-shelf products.

Kumar, Gulshan; Rai, Mritunjay Kumar; Saha, Rahul; Kim, Hye-jin

doi: 10.1177/1550147718755636pmid: N/A

Localization is one of the key concepts in wireless sensor networks. Different techniques and measures to calculate the location of unknown nodes were introduced in recent past. But the issue of nodes’ mobility requires more attention. The algorithms introduced earlier to support mobility lack the utilization of the anchor nodes’ privileges. Therefore, in this article, an improved DV-Hop localization algorithm is introduced that supports the mobility of anchor nodes as well as unknown nodes. Coordination of anchor nodes creates a minimum connected dominating set that works as a backbone in the proposed algorithm. The focus of the research paper is to locate unknown nodes with the help of anchor nodes by utilizing the network resources efficiently. The simulated results in network simulator-2 and the statistical analysis of the data provide a clear impression that our novel algorithm improves the error rate and the time consumption.

Shi, Peng; Li, Bin; Thike, Phyu Hnin; Ding, Lianhong

doi: 10.1177/1550147717750374pmid: N/A

High-throughput experiment refers to carry out a large number of tests and attain various characterizations in one experiment with highly integrated sample or facility, widely adopted in biology, medicine, and materials areas. Consequently, the storing and treating of data bring new challenges because of large amount of real-time data, especially high-resolution images. To improve the storing and treating efficiency of high-throughput image, a knowledge-embedded lossless image compressing method is proposed. Based on the similarity of a series of high-throughput images, it accomplishes the high compression ratio according to the difference between the target images and one reference image. Meanwhile, the knowledge extracted from the image, such as edge information and differences from the reference image, is recorded into the compressed file. The key steps include similarity comparison, edge detection, coordinate transformation, and dictionary encoding. The method has been successfully applied into high-throughput corrosion experiment facility, a typical intelligent cyber-physical system. To evaluate the performance, corrosion metal, face, and flower images are compressed by our method and other lossless image compression methods. The results show that our method has fairly high compression ratio. Moreover, the embedded knowledge can be read directly from the compressed file to support further study.

Chen, Dechuan; Yang, Weiwei; Hu, Jianwei; Mou, Weifeng; Cai, Yueming

doi: 10.1177/1550147718754729pmid: N/A

We investigate secure communications in untrusted energy harvesting relay networks, where the amplify-and-forward relay is an energy constrained node powered by the received radio frequency signals, and try to unauthorizedly decode the confidential information from the source. The secrecy outage probability and connection outage probability are respectively derived in closed-form to evaluate the security and reliability for three energy harvesting strategies, for example, time switching relaying strategy, power splitting relaying strategy, and ideal relaying receiver strategy. Subsequently, the effective secrecy throughput is conducted to characterize the overall efficiency, and the asymptotic analysis of the secrecy throughput is given to determine the optimal energy harvesting strategies in different operating regimes. Furthermore, in order to achieve the optimal effective secrecy throughput performance, a switching threshold between time switching relaying and power splitting relaying is designed. Numerical results verify the accuracy of the analytical expressions and reveal that the effective secrecy throughput of the system can be effectively promoted by the threshold switching energy harvesting strategy.