BACKGROUND Healthcare monitoring systems have emerged as one of the most vital systems and from the past decade have become technology-oriented. People face an unnecessary mortality crisis due to various diseases owing to lack of medical care for patients at the perfect time. Our goal is to develop the application for cloud based Health Care system. OBJECTIVE Cyber-attacks are the primary challenge for cloud-based control of health care. In that big serious issue in the field of health care monitoring are denial of services, problems with node failure, traffic jams between nodes and malicious attacks. METHODS In order to cope up with above challenges this work has proposed a secure structure for cloud based human health monitoring system. Initially, a novel Multidimensional Authentication design method which therefore provides the data with a secure authentication and can be prevented from intruding an unauthorized person. RESULTS Then provide an effective single new Steadiness Pawn Detection and Cybernetic Security Framework for safe and secure patient health monitoring. As a consequence, Concealment Drip Detection is suggested to improve the scalability in fog computing, which prevents intruders from information in the fog. CONCLUSIONS Therefore, by using all the above techniques in a single framework the major data risks in healthcare systems are prevented and the cloud-based health monitoring system requires more efficient monitoring of the patient's health status, thereby preserving human life on time. CLINICALTRIAL Background: Healthcare monitoring systems have emerged as one of the most vital systems and from the past decade have become technology-oriented. People face an unnecessary mortality crisis due to various diseases owing to lack of medical care for patients at the perfect time. Our goal is to develop the application for cloud based Health Care system. Objective: Cyber-attacks are the primary challenge for cloud-based control of health care. In that big serious issue in the field of health care monitoring are denial of services, problems with node failure, traffic jams between nodes and malicious attacks. Methods: In order to cope up with above challenges this work has proposed a secure structure for cloud based human health monitoring system. Initially, a novel Multidimensional Authentication design method which therefore provides the data with a secure authentication and can be prevented from intruding an unauthorized person. Results: Then provide an effective single new Steadiness Pawn Detection and Cybernetic Security Framework for safe and secure patient health monitoring. As a consequence, Concealment Drip Detection is suggested to improve the scalability in fog computing, which prevents intruders from information in the fog. Therefore, by using all the above techniques in a single framework the major data risks in healthcare systems are prevented and the cloud-based health monitoring system
{"title":"A Multidimensional Authentication and Secure Framework for Cloud-Based Human Health Monitoring System","authors":"Narahari Narasimhaiah, R. Sam","doi":"10.2196/preprints.30247","DOIUrl":"https://doi.org/10.2196/preprints.30247","url":null,"abstract":"BACKGROUND Healthcare monitoring systems have emerged as one of the most vital systems and from the past decade have become technology-oriented. People face an unnecessary mortality crisis due to various diseases owing to lack of medical care for patients at the perfect time. Our goal is to develop the application for cloud based Health Care system. OBJECTIVE Cyber-attacks are the primary challenge for cloud-based control of health care. In that big serious issue in the field of health care monitoring are denial of services, problems with node failure, traffic jams between nodes and malicious attacks. METHODS In order to cope up with above challenges this work has proposed a secure structure for cloud based human health monitoring system. Initially, a novel Multidimensional Authentication design method which therefore provides the data with a secure authentication and can be prevented from intruding an unauthorized person. RESULTS Then provide an effective single new Steadiness Pawn Detection and Cybernetic Security Framework for safe and secure patient health monitoring. As a consequence, Concealment Drip Detection is suggested to improve the scalability in fog computing, which prevents intruders from information in the fog. CONCLUSIONS Therefore, by using all the above techniques in a single framework the major data risks in healthcare systems are prevented and the cloud-based health monitoring system requires more efficient monitoring of the patient's health status, thereby preserving human life on time. CLINICALTRIAL Background: Healthcare monitoring systems have emerged as one of the most vital systems and from the past decade have become technology-oriented. People face an unnecessary mortality crisis due to various diseases owing to lack of medical care for patients at the perfect time. Our goal is to develop the application for cloud based Health Care system. Objective: Cyber-attacks are the primary challenge for cloud-based control of health care. In that big serious issue in the field of health care monitoring are denial of services, problems with node failure, traffic jams between nodes and malicious attacks. Methods: In order to cope up with above challenges this work has proposed a secure structure for cloud based human health monitoring system. Initially, a novel Multidimensional Authentication design method which therefore provides the data with a secure authentication and can be prevented from intruding an unauthorized person. Results: Then provide an effective single new Steadiness Pawn Detection and Cybernetic Security Framework for safe and secure patient health monitoring. As a consequence, Concealment Drip Detection is suggested to improve the scalability in fog computing, which prevents intruders from information in the fog. Therefore, by using all the above techniques in a single framework the major data risks in healthcare systems are prevented and the cloud-based health monitoring system ","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"20 1","pages":"113-143"},"PeriodicalIF":0.9,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75612240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 19th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, & Ubiquitous Networks","authors":"","doi":"10.1145/3551663","DOIUrl":"https://doi.org/10.1145/3551663","url":null,"abstract":"","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"1 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79895081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-12-16DOI: 10.1109/WIOPT.2007.4480016
B. Hassibi
Entropic Vectors, Convex Optimization and Wireless Networks Information theory is well poised to have an impact on the manner in which future networks are designed and maintained, both because wired networks are ripe for applications such as network coding and also because wireless networks cannot be satisfactorily dealt with using conventional networking tools. The challenge is that most network information theory problems are notoriously difficult and so the barriers that must be overcome are often quite high. In particular, there are only a limited number of tools available and so fresh approaches are quite welcome. We describe an approach based on the definition of the space of "normalized" entropic vectors. In this framework, for a large class of acyclic memoryless networks, the capacity region for an arbitrary set of sources and destinations can be found by maximization of a linear function over the set of channel-constrained normalized entropic vectors and some linear constraints. The key point is that the closure of this set is convex and compact. While this may not necessarily make the problem simpler, it certainly circumvents the "infinite-letter characterization" issue, as well as the nonconvexity of earlier formulations. It also exposes the core of the problem as that of determining the space of normalized entropic vectors.
{"title":"Keynote Speaker","authors":"B. Hassibi","doi":"10.1109/WIOPT.2007.4480016","DOIUrl":"https://doi.org/10.1109/WIOPT.2007.4480016","url":null,"abstract":"Entropic Vectors, Convex Optimization and Wireless Networks Information theory is well poised to have an impact on the manner in which future networks are designed and maintained, both because wired networks are ripe for applications such as network coding and also because wireless networks cannot be satisfactorily dealt with using conventional networking tools. The challenge is that most network information theory problems are notoriously difficult and so the barriers that must be overcome are often quite high. In particular, there are only a limited number of tools available and so fresh approaches are quite welcome. We describe an approach based on the definition of the space of \"normalized\" entropic vectors. In this framework, for a large class of acyclic memoryless networks, the capacity region for an arbitrary set of sources and destinations can be found by maximization of a linear function over the set of channel-constrained normalized entropic vectors and some linear constraints. The key point is that the closure of this set is convex and compact. While this may not necessarily make the problem simpler, it certainly circumvents the \"infinite-letter characterization\" issue, as well as the nonconvexity of earlier formulations. It also exposes the core of the problem as that of determining the space of normalized entropic vectors.","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"51 1","pages":"1-2"},"PeriodicalIF":0.9,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86837103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Stefan Van Der Veeken, J. Wubben, C. Calafate, Juan-Carlos Cano, P. Manzoni, J. Márquez-Barja
Since some years, research on the use of unmanned aerial vehicles (UAVs) has been very popular, and because of that a wide range of commercial and military applications already exists. Nowadays, the trend towards autonomous flying is growing steadily. Autonomous flying requires UAVs to have the ability to navigate in urban or other challenging environments without causing collisions or endangering humans. To achieve this objective, a safe and reliable collision avoidance system (CAS) needs to be used. In particular, a CAS needs to successfully sense and detect a possible collision with an object to efficiently avoid the obstacle. Multiple different techniques exist to implement a CAS. In this paper, we propose a collision avoidance protocol which is based on magnetic attraction and repulsion forces. The results show that, with the use of our protocol, collisions are safely avoided in various scenarios, while maintaining the overhead time to a minimum.
{"title":"A Collision Avoidance Strategy For Multirrotor UAVs Based On Artificial Potential Fields","authors":"Stefan Van Der Veeken, J. Wubben, C. Calafate, Juan-Carlos Cano, P. Manzoni, J. Márquez-Barja","doi":"10.1145/3479240.3488531","DOIUrl":"https://doi.org/10.1145/3479240.3488531","url":null,"abstract":"Since some years, research on the use of unmanned aerial vehicles (UAVs) has been very popular, and because of that a wide range of commercial and military applications already exists. Nowadays, the trend towards autonomous flying is growing steadily. Autonomous flying requires UAVs to have the ability to navigate in urban or other challenging environments without causing collisions or endangering humans. To achieve this objective, a safe and reliable collision avoidance system (CAS) needs to be used. In particular, a CAS needs to successfully sense and detect a possible collision with an object to efficiently avoid the obstacle. Multiple different techniques exist to implement a CAS. In this paper, we propose a collision avoidance protocol which is based on magnetic attraction and repulsion forces. The results show that, with the use of our protocol, collisions are safely avoided in various scenarios, while maintaining the overhead time to a minimum.","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"1 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91047778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Session 3: Security, Privacy and Energy in Wireless Ad hoc Networks","authors":"Thomas Begin","doi":"10.1145/3501372","DOIUrl":"https://doi.org/10.1145/3501372","url":null,"abstract":"","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"5 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79084938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Leticia Lemus Cárdenas, A. M. Mezher, Juan Pablo Astudillo León, M. Aguilar Igartua
The emerging application of machine learning (ML) in different areas and the good results obtained have motivated its inclusion in the intelligent transport system (ITS) with smart cities and also in vehicular ad hoc networks (VANETs). In this sense, the main contribution of this work is the proposal of a decision tree-based multimetric routing protocol to make more intelligent forwarding decisions in the selection of the best next-hop neighbour node to transmit packets to the destination. To the best of our knowledge, most of the available datasets regarding vehicular networks are related to mobility patterns. Thus, we have collected our targeted dataset from several simulations runs over different urban vanet scenarios. Besides, we have included the evaluation of the importance of each routing metric by applying regularization. The goal here is to include the more relevant metrics to support the ML in the routing decisions. The performance evaluation shows significant improvements in terms of packet losses and end-to-end delay.
{"title":"DTMR","authors":"Leticia Lemus Cárdenas, A. M. Mezher, Juan Pablo Astudillo León, M. Aguilar Igartua","doi":"10.1145/3479240.3488525","DOIUrl":"https://doi.org/10.1145/3479240.3488525","url":null,"abstract":"The emerging application of machine learning (ML) in different areas and the good results obtained have motivated its inclusion in the intelligent transport system (ITS) with smart cities and also in vehicular ad hoc networks (VANETs). In this sense, the main contribution of this work is the proposal of a decision tree-based multimetric routing protocol to make more intelligent forwarding decisions in the selection of the best next-hop neighbour node to transmit packets to the destination. To the best of our knowledge, most of the available datasets regarding vehicular networks are related to mobility patterns. Thus, we have collected our targeted dataset from several simulations runs over different urban vanet scenarios. Besides, we have included the evaluation of the importance of each routing metric by applying regularization. The goal here is to include the more relevant metrics to support the ML in the routing decisions. The performance evaluation shows significant improvements in terms of packet losses and end-to-end delay.","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"50 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76933797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
C. G. S. Capanema, Fabrício A. Silva, T. R. Silva, A. Loureiro
Recommendation systems have been used to predict the next place a user is willing to visit. However, these methods commonly achieve low hit rates because they aim to recommend exact locations among many possibilities. A higher-level approach that is more effective is to predict the category of the next location since it can be helpful in a variety of services. For example, it is possible to do category-based location recommendations, more assertive advertising programs, among others. In this work, we present POI-RGNN (Points of Interest (PoI) - Recurrent and Graph-based Neural Network), a neural network for predicting the category of the next PoI that an individual will visit. Our proposal leverages Recurrent Neural Networks (RNN) and Graph Neural Networks (GNN) and combines them in a novel architecture. Additionally, the POI-RGNN explores new types of inputs that are sent to recurrent and graph layers. Results show that the proposed model improves macro and weighted f1-score among all PoI categories. We evaluate POI-RGNN in two distinct types of real-world datasets, showing its effectiveness in different contexts.
{"title":"POI-RGNN: Using Recurrent and Graph Neural Networks to Predict the Category of the Next Point of Interest","authors":"C. G. S. Capanema, Fabrício A. Silva, T. R. Silva, A. Loureiro","doi":"10.1145/3479240.3488532","DOIUrl":"https://doi.org/10.1145/3479240.3488532","url":null,"abstract":"Recommendation systems have been used to predict the next place a user is willing to visit. However, these methods commonly achieve low hit rates because they aim to recommend exact locations among many possibilities. A higher-level approach that is more effective is to predict the category of the next location since it can be helpful in a variety of services. For example, it is possible to do category-based location recommendations, more assertive advertising programs, among others. In this work, we present POI-RGNN (Points of Interest (PoI) - Recurrent and Graph-based Neural Network), a neural network for predicting the category of the next PoI that an individual will visit. Our proposal leverages Recurrent Neural Networks (RNN) and Graph Neural Networks (GNN) and combines them in a novel architecture. Additionally, the POI-RGNN explores new types of inputs that are sent to recurrent and graph layers. Results show that the proposed model improves macro and weighted f1-score among all PoI categories. We evaluate POI-RGNN in two distinct types of real-world datasets, showing its effectiveness in different contexts.","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"67 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89965920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pablo Andrés Barbecho Bautista, L. Urquiza-Aguiar, M. Aguilar-Igartua
An approach to evaluate vehicular networks is to make use of simulators. A simulation engine allows the vehicular network to control the traffic simulation on run time. In this regard, researchers can assess their vehicular network models under realistic scenarios (e.g., highway, urban, rural). However, setting up these traffic mobility scenarios may result in a time-consuming task requiring the definition of several elements: (i) the road map, (ii) the traffic elements (e.g., traffic lights), (iii) the type of vehicles, and (iv) vehicle traces/routes. This paper focuses on facilitating this process, taking advantage of a well-known open-source traffic simulator called SUMO (Simulation of Urban MObility). Even though the SUMO simulator builds in several facilities to generate traffic mobility scenarios, it requires a considerable learning time. This paper proposes an open-source traffic simulator SUMO extension that encapsulates most SUMO facilities in an easy-to-use traffic generation tool called SUMO-based Traffic Mobility Generation Tool (STGT). The STGT tool facilities the scenario generation avoiding the learning curve of the SUMO framework, and provides performance statistics of the generated vehicular movements. The STGT tool copes with the whole traffic simulation process, including a graphical user interface for novice users and a command-line interface for advanced users.
{"title":"STGT: SUMO-Based Traffic Mobility Generation Tool for Evaluation of Vehicular Networks","authors":"Pablo Andrés Barbecho Bautista, L. Urquiza-Aguiar, M. Aguilar-Igartua","doi":"10.1145/3479240.3488523","DOIUrl":"https://doi.org/10.1145/3479240.3488523","url":null,"abstract":"An approach to evaluate vehicular networks is to make use of simulators. A simulation engine allows the vehicular network to control the traffic simulation on run time. In this regard, researchers can assess their vehicular network models under realistic scenarios (e.g., highway, urban, rural). However, setting up these traffic mobility scenarios may result in a time-consuming task requiring the definition of several elements: (i) the road map, (ii) the traffic elements (e.g., traffic lights), (iii) the type of vehicles, and (iv) vehicle traces/routes. This paper focuses on facilitating this process, taking advantage of a well-known open-source traffic simulator called SUMO (Simulation of Urban MObility). Even though the SUMO simulator builds in several facilities to generate traffic mobility scenarios, it requires a considerable learning time. This paper proposes an open-source traffic simulator SUMO extension that encapsulates most SUMO facilities in an easy-to-use traffic generation tool called SUMO-based Traffic Mobility Generation Tool (STGT). The STGT tool facilities the scenario generation avoiding the learning curve of the SUMO framework, and provides performance statistics of the generated vehicular movements. The STGT tool copes with the whole traffic simulation process, including a graphical user interface for novice users and a command-line interface for advanced users.","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"6 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87224760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xavier Calle Heredia, Pablo Andrés Barbecho Bautista, M. Aguilar-Igartua
Intelligent Transport Systems (ITS) are fundamental to reaching the concept of smart cities. However, the incoming development of vehicular applications will originate an increase in long-term evolution (LTE) traffic demand, so an approach consists of reducing the cell coverage area. This paper presents an alternative solution to deal with areas with a lack of coverage originated by the deployment of LTE micro-cells. We propose a heterogeneous network algorithm named Multi-Metric Heterogeneous Network Algorithm (MMHNA), which uses LTE and dedicated short-range communications (DSRC) technologies. The objective is to extend the LTE communication range with the support of DSRC technology through a forwarding process. This proposal will allow vehicles to send messages to a server directly connected to the evolved Node B (eNB), i.e., the radio network node for LTE networks, even if the sending vehicle is out of range of the eNB.
{"title":"Performance Evaluation of Cooperative LTE-DSRC Vehicular Network","authors":"Xavier Calle Heredia, Pablo Andrés Barbecho Bautista, M. Aguilar-Igartua","doi":"10.1145/3479240.3488528","DOIUrl":"https://doi.org/10.1145/3479240.3488528","url":null,"abstract":"Intelligent Transport Systems (ITS) are fundamental to reaching the concept of smart cities. However, the incoming development of vehicular applications will originate an increase in long-term evolution (LTE) traffic demand, so an approach consists of reducing the cell coverage area. This paper presents an alternative solution to deal with areas with a lack of coverage originated by the deployment of LTE micro-cells. We propose a heterogeneous network algorithm named Multi-Metric Heterogeneous Network Algorithm (MMHNA), which uses LTE and dedicated short-range communications (DSRC) technologies. The objective is to extend the LTE communication range with the support of DSRC technology through a forwarding process. This proposal will allow vehicles to send messages to a server directly connected to the evolved Node B (eNB), i.e., the radio network node for LTE networks, even if the sending vehicle is out of range of the eNB.","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"21 1","pages":""},"PeriodicalIF":0.9,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78095149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：