Hessam Mohammadmoradi, Sirajum Munir, O. Gnawali, Charles Shelton
People counting has many applications in smart buildings. For example, adjusting HVAC systems based on the number of occupants in each room can save a significant amount of energy. In addition, security and safety of the building can be managed by determining the number and location of occupants. Different technologies and sensing platforms have proposed for accurate and efficient people counting. However, these solutions are expensive, hard to deploy, or privacy invasive. We investigate the possibility of placing an 8×8 IR array sensor at the doorways and counting the number of people inside rooms. Our solution is real-time, inexpensive, privacy preserving with much less deployment constraints compared to its competitors. The proposed solution deals with realistic and dynamic changes in the sensing environment by leveraging a combination of Otsus thresholding and modeling thermal noise distribution. We evaluated our solution via several controlled and uncontrolled real-world environments. The results show an average of 93% accuracy in estimating the number of occupants in rooms.
{"title":"Measuring People-Flow through Doorways Using Easy-to-Install IR Array Sensors","authors":"Hessam Mohammadmoradi, Sirajum Munir, O. Gnawali, Charles Shelton","doi":"10.1109/DCOSS.2017.26","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.26","url":null,"abstract":"People counting has many applications in smart buildings. For example, adjusting HVAC systems based on the number of occupants in each room can save a significant amount of energy. In addition, security and safety of the building can be managed by determining the number and location of occupants. Different technologies and sensing platforms have proposed for accurate and efficient people counting. However, these solutions are expensive, hard to deploy, or privacy invasive. We investigate the possibility of placing an 8×8 IR array sensor at the doorways and counting the number of people inside rooms. Our solution is real-time, inexpensive, privacy preserving with much less deployment constraints compared to its competitors. The proposed solution deals with realistic and dynamic changes in the sensing environment by leveraging a combination of Otsus thresholding and modeling thermal noise distribution. We evaluated our solution via several controlled and uncontrolled real-world environments. The results show an average of 93% accuracy in estimating the number of occupants in rooms.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121741852","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}
Passive radio-frequency (RF) energy harvesting collects the radiated energy from adjacent wireless information transmitters instead of using a dedicated wireless power source. In this paper, we investigate the scenario where a wireless transmitter communicates with its information receiver while intentionally focusing the radiated power to the RF energy harvesters. The wireless transceivers are equipped with multiple antennas, and each of the energy harvesters has one receive antenna. With an appropriate design of the transmit covariance matrix, the wireless transmitter transfers sufficient energy to the energy harvesters with a guarantee on the information rate to the communication receiver. When multiple RF energy harvesters are present, we address the trade-off between net energy harvesting rate and fairness with the dynamic of the energy harvesting network. Simulation results compare the algorithms and evaluate the performance of passive RF energy harvesting.
{"title":"Passive Radio-Frequency Energy Harvesting through Wireless Information Transmission","authors":"Yuan Xing, Liang Dong","doi":"10.1109/DCOSS.2017.33","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.33","url":null,"abstract":"Passive radio-frequency (RF) energy harvesting collects the radiated energy from adjacent wireless information transmitters instead of using a dedicated wireless power source. In this paper, we investigate the scenario where a wireless transmitter communicates with its information receiver while intentionally focusing the radiated power to the RF energy harvesters. The wireless transceivers are equipped with multiple antennas, and each of the energy harvesters has one receive antenna. With an appropriate design of the transmit covariance matrix, the wireless transmitter transfers sufficient energy to the energy harvesters with a guarantee on the information rate to the communication receiver. When multiple RF energy harvesters are present, we address the trade-off between net energy harvesting rate and fairness with the dynamic of the energy harvesting network. Simulation results compare the algorithms and evaluate the performance of passive RF energy harvesting.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132424941","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}
This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments.
{"title":"Distributed Collision-Free Data Aggregation Approach for Wireless Sensor Networks","authors":"M. Merzoug, A. Mostefaoui, Samir Chouali","doi":"10.1109/DCOSS.2017.9","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.9","url":null,"abstract":"This paper presents a distributed serial data aggregation approach, called Spreading Aggregation~(SA), in which one packet hops sequentially over nodes and aggregates their data. The next hop of the aggregation packet is determined locally by each traversed node using only its one-hop neighborhood information, so no network topology information needs to be known by nodes, nor collisions are generated as only one node is communicating at any given time. This localized and distributed characteristic makes the proposed approach highly scalable and very efficient in terms of communication-reduction, energy conservation, and aggregation time, as confirmed by the numerous simulation results we obtained. These results confirm also the superiority of the proposed approach over the state-of-the-art serial approaches, particularly in very large scale network deployments.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125898660","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}
We show that a multihop wireless network can achieve better bandwidth and routing stability when transmission power and routing topology are jointly and adaptively controlled. Our experiments show that the predominant 'fixed and uniform' transmission power strategy with 'link quality and hop distance'-based routing topology construction loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, PCRPL, within the standard RPL routing protocol. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses ~7-fold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% for the worst-case node.
{"title":"Do Not Lose Bandwidth: Adaptive Transmission Power and Multihop Topology Control","authors":"Hyung-Sin Kim, Jeongyeup Paek, D. Culler, S. Bahk","doi":"10.1109/DCOSS.2017.23","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.23","url":null,"abstract":"We show that a multihop wireless network can achieve better bandwidth and routing stability when transmission power and routing topology are jointly and adaptively controlled. Our experiments show that the predominant 'fixed and uniform' transmission power strategy with 'link quality and hop distance'-based routing topology construction loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, PCRPL, within the standard RPL routing protocol. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses ~7-fold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% for the worst-case node.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126750201","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}
With a modest adoption of biometrics for security controls, privacy remains a great concern for many individuals as biometric features, once compromised, cannot be renewed and will render protected resources vulnerable to a number of attacks by a threat agent. Several biometric encryption mechanisms have been proposed to preserve privacy, however there has been very little industry usage and implementation. In this paper, a practical biometric encryption technique is presented. The proposed approach is used to provide the desired level of privacy for stored biometric templates through anonymization. This scheme also addresses the limitation of renewability as biometric templates are fused with a biometric key, which may be renewed in the event of compromise of the biometric key. A prototype of the proposed scheme indicates that it could be a viable replacement for traditional biometric security controls with an increased confidence in the preservation of the end-user's privacy.
{"title":"A Privacy Enhanced Facial Recognition Access Control System Using Biometric Encryption","authors":"Orane Cole, K. El-Khatib","doi":"10.1109/DCOSS.2017.19","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.19","url":null,"abstract":"With a modest adoption of biometrics for security controls, privacy remains a great concern for many individuals as biometric features, once compromised, cannot be renewed and will render protected resources vulnerable to a number of attacks by a threat agent. Several biometric encryption mechanisms have been proposed to preserve privacy, however there has been very little industry usage and implementation. In this paper, a practical biometric encryption technique is presented. The proposed approach is used to provide the desired level of privacy for stored biometric templates through anonymization. This scheme also addresses the limitation of renewability as biometric templates are fused with a biometric key, which may be renewed in the event of compromise of the biometric key. A prototype of the proposed scheme indicates that it could be a viable replacement for traditional biometric security controls with an increased confidence in the preservation of the end-user's privacy.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121640800","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}
Achieving fast and efficient many-to-many communication is one of the most complex communication problems, especially in wireless systems. A compact form of many-to-many communication in a distributed system has the potential to bring huge benefit to many distributed algorithms and protocols. Many-to-many communication can be implemented as a sequential instantiations of a network wide one-to-many communication. One limitation of such an approach is that each individual instance of a one-to-many communication has to be given enough time to propagate through the whole network before the next instance. In addition, there is large overhead in generating the schedule for the sequence of individual one-to-many communications. In this work, we show that many-to-many communication can be more efficiently implemented as many parallel many-to-one communications. In this direction, we first develop an efficient TDMA based many-to-one communication module, and then use it in many-to-many setting. Our approach achieves a minimum about 20% to 50% improvements on latency (radio-on time) over the state-of-the-art solutions in a 90-node wireless sensor network testbed.
{"title":"Efficient Many-to-Many Data Sharing Using Synchronous Transmission and TDMA","authors":"Sudipta Saha, O. Landsiedel, M. Chan","doi":"10.1109/DCOSS.2017.11","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.11","url":null,"abstract":"Achieving fast and efficient many-to-many communication is one of the most complex communication problems, especially in wireless systems. A compact form of many-to-many communication in a distributed system has the potential to bring huge benefit to many distributed algorithms and protocols. Many-to-many communication can be implemented as a sequential instantiations of a network wide one-to-many communication. One limitation of such an approach is that each individual instance of a one-to-many communication has to be given enough time to propagate through the whole network before the next instance. In addition, there is large overhead in generating the schedule for the sequence of individual one-to-many communications. In this work, we show that many-to-many communication can be more efficiently implemented as many parallel many-to-one communications. In this direction, we first develop an efficient TDMA based many-to-one communication module, and then use it in many-to-many setting. Our approach achieves a minimum about 20% to 50% improvements on latency (radio-on time) over the state-of-the-art solutions in a 90-node wireless sensor network testbed.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127597023","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}
A wireless sensor network (WSN) is usually deployed in a field of interest (FoI) for detecting or monitoring some special events and then forwarding the aggregated data to the designated data center through sink nodes or gateways. Traditionally, the WSN requires the intensive deployment in which the extra sensor nodes are deployed to achieve the required coverage level. Fortunately, depending on the developments of the unmanned aerial vehicle (UAV) techniques, the UAV has been widely adopted in both military and civilian applications. Comparing with the traditional mobile sensor nodes, the UAV has much faster moving speed, longer deployment range and relatively longer serving time. Consequently, the UAV can be considered as a perfect carrier for the existing sensing equipment and used to form a UAV-based WSN (UWSN). In this paper, we theoretically analyse the coverage problem in the UWSN. Based on the integral geometry, we solve the aforementioned question. The experimental results further verifies our theoretical results.
{"title":"Theoretical Analysis of the Area Coverage in a UAV-based Wireless Sensor Network","authors":"Peng Sun, A. Boukerche, Yanjie Tao","doi":"10.1109/DCOSS.2017.18","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.18","url":null,"abstract":"A wireless sensor network (WSN) is usually deployed in a field of interest (FoI) for detecting or monitoring some special events and then forwarding the aggregated data to the designated data center through sink nodes or gateways. Traditionally, the WSN requires the intensive deployment in which the extra sensor nodes are deployed to achieve the required coverage level. Fortunately, depending on the developments of the unmanned aerial vehicle (UAV) techniques, the UAV has been widely adopted in both military and civilian applications. Comparing with the traditional mobile sensor nodes, the UAV has much faster moving speed, longer deployment range and relatively longer serving time. Consequently, the UAV can be considered as a perfect carrier for the existing sensing equipment and used to form a UAV-based WSN (UWSN). In this paper, we theoretically analyse the coverage problem in the UWSN. Based on the integral geometry, we solve the aforementioned question. The experimental results further verifies our theoretical results.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115699111","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}
A. Brokalakis, N. Tampouratzis, A. Nikitakis, Stamatis Andrianakis, I. Papaefstathiou, A. Dollas
In this paper, we present an open-source Cyber Physical Systems (CPS) simulation framework that aims to address the limitations of currently available tools. Our solution models the computing devices of the processing nodes and the network that comprise the CPS system and thus provides cycle accurate results, realistic communications and power/energy consumption estimates based on the actual dynamic usage scenarios. The simulator provides the necessary hooks to security testing software and can be extended through an IEEE standardized interface to include additional tools, such as simulators of physical models.
{"title":"An Open-Source Extendable, Highly-Accurate and Security Aware CPS Simulator","authors":"A. Brokalakis, N. Tampouratzis, A. Nikitakis, Stamatis Andrianakis, I. Papaefstathiou, A. Dollas","doi":"10.1109/DCOSS.2017.15","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.15","url":null,"abstract":"In this paper, we present an open-source Cyber Physical Systems (CPS) simulation framework that aims to address the limitations of currently available tools. Our solution models the computing devices of the processing nodes and the network that comprise the CPS system and thus provides cycle accurate results, realistic communications and power/energy consumption estimates based on the actual dynamic usage scenarios. The simulator provides the necessary hooks to security testing software and can be extended through an IEEE standardized interface to include additional tools, such as simulators of physical models.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121326401","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}
Internet of Things (IoT) systems are inherently built on data gathered from heterogeneous sources. In the quest to gather more data for better analytics, many IoT systems are instigating significant challenges. First, the sheer volume and velocity of data generated by IoT systems are burdening our networking infrastructure, especially at the edge. The mobility and intermittent connectivity of edge IoT nodes are further hampering real-time access and reporting of IoT data. As we attempt to synergize IoT systems to leverage resource discovery and remedy some of these challenges, the rising challenges of Quality of Information (QoI) and Quality of Resource (QoR) calibration, render many IoT interoperability attempts far-fetched. We survey a number of challenges in realizing IoT interoperability, and advocate for a uniform view of data management in IoT systems. We delve into three planes that encompass Big Sensed Data (BSD) research directions, presenting a building block for future research efforts in IoT data management.
{"title":"Big Sensed Data Challenges in the Internet of Things","authors":"H. Hassanein, Sharief M. A. Oteafy","doi":"10.1109/DCOSS.2017.35","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.35","url":null,"abstract":"Internet of Things (IoT) systems are inherently built on data gathered from heterogeneous sources. In the quest to gather more data for better analytics, many IoT systems are instigating significant challenges. First, the sheer volume and velocity of data generated by IoT systems are burdening our networking infrastructure, especially at the edge. The mobility and intermittent connectivity of edge IoT nodes are further hampering real-time access and reporting of IoT data. As we attempt to synergize IoT systems to leverage resource discovery and remedy some of these challenges, the rising challenges of Quality of Information (QoI) and Quality of Resource (QoR) calibration, render many IoT interoperability attempts far-fetched. We survey a number of challenges in realizing IoT interoperability, and advocate for a uniform view of data management in IoT systems. We delve into three planes that encompass Big Sensed Data (BSD) research directions, presenting a building block for future research efforts in IoT data management.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"26 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132286007","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}
We investigate the problem of efficient computation of a partition of a Random Geometric Graph (RGG) into a limited number of densely packed bipartite grid subgraphs. The study focuses on the collection of subgraphs each individually having similar size and structure and the union employing most (e.g. over 85%) of the vertices. The residual vertices we seek to minimize are attributed to the inherent variations in densities of the randomly placed vertices and to any shortcomings of our greedy algorithms. RGG's have been extensively employed in recent times to model the deployment of numerous instances of Wireless Sensor Networks (WSN's). The properties investigated in our selected bipartite grid backbones are those deemed most relevant for applications to the foundations of this widely growing field. Distributed algorithms are primarily used to determine backbones. Our results review what backbone grid partitions exist in the data. This provides a metric to measure the effectiveness of any distributed algorithm against an existing optimal result. The visual display of selected backbone grids suggests local algorithm design strategies. Furthermore, these partitions must be efficiently computable for highly scalable computation, e.g. WSN's with 100's of thousands of vertices and millions of edges in the resulting RGG. We consider distributions over a segment of the plane and over the surface of the sphere to model sensor distributions both in limited planar regions, all around the globe or on distant planets.
{"title":"Bipartite Grid Partitioning of a Random Geometric Graph","authors":"Zizhen Chen, D. Matula","doi":"10.1109/DCOSS.2017.31","DOIUrl":"https://doi.org/10.1109/DCOSS.2017.31","url":null,"abstract":"We investigate the problem of efficient computation of a partition of a Random Geometric Graph (RGG) into a limited number of densely packed bipartite grid subgraphs. The study focuses on the collection of subgraphs each individually having similar size and structure and the union employing most (e.g. over 85%) of the vertices. The residual vertices we seek to minimize are attributed to the inherent variations in densities of the randomly placed vertices and to any shortcomings of our greedy algorithms. RGG's have been extensively employed in recent times to model the deployment of numerous instances of Wireless Sensor Networks (WSN's). The properties investigated in our selected bipartite grid backbones are those deemed most relevant for applications to the foundations of this widely growing field. Distributed algorithms are primarily used to determine backbones. Our results review what backbone grid partitions exist in the data. This provides a metric to measure the effectiveness of any distributed algorithm against an existing optimal result. The visual display of selected backbone grids suggests local algorithm design strategies. Furthermore, these partitions must be efficiently computable for highly scalable computation, e.g. WSN's with 100's of thousands of vertices and millions of edges in the resulting RGG. We consider distributions over a segment of the plane and over the surface of the sphere to model sensor distributions both in limited planar regions, all around the globe or on distant planets.","PeriodicalId":399222,"journal":{"name":"2017 13th International Conference on Distributed Computing in Sensor Systems (DCOSS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228452","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
扫码关注我们
求助内容：
应助结果提醒方式：