Owing to the increasing capabilities of mobile devices and the development of mobile communication techniques in vehicular ad hoc networks (VANETs), mobile multimedia services have focused on supporting high Quality of Service (QoS) and Quality of Experience (QoE) for the subscribers in video streaming services. In VANETs, high-quality video streaming services aim to provide subscribers with safety and various infotainment applications. Due to the dynamic topology and frequent connectivity changes in moving vehicles, video streaming services require elastic and continuous vehicle information updates to present interactive real-time views of nontrivial road scenarios. The QoS and QoE are affected due to obstacles, re-location tracking, network traffic, and bandwidth factors that occur due to mobility problems and significantly influence the ability of vehicles with mobility to provide video streaming services. To achieve high QoS and QoE of video streaming services in VANETs, this paper proposes a novel protocol named PSOstreaming based on a particle swarm optimization (PSO) which is one of the mainstream and nature-inspired algorithms for swarm intelligence (SI). PSOstreaming calculates the PSQ score, which is the scoring method of the node in the topology in terms of the data communication capability measurement to analyze and optimize topology information in real-road circumstances. In addition, PSOstreaming utilizes a 3D vector mobility prediction algorithm for the mobility prediction method for the vehicles to address the characteristics of VANETs. In the topology, PSOstreaming defines Global PSO members and Local PSO members to disseminate video packets for video-streaming services to the service requester by computational equations. Experimental results indicate that PSOstreaming achieves high-quality video streaming services with a flexible response to dynamic topology changes and a high frame delivery ratio in terms of QoS and QoE.

As many industrial applications require real-time and reliability communication, a variety of routing graph construction schemes were proposed to satisfy the requirements in Industrial Wireless Sensor Networks (IWSNs). Each device transmits packet through a route which is designated based on the graph. However, as existing studies consider a network consists of static devices only, they cannot cope with the network changes by movement of mobile devices considered important in the recent industrial environment. Thus, the communication requirements cannot be guaranteed because the existing path is broken by the varying network topology. The communication failure could cause critical problems such as malfunctioning equipment. The problem is caused repeatedly by continuous movement of mobile devices, even if a new graph is reconstructed for responding the changed topology. To support mobile devices exploited in various industrial environments, we propose a Hierarchical Routing Graph Construction (HRGC). The HRGC is consisted of two phases for hierarchical graph construction: In first phase, a robust graph called skeleton graph consisting only of static devices is constructed. The skeleton graph is not affected by network topology changes and does not suffer from packet loss. In second phase, the mobile devices are grafted into the skeleton graph for seamless communication. Through the grafting process, the routes are established in advance for mobile device to communicate with nearby static devices in anywhere. The simulation results show that the packet delivery ratio is improved when the graph is constructed through the HRGC.

Face-routing is one of the reliable recovery schemes when geographic routing fails to transmit data packets. Although studies on face-routing can overcome the failure of the data transmission, they lead to much energy consumption due to frequent data transmissions between adjacent nodes for carrying out the rule of face-routing. To avoid the frequent data transmissions, several face-routing schemes have been recently proposed to transmit data packets to the farthest-neighbor node. However, they happen with many data retransmissions because the farthest-neighbor node has a relatively low transmission success ratio. To solve this problem, we propose a new face-routing scheme that determines the most appropriate neighbor node to balance the trade-off between energy efficiency and transmission reliability with two viewpoints. The first viewpoint focuses on how to increase the distance progress of the data delivery in one-hop range to enhance energy efficiency. After that, the second viewpoint focuses on how to increase the success ratio of the data delivery to enhance the transmission reliability. As a result of the simulation, it was confirmed that the proposed method achieves better performance in terms of energy efficiency than existing face-routing research, and it is better than recent face-routing research in terms of reliability and retransmission.

In wireless sensor networks (WSNs), detection and report of continuous object, such as forest fire and toxic gas leakage, is one of the major applications. In large-scale continuous object tracking in WSNs, there might be many source nodes simultaneously, detecting the continuous object. Each nodes reports its data to both a base station and mobile workers in the industry field. For communication between the source nodes and a mobile worker, sink location service is needed to continuously notify the location of the mobile worker. But, as the application has a large number of sources, it causes a waste of energy consumption. To address this issue, in this paper, we propose a two-phase sink location service scheme. In the first phase, the proposed scheme constructs a virtual grid structure for merging the source nodes. Then, the proposed scheme aggregates the merging points from an originated merging point as the second phase. Simulation results show that the proposed scheme is superior to other schemes in terms of energy consumption.

In IIoT, WirelessHART is one of the reliable wireless network standards since it can improve the productivity and efficiency. Recently, in Industrial area, the enterprise and the researcher have been paid attention to a mobile device, which will become one of the key points in the industry due to its potential ability. However, since WirelessHART existing researches handle with a mobile device as a single point-to-point viewpoint, they will happen a disconnection and a wasteful communication resource problem when they use a mobile device. In order to solve this limitation, we propose a proactive and cost-effective scheme for the mobility by focusing on a mobility as a group viewpoint. By using onion-peeling method, the proposed scheme can select some fixed devices to communicate with a mobile device and prevent redundant communication provision for a mobile device. The simulation results show that the proposed scheme is more cost-efficient and reliable when it compares with the existing researches of WirelessHART.

In WSNs, multipath is well-known as a method to improve the reliability of packet delivery by making multiple routes from a source node to a destination node. To improve reliability and load-balancing, it is important to ensure that disjoint characteristics of multipath do not use same nodes during path generation. However, when multipath studies encounter a hole area from which is hard to transmit data packets, they have a problem with breaking the disjoint features of multipath. Although existing studies propose various strategies to bypass hole areas, they have side effects that significantly accelerate energy consumption and packet transmission delay. Therefore, to retain the disjoint feature of multipath, we propose a new scheme that can reduce delay and energy consumption for a node near a hole area using two approaches—global joint avoidance and local avoidance. This scheme uses global joint avoidance to generate a new path centered on a hole area and effectively bypasses the hole area. This scheme also uses local joint avoidance that does not select the same nodes during new path generation using a marking process. In simulations, the proposed scheme has an average 30% improvement in terms of average energy consumption and delay time compared to other studies.