Search

Hybrid long-range (LoRa) network is a promising approach to overcome the half-duplex issue in traditional LoRa networks, increasing the network efficiency and confidence for today’s fast-developing smart city services. Gateways (GWs) in hybrid LoRa networks link the end devices (EDs) and the Netserver and have a great impact on the system performance. Previous results on GW planning cannot be directly applied to hybrid LoRa networks since the heterogeneous EDs require different redundancy of coverage. Furthermore, the spreading factors (SFs) which determine the system performance should be considered concurrently. In this article, in order to find the optimal planning scheme, i.e., deciding the number and locations of GWs in the hybrid LoRa network, we propose a heterogeneous redundant coverage solution to meet the requirements of the heterogeneous EDs using the same or different frequencies for uplink and downlink. Specifically, we formulate this problem as a point coverage problem that meets the requirements of EDs. The deleted greedy algorithm (DGA) and the nondeleted greedy algorithm (NDGA) are designed to solve this problem, in which the DGA shows better performance when compared to NDGA. Furthermore, we build models of system performance and analyze the system throughput and energy efficiency based on SFs. The simulation results show that our solution gains more system throughput and energy efficiency than a one-coverage solution.

Recently, full-view coverage has been introduced to capture intruders from multiple directions in the camera sensor networks. It is more efficient than traditional coverage in identifying the intruders. However, full-view coverage typically calls for a large number of camera sensors. Hence, we exploit limited mobility or orientation to improve the performance of full-view coverage since camera sensors typically can rotate to cover more areas without being relocated after installation. Observing that target points may not be full-view covered constantly due to the sensor rotation, we emphasize the importance of the fairness-based coverage maximization problem, i.e., how to schedule the orientations of camera sensors to maximize the minimum cumulative full-view coverage time of target points. To solve this issue, we first try to reduce the dimension space of orientations by dividing the orientation space into a set of discrete directions. We then study how to select the minimum number of sensing regions that camera sensors should rotate to cover in order to ensure the full-view coverage of all target points. Next, we unveil the relationship between the full-view coverage and target points, which are spatially correlated. Based on these results, we devise a centralized algorithm to solve the problem based on “largest demand first serve” principle, by which the target points with less cumulative full-view coverage time will be preferentially selected to be full-view covered with a higher probability. We further design a distributed solution as a counterpart of the centralized algorithm. Extensive simulations are presented to show the performances of the proposed algorithms. Results show that exploiting limited mobility of sensor rotation has good potential in promoting the efficiency and reducing the cost of ensuring full-view coverage.

Due to the vast demand for monitoring a structure or area in linear topology, linear sensor networks (LSNs) have recently attracted plenty of attention. Since sensor nodes are usually battery-powered, duty-cycling techniques have been widely studied to improve energy efficiency, which, however, introduces a significant issue known as sleep latency. Thereafter pipelined forwarding has been proposed in the literature as a promising way to alleviate this issue. This paper focuses on interference analysis for data collection services in a multihop LSN running a duty-cycling and pipelined-forwarding protocol, where multiple concurrent transmissions along a data collection path can severely interfere with each other. We first obtain the nodal distance distributions associated with all concurrent transmissions. Based on the obtained distance distributions and the path-loss model in an interference-limited environment, we analyze the distributions of signal-to-interference-plus-noise ratio (SINR) and link capacity. The obtained SINR distribution indicates the link outage probability at a given SINR threshold. By investigating the transmission which receives the strongest cumulative interference, our model can provide useful guidelines for duty cycle setting to achieve a desired network performance.

Narrowband Internet of Things (NB-IoT) is one of the most promising technologies for low-power, wide-area, and low-traffic applications. In NB-IoT, random access is implemented in media access control layer to resolve the channel contention conflict among multiple user equipments (UEs), and is crucial to the throughput performance of NB-IoT. Previous results in long-term evolution cannot be directly applied due to specification differences. In this paper, we take the first attempt to systematically analyze the performance of random access in NB-IoT. First, after extensively studying the backoff mechanism, we characterize the probability that a UE initiates random access, the probability that a packet is transmitted successfully and the probability that a channel is busy. Then, we define each UE’s buffer as a first-in-first-out queue. We employ Markov chain to model retransmission number caused by collisions and the length of the queue simultaneously. By exploiting the characteristic of the steady-state distribution of the Markov chain, the above three probabilities in steady state can be obtained explicitly. Based on these probabilities, we calculate the system throughput in terms of UE number, packet generation rate, retransmission number, and the length of the queue. Finally, we investigate the system throughput and conduct extensive simulations under various parameters, which validate our analysis.

Recently, narrowband Internet of Things (NB-IoT), one of the most promising low power wide area (LPWA) technologies, has attracted much attention from both academia and industry. It has great potential to meet the huge demand for machine-type communications in the era of IoT. To facilitate research on and application of NB-IoT, in this paper, we design a system that includes NB devices, an IoT cloud platform, an application server, and a user app. The core component of the system is to build a development board that integrates an NB-IoT communication module and a subscriber identification module, a micro-controller unit and power management modules. We also provide a firmware design for NB device wake-up, data sensing, computing and communication, and the IoT cloud configuration for data storage and analysis. We further introduce a framework on how to apply the proposed system to specific applications. The proposed system provides an easy approach to academic research as well as commercial applications.

The past few years have witnessed the dramatic popularity of large-scale social networks where malicious nodes detection is one of the fundamental problems. Most existing works focus on actively detecting malicious nodes by verifying signal correlation or behavior consistency. It may not work well in large-scale social networks since the number of users is extremely large and the difference between normal users and malicious users is inconspicuous. In this paper, we propose a novel approach that leverages the power of users to perform the detection task. We design incentive mechanisms to encourage the participation of users under two scenarios: 1) full information and 2) partial information. In full information scenario, we design a specific incentive scheme for users according to their preferences, which can provide the desirable detection result and minimize overall cost. In partial information scenario, assuming that we only have statistical information about users, we first transform the incentive mechanism design to an optimization problem, and then design the optimal incentive scheme under different system parameters by solving the optimization problem. We perform extensive simulations to validate the analysis and demonstrate the impact of system factors on the overall cost.