J. Carrera, Zan Li, Zhongliang Zhao, T. Braun, A. Neto
The rapid growth area of ubiquitous applications and location-based services has made indoor localization an interesting topic for research. Some indoor localization solutions for smartphones exploit radio information and Inertial Measurement Units (IMUs), which are embedded in most of the modern smartphones. In this work, we propose to fuse WiFi Receiving Signal Strength Indicator (RSSI) readings, IMUs, and floor plan information in an enhanced particle filter to achieve high accuracy and stable performance in the tracking process. We provide an efficient double resampling method to mitigate errors caused by off-the-shelf IMUs and WiFi sensors embedded in commodity smartphones. The algorithms are designed in a terminal-based system, which consists of commercial smartphones and WiFi access points. We evaluate our system in two complex environments along moving paths. Experiment results show that our tracking method can achieve the average tracking error of $1.01$ meters and $90%$ accuracy of $1.7$ meters.
{"title":"A Real-time Indoor Tracking System in Smartphones","authors":"J. Carrera, Zan Li, Zhongliang Zhao, T. Braun, A. Neto","doi":"10.1145/2988287.2989142","DOIUrl":"https://doi.org/10.1145/2988287.2989142","url":null,"abstract":"The rapid growth area of ubiquitous applications and location-based services has made indoor localization an interesting topic for research. Some indoor localization solutions for smartphones exploit radio information and Inertial Measurement Units (IMUs), which are embedded in most of the modern smartphones. In this work, we propose to fuse WiFi Receiving Signal Strength Indicator (RSSI) readings, IMUs, and floor plan information in an enhanced particle filter to achieve high accuracy and stable performance in the tracking process. We provide an efficient double resampling method to mitigate errors caused by off-the-shelf IMUs and WiFi sensors embedded in commodity smartphones. The algorithms are designed in a terminal-based system, which consists of commercial smartphones and WiFi access points. We evaluate our system in two complex environments along moving paths. Experiment results show that our tracking method can achieve the average tracking error of $1.01$ meters and $90%$ accuracy of $1.7$ meters.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114212281","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}
Yu-Hsuan Chen, Bryan K. F. Ng, Winston K.G. Seah, Ai-Chun Pang
In the Internet of Things(IoT), the size constraint of those small and embedded devices limits the network lifetime because limited energy can be stored on these devices. In recent years, energy harvesting technology has attracted increasing attention, due to its ability to extend the network lifetime significantly. However, the performance of IoT devices powered by energy harvesting sources has not been fully analyzed and understood. In this paper, we model the energy harvesting process in IoT devices using slotted Carrier Sense Multiple Access with Collision Avoidance (CSMA /CA) mechanism of IEEE 802.15.4 standard, and analyze the performance in terms of delay and throughput. Our new model successfully integrates the energy harvesting process and binary backoff process through a unified Markov chain model. Finally, the new model is validated by simulation and the throughput errors between simulation and analytical model are no more than 6%. We demonstrate the application of the model with different energy harvesting rate corresponding to different sources such as solar and vibration energy harvesters.
{"title":"Modeling and Analysis: Energy Harvesting in the Internet of Things","authors":"Yu-Hsuan Chen, Bryan K. F. Ng, Winston K.G. Seah, Ai-Chun Pang","doi":"10.1145/2988287.2989144","DOIUrl":"https://doi.org/10.1145/2988287.2989144","url":null,"abstract":"In the Internet of Things(IoT), the size constraint of those small and embedded devices limits the network lifetime because limited energy can be stored on these devices. In recent years, energy harvesting technology has attracted increasing attention, due to its ability to extend the network lifetime significantly. However, the performance of IoT devices powered by energy harvesting sources has not been fully analyzed and understood. In this paper, we model the energy harvesting process in IoT devices using slotted Carrier Sense Multiple Access with Collision Avoidance (CSMA /CA) mechanism of IEEE 802.15.4 standard, and analyze the performance in terms of delay and throughput. Our new model successfully integrates the energy harvesting process and binary backoff process through a unified Markov chain model. Finally, the new model is validated by simulation and the throughput errors between simulation and analytical model are no more than 6%. We demonstrate the application of the model with different energy harvesting rate corresponding to different sources such as solar and vibration energy harvesters.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123777450","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}
Black-holes, gray-holes and, wormholes, are devastating to the correct operation of any network. These attacks (among others) are based on the premise that packets will travel through compromised nodes, and methods exist to coax routing into these traps. Detection of these attacks are mainly centered around finding the subversion in action. In networks, bottleneck nodes -- those that sit on many potential routes between sender and receiver -- are an optimal location for compromise. Finding naturally occurring path bottlenecks, however, does not entitle network subversion, and as such are more difficult to detect. The dynamic nature of mobile ad-hoc networks (manets) causes ubiquitous routing algorithms to be even more susceptible to this class of attacks. Finding perceived bottlenecks in an olsr based manet, is able to capture between 50%-75% of data. In this paper we propose a method of subtly expanding perceived bottlenecks into complete bottlenecks, raising capture rate up to 99%; albeit, at high cost. We further tune the method to reduce cost, and measure the corresponding capture rate.
{"title":"Neighbor Contamination to Achieve Complete Bottleneck Control","authors":"Nadav Schweitzer, Ariel Stulman, A. Shabtai","doi":"10.1145/2988287.2989146","DOIUrl":"https://doi.org/10.1145/2988287.2989146","url":null,"abstract":"Black-holes, gray-holes and, wormholes, are devastating to the correct operation of any network. These attacks (among others) are based on the premise that packets will travel through compromised nodes, and methods exist to coax routing into these traps. Detection of these attacks are mainly centered around finding the subversion in action. In networks, bottleneck nodes -- those that sit on many potential routes between sender and receiver -- are an optimal location for compromise. Finding naturally occurring path bottlenecks, however, does not entitle network subversion, and as such are more difficult to detect. The dynamic nature of mobile ad-hoc networks (manets) causes ubiquitous routing algorithms to be even more susceptible to this class of attacks. Finding perceived bottlenecks in an olsr based manet, is able to capture between 50%-75% of data. In this paper we propose a method of subtly expanding perceived bottlenecks into complete bottlenecks, raising capture rate up to 99%; albeit, at high cost. We further tune the method to reduce cost, and measure the corresponding capture rate.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125022645","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}
Meriam Bouzouita, Y. H. Aoul, N. Zangar, G. Rubino, S. Tabbane
The massive deployment of Machine-to-machine (M2M) communications may overwhelm the cellular network by imposing strong constraints on the Radio Access Network (RAN). As the base station cannot accurately get the exact number of M2M arrivals, it cannot really predict the overload status. Consequently, a better estimation of this number would efficiently help to overcome the risk of congestion. In this paper, we proposed a novel fluid model for M2M communications, which allows gaining an enhanced understanding of the dynamics of such systems. The provided analysis of the model was used to devise a new method to estimate accurately the number of M2M devices. We proposed, then, a novel implementation of the ACB process, which dynamically computes the ACB factor according to the network's overload conditions while includes a corrective action adapting the controller action based on the mismatch existing between the computed and the targeted mean load. The simulation results show that the proposed algorithms allow improving considerably the estimation of the number of M2M devices' arrivals, while outperforming existing techniques.
{"title":"Dynamic Adaptive Access Barring Scheme For Heavily Congested M2M Networks","authors":"Meriam Bouzouita, Y. H. Aoul, N. Zangar, G. Rubino, S. Tabbane","doi":"10.1145/2988287.2989174","DOIUrl":"https://doi.org/10.1145/2988287.2989174","url":null,"abstract":"The massive deployment of Machine-to-machine (M2M) communications may overwhelm the cellular network by imposing strong constraints on the Radio Access Network (RAN). As the base station cannot accurately get the exact number of M2M arrivals, it cannot really predict the overload status. Consequently, a better estimation of this number would efficiently help to overcome the risk of congestion. In this paper, we proposed a novel fluid model for M2M communications, which allows gaining an enhanced understanding of the dynamics of such systems. The provided analysis of the model was used to devise a new method to estimate accurately the number of M2M devices. We proposed, then, a novel implementation of the ACB process, which dynamically computes the ACB factor according to the network's overload conditions while includes a corrective action adapting the controller action based on the mismatch existing between the computed and the targeted mean load. The simulation results show that the proposed algorithms allow improving considerably the estimation of the number of M2M devices' arrivals, while outperforming existing techniques.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114807695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the developing of Internet, network intrusion has become more and more common. Quickly identifying and preventing network attacks is getting increasingly more important and difficult. Machine learning techniques have already proven to be robust methods in detecting malicious activities and network threats. Ensemble-based and semi-supervised learning methods are some of the areas that receive most attention in machine learning today. However relatively little attention has been given in combining these methods. To overcome such limitations, this paper proposes a novel network anomaly detection method by using a combination of a tri-training approach with Adaboost algorithms. The bootstrap samples of tri-training are replaced by three different Adaboost algorithms to create the diversity. We run 30 iteration for every simulation to obtain the average results. Simulations indicate that our proposed semi-supervised Adaboost algorithm is reproducible and consistent over a different number of runs. It outperforms other state-of-the-art learning algorithms, even with a small part of labeled data in the training phase. Specifically, it has a very short execution time and a good balance between the detection rate as well as the false-alarm rate.
{"title":"A Novel Semi-Supervised Adaboost Technique for Network Anomaly Detection","authors":"Yali Yuan, Georgios Kaklamanos, D. Hogrefe","doi":"10.1145/2988287.2989177","DOIUrl":"https://doi.org/10.1145/2988287.2989177","url":null,"abstract":"With the developing of Internet, network intrusion has become more and more common. Quickly identifying and preventing network attacks is getting increasingly more important and difficult. Machine learning techniques have already proven to be robust methods in detecting malicious activities and network threats. Ensemble-based and semi-supervised learning methods are some of the areas that receive most attention in machine learning today. However relatively little attention has been given in combining these methods. To overcome such limitations, this paper proposes a novel network anomaly detection method by using a combination of a tri-training approach with Adaboost algorithms. The bootstrap samples of tri-training are replaced by three different Adaboost algorithms to create the diversity. We run 30 iteration for every simulation to obtain the average results. Simulations indicate that our proposed semi-supervised Adaboost algorithm is reproducible and consistent over a different number of runs. It outperforms other state-of-the-art learning algorithms, even with a small part of labeled data in the training phase. Specifically, it has a very short execution time and a good balance between the detection rate as well as the false-alarm rate.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121775213","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}
Wearable devices, which are small electronic devices worn on a human body, are equipped with low level of processing and storage capacities and offer some types of integrated functionalities. Recently, wearable device is becoming increasingly popular, various kinds of wearable device are launched in the market; however, wearable devices require a powerful local-hub, most are smartphone, to replenish processing and storage capacities for advanced functionalities. Sometime it may be inconvenient to carry the local-hub (smartphone); thus, many wearable devices are equipped with Wi-Fi interface, enabling them to exchange data with local-hub though the Internet when the local-hub is not nearby. However, this results in long response time and restricted functionalities. In this paper, we present a virtual local-hub solution, which utilizes network equipment nearby (e.g., Wi-Fi APs) as the local-hub. Since migrating all applications serving the wearable devices respectively takes too much networking and storage resources, the proposed solution deploys function modules to multiple network nodes and enables remote function module sharing among different users and applications. To reduce the impact of the solution on the network bandwidth, we propose a heuristic algorithm for function module allocation with the objective of minimizing total bandwidth consumption. We conduct series of experiments, and the results show that the proposed solution can reduce the bandwidth consumption by up to half and still serve all requests given a large number of service requests.
{"title":"A Virtual Local-hub Solution with Function Module Sharing for Wearable Devices","authors":"Hsin-Peng Lin, Yuan-Yao Shih, Ai-Chun Pang, Yuan-Yao Lou","doi":"10.1145/2988287.2989150","DOIUrl":"https://doi.org/10.1145/2988287.2989150","url":null,"abstract":"Wearable devices, which are small electronic devices worn on a human body, are equipped with low level of processing and storage capacities and offer some types of integrated functionalities. Recently, wearable device is becoming increasingly popular, various kinds of wearable device are launched in the market; however, wearable devices require a powerful local-hub, most are smartphone, to replenish processing and storage capacities for advanced functionalities. Sometime it may be inconvenient to carry the local-hub (smartphone); thus, many wearable devices are equipped with Wi-Fi interface, enabling them to exchange data with local-hub though the Internet when the local-hub is not nearby. However, this results in long response time and restricted functionalities. In this paper, we present a virtual local-hub solution, which utilizes network equipment nearby (e.g., Wi-Fi APs) as the local-hub. Since migrating all applications serving the wearable devices respectively takes too much networking and storage resources, the proposed solution deploys function modules to multiple network nodes and enables remote function module sharing among different users and applications. To reduce the impact of the solution on the network bandwidth, we propose a heuristic algorithm for function module allocation with the objective of minimizing total bandwidth consumption. We conduct series of experiments, and the results show that the proposed solution can reduce the bandwidth consumption by up to half and still serve all requests given a large number of service requests.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"89 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114935111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper focuses on targeted advertising for vehicular users, where users receive advertisements (ads) from roadside units and the vehicle onboard system displays only ads that are relevant to the user. A broker broadcasts ads and is paid by advertisers based on the number of vehicles that displayed each ad. The problem we study is the following: given that the broker can broadcast a limited number of ads, what is the strategy for ad selection that maximizes the broker's revenue? We first identify the conflict existing between users' interests and broker's revenue as a critical feature of this scenario, which may dramatically reduce the broker's revenue. Then, given the problem complexity, we propose Volfied, an algorithm that solves this conflict, allows for near-optimal broker's revenue and has very limited computational complexity. Our results show that Volfied increases the broker's revenue by up to 70% with respect to state-of-the-art alternatives.
{"title":"Effective Selection of Targeted Advertisements for Vehicular Users","authors":"Gil Einziger, C. Chiasserini, F. Malandrino","doi":"10.1145/2988287.2989136","DOIUrl":"https://doi.org/10.1145/2988287.2989136","url":null,"abstract":"This paper focuses on targeted advertising for vehicular users, where users receive advertisements (ads) from roadside units and the vehicle onboard system displays only ads that are relevant to the user. A broker broadcasts ads and is paid by advertisers based on the number of vehicles that displayed each ad. The problem we study is the following: given that the broker can broadcast a limited number of ads, what is the strategy for ad selection that maximizes the broker's revenue? We first identify the conflict existing between users' interests and broker's revenue as a critical feature of this scenario, which may dramatically reduce the broker's revenue. Then, given the problem complexity, we propose Volfied, an algorithm that solves this conflict, allows for near-optimal broker's revenue and has very limited computational complexity. Our results show that Volfied increases the broker's revenue by up to 70% with respect to state-of-the-art alternatives.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114109039","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}
Wenjie Li, Zheng Qin, H. Yin, Rui Li, L. Ou, Heng Li
Software-Defined Networks (SDN) is a trend of research in networks. Rule placement, a common operation for network administrators, has become more complicated due to the capacity limitation of devices in which the large number of rules are deployed. Prior works on rule placement mostly consider the influence on rule placement incurred by the rules in a single device. However, the position relationships between neighbor devices have influences on rule placement. Our basic idea is to classify the position relationships into two categories: the serial relationship and the parallel relationship, and we present a novel strategy for rule placement based on the two different position relationships. There are two challenges of implementing our strategies: to check whether a rule is contained by a rule set or not and to check whether a rule can be merged by other rules or not.To overcome the challenges, we propose a novel data structure called OPTree to represent the rules, which is convenient to check whether a rule is covered by other rules. We design the insertion algorithm and search algorithm for OPTree. Extensive experiments show that our approach can effectively reduce the number of rules while ensuring placed rules work. On the other hand, the experimental results also demonstrate that it is necessary to consider the position relationships between neighbor devices when placing rules.
{"title":"An Approach to Rule Placement in Software-Defined Networks","authors":"Wenjie Li, Zheng Qin, H. Yin, Rui Li, L. Ou, Heng Li","doi":"10.1145/2988287.2989170","DOIUrl":"https://doi.org/10.1145/2988287.2989170","url":null,"abstract":"Software-Defined Networks (SDN) is a trend of research in networks. Rule placement, a common operation for network administrators, has become more complicated due to the capacity limitation of devices in which the large number of rules are deployed. Prior works on rule placement mostly consider the influence on rule placement incurred by the rules in a single device. However, the position relationships between neighbor devices have influences on rule placement. Our basic idea is to classify the position relationships into two categories: the serial relationship and the parallel relationship, and we present a novel strategy for rule placement based on the two different position relationships. There are two challenges of implementing our strategies: to check whether a rule is contained by a rule set or not and to check whether a rule can be merged by other rules or not.To overcome the challenges, we propose a novel data structure called OPTree to represent the rules, which is convenient to check whether a rule is covered by other rules. We design the insertion algorithm and search algorithm for OPTree. Extensive experiments show that our approach can effectively reduce the number of rules while ensuring placed rules work. On the other hand, the experimental results also demonstrate that it is necessary to consider the position relationships between neighbor devices when placing rules.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133399834","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}
Network Function Virtualisation (NFV) represents a promising solution for wireless network operators to improve business agility and cope with the continuing growth in data traffic. Furthermore, by virtualizing core network functions as well as radio-access network functions, NFV can effectively reduce the cost to deploy and operate large wireless networks. Face to this technology revolution, a new underlying cloud architecture is emerging. This architecture is based on the combination of edge clouds and a centralized cloud, referred to as the edge-central cloud. This notably improves user experience while ensuring scalability and load balancing. In such carrier cloud environment, efficient management mechanisms for the Virtual Network Functions (VNFs) are of crucial importance. In this paper, we introduce VNF placement and provisioning optimization strategies over an edge-central carrier cloud infrastructure taking into account QoS requirements (i.e., response time, latency constraints and real-time requirements) and using analytical and QoS models. Our main design goals are to optimize resource utilization, to prevent cloudlet overload, and to avoid violation of SLA requirements. We propose different solutions to achieve a trade-off between these conflicting objectives according to the wireless operator requirements. These solutions are evaluated through extensive simulations using different performance metrics and encouraging results are obtained.
{"title":"Analytical Models for QoS-driven VNF Placement and Provisioning in Wireless Carrier Cloud","authors":"F. Jemaa, G. Pujolle, Michel Pariente","doi":"10.1145/2988287.2989154","DOIUrl":"https://doi.org/10.1145/2988287.2989154","url":null,"abstract":"Network Function Virtualisation (NFV) represents a promising solution for wireless network operators to improve business agility and cope with the continuing growth in data traffic. Furthermore, by virtualizing core network functions as well as radio-access network functions, NFV can effectively reduce the cost to deploy and operate large wireless networks. Face to this technology revolution, a new underlying cloud architecture is emerging. This architecture is based on the combination of edge clouds and a centralized cloud, referred to as the edge-central cloud. This notably improves user experience while ensuring scalability and load balancing. In such carrier cloud environment, efficient management mechanisms for the Virtual Network Functions (VNFs) are of crucial importance. In this paper, we introduce VNF placement and provisioning optimization strategies over an edge-central carrier cloud infrastructure taking into account QoS requirements (i.e., response time, latency constraints and real-time requirements) and using analytical and QoS models. Our main design goals are to optimize resource utilization, to prevent cloudlet overload, and to avoid violation of SLA requirements. We propose different solutions to achieve a trade-off between these conflicting objectives according to the wireless operator requirements. These solutions are evaluated through extensive simulations using different performance metrics and encouraging results are obtained.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134404059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the advent of Internet of Things (IoT), an increasing number of devices may spontaneously communicate to exchange information. This puts emphasis on wireless sensor networks (WSNs) and, in particular, on intelligent medium access control (MAC) protocols, as there is a need to guarantee a certain quality of service (QoS) on timely data/packet delivery. Most existing approaches, however, are either of random nature, making it impossible to guarantee any bounded delay, or do not scale well for a higher number of nodes. As a result, we propose slot sharing TDMAs², a deterministic contention resolution scheme in form of generating TDMA cycles with shared slots at the event of collisions. Every TDMA slot is assigned to a range of IDs, in which the corresponding nodes can transmit. By further dividing these slots in case of collisions, we implement an interval tree search enabling for fast collision resolution in logŝ-complexity, where ŝ is the number of slots in each cycle. Since our scheme is activated upon collisions, it incurs in zero overhead during normal operation and is able to quickly react to changing traffic load such as bursty traffic. We perform a large set of detailed simulations on OMNeT++ showing that our technique offers a fast collision resolution and is able to handle a large number of nodes in the network.
{"title":"A Slot Sharing TDMA Scheme for Reliable and Efficient Collision Resolution in WSNs","authors":"Philip Parsch, Alejandro Masrur","doi":"10.1145/2988287.2989164","DOIUrl":"https://doi.org/10.1145/2988287.2989164","url":null,"abstract":"With the advent of Internet of Things (IoT), an increasing number of devices may spontaneously communicate to exchange information. This puts emphasis on wireless sensor networks (WSNs) and, in particular, on intelligent medium access control (MAC) protocols, as there is a need to guarantee a certain quality of service (QoS) on timely data/packet delivery. Most existing approaches, however, are either of random nature, making it impossible to guarantee any bounded delay, or do not scale well for a higher number of nodes. As a result, we propose slot sharing TDMAs², a deterministic contention resolution scheme in form of generating TDMA cycles with shared slots at the event of collisions. Every TDMA slot is assigned to a range of IDs, in which the corresponding nodes can transmit. By further dividing these slots in case of collisions, we implement an interval tree search enabling for fast collision resolution in logŝ-complexity, where ŝ is the number of slots in each cycle. Since our scheme is activated upon collisions, it incurs in zero overhead during normal operation and is able to quickly react to changing traffic load such as bursty traffic. We perform a large set of detailed simulations on OMNeT++ showing that our technique offers a fast collision resolution and is able to handle a large number of nodes in the network.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132862358","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
扫码关注我们
求助内容：
应助结果提醒方式：