Future development of helicopter emergency medical services in Korea

This paper discusses the future development of air ambulance operations in Korea. Helicopter emergency medical services are a useful means of transporting critically ill patients to the right hospital, at the right time. It is an important element of the emergency medical system to treat acute diseases at the scene, or in transit. For more efficient operations of the emergency medical helicopters (air ambulances or the so-called ‘Doctor Helgi’ in Korea), various challenges are faced. These include, the expansion of air ambulance bases, proper placement of rendezvous points (landing point), increase of field transport requests, and the operation of night missions. First, it is necessary to reduce the disparity in the benefits of emergency medical care for critically ill patients through the expansion of helicopter bases. Second, through the advancement of joint operations of the pan-ministerial emergency medical helicopters, the time from dispatch to helicopter take-off should be minimized, and a quality improvement program for air transportation should be carried out. Third, it is necessary to increase the number of insufficient rendezvous points and ensure the safety of the helicopters during takeoff and landing, to activate field transportation. Finally, the safety of patients and medical staff should be secured through the systematic preparation of the air transport system for future night missions. To solve these tasks, an appropriate legal system for helicopter emergency medical service is required. Based on the improved system, it is expected that everyone will enjoy equal rights for health, regardless of the regions.

A Speed Control-Based Big Data Collection Algorithm (SCBDCA) Using Clusters and Portable Sink WSNs

WSNs collects a huge amount of heterogeneous information and have been widely applied in various applications. Most of the information collecting techniques for WSNs can't keep away from the hotspot trouble. This problem affects the connectivity of the community and reduces the life of the entire community. Hence, an efficient speed control based data collection algorithm (SCBDCA) using mobile sink in WSNs is proposed. A tree construction technique is introduced based on weight such that the origin nodes of the built timber are described as rendezvous points (RPs). Also, other unique type of nodes named sub or additional rendezvous points (ARPs or SRPs) is chosen in accordance to their traffic consignment and hops to origin nodes in the network. Mobile sink gathers the information from the cluster head (CH) and is controlled by speed control mechanism. Simulation results among different existing procedures exhibit that the SCBDCA can extensively stabilize the consignment of the communication network, decrease the energy consumption, and extend the lifetime in the communication network.

Mobile Sink Based Data Assemblage in Wireless Sensor Networks

A mobile sink, which is used to fetch data from various sensors to prevent the energy-hole problem or hotspot in WSN. To avoid the delay sustained by calling on the sensors a mobile sink is allowed to visit which is called as meeting points and the remaining nodes deliver their data to nearest rendezvous point. The improvement of sink’s data collecting method as well as the maximization of lifespan of the network is done by discovering a most favorable set of meeting points. However, it is very difficult to discover the assigned meeting points and moving way of mobile sink when the sensor produces data roughly. We propose an ultra-modern ACO based mobile sink data gathering in WSN. The important aims of the suggested algorithm are to elongate the existence of network and to reduce the delay in fetching data from sensor nodes. The algorithm also follows to again select the rendezvous points in order to stable the energy utilization of the sensor nodes.

An Adaptive Data Gathering Algorithm for Minimum Travel Route Planning in WSNs Based on Rendezvous Points

A recent trend in wireless sensor network (WSN) research is the deployment of a mobile element (ME) for transporting data from sensor nodes to the base station (BS). This helps to achieve significant energy savings as it minimizes the communications required among nodes. However, a major problem is the large data gathering latency. To address this issue, the ME (i.e., vehicle) should visit certain rendezvous points (i.e., nodes) to collect data before it returns to the BS to minimize the data gathering latency. In view of this, we propose a rendezvous-based approach where some certain nodes serve as rendezvous points (RPs). The RPs gather data using data compression techniques from nearby sources (i.e., affiliated nodes) and transfer them to a mobile element when the ME traverses their paths. This minimizes the number of nodes to be visited, thereby reducing data gathering latency. Furthermore, we propose a minimal constrained rendezvous point (MCRP) algorithm, which ensures the aggregated data are relayed to the RPs based on three constraints: (i) bounded relay hop, (ii) the number of affiliation nodes, and (iii) location of the RP. The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. The effectiveness of the algorithm is validated through extensive simulations against four existing algorithms. Results show that the MCRP algorithm outperforms the compared schemes in terms of the ME’s tour length, data gathering latency, and the number of rendezvous nodes. MCRP exhibits a relatively close performance to other algorithms with respect to power algorithms.

Effective Path Determination Strategy for Mobile Sink in WSN

In Wireless Sensor Network the delay in delivery of data problem can be reduced by using mobile sink. Mobility of the sink has been demonstrated to be the best method to reduce delay in the network. So the path selection for the movement of the sink plays an important role. Hence the selection of minimum number of stopping points are called Rendezvous Points (RPs) is very challenging in WSNs. So a productive procedure was proposed to choose the RPs to develop path for moving sink. At first set of potential points will be generated by using a technique and then using greedy algorithm the RPs were selected from the potential points set. Then an optimization method is used to get still more optimized points. At that point these points are utilized to select path for sink. Proposed algorithm was simulated with some current algorithms and results will be compared based on different performance metrics to demonstrate the viability of the present work.