Pub Date : 2015-07-16DOI: 10.1109/WoWMoM.2015.7158192
Md. Akbar Hossain, N. Sarkar
Rendezvous in cognitive radio ad-hoc networks (CRAHNs) is a key step for a pair of unknown cognitive radio (CR) users to initiate communication. Channel hopping (CH) provides an effective method to guarantee rendezvous in CRAHNs. To design a CH scheme, assumption of symmetric channel information is widely used in the literature. This assumption may ease the CH design, but unable to capture the dynamic radio environment. To achieve the rendezvous in the shortest time, most of the existing CH sequences utilized the family of mathematical concepts such as prime number theory, Chinese remainder theory (CRT), quorum system and combinatorial block design and so on. However, rendezvous on a channel is rather influenced by the CR user preference on which it wants to achieve rendezvous. In this paper we address rendezvous problem with asymmetric channel information. This paper proposes an adaptive CH sequence based on local channel sensing information to achieve rendezvous in finite time and guarantees overlap on all available common channels. Results obtained show that variation in channel ranking has a significant influence on CH performance.
{"title":"Rendezvous in cognitive radio ad-hoc networks with asymmetric channel view","authors":"Md. Akbar Hossain, N. Sarkar","doi":"10.1109/WoWMoM.2015.7158192","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158192","url":null,"abstract":"Rendezvous in cognitive radio ad-hoc networks (CRAHNs) is a key step for a pair of unknown cognitive radio (CR) users to initiate communication. Channel hopping (CH) provides an effective method to guarantee rendezvous in CRAHNs. To design a CH scheme, assumption of symmetric channel information is widely used in the literature. This assumption may ease the CH design, but unable to capture the dynamic radio environment. To achieve the rendezvous in the shortest time, most of the existing CH sequences utilized the family of mathematical concepts such as prime number theory, Chinese remainder theory (CRT), quorum system and combinatorial block design and so on. However, rendezvous on a channel is rather influenced by the CR user preference on which it wants to achieve rendezvous. In this paper we address rendezvous problem with asymmetric channel information. This paper proposes an adaptive CH sequence based on local channel sensing information to achieve rendezvous in finite time and guarantees overlap on all available common channels. Results obtained show that variation in channel ranking has a significant influence on CH performance.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130302260","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 : 2015-07-16DOI: 10.1109/WoWMoM.2015.7158189
A. K. Monfared, M. Ammar, E. Zegura, David Doria, David Bruno
Mobile devices are often expected to perform computational tasks that may be beyond their processing or battery capability. Cloud computing techniques have been proposed as a means to offload a mobile device's computation to more powerful resources. In this paper, we consider the case where powerful computing resources are employed on a vehicle, thus they can be re-positioned in real time. User-carried devices with no Internet connectivity wish to initiate computing tasks to be run on a remote computer. This scenario finds application in challenged environments and may be used in a military or disaster relief setting. It is further enabled by increasing feasibility of constructing a Mobile High Performance Computer (MHPC) using rugged computer hardware with form factors that can be deployed in vehicles. By analogy to prior work on message ferries and data mules, one can refer to the use of MHPCs as computational ferrying. After illustrating and motivating the computational ferrying concept, we turn our attention into the challenges facing such a deployment. These include the well-known challenges of operating an opportunistic and intermittently connected network using message ferries - such as devising an efficient mobility plan for MHPCs and developing techniques for proximity awareness. In addition such a system must include computation offloading decision making mechanisms to be deployed by mobile users, techniques for scheduling computation on MHPCs, and for handling possible mobility of the users. In this paper, first we propose an architecture for the system components to be deployed on the mobile users and the MHPCs. We then provide solutions to the MHPC movement scheduling problem with sufficient generality to describe a number of plausible deployment scenarios. Finally, we report and discuss some preliminary results.
{"title":"Computational ferrying: Challenges in deploying a Mobile High Performance Computer","authors":"A. K. Monfared, M. Ammar, E. Zegura, David Doria, David Bruno","doi":"10.1109/WoWMoM.2015.7158189","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158189","url":null,"abstract":"Mobile devices are often expected to perform computational tasks that may be beyond their processing or battery capability. Cloud computing techniques have been proposed as a means to offload a mobile device's computation to more powerful resources. In this paper, we consider the case where powerful computing resources are employed on a vehicle, thus they can be re-positioned in real time. User-carried devices with no Internet connectivity wish to initiate computing tasks to be run on a remote computer. This scenario finds application in challenged environments and may be used in a military or disaster relief setting. It is further enabled by increasing feasibility of constructing a Mobile High Performance Computer (MHPC) using rugged computer hardware with form factors that can be deployed in vehicles. By analogy to prior work on message ferries and data mules, one can refer to the use of MHPCs as computational ferrying. After illustrating and motivating the computational ferrying concept, we turn our attention into the challenges facing such a deployment. These include the well-known challenges of operating an opportunistic and intermittently connected network using message ferries - such as devising an efficient mobility plan for MHPCs and developing techniques for proximity awareness. In addition such a system must include computation offloading decision making mechanisms to be deployed by mobile users, techniques for scheduling computation on MHPCs, and for handling possible mobility of the users. In this paper, first we propose an architecture for the system components to be deployed on the mobile users and the MHPCs. We then provide solutions to the MHPC movement scheduling problem with sufficient generality to describe a number of plausible deployment scenarios. Finally, we report and discuss some preliminary results.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117154020","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 : 2015-07-16DOI: 10.1109/WoWMoM.2015.7158160
Mehrab Shahriar, Yonghe Liu, Sajal K. Das
In absence of fixed infrastructure in Opportunistic Networks (OppNet), connectivity between OppNet nodes (usually characterized by human-portable devices), is one of the most challenging issues. The traditional assumption considers every proximity triggered human contact to be an effective OppNet connection. However, the high dynamicity of human mobility impairs the interchangeable notion of human contact and effective oppnet connection, thus necessitating the consideration of other critical contact properties like contact volume, defined as the maximum amount of data transferable during a contact. Recently a few works were proposed to predict the contact volume, using the instantaneous movement direction and velocity of the users. However none of those considered previous mobility history of the users which has a significant role on the future estimations. In this paper, we propose a novel scheme called HiPCV, which uses a distributed learning approach to capture preferential movements of the individuals, with spatial contexts and directional information and paves the way for mobility history assisted contact volume prediction. Experimenting on real world human mobility traces, HiPCV first learns and structures human walk patterns, along her frequently chosen trails. By creating a Mobility Markov Chain (MMC) out of this pattern and infusing it into HiPCV algorithm, we then devise a decision model for data transmissions during opportunistic contacts. Experimental results show the robustness of HiPCV in terms mobility prediction, reliable opportunistic data transfers and bandwidth saving, at places where people show regularity in their movements.
{"title":"HiPCV: History based learning model for predicting contact volume in Opportunistic Networks","authors":"Mehrab Shahriar, Yonghe Liu, Sajal K. Das","doi":"10.1109/WoWMoM.2015.7158160","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158160","url":null,"abstract":"In absence of fixed infrastructure in Opportunistic Networks (OppNet), connectivity between OppNet nodes (usually characterized by human-portable devices), is one of the most challenging issues. The traditional assumption considers every proximity triggered human contact to be an effective OppNet connection. However, the high dynamicity of human mobility impairs the interchangeable notion of human contact and effective oppnet connection, thus necessitating the consideration of other critical contact properties like contact volume, defined as the maximum amount of data transferable during a contact. Recently a few works were proposed to predict the contact volume, using the instantaneous movement direction and velocity of the users. However none of those considered previous mobility history of the users which has a significant role on the future estimations. In this paper, we propose a novel scheme called HiPCV, which uses a distributed learning approach to capture preferential movements of the individuals, with spatial contexts and directional information and paves the way for mobility history assisted contact volume prediction. Experimenting on real world human mobility traces, HiPCV first learns and structures human walk patterns, along her frequently chosen trails. By creating a Mobility Markov Chain (MMC) out of this pattern and infusing it into HiPCV algorithm, we then devise a decision model for data transmissions during opportunistic contacts. Experimental results show the robustness of HiPCV in terms mobility prediction, reliable opportunistic data transfers and bandwidth saving, at places where people show regularity in their movements.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131277098","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 : 2015-06-14DOI: 10.1109/WoWMoM.2015.7158142
Jill Jermyn, R. Jover, I. Murynets, M. Istomin, S. Stolfo
Machine to Machine (M2M) systems are actively spreading, with mobile networks rapidly evolving to provide connectivity beyond smartphones and tablets. With billions of embedded devices expected to join cellular networks over the next few years, novel applications are emerging and contributing to the Internet of Things (IoT) paradigm. The new generation of mobile networks, the Long Term Evolution (LTE), has been designed to provide enhanced capacity for a large number of mobile devices and is expected to be the main enabler of the emergence of the IoT. In this context, there is growing interest in the industry and standardization bodies on understanding the potential impact of the scalability of M2M systems on LTE networks. The highly heterogeneous traffic patterns of most M2M systems, very different from those of smartphones and other mobile devices, and the surge of M2M connected devices over the next few years, present a great challenge for the network. This paper presents the first insights and answers on the scalability of the IoT on LTE networks, determining to what extent mobile networks could be overwhelmed by the large amount of devices attempting to communicate. Based on a detailed analysis with a custom-built, standards-compliant, large-scale LTE simulation testbed, we determine the main potential congestion points and bottlenecks, and determine which types of M2M traffic present a larger challenge. To do so, the simulation testbed implements realistic statistical M2M traffic models derived from fully anonymized real LTE traces of six popular M2M systems from one of the main tier-1 operators in the United States.
{"title":"Scalability of Machine to Machine systems and the Internet of Things on LTE mobile networks","authors":"Jill Jermyn, R. Jover, I. Murynets, M. Istomin, S. Stolfo","doi":"10.1109/WoWMoM.2015.7158142","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158142","url":null,"abstract":"Machine to Machine (M2M) systems are actively spreading, with mobile networks rapidly evolving to provide connectivity beyond smartphones and tablets. With billions of embedded devices expected to join cellular networks over the next few years, novel applications are emerging and contributing to the Internet of Things (IoT) paradigm. The new generation of mobile networks, the Long Term Evolution (LTE), has been designed to provide enhanced capacity for a large number of mobile devices and is expected to be the main enabler of the emergence of the IoT. In this context, there is growing interest in the industry and standardization bodies on understanding the potential impact of the scalability of M2M systems on LTE networks. The highly heterogeneous traffic patterns of most M2M systems, very different from those of smartphones and other mobile devices, and the surge of M2M connected devices over the next few years, present a great challenge for the network. This paper presents the first insights and answers on the scalability of the IoT on LTE networks, determining to what extent mobile networks could be overwhelmed by the large amount of devices attempting to communicate. Based on a detailed analysis with a custom-built, standards-compliant, large-scale LTE simulation testbed, we determine the main potential congestion points and bottlenecks, and determine which types of M2M traffic present a larger challenge. To do so, the simulation testbed implements realistic statistical M2M traffic models derived from fully anonymized real LTE traces of six popular M2M systems from one of the main tier-1 operators in the United States.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116898926","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 : 2015-06-14DOI: 10.1109/WoWMoM.2015.7158173
A. Seetharam, J. Kurose
A variety of forwarding strategies have been developed for multi-hop wireless networks, considering the broadcast nature of the wireless medium and the presence of fading channels that result in time-varying and unreliable transmission quality. One such strategy is opportunistic forwarding, which exploits relay diversity by opportunistically selecting an overhearing relay as a forwarder. Prior work has studied the performance of opportunistic forwarding for the simplified scenario of uncorrelated wireless channels. In this paper, we consider a more realistic scenario of temporally correlated wireless channels; the wireless channel is modeled as a Rayleigh fading channel and its temporal correlation as a modified Bessel function of the first kind and zeroth order. We use these models to develop a simple Markovian model to analyze the performance of opportunistic forwarding for correlated wireless channels for the case of linear networks. We then demonstrate via numerical evaluation the diminishing performance of opportunistic forwarding with increasing channel correlation.
{"title":"An analysis of opportunistic forwarding for correlated wireless channels","authors":"A. Seetharam, J. Kurose","doi":"10.1109/WoWMoM.2015.7158173","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158173","url":null,"abstract":"A variety of forwarding strategies have been developed for multi-hop wireless networks, considering the broadcast nature of the wireless medium and the presence of fading channels that result in time-varying and unreliable transmission quality. One such strategy is opportunistic forwarding, which exploits relay diversity by opportunistically selecting an overhearing relay as a forwarder. Prior work has studied the performance of opportunistic forwarding for the simplified scenario of uncorrelated wireless channels. In this paper, we consider a more realistic scenario of temporally correlated wireless channels; the wireless channel is modeled as a Rayleigh fading channel and its temporal correlation as a modified Bessel function of the first kind and zeroth order. We use these models to develop a simple Markovian model to analyze the performance of opportunistic forwarding for correlated wireless channels for the case of linear networks. We then demonstrate via numerical evaluation the diminishing performance of opportunistic forwarding with increasing channel correlation.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126734095","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 : 2015-06-14DOI: 10.1109/WoWMoM.2015.7158137
Feixiong Zhang, Chenren Xu, Yanyong Zhang, Kadangode K. Ramakrishnan, Shreyasee Mukherjee, R. Yates, Thu D. Nguyen
The prevalence of mobile devices especially smartphones has attracted research on mobile content delivery techniques. In this paper, we propose to take advantage of the storage available at wireless access points to bring content closer to mobile devices, hence improving the downloading performance. Specifically, we propose to have a separate popularity based cache and a prefetch buffer at the network edge to capture both long-term and short-term content access patterns. Further, we point out that it is insufficient to rely on a device's past history to predict when and where to prefetch, especially in urban settings; instead, we propose to derive a prediction model based on the aggregated network-level statistics. We discuss the proposed mobile content caching/prefetching method in the context of the MobilityFirst future Internet architecture. In MobilityFirst, when mobile clients move between network attachment points (e.g., Wi-Fi access points), their network association records are logged by the network, which then naturally facilitates the network-level mobility prediction. Through detailed simulations with real taxi mobility traces, we show that such a strategy is more effective than earlier schemes in satisfying content requests at the edge (higher cache hit ratios), leading to shorter content download latencies. Specifically, the fraction of requests satisfied at the edge increases by a factor of 2.9 compared to a caching only approach, and by 45% compared to individual user-based prediction and prefetching.
{"title":"EdgeBuffer: Caching and prefetching content at the edge in the MobilityFirst future Internet architecture","authors":"Feixiong Zhang, Chenren Xu, Yanyong Zhang, Kadangode K. Ramakrishnan, Shreyasee Mukherjee, R. Yates, Thu D. Nguyen","doi":"10.1109/WoWMoM.2015.7158137","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158137","url":null,"abstract":"The prevalence of mobile devices especially smartphones has attracted research on mobile content delivery techniques. In this paper, we propose to take advantage of the storage available at wireless access points to bring content closer to mobile devices, hence improving the downloading performance. Specifically, we propose to have a separate popularity based cache and a prefetch buffer at the network edge to capture both long-term and short-term content access patterns. Further, we point out that it is insufficient to rely on a device's past history to predict when and where to prefetch, especially in urban settings; instead, we propose to derive a prediction model based on the aggregated network-level statistics. We discuss the proposed mobile content caching/prefetching method in the context of the MobilityFirst future Internet architecture. In MobilityFirst, when mobile clients move between network attachment points (e.g., Wi-Fi access points), their network association records are logged by the network, which then naturally facilitates the network-level mobility prediction. Through detailed simulations with real taxi mobility traces, we show that such a strategy is more effective than earlier schemes in satisfying content requests at the edge (higher cache hit ratios), leading to shorter content download latencies. Specifically, the fraction of requests satisfied at the edge increases by a factor of 2.9 compared to a caching only approach, and by 45% compared to individual user-based prediction and prefetching.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116104752","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 : 2015-06-14DOI: 10.1109/WoWMoM.2015.7158155
Thomas M. M. Meyfroyt
Wireless sensor networks require communication protocols for efficiently propagating and maintaining data in a distributed fashion. Ideally, a communication protocol is able to disseminate data quickly to all nodes in the network using as few transmissions as possible, while distributing transmission load fairly. In the context of wireless sensor networks the Trickle algorithm is a popular protocol serving as the basis for many of the current communication protocols. In this study we analyze the performance of Trickle with respect to efficiency, fairness, reliability and propagation speed. Additionally, we show how small extensions to the algorithm can improve its performance.
{"title":"An analytic evaluation of the Trickle algorithm: Towards efficient, fair, fast and reliable data dissemination","authors":"Thomas M. M. Meyfroyt","doi":"10.1109/WoWMoM.2015.7158155","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158155","url":null,"abstract":"Wireless sensor networks require communication protocols for efficiently propagating and maintaining data in a distributed fashion. Ideally, a communication protocol is able to disseminate data quickly to all nodes in the network using as few transmissions as possible, while distributing transmission load fairly. In the context of wireless sensor networks the Trickle algorithm is a popular protocol serving as the basis for many of the current communication protocols. In this study we analyze the performance of Trickle with respect to efficiency, fairness, reliability and propagation speed. Additionally, we show how small extensions to the algorithm can improve its performance.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116621352","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 : 2015-06-14DOI: 10.1109/WoWMoM.2015.7158184
S. Mekki, S. Valentin
This demonstration shows a new type of HTTP adaptive streaming (HAS) for mobile users. We will present an anticipatory HAS policy that adapts video quality based on a prediction of the wireless channel state. By anticipating a poor channel state and by reducing video quality in advance, this policy maximizes the number of seconds in the user's playout buffer before coverage is lost. Even in difficult coverage situations such as tunnels and elevators, our approach reaches outstanding fluency without decreasing the average video bitrate. With this anticipatory buffering technique users require no channel resources at low channel state, which increases spectral efficiency. Our solution is based on an modified player application and will be demonstrated on off-the-shelf Smartphones in a conventional 4G network.
{"title":"Anticipatory quality adaptation for mobile streaming: Fluent video by channel prediction","authors":"S. Mekki, S. Valentin","doi":"10.1109/WoWMoM.2015.7158184","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158184","url":null,"abstract":"This demonstration shows a new type of HTTP adaptive streaming (HAS) for mobile users. We will present an anticipatory HAS policy that adapts video quality based on a prediction of the wireless channel state. By anticipating a poor channel state and by reducing video quality in advance, this policy maximizes the number of seconds in the user's playout buffer before coverage is lost. Even in difficult coverage situations such as tunnels and elevators, our approach reaches outstanding fluency without decreasing the average video bitrate. With this anticipatory buffering technique users require no channel resources at low channel state, which increases spectral efficiency. Our solution is based on an modified player application and will be demonstrated on off-the-shelf Smartphones in a conventional 4G network.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124974532","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 : 2015-06-14DOI: 10.1109/WoWMoM.2015.7158161
N. Bui, J. Widmer
A highly interesting trend in mobile network optimization is to exploit knowledge of future network capacity to allow mobile terminals to prefetch data when signal quality is high and to refrain from communication when signal quality is low. While this approach offers remarkable benefits, it relies on the availability of a reliable forecast of system conditions. This paper focuses on the reliability of simple prediction techniques and their impact on resource allocation algorithms. In addition, we propose ICARO, a resource allocation technique that is robust to prediction uncertainties. The algorithm combines autoregressive filtering and statistical models for short, medium, and long term forecasting. We validate our approach by means of an extensive simulation campaign based on real measurement data collected in Berlin. We show that our solution performs close to an omniscient optimizer and outperforms a limited horizon omniscient optimizer by 10 - 15%. Our solution provides up to 30% saving of system resources compared to a simple solution that always maintains a full buffer and is close to optimal in terms of buffer under-run time.
{"title":"Mobile network resource optimization under imperfect prediction","authors":"N. Bui, J. Widmer","doi":"10.1109/WoWMoM.2015.7158161","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158161","url":null,"abstract":"A highly interesting trend in mobile network optimization is to exploit knowledge of future network capacity to allow mobile terminals to prefetch data when signal quality is high and to refrain from communication when signal quality is low. While this approach offers remarkable benefits, it relies on the availability of a reliable forecast of system conditions. This paper focuses on the reliability of simple prediction techniques and their impact on resource allocation algorithms. In addition, we propose ICARO, a resource allocation technique that is robust to prediction uncertainties. The algorithm combines autoregressive filtering and statistical models for short, medium, and long term forecasting. We validate our approach by means of an extensive simulation campaign based on real measurement data collected in Berlin. We show that our solution performs close to an omniscient optimizer and outperforms a limited horizon omniscient optimizer by 10 - 15%. Our solution provides up to 30% saving of system resources compared to a simple solution that always maintains a full buffer and is close to optimal in terms of buffer under-run time.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130644646","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 : 2015-06-14DOI: 10.1109/WoWMoM.2015.7158176
M. Wichtlhuber, Mahdi Mousavi, Hussein Al-Shatri, A. Klein, D. Hausheer
For transmitting data in scenarios showing a high user density, infrastructure based and multihop Ad hoc communication can be combined to benefit from the reliability of a stable backbone network and the increased coverage of multihop communication. Such scenarios have been investigated from a cross layer perspective in the recent years mainly focusing on pure performance optimization. However, the question of providing incentives to nodes to forward data has largely been ignored in the cross layer domain, even though providing incentives is vital for the network: each node represents a user comparing his or her satisfaction and the cost to decide on his or her participation. A likely reason for the gap in cross layer incentive research is the necessity to model users as well as the network in order to express a user's utility, which requires knowledge in both fields. In order to foster future research in the area of cross layer incentive schemes, this work proposes a general cross layer simulation model combining user and network models. Moreover, an instantiation of the simulation model for the use case of live video broadcasting is presented.
{"title":"Towards a framework for cross layer incentive mechanisms for multihop video dissemination","authors":"M. Wichtlhuber, Mahdi Mousavi, Hussein Al-Shatri, A. Klein, D. Hausheer","doi":"10.1109/WoWMoM.2015.7158176","DOIUrl":"https://doi.org/10.1109/WoWMoM.2015.7158176","url":null,"abstract":"For transmitting data in scenarios showing a high user density, infrastructure based and multihop Ad hoc communication can be combined to benefit from the reliability of a stable backbone network and the increased coverage of multihop communication. Such scenarios have been investigated from a cross layer perspective in the recent years mainly focusing on pure performance optimization. However, the question of providing incentives to nodes to forward data has largely been ignored in the cross layer domain, even though providing incentives is vital for the network: each node represents a user comparing his or her satisfaction and the cost to decide on his or her participation. A likely reason for the gap in cross layer incentive research is the necessity to model users as well as the network in order to express a user's utility, which requires knowledge in both fields. In order to foster future research in the area of cross layer incentive schemes, this work proposes a general cross layer simulation model combining user and network models. Moreover, an instantiation of the simulation model for the use case of live video broadcasting is presented.","PeriodicalId":221796,"journal":{"name":"2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)","volume":"37 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120915689","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
扫码关注我们
求助内容：
应助结果提醒方式：