Pub Date : 2016-07-28DOI: 10.1109/WoWMoM.2016.7523580
T. Xu, I. Darwazeh
We comprehensively summarize experimental validations 1 of bandwidth compressed multicarrier waveforms for future 5th generation (5G) applications. The proposed waveforms are derived from an existing non-orthogonal multicarrier concept termed spectrally efficient frequency division multiplexing (SEFDM) where sub-carriers are non-orthogonally packed at frequencies below the symbol rate. This improves the spectral efficiency at the cost of self-created inter carrier interference (ICI). In this work, experiments are reported and testing is carried out in three scenarios including long term evolution (LTE)-like wireless link; millimeter wave radio-over-fiber (RoF) link and optical fiber link. In the first scenario, for a given 25 MHz bandwidth, the SEFDM testbed can provide 70 Mbit/s gross data rate while only 50 Mbit/s can be achieved for an OFDM system occupying the same bandwidth. For the millimeter wave experiment, occupying a 1.125 GHz bandwidth, the gross bit rate for OFDM is 2.25 Gbit/s and with 40% bandwidth compression, 3.75 Gbit/s can be achieved for SEFDM. Two experimental optical fiber links are described in this work; a 10 Gbit/s direct detection optical SEFDM system and a 24 Gbit/s coherent detection SEFDM system. The LTE-like signals and millimeter wave technologies are well suited to provide last mile communications to end users as both can support mobility in wireless environments. The lightwave signals delivered by optical fibers would offer higher data rates and support long-haul communications. The reported techniques, used individually or combined, would be of interest to future wireless system designers, where bandwidth saving is of importance, such as in 5G networks, aiming to provide high capacity and high mobility, simultaneously while saving spectrum.
{"title":"Experimental validations of bandwidth compressed multicarrier signals","authors":"T. Xu, I. Darwazeh","doi":"10.1109/WoWMoM.2016.7523580","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523580","url":null,"abstract":"We comprehensively summarize experimental validations 1 of bandwidth compressed multicarrier waveforms for future 5th generation (5G) applications. The proposed waveforms are derived from an existing non-orthogonal multicarrier concept termed spectrally efficient frequency division multiplexing (SEFDM) where sub-carriers are non-orthogonally packed at frequencies below the symbol rate. This improves the spectral efficiency at the cost of self-created inter carrier interference (ICI). In this work, experiments are reported and testing is carried out in three scenarios including long term evolution (LTE)-like wireless link; millimeter wave radio-over-fiber (RoF) link and optical fiber link. In the first scenario, for a given 25 MHz bandwidth, the SEFDM testbed can provide 70 Mbit/s gross data rate while only 50 Mbit/s can be achieved for an OFDM system occupying the same bandwidth. For the millimeter wave experiment, occupying a 1.125 GHz bandwidth, the gross bit rate for OFDM is 2.25 Gbit/s and with 40% bandwidth compression, 3.75 Gbit/s can be achieved for SEFDM. Two experimental optical fiber links are described in this work; a 10 Gbit/s direct detection optical SEFDM system and a 24 Gbit/s coherent detection SEFDM system. The LTE-like signals and millimeter wave technologies are well suited to provide last mile communications to end users as both can support mobility in wireless environments. The lightwave signals delivered by optical fibers would offer higher data rates and support long-haul communications. The reported techniques, used individually or combined, would be of interest to future wireless system designers, where bandwidth saving is of importance, such as in 5G networks, aiming to provide high capacity and high mobility, simultaneously while saving spectrum.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133197481","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}
Advances in device-to-device (D2D) ecosystems have brought on mobile applications that utilise nearby mobile devices in order to improve users' quality of experience (QoE). The interactions between the mobile devices have to be transparent to the end users and can be of many services - opportunistic networking, traffic offloading, computation offloading, cooperative streaming and P2P based k-anonymity location privacy service, to name a few. Whenever mobile users are willing to “ask for help” from their neighbours, they need to make non trivial decisions in order to maximise their utility. Current motivation approaches for mobile users that participate in such environments are of two types: (i) credit-based and (ii) reputation-based. These approaches rely either on centralised authorities or require prohibitively many messages or require tamper resistant security modules. In this paper we propose a trust-based approach that does not require synchronisation between the mobile users. Moreover, we present the three-way tradeoff between, consistency, message exchange and awareness and we conclude that our approach can provide first-rate data to neighbour selection mechanisms for D2D ecosystems with much less overhead.
{"title":"Asynchronous reputation systems in device-to-device ecosystems","authors":"Dimitris Chatzopoulos, P. Hui","doi":"10.1145/2944789.2944873","DOIUrl":"https://doi.org/10.1145/2944789.2944873","url":null,"abstract":"Advances in device-to-device (D2D) ecosystems have brought on mobile applications that utilise nearby mobile devices in order to improve users' quality of experience (QoE). The interactions between the mobile devices have to be transparent to the end users and can be of many services - opportunistic networking, traffic offloading, computation offloading, cooperative streaming and P2P based k-anonymity location privacy service, to name a few. Whenever mobile users are willing to “ask for help” from their neighbours, they need to make non trivial decisions in order to maximise their utility. Current motivation approaches for mobile users that participate in such environments are of two types: (i) credit-based and (ii) reputation-based. These approaches rely either on centralised authorities or require prohibitively many messages or require tamper resistant security modules. In this paper we propose a trust-based approach that does not require synchronisation between the mobile users. Moreover, we present the three-way tradeoff between, consistency, message exchange and awareness and we conclude that our approach can provide first-rate data to neighbour selection mechanisms for D2D ecosystems with much less overhead.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126627338","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}
Pub Date : 2016-06-21DOI: 10.1109/WoWMoM.2016.7523533
Francesco Restuccia, A. Saracino, Sajal K. Das, F. Martinelli
The reliability of location-based services (LBS) is strongly dependent on the accuracy of the location of the users. However, existing LBS systems are not able to efficiently validate the position of users in large-scale outdoor environments, leading to possible location spoofing attacks by malicious users. To this end, we present an efficient and scalable Location Validation System (LVS) that secures LBS systems from location spoofing attacks. In particular, the user location is verified with the help of mobile WiFi hotspots (MHSs), who are users activating the WiFi hotspot capability of their smartphones and accept connections from nearby users, thereby validating their position inside the sensing area. The system also comprises a novel verification technique called Chains of Sight, which tackles collusion-based attacks effectively. LVS also includes a reputation-based algorithm that rules out sensing reports of location-spoofing users.
基于位置的服务(LBS)的可靠性很大程度上依赖于用户位置的准确性。然而，现有的LBS系统无法在大规模的户外环境中有效地验证用户的位置，可能会受到恶意用户的位置欺骗攻击。为此，我们提出了一种高效且可扩展的位置验证系统(LVS)，可以保护LBS系统免受位置欺骗攻击。特别是，通过移动WiFi热点(mhs)来验证用户的位置，mhs是指激活智能手机的WiFi热点功能，接受附近用户的连接，从而验证其在传感区域内的位置。该系统还包括一种名为“视线链”(Chains of Sight)的新型验证技术，可以有效地应对基于串通的攻击。LVS还包括一个基于声誉的算法，可以排除对位置欺骗用户的感知报告。
{"title":"LVS: A WiFi-based system to tackle Location Spoofing in location-based services","authors":"Francesco Restuccia, A. Saracino, Sajal K. Das, F. Martinelli","doi":"10.1109/WoWMoM.2016.7523533","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523533","url":null,"abstract":"The reliability of location-based services (LBS) is strongly dependent on the accuracy of the location of the users. However, existing LBS systems are not able to efficiently validate the position of users in large-scale outdoor environments, leading to possible location spoofing attacks by malicious users. To this end, we present an efficient and scalable Location Validation System (LVS) that secures LBS systems from location spoofing attacks. In particular, the user location is verified with the help of mobile WiFi hotspots (MHSs), who are users activating the WiFi hotspot capability of their smartphones and accept connections from nearby users, thereby validating their position inside the sensing area. The system also comprises a novel verification technique called Chains of Sight, which tackles collusion-based attacks effectively. LVS also includes a reputation-based algorithm that rules out sensing reports of location-spoofing users.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123483532","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}
Pub Date : 2016-06-21DOI: 10.1109/WoWMoM.2016.7523549
Tuan Le, H. Kalantarian, M. Gerla
Due to the unstable network topology of Delay Tolerant Networks (DTNs), multi-copy routing is often used to increase the reliability of message delivery. However, this routing approach suffers from high buffer and bandwidth overhead. While much work has been done in the design of forwarding algorithms, little work has focused on studying forwarding under the presence of resource constraints such as short contact durations and small buffers. In this paper, we investigate a multi-copy routing strategy and a buffer management policy that maximize the delivery rate in DTNs. We consider a realistic DTN environment with resource constraints, heterogeneous node mobility, and varied message sizes. There are three key issues in DTN routing: (1) to which next hop relay node should messages be replicated, (2) in which order should messages be replicated, and (3) which messages should be dropped first when the buffer is full. We propose to forward a message to a neighboring node that has both a stronger social tie with the destination and a smaller or similar queue length. This aims to reduce traffic at highly connected network nodes, avoiding frequent message drops which compromise the delivery ratio. For the second and third issue, we develop a utility function using global network information to compute per-packet delivery rate utility. Messages are then scheduled and dropped according to their utility values. Extensive simulation results based on the real-world San Francisco cab trace show that our proposed scheme can achieve a delivery rate of up to 22% higher than existing schemes, while still maintaining a comparable average delivery delay. Furthermore, our scheme distributes the network loads more evenly, with the top 10% of network nodes handling only 24% of the forwardings.
{"title":"A joint relay selection and buffer management scheme for delivery rate optimization in DTNs","authors":"Tuan Le, H. Kalantarian, M. Gerla","doi":"10.1109/WoWMoM.2016.7523549","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523549","url":null,"abstract":"Due to the unstable network topology of Delay Tolerant Networks (DTNs), multi-copy routing is often used to increase the reliability of message delivery. However, this routing approach suffers from high buffer and bandwidth overhead. While much work has been done in the design of forwarding algorithms, little work has focused on studying forwarding under the presence of resource constraints such as short contact durations and small buffers. In this paper, we investigate a multi-copy routing strategy and a buffer management policy that maximize the delivery rate in DTNs. We consider a realistic DTN environment with resource constraints, heterogeneous node mobility, and varied message sizes. There are three key issues in DTN routing: (1) to which next hop relay node should messages be replicated, (2) in which order should messages be replicated, and (3) which messages should be dropped first when the buffer is full. We propose to forward a message to a neighboring node that has both a stronger social tie with the destination and a smaller or similar queue length. This aims to reduce traffic at highly connected network nodes, avoiding frequent message drops which compromise the delivery ratio. For the second and third issue, we develop a utility function using global network information to compute per-packet delivery rate utility. Messages are then scheduled and dropped according to their utility values. Extensive simulation results based on the real-world San Francisco cab trace show that our proposed scheme can achieve a delivery rate of up to 22% higher than existing schemes, while still maintaining a comparable average delivery delay. Furthermore, our scheme distributes the network loads more evenly, with the top 10% of network nodes handling only 24% of the forwardings.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122500535","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}
Pub Date : 2016-06-21DOI: 10.1109/WoWMoM.2016.7523568
Atsushi Fujita, H. Yamaguchi, T. Higashino, M. Takai
In recent years, several advanced safety techniques have been put to practical use for supporting safe driving, ASV (Advanced Safety Vehicle) can detect the presence of surrounding vehicles and pedestrians autonomously. On the other hand, cooperative techniques such as cooperative vehicle-to-vehicle awareness have attracted a lot of attentions in the field of ITS. In this paper, we propose a method for identifying positional relationship of vehicle groups. In the proposed method, connected vehicles share surrounding vehicles' positions detected by installed range sensors via inter-vehicle communication. By composing those pieces of information into a single view, each connected vehicle can recognize the vehicle group ahead, which cannot be recognized standalone. By utilizing the distance information from two different information sources and executing the matching process, the correct positional relationship among neighboring vehicles can obtain. We have conducted a simulation-based experiment using two types of data to evaluate the effectiveness of the approach, and we have confirmed to achieve the correct identification with high probability by using shared velocity information.
{"title":"A study on identification of laser-tracked vehicles using V2V-based velocity information","authors":"Atsushi Fujita, H. Yamaguchi, T. Higashino, M. Takai","doi":"10.1109/WoWMoM.2016.7523568","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523568","url":null,"abstract":"In recent years, several advanced safety techniques have been put to practical use for supporting safe driving, ASV (Advanced Safety Vehicle) can detect the presence of surrounding vehicles and pedestrians autonomously. On the other hand, cooperative techniques such as cooperative vehicle-to-vehicle awareness have attracted a lot of attentions in the field of ITS. In this paper, we propose a method for identifying positional relationship of vehicle groups. In the proposed method, connected vehicles share surrounding vehicles' positions detected by installed range sensors via inter-vehicle communication. By composing those pieces of information into a single view, each connected vehicle can recognize the vehicle group ahead, which cannot be recognized standalone. By utilizing the distance information from two different information sources and executing the matching process, the correct positional relationship among neighboring vehicles can obtain. We have conducted a simulation-based experiment using two types of data to evaluate the effectiveness of the approach, and we have confirmed to achieve the correct identification with high probability by using shared velocity information.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117315592","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}
Pub Date : 2016-06-21DOI: 10.1109/WoWMoM.2016.7523556
P. Kamaraju, P. Lungaro, Z. Segall
The explosion of traffic associated with video content poses significant challenges for mobile content provision. While, on the one hand, mobile video traffic surge is forecast-ed to require significant investments in bandwidth acquisition and infrastructure dimensioning and roll-out, on the other hand, users are not likely to be willing to pay significantly more than today. This increases the pressure to develop solutions capable of making the mobile provision of video more affordable without either affecting user experience or limiting usage. In this respect, this paper proposes a novel methodology for video content delivery which is based on a user video quality perception model. According to this scheme, the video quality of each scene in a movie is selected, from among a finite set of available qualities, with the purpose of reducing the overall bandwidth required to attain a given user experience level targeted by the system for each user and each video. This novel methodology also adopts a clustering approach to identify users with similar Quality of Experience (QoE) profiles and leverages this information for improving the accuracy of user perceived quality predictions. This approach has been validated through a crowd-sourced subjective test evaluation performed with real users using a novel method involving the Amazon Mechanical Turk platform. The results showed that the proposed method is capable of achieving a prediction accuracy in the order of ±0.5 MOS points. This approach can be effectively used to select the video qualities minimizing bandwidth costs while delivering predefined level of perceived quality to the end users.
{"title":"QoE aware video content adaptation and delivery","authors":"P. Kamaraju, P. Lungaro, Z. Segall","doi":"10.1109/WoWMoM.2016.7523556","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523556","url":null,"abstract":"The explosion of traffic associated with video content poses significant challenges for mobile content provision. While, on the one hand, mobile video traffic surge is forecast-ed to require significant investments in bandwidth acquisition and infrastructure dimensioning and roll-out, on the other hand, users are not likely to be willing to pay significantly more than today. This increases the pressure to develop solutions capable of making the mobile provision of video more affordable without either affecting user experience or limiting usage. In this respect, this paper proposes a novel methodology for video content delivery which is based on a user video quality perception model. According to this scheme, the video quality of each scene in a movie is selected, from among a finite set of available qualities, with the purpose of reducing the overall bandwidth required to attain a given user experience level targeted by the system for each user and each video. This novel methodology also adopts a clustering approach to identify users with similar Quality of Experience (QoE) profiles and leverages this information for improving the accuracy of user perceived quality predictions. This approach has been validated through a crowd-sourced subjective test evaluation performed with real users using a novel method involving the Amazon Mechanical Turk platform. The results showed that the proposed method is capable of achieving a prediction accuracy in the order of ±0.5 MOS points. This approach can be effectively used to select the video qualities minimizing bandwidth costs while delivering predefined level of perceived quality to the end users.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129367037","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}
Pub Date : 2016-06-21DOI: 10.1109/WoWMoM.2016.7523517
Domenico De Guglielmo, Simone Brienza, G. Anastasi
Time Slotted Channel Hopping (TSCH) is an emerging MAC protocol defined in the IEEE 802.15.4e standard. By combining time slotted access with multi-channel and channel hopping capabilities, it is particularly suitable for critical applications that require high reliability and deterministic latency. In this paper we focus on the formation process of TSCH networks. This relies on periodic advertisement of Enhanced Beacons (EBs), however, the standard does not specify any advertising strategy. By taking a theoretical approach, we first derive a general model of the network formation process and provide an analytical formulation of the average joining time (i.e., the time taken by a node to join the network). Then, we derive an optimal strategy for scheduling EB transmissions that minimizes the average joining time. Finally, we propose a new Model-based Beacon Scheduling (MBS) algorithm that approximates the optimal strategy in real networks. We evaluate the performance of MBS by simulation. Our results show that the proposed algorithm outperforms previous solutions present in the literature.
{"title":"A Model-based Beacon Scheduling algorithm for IEEE 802.15.4e TSCH networks","authors":"Domenico De Guglielmo, Simone Brienza, G. Anastasi","doi":"10.1109/WoWMoM.2016.7523517","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523517","url":null,"abstract":"Time Slotted Channel Hopping (TSCH) is an emerging MAC protocol defined in the IEEE 802.15.4e standard. By combining time slotted access with multi-channel and channel hopping capabilities, it is particularly suitable for critical applications that require high reliability and deterministic latency. In this paper we focus on the formation process of TSCH networks. This relies on periodic advertisement of Enhanced Beacons (EBs), however, the standard does not specify any advertising strategy. By taking a theoretical approach, we first derive a general model of the network formation process and provide an analytical formulation of the average joining time (i.e., the time taken by a node to join the network). Then, we derive an optimal strategy for scheduling EB transmissions that minimizes the average joining time. Finally, we propose a new Model-based Beacon Scheduling (MBS) algorithm that approximates the optimal strategy in real networks. We evaluate the performance of MBS by simulation. Our results show that the proposed algorithm outperforms previous solutions present in the literature.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"23 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116264804","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}
Pub Date : 2016-06-21DOI: 10.1109/WoWMoM.2016.7523506
Luigi Vigneri, T. Spyropoulos, C. Barakat
The increasing demand for mobile data is overloading the cellular infrastructure. Small cells and edge caching is being explored as an alternative, but installation and maintenance costs for sufficient coverage are significant. In this work, we perform a preliminary study of an alternative architecture based on two main ideas: (i) using vehicles as mobile caches that can be accessed by user devices; compared to small cells, vehicles are more widespread and require lower costs; (ii) combining the mobility of vehicles with delayed content access to increase the number of cache hits (and reduce the load on the infrastructure). Contrary to standard DTN-type approaches, in our system max delays are guaranteed to be kept to a few minutes (beyond this deadline, the content is fetched from the infrastructure). We first propose an analytical framework to compute the optimal number of content replicas that one should cache, in order to minimize the infrastructure load. We then investigate how to optimally refresh these caches to introduce new contents, as well as to react to the temporal variability in content popularity. Simulations suggest that our vehicular cloud considerably reduces the infrastructure load in urban settings, assuming modest penetration rates and tolerable content access delays.
{"title":"Storage on wheels: Offloading popular contents through a vehicular cloud","authors":"Luigi Vigneri, T. Spyropoulos, C. Barakat","doi":"10.1109/WoWMoM.2016.7523506","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523506","url":null,"abstract":"The increasing demand for mobile data is overloading the cellular infrastructure. Small cells and edge caching is being explored as an alternative, but installation and maintenance costs for sufficient coverage are significant. In this work, we perform a preliminary study of an alternative architecture based on two main ideas: (i) using vehicles as mobile caches that can be accessed by user devices; compared to small cells, vehicles are more widespread and require lower costs; (ii) combining the mobility of vehicles with delayed content access to increase the number of cache hits (and reduce the load on the infrastructure). Contrary to standard DTN-type approaches, in our system max delays are guaranteed to be kept to a few minutes (beyond this deadline, the content is fetched from the infrastructure). We first propose an analytical framework to compute the optimal number of content replicas that one should cache, in order to minimize the infrastructure load. We then investigate how to optimally refresh these caches to introduce new contents, as well as to react to the temporal variability in content popularity. Simulations suggest that our vehicular cloud considerably reduces the infrastructure load in urban settings, assuming modest penetration rates and tolerable content access delays.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126531267","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}
Pub Date : 2016-06-21DOI: 10.1109/WOWMOM.2016.7523536
Duarte M. G. Raposo, A. Rodrigues, J. Silva, F. Boavida, Jose E. G. Oliveira, Carlos Herrera, Carlos Egas
Over the last years, Wireless Sensor Networks (WSN) went from being a promising technology for countless industrial applications to a de facto technology used in todays' applications. WSNs have been gaining momentum over costly wired technologies, offering low installation costs, self-organization, and added functionality. As a consequence of their enormous potential, WSNs were subject to standardization and some industrial standards and open source solutions like WirelessHART, Zigbee, ISA100, IEEE802.15.4 and OpenWSN were announced. However, despite considerable efforts to provide mechanisms that increase the availability, reliability, security and maintainability of this type of networks, WSNs have kept one of their main characteristics: fault-proneness. As a result, the offer of post-deployment diagnostic tools has been increasing in the last decade in order to diagnose WSN failures as soon as possible. Nevertheless, current WSN diagnostic tools still have many limitations and cannot be considered “ready to use” in real-world scenarios. In this paper we present an autonomous diagnostic tool that addresses these limitations in a real industrial Internet of Things (IIoT) scenario. Our tool is based on simple metrics, a logging tool, a data-mining algorithm, and available network metrics, and it monitors the condition of the sensor nodes firmware, hardware and the network itself. The proposed demonstration was tested and validated using the WirelessHART IIoT standard.
在过去的几年里，无线传感器网络(WSN)从无数工业应用的一项有前途的技术发展成为当今应用中使用的事实上的技术。无线传感器网络的发展势头已经超过了昂贵的有线技术，它提供了低安装成本、自组织和附加功能。由于其巨大的潜力，无线传感器网络被标准化，一些工业标准和开源解决方案，如WirelessHART, Zigbee, ISA100, IEEE802.15.4和OpenWSN被公布。然而，尽管在提供提高这种类型网络的可用性、可靠性、安全性和可维护性的机制方面做出了相当大的努力，wsn仍然保持了其主要特征之一:易出错性。因此，在过去十年中，为了尽快诊断WSN故障，部署后诊断工具的提供一直在增加。然而，目前的WSN诊断工具仍然有许多局限性，不能被认为是“可以在现实场景中使用”。在本文中，我们提出了一种自主诊断工具，解决了真实工业物联网(IIoT)场景中的这些限制。我们的工具基于简单的指标、日志工具、数据挖掘算法和可用的网络指标，它监视传感器节点固件、硬件和网络本身的状况。使用wireless shart IIoT标准对拟议的演示进行了测试和验证。
{"title":"An autonomous diagnostic tool for the WirelessHART industrial standard","authors":"Duarte M. G. Raposo, A. Rodrigues, J. Silva, F. Boavida, Jose E. G. Oliveira, Carlos Herrera, Carlos Egas","doi":"10.1109/WOWMOM.2016.7523536","DOIUrl":"https://doi.org/10.1109/WOWMOM.2016.7523536","url":null,"abstract":"Over the last years, Wireless Sensor Networks (WSN) went from being a promising technology for countless industrial applications to a de facto technology used in todays' applications. WSNs have been gaining momentum over costly wired technologies, offering low installation costs, self-organization, and added functionality. As a consequence of their enormous potential, WSNs were subject to standardization and some industrial standards and open source solutions like WirelessHART, Zigbee, ISA100, IEEE802.15.4 and OpenWSN were announced. However, despite considerable efforts to provide mechanisms that increase the availability, reliability, security and maintainability of this type of networks, WSNs have kept one of their main characteristics: fault-proneness. As a result, the offer of post-deployment diagnostic tools has been increasing in the last decade in order to diagnose WSN failures as soon as possible. Nevertheless, current WSN diagnostic tools still have many limitations and cannot be considered “ready to use” in real-world scenarios. In this paper we present an autonomous diagnostic tool that addresses these limitations in a real industrial Internet of Things (IIoT) scenario. Our tool is based on simple metrics, a logging tool, a data-mining algorithm, and available network metrics, and it monitors the condition of the sensor nodes firmware, hardware and the network itself. The proposed demonstration was tested and validated using the WirelessHART IIoT standard.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114757716","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}
Pub Date : 2016-06-21DOI: 10.1109/WoWMoM.2016.7523535
P. Urien, Xavier Aghina
This demonstration shows the mobile payment platform based on cloud services, designed by the SIMulation project. This project is a joint research effort from a major French mobile operator and an academic research institute. NFC payments cards are hosted in RACS payment servers. These are remotely used thanks to internet enable smart phones acting as logical bridge between the merchant terminal and the payment server. The communication security is enforced by the SIM module plugged in the mobile and fully processing the TLS protocol.
{"title":"The SIMulation project: Demonstrating mobile payments based on cloud services","authors":"P. Urien, Xavier Aghina","doi":"10.1109/WoWMoM.2016.7523535","DOIUrl":"https://doi.org/10.1109/WoWMoM.2016.7523535","url":null,"abstract":"This demonstration shows the mobile payment platform based on cloud services, designed by the SIMulation project. This project is a joint research effort from a major French mobile operator and an academic research institute. NFC payments cards are hosted in RACS payment servers. These are remotely used thanks to internet enable smart phones acting as logical bridge between the merchant terminal and the payment server. The communication security is enforced by the SIM module plugged in the mobile and fully processing the TLS protocol.","PeriodicalId":187747,"journal":{"name":"2016 IEEE 17th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125648996","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
扫码关注我们
求助内容：
应助结果提醒方式：