2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)最新文献

{"title":"Efficient Communications in Wireless Sensor Networks Based on Biological Robustness","authors":"Azade Nazi, M. Raj, M. D. Francesco, P. Ghosh, Sajal K. Das","doi":"10.1109/DCOSS.2016.14","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.14","url":null,"abstract":"Robustness in wireless sensor networks (WSNs) is a critical factor that largely depends on their network topology and on how devices can react to disruptions, including node and link failures. This article presents a novel solution to obtain robust WSNs by exploiting principles of biological robustness at nanoscale. Specifically, we consider Gene Regulatory Networks (GRNs) as a model for the interaction between genes in living organisms. GRNs have evolved over millions of years to provide robustness against adverse factors in cells and their environment. Based on this observation, we apply a method to build robust WSNs, called bio-inspired WSNs, by establishing a correspondence between the topology of GRNs and that of already-deployed WSNs. Through simulation in realistic conditions, we demonstrate that bio-inspired WSNs are more reliable than existing solutions for the design of robust WSNs. We also show that communications in bio-inspired WSNs have lower latency as well as lower energy consumption than the state of the art.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126969636","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}

{"title":"Detecting Signal Injection Attack-Based Morphological Alterations of ECG Measurements","authors":"Hang Cai, K. Venkatasubramanian","doi":"10.1109/DCOSS.2016.36","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.36","url":null,"abstract":"In this paper, we present an approach to detecting signal injection-based morphological alterations of ECG measurements in Body Sensor Networks (BSN). Signal injection attacks target, the usually unprotected, analog sensing interface of the sensors in a BSN and induce arbitrary signals in them. Signal injection is very dangerous because can be stealthily mounted on unsuspecting BSN users from close proximity (for example in a public place). Inducing morphological alterations in ECG measurements can have profound consequences for the user, as an adversary can easily make a person who is experiencing cardiac arrhythmia appear to be normal and thus cause immediate or long-term harm to their health. To detect signal injection-based morphological alterations, we leverage the idea that multiple physiological signals based on the same underlying physiological process (e.g., cardiac process) are inherently related to each other, i.e., have common features. Any adversarial alteration of one of the signals will not be reflected in the other signal(s) in the group. Therefore, to detect the morphological alterations in ECG measurements, we use arterial blood pressure (ABP) measurements. Both ECG and ABP measurements are alternative representation of the cardiac process. Our approach demonstrates promising results with over 90% accuracy in detecting even subtle ECG morphological alterations for both healthy subjects and those with cardiac conditions.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127452762","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}

{"title":"Model Transition Planning in Participatory Sensing Cold Start","authors":"F. Saremi, T. Abdelzaher","doi":"10.1109/DCOSS.2016.23","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.23","url":null,"abstract":"\"Cold Start\" in participatory sensing applications refers to the initial stage in service deployment, during which service adoption remains sparse and, hence, the collected data does not offer adequate coverage. Predictive models, learned from data, offer a way to generalize from sparse observations, but the models themselves need to be statistically reliable to offer a reliable service. To achieve service reliability, this paper offers a modeling approach, where simpler models are used initially, gradually transitioning to more elaborate models, when enough data is collected. A key challenge and contribution of the work is to time model transitions correctly to provide theoretical guarantees on modeling error. Our technique takes a holistic approach in bounding modeling error as opposed to prior statistical approaches that bound the error of a single model component at a time. This technique is tested in the context of a vehicular participatory sensing application.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123198342","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}

{"title":"Web Services for the Internet of Things -- A Feasibility Study","authors":"R. V. Chander","doi":"10.1109/DCOSS.2016.47","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.47","url":null,"abstract":"Applications interoperability for the Internet of Things is one of the major research challenges today. This Ph.D. work proposes a methodology for the adaptation of web services for applications interoperability in the Internet of Things domain. The challenge of using web services in the IoT is analyzed and a solution is proposed in the form of an open, standards based methodology advocating the suitability even for resource constrained environments. The contributions are supported by peer-reviewed publications in international conferences and journals. Further, the applicability and results of the Thesis is evident by an award received, researchers'/developers citations, and expect that public and private contracts and projects consider the proposal.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126412639","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}

{"title":"Influence of Topology-Fluctuations on Self-Stabilizing Algorithms","authors":"Stefan Lohs, Gerry Siegemund, J. Nolte, V. Turau","doi":"10.1109/DCOSS.2016.44","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.44","url":null,"abstract":"Self-stabilizing systems have in theory the unique and provable ability, to always return to a valid system state even in the face of failures. These properties are certainly desirable for domains like wireless ad-hoc networks with numerous unpredictable faults. Unfortunately, the time in which the system returns to a valid state is not predictable and potentially unbound. The failure rate typically depends on physical phenomena and in self-stabilizing systems each node tries to react to failures in an inherently adaptive fashion by the cyclic observation of the states of its neighbors. When state changes are either too quick or too slow the system might never reach a state that is sufficiently stable for a specific task. In this paper, we investigate the influences of the error rate on the (stability) convergence time on the basis of topology information acquired in real network experiments. This allows us to asses the asymptotic behavior of relevant self-stabilizing algorithms in typical wireless networks.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114952761","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}

{"title":"Hardness-Aware Truth Discovery in Social Sensing Applications","authors":"Jermaine Marshall, Munira Syed, Dong Wang","doi":"10.1109/DCOSS.2016.9","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.9","url":null,"abstract":"This paper develops a new principled framework to solve a hardness-aware truth discovery problem in social sensing applications. Social sensing has emerged as a new application paradigm where a large crowd of social sensors (humansor devices on their behalf) are recruited to or voluntarily report observations about the physical environment at scale. These observations may be either true or false, and hence are viewed as binary claims. A fundamental problem in social sensing applications lies in ascertaining the correctness of claims and the reliability of data sources. We refer to this problem as truth discovery. Significant efforts were made to address the truth discovery problem, but an important dimension of the problem has not been fully exploited: hardness of claims (how challenging a claim is to be made). A common assumption made in the previous work is that they assumed all claims areof the same degree of hardness. However, in real world social sensing applications, simply ignoring the hardness differences between claims could easily lead to suboptimal truth discovery results. In this paper, we develop a new hardness-aware truth discovery scheme that explicitly considers different hardness degrees of claims into a rigorous analytical framework. The new truth discovery scheme solves a maximum likelihood estimation problem to determine both the claim correctness and the source reliability. We compare our hardness-aware scheme with the state-of-the-art baselines through three real world case studies(Baltimore Riots, Paris Attack and Oregon Shootings, all in 2015) using Twitter data feeds. The evaluation results showed that our new scheme outperforms all compared baselines and significantly improves the truth discovery accuracy in social sensing applications.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125199455","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}

{"title":"An Optimization Method for Parameters of SVM in Network Intrusion Detection System","authors":"Qiuwei Yang, Hongjuan Fu, Ting Zhu","doi":"10.1109/DCOSS.2016.48","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.48","url":null,"abstract":"Network intrusion detection based on SVM is the hot topic of network security research, and the existing researches have low detection rate, high false positive rate and other issues. Optimizing particle swarm optimization parameters of SVM is an effective solution, but the PSO algorithm is easy to fall into local optimum and results premature convergence.We propose an improved particle swarm optimization algorithm ICPSO, which use chaos operator ergodicity, randomness, sensitivity to initial conditions and other characteristics and the ICPSO is used to make the chaos into the inertia weight factor parameters and The chaos is applied to the optimization of the RBF kernel function parameter g and the penalty factor C, and to improve the convergence speed and precision of the particle swarm optimization. The experimental results show that: relative to the PSO-SVM algorithm and GA-SVM algorithm, ICPSO-SVM improves the efficiency of intrusion detection, and is an effective intrusion detection model.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"1140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121040989","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}

{"title":"Spectral Human Flow Counting with RSSI in Wireless Sensor Networks","authors":"S. Doong","doi":"10.1109/DCOSS.2016.33","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.33","url":null,"abstract":"Human flow counting is a fundamental task in public space management. Counting flow correctly may help prevent overcrowding hazards and improve public safety. This study proposes an automated device-free flow counting system by exploiting radio frequency irregularity in a wireless sensor network. As people pass through the line-of-sight between transmitters and receivers, radio frequency transmission is disturbed and received signal strength indicator (RSSI) fluctuates at the receiving ends. Using RSSI fluctuation series, the system infers flow size without patrons' carrying any special devices. A wireless sensor network with HBE-Zigbex motes (IEEE 802.15.4) is set up to conduct experiments. Besides the mean and standard deviation of RSSI fluctuation series, Fourier spectral features are also employed as predictors of a machine learning algorithm. Experimental results show that spectral features improve the prediction accuracy significantly. The proposed method thus provides an alternative solution for the flow counting problem in addition to other video based solutions.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115554038","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}

{"title":"A Novel Distributed SDN-Secured Architecture for the IoT","authors":"Carlos Gonzalez, O. Flauzac, F. Nolot, A. Jara","doi":"10.1109/DCOSS.2016.22","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.22","url":null,"abstract":"Due to their rapid evolution, mobile devices demand for more dynamic and flexible networking services. A major challenges of future mobile networks is the increased mobile traffic. With the recent upcoming technologies of network programmability like Software-Defined Network (SDN), it may be integrated to create a new communication platform for Internet of Things (IoT). In this work, we present how to determine the effectiveness of an approach to build a new secured network architecture based on SDN and clusters. Our proposed scheme is a starting point for some experiments providing perspective over SDN deployment in a cluster environment. With this aim in mind, we suggest a routing protocol that manages routing tasks over Cluster-SDN. By using network virtualization and OpenFlow technologies to generate virtual nodes, we simulate a prototype system controlled by SDN. With our testbed, we are able to manage 500 things. We can analyze every OpenFlow messages and we have discovered that with a particular flow, the things can exchange information unlike the routing principle.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115750891","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}

{"title":"Greedy Routing on Virtual Raw Anchor Coordinate (VRAC) System","authors":"Pierre Leone, Kasun Samarasinghe","doi":"10.1109/DCOSS.2016.21","DOIUrl":"https://doi.org/10.1109/DCOSS.2016.21","url":null,"abstract":"Geographic routing is an appealing routing strategy that uses the location information of the nodes to route the data. This technique uses only local information of the communication graph topology and does not require computational effort to build routing table or equivalent data structures. A particularly efficient implementation of this paradigm is greedy routing, where along the data path the nodes forward the data to a neighboring node that is closer to the destination. The decreasing distance to the destination implies the success of the routing scheme. A related problem is to consider an abstract graph and decide whether there exists an embedding of the graph in a metric space, called a greedy embedding, such that greedy routing guarantees the delivery of the data. A common approach to assign geographic coordinates is to measure distances (for instance the distances between neighboring nodes) and compute(virtual) coordinates. The rationale of the Virtual raw Anchor Coordinate System(VRAC) is to use the (raw) measured distances as coordinates in order to avoid further computations. More precisely, each node needs to measure three distances. In this paper, we investigate the existence of greedy routing in the VRAC coordinate system using a metric free characterization of greedy paths that is more general than in previous works. We show that if the graph is saturated (see definition in the text) then the greedy algorithm guarantees delivery. Interestingly, the approach of greediness here applies to Schnyder drawings of planar triangulations. Indeed, by choosing the measured distances appropriately Schnyder drawings of planar triangulations are always saturated and hence our greedy routing algorithm succeeds. The VRAC coordinates have conditions to satisfy to make greedy routing successful. These conditions can be inferred from geometric considerations. However, we formulate these conditions in an abstract way in order to avoid geometric considerations and in order to make possible further derivation of virtual VRAC coordinate systems, i.e. using only the abstract graph description. In particular using only local information would lead to distributed algorithm.","PeriodicalId":217448,"journal":{"name":"2016 International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123779643","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}