Despite extensive research on WiFi indoor localization, very few solutions are widely deployed, largely due to their high energy consumption. In this paper, we propose several energy saving strategies with varying localization accuracy and energy consumption tradeoffs in WiFi indoor localization. Instead of localizing every single device, these strategies exploit short range low-power communication technologies, to localize clusters of mobile devices, via a representative cluster head. We propose various cluster head selection algorithms that offer different trade offs between localization accuracy and power consumption. The outcome of this work provides insights into the effectiveness and cost of a particular strategy depending on the needs of the application requiring varying localization service levels.
{"title":"Energy saving strategies in WiFi indoor localization","authors":"A. Neishaboori, Khaled A. Harras","doi":"10.1145/2507924.2507997","DOIUrl":"https://doi.org/10.1145/2507924.2507997","url":null,"abstract":"Despite extensive research on WiFi indoor localization, very few solutions are widely deployed, largely due to their high energy consumption. In this paper, we propose several energy saving strategies with varying localization accuracy and energy consumption tradeoffs in WiFi indoor localization. Instead of localizing every single device, these strategies exploit short range low-power communication technologies, to localize clusters of mobile devices, via a representative cluster head. We propose various cluster head selection algorithms that offer different trade offs between localization accuracy and power consumption. The outcome of this work provides insights into the effectiveness and cost of a particular strategy depending on the needs of the application requiring varying localization service levels.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"72 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":"131313485","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}
E. Meshkova, Janne Riihijärvi, J. Ansari, P. Mähönen
Estimating the coverage of a wireless network is one of the key problems in network planning and management. In outdoor environments this is usually done using modern network planning tools combined with intensive drive tests. However, in indoor environments the problem is much more difficult. Solutions based on propagation modeling require precise building information for accuracy, and even then their performance is highly varying. Refining such predictions using measurements from mobile terminals is a promising possibility, but is not straightforward due to the noisy and unreliable measurement quality. In this paper we study the performance of spatial statistics techniques for coverage prediction in indoor environments. Using data collected in an indoor testbed with 60 low cost radio receivers, we show that such techniques can yield accurate coverage predictions provided suitable preprocessing and filtering of the data is performed. Further, a simple optimization approach enables high prediction accuracy to be achieved using only a small subset of the available measurement devices. These results are also highly relevant to the minimization of drive tests (MDT) approach currently being developed in 3GPP to enable mobile terminals carry out coverage measurements for wireless networks.
{"title":"Indoor coverage estimation from unreliable measurements using spatial statistics","authors":"E. Meshkova, Janne Riihijärvi, J. Ansari, P. Mähönen","doi":"10.1145/2507924.2507957","DOIUrl":"https://doi.org/10.1145/2507924.2507957","url":null,"abstract":"Estimating the coverage of a wireless network is one of the key problems in network planning and management. In outdoor environments this is usually done using modern network planning tools combined with intensive drive tests. However, in indoor environments the problem is much more difficult. Solutions based on propagation modeling require precise building information for accuracy, and even then their performance is highly varying. Refining such predictions using measurements from mobile terminals is a promising possibility, but is not straightforward due to the noisy and unreliable measurement quality. In this paper we study the performance of spatial statistics techniques for coverage prediction in indoor environments. Using data collected in an indoor testbed with 60 low cost radio receivers, we show that such techniques can yield accurate coverage predictions provided suitable preprocessing and filtering of the data is performed. Further, a simple optimization approach enables high prediction accuracy to be achieved using only a small subset of the available measurement devices. These results are also highly relevant to the minimization of drive tests (MDT) approach currently being developed in 3GPP to enable mobile terminals carry out coverage measurements for wireless networks.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"194 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":"116983567","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}
L. Gallina, A. Marin, S. Rossi, Tingting Han, M. Kwiatkowska
We present a framework for modelling ad-hoc Wireless Sensor Networks (WSNs) and studying both their connectivity properties and their performances in terms of energy consumption, throughput and other relevant indices. Our framework is based on a probabilistic process calculus where system executions are driven by Markovian probabilistic schedulers, allowing us to translate process terms into discrete time Markov chains (DTMCs) and use the probabilistic model checker PRISM to automatically evaluate/estimate the connectivity properties and the energy costs of the networks. To the best of our knowledge, this is the first work that proposes a unique framework for studying qualitative (e.g., by proving the equivalence of components or the correctness of a behaviour) and quantitative aspects of WSNs using a tool that allows both exact and approximate (via Monte Carlo simulation) analyses. We demonstrate our framework at work by considering different communication strategies based on gossip routing protocols, for a typical topology and a mobility scenario.
{"title":"A process algebraic framework for estimating the energy consumption in ad-hoc wireless sensor networks","authors":"L. Gallina, A. Marin, S. Rossi, Tingting Han, M. Kwiatkowska","doi":"10.1145/2507924.2507958","DOIUrl":"https://doi.org/10.1145/2507924.2507958","url":null,"abstract":"We present a framework for modelling ad-hoc Wireless Sensor Networks (WSNs) and studying both their connectivity properties and their performances in terms of energy consumption, throughput and other relevant indices. Our framework is based on a probabilistic process calculus where system executions are driven by Markovian probabilistic schedulers, allowing us to translate process terms into discrete time Markov chains (DTMCs) and use the probabilistic model checker PRISM to automatically evaluate/estimate the connectivity properties and the energy costs of the networks. To the best of our knowledge, this is the first work that proposes a unique framework for studying qualitative (e.g., by proving the equivalence of components or the correctness of a behaviour) and quantitative aspects of WSNs using a tool that allows both exact and approximate (via Monte Carlo simulation) analyses. We demonstrate our framework at work by considering different communication strategies based on gossip routing protocols, for a typical topology and a mobility scenario.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"83 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":"132018706","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}
Cooperative localization, where sensors exchange the information with each other to determine their locations, has received considerable attention. In this work, we study the cooperative localization in order to investigate several fundamental properties that have not been well addressed so far. We formulate the cooperative localization in a general setting, where a relative or absolute location map is obtained, depending on the number of anchors. The (relative or absolute) location map is the output of an optimization problem, where the objective function is given as a norm of a space where a vector composed of distances between sensors is defined. We show that several error bounds and the estimation bias of the cooperative localization can be obtained by simple arguments (e.g. by using triangle inequality) without specifying the detail of the objective function. Next, we theoretically and numerically verify that the cooperative localization has a preferable scaling property such that the estimation becomes more accurate as sensors are more densely deployed. Finally, we consider the problem that the objective functions used in the cooperative localization are usually multimodal and have a number of local optima and saddle points. We show that the gradient descent algorithm starting from a random prior (initial estimates) often fails to find the optimal solution when the distance measurements between some pair of sensors are not available. We propose a new prior, called shortest-path-distance-based prior, which is very powerful for obtaining accurate estimates even when the distances between some sensor pairs are not measurable.
{"title":"Cooperative localization revisited: error bound, scaling, and convergence","authors":"S. Shioda, K. Shimamura","doi":"10.1145/2507924.2507937","DOIUrl":"https://doi.org/10.1145/2507924.2507937","url":null,"abstract":"Cooperative localization, where sensors exchange the information with each other to determine their locations, has received considerable attention. In this work, we study the cooperative localization in order to investigate several fundamental properties that have not been well addressed so far. We formulate the cooperative localization in a general setting, where a relative or absolute location map is obtained, depending on the number of anchors. The (relative or absolute) location map is the output of an optimization problem, where the objective function is given as a norm of a space where a vector composed of distances between sensors is defined. We show that several error bounds and the estimation bias of the cooperative localization can be obtained by simple arguments (e.g. by using triangle inequality) without specifying the detail of the objective function. Next, we theoretically and numerically verify that the cooperative localization has a preferable scaling property such that the estimation becomes more accurate as sensors are more densely deployed. Finally, we consider the problem that the objective functions used in the cooperative localization are usually multimodal and have a number of local optima and saddle points. We show that the gradient descent algorithm starting from a random prior (initial estimates) often fails to find the optimal solution when the distance measurements between some pair of sensors are not available. We propose a new prior, called shortest-path-distance-based prior, which is very powerful for obtaining accurate estimates even when the distances between some sensor pairs are not measurable.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"16 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":"133921347","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 Cognitive Radio Networks, secondary users are affected by the the activity of primary users on licensed channels. To solve this problem, most routing protocols select the most stable links/channels, or use the minimum delay route and switch to other channels when primary users become active. However, these approaches may lead to competition between the secondary users on the most preferred links/channels which may cause congestion and affect the quality of the transmissions. In this paper, a multi-metric routing protocol with service differentiation is proposed. The main idea is to use different routing metrics for different traffic types to select routes that satisfy the specific requirements of each traffic type and to make load balancing across the network. Simulation results show that, compared to other related approaches, our protocol provides better end-to-end delay and increases the aggregate throughput. It also achieves load balancing across the network.
{"title":"A multi-metric routing protocol with service differentiation for cognitive radio ad-hoc networks","authors":"Samar Moursi, Mustafa ElNainay","doi":"10.1145/2507924.2507992","DOIUrl":"https://doi.org/10.1145/2507924.2507992","url":null,"abstract":"In Cognitive Radio Networks, secondary users are affected by the the activity of primary users on licensed channels. To solve this problem, most routing protocols select the most stable links/channels, or use the minimum delay route and switch to other channels when primary users become active. However, these approaches may lead to competition between the secondary users on the most preferred links/channels which may cause congestion and affect the quality of the transmissions. In this paper, a multi-metric routing protocol with service differentiation is proposed. The main idea is to use different routing metrics for different traffic types to select routes that satisfy the specific requirements of each traffic type and to make load balancing across the network. Simulation results show that, compared to other related approaches, our protocol provides better end-to-end delay and increases the aggregate throughput. It also achieves load balancing across the network.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"8 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":"127664219","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 model the problem of channel assignment in mobile networks as one of temporal coloring (T-coloring), that is, coloring a time-varying graph. In order to capture the impact of channel re-assignments due to mobility, we model the cost of coloring as C + αA, where C is the total number of colors used and A is the total number of color changes, and α is a user-selectable parameter reflecting the relative penalty of channel usage and re-assignments. Using these models, we present several novel algorithms for temporal coloring. We begin by analyzing two simple algorithms called SNAP and SMASH that take diametrically opposite positions on colors vs re-assignments, and provide theoretical results on the ranges of α in which one outperforms the other, both for arbitrary and random time-varying graphs. We then present six more algorithms that build upon each of SNAP and SMASH in different ways. Simulations on random geometric graphs with random waypoint mobility show that the relative cost of the algorithms depends upon the value of α and the transmission range, and we identify precise values at which the crossovers happen.
{"title":"Algorithms for channel assignment in mobile wireless networks using temporal coloring","authors":"Feng Yu, A. Bar-Noy, P. Basu, R. Ramanathan","doi":"10.1145/2507924.2507965","DOIUrl":"https://doi.org/10.1145/2507924.2507965","url":null,"abstract":"We model the problem of channel assignment in mobile networks as one of temporal coloring (T-coloring), that is, coloring a time-varying graph. In order to capture the impact of channel re-assignments due to mobility, we model the cost of coloring as C + αA, where C is the total number of colors used and A is the total number of color changes, and α is a user-selectable parameter reflecting the relative penalty of channel usage and re-assignments. Using these models, we present several novel algorithms for temporal coloring. We begin by analyzing two simple algorithms called SNAP and SMASH that take diametrically opposite positions on colors vs re-assignments, and provide theoretical results on the ranges of α in which one outperforms the other, both for arbitrary and random time-varying graphs. We then present six more algorithms that build upon each of SNAP and SMASH in different ways. Simulations on random geometric graphs with random waypoint mobility show that the relative cost of the algorithms depends upon the value of α and the transmission range, and we identify precise values at which the crossovers happen.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"21 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":"114852022","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 present an open source simulation model for the ns-3 simulator that allows the simulation of LTE handover scenarios, to support the design and evaluation of handover decision algorithms. In addition to the features supported by other publicly available open source LTE simulators, such as mobility, propagation, channel, PHY and MAC modeling, our model provides additional features such as the modeling of the RRC protocol, the MAC random access procedure, and the X2, S1 and S11 interfaces. On top of these features, the LTE handover procedure is modeled, following closely the 3GPP specifications. We present in detail the characteristics of each component of the simulation model, highlighting the modeling assumptions that were made in each case.
{"title":"An open source model for the simulation of LTE handover scenarios and algorithms in ns-3","authors":"N. Baldo, M. Requena-Esteso, M. Miozzo, R. Kwan","doi":"10.1145/2507924.2507940","DOIUrl":"https://doi.org/10.1145/2507924.2507940","url":null,"abstract":"In this paper, we present an open source simulation model for the ns-3 simulator that allows the simulation of LTE handover scenarios, to support the design and evaluation of handover decision algorithms. In addition to the features supported by other publicly available open source LTE simulators, such as mobility, propagation, channel, PHY and MAC modeling, our model provides additional features such as the modeling of the RRC protocol, the MAC random access procedure, and the X2, S1 and S11 interfaces. On top of these features, the LTE handover procedure is modeled, following closely the 3GPP specifications. We present in detail the characteristics of each component of the simulation model, highlighting the modeling assumptions that were made in each case.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"601 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":"123180687","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}
Virtualizing wireless networks has the potential to improve resource usage efficiency (system capacity) through spectrum sharing while allowing for isolation between users and customization of applications {9}. In most work related to wireless network virtualization, the sharing of spectrum is considered at the level of chunks of frequency that do not interfere. Such spectrum sharing, where service provider SPA can use the spectrum allocated to SPB when SPB does not use it, results in multiplexing gains improving the resource usage (see for example, [12]). We argue that sharing radio resources that are a function of geography and signal strength, rather than slices of spectrum is also possible. When we consider sharing of radio resources, the transmit power, the interference, and the usage scenario (capabilities/needs of devices) become important in determining what can be shared. In this paper, the potential gain from sharing such radio resources while using MIMO for combating interference and exploiting spatial degrees of freedom is investigated in a two service provider collaboration scenario. The metric used is the capacity of the system (with a large cell and a small cell) as a function of separation distance, transmit power, cell range, and various MIMO settings. We show that radio resource sharing is feasible, but it has implications on isolation between users of different SPs and MIMO settings are an important factor.
{"title":"On radio resource sharing in multi-antenna virtualized wireless networks","authors":"Xin Wang, P. Krishnamurthy, D. Tipper","doi":"10.1145/2507924.2507930","DOIUrl":"https://doi.org/10.1145/2507924.2507930","url":null,"abstract":"Virtualizing wireless networks has the potential to improve resource usage efficiency (system capacity) through spectrum sharing while allowing for isolation between users and customization of applications {9}. In most work related to wireless network virtualization, the sharing of spectrum is considered at the level of chunks of frequency that do not interfere. Such spectrum sharing, where service provider SPA can use the spectrum allocated to SPB when SPB does not use it, results in multiplexing gains improving the resource usage (see for example, [12]). We argue that sharing radio resources that are a function of geography and signal strength, rather than slices of spectrum is also possible. When we consider sharing of radio resources, the transmit power, the interference, and the usage scenario (capabilities/needs of devices) become important in determining what can be shared. In this paper, the potential gain from sharing such radio resources while using MIMO for combating interference and exploiting spatial degrees of freedom is investigated in a two service provider collaboration scenario. The metric used is the capacity of the system (with a large cell and a small cell) as a function of separation distance, transmit power, cell range, and various MIMO settings. We show that radio resource sharing is feasible, but it has implications on isolation between users of different SPs and MIMO settings are an important factor.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"17 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":"125492496","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}
Julio A. Sanguesa, Manuel Fogué, Piedad Garrido, F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni
In Vehicular ad hoc Networks (VANETs), efficient dissemination of messages is a key factor to speed up the development of useful services and applications. In this paper, we propose a novel algorithm that automatically chooses the best dissemination scheme trying to fit the warning message delivery policy to the current characteristics of each specific vehicular scenario. Our mechanism uses as input parameters the vehicular density and the topological characteristics of the environment where the vehicles are located, in order to decide which dissemination scheme to use. Simulation results demonstrate the feasibility of our approach, which is able to support more efficient warning message dissemination in vehicular environments.
{"title":"On the selection of optimal broadcast schemes in VANETs","authors":"Julio A. Sanguesa, Manuel Fogué, Piedad Garrido, F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni","doi":"10.1145/2507924.2507935","DOIUrl":"https://doi.org/10.1145/2507924.2507935","url":null,"abstract":"In Vehicular ad hoc Networks (VANETs), efficient dissemination of messages is a key factor to speed up the development of useful services and applications. In this paper, we propose a novel algorithm that automatically chooses the best dissemination scheme trying to fit the warning message delivery policy to the current characteristics of each specific vehicular scenario. Our mechanism uses as input parameters the vehicular density and the topological characteristics of the environment where the vehicles are located, in order to decide which dissemination scheme to use. Simulation results demonstrate the feasibility of our approach, which is able to support more efficient warning message dissemination in vehicular environments.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"18 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":"132665111","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-network data aggregation is often pursued to remove redundancy and correlate the data en-route to the base-station in order to save energy in wireless sensor networks (WSNs). In this paper, we present a novel cross-layer approach for reducing the latency in disseminating aggregated data to the base-station over multi-frequency radio links. Our approach forms the aggregation tree with the objective of increasing the simultaneity of transmissions and reducing buffering delay. Aggregation nodes are picked and time-slots are allocated to the individual sensors so that the most number of ready nodes can transmit their data without delay. Colliding transmissions are avoided by the use of different radio channels. Our approach is validated through simulation and is shown to outperform previously published schemes.
{"title":"Efficient data aggregation scheduling in wireless sensor networks with multi-channel links","authors":"Miloud Bagaa, M. Younis, N. Badache","doi":"10.1145/2507924.2507995","DOIUrl":"https://doi.org/10.1145/2507924.2507995","url":null,"abstract":"In-network data aggregation is often pursued to remove redundancy and correlate the data en-route to the base-station in order to save energy in wireless sensor networks (WSNs). In this paper, we present a novel cross-layer approach for reducing the latency in disseminating aggregated data to the base-station over multi-frequency radio links. Our approach forms the aggregation tree with the objective of increasing the simultaneity of transmissions and reducing buffering delay. Aggregation nodes are picked and time-slots are allocated to the individual sensors so that the most number of ready nodes can transmit their data without delay. Colliding transmissions are avoided by the use of different radio channels. Our approach is validated through simulation and is shown to outperform previously published schemes.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"30 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":"131126841","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
扫码关注我们
求助内容：
应助结果提醒方式：