F. A. Teixeira, G. V. Machado, Fernando Magno Quintão Pereira, H. Wong, J. Nogueira, Leonardo B. Oliveira
The Internet of Things (IoT) is increasingly more relevant. This growing importance calls for tools able to provide users with correct, reliable and secure systems. In this paper, we claim that traditional approaches to analyze distributed systems are not expressive enough to address this challenge. As a solution to this problem, we present SIoT, a framework to analyze networked systems. SIoT's key insight is to look at a distributed system as a single body, and not as separate programs that exchange messages. By doing so, we can crosscheck information inferred from different nodes. This crosschecking increases the precision of traditional static analyses. To construct this global view of a distributed system we introduce a novel algorithm that discovers inter-program links efficiently. Such links lets us build a holistic view of the entire network, a knowledge that we can thus forward to a traditional tool. We prove that our algorithm always terminates and that it correctly models the semantics of a distributed system. To validate our solution, we have implemented SIoT on top of the LLVM compiler, and have used one instance of it to secure 6 ContikiOS applications against buffer overflow attacks. This instance of SIoT produces code that is as safe as code secured by more traditional analyses; however, our binaries are on average 18% more energy-efficient.
{"title":"SIoT: securing the internet of things through distributed system analysis","authors":"F. A. Teixeira, G. V. Machado, Fernando Magno Quintão Pereira, H. Wong, J. Nogueira, Leonardo B. Oliveira","doi":"10.1145/2737095.2737097","DOIUrl":"https://doi.org/10.1145/2737095.2737097","url":null,"abstract":"The Internet of Things (IoT) is increasingly more relevant. This growing importance calls for tools able to provide users with correct, reliable and secure systems. In this paper, we claim that traditional approaches to analyze distributed systems are not expressive enough to address this challenge. As a solution to this problem, we present SIoT, a framework to analyze networked systems. SIoT's key insight is to look at a distributed system as a single body, and not as separate programs that exchange messages. By doing so, we can crosscheck information inferred from different nodes. This crosschecking increases the precision of traditional static analyses. To construct this global view of a distributed system we introduce a novel algorithm that discovers inter-program links efficiently. Such links lets us build a holistic view of the entire network, a knowledge that we can thus forward to a traditional tool. We prove that our algorithm always terminates and that it correctly models the semantics of a distributed system. To validate our solution, we have implemented SIoT on top of the LLVM compiler, and have used one instance of it to secure 6 ContikiOS applications against buffer overflow attacks. This instance of SIoT produces code that is as safe as code secured by more traditional analyses; however, our binaries are on average 18% more energy-efficient.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114575487","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}
Brandon M. Kelly, B. Rumberg, D. Graham, V. Kulathumani, Spencer Clites, Alexander T. Dilello, M. M. Navidi
To meet the demanding requirements in the growing area of wireless sensing applications, some sensing platforms have included low-power application-specific hardware to process the sensor data for compression and pre-classification of the relevant information. While this additional hardware can reduce the overall power consumption of the system, a unique hardware solution is required for each application. To diminish this burden, we will demonstrate a reconfigurable analog/mixed-signal sensing platform. At the hardware-level, this platform consists of a reconfigurable integrated circuit containing many commonly used circuit components that can be connected in any configuration to perform sensor interfacing and ultra-low-power signal processing. At the software level, this platform provides a framework for abstracting the underlying hardware. We will demonstrate how our platform allows a developer to create applications ranging from standard sensor interfacing techniques to more complicated intelligent pre-processing and wake-up detection, without the necessity of circuit-level expertise.
{"title":"RAMP: accelerating wireless sensor hardware design with a reconfigurable analog/mixed-signal platform","authors":"Brandon M. Kelly, B. Rumberg, D. Graham, V. Kulathumani, Spencer Clites, Alexander T. Dilello, M. M. Navidi","doi":"10.1145/2737095.2737129","DOIUrl":"https://doi.org/10.1145/2737095.2737129","url":null,"abstract":"To meet the demanding requirements in the growing area of wireless sensing applications, some sensing platforms have included low-power application-specific hardware to process the sensor data for compression and pre-classification of the relevant information. While this additional hardware can reduce the overall power consumption of the system, a unique hardware solution is required for each application. To diminish this burden, we will demonstrate a reconfigurable analog/mixed-signal sensing platform. At the hardware-level, this platform consists of a reconfigurable integrated circuit containing many commonly used circuit components that can be connected in any configuration to perform sensor interfacing and ultra-low-power signal processing. At the software level, this platform provides a framework for abstracting the underlying hardware. We will demonstrate how our platform allows a developer to create applications ranging from standard sensor interfacing techniques to more complicated intelligent pre-processing and wake-up detection, without the necessity of circuit-level expertise.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116744027","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}
Clock synchronization is highly desirable in distributed systems, including many applications in the Internet of Things and Humans (IoTH). For IoTH, Bluetooth Low Energy (BLE) - a subset of the recent Bluetooth v4:0 stack - provides a low-power and loosely coupled mechanism for sensor data collection with ubiquitous units (e.g., smartphones and tablets) carried by humans. This fundamental design paradigm of BLE is enabled by a range of broadcast advertising modes. While its operational benefits are numerous, the lack of a common time reference in the broadcast mode of BLE has been a fundamental limitation. This work presents and describes CheepSync: a time synchronization service architecture for BLE advertisers. We implement CheepSync on custom designed nRF24Cheep beacon platforms (as broadcasters) and commercial off-the-shelf Android ported smartphones (as passive listeners); and show that the average (single hop) time synchronization accuracy is in the 10 μs range.
{"title":"CheepSync: a time synchronization service for resource constrained bluetooth low energy advertisers","authors":"S. Sridhar, P. Misra, J. Warrior","doi":"10.1145/2737095.2742925","DOIUrl":"https://doi.org/10.1145/2737095.2742925","url":null,"abstract":"Clock synchronization is highly desirable in distributed systems, including many applications in the Internet of Things and Humans (IoTH). For IoTH, Bluetooth Low Energy (BLE) - a subset of the recent Bluetooth v4:0 stack - provides a low-power and loosely coupled mechanism for sensor data collection with ubiquitous units (e.g., smartphones and tablets) carried by humans. This fundamental design paradigm of BLE is enabled by a range of broadcast advertising modes. While its operational benefits are numerous, the lack of a common time reference in the broadcast mode of BLE has been a fundamental limitation. This work presents and describes CheepSync: a time synchronization service architecture for BLE advertisers. We implement CheepSync on custom designed nRF24Cheep beacon platforms (as broadcasters) and commercial off-the-shelf Android ported smartphones (as passive listeners); and show that the average (single hop) time synchronization accuracy is in the 10 μs range.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121953332","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}
Shiguang Wang, Lu Su, Shen Li, Shaohan Hu, Md. Tanvir Al Amin, Hongwei Wang, Shuochao Yao, Lance M. Kaplan, T. Abdelzaher
The proliferation of mobile sensing and communication devices in the possession of the average individual generated much recent interest in social sensing applications. Significant advances were made on the problem of uncovering ground truth from observations made by participants of unknown reliability. The problem, also called fact-finding commonly arises in applications where unvetted individuals may opt in to report phenomena of interest. For example, reliability of individuals might be unknown when they can join a participatory sensing campaign simply by downloading a smartphone app. This paper extends past social sensing literature by offering a scalable approach for exploiting dependencies between observed variables to increase fact-finding accuracy. Prior work assumed that reported facts are independent, or incurred exponential complexity when dependencies were present. In contrast, this paper presents the first scalable approach for accommodating dependency graphs between observed states. The approach is tested using real-life data collected in the aftermath of hurricane Sandy on availability of gas, food, and medical supplies, as well as extensive simulations. Evaluation shows that combining expected correlation graphs (of outages) with reported observations of unknown reliability, results in a much more reliable reconstruction of ground truth from the noisy social sensing data. We also show that correlation graphs can help test hypotheses regarding underlying causes, when different hypotheses are associated with different correlation patterns. For example, an observed outage profile can be attributed to a supplier outage or to excessive local demand. The two differ in expected correlations in observed outages, enabling joint identification of both the actual outages and their underlying causes.
{"title":"Scalable social sensing of interdependent phenomena","authors":"Shiguang Wang, Lu Su, Shen Li, Shaohan Hu, Md. Tanvir Al Amin, Hongwei Wang, Shuochao Yao, Lance M. Kaplan, T. Abdelzaher","doi":"10.1145/2737095.2737114","DOIUrl":"https://doi.org/10.1145/2737095.2737114","url":null,"abstract":"The proliferation of mobile sensing and communication devices in the possession of the average individual generated much recent interest in social sensing applications. Significant advances were made on the problem of uncovering ground truth from observations made by participants of unknown reliability. The problem, also called fact-finding commonly arises in applications where unvetted individuals may opt in to report phenomena of interest. For example, reliability of individuals might be unknown when they can join a participatory sensing campaign simply by downloading a smartphone app. This paper extends past social sensing literature by offering a scalable approach for exploiting dependencies between observed variables to increase fact-finding accuracy. Prior work assumed that reported facts are independent, or incurred exponential complexity when dependencies were present. In contrast, this paper presents the first scalable approach for accommodating dependency graphs between observed states. The approach is tested using real-life data collected in the aftermath of hurricane Sandy on availability of gas, food, and medical supplies, as well as extensive simulations. Evaluation shows that combining expected correlation graphs (of outages) with reported observations of unknown reliability, results in a much more reliable reconstruction of ground truth from the noisy social sensing data. We also show that correlation graphs can help test hypotheses regarding underlying causes, when different hypotheses are associated with different correlation patterns. For example, an observed outage profile can be attributed to a supplier outage or to excessive local demand. The two differ in expected correlations in observed outages, enabling joint identification of both the actual outages and their underlying causes.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132315937","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}
S. Narayana, R. V. Prasad, V. Rao, T. V. Prabhakar, S. Kowshik, Madhuri Iyer
Pyroelectric Infra-Red (PIR) sensors are used in many applications including security. PIRs detect the presence of humans and animals from the radiation of their body heat. This could be used to trigger events, e.g., opening doors, recording video, etc. PIRs are used widely because of their low power consumption. Hitherto, PIR sensors were used for binary event generation -- human/animal present or not-present. At the same time simple binary output hinders the use of PIR sensors in a wide variety of sophisticated applications. In the literature, we find limited characterization of analog output from PIR sensors that could provide much more information. We built a simple array of PIR sensors and packaged them in a tower. We used two sets of four PIR sensors and tapped their analog signals after amplification. Our major contribution is the characterization of analog signals from the PIR sensors. We describe many interesting aspects obtained from the analog signals, which have not been explored until now. We also show their correspondence with the range, speed and size of the moving object. Using the characterization of PIR sensors analog data as well as simple binary decisions from these PIR sensors, we: (i) classify moving object with high precision; and (ii) localize the moving object. The major incentives are low operating power compared to WSNs. We achieve 30 cm accuracy in 80% of the times, when ranging up to 5 m. Over multiple experiments for different persons in the range 1--10 m, we show that the error probability for localization is 0.08 at moderate distances (around 5--6 m). Our work will help in designing better detection and application triggers using PIR sensors in the near future. We believe that this work will open up new avenues in the development of new applications with PIR sensors.
{"title":"PIR sensors: characterization and novel localization technique","authors":"S. Narayana, R. V. Prasad, V. Rao, T. V. Prabhakar, S. Kowshik, Madhuri Iyer","doi":"10.1145/2737095.2742561","DOIUrl":"https://doi.org/10.1145/2737095.2742561","url":null,"abstract":"Pyroelectric Infra-Red (PIR) sensors are used in many applications including security. PIRs detect the presence of humans and animals from the radiation of their body heat. This could be used to trigger events, e.g., opening doors, recording video, etc. PIRs are used widely because of their low power consumption. Hitherto, PIR sensors were used for binary event generation -- human/animal present or not-present. At the same time simple binary output hinders the use of PIR sensors in a wide variety of sophisticated applications. In the literature, we find limited characterization of analog output from PIR sensors that could provide much more information. We built a simple array of PIR sensors and packaged them in a tower. We used two sets of four PIR sensors and tapped their analog signals after amplification. Our major contribution is the characterization of analog signals from the PIR sensors. We describe many interesting aspects obtained from the analog signals, which have not been explored until now. We also show their correspondence with the range, speed and size of the moving object. Using the characterization of PIR sensors analog data as well as simple binary decisions from these PIR sensors, we: (i) classify moving object with high precision; and (ii) localize the moving object. The major incentives are low operating power compared to WSNs. We achieve 30 cm accuracy in 80% of the times, when ranging up to 5 m. Over multiple experiments for different persons in the range 1--10 m, we show that the error probability for localization is 0.08 at moderate distances (around 5--6 m). Our work will help in designing better detection and application triggers using PIR sensors in the near future. We believe that this work will open up new avenues in the development of new applications with PIR sensors.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"293 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133036881","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}
The need of energy production using renewable resources has been increasing nowadays. Thus, there has been a high investment in wind power machines to increase their quality and capability. The high reparation cost of these machines has shifted the focus of interest of companies and researchers to find effective methods to diagnose and to predict the status of wind power machines. Our research attempts to evaluate and to develop a new diagnostic and prediction system through the implementation and improvement of a dimension reduction technique joined with Mel-Frequency Cepstral Coefficients, a highly used technique in voice recognition. As a tool to diagnose the status, the hidden Markov models are implemented. As a result, the prediction and the diagnosis of the status of the system were successfully detected with a great level of accuracy.
{"title":"Intelligent diagnostic framework using HMMs and mel-frequency cepstral coefficients applied to wind power machine","authors":"M. Castro, Young-Jin Kim","doi":"10.1145/2737095.2742926","DOIUrl":"https://doi.org/10.1145/2737095.2742926","url":null,"abstract":"The need of energy production using renewable resources has been increasing nowadays. Thus, there has been a high investment in wind power machines to increase their quality and capability. The high reparation cost of these machines has shifted the focus of interest of companies and researchers to find effective methods to diagnose and to predict the status of wind power machines. Our research attempts to evaluate and to develop a new diagnostic and prediction system through the implementation and improvement of a dimension reduction technique joined with Mel-Frequency Cepstral Coefficients, a highly used technique in voice recognition. As a tool to diagnose the status, the hidden Markov models are implemented. As a result, the prediction and the diagnosis of the status of the system were successfully detected with a great level of accuracy.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133560194","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 this demonstration, we present a topological mapping system to be used with biobotic insects in order to sketch maps of unknown arenas using only neighbor to neighbor interactions among the agents. Biobotic insects fuse the locomotory advantages of insects with wireless sensing technology in form of electronic backpacks to function as search and rescue agents. Our mapping approach is designed for emergency response scenarios, where traditional mapping approaches may fail due to lack of localization information. We demonstrate the performance of our proposed approach instead using Hexbugs, which emulate the natural random motion of biobots. The Hexbugs are dispersed into a maze with unknown structure (Fig. 1), and their local interactions are captured through a visual tracking system. Such information is then exploited into a data analysis engine in order to robustly find the topological structure of the maze.
{"title":"Exploration and topological mapping with Hexbugs","authors":"A. Dirafzoon, E. Lobaton, A. Bozkurt","doi":"10.1145/2737095.2737137","DOIUrl":"https://doi.org/10.1145/2737095.2737137","url":null,"abstract":"In this demonstration, we present a topological mapping system to be used with biobotic insects in order to sketch maps of unknown arenas using only neighbor to neighbor interactions among the agents. Biobotic insects fuse the locomotory advantages of insects with wireless sensing technology in form of electronic backpacks to function as search and rescue agents. Our mapping approach is designed for emergency response scenarios, where traditional mapping approaches may fail due to lack of localization information. We demonstrate the performance of our proposed approach instead using Hexbugs, which emulate the natural random motion of biobots. The Hexbugs are dispersed into a maze with unknown structure (Fig. 1), and their local interactions are captured through a visual tracking system. Such information is then exploited into a data analysis engine in order to robustly find the topological structure of the maze.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133639478","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}
T. Okoshi, Yu Lu, Chetna Vig, Youngki Lee, R. Balan, Archan Misra
We present QueueVadis, a system that addresses the problem of estimating, in real-time, the properties of queues at commonplace urban locations, such as coffee shops, taxi stands and movie theaters. Abjuring the use of any queuing-specific infrastructure sensors, QueueVadis uses participatory mobile sensing to detect both (i) the individual-level queuing episodes for any arbitrarily-shaped queue (by a characteristic locomotive signature of short bursts of "shuffling forward" between periods of "standing") and (ii) the aggregate-level queue properties (such as expected wait or service times) via appropriate statistical aggregation of multi-person data. Moreover, for venues where multiple queues are too close to be separated via location estimates, QueueVadis also uses a novel disambiguation technique to separate users into multiple distinct queues. User studies, performed with 138 cumulative total users observed at 23 different real-world queues across Singapore and Japan, show that QueueVadis is able to (a) identify all individual queuing episodes, (b) predict service and wait times fairly accurately (with median estimation errors in the 10%--20% range), independent of the queue's shape, (c) separate users in multiple proximate queues with close to 80% accuracy and (d) provide reasonable estimates when the participation rate (the fraction of QueueVadis-equipped people in the queue) is modest.
{"title":"QueueVadis: queuing analytics using smartphones","authors":"T. Okoshi, Yu Lu, Chetna Vig, Youngki Lee, R. Balan, Archan Misra","doi":"10.1145/2737095.2737120","DOIUrl":"https://doi.org/10.1145/2737095.2737120","url":null,"abstract":"We present QueueVadis, a system that addresses the problem of estimating, in real-time, the properties of queues at commonplace urban locations, such as coffee shops, taxi stands and movie theaters. Abjuring the use of any queuing-specific infrastructure sensors, QueueVadis uses participatory mobile sensing to detect both (i) the individual-level queuing episodes for any arbitrarily-shaped queue (by a characteristic locomotive signature of short bursts of \"shuffling forward\" between periods of \"standing\") and (ii) the aggregate-level queue properties (such as expected wait or service times) via appropriate statistical aggregation of multi-person data. Moreover, for venues where multiple queues are too close to be separated via location estimates, QueueVadis also uses a novel disambiguation technique to separate users into multiple distinct queues. User studies, performed with 138 cumulative total users observed at 23 different real-world queues across Singapore and Japan, show that QueueVadis is able to (a) identify all individual queuing episodes, (b) predict service and wait times fairly accurately (with median estimation errors in the 10%--20% range), independent of the queue's shape, (c) separate users in multiple proximate queues with close to 80% accuracy and (d) provide reasonable estimates when the participation rate (the fraction of QueueVadis-equipped people in the queue) is modest.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127461038","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}
The rise of heterogeneity in wireless technologies operating in the unlicensed bands has been shown to adversely affect the performance of low-power wireless networks. Cross-Technology Interference (CTI) is highly uncertain and raises the need for agile methods that assess the channel conditions and apply actions maximizing communication success. In this paper, we present TIIM, a lightweight Technology-Independent Interference Mitigation solution that detects, quantifies, and reacts to CTI in realtime. TIIM employs a lightweight machine learning classifier to (i) decide whether communication is viable over the interfered link, (ii) characterize the ambient conditions and apply the best coexistence mitigation strategy. We present an in-depth experimental characterization of the effect of CTI on 802.15.4 links, which motivated and influenced the design of TIIM. Our evaluation shows that TIIM, while exposed to extensive and heterogeneous interference, can achieve a total PRR improvement of 30% with an additional transmission overhead of 5.6%.
{"title":"TIIM: technology-independent interference mitigation for low-power wireless networks","authors":"Anwar Hithnawi, Hossein Shafagh, S. Duquennoy","doi":"10.1145/2737095.2737104","DOIUrl":"https://doi.org/10.1145/2737095.2737104","url":null,"abstract":"The rise of heterogeneity in wireless technologies operating in the unlicensed bands has been shown to adversely affect the performance of low-power wireless networks. Cross-Technology Interference (CTI) is highly uncertain and raises the need for agile methods that assess the channel conditions and apply actions maximizing communication success. In this paper, we present TIIM, a lightweight Technology-Independent Interference Mitigation solution that detects, quantifies, and reacts to CTI in realtime. TIIM employs a lightweight machine learning classifier to (i) decide whether communication is viable over the interfered link, (ii) characterize the ambient conditions and apply the best coexistence mitigation strategy. We present an in-depth experimental characterization of the effect of CTI on 802.15.4 links, which motivated and influenced the design of TIIM. Our evaluation shows that TIIM, while exposed to extensive and heterogeneous interference, can achieve a total PRR improvement of 30% with an additional transmission overhead of 5.6%.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124169401","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}
G. Smart, N. Deligiannis, J. Mota, Y. Andreopoulos
We are working on a new concept for decentralized medium access control (MAC), termed decentralized time-synchronized channel swapping (DT-SCS). Under the proposed DT-SCS and its associated MAC-layer protocol, wireless nodes converge to synchronous beacon packet transmissions across all IEEE802.15.4 channels, with balanced numbers of nodes in each channel. This is achieved by reactive listening mechanisms, based on pulse coupled oscillator techniques. Once convergence to the multichannel time-synchronized state is achieved, peer-to-peer channel swapping can then take place via swap requests and acknowledgments made by concurrent transmitters in neighboring channels. Our implementation of DT-SCS reveals that our proposal comprises an excellent candidate for completely decentralized MAC-layer coordination in WSNs by providing for quick convergence to steady state, high bandwidth utilization, high connectivity and robustness to interference and hidden nodes. The demo will showcase the properties of DT-SCS and will also present its behaviour under various scenarios for hidden nodes and interference, both experimentally and with the help of visualization of simulation results.
{"title":"Decentralized time-synchronized channel swapping","authors":"G. Smart, N. Deligiannis, J. Mota, Y. Andreopoulos","doi":"10.1145/2737095.2742557","DOIUrl":"https://doi.org/10.1145/2737095.2742557","url":null,"abstract":"We are working on a new concept for decentralized medium access control (MAC), termed decentralized time-synchronized channel swapping (DT-SCS). Under the proposed DT-SCS and its associated MAC-layer protocol, wireless nodes converge to synchronous beacon packet transmissions across all IEEE802.15.4 channels, with balanced numbers of nodes in each channel. This is achieved by reactive listening mechanisms, based on pulse coupled oscillator techniques. Once convergence to the multichannel time-synchronized state is achieved, peer-to-peer channel swapping can then take place via swap requests and acknowledgments made by concurrent transmitters in neighboring channels. Our implementation of DT-SCS reveals that our proposal comprises an excellent candidate for completely decentralized MAC-layer coordination in WSNs by providing for quick convergence to steady state, high bandwidth utilization, high connectivity and robustness to interference and hidden nodes. The demo will showcase the properties of DT-SCS and will also present its behaviour under various scenarios for hidden nodes and interference, both experimentally and with the help of visualization of simulation results.","PeriodicalId":318992,"journal":{"name":"Proceedings of the 14th International Conference on Information Processing in Sensor Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122550266","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
扫码关注我们
求助内容：
应助结果提醒方式：