Mobile sink groups play crucial roles to perform their own missions in many wireless sensor network (WSN) applications. In order to support mobility of such sink groups, it is important to design a mechanism for effective discovery of the group in motion. However, earlier studies obtain group region information by periodic query. For that reason, the mechanism leads to significant signaling overhead due to frequent flooding for the query regardless of the group movement. Furthermore, the mechanism worsens the problem by the flooding in the whole expected area. To deal with this problem, we propose a novel mobile sink group support scheme with low communication cost, called Region-Shift-based Mobile Geocasting Protocol (RSMGP). In this study, we utilize the group mobility feature for which members of a group have joint motion patterns. Thus, we could trace group movement by shifting the region as much as partial members move out of the previous region. Furthermore, the region acquisition is only performed at the moment by just deviated members without collaboration of all members. Experimental results validate the improved signaling overhead of our study compared to the previous studies.
Nowadays, mobile–mobile interaction is becoming a fundamental methodology for human–human networking services since mobile devices are the most common interfacing equipment for recent smart services such as food delivery, e-commerce, ride-hailing, etc. Unlike legacy ways of human interaction, on-site and in-person mutual recognition between a service provider and a client in mobile–mobile interaction is not trivial. This is because of not only the avoidance of face-to-face communication due to safety and health concerns but also the difficulty of matching up the online user using mobiles with the real person in the physical world. So, a novel mutual recognition scheme for mobile–mobile interaction is highly necessary. This paper comes up with a novel cyber-physical secure communication scheme relying on the digital twin paradigm. The proposed scheme designs the digital twin networking architecture on which real-world users form digital twins as their own online abstraction, and the digital twins authenticate each other for a smart service interaction. Thus, inter-twin communication (ITC) could support secure mutual recognition in mobile–mobile interaction. Such cyber-physical authentication (CPA) with the ITC is built on the dynamic BLE beaconing scheme with accurate proximity detection and dynamic identifier (ID) allocation. To achieve high accuracy in proximity detection, the proposed scheme is conducted using a wide variety of data pre-processing algorithms, machine learning technologies, and ensemble techniques. A location-dependent ID exploited in the CPA is dynamically generated by the physical user for their own digital twin per each mobile service.
Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, and messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.
Recently, the demand for monitoring a certain object covering large and dynamic scopes such as wildfires, glaciers, and radioactive contaminations, called large-scale fluid objects (LFOs), is coming to the fore due to disasters and catastrophes that lately happened. This article provides an analytic comparison of such LFOs and typical individual mobile objects (IMOs), namely animals, humans, vehicles, etc., to figure out inherent characteristics of LFOs. Since energy-efficient monitoring of IMOs has been intensively researched so far, but such inherent properties of LFOs hinder the direct adaptation of legacy technologies for IMOs, this article surveys technological evolution and advances of LFOs along with ones of IMOs. Based on the communication cost perspective correlated to energy efficiency, three technological phases, namely concentration, integration, and abbreviation, are defined in this article. By reviewing various methods and strategies employed by existing works with the three phases, this article concludes that LFO monitoring should achieve not only decoupling from node density and network structure but also trading off quantitative reduction against qualitative loss as architectural principles of energy-efficient communication to break through inherent properties of LFOs. Future research challenges related to this topic are also discussed.
Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.