Masood Mansoori, I. Welch, Kim-Kwang Raymond Choo, R. Maxion
Hazard and Operability studies have been extensively used in chemical engineering and designing safety critical systems. Its rigorous analysis based on discovering deviations and hazard makes it ideal in the study of designs and experiments with confounding variables. In this paper, HAZOP methodology is applied to a case study of network security experiment to reliably measure the IP tracking behavior of malicious websites using a low interaction client honeypot. The experiment's design involves a large number of factors and components which could potentially introduce bias in the study and result in invalid analysis. We demonstrate that HAZOP can be applied to security experiments to create a proper experimental design and properly control potential bias of confounding variables.
{"title":"Application of HAZOP to the Design of Cyber Security Experiments","authors":"Masood Mansoori, I. Welch, Kim-Kwang Raymond Choo, R. Maxion","doi":"10.1109/AINA.2016.115","DOIUrl":"https://doi.org/10.1109/AINA.2016.115","url":null,"abstract":"Hazard and Operability studies have been extensively used in chemical engineering and designing safety critical systems. Its rigorous analysis based on discovering deviations and hazard makes it ideal in the study of designs and experiments with confounding variables. In this paper, HAZOP methodology is applied to a case study of network security experiment to reliably measure the IP tracking behavior of malicious websites using a low interaction client honeypot. The experiment's design involves a large number of factors and components which could potentially introduce bias in the study and result in invalid analysis. We demonstrate that HAZOP can be applied to security experiments to create a proper experimental design and properly control potential bias of confounding variables.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121755278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wearable watches provide very useful linear acceleration information that can be use to detect falls. Howeverfalls not from a standing position are difficult to spot amongother normal activities. This paper describes methods, basedon pattern recognition using machine learning, to improve thedetection of "soft falls". The values of the linear accelerometersare combined in a robust vector that will be presented as inputto the algorithms. The performance of these different machinelearning algorithms is discussed and then, based on the bestscoring method, the size of the time window fed to the systemis studied. The best experiments lead to results showing morethan 0.9 AUC on a real dataset. In a second part, a prototypeimplementation on an Android platform using the best resultsobtained during the experiments is described.
{"title":"Soft Fall Detection Using Machine Learning in Wearable Devices","authors":"D. Genoud, Vincent Cuendet, Julien Torrent","doi":"10.1109/AINA.2016.124","DOIUrl":"https://doi.org/10.1109/AINA.2016.124","url":null,"abstract":"Wearable watches provide very useful linear acceleration information that can be use to detect falls. Howeverfalls not from a standing position are difficult to spot amongother normal activities. This paper describes methods, basedon pattern recognition using machine learning, to improve thedetection of \"soft falls\". The values of the linear accelerometersare combined in a robust vector that will be presented as inputto the algorithms. The performance of these different machinelearning algorithms is discussed and then, based on the bestscoring method, the size of the time window fed to the systemis studied. The best experiments lead to results showing morethan 0.9 AUC on a real dataset. In a second part, a prototypeimplementation on an Android platform using the best resultsobtained during the experiments is described.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"61 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129534399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Android applications need to access and share user's sensitive data. To maintain user's privacy and related data security, it is essential to protect this data. Android security framework enforces permission protected model but it has been shown that applications can bypass this security model. Attacks based on such unauthorized privileges are known as Inter-Component Communication (ICC) Collusion Attacks. In this paper, we propose, a novel automaton framework that allows effective detection of intent based collusion. Our detection framework operates at the component-level. To evaluate our proposal, we developed 14 applications and took 4 applications from Google Play Store. We took all possible combinations from the set of 21 applications. We tested our approach on 210 pairs of applications derived from the set of 21 applications. Time and space complexity of our proposed approach is O(n) where n is the number of components in all the applications under analysis. The experimental results demonstrate that our technique is scalable to application sizing and more efficient as compared to other state of the art approaches.
Android应用程序需要访问和共享用户的敏感数据。为了维护用户的隐私和相关数据的安全，必须保护这些数据。Android安全框架执行权限保护模型，但已经证明，应用程序可以绕过这个安全模型。基于这种未经授权的特权的攻击被称为组件间通信(ICC)合谋攻击。在本文中，我们提出了一种新的自动机框架，可以有效地检测基于意图的合谋。我们的检测框架在组件级运行。为了评估我们的提案，我们开发了14个应用程序，并从Google Play Store中选择了4个应用程序。我们从21个应用程序中选取所有可能的组合。我们在来自21个应用程序集的210对应用程序上测试了我们的方法。我们提出的方法的时间和空间复杂性是O(n)，其中n是在分析的所有应用程序中的组件数量。实验结果表明，与其他最先进的方法相比，我们的技术可扩展到应用程序的大小，并且效率更高。
{"title":"Intersection Automata Based Model for Android Application Collusion","authors":"S. Bhandari, V. Laxmi, A. Zemmari, M. Gaur","doi":"10.1109/AINA.2016.92","DOIUrl":"https://doi.org/10.1109/AINA.2016.92","url":null,"abstract":"Android applications need to access and share user's sensitive data. To maintain user's privacy and related data security, it is essential to protect this data. Android security framework enforces permission protected model but it has been shown that applications can bypass this security model. Attacks based on such unauthorized privileges are known as Inter-Component Communication (ICC) Collusion Attacks. In this paper, we propose, a novel automaton framework that allows effective detection of intent based collusion. Our detection framework operates at the component-level. To evaluate our proposal, we developed 14 applications and took 4 applications from Google Play Store. We took all possible combinations from the set of 21 applications. We tested our approach on 210 pairs of applications derived from the set of 21 applications. Time and space complexity of our proposed approach is O(n) where n is the number of components in all the applications under analysis. The experimental results demonstrate that our technique is scalable to application sizing and more efficient as compared to other state of the art approaches.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123124871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An aggregate signature scheme is a primitive whereby each signer signs an individual document and combines them to compress data size. We propose an aggregate signature scheme which is an extension in two standpoints of structured signatures and ID-based signatures, i.e., we construct an identity-based structured aggregate signature scheme. The proposed scheme is expected to be used with consumer-generated media services. We prove the security of the proposed scheme with tight reduction under the computational Diffie-Hellman (CDH) assumption in the random oracle model. Tight reduction means that the cost of a reduction algorithm is independent of an adversary's capability, i.e., security is not downgraded by the adversary's capability. To the best of our knowledge, no structured signature scheme with tight reduction has been proposed to date because it contains complicated structures that make the reduction inefficient. Note that the security of our scheme captures the switching attack (CCS 2007, Boldyreva et al.) and the re-ordering attack (ISPEC 2007, Shao), which break several famous schemes.
{"title":"Tightly-Secure Identity-Based Structured Aggregate Signature Scheme under the Computational Diffie-Hellman Assumption","authors":"Tomoya Iwasaki, Naoto Yanai, Masaki Inamura, Keiichi Iwamura","doi":"10.1109/AINA.2016.99","DOIUrl":"https://doi.org/10.1109/AINA.2016.99","url":null,"abstract":"An aggregate signature scheme is a primitive whereby each signer signs an individual document and combines them to compress data size. We propose an aggregate signature scheme which is an extension in two standpoints of structured signatures and ID-based signatures, i.e., we construct an identity-based structured aggregate signature scheme. The proposed scheme is expected to be used with consumer-generated media services. We prove the security of the proposed scheme with tight reduction under the computational Diffie-Hellman (CDH) assumption in the random oracle model. Tight reduction means that the cost of a reduction algorithm is independent of an adversary's capability, i.e., security is not downgraded by the adversary's capability. To the best of our knowledge, no structured signature scheme with tight reduction has been proposed to date because it contains complicated structures that make the reduction inefficient. Note that the security of our scheme captures the switching attack (CCS 2007, Boldyreva et al.) and the re-ordering attack (ISPEC 2007, Shao), which break several famous schemes.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117048473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Amina Jarraya, Khedija Arour, A. Borgi, A. Bouzeghoub
Cooperation plays an important role in distributed reasoning systems in Ambient Environment. In such systems, ambient entities with diverse perception and capabilities have to cooperate during the reasoning process by sharing parts of their local knowledge to achieve a set of common goals. Nevertheless, previous work in distributed reasoning assumed that ambient entities keep their local knowledge private and reason in a top-down manner to reach these goals. Such approaches do not fit with the features of Ambient environment. This paper presents a more tailored distributed peer-to-peer approach for modeling and reasoning with context information using cooperation in Ambient Environment. Ambient entities cooperate by sharing parts of their local context information and reason in a bottom-up manner. We propose an operational model and present a prototype implementation for the proposed approach.
{"title":"Distributed Cooperative Reasoning in Ambient Environment","authors":"Amina Jarraya, Khedija Arour, A. Borgi, A. Bouzeghoub","doi":"10.1109/AINA.2016.52","DOIUrl":"https://doi.org/10.1109/AINA.2016.52","url":null,"abstract":"Cooperation plays an important role in distributed reasoning systems in Ambient Environment. In such systems, ambient entities with diverse perception and capabilities have to cooperate during the reasoning process by sharing parts of their local knowledge to achieve a set of common goals. Nevertheless, previous work in distributed reasoning assumed that ambient entities keep their local knowledge private and reason in a top-down manner to reach these goals. Such approaches do not fit with the features of Ambient environment. This paper presents a more tailored distributed peer-to-peer approach for modeling and reasoning with context information using cooperation in Ambient Environment. Ambient entities cooperate by sharing parts of their local context information and reason in a bottom-up manner. We propose an operational model and present a prototype implementation for the proposed approach.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127499129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Software Defined Networking (SDN) architecture promises to mitigate limitations of traditional networking architectures in order to satisfy today's complex networking needs. However, as all new networking architectures, SDN also presents several inevitable technical challenges to be addressed by researchers. Control plane scalability is one of the crucial issues deserving more attention from both academia and industry in SDN as well. There are many existing solutions proposing a way to alleviate the control plane scalability in SDN. However, one prominent common ground they share is that they measure the control plane scalability performance in terms of typical network QoS parameters such as throughput and latency. Although these metrics may be a good performance indicators for quality of service measurement in mid-term and long-term, they may not reflect real scalability performance of control planes in SDN environments. However, a metric for scalability of control plane in SDN can provide network administrators some insights while they construct their SDN networks. In this paper, we firstly explore the roots of control plane scalability problem in SDN as well as proposed existing solutions. We then propose a metric in order to evaluate the control plane scalability in SDN. We give mathematical models of the proposed metric over different control plane designs. Further, we compare the performance of these control plane designs by extensive experiments.
{"title":"A Scalability Metric for Control Planes in Software Defined Networks (SDNs)","authors":"Murat Karakus, A. Durresi","doi":"10.1109/AINA.2016.112","DOIUrl":"https://doi.org/10.1109/AINA.2016.112","url":null,"abstract":"Software Defined Networking (SDN) architecture promises to mitigate limitations of traditional networking architectures in order to satisfy today's complex networking needs. However, as all new networking architectures, SDN also presents several inevitable technical challenges to be addressed by researchers. Control plane scalability is one of the crucial issues deserving more attention from both academia and industry in SDN as well. There are many existing solutions proposing a way to alleviate the control plane scalability in SDN. However, one prominent common ground they share is that they measure the control plane scalability performance in terms of typical network QoS parameters such as throughput and latency. Although these metrics may be a good performance indicators for quality of service measurement in mid-term and long-term, they may not reflect real scalability performance of control planes in SDN environments. However, a metric for scalability of control plane in SDN can provide network administrators some insights while they construct their SDN networks. In this paper, we firstly explore the roots of control plane scalability problem in SDN as well as proposed existing solutions. We then propose a metric in order to evaluate the control plane scalability in SDN. We give mathematical models of the proposed metric over different control plane designs. Further, we compare the performance of these control plane designs by extensive experiments.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122875858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hussein Hazimeh, Iman Youness, J. Makki, Hassan Noureddine, J. Tscherrig, E. Mugellini, Omar Abou Khaled
Many authors can share the same name and this constitutes a serious problem that affects the relevancy of retrieval results and constitutes our motivation of finding such approach to cover this issue at the author names entity level. Solving such a problem may return with positive gain at the level of document retrieval, web search and the quality of data. This entity resolution task can be tackled as an unsupervised problem, where there are set of features that can be employed for the resolution job, or as supervised problem to compute the similarities among two citations and then classify if they are the same or not. Recent approaches usually utilize features such as: co-author, venue, topic similarity, affiliations and title of publications to deal with author ambiguity. In this paper, three attributes are used to treat this problem sequentially. The co-authorship firstly which is a well-known attribute, and then the topic and affiliation extracted from biographies, which can be found inside the publication, and this is our novelty frame in this paper.
{"title":"Leveraging Co-authorship and Biographical Information for Author Ambiguity Resolution in DBLP","authors":"Hussein Hazimeh, Iman Youness, J. Makki, Hassan Noureddine, J. Tscherrig, E. Mugellini, Omar Abou Khaled","doi":"10.1109/AINA.2016.61","DOIUrl":"https://doi.org/10.1109/AINA.2016.61","url":null,"abstract":"Many authors can share the same name and this constitutes a serious problem that affects the relevancy of retrieval results and constitutes our motivation of finding such approach to cover this issue at the author names entity level. Solving such a problem may return with positive gain at the level of document retrieval, web search and the quality of data. This entity resolution task can be tackled as an unsupervised problem, where there are set of features that can be employed for the resolution job, or as supervised problem to compute the similarities among two citations and then classify if they are the same or not. Recent approaches usually utilize features such as: co-author, venue, topic similarity, affiliations and title of publications to deal with author ambiguity. In this paper, three attributes are used to treat this problem sequentially. The co-authorship firstly which is a well-known attribute, and then the topic and affiliation extracted from biographies, which can be found inside the publication, and this is our novelty frame in this paper.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124199411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In latest years, there is a corresponding growth for cloud computing services, especially for those that can be offered as modular components in order to construct Future Internet (FI) applications. In addition, the emergence of inter-clouds as the mean to achieve utilization of various services available from different providers highlights new research directions. Following the business benefits of the cloud services into more advanced and modular systems the requirements for effective accounting and billing with regards to the service usage and the accurate billing of consumers of services becomes challenging. This work focuses on cloud platforms, their platform segregations and services, and presents an accounting and billing service that can be used to rate, charge and bill consumers of within a cloud or an inter-cloud platforms. The solution is developed based on FIWARE platform, which promotes the usage of Cloud Computing in Europe by designing general purpose cloud services namely as Generic Enablers (GEs). Here we design and implement an Accounting and Billing GE that is built upon OpenStack platforms and hosted as an easily to deploy and use cloud service.
{"title":"An Openstack Based Accounting and Billing Service for Future Internet Applications","authors":"O. Omosebi, Stelios Sotiriadis, N. Bessis","doi":"10.1109/AINA.2016.66","DOIUrl":"https://doi.org/10.1109/AINA.2016.66","url":null,"abstract":"In latest years, there is a corresponding growth for cloud computing services, especially for those that can be offered as modular components in order to construct Future Internet (FI) applications. In addition, the emergence of inter-clouds as the mean to achieve utilization of various services available from different providers highlights new research directions. Following the business benefits of the cloud services into more advanced and modular systems the requirements for effective accounting and billing with regards to the service usage and the accurate billing of consumers of services becomes challenging. This work focuses on cloud platforms, their platform segregations and services, and presents an accounting and billing service that can be used to rate, charge and bill consumers of within a cloud or an inter-cloud platforms. The solution is developed based on FIWARE platform, which promotes the usage of Cloud Computing in Europe by designing general purpose cloud services namely as Generic Enablers (GEs). Here we design and implement an Accounting and Billing GE that is built upon OpenStack platforms and hosted as an easily to deploy and use cloud service.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124310801","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Admir Barolli, Tetsuya Oda, L. Barolli, M. Takizawa
The Content Centric Networks (CCN) replaces the IP narrow waist of the Internet architecture by a content layer. When a node wants to access a piece of content, it sends an Interest packet to the network. The network then, using the name of the content for routing, forwards the Interest to one or more copies of the content object. In this paper, we present the implementation of a OpenWRT OS based testbed for CCN. We analyze the performance of Optimized Link State Routing (OLSR) protocol in an indoor scenario. We transmitted single ICMP flow over UDP. For evaluation we considered hop count, delay and jitter metrics. The experimental results show that the nodes in the testbed were communicating smoothly and we got low values of delay and jitter.
{"title":"Experimental Results of a Raspberry Pi and OLSR Based Wireless Content Centric Network Testbed Considering OpenWRT OS","authors":"Admir Barolli, Tetsuya Oda, L. Barolli, M. Takizawa","doi":"10.1109/AINA.2016.153","DOIUrl":"https://doi.org/10.1109/AINA.2016.153","url":null,"abstract":"The Content Centric Networks (CCN) replaces the IP narrow waist of the Internet architecture by a content layer. When a node wants to access a piece of content, it sends an Interest packet to the network. The network then, using the name of the content for routing, forwards the Interest to one or more copies of the content object. In this paper, we present the implementation of a OpenWRT OS based testbed for CCN. We analyze the performance of Optimized Link State Routing (OLSR) protocol in an indoor scenario. We transmitted single ICMP flow over UDP. For evaluation we considered hop count, delay and jitter metrics. The experimental results show that the nodes in the testbed were communicating smoothly and we got low values of delay and jitter.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115131400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless Sensor Networks (WSNs), which are connected by sensor nodes with wireless communication techniques, are used to collect, process, and transmit the various types of environmental data, such as temperature, fire and smoke detectors, CO gas, humidity, pressure, and video-based data. The network lifetime is limited due to sensors are equipped with batteries. The measurement uncertainties and detection faults lead higher power consumption by retransmissions due to event detection error. These two factors influence with each other. In this study, there are two indicators are introduced for detection errors, false positive (FP) and false negative (FN) to evaluate a detection-based sensor network. For operation perspectives, three models are addressed to near-optimize the network lifetime and detection errors. Linear-and non-linear mathematical planning problems are formulated as (1) to minimize event FP rate subject to FN constraints, (2) to minimize the network energy consumption subject to detection accuracy requirements, turning sensor ON/OFF decisions, the required number of voting nodes, and given FP/FN constraints, and (3) to extend from the previous model as a planning problem for various types of sensor nodes deployed with diverse FP/FN characteristics and costs. An integer programming (IP) tool, LINGO, is adopted to solve the problems with computational experiments on several situations. The experimental results show that the objectives can be achieved, lots of useful hints or configurations can be applied for system implementations to improve system performance efficiently and effectively.
{"title":"A Precision Operation Optimization for Detection-Based Sensor Networks","authors":"F. Lin, Chiu-Han Hsiao, Y. Wen","doi":"10.1109/AINA.2016.30","DOIUrl":"https://doi.org/10.1109/AINA.2016.30","url":null,"abstract":"Wireless Sensor Networks (WSNs), which are connected by sensor nodes with wireless communication techniques, are used to collect, process, and transmit the various types of environmental data, such as temperature, fire and smoke detectors, CO gas, humidity, pressure, and video-based data. The network lifetime is limited due to sensors are equipped with batteries. The measurement uncertainties and detection faults lead higher power consumption by retransmissions due to event detection error. These two factors influence with each other. In this study, there are two indicators are introduced for detection errors, false positive (FP) and false negative (FN) to evaluate a detection-based sensor network. For operation perspectives, three models are addressed to near-optimize the network lifetime and detection errors. Linear-and non-linear mathematical planning problems are formulated as (1) to minimize event FP rate subject to FN constraints, (2) to minimize the network energy consumption subject to detection accuracy requirements, turning sensor ON/OFF decisions, the required number of voting nodes, and given FP/FN constraints, and (3) to extend from the previous model as a planning problem for various types of sensor nodes deployed with diverse FP/FN characteristics and costs. An integer programming (IP) tool, LINGO, is adopted to solve the problems with computational experiments on several situations. The experimental results show that the objectives can be achieved, lots of useful hints or configurations can be applied for system implementations to improve system performance efficiently and effectively.","PeriodicalId":438655,"journal":{"name":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129666830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：