Node deployment is one of the fundamental tasks for underwater acoustic sensor networks (UASNs) where the deployment strategy supports many fundamental network services, such as network topology control, routing, and boundary detection. Due to the complex deployment environment in three-dimensional (3D) space and unique characteristics of underwater acoustic channel, many factors need to be considered specifically during the deployment of UASNs. Thus, deployment issues in UASNs are significantly different from those of wireless sensor networks (WSNs). Node deployment for UASNs is an attractive research topic upon which a large number of algorithms have been proposed recently. This paper seeks to provide an overview of the most recent advances of deployment algorithms in UASNs while pointing out the open issues. In this paper, the deployment algorithms are classified into three categories based on the mobility of sensor nodes, namely, (I) static deployment, (II) self-adjustment deployment, and (III) movement-assisted deployment. The differences of the representative algorithms in aspects of sensor node types, computation complexity, energy consumption, deployment objectives, and so forth, are discussed and investigated in detail.
The optimum sampling in the one-and two-dimensional (1-D and 2-D) wireless sensor networks (WSNs) with spatial-temporally correlated data is studied in this article. The impacts of the node density in the space domain, the sampling rate in the time domain, and the space-time data correlation on the network performance are investigated asymptotically by considering a large network with infinite area but finite node density and finite temporal sampling rate, under the constraint of fixed power per unit area. The impact of space-time sampling on network performances is investigated in two cases. The first case studies the estimations of the space-time samples collected by the sensors, and the samples are discrete in both the space and time domains. The second case estimates an arbitrary data point on the space-time hyperplane by interpolating the discrete samples collected by the sensors. Optimum space-time sampling is obtained by minimizing the mean square error distortion at the network fusion center. The interactions among the various network parameters, such as spatial node density, temporal sampling rate, measurement noise, channel fading, and their impacts on the system performance are quantitatively identified with analytical and numerical studies.
In modern transportation, traffic congestion has become an urgent problem in large and medium-sized cities. In smart transportation systems, it is an effective solution to design load balancing path planning algorithms that can dynamically adapt to traffic conditions in order to avoid congestion. In this work, a traffic path planning algorithm based on data prediction (TPPDP) is proposed to find the path with the shortest travel time, which is built on a predictive model based on historical traffic data and current traffic information. Furthermore, a path planning algorithm based on data prediction with load balancing (TPPDP-LB) is also proposed, which combines the predicted information and the number of concurrent requests to achieve the path with shortest travel time while maintaining global load balancing. A specific distributed computing framework for TPPDP-LB algorithm is designed to reduce the runtime of the algorithm. The simulation results proved that both TPPDP and TPPDP-LB algorithms have the advantage of shortest travel time, and TPPDP-LB algorithm achieves load balancing of computing. It is also proved that the distributed computing framework designed for TPPDP-LP algorithm can effectively reduce the runtime of system as well as keep the accuracy of algorithm. INDEX TERMS Path planning algorithm, data prediction, load balancing, distributed computing, smart transportation.
In recent years, many researchers have applied complex network theory to urban public transport network to construct complex network and analyze its network performance. The original analysis method generally uses the Space L and Space R model to establish a simple link between public sites but ignores the organic link between the overall network system and the line subsystem. As an important part of urban public transport system, subway plays an important role in alleviating traffic pressure. In this paper, a supernetwork model of Nanjing metro network is established by using the supernetwork method. Three parameters, node-hyperedge degree, hyperedge-node degree, and hyperedge degree, are proposed to describe the model. The model is compared with the traditional Space L and Space P models. The study on the supernetwork model of Nanjing metro complex network shows that the network density, network centrality, and network clustering coefficient are large, and the average network distance is small, which meets the requirements of traffic planning and design. In this study, the subway line is considered as a subsystem and further simplified as a node, so that the complex network analysis method can be applied to the new supernetwork model, expanding the thinking of complex network research.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.