Sensor nodes in many Wireless Body Area Network (WBAN) architectures are supposed to deliver sensed data to a gateway node on the body. To satisfy the data delivery requirements, the network needs to adapt itself to the changes in connection status of the body nodes to the gateway. As a prerequisite, Link Quality Estimation (LQE) needs to be done to detect the connection status of the nodes. The quality of links in WBANs is highly time-varying. The LQE technique should be agile to react fast to such link quality dynamics while avoiding frequent fluctuations to reduce the network adaptation overhead. In this paper, we present an empirical study on using different LQE methods for detecting the connection status of body nodes to the gateway in WBANs. A set of experiments using 16 wireless motes deployed on a body are performed to log the behavior of the wireless links. We explore the trade-offs made by each LQE method in terms of agility, stability, and reliability in detecting connection changes by analyzing the experimental data. Moreover, different LQE methods are used in an adaptive multi-hop WBAN mechanism, as a case study, and their impact on the Quality-of-Services (QoS) are investigated.
{"title":"An empirical study of link quality estimation techniques for disconnection detection in WBANs","authors":"Majid Nabi, M. Geilen, T. Basten","doi":"10.1145/2507924.2507959","DOIUrl":"https://doi.org/10.1145/2507924.2507959","url":null,"abstract":"Sensor nodes in many Wireless Body Area Network (WBAN) architectures are supposed to deliver sensed data to a gateway node on the body. To satisfy the data delivery requirements, the network needs to adapt itself to the changes in connection status of the body nodes to the gateway. As a prerequisite, Link Quality Estimation (LQE) needs to be done to detect the connection status of the nodes. The quality of links in WBANs is highly time-varying. The LQE technique should be agile to react fast to such link quality dynamics while avoiding frequent fluctuations to reduce the network adaptation overhead. In this paper, we present an empirical study on using different LQE methods for detecting the connection status of body nodes to the gateway in WBANs. A set of experiments using 16 wireless motes deployed on a body are performed to log the behavior of the wireless links. We explore the trade-offs made by each LQE method in terms of agility, stability, and reliability in detecting connection changes by analyzing the experimental data. Moreover, different LQE methods are used in an adaptive multi-hop WBAN mechanism, as a case study, and their impact on the Quality-of-Services (QoS) are investigated.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128407236","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}
Opportunistic scheduling was initially proposed to exploit user channel diversity for network capacity enhancement. However, the achievable gain of opportunistic schedulers is generally restrained due to fairness considerations which impose a tradeoff between fairness and throughput. In this paper, we show via analysis and numerical simulations that opportunistic scheduling not only increases network throughput dramatically, but also increases energy efficiency and can be fair to the users when they cooperate, in particular by using D2D communications. We propose to leverage smartphone's dual-radio interface capabilities to form clusters among mobile users. We design simple, scalable and energy-efficient D2D-assisted opportunistic strategies, which would incentivize mobile users to form clusters. We use a coalitional game theory approach to analyze the cluster formation mechanism, and show that proportional fair-based intra-cluster payoff distribution brings significant incentive to all mobile users regardless of their channel quality.
{"title":"On the compound impact of opportunistic scheduling and D2D communications in cellular networks","authors":"A. Asadi, V. Mancuso","doi":"10.1145/2507924.2507929","DOIUrl":"https://doi.org/10.1145/2507924.2507929","url":null,"abstract":"Opportunistic scheduling was initially proposed to exploit user channel diversity for network capacity enhancement. However, the achievable gain of opportunistic schedulers is generally restrained due to fairness considerations which impose a tradeoff between fairness and throughput. In this paper, we show via analysis and numerical simulations that opportunistic scheduling not only increases network throughput dramatically, but also increases energy efficiency and can be fair to the users when they cooperate, in particular by using D2D communications. We propose to leverage smartphone's dual-radio interface capabilities to form clusters among mobile users. We design simple, scalable and energy-efficient D2D-assisted opportunistic strategies, which would incentivize mobile users to form clusters. We use a coalitional game theory approach to analyze the cluster formation mechanism, and show that proportional fair-based intra-cluster payoff distribution brings significant incentive to all mobile users regardless of their channel quality.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125267721","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}
For some time, directional antennas have been considered to solve connectivity and interference issues in wireless networks. Several scenarios have been presented and often the conclusions drawn are positive, showing increase in capacity. However, to date there has been no effort to assess a holistic picture of the benefit/cost tradeoff and previous work mainly concerns either link scheduling or antenna placement but not the two combined. Such consideration will become increasingly important in the near future with the advent of heterogeneous networks and other possible combinations of mesh and public access networks. In order to better understand the full implications and potential of using directional antennas in such systems, we present a model for determining the maximized benefit/cost tradeoff using a combination of directional and omnidirectional antennas in wireless multihop backbones. We study the problem of maximizing the minimal flow rate from gateways to mesh routers in the mesh network. A mixed integer programming model is formulated for joint optimization of antenna placement and link transmission scheduling under an antenna-aware SINR interference constraint and a budget constraint. An accurate antenna model is used and variable modulation and coding schemes are used. The model is decomposed to a master problem and a pricing problem, and solved by a branch-and-price algorithm. Additionally, two effective heuristics are proposed as supplement methods. Applying the introduced model makes it possible to deploy directional antennas at appropriate nodes and find a corresponding link transmission scheduling (with data rate adaptation). The numerical results show that introducing directional antennas can indeed substantially improve the considered traffic objective. Interestingly, the results also show that it is not always optimal to install directional antennas at all possible nodes because of increased interference observed at non-receiving nodes within the beam width. Finally, comparisons are made to show the effectiveness of the proposed solution methods.
{"title":"Improving minimum flow rate in wireless mesh networks by effective placement of directional antennas","authors":"Yuan Li, M. Pióro, B. Landfeldt","doi":"10.1145/2507924.2507933","DOIUrl":"https://doi.org/10.1145/2507924.2507933","url":null,"abstract":"For some time, directional antennas have been considered to solve connectivity and interference issues in wireless networks. Several scenarios have been presented and often the conclusions drawn are positive, showing increase in capacity. However, to date there has been no effort to assess a holistic picture of the benefit/cost tradeoff and previous work mainly concerns either link scheduling or antenna placement but not the two combined. Such consideration will become increasingly important in the near future with the advent of heterogeneous networks and other possible combinations of mesh and public access networks. In order to better understand the full implications and potential of using directional antennas in such systems, we present a model for determining the maximized benefit/cost tradeoff using a combination of directional and omnidirectional antennas in wireless multihop backbones. We study the problem of maximizing the minimal flow rate from gateways to mesh routers in the mesh network. A mixed integer programming model is formulated for joint optimization of antenna placement and link transmission scheduling under an antenna-aware SINR interference constraint and a budget constraint. An accurate antenna model is used and variable modulation and coding schemes are used. The model is decomposed to a master problem and a pricing problem, and solved by a branch-and-price algorithm. Additionally, two effective heuristics are proposed as supplement methods. Applying the introduced model makes it possible to deploy directional antennas at appropriate nodes and find a corresponding link transmission scheduling (with data rate adaptation). The numerical results show that introducing directional antennas can indeed substantially improve the considered traffic objective. Interestingly, the results also show that it is not always optimal to install directional antennas at all possible nodes because of increased interference observed at non-receiving nodes within the beam width. Finally, comparisons are made to show the effectiveness of the proposed solution methods.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125904963","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 paper we introduce a mathematical model to analyze the performance of Wi-Fi networks carrying voice calls and TCP controlled file downloads. We derive the voice call capacity, the TCP throughput, and the bandwidth utilization using the proposed five-dimensional Markov model. We show that there exists a correlation among the queue size of client nodes and the capacity and throughput of the network. We also demonstrate how bandwidth utilization is affected by variable packet arrival rates. The analytical results match well with the simulation results generated by Qualnet simulator. Moreover, we conduct an experimental study of the Enhanced Distributed Channel Access (EDCA) mechanism of the IEEE 802.11e standard with a real-environment testbed consisting of 1 access point and 11 laptops to further validate the analytical and simulation results.
{"title":"Analyzing the effect of client queue size on VoIP and TCP traffic over an IEEE 802.11e WLAN","authors":"S. Datta, Sajal K. Das","doi":"10.1145/2507924.2507993","DOIUrl":"https://doi.org/10.1145/2507924.2507993","url":null,"abstract":"In this paper we introduce a mathematical model to analyze the performance of Wi-Fi networks carrying voice calls and TCP controlled file downloads. We derive the voice call capacity, the TCP throughput, and the bandwidth utilization using the proposed five-dimensional Markov model. We show that there exists a correlation among the queue size of client nodes and the capacity and throughput of the network. We also demonstrate how bandwidth utilization is affected by variable packet arrival rates. The analytical results match well with the simulation results generated by Qualnet simulator. Moreover, we conduct an experimental study of the Enhanced Distributed Channel Access (EDCA) mechanism of the IEEE 802.11e standard with a real-environment testbed consisting of 1 access point and 11 laptops to further validate the analytical and simulation results.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126658552","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 paper, we propose an accurate and efficient analytic model to evaluate the impact of channel fading on multi-hop safety message disseminations in vehicular ad hoc networks (VANET). A multi-hop relay strategy is also proposed by setting distance-based timers (the longer the distance, the shorter the timer) so that the farther receiver has the higher priority for it to rebroadcast the message. Important performance and reliability metrics are derived and analyzed for a thorough understanding of the safety message transmission behavior. Extensive simulations are conducted in Matlab to verify the correctness of our proposed model under realistic network parameter settings.
{"title":"Channel fading impact on multi-hop DSRC safety communication","authors":"Xiaoyan Yin, Xiaomin Ma, Kishor S. Trivedi","doi":"10.1145/2507924.2507989","DOIUrl":"https://doi.org/10.1145/2507924.2507989","url":null,"abstract":"In this paper, we propose an accurate and efficient analytic model to evaluate the impact of channel fading on multi-hop safety message disseminations in vehicular ad hoc networks (VANET). A multi-hop relay strategy is also proposed by setting distance-based timers (the longer the distance, the shorter the timer) so that the farther receiver has the higher priority for it to rebroadcast the message. Important performance and reliability metrics are derived and analyzed for a thorough understanding of the safety message transmission behavior. Extensive simulations are conducted in Matlab to verify the correctness of our proposed model under realistic network parameter settings.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"2003 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127692184","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}
Vehicular ad hoc network (VANET) is currently researched and achieved by several organizers to develop the intelligent transportation system (ITS). Research on Vehicular Ad hoc Network (VANET) has been conducting for long time. Nowadays, several organizers has obtained remarkable achievements contributing to the development of the Intelligent transportation system, ITS. The communication protocol in VANET named 802.11p protocol, has been improved to adapt to the high-speed environment. However, the communication among vehicles can be interfered even by Denial of Service (DoS) attacks such as jamming attacks. The vehicles communicate with each other in the high-speed environment. The time of data exchange between them must be extremely short. Solutions for detection of jamming attacks must occur quickly to detect more precisely. In order to detect jamming attacks more precisely, solutions therefore must occur very fast. In this paper, we propose one solution to detect jamming attacks. The following solution is based on the combination of the packet delivery ratio and its diminution.
{"title":"Solution of detecting jamming attacks in vehicle ad hoc networks","authors":"A. Nguyen, L. Mokdad, J. Ben-othman","doi":"10.1145/2507924.2507927","DOIUrl":"https://doi.org/10.1145/2507924.2507927","url":null,"abstract":"Vehicular ad hoc network (VANET) is currently researched and achieved by several organizers to develop the intelligent transportation system (ITS). Research on Vehicular Ad hoc Network (VANET) has been conducting for long time. Nowadays, several organizers has obtained remarkable achievements contributing to the development of the Intelligent transportation system, ITS. The communication protocol in VANET named 802.11p protocol, has been improved to adapt to the high-speed environment. However, the communication among vehicles can be interfered even by Denial of Service (DoS) attacks such as jamming attacks. The vehicles communicate with each other in the high-speed environment. The time of data exchange between them must be extremely short. Solutions for detection of jamming attacks must occur quickly to detect more precisely. In order to detect jamming attacks more precisely, solutions therefore must occur very fast. In this paper, we propose one solution to detect jamming attacks. The following solution is based on the combination of the packet delivery ratio and its diminution.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127787022","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}
Molecular communication is a novel paradigm that uses molecules as an information carrier to enable nanomachines to communicate with each other. The two major components of a diffusion-based molecular communication are diffusion in the medium and the ligand-reception. In this paper, using the principles of diffusion theories and natural ligand-receptor binding mechanisms in biology, we first develop and present model for the molecular single-access channel. Then, we derive the capacity expressions of the molecular single-access channel. Furthermore, we extend it to multiple-access channel in which multiple transmitters communicate with a single receiver. The objective of this paper is to study the capacity of multiple-access channel which is effected by the parameters of diffusion channel and ligand-receptor binding mechanisms. The numerical results show that the overall channel capacity is restricted by the physical parameters of diffusion channel and ligand-receptors and some different characteristics are presented in multiple-access channel scenario comparing with single-access channel scenario.
{"title":"Multiple-access channel capacity of diffusion and ligand-based molecular communication","authors":"Qiang Liu, Kun Yang","doi":"10.1145/2507924.2507932","DOIUrl":"https://doi.org/10.1145/2507924.2507932","url":null,"abstract":"Molecular communication is a novel paradigm that uses molecules as an information carrier to enable nanomachines to communicate with each other. The two major components of a diffusion-based molecular communication are diffusion in the medium and the ligand-reception. In this paper, using the principles of diffusion theories and natural ligand-receptor binding mechanisms in biology, we first develop and present model for the molecular single-access channel. Then, we derive the capacity expressions of the molecular single-access channel. Furthermore, we extend it to multiple-access channel in which multiple transmitters communicate with a single receiver. The objective of this paper is to study the capacity of multiple-access channel which is effected by the parameters of diffusion channel and ligand-receptor binding mechanisms. The numerical results show that the overall channel capacity is restricted by the physical parameters of diffusion channel and ligand-receptors and some different characteristics are presented in multiple-access channel scenario comparing with single-access channel scenario.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"90 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129819794","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}
Guilherme Maia, C. Rezende, L. Villas, A. Boukerche, A. C. Viana, Andre L. L. Aquino, A. Loureiro
Video dissemination to a group of vehicles is one of the many fundamental services envisioned for Vehicular Ad hoc Networks. For this purpose, in this paper we describe VoV, a video dissemination protocol that operates under extreme traffic conditions. Contrary to most existing approaches that focus exclusively on always-connected networks and tackle the broadcast storm problem inherent to them, VoV is designed to operate under any kind of traffic condition. We propose a new geographic-based broadcast suppression mechanism that gives higher priority to broadcast to vehicles inside especial forwarding zones. Furthermore, vehicles store and carry received messages in a local buffer in order to forward them to vehicles that were not covered by the first dissemination process, probably as a result of collisions or intermittent disconnections. Finally, VoV employs a rate control mechanism that sets the pace at which messages must be transmitted in an attempt to avoid channel overloading and to overcome the synchronization effects introduced by the channel hopping mechanism employed by IEEE 802.11p. When compared to two well-known solutions -- UV-CAST and AID -- we show that our proposal is more efficient in terms of message delivery, delay and overhead.
{"title":"Traffic aware video dissemination over vehicular ad hoc networks","authors":"Guilherme Maia, C. Rezende, L. Villas, A. Boukerche, A. C. Viana, Andre L. L. Aquino, A. Loureiro","doi":"10.1145/2507924.2507962","DOIUrl":"https://doi.org/10.1145/2507924.2507962","url":null,"abstract":"Video dissemination to a group of vehicles is one of the many fundamental services envisioned for Vehicular Ad hoc Networks. For this purpose, in this paper we describe VoV, a video dissemination protocol that operates under extreme traffic conditions. Contrary to most existing approaches that focus exclusively on always-connected networks and tackle the broadcast storm problem inherent to them, VoV is designed to operate under any kind of traffic condition. We propose a new geographic-based broadcast suppression mechanism that gives higher priority to broadcast to vehicles inside especial forwarding zones. Furthermore, vehicles store and carry received messages in a local buffer in order to forward them to vehicles that were not covered by the first dissemination process, probably as a result of collisions or intermittent disconnections. Finally, VoV employs a rate control mechanism that sets the pace at which messages must be transmitted in an attempt to avoid channel overloading and to overcome the synchronization effects introduced by the channel hopping mechanism employed by IEEE 802.11p. When compared to two well-known solutions -- UV-CAST and AID -- we show that our proposal is more efficient in terms of message delivery, delay and overhead.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113941282","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}
J. Meier, Benjamin Karaus, S. Sistla, T. Tidwell, R. Chamberlain, C. Gill
The stochastic nature of wireless communication suggests a Markov Decision Process (MDP) as a formalism for identifying and evaluating spectrum control policies. However, in practice numerous factors influence the success or failure of a transmission, so that the applicability of particular MDP models to real spectrum management problems must itself be examined. This paper presents a series of model validation studies in which correspondence between an MDP model and a discrete-event simulation (DES) model is evaluated. We test several hypotheses that together provide a foundation and an exemplar for the idea of using MDPs to guide management of shared spectrum. We conclude that there is sufficient similarity between the performance predictions made by the MDP model and the DES model that MDPs can be used effectively to determine spectrum control policies.
{"title":"Assessing the appropriateness of using markov decision processes for RF spectrum management","authors":"J. Meier, Benjamin Karaus, S. Sistla, T. Tidwell, R. Chamberlain, C. Gill","doi":"10.1145/2507924.2507942","DOIUrl":"https://doi.org/10.1145/2507924.2507942","url":null,"abstract":"The stochastic nature of wireless communication suggests a Markov Decision Process (MDP) as a formalism for identifying and evaluating spectrum control policies. However, in practice numerous factors influence the success or failure of a transmission, so that the applicability of particular MDP models to real spectrum management problems must itself be examined. This paper presents a series of model validation studies in which correspondence between an MDP model and a discrete-event simulation (DES) model is evaluated. We test several hypotheses that together provide a foundation and an exemplar for the idea of using MDPs to guide management of shared spectrum. We conclude that there is sufficient similarity between the performance predictions made by the MDP model and the DES model that MDPs can be used effectively to determine spectrum control policies.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116782365","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 address the problem of spatial queries in Wireless Sensor Networks (WSN) via hybrid overlays, where the data values may correspond to different physical phenomena and sensors may be correlated with spatial constraints. We show how hierarchical data and space abstractions can be used to represent Voronoi Cell based partitions of the sensing field and use Voronoi Trees to efficiently map the hierarchical abstractions for energy-efficient processing. The proposed scheme is simulated on the SidNET, a JiST/SWANS based sensor network simulation platform. The performance results show significant advantages in terms of accurate field representation at different levels of the tree hierarchy with a trade-off in query processing delay.
{"title":"Voronoi trees for hierarchical in-network data and space abstractions in wireless sensor networks","authors":"M. A. Mohamed, A. Khokhar, Goce Trajcevski","doi":"10.1145/2507924.2507999","DOIUrl":"https://doi.org/10.1145/2507924.2507999","url":null,"abstract":"We address the problem of spatial queries in Wireless Sensor Networks (WSN) via hybrid overlays, where the data values may correspond to different physical phenomena and sensors may be correlated with spatial constraints. We show how hierarchical data and space abstractions can be used to represent Voronoi Cell based partitions of the sensing field and use Voronoi Trees to efficiently map the hierarchical abstractions for energy-efficient processing. The proposed scheme is simulated on the SidNET, a JiST/SWANS based sensor network simulation platform. The performance results show significant advantages in terms of accurate field representation at different levels of the tree hierarchy with a trade-off in query processing delay.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130047547","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
扫码关注我们
求助内容：
应助结果提醒方式：