Square partition‐based node scheduling algorithm for wireless passive sensor networks

Chen, Rongjun; Liu, Jun; Cheng, Lianglun

doi:10.1002/dac.3531

Cited by 12 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lu proposed an efficient adaptive node selection algorithm named ANSTT (Adaptive Node Scheduling for Target Tracking) [16], which combined the network node's perception of moving targets and the relative residual energy of network nodes to develop a working node selection mechanism. It effectively reduced network energy consumption and extended the network life cycle.…”

Section: Related Workmentioning

confidence: 99%

LEACH-MTC: A Network Energy Optimization Algorithm Constraint as Moving Target Prediction

Zhou

et al. 2021

Applied Sciences

View full text Add to dashboard Cite

When some nodes cooperatively track moving targets in a wireless sensor network, some things including network working node selection and network energy consumption are influenced. Thus, this paper proposes an improved algorithm LEACH-MTC (LEACH with Moving Target Constraint) based on low energy adaptive clustering hierarchy protocol (LEACH). First, based on the two-step linearization of the nonlinear dynamic model, the state of the nonlinear moving target is predicted by the extended Kalman filter (EKF). Second, combining the state prediction of the moving target and the performance of collaborative monitoring, this paper constructs an ellipse monitoring area of some working nodes to consist with the direction of the target movement. Subsequently, the node sleep strategy corresponding to the state prediction of moving target is designed. Finally, the cluster head selection strategy is proposed based on energy balance utilizing the state prediction of the moving target. Simulation results show that the proposed LEACH-MTC algorithm can not only ensure the real-time consistency between the changing direction of area and the direction of target movement, but also increase the number of working nodes’ survival and reduce the network energy consumption.

show abstract

Section: Related Workmentioning

confidence: 99%

LEACH-MTC: A Network Energy Optimization Algorithm Constraint as Moving Target Prediction

Zhou

et al. 2021

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…A global task is completed through local image data acquisition and processing and data exchange between nodes, which is particularly suitable for target tracking and event monitoring in transportation, military, security, and other important fields or harsh environments. 9 This work aims to solve this problem. Camera sensor networks can obtain more intuitive target motion image information and achieve more comprehensive positioning, tracking, and behavior analysis of targets than traditional sensor networks.…”

Section: Introductionmentioning

confidence: 99%

“…In distributed ad-hoc networks, selection and scheduling of sensing nodes are key issues in target tracking. 9 This work aims to solve this problem.…”

Section: Introductionmentioning

confidence: 99%

Mobile target tracking algorithm for wireless camera sensor networks with adjustable monitoring direction of nodes

Zhou

Yuan

et al. 2019

Int J Communication

Self Cite

View full text Add to dashboard Cite

Wireless camera sensor networks (WCSNs) possess a powerful physical environment monitoring capability. Camera nodes with adjustable monitoring directions further improve their flexibility. This study focuses on tracking multiple mobile targets to investigate the node scheduling and target location evaluation strategy of WCSNs on the basis of rotating nodes. By referring to existing research, this study improves the camera node monitoring and rotation model and proposes three network performance evaluation indicators. The proposed algorithm schedules nodes and their monitoring directions by using the unutilized energy of the nodes and the number of monitored targets. It also predicts the moving trends of the targets and selects active nodes by using the locations and linear speeds of the targets. Experimental results show that the proposed algorithm has a high target tracking accuracy. Compared with traditional target tracking algorithms, the proposed algorithm can effectively reduce the number of active nodes, balance the energy consumption between nodes, and prolong network lifetime.

show abstract

“…the physical world are often represented by events [3], [4]. The data obtained by multi-modal sensing node are called multimodal data, and the event model is proposed based on multi-modal data and time and space attribute.…”

Section: Introductionmentioning

confidence: 99%

Efficient Matching of Multi-Modal Sensing Nodes for Collaborative Sense Optimization of Composite Events

2019

Self Cite

View full text Add to dashboard Cite

Composite events are sense maximizes collaboration through multiple sensors. Efficient matching of multi-modal sensing nodes in multi-composite events is always a thorny problem. In this paper, the composite event sensing model is first proposed, and then the collaborative-sense problem of multi-modal sensing nodes is translated into a binary matching problem. For these multi-class sensors and multi-class compound events scene, a pruning-grafting and parallel strategy be adopted, which can speed up the traversal speed and find the maximum matching edge quickly. For multi-nodes selection, the distance of the composite event constraints into binarily weighted matching. A collaborative-sense intelligent matching algorithm is suggested. It takes collaborative in various kinds of nodes matching combining with the distribution of the composite event itself around the nodes. Combined with the random distribution of various sensor nodes and composite events, the matching rate of some sensor nodes is sacrificed for the overall event efficiency. Compare to parallel algorithms, it has another effect on perceived efficiency. Finally, by comparing with other algorithms, CSSMA and other proposed algorithms have a certain advantage in the inclusive sense efficiency. In terms of composite events collaborative-sense, this work has nice theoretical significance and practical value.

show abstract

Square partition‐based node scheduling algorithm for wireless passive sensor networks

Cited by 12 publications

References 26 publications

LEACH-MTC: A Network Energy Optimization Algorithm Constraint as Moving Target Prediction

LEACH-MTC: A Network Energy Optimization Algorithm Constraint as Moving Target Prediction

Mobile target tracking algorithm for wireless camera sensor networks with adjustable monitoring direction of nodes

Efficient Matching of Multi-Modal Sensing Nodes for Collaborative Sense Optimization of Composite Events

Contact Info

Product

Resources

About