An Infusion Containers Detection Method Based on YOLOv4 with Enhanced Image Feature Fusion.

The detection of infusion containers is highly conducive to reducing the workload of medical staff. However, when applied in complex environments, the current detection solutions cannot satisfy the high demands for clinical requirements. In this paper, we address this problem by proposing a novel method for the detection of infusion containers that is based on the conventional method, You Only Look Once version 4 (YOLOv4). First, the coordinate attention module is added after the backbone to improve the perception of direction and location information by the network. Then, we build the cross stage partial-spatial pyramid pooling (CSP-SPP) module to replace the spatial pyramid pooling (SPP) module, which allows the input information features to be reused. In addition, the adaptively spatial feature fusion (ASFF) module is added after the original feature fusion module, path aggregation network (PANet), to facilitate the fusion of feature maps at different scales for more complete feature information. Finally, EIoU is used as a loss function to solve the anchor frame aspect ratio problem, and this improvement allows for more stable and accurate information of the anchor aspect when calculating losses. The experimental results demonstrate the advantages of our method in terms of recall, timeliness, and mean average precision (mAP).

Minimizing Delay and Transmission Times with Long Lifetime in Code Dissemination Scheme for High Loss Ratio and Low Duty Cycle Wireless Sensor Networks.

Software defined networks brings greater flexibility to networks and therefore generates new vitality. Thanks to the ability to update soft code to sensor nodes, wireless sensor networks (WSNs) brings profound changes to Internet of Things. However, it is a challenging issue to minimize delay and transmission times and maintain long lifetime when broadcasting data packets in high loss ratio and low duty cycle WSNs. Although there have been some research concerning code dissemination, those schemes can only achieve a tradeoff between different performances, instead of optimizing all these important performances at the same time. Therefore, in this paper we propose a new strategy that can reduce delay and transmission times simultaneously. In traditional method, the broadcasting nature of wireless communication is not sufficiently utilized. By allowing sons of the same parent node to share awake slots, the broadcasting nature is well exploited and delay is thus reduced as well as transmission times with lifetime not affected. And, as we discover there is energy surplus when collecting data in area away from sink, we further improve this strategy so that all the performances can be further bettered. Compared with traditional method, the methods we design (IFAS, BTAS and AAPS) can respectively reduce delay by 20.56%, 31.59%, 55.16% and reduce transmission times by 29.53%, 43.93%, 42.04%, while not reducing lifetime.

A Deployment Strategy for Multiple Types of Requirements in Wireless Sensor Networks.

Node deployment is one of the most crucial issues in wireless sensor networks, and it is of realistic significance to complete the deployment task with multiple types of application requirements. In this paper, we propose a deployment strategy for multiple types of requirements to solve the problem of deterministic and grid-based deployment. This deployment strategy consists of three deployment algorithms, which are for different deployment objectives. First, instead of general random search, we put forward a deterministic search mechanism and the related cost-based deployment algorithm, in which nodes are assigned to different groups which are connected by near-shortest paths, and realize significant reduction of path length and deployment cost. Second, rather than ordinary nondirection deployment, we present a notion of counterflow and the related delay-based deployment algorithm, in which the profit of deployment cost and loss of transmission delay are evaluated, and achieve much diminishing of transmission path length and transmission delay. Third, instead of conventional uneven deployment based on the distances to the sink, we propose a concept of node load level and the related lifetime-based deployment algorithm, in which node distribution is determined by the actual load levels and extra nodes are deployed only where really necessary. This contributes to great improvement of network lifetime. Last, extensive simulations are used to test and verify the effectiveness and superiority of our findings.

A survey on clustering routing protocols in wireless sensor networks.

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.