Kind Of Sensor Network Research Articles

Retracted] Simulation Test of Wireless Underground Sensor Network in Stadiums

The underground sensor network is a kind of sensor network with sensor nodes buried in the soil. It is used in football fields, golf courses, and other stadiums and can effectively assist the stadium managers to maintain the turf condition. As the turf maintenance in the stadium is still in the manual state, the turf maintenance is time‐consuming and laborious. In order to improve this situation and adapt to future development needs, this paper proposes a wireless underground sensor network, designs the network architecture, and uses NS2 network simulation. The performance of the network was simulated and tested by the platform. This article first proposes a distance estimation method for sound and vibration signals based on the generalized correlation of the time difference of arrival based on the characteristics of the real signal when the event occurs. Then, for the range estimation obtained by applying this method, applying the idea of sparse signal reconstruction, a positioning algorithm based on the time difference of arrival based on the velocity function is proposed. Finally, using the above‐mentioned positioning algorithm, this paper obtains an overall fusion positioning strategy with the help of the idea of data fusion while taking into account the characteristics of the vibration source on the steel beam based on the positioning results of individual sound and vibration signals. The point of innovation lies in the development of positioning and tracking‐oriented platforms, including the development of wireless sensor network gateways and the development of sensor nodes. A network gateway based on network communication was developed to realize the connection with the Internet extranet. The results show that the wireless underground sensor network has strong usability in stadiums, and the network performance can meet the application requirements.

Likelihood function for target tracking in single frequency network

The single frequency network (SFN) refers to a special kind of sensor networks whose illuminators broadcast the same frequency band of signals. The remarkable feature of SFN is that it generates multiple simultaneous measurements from the same target with illuminators uncertain, which brings heavy computational loads in the context of target tracking. To solve this problem, decomposition of the likelihood function (LF) of SFN into the sum of sub-LFs corresponding to each illuminator is proposed. Then, the sub-LFs are approximately modeled through the random finite set framework. The advantage is that it avoids enumerating all the associations between the illuminators and the measurements. Simulation results demonstrate the effectiveness of the proposed LF.

Fuzzy Based Clustering and Energy Efficient Routing for Underwater Wireless Sensor Networks

Underwater Wireless Sensor Network (UWSN) is a particular kind of sensor networks which is characterized by using acoustic channels for communication. UWSN is challenged by great issues specially the energy supply of sensor node which can be wasted rapidly by several factors. The most proposed routing protocols for terrestrial sensor networks are not adequate for UWSN, thus new design of routing protocols must be adapted to this constrain. In this paper we propose two new clustering algorithms based on Fuzzy C-Means mechanisms. In the first proposition, the cluster head is elected initially based on the closeness to the center of the cluster, then the node having the higher residual energy elects itself as a cluster head. All non-cluster head nodes transmit sensed data to the cluster head. This latter performs data aggregation and transmits the data directly to the base station. The second algorithm uses the same principle in forming clusters and electing cluster heads but operates in multi-hop mode to forward data from cluster heads to the underwater sink (uw-sink). Furthermore the two proposed algorithms are tested for static and dynamic deployment. Simulation results demonstrate the effectiveness of the proposed algorithms resulting in an extension of the network lifetime.

Performance evaluation of source extraction in wireless sensor networks

In this paper, the performance of source extraction in bandwidth constrained wireless sensor networks are evaluated. The sensor observations are assumed to be linear instantaneous mixtures of the sources in a sensing field. Two sensor network models are adopted, namely, cluster-based and cluster-free. In cluster-based sensor networks, the cluster members quantize their observations and send the quantized data to the cluster head. Then, the cluster head performs local source extraction, quantizes the extracted signal, and sends the quantized data to the sink. Finally, the sink performs global source extraction. Both single-cluster and multi-cluster cases are considered. In cluster-free sensor networks, all sensors quantize their observations and send the quantized data to the sink. Then, the sink performs global source extraction. The results show that sources can be effectively extracted in both kinds of sensor networks. The performance of source extraction in sensor networks is comparable to that of the benchmarking case where the sensor observations are perfectly gathered at the sink. The impact of the mixing matrix and the amount of available observations on the performance are also discussed.

Jumping ant routing algorithm for sensor networks

Enterprises that may rely on critical equipments which are constantly moving around, for example, hospitals – need to ensure they can know the current location of vital but mobile assets. Besides, the sensor node on each device should inform us whether those relative equipments are functional or does not work at all in a hazardous environment, so that vital equipments can be maintained or fixed beforehand. A sensor network is a potential solution to this kind of application, because every node can be found through the routing processes. Due to its working environment and the mobility of sensor node, this kind of sensor network is very similar to MANETs (Mobile Ad-hoc Networks). This study proposes a jumping ant routing algorithm (JARA) which combines the advantages of reactive and proactive routing to speed up the route discovery time and reduce the route discovery overhead in sensor network.

On the lifetime of large scale sensor networks

Network lifetime is an important metric for battery operated sensor networks. In this paper, we study the lifetime of a large scale sensor network with n randomly deployed sensors communicating with a base station (BS), where each sensor node has the same probability to sense and report its data to the BS. We show how the lifetime of such kind of sensor networks is influenced by transmission schemes, network density and transceiver parameters with different constraints on network mobility, position awareness and maximum transmission range. Our results offer insight into the network deployment and protocol design that optimize the network lifetime.