Energy limitation is one of the intrinsic shortcomings of wireless sensor networks (WSNs), although it has been widely applied in disaster response, battlefield surveillance, wildfire monitoring, radioactivity detection, etc. Due to the large amount of energy consumed for data transmission, how to prolong the network lifespan by designing various hierarchical routing protocols has attracted more and more attention. As a result, numerous achievements have emerged successively. However, these presented mechanisms can rarely guarantee the satisfactory quality of service (QoS), while lowering the energy cost level of WSNs. Meanwhile, invulnerability is undoubtedly an excellent quantitative index to assess QoS. Therefore, it is critical to develop a practical routing method to optimize network lifetime by considering both invulnerability and energy efficiency. Game theory is suitable for such a critical problem as it can be used in node or at network level to encourage the decision-making capabilities of WSNs. In this paper, a novel invulnerability-aware clustering routing algorithm (IACRA) using game-theoretic method is proposed to solve the predicament. The core features of the addressed game-theory-based routing protocol include integral invulnerability awareness, optimal cluster head selection in hierarchical routing, distance-aware cluster head discovery, and cluster rotation update mechanism for lifetime optimization. Particularly, the integral network invulnerability based on weighted fusion is constructed for further defining the profit model by combining the invulnerability indicators used to evaluate the local and whole network. Meanwhile, the optimal probability function of every node elected as CH in per cluster is established through the game between invulnerability and node energy consumption. In addition, the cluster update mechanism base on cluster rotation is proposed to avoid the rapid death of nodes with large energy consumption for maximizing network lifetime. The experimental results indicated a significant improvement in energy balance as well as in invulnerability compared with the other three kinds of well-known clustering routing protocols including GEEC (Game-theory-based energy efficient clustering routing protocol), HGTD (Hybrid, game-theory-based distributed clustering protocol), and EEGC (Efficient energy-aware and game-theory-based clustering protocol). Concretely, at the 400 communication rounds, the invulnerability of IACRA was higher than that of GEEC, HGTD, and EEGC by 77.56%, 29.45% and 15.90%, respectively, and the average residual energy of IACRA was 8.61%, 18.35% and 6.36% larger than that of GEEC, HGTD, and EEGC, respectively. Based on these results, the proposed protocol can be utilized to increase the capability of WSNs against deterioration of QoS and energy constraints.

Deep learning-based individual recognition of beef cattle has improved the efficiency and effectiveness of individual recognition, providing technical support for modern large-scale farms. However, issues such as over-reliance on back patterns, similar patterns of adjacent cattle leading to low recognition accuracy, and difficulties in deploying models on edge devices exist in the process of group cattle recognition. In this study, we proposed a model based on improved YOLO v5. Specifically, a Simple, Parameter-Free (SimAM) attention module is connected with the residual network and Multidimensional Collaborative Attention mechanism (MCA) to obtain the MCA-SimAM-Resnet (MRS-ATT) module, enhancing the model’s feature extraction and expression capabilities. Then, the $L_{MPDIoU}$ loss function is used to improve the localization accuracy of bounding boxes during target detection. Finally, structural pruning is applied to the model to achieve a lightweight version of the improved YOLO v5. Using 211 test images, the improved YOLO v5 model achieved an individual recognition precision (P) of 93.2%, recall (R) of 94.6%, mean Average Precision (mAP) of 94.5%, FLOPs of 7.84, 13.22 M parameters, and an average inference speed of 0.0746 s. The improved YOLO v5 model can accurately and quickly identify individuals within groups of cattle, with fewer parameters, making it easy to deploy on edge devices, thereby accelerating the development of intelligent cattle farming.

Although rectal temperature is reliable, its measurement requires manual handling and causes stress to animals. IRT provides a non-contact alternative but often ignores bilateral eye temperature differences. This study presents an E-S-YOLO11n model for the automated detection of the binocular regions of sheep, which achieves remarkable performance with a precision of 98.2%, recall of 98.5%, mAP@0.5 of 99.40%, F₁ score of 98.35%, FPS of 322.58 frame/s, parameters of 7.27 M, model size of 3.97 MB, and GFLOPs of 1.38. Right and left eye temperatures exhibit a strong correlation (r = 0.8076, p < 0.0001), However, the eye temperatures show only very weak correlation with rectal temperature (right eye: r = 0.0852; left eye: r = −0.0359), and neither figure reaches statistical significance. Rectal temperature is 7.37% and 7.69% higher than the right and left eye temperatures, respectively. Additionally, the right eye temperature is slightly higher than the left eye (p < 0.01). The study demonstrates the feasibility of combining IRT and deep learning for non-invasive eye temperature monitoring, although environmental factors may limit it as a proxy for rectal temperature. These results support the development of efficient thermal monitoring tools for precision animal husbandry.

Although some progress has been made in studying the triggering updating methods of interest message for reducing node energy consumption in directed diffusion routing protocols, they do not consider the anisotropy of sensing areas of nodes and the requirement of diversity of interest message exchange rates within real‐time performance, which makes these studies unable to accurately adapt to the characteristics of interest message update. In this work, we proposed an improved triggering updating method (ITUM) consisted of adaptive threshold determination based on the analytic hierarchy process and update judgement by similarity comparison of interest messages. Meanwhile, the network model and the sensing model are presented to describe actual network scenarios. We analyze the impact of critical parameters and evaluate the performance of ITUM with several interest message updating methods from the aspect of lowering the number of information exchanges. The simulation results prove that ITUM can improve the adaptability to scene changes while decreasing the number of information exchanges compared with the existing methods. Furthermore, it is shown that ITUM is a highly effective solution for determining the triggering updating conditions of various information exchange rates in directed diffusion routing protocol.