z-logo
open-access-imgOpen Access
Heuristic Optimization for Reliable Data Congestion Analytics in Crowdsourced eHealth Networks
Author(s) -
Yun Shao,
Kun Wang,
Lei Shu,
Song Deng,
Der-Jiunn Deng
Publication year - 2017
Publication title -
ieee access
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.587
H-Index - 127
ISSN - 2169-3536
DOI - 10.1109/access.2016.2646058
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
Reliable data congestion analytics in crowdsourced eHealth networks becomes particularly important, especially in big data era, because of wide adaption of ubiquitous crowdsourced healthcare participants. Since a crowdsourced eHealth network has intermittent connectivity to its remote healthcare provider, researchers usually use some well-studied networks to model the novel network, but data congestion analytics is still a big problem in most intermittent connecting networks. In most cases, data congestion analytics may be realized by fixing the number of forwarded copies, but sometimes, it cannot suit the changing network environments well. This problem could be solved by modifying packet forwarding conditions dynamically through detecting real-time network environment. Based on this idea, in this paper, an optimized routing algorithm named RSW (reduced variable neighborhood search-based spray and wait) is proposed. In the algorithm, nodes will exchange and store each other's buffer status during their communication, based on which, current network environments will be evaluated and quantified as a real-time threshold. Then, spray and wait adapts the threshold for data congestion control. Simulation shows that the proposed algorithm increases data packet delivery probability, and optimize the overhead ratio dramatically, which can be up to ten times lower than that of standard algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom