Search

Over the past few years, the use of wireless sensor networks in a range of Internet of Things (IoT) scenarios has grown in popularity. Since IoT sensor devices have restricted battery power, a proper IoT data aggregation approach is crucial to prolong the network lifetime. To this end, current approaches typically form a virtual aggregation backbone based on a connected dominating set or maximal independent set to utilize independent transmissions of dominators. However, they usually have a fairly long aggregation delay because the dominators become bottlenecks for receiving data from all dominatees. The problem of time-efficient data aggregation in multichannel duty-cycled IoT sensor networks is analyzed in this paper. We propose a novel aggregation approach, named LInk-delay-aware REinforcement (LIRE), leveraging active slots of sensors to explore a routing structure with pipeline links, then scheduling all transmissions in a bottom-up manner. The reinforcement schedule accelerates the aggregation by exploiting unused channels and time slots left off at every scheduling round. LIRE is evaluated in a variety of simulation scenarios through theoretical analysis and performance comparisons with a state-of-the-art scheme. The simulation results show that LIRE reduces more than 80% aggregation delay compared to the existing scheme. [ABSTRACT FROM AUTHOR]

Service Function Chaining (SFC) is an emerging paradigm aiming to provide flexible service deployment, lifecycle management, and scaling in a micro-service architecture. SFC is defined as a logically connected list of ordered Service Functions (SFs) that require high availability to maintain user experience. The SFC protection mechanism is one way to ensure high availability, and it is achieved by proactively deploying backup SFs and installing backup paths in the network. Recent studies focused on ensuring the availability of backup SFs, but overlooked SFC unavailability due to network failures. This paper extends our previous work to propose a Hybrid Protection mechanism for SFC (HP-SFC) that divides SFC into segments and combines the merits of local and global failure recovery approaches to define an installation policy for backup paths. A novel labeling technique labels SFs instead of SFC, and they are stacked as per the order of SFs in a particular SFC before being inserted into a packet header for traffic steering through segment routing. The emulation results showed that HP-SFC recovered SFC from failure within 20–25 ms depending on the topology and reduced backup paths' flow entries by at least 8.9% and 64.5% at most. Moreover, the results confirmed that the segmentation approach made HP-SFC less susceptible to changes in network topology than other protection schemes. [ABSTRACT FROM AUTHOR]

A smart-card-based user authentication scheme for wireless sensor networks (hereafter referred to as a SCA-WSN scheme) is designed to ensure that only users who possess both a smart card and the corresponding password are allowed to gain access to sensor data and their transmissions. Despite many research efforts in recent years, it remains a challenging task to design an efficient SCA-WSN scheme that achieves user anonymity. The majority of published SCA-WSN schemes use only lightweight cryptographic techniques (rather than public-key cryptographic techniques) for the sake of efficiency, and have been demonstrated to suffer from the inability to provide user anonymity. Some schemes employ elliptic curve cryptography for better security but require sensors with strict resource constraints to perform computationally expensive scalar-point multiplications; despite the increased computational requirements, these schemes do not provide user anonymity. In this paper, we present a new SCA-WSN scheme that not only achieves user anonymity but also is efficient in terms of the computation loads for sensors. Our scheme employs elliptic curve cryptography but restricts its use only to anonymous user-to-gateway authentication, thereby allowing sensors to perform only lightweight cryptographic operations. Our scheme also enjoys provable security in a formal model extended from the widely accepted Bellare-Pointcheval-Rogaway (2000) model to capture the user anonymity property and various SCA-WSN specific attacks (e.g., stolen smart card attacks, node capture attacks, privileged insider attacks, and stolen verifier attacks). [ABSTRACT FROM AUTHOR]

In this paper, we present a practical public key certificate structure that is combined with an authentication protocol for roaming across different wireless Internet service providers (ISPs). The design rationale is to enable the mutual authentication between the roaming mobile device (MD) and the visited network to be locally performed without invoking the MD's home ISP. The mutual authentication ensures that the visited network has authenticity as well as a mechanism for establishing the appropriate revenue stream for the roaming MD. The proposed scheme guarantees that the overhead associated with the authentication time is significantly reduced and that the impact of this overhead on the roaming MD is also minimized, although the nested depth of the network mobility is increased. In this paper, we use analytical comparisons to show that the proposed scheme creates less overhead than that of the previous approaches in terms of security and communication performance. [ABSTRACT FROM PUBLISHER]

With the spread of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements becomes a problem of prime importance. A principal factor of these real-time applications is to optimize the delay- and delay variation-bounded multicast tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as an NP-complete problem. The representative algorithms are the DVMA, the DDVCA, and the ECS algorithm. In this paper, we show that the proposed ESC algorithm outperforms the DDVCA and the ECS algorithm. The efficiency of our algorithm is verified through performance evaluation and the enhancement is up to about 19.6% in terms of normalized surcharge for multicast delay variation. The time complexity of our algorithm is O( mn), which is comparable to the well-known DDVCA. Copyright © 2010 John Wiley & Sons, Ltd. In this paper, we address the delay- and delay variation-bounded multicast tree (DVBMT) problem. The problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The proposed Estimation of Selecting Core (ESC) algorithm outperforms the well-known algorithms-DDVCA and ECS; furthermore, the time complexity of ESC is the same as the previous ones. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The applications of Unmanned Aerial Vehicles (UAVs) are rapidly growing in domains such as surveillance, logistics, and entertainment and require continuous connectivity with cellular networks to ensure their seamless operations. However, handover policies in current cellular networks are primarily designed for ground users, and thus are not appropriate for UAVs due to frequent fluctuations of signal strength in the air. This paper presents a novel handover decision scheme deploying Deep Reinforcement Learning (DRL) to prevent unnecessary handovers while maintaining stable connectivity. The proposed DRL framework takes the UAV state as an input for a proximal policy optimization algorithm and develops a Received Signal Strength Indicator (RSSI) based on a reward function for the online learning of UAV handover decisions. The proposed scheme is evaluated in a 3D-emulated UAV mobility environment where it reduces up to 76 and 73% of unnecessary handovers compared to greedy and Q-learning-based UAV handover decision schemes, respectively. Furthermore, this scheme ensures reliable communication with the UAV by maintaining the RSSI above −75 dBm more than 80% of the time. [ABSTRACT FROM AUTHOR]

In wireless rechargeable sensor networks, mobile vehicles (MVs) combining energy replenishment and data collection are studied extensively. To reduce data overflow, most recent work has utilized more vehicles to assist the MV to collect buffered data. However, the practical network environment and the limitations of the vehicle in the data collection are not considered. UAV-enabled data collection is immune to complex road environments in remote areas and has higher speed and less traveling cost, which can overcome the lack of the vehicle in data collection. In this paper, a novel framework joining the MV and UAV is proposed to prolong the network lifetime and reduce data overflow. The network lifetime is correlated with the charging order; therefore, we first propose a charging algorithm to find the optimal charging order. During the charging period of the MV, the charging time may be longer than the collecting time. An optimal selection strategy of neighboring clusters, which could send data to the MV, was found to reduce data overflow. Then, to further reduce data overflow, an algorithm is also proposed to schedule the UAV to assist the MV to collect buffered data. Finally, simulation results verified that the proposed algorithms can maximize network lifetime and minimize the data loss simultaneously. [ABSTRACT FROM AUTHOR]

Containers virtually package a piece of software and share the host Operating System (OS) upon deployment. This makes them notably light weight and suitable for dynamic service deployment at the network edge and Internet of Things (IoT) devices for reduced latency and energy consumption. Data collection, computation, and now intelligence is included in variety of IoT devices which have very tight latency and energy consumption conditions. Recent studies satisfy latency condition through containerized services deployment on IoT devices and gateways. They fail to account for the limited energy and computing resources of these devices which limit the scalability and concurrent services deployment. This paper aims to establish guidelines and identify critical factors for containerized services deployment on resource constrained IoT devices. For this purpose, two container orchestration tools (i.e., Docker Swarm and Kubernetes) are tested and compared on a baseline IoT gateways testbed. Experiments use Deep Learning driven data analytics and Intrusion Detection System services, and evaluate the time it takes to prepare and deploy a container (creation time), Central Processing Unit (CPU) utilization for concurrent containers deployment, memory usage under different traffic loads, and energy consumption. The results indicate that container creation time and memory usage are decisive factors for containerized micro service architecture. [ABSTRACT FROM AUTHOR]

With the growing interest in big data technology, mobile IoT devices play an essential role in data collection. Generally, IoT sensor nodes are randomly distributed to areas where data cannot be easily collected. Subsequently, when data collection is impossible (i.e., sensing holes occurrence situation) due to improper placement of sensors or energy exhaustion of sensors, the sensors should be relocated. The cluster header in the sensing hole sends requests to neighboring cluster headers for the sensors to be relocated. However, it can be possible that sensors in the specific cluster zones near the sensing hole are continuously requested to move. With this knowledge, there can be a ping-pong problem, where the cluster headers in the neighboring sensing holes repeatedly request the movement of the sensors in the counterpart sensing hole. In this paper, we first proposed the near-uniform selection and movement scheme of the sensors to be relocated. By this scheme, the energy consumption of the sensors can be equalized, and the sensing capability can be extended. Thus the network lifetime can be extended. Next, the proposed relocation protocol resolves a ping-pong problem using queues with request scheduling. Another crucial contribution of this paper is that performance was analyzed using the fully-customed OMNeT++ simulator to reflect actual environmental conditions, not under over-simplified artificial network conditions. The proposed relocation protocol demonstrates a uniform and energy-efficient movement with ping-pong free capability. [ABSTRACT FROM AUTHOR]

It is inevitable for data collection that IoT sensors are distributed to interested areas. However, not only the proper placement of sensors, but also the replacement of sensors that have run out of energy is very difficult. As a remedy, wireless charging systems for IoT sensors have been researched recently, but it is apparent that the availability of charging system is limited especially for IoT sensors scattered in rugged terrain. Thus, it is important that the sensor relocation models to recover sensing holes employ energy-efficient scheme. While there are various methods in the mobile model of wireless sensors, well-known wheel-based movements in rough areas are hard to achieve. Thus, research is ongoing in various areas of the hopping mobile model in which wireless sensors jump. Many past studies about hopping sensor relocation assume that all sensor nodes are aware of entire network information throughout the network. These assumptions do not fit well to the actual environment, and they are nothing but classical theoretical research. In addition, the physical environment (sand, mud, etc.) of the area in which the sensor is deployed can change from time to time. In this paper, we overcome the theoretical-based problems of the past researches and propose a new realistic hopping sensor relocation protocol considering terrain conditions. Since the status of obstacles around the sensing hole is unknown, the success rate of the hopping sensor relocation is used to predict the condition of the surrounding environment. Also, we are confident that our team is uniquely implementing OMNeT++ (Objective Modular Network Testbed in C++) simulation in the hopping sensor relocation protocol to reflect the actual communication environment. Simulations have been performed on various obstacles for performance evaluation and analysis, and we are confident that better energy efficiency with later appearance of sensing holes can be achieved compared to well-known relocation protocols. [ABSTRACT FROM AUTHOR]

Many time-sensitive applications require data to be aggregated from wireless sensor networks with minimum latency. However, the minimum latency aggregation scheduling problem has not been optimally solved due to its NP-hardness. Most existing ideas rely on local information (e.g., node degree, number of children) to organize the schedule order, hence results in solutions that might be far from optimal. In this work, we propose RADAS: a delay-aware Reverse Approach for Data Aggregation Scheduling that determines the transmissions sequence of sensors in a reverse order. Specifically, RADAS iteratively finds the transmissions starting from the last time slot, in which the last sender delivers data to the sink, down to the first time slot, when the data aggregation begins. In each time slot, RADAS intends to maximize the number of concurrent transmissions, while giving higher priority to the sender with potentially higher aggregation delay. Scheduling such high-priority sender first would benefit the maximum selections in subsequent time slots and eventually shorten the schedule length. Simulation results show that our proposed algorithm dominates the existing state-of-the-art schemes, especially in large and dense networks, and offers up to 30% delay reduction. [ABSTRACT FROM AUTHOR]

Recent advances in big data technology collecting and analyzing large amounts of valuable data have attracted a lot of attention. When the information in non-reachable areas is required, IoT wireless sensor network technologies have to be applied. Sensors fundamentally have energy limitations, and it is almost impossible to replace energy-depleted sensors that have been deployed in an inaccessible region. Therefore, moving healthy sensors into the sensing hole will recover the faulty sensor area. In rough surfaces, hopping sensors would be more appropriate than wheel-driven mobile sensors. Sensor relocation algorithms to recover sensing holes have been researched variously in the past. However, the majority of studies to date have been inadequate in reality, since they are nothing but theoretical studies which assume that all the topology in the network is known and then computes the shortest path based on the nonrealistic backing up knowledge—The topology information. In this paper, we first propose a distributed hopping sensor relocation protocol. The possibility of movement of the hopping sensor is also considered to recover sensing holes and is not limited to applying the shortest path strategy. Finally, a performance analysis using OMNeT++ has demonstrated the solidification of the excellence of the proposed protocol. [ABSTRACT FROM AUTHOR]

Multi-access Edge Computing (MEC) paradigm allows devices to offload their intensive service tasks that require high Quality of Experience (QoE). Devices mobility forces services to migrate between MECs to maintain QoE in terms of delay. The decision on when to migrate a service requires a cost and QoE tradeoff, and destination MEC selection needs to be done upon latency and resource availability constraints to minimize migrations. To this end, we propose a novel Resource-Aware Service Migration (RASM) mechanism using Deep Q-Network (DQN) to make migration decisions by achieving tradeoff between the QoE in terms of delay and migration cost. Moreover, DQN learns the best policy for maximizing QoE by selecting the migration destination based on the MECs proximity to the device and estimated resource availability at the servers using queuing model. Results show faster convergence to optimal policy, reduced average end-to-end service delay by 27%, and smaller service rejection rate by 24% comparing to the state-of-the-art. • Multi-access Edge Computing (MEC) enables uRLLC services with low latency. • Devices offload tasks to MEC for expedited processing and saving battery life. • Migrating MEC services minimizes latency, enhances QoE for high-mobility users. • Deep Reinforcement Learning (DRL) optimizes MEC service migration. • DRL considers resource utilization and user mobility. [ABSTRACT FROM AUTHOR]