Islam E. Shaalan, K. Elbarbary, Ahmed A. S. Dessouki, Mohamed S. Abo El-Soud
In this paper, a new scheme of Joint Channel Estimation and Partial Parallel Interference Cancellation using Simulating Annealing (SA) or Particle Swarm Optimization (PSO) algorithms is proposed. This scheme is proposed for multiuser Multiple-Input Multiple-Output /Space Division Multiple Access (MIMO-SDMA) Orthogonal Frequency Division Multiplexing (OFDM) systems. The proposed scheme tries to reduce the cancellation error in Conventional Parallel Interference Cancellation (CPIC) detection schemes used in MIMO SDMA-OFDM system. The SA and PSO algorithms are employed in searching the optimal weights of the PPIC for multiple access interference cancellation. The proposed scheme is shown to provide a performance improvement as compared to MMSE and CPIC detectors especially in an overloaded scenario where number of users is high as compared to the Base Station (BS) antennas. In this scenario, channel estimation becomes more challenging, owing to the increased number of independent transmitter-receiver links to be estimated and the constraint imposed by the rank of the MIMO channel matrix. The proposed scheme provides a reasonable solution to the multiuser MIMO channel estimation problem and multiuser detection in the above-mentioned overloaded scenario.
{"title":"SA and PSO assisted joint scheme of channel estimation and PPIC for MIMO-SDMA/OFDM system","authors":"Islam E. Shaalan, K. Elbarbary, Ahmed A. S. Dessouki, Mohamed S. Abo El-Soud","doi":"10.1145/2507924.2507996","DOIUrl":"https://doi.org/10.1145/2507924.2507996","url":null,"abstract":"In this paper, a new scheme of Joint Channel Estimation and Partial Parallel Interference Cancellation using Simulating Annealing (SA) or Particle Swarm Optimization (PSO) algorithms is proposed. This scheme is proposed for multiuser Multiple-Input Multiple-Output /Space Division Multiple Access (MIMO-SDMA) Orthogonal Frequency Division Multiplexing (OFDM) systems. The proposed scheme tries to reduce the cancellation error in Conventional Parallel Interference Cancellation (CPIC) detection schemes used in MIMO SDMA-OFDM system. The SA and PSO algorithms are employed in searching the optimal weights of the PPIC for multiple access interference cancellation. The proposed scheme is shown to provide a performance improvement as compared to MMSE and CPIC detectors especially in an overloaded scenario where number of users is high as compared to the Base Station (BS) antennas. In this scenario, channel estimation becomes more challenging, owing to the increased number of independent transmitter-receiver links to be estimated and the constraint imposed by the rank of the MIMO channel matrix. The proposed scheme provides a reasonable solution to the multiuser MIMO channel estimation problem and multiuser detection in the above-mentioned overloaded scenario.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"81 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":"114852045","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 recent years, the use of random walks (RW) for data forwarding in wireless sensor networks (WSN) has gained a lot of popularity. However, a negative effect is often caused by the fact that a completely uniform random choice of the next hop during the walk translates into a reduced progress towards the sink node, thereby yielding a long latency. Several strategies are proposed to attenuate this problem. Most of them are characterized by their dependence on state information stored in sensor nodes in order to bias the direction of the walk towards the target. Such information require additional capabilities and it is costly in terms of complexity and energy, which is inherently problematical in WSN. This leads to a tradeoff between mutually contradictory goals and raises the question as to what extent biasing RW can affect the performance of the data forwarding scheme. This question is our primary motivation in investigating the problem of biasing RW based data forwarding from a pure analytical perspective.
{"title":"Analytical revisit on the use of biased random walks for data forwarding in wireless sensor networks","authors":"I. Mabrouki, A. Belghith","doi":"10.1145/2507924.2507994","DOIUrl":"https://doi.org/10.1145/2507924.2507994","url":null,"abstract":"In recent years, the use of random walks (RW) for data forwarding in wireless sensor networks (WSN) has gained a lot of popularity. However, a negative effect is often caused by the fact that a completely uniform random choice of the next hop during the walk translates into a reduced progress towards the sink node, thereby yielding a long latency. Several strategies are proposed to attenuate this problem. Most of them are characterized by their dependence on state information stored in sensor nodes in order to bias the direction of the walk towards the target. Such information require additional capabilities and it is costly in terms of complexity and energy, which is inherently problematical in WSN. This leads to a tradeoff between mutually contradictory goals and raises the question as to what extent biasing RW can affect the performance of the data forwarding scheme. This question is our primary motivation in investigating the problem of biasing RW based data forwarding from a pure analytical perspective.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"56 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":"117165995","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}
Wireless mesh networks (WMNs) consist of several small routers relaying packets wirelessly toward the destination or the Internet. A dense deployment enables the rapid creation of wireless access networks at a reasonable cost. The capacity of a wireless mesh network can be increased by using a diverse set of channels to allow simultaneous transmissions without causing interference. An interesting approach is to use one fixed wireless network interface for receiving and at least one switchable interface for sending. However, such a channel assignment suffers from switching overhead. In order to minimize the channel switching latency, we have developed a novel packet routing and forwarding strategy, AP-OLSR, which uses multiple next hop candidates tuned to different channels. When forwarding a packet, nodes pick the neighbor which is on a channel that gives a good balance between local switching overhead and global path quality. In this paper, we present a thorough evaluation of AP-OLSR with scenarios involving both single and multiple gateways, as well as single and competing flows. The evaluation shows that AP-OLSR can improve performance in both latency and throughput.
{"title":"Performance evaluation of the anypath routing and forwarding mechanism AP-OLSR","authors":"A. Lavén, A. Kassler, A. Brunström","doi":"10.1145/2507924.2507934","DOIUrl":"https://doi.org/10.1145/2507924.2507934","url":null,"abstract":"Wireless mesh networks (WMNs) consist of several small routers relaying packets wirelessly toward the destination or the Internet. A dense deployment enables the rapid creation of wireless access networks at a reasonable cost. The capacity of a wireless mesh network can be increased by using a diverse set of channels to allow simultaneous transmissions without causing interference. An interesting approach is to use one fixed wireless network interface for receiving and at least one switchable interface for sending. However, such a channel assignment suffers from switching overhead. In order to minimize the channel switching latency, we have developed a novel packet routing and forwarding strategy, AP-OLSR, which uses multiple next hop candidates tuned to different channels. When forwarding a packet, nodes pick the neighbor which is on a channel that gives a good balance between local switching overhead and global path quality. In this paper, we present a thorough evaluation of AP-OLSR with scenarios involving both single and multiple gateways, as well as single and competing flows. The evaluation shows that AP-OLSR can improve performance in both latency and throughput.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"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":"125721165","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}
Bandwidth sharing paradigm constitutes an incentive solution for the serious capacity management problem faced by operators as femtocells owners are able to offer a QoS guaranteed network access to mobile users in their femtocell coverage. In this paper, we consider a technico-economic bandwidth sharing model based on a reinforcement learning algorithm. Because such a model does not allow the convergence of the learning algorithm, due to the small size of the femtocells, the mobile users velocity and, more importantly, the randomness of their arrivals, we propose to use a mobility prediction approach based on the analysis of movements history of the mobile users. Knowing the next visited cell in advance provides more time to mobile user to negotiate with the access provider and to generate synchronized resource reservation requests that maximize the gain of the access provider.
{"title":"Femtocells sharing management using mobility prediction model","authors":"D. Barth, Amira Choutri, L. Kloul, O. Marcé","doi":"10.1145/2507924.2507988","DOIUrl":"https://doi.org/10.1145/2507924.2507988","url":null,"abstract":"Bandwidth sharing paradigm constitutes an incentive solution for the serious capacity management problem faced by operators as femtocells owners are able to offer a QoS guaranteed network access to mobile users in their femtocell coverage. In this paper, we consider a technico-economic bandwidth sharing model based on a reinforcement learning algorithm. Because such a model does not allow the convergence of the learning algorithm, due to the small size of the femtocells, the mobile users velocity and, more importantly, the randomness of their arrivals, we propose to use a mobility prediction approach based on the analysis of movements history of the mobile users. Knowing the next visited cell in advance provides more time to mobile user to negotiate with the access provider and to generate synchronized resource reservation requests that maximize the gain of the access provider.","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":"124787324","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}
Forest fires lead to high amount of environmental and economic loss all over the world. Prevention and early detection efforts aim to eliminate or minimize the damage that will be caused by a fire incident. Current surveillance systems for forest fires do not provide dense real-time monitoring and hence they lack prevention or early detection of a fire threat. Wireless sensor networks (WSNs), on the other hand, can collect real-time information such as temperature and humidity from almost all points of a forest and can provide fresh and accurate data for the fire-fighting management center quickly. In this work, we aim to evaluate the reporting performance of a WSN under realistic workload. Since fires are destructive and burning a deployed WSN is not feasible, simulation is the appropriate way to assess the reporting capability of a WSN during a forest fire. We integrate WSN simulator with a realistic fire propagation simulator which is modified to provide time based temperature field information while the fire propagates through the deployment area. Temperature information is used for the generation of realistic workloads and the determination of sensor destruction times that affects the routing decisions in WSN simulations. We present the effects of WSN related factors; such as reporting rate, number of the sinks, and the sink locations together with the effects of environmental factors such as the wind speed and the number of ignition points in terms of temperature reporting performance and freshness of temperature map.
{"title":"Performance evaluation of wireless sensor networks in realistic wildfire simulation scenarios","authors":"Sinan Isik, M. Y. Donmez, Can Tunca, Cem Ersoy","doi":"10.1145/2507924.2507941","DOIUrl":"https://doi.org/10.1145/2507924.2507941","url":null,"abstract":"Forest fires lead to high amount of environmental and economic loss all over the world. Prevention and early detection efforts aim to eliminate or minimize the damage that will be caused by a fire incident. Current surveillance systems for forest fires do not provide dense real-time monitoring and hence they lack prevention or early detection of a fire threat. Wireless sensor networks (WSNs), on the other hand, can collect real-time information such as temperature and humidity from almost all points of a forest and can provide fresh and accurate data for the fire-fighting management center quickly. In this work, we aim to evaluate the reporting performance of a WSN under realistic workload. Since fires are destructive and burning a deployed WSN is not feasible, simulation is the appropriate way to assess the reporting capability of a WSN during a forest fire. We integrate WSN simulator with a realistic fire propagation simulator which is modified to provide time based temperature field information while the fire propagates through the deployment area. Temperature information is used for the generation of realistic workloads and the determination of sensor destruction times that affects the routing decisions in WSN simulations. We present the effects of WSN related factors; such as reporting rate, number of the sinks, and the sink locations together with the effects of environmental factors such as the wind speed and the number of ignition points in terms of temperature reporting performance and freshness of temperature map.","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":"130139640","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. Hussein, H. Noura, Steven Martin, L. Boukhatem, K. A. Agha
In this paper, a new ciphering algorithm is proposed for Long Term Evolution (LTE) data confidentiality. The proposed cipher scheme is based on a novel stream cipher framework which uses Substitution-Diffusion (SD) structure to provide key-streams that possess acceptable cryptographic performance (avalanche effect and key sensibility). Standards have been already adopted by 3GPP for LTE data confidentiality; EEA1, EEA2, and EEA3 which are based on Snow 3G, Advanced Encryption Standard (AES), and ZUC, respectively. Although the above mentioned algorithms have sufficient security strength against attacks, our solution is constructed to ensure less complexity with similar security strength. The proposed algorithm consists of an addition layer and a modified RC6 substitution layer which could require no memory and has stronger cryptographic properties compared to RC6. Furthermore, a new dynamic non-invertible diffusion layer technique is introduced, which is constructed from the output of the substitution layer. Theoretical and simulation results show that our algorithm is immune against liner, differential, chosen/known-plain-text, brute force and statistical attacks. Equally important to note, our proposed cipher algorithm has a lower computational time compared to AES, and could be adapted for other kinds of wireless networks.
{"title":"ERCA: efficient and robust cipher algorithm for LTE data confidentiality","authors":"S. Hussein, H. Noura, Steven Martin, L. Boukhatem, K. A. Agha","doi":"10.1145/2507924.2507946","DOIUrl":"https://doi.org/10.1145/2507924.2507946","url":null,"abstract":"In this paper, a new ciphering algorithm is proposed for Long Term Evolution (LTE) data confidentiality. The proposed cipher scheme is based on a novel stream cipher framework which uses Substitution-Diffusion (SD) structure to provide key-streams that possess acceptable cryptographic performance (avalanche effect and key sensibility). Standards have been already adopted by 3GPP for LTE data confidentiality; EEA1, EEA2, and EEA3 which are based on Snow 3G, Advanced Encryption Standard (AES), and ZUC, respectively. Although the above mentioned algorithms have sufficient security strength against attacks, our solution is constructed to ensure less complexity with similar security strength. The proposed algorithm consists of an addition layer and a modified RC6 substitution layer which could require no memory and has stronger cryptographic properties compared to RC6. Furthermore, a new dynamic non-invertible diffusion layer technique is introduced, which is constructed from the output of the substitution layer. Theoretical and simulation results show that our algorithm is immune against liner, differential, chosen/known-plain-text, brute force and statistical attacks. Equally important to note, our proposed cipher algorithm has a lower computational time compared to AES, and could be adapted for other kinds of wireless networks.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"490 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":"132024798","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}
B. Milosevic, Jinseok Yang, Nakul Verma, S. Tilak, P. Zappi, Elisabetta Farella, L. Benini, T. Simunic
A key factor in a successful sensor network deployment is finding a good balance between maximizing the number of measurements taken (to maintain a good sampling rate) and minimizing the overall energy consumption (to extend the network lifetime). In this work, we present a data-driven statistical model to optimize this tradeoff. Our approach takes advantage of the multivariate nature of the data collected by a heterogeneous sensor network to learn spatio-temporal patterns. These patterns enable us to employ an aggressive duty cycling policy on the individual sensor nodes, thereby reducing the overall energy consumption. Our experiments with the OMNeT++ network simulator using realistic wireless channel conditions, on data collected from two real-world sensor networks, show that we can sample just 20% of the data and can reconstruct the remaining 80% of the data with less than 9% mean error, outperforming similar techniques such is distributed compressive sampling. In addition, energy savings ranging up to 76%, depending on the sampling rate and the hardware configuration of the node.
{"title":"Efficient energy management and data recovery in sensor networks using latent variables based tensor factorization","authors":"B. Milosevic, Jinseok Yang, Nakul Verma, S. Tilak, P. Zappi, Elisabetta Farella, L. Benini, T. Simunic","doi":"10.1145/2507924.2507953","DOIUrl":"https://doi.org/10.1145/2507924.2507953","url":null,"abstract":"A key factor in a successful sensor network deployment is finding a good balance between maximizing the number of measurements taken (to maintain a good sampling rate) and minimizing the overall energy consumption (to extend the network lifetime). In this work, we present a data-driven statistical model to optimize this tradeoff. Our approach takes advantage of the multivariate nature of the data collected by a heterogeneous sensor network to learn spatio-temporal patterns. These patterns enable us to employ an aggressive duty cycling policy on the individual sensor nodes, thereby reducing the overall energy consumption. Our experiments with the OMNeT++ network simulator using realistic wireless channel conditions, on data collected from two real-world sensor networks, show that we can sample just 20% of the data and can reconstruct the remaining 80% of the data with less than 9% mean error, outperforming similar techniques such is distributed compressive sampling. In addition, energy savings ranging up to 76%, depending on the sampling rate and the hardware configuration of the node.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"50 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":"134211785","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}
Building mobile networks, on demand and in an elastic manner, represents a vital solution for mobile operators to cope with the modest Average Revenues per User (ARPU), on one hand, and the ever-increasing mobile data traffic, on the other hand. An important research problem towards this vision of carrier cloud pertains to the development of adequate technologies and methods for the on-demand and dynamic provision of a decentralized and elastic mobile network as a cloud service over a distributed network of cloud-computing data centers, forming a federated cloud. An efficient mobile cloud cannot be built without efficient algorithms for the placement of network functions over this federated cloud. In this vein, this paper argues the need for avoiding or minimizing the frequency of mobility gateway relocations and discusses how this gateway relocation avoidance can be reflected in an efficient network function placement algorithm for the realization of mobile cloud. The proposed scheme is evaluated through computer simulations and encouraging results are obtained.
{"title":"Gateway relocation avoidance-aware network function placement in carrier cloud","authors":"T. Taleb, A. Ksentini","doi":"10.1145/2507924.2508000","DOIUrl":"https://doi.org/10.1145/2507924.2508000","url":null,"abstract":"Building mobile networks, on demand and in an elastic manner, represents a vital solution for mobile operators to cope with the modest Average Revenues per User (ARPU), on one hand, and the ever-increasing mobile data traffic, on the other hand. An important research problem towards this vision of carrier cloud pertains to the development of adequate technologies and methods for the on-demand and dynamic provision of a decentralized and elastic mobile network as a cloud service over a distributed network of cloud-computing data centers, forming a federated cloud. An efficient mobile cloud cannot be built without efficient algorithms for the placement of network functions over this federated cloud. In this vein, this paper argues the need for avoiding or minimizing the frequency of mobility gateway relocations and discusses how this gateway relocation avoidance can be reflected in an efficient network function placement algorithm for the realization of mobile cloud. The proposed scheme is evaluated through computer simulations and encouraging results are obtained.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"137 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":"116206283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Bagchi, M. C. Pinotti, Sainyam Galhotra, Tarun Mangla
We investigate the condition on transmission radius needed to achieve connectivity in duty-cycled wireless sensor networks (briefly, DC-WSN). First, we settle a conjecture of Das et. al. (2012) and prove that the connectivity condition on Random Geometric Graphs (RGG), given by Gupta and Kumar (1989), can be used to derive a weak sufficient condition to achieve connectivity in DC-WSN. We also present a stronger result which gives a necessary and sufficient condition for connectivity and is hence optimal. The optimality of such a radius is also tested via simulation for two specific duty-cycle schemes, called the contiguous and the random selection duty-cycle scheme.
{"title":"Optimal radius for connectivity in duty-cycled wireless sensor networks","authors":"A. Bagchi, M. C. Pinotti, Sainyam Galhotra, Tarun Mangla","doi":"10.1145/2507924.2507985","DOIUrl":"https://doi.org/10.1145/2507924.2507985","url":null,"abstract":"We investigate the condition on transmission radius needed to achieve connectivity in duty-cycled wireless sensor networks (briefly, DC-WSN). First, we settle a conjecture of Das et. al. (2012) and prove that the connectivity condition on Random Geometric Graphs (RGG), given by Gupta and Kumar (1989), can be used to derive a weak sufficient condition to achieve connectivity in DC-WSN. We also present a stronger result which gives a necessary and sufficient condition for connectivity and is hence optimal. The optimality of such a radius is also tested via simulation for two specific duty-cycle schemes, called the contiguous and the random selection duty-cycle scheme.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"86 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":"115443334","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}
Deployment of Smart Grid networks throughout cities introduces a realistic scenario for a large scale sensor network. Smart Meters create a wireless mesh network for receiving commands and sending metering reports back to provider company. The challenges of reliable and timely communication call for a fresh review of the well studied topic of Wireless Sensor Networks (WSN). We provide a centralized MAC solution for data collection, ATR-MAC, that relaxes requirements in general purpose WSNs, but emphasizes on difficulties a Smart Metering deployment will face. ATR-MAC considers variable reuse distances for minimizing propagation delay. It also increases efficiency of collection deadline instead of energy efficiency, a common concern of general-purpose WSN MAC protocols. We provide time and buffer size analysis of our algorithm, prove its correctness and show experimental results using implementation on a testbed.
{"title":"ATR-MAC: deadline driven data collection from smartmeters in absence of aggregation","authors":"Ehsan Nourbakhsh, R. Prakash","doi":"10.1145/2507924.2507963","DOIUrl":"https://doi.org/10.1145/2507924.2507963","url":null,"abstract":"Deployment of Smart Grid networks throughout cities introduces a realistic scenario for a large scale sensor network. Smart Meters create a wireless mesh network for receiving commands and sending metering reports back to provider company. The challenges of reliable and timely communication call for a fresh review of the well studied topic of Wireless Sensor Networks (WSN). We provide a centralized MAC solution for data collection, ATR-MAC, that relaxes requirements in general purpose WSNs, but emphasizes on difficulties a Smart Metering deployment will face. ATR-MAC considers variable reuse distances for minimizing propagation delay. It also increases efficiency of collection deadline instead of energy efficiency, a common concern of general-purpose WSN MAC protocols. We provide time and buffer size analysis of our algorithm, prove its correctness and show experimental results using implementation on a testbed.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"7 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":"125193253","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
扫码关注我们
求助内容：
应助结果提醒方式：