HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507919
Kamini Garg, S. Giordano, Anna Förster
{"title":"A study to understand the impact of node density on data dissemination time in opportunistic networks","authors":"Kamini Garg, S. Giordano, Anna Förster","doi":"10.1145/2507908.2507919","DOIUrl":"https://doi.org/10.1145/2507908.2507919","url":null,"abstract":"In this paper, we study the impact of node density on data dissemination time and achieved data quality in a distributed people-centric system. Our results are obtained through an extensive simulation campaign employing Random Way Point and Random Direction mobility and realistic node densities of real environments. Our simulation results show that, the impact of node density does not significantly affect the data dissemination time after a certain threshold of node density, without compromising the achieved data quality. This result is evident for both mobility models. Our study provides an insight to the parameters we need to consider while evaluating the success of any distributed people-centric system.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128541864","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507912
Radu-Corneliu Marin, C. Dobre
{"title":"Reaching for the clouds: contextually enhancing smartphones for energy efficiency","authors":"Radu-Corneliu Marin, C. Dobre","doi":"10.1145/2507908.2507912","DOIUrl":"https://doi.org/10.1145/2507908.2507912","url":null,"abstract":"Energy efficiency has gradually become a compulsory need in mobile computing as the processing requirements for smartphones have increased exponentially. Moreover, the current demand is stretching beyond the extents of modern battery technology. In this sense, we introduce a novel collaboration solution for mobile devices based on a contextual search entitled Hybrid Contextual Cloud for Ubiquitous Platforms comprising of Smartphones (HYCCUPS). HYCCUPS takes advantage of the pervasive nature of smartphones and of current wireless communication technologies as to offer offloading execution of mobile applications in an opportunistic on-the-fly hybrid computing cloud. We design an adaptive contextual search algorithm for schedulling mobile code execution in smartphone communities based on predicting the availability and mobility of devices in the near vicinity. We emulate the HYCCUPS framework based on real user traces and we prove that it improves battery health, maximizes power save, minimizes overall execution time of mobile applications and it preserves or even enhances user experience.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131898241","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507914
B. Coll-Perales, J. Gozálvez, V. Friderikos
{"title":"Context-based opportunistic forwarding in multi-hop cellular networks using mobile relays","authors":"B. Coll-Perales, J. Gozálvez, V. Friderikos","doi":"10.1145/2507908.2507914","DOIUrl":"https://doi.org/10.1145/2507908.2507914","url":null,"abstract":"Multi-hop Cellular Networks can help address the increasing data demand and expected capacity constraints of cellular systems through the integration of cellular and relaying technologies. Multi-hop Cellular Networks using Mobile Relays (MCN-MR) are characterized by a decentralized and cooperative operation that provides new networking opportunities but also significant management challenges. In this context, this work investigates the use of opportunistic store-carry and forward schemes in MCN-MR networks to increase energy efficiency in the provision of delay tolerant services. In particular, the paper identifies for a two-hop MCN-MR scenario the optimum mobile relay location and the location from which the relay should start forwarding the information to the cellular base station in order to minimize the overall energy consumption. Taking this optimum configuration as a reference benchmark, the paper proposes then a scheme that relaxes the requirement to operate under the identified optimum configuration, and exploits context information provided by the cellular infrastructure. The proposed scheme is compared against other forwarding approaches, and the obtained results demonstrate the capacity of opportunistic forwarding in MCN-MR to reduce energy consumption for delay tolerant services.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127998276","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507913
N. Zorba, E. Yaacoub, Ahmad M. El-Hajj, Z. Dawy, C. Verikoukis
{"title":"Opportunistic bi-directional scheduling under quality of experience demands","authors":"N. Zorba, E. Yaacoub, Ahmad M. El-Hajj, Z. Dawy, C. Verikoukis","doi":"10.1145/2507908.2507913","DOIUrl":"https://doi.org/10.1145/2507908.2507913","url":null,"abstract":"Quality of Experience (QoE) is a very important metric in wireless communication systems, where customers request strict QoE demands that translate into restrictions on both Uplink (UL) and Downlink (DL) connections. The development of wireless communications standards and the emergence of new interactive and conversational services with bi-directional QoE requirements changes the scheduling context from a link-level to a system level. To this end, this paper presents a joint UL-DL bandwidth allocation approach that considers outage as the main QoE parameter to be minimized. The well-known opportunistic scheduling algorithm is first modified to account for the UL-DL coupling and mathematical expressions of both the outage probability and its QoE are derived. Then the expressions are employed in the joint UL-DL bandwidth allocation problem. The formulated problem is shown to be a convex optimization problem. Simulation results demonstrate the merits of the proposed approach compared to traditional techniques.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125368285","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507923
Annalisa Socievole, Eiko Yoneki, F. Rango, J. Crowcroft
{"title":"Opportunistic message routing using multi-layer social networks","authors":"Annalisa Socievole, Eiko Yoneki, F. Rango, J. Crowcroft","doi":"10.1145/2507908.2507923","DOIUrl":"https://doi.org/10.1145/2507908.2507923","url":null,"abstract":"In opportunistic networks, the nodes usually exploit a contact opportunity to perform hop-by-hop routing, since an end-to-end path between the source node and destination node may not exist. Most social-based routing protocols use social information extracted from real-world encounter networks to select an appropriate message relay. A protocol based on encounter history, however, takes time to build up a knowledge database from which to take routing decisions. An opportunistic routing protocol which extracts social information from multiple social networks, can be an alternative approach to avoid suboptimal paths due to partial information on encounters. While contact information changes constantly and it takes time to identify strong social ties, online social network ties remain rather stable and can be used to augment available partial contact information. In this paper, we propose a novel opportunistic routing approach, called ML-SOR (Multi-layer Social Network based Routing), which extracts social network information from multiple social contexts. To select an effective forwarding node, ML-SOR measures the forwarding capability of a node when compared to an encountered node in terms of node centrality, tie strength and link prediction. These metrics are computed by ML-SOR on different social network layers. Trace driven simulations show that ML-SOR, when compared to other schemes, is able to deliver messages with high probability while keeping overhead ratio very small.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133928645","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507918
Qingshan Wang, Shasha Fu, Qi Wang, Lili Ren
{"title":"Dynamic group-finding in public bus networks","authors":"Qingshan Wang, Shasha Fu, Qi Wang, Lili Ren","doi":"10.1145/2507908.2507918","DOIUrl":"https://doi.org/10.1145/2507908.2507918","url":null,"abstract":"Group structure detection presents an insight of the potential organization and functional properties, and benefit the data packet propagation in the various networks. This paper finds that the average number of neighbors of bus changes in a regular way across the running time. Thus we present a dynamic group-finding algorithm in public bus networks. The proposed algorithm includes two phases. To begin with, time is divided into some time interval based on the average number of neighbors of bus, and the time interval is extracted from the bus mobility trace. A group detection algorithm based on spectral clustering is then proposed for each time interval. The simulation results over a realistic bus trace data show that our dynamic group-finding algorithm well adapts to public bus networks.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132277170","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507922
Bala Krishna Maddali, D. K. Barman
{"title":"Agent-based multicast opportunistic routing protocol for wireless networks","authors":"Bala Krishna Maddali, D. K. Barman","doi":"10.1145/2507908.2507922","DOIUrl":"https://doi.org/10.1145/2507908.2507922","url":null,"abstract":"Opportunistic routing techniques achieve high throughput rates for the feeble and lossy links in wireless networks. Opportunistic Routing (OR) is a broadcast based technique widely used in Delay Tolerant Networks (DTNs) that uses the relay node negotiation and link attributes to forward the data in the network. Multiple retransmissions in opportunistic routing increase the communication overhead in the network. Hence, node scheduling and network coding techniques are used to reduce the rate of re-transmissions in the network. In this article, we present a novel approach using Agent-based Multicast Opportunistic Routing Protocol (Agent-based MORP) to reduce the load of the source node by re-establishing the links with multicast member nodes using opportunistic link attributes of the network. The proposed protocol elects the maximum trusted relay node as the agent node to transfer the long-awaited data packets towards the destination. Agent-based MORP uses the stateless approach, where the forwarding nodes are divided into probable relay regions, and the routing paths are established on demand. The proposed protocol limits the number of re-transmissions and saves the energy in the network. Simulation results indicate that the proposed Agent-based MORP reduces the control overhead and improves the performance of opportunistic routing in wireless networks.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121493370","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507910
K. Katzis, K. Papanikolaou, Marios Iakovou
{"title":"Reinforcement learning in hierarchical cognitive radio wireless networks","authors":"K. Katzis, K. Papanikolaou, Marios Iakovou","doi":"10.1145/2507908.2507910","DOIUrl":"https://doi.org/10.1145/2507908.2507910","url":null,"abstract":"Opportunistic networks are an emerging networking paradigm aiming to exploit the spectrum availability in a distributed ad-hoc manner. In such types of networks communication between source and destination is established on-the-fly and depends on a number of parameters related to the channel. In this paper, we present an algorithm for routing optimization in hierarchical cognitive radio enabled networks, using the access base stations. We describe how spatial and temporal system parameters between nodes can be employed to design optimum routes between the nodes thus becoming invaluable for deriving optimum opportunistic algorithms. Initial results of this work indicate that traffic history can improve the performance of the routing algorithm by identifying the nodes that are most likely to be available for routing thus minimizing retransmissions and reducing blocking probability. One of the challenges in dealing with these records is the memory and processing requirements needed by the power hungry algorithms.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130951752","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507917
Paraskevi Mousicou, C. Mavromoustakis, Athina Bourdena, G. Mastorakis, E. Pallis
{"title":"Performance evaluation of dynamic cloud resource migration based on temporal and capacity-aware policy for efficient resource sharing","authors":"Paraskevi Mousicou, C. Mavromoustakis, Athina Bourdena, G. Mastorakis, E. Pallis","doi":"10.1145/2507908.2507917","DOIUrl":"https://doi.org/10.1145/2507908.2507917","url":null,"abstract":"This paper elaborates on practical considerations, such as location and capacity issues to offload resources, by adopting a rack based approach for the implementation. The proposed cooperative migration of resources enables efficient resource manipulation without any intermittent execution of the claimed tasks by the mobile devices, while it significantly reduces crash failures that lead all servers to become unavailable within a rack. In addition, this paper presents a modular resource migration scheme for failure-aware resource allocation, where according to the estimated performance of the resource sharing process (e.g. access time, service delay etc.) resources are migrated to another cloud rack based on the associated performance-oriented metrics. The proposed architecture is thoroughly evaluated through simulation tests for the resource migration policy used in the context of cloud rack failures for delay-bounded resource availability of mobile users, as well as for the efficiency of the proposed resource migration scheme.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122455976","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}
HP-MOSys '13Pub Date : 2013-11-03DOI: 10.1145/2507908.2507916
R. Goleva, Dimitar Atamian, Seferin Mirtchev, D. Dimitrova, L. Grigorova
{"title":"Traffic shaping measurements and analyses in 3G network","authors":"R. Goleva, Dimitar Atamian, Seferin Mirtchev, D. Dimitrova, L. Grigorova","doi":"10.1145/2507908.2507916","DOIUrl":"https://doi.org/10.1145/2507908.2507916","url":null,"abstract":"Traffic shaping effect may have significant impact on end-to-end Quality of Service (QoS) provisioning. Therefore, it should be carefully studied in order to allow the creation of appropriate traffic models to be used for simulations. First, to demonstrate the traffic shaping effect, we present statistical analyses on real-time measurements of diverse traffic sources (voice and video over IP) in a 3G network. By comparing the statistical distributions of the packet inter-arrival times for both the forward and backward direction, we can demonstrate directly the end-to-end traffic shaping effect introduced by the IP core network. Hence, we argue that distributed QoS management approach is needed. Additionally, we give the mean, variance, mean standard deviation, skewness, and kurtosis of the inter-arrival times, which can be used as input for simulation models. The accurate validation of the probability distributions is ensured by the Wolfram Mathematica and Crystal Ball statistical tools. Second, for the same set of measurements, we propose and defend with evaluations the use of the gamma distribution as best fitting function to traffic dynamics. Our proposal is applicable for traffic environments found in delay-tolerant networks, opportunistic networks, Internet of Things, sensor networks etc.","PeriodicalId":166569,"journal":{"name":"HP-MOSys '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116850684","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}