A self-sustainable opportunistic solution for emergency detection in ageing people living in rural areas
7
Citation
49
Reference
10
Related Paper
Citation Trend
Abstract:
Abstract There are contexts where communication with TCP/IP protocol is not possible due to the lack of infrastructure or a reliable and continuous data transmission. In this cases, alternatives such as Opportunistic Networks (OPPNets) are valid. Such challenging conditions are common in rural areas and are a significant obstacle for the deployment of eHealth technologies for older adults. Considering this context, the present work introduces Interest-based System for Communication in Isolated Areas (ISCA), an OPPNet architecture for remote monitoring and emergency detection in ageing people who live alone. For this, the energetic requirements are considered, providing efficient and sustainable operation. The proposal makes use of a routing algorithm based on interests which enables asynchronous communication among entities. ISCA is evaluated over a realistic scenario and compared with similar state-of-the-art solutions. Experimental results show that ISCA notably improves the delivery probability with an enhancement of 52.25% in comparison to the second best alternative and provides a suitable average latency. Moreover, it also achieves better performance in terms of overhead and hops number compared to the other studied protocolsExecution model
Bulk synchronous parallel
Parallel programming model
Cite
Citations (3)
Communication costs are an important factor in the performance of massively parallel algorithms. We present a new asynchronous parallel algorithm for solving sparse linear systems that reduces communication compared to other algorithms on distributed memory machines. Implemented using passive one-sided remote memory access (RMA) MPI functions, the new method is a variation of the Southwell method, where rows are relaxed greedily, instead of sequentially, by choosing the row with the maximum residual norm. A process relaxes its rows if it holds the maximum residual norm among its neighbors at any given moment. Experimental results show that this method reduces communication costs compared to several other asynchronous iterative methods and the classic synchronous Jacobi method.
Distributed memory
Cite
Citations (11)
Network communiction is divided into two models which are hard realtime and weak realtime based on the need of data access to realtime. Using attribute of JMS communiction and combining message EJB, weak realtime asynchronous data transmission with store and forward between producer and consumer is introduced.
Point-to-point
Cite
Citations (1)
The performance of database/Web-service backed applications can be significantly improved by asynchronous submission of queries/requests well ahead of the point where the results are needed, so that results are likely to have been fetched already when they are actually needed. However, manually writing applications to exploit asynchronous query submission is tedious and error-prone. In this paper we address the issue of automatically transforming a program written assuming synchronous query submission, to one that exploits asynchronous query submission. Our program transformation method is based on data flow analysis and is framed as a set of transformation rules. Our rules can handle query executions within loops, unlike some of the earlier work in this area. We also present a novel approach that, at runtime, can combine multiple asynchronous requests into batches, thereby achieving the benefits of batching in addition to that of asynchronous submission. We have built a tool that implements our transformation techniques on Java programs that use JDBC calls; our tool can be extended to handle Web service calls. We have carried out a detailed experimental study on several real-life applications, which shows the effectiveness of the proposed rewrite techniques, both in terms of their applicability and the performance gains achieved.
Program transformation
Cite
Citations (25)
Process migration
Cite
Citations (8)
Cite
Citations (12)
Disconnection
Remote procedure call
Cite
Citations (4)
Advancement in software, hardware and communication technologies have led to the development of design and implementation of different types of networks that are deployed in various environments.One such network that has gained a lot of interest in the last few decades is the Vehicular Ad-Hoc Network (VANET).VANET has become an active area of research, development and standardization because it has remarkable potential to improve vehicle and road safety, traffic management, and also provide comfort to both drivers and passengers.Roadside units (RSUs) are a vital component of Vehicular ad hoc network (VANET).Mainly, the density and location of RSUs decides the success of a VANET.But, the sky-high deployment costs of the RSUs make it impossible to deploy a large number of RSUs on the specific area or road.Thus, there rises a need to optimally deploy a restricted number of RSUs in a given region in order to achieve maximum performance.This paper presents a new TDB based RSUs deployment algorithm with a goal of attaining high efficiency and cover maximum area.Matlab platform is used to assess the performance of the proposed algorithm using several performance metrics.
Cite
Citations (2)
This paper proposes a robot-deployment algorithm that overcomes unpredicted obstacles and employs full-coverage deployment with a minimal number of sensor nodes. Without the location information, node placement and spiral movement policies are proposed for the robot to deploy sensors efficiently to achieve power conservation and full coverage, while an obstacle surrounding movement policy is proposed to reduce the impacts of an obstacle upon deployment. Simulation results reveal that the proposed robot-deployment algorithm outperforms most existing robot-deployment mechanisms in power conservation and obstacle resistance and therefore achieves a better deployment performance.
Obstacle avoidance
Cite
Citations (80)