2 September 2024 in IEEE Sensors Journal
Due to the challenges of low bandwidth, high latency, and high communication energy costs in acoustic channel communication, data collection in underwater acoustic sensor networks remains severely restricted. The assistance of multiple autonomous underwater vehicles (AUVs) in data collection brings advantages of low latency and energy-efficient balance. However, existing AUV-assisted data collection schemes preplan paths and assume data transmission from all nodes, which is inefficient in information delay-sensitive monitoring scenarios. Furthermore, most schemes do not consider the influence of ocean currents when studying path planning. To solve these problems, this paper proposes a joint optimization scheme for multi-AUV cooperative data collection based on Stackelberg game, where the task allocation and path planning problems are formulated as the leader and follower of the Stackelberg game, respectively. At the leader level, a sequential game based algorithm is proposed, dynamically allocating cluster heads that require data transmission to different AUVs. At the follower level, the influence of ocean currents is considered, and an improved backtracking method is employed to plan the optimal path for each AUV. Experimental results show that the proposed method significantly improves network performance when compared with other representative underwater data collection methods.
24 September 2024 in IEEE Transactions on Network and Service Management
To improve the reliability and efficiency of underwater acoustic sensor networks (UASNs) under limited node energy and network attacks, a joint scheme of enhancing robustness and extending network lifetime is proposed in this paper. Scale-free networks exhibit strong robustness against random failures, and because of the lower number of link connections, nodes consume energy more slowly. We first introduce a new scale-free topology evolution model that adjusts the initial number of nodes according to the characteristics of UASNs. This model incorporates factors such as flow load, energy consumption, and distance into the preferential attachment mechanism, balancing the network load and enhancing its resistance to attacks. Further, based on this topology, we propose a network flow adjustment algorithm that features the joint selection of paths and corresponding power levels. Energy consumption is balanced among nodes in proportion to their residual energy, rather than by minimizing the absolute consumed power. Numerical simulations show that different topologies significantly affect network lifetime, which is the longest when the number of links added is 2. The network lifetime of the proposed scheme surpasses the state-of-the-art schemes, such as ETFLA, Initial-BA, and VODA, by up to 37.18%, 46.23%, and 128.80%, respectively.
17 February 2025 in IEEE Transactions on Network and Service Management
In wireless networks, utilizing sniffers for fault analysis, traffic traceback, and resource optimization is a crucial task. However, existing centralized algorithms cannot be applied to high-density wireless networks. Therefore, distributed optimization of channel selection to maximize the monitoring rate of sensors in Wireless Monitoring Networks (WMNs) is a challenge. This paper proposes a joint double auction-based distributed channel selection algorithm (J2A-CS) to maximize overall quality of monitoring (QoM). First, sniffers are redundantly deployed in WMNs, and an initial channel allocation strategy is formulated. Subsequently, sniffers collectively act as buyers and sellers at different stages. Finally, buyers bid asynchronously, and sellers settle synchronously to maximize the seller’s marginal revenue and update the channel selection scheme. As a distributed channel selection algorithm, J2A-CS addresses the highest overall QoM issue in WMNs, demonstrating high scalability and fault tolerance. Simulation results show that J2A-CS significantly improves QoM compared to existing distributed algorithms and outperforms centralized algorithms in high-density scenarios.