Pub Date : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583411
Yunsheng Wang, Jie Wu
A mobile opportunistic social network (MOSN) is a new type of delay tolerant network (DTN), in which the mobile users contact each other opportunistically. Information dissemination is a challenging problem in MOSNs, due to uncertainty and intermittent connectivity. In this paper, we propose a distributed social tie strength calculation mechanism to identify the relationship between each set of pairwise mobile nodes. Following arguments originally proposed by Mark Granovetter's seminal 1973 paper, The Strength of Weak Ties, the majority of the novel information dissemination is generated by weak ties. We first evaluate the strength of weak ties in MIT reality mining data. Then, a social-tie-based information dissemination protocol is presented, which is a token-based information dissemination scheme, including two phases: weak tie-driven forwarding and strong tie-driven forwarding. In the weak tie-driven forwarding phase, the susceptible nodes with more weak ties will receive more tokens for future forwarding. The number of forwarding tokens is related to the number of weak ties of two encountered nodes. After a while, the information will have been spread to multiple communities. Our scheme switches to a strong tie driven forwarding phase, in which the influential nodes are more important. The number of forwarding tokens is proportional to the number of strong ties of two encountered nodes. Extensive simulations are conducted in comparison to several approaches in real world mobile traces.
移动机会主义社交网络(MOSN)是一种新型的容忍延迟网络(DTN)，在这种网络中，移动用户之间的联系是机会主义的。由于不确定性和间歇性连接，在mosn中信息传播是一个具有挑战性的问题。在本文中，我们提出了一种分布式社会联系强度计算机制来识别每组成对移动节点之间的关系。根据Mark Granovetter 1973年开创性论文《弱联系的强度》(The Strength of Weak Ties)最初提出的论点，大多数新信息传播是由弱联系产生的。我们首先评估MIT现实挖掘数据中弱联系的强度。然后，提出了一种基于社会联系的信息传播协议，即基于令牌的信息传播方案，包括弱联系驱动转发和强联系驱动转发两个阶段。在弱联系驱动的转发阶段，弱联系越多的敏感节点将获得更多的令牌用于未来的转发。转发令牌的数量与两个遇到的节点的弱连接的数量有关。一段时间后，这些信息就会传播到多个社区。我们的方案切换到强联系驱动的转发阶段，其中有影响力的节点更加重要。转发令牌的数量与两个遇到的节点的强连接数量成正比。广泛的模拟进行了比较，几种方法在现实世界的移动轨迹。
{"title":"Social-tie-based information dissemination in mobile opportunistic social networks","authors":"Yunsheng Wang, Jie Wu","doi":"10.1109/WoWMoM.2013.6583411","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583411","url":null,"abstract":"A mobile opportunistic social network (MOSN) is a new type of delay tolerant network (DTN), in which the mobile users contact each other opportunistically. Information dissemination is a challenging problem in MOSNs, due to uncertainty and intermittent connectivity. In this paper, we propose a distributed social tie strength calculation mechanism to identify the relationship between each set of pairwise mobile nodes. Following arguments originally proposed by Mark Granovetter's seminal 1973 paper, The Strength of Weak Ties, the majority of the novel information dissemination is generated by weak ties. We first evaluate the strength of weak ties in MIT reality mining data. Then, a social-tie-based information dissemination protocol is presented, which is a token-based information dissemination scheme, including two phases: weak tie-driven forwarding and strong tie-driven forwarding. In the weak tie-driven forwarding phase, the susceptible nodes with more weak ties will receive more tokens for future forwarding. The number of forwarding tokens is related to the number of weak ties of two encountered nodes. After a while, the information will have been spread to multiple communities. Our scheme switches to a strong tie driven forwarding phase, in which the influential nodes are more important. The number of forwarding tokens is proportional to the number of strong ties of two encountered nodes. Extensive simulations are conducted in comparison to several approaches in real world mobile traces.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127729604","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583380
Vincenzo Sciancalepore, V. Mancuso, A. Banchs
The increasing demand for higher data rates in cellular network results in increasing network density. As a consequence, inter-cell interference is becoming the most serious obstacle towards spectral efficiency. Therefore, considering that radio resources are limited and expensive, new techniques are required for efficient radio resource allocation in next generation cellular networks. In this paper, we propose a pure frequency reuse 1 scheme based on base station scheduling rather than the commonly adopted user scheduling. In particular, we formulate a base station scheduling problem to determine which base stations can be scheduled to simultaneously transmit, without causing excessive interference to any user of any of the scheduled base stations. We show that finding the optimal base station scheduling is NP-hard, and formulate the BASICS (BAse Station Inter-Cell Scheduling) algorithm, a novel heuristic to approximate the optimal solution at low complexity cost. The proposed algorithm is in line with the ABSF (almost blank sub-frame) technique recently standardized at the 3GPP. By means of numerical and packet-level simulations, we prove the effectiveness and superiority of BASICS as compared to the state of the art of inter-cell interference mitigation schemes.
蜂窝网络对更高数据速率的需求日益增长，导致网络密度不断增加。因此，小区间干扰成为提高频谱效率的最严重障碍。因此，考虑到无线资源的有限和昂贵，下一代蜂窝网络需要新的技术来有效地分配无线资源。本文提出了一种基于基站调度的纯频率复用方案，取代了常用的用户调度方案。特别是，我们制定了一个基站调度问题，以确定哪些基站可以被调度同时发射，而不会对任何调度基站的任何用户造成过多的干扰。我们证明了寻找最优基站调度是np困难的，并提出了一种新的启发式算法BASICS (base station Inter-Cell scheduling)，以低复杂度成本近似最优解。提出的算法符合最近在3GPP标准化的ABSF(几乎空白子帧)技术。通过数值和分组级仿真，我们证明了BASICS与现有小区间干扰缓解方案相比的有效性和优越性。
{"title":"BASICS: Scheduling base stations to mitigate interferences in cellular networks","authors":"Vincenzo Sciancalepore, V. Mancuso, A. Banchs","doi":"10.1109/WoWMoM.2013.6583380","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583380","url":null,"abstract":"The increasing demand for higher data rates in cellular network results in increasing network density. As a consequence, inter-cell interference is becoming the most serious obstacle towards spectral efficiency. Therefore, considering that radio resources are limited and expensive, new techniques are required for efficient radio resource allocation in next generation cellular networks. In this paper, we propose a pure frequency reuse 1 scheme based on base station scheduling rather than the commonly adopted user scheduling. In particular, we formulate a base station scheduling problem to determine which base stations can be scheduled to simultaneously transmit, without causing excessive interference to any user of any of the scheduled base stations. We show that finding the optimal base station scheduling is NP-hard, and formulate the BASICS (BAse Station Inter-Cell Scheduling) algorithm, a novel heuristic to approximate the optimal solution at low complexity cost. The proposed algorithm is in line with the ABSF (almost blank sub-frame) technique recently standardized at the 3GPP. By means of numerical and packet-level simulations, we prove the effectiveness and superiority of BASICS as compared to the state of the art of inter-cell interference mitigation schemes.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314465","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583375
G. Szabó, Gergely Pongrácz, Mathias Sintorn
Channel switching in HSPA networks is used to reduce the channel occupancy when there is no data transfer for the given user, this way reducing battery consumption. This paper is the first dealing with another important aspect that is the CPU load on the radio network controller (RNC) caused by channel switching. This is an optimization task, in which both the channel switching and staying on the high-bandwidth channel have costs. In this paper we propose a system to minimize the costs by applying a predictor based method which uses time slice based features in order to reduce the high variance in the feature values. The proposed system is evaluated and compared to other state-of-the-art methods.
{"title":"Traffic adaptive channel switching with time slice based predictors","authors":"G. Szabó, Gergely Pongrácz, Mathias Sintorn","doi":"10.1109/WoWMoM.2013.6583375","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583375","url":null,"abstract":"Channel switching in HSPA networks is used to reduce the channel occupancy when there is no data transfer for the given user, this way reducing battery consumption. This paper is the first dealing with another important aspect that is the CPU load on the radio network controller (RNC) caused by channel switching. This is an optimization task, in which both the channel switching and staying on the high-bandwidth channel have costs. In this paper we propose a system to minimize the costs by applying a predictor based method which uses time slice based features in order to reduce the high variance in the feature values. The proposed system is evaluated and compared to other state-of-the-art methods.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131434932","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583403
Yali Wang, C. Westphal, J. Garcia-Luna-Aceves
Flooding of route requests or link states is a necessity in many routing protocols for mobile ad hoc networks (MANET), and several mechanisms have been devised to make flooding more efficient; however, all flooding approaches to date are such that the number of neighbors each node must use to relay a flooded packet grows as the node density increases. A new method, called ORCA (On-demand Routing with Coordinates Awareness) is introduced for the dissemination of route requests in MANETs. The selection of relaying nodes at each node in ORCA is done by computing the shortest Euclidean Distance from all neighbors of the node to four polar points located in the transmission range of the node. We prove that ORCA guarantees the coverage of all nodes in a connected MANET, and that the number of relays for each node is at most six. ORCA is compared with representative routing protocols, namely AODV, OLSR, LAR, and THP. The simulation results in networks of 200 and 250 nodes show that ORCA incurs the smallest routing load while attaining average delays and packet delivery ratios that are comparable to or better than those obtained with the other four routing protocols.
{"title":"Using geographical coordinates to attain efficient route signaling in ad hoc networks","authors":"Yali Wang, C. Westphal, J. Garcia-Luna-Aceves","doi":"10.1109/WoWMoM.2013.6583403","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583403","url":null,"abstract":"Flooding of route requests or link states is a necessity in many routing protocols for mobile ad hoc networks (MANET), and several mechanisms have been devised to make flooding more efficient; however, all flooding approaches to date are such that the number of neighbors each node must use to relay a flooded packet grows as the node density increases. A new method, called ORCA (On-demand Routing with Coordinates Awareness) is introduced for the dissemination of route requests in MANETs. The selection of relaying nodes at each node in ORCA is done by computing the shortest Euclidean Distance from all neighbors of the node to four polar points located in the transmission range of the node. We prove that ORCA guarantees the coverage of all nodes in a connected MANET, and that the number of relays for each node is at most six. ORCA is compared with representative routing protocols, namely AODV, OLSR, LAR, and THP. The simulation results in networks of 200 and 250 nodes show that ORCA incurs the smallest routing load while attaining average delays and packet delivery ratios that are comparable to or better than those obtained with the other four routing protocols.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131601951","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583498
Yiannis Agadakos, Konstantinos Makantasis, P. Partsinevelos, Georgios Papadakis, A. Doulamis
In 2007, our planet became predominantly urban as for the first time, more than half of the world's population was living in cities. This tendency for urbanization is characterized by urban sprawl phenomena and excessive environmental pollution degrading citizens' living standards. Although intelligent and safe urban planning and management is a challenging task, latest ICT advances can offer promising solutions to the aforementioned problem by providing efficient and effective ways for handling large amounts of unstandardized and distributed information. In this paper we present an integrated, fully automatic ICT solution for acquiring, processing and representing heterogeneous, unstandardized and distributed information about underground gas pipeline networks, in order to provide a safe way for urban growth.
{"title":"Safe urban growth: An integrated ICT solution for unstandardized and distributed information handling","authors":"Yiannis Agadakos, Konstantinos Makantasis, P. Partsinevelos, Georgios Papadakis, A. Doulamis","doi":"10.1109/WoWMoM.2013.6583498","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583498","url":null,"abstract":"In 2007, our planet became predominantly urban as for the first time, more than half of the world's population was living in cities. This tendency for urbanization is characterized by urban sprawl phenomena and excessive environmental pollution degrading citizens' living standards. Although intelligent and safe urban planning and management is a challenging task, latest ICT advances can offer promising solutions to the aforementioned problem by providing efficient and effective ways for handling large amounts of unstandardized and distributed information. In this paper we present an integrated, fully automatic ICT solution for acquiring, processing and representing heterogeneous, unstandardized and distributed information about underground gas pipeline networks, in order to provide a safe way for urban growth.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"29 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113976613","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583504
Jeffery P. Hansen, S. Hissam
Demand for real-time video in law enforcement, emergency and first responder situations has been in rapid growth. Further, different users will have different requirements which, depending on their needs, may change over time. At some times, a user may require high frame rate to detect motion, while at other times the user may be more concerned with resolution for object recognition. In this paper we describe our model for quantifying Quality of Experience (QoE) and managing Quality of Service (QoS) that incorporates end user or mission needs. We describe our distributed utility-based QoS optimization technique, D-Q-RAM and show how it can be used to make QoS trade-offs in response to mission needs to maximize QoE. We experimentally demonstrate QoS optimized trade-offs as user preferences shift between resolution and frame rate in a live 802.11 ad hoc wireless network. The results show the ability to meet all individual user needs, changing or not, while minimizing the impact on other users.
{"title":"Assessing QoS trade-offs for real-time video","authors":"Jeffery P. Hansen, S. Hissam","doi":"10.1109/WoWMoM.2013.6583504","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583504","url":null,"abstract":"Demand for real-time video in law enforcement, emergency and first responder situations has been in rapid growth. Further, different users will have different requirements which, depending on their needs, may change over time. At some times, a user may require high frame rate to detect motion, while at other times the user may be more concerned with resolution for object recognition. In this paper we describe our model for quantifying Quality of Experience (QoE) and managing Quality of Service (QoS) that incorporates end user or mission needs. We describe our distributed utility-based QoS optimization technique, D-Q-RAM and show how it can be used to make QoS trade-offs in response to mission needs to maximize QoE. We experimentally demonstrate QoS optimized trade-offs as user preferences shift between resolution and frame rate in a live 802.11 ad hoc wireless network. The results show the ability to meet all individual user needs, changing or not, while minimizing the impact on other users.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114315533","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583365
K. Nguyen, Yusheng Ji, S. Yamada
It is increasingly popular that there are multiple accessible access points (APs) surrounding a WiFi client. In an ideal case, the client would simultaneously connects to all the APs and maximize the connections' utilization, for example, aggregating the bandwidth of APs' backhauls, load balancing among the connections, etc. In this paper, we present WM (Wireless virtualization with Multipath TCP) a cross-layer approach that aims to improve performance of mobile WiFi users. The demonstration shows that aWiFi client equipped WM can keep multiple concurrent connections to APs by using wireless virtualization. Moreover, WM enhances the aggregated bandwidth and achieves seamless handover by adopting Multipath TCP.
{"title":"Improving WiFi networking with concurrent connections and multipath TCP","authors":"K. Nguyen, Yusheng Ji, S. Yamada","doi":"10.1109/WoWMoM.2013.6583365","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583365","url":null,"abstract":"It is increasingly popular that there are multiple accessible access points (APs) surrounding a WiFi client. In an ideal case, the client would simultaneously connects to all the APs and maximize the connections' utilization, for example, aggregating the bandwidth of APs' backhauls, load balancing among the connections, etc. In this paper, we present WM (Wireless virtualization with Multipath TCP) a cross-layer approach that aims to improve performance of mobile WiFi users. The demonstration shows that aWiFi client equipped WM can keep multiple concurrent connections to APs by using wireless virtualization. Moreover, WM enhances the aggregated bandwidth and achieves seamless handover by adopting Multipath TCP.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123822155","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583377
Hailong Li, Vaibhav R. Pandit, A. Knox, D. Agrawal
Numerous solutions have been proposed to improve the efficiency of wireless sensor networks (WSNs). Data aggregation, which reduces the data redundancy so as to mitigate energy consumption, is one of desirable solutions. One common feature of geographically close-by data known as spatial correlation, has been utilized for eliminating redundant information. To reduce redundancy and enhance eventual performance, we explore the possibility of combining sensing data with similar characteristics without considering spatial information.We define this relationship of data as characteristic correlation and propose an automatic procedure to discover characteristic correlation between sensor nodes (SNs) with limited overheads. Furthermore, we introduce a novel characteristic correlation based data aggregation approach that allows any SN to compress unlimited number of packets into virtual packets up to a constant number. With experimental and simulation results, our proposed approach is illustrated as an effective data aggregation method in term of data accuracy.
{"title":"A novel characteristic correlation approach for aggregating data in wireless sensor networks","authors":"Hailong Li, Vaibhav R. Pandit, A. Knox, D. Agrawal","doi":"10.1109/WoWMoM.2013.6583377","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583377","url":null,"abstract":"Numerous solutions have been proposed to improve the efficiency of wireless sensor networks (WSNs). Data aggregation, which reduces the data redundancy so as to mitigate energy consumption, is one of desirable solutions. One common feature of geographically close-by data known as spatial correlation, has been utilized for eliminating redundant information. To reduce redundancy and enhance eventual performance, we explore the possibility of combining sensing data with similar characteristics without considering spatial information.We define this relationship of data as characteristic correlation and propose an automatic procedure to discover characteristic correlation between sensor nodes (SNs) with limited overheads. Furthermore, we introduce a novel characteristic correlation based data aggregation approach that allows any SN to compress unlimited number of packets into virtual packets up to a constant number. With experimental and simulation results, our proposed approach is illustrated as an effective data aggregation method in term of data accuracy.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"420 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114949226","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583408
Stefan Alfredsson, G. Giudice, Johan Garcia, A. Brunström, L. D. Cicco, S. Mascolo
The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. One important network scenario where bufferbloat may occur is cellular networks. This paper investigates the interaction between TCP congestion control and buffering in cellular networks. Extensive measurements have been performed in commercial 3G, 3.5G and 4G cellular networks, with a mix of long and short TCP flows using the CUBIC, NewReno and Westwood+ congestion control algorithms. The results show that the completion times of short flows increase significantly when concurrent long flow traffic is introduced. This is caused by increased buffer occupancy from the long flows. In addition, for 3G and 3.5G the completion times are shown to depend significantly on the congestion control algorithms used for the background flows, with CUBIC leading to significantly larger completion times.
{"title":"Impact of TCP congestion control on bufferbloat in cellular networks","authors":"Stefan Alfredsson, G. Giudice, Johan Garcia, A. Brunström, L. D. Cicco, S. Mascolo","doi":"10.1109/WoWMoM.2013.6583408","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583408","url":null,"abstract":"The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. One important network scenario where bufferbloat may occur is cellular networks. This paper investigates the interaction between TCP congestion control and buffering in cellular networks. Extensive measurements have been performed in commercial 3G, 3.5G and 4G cellular networks, with a mix of long and short TCP flows using the CUBIC, NewReno and Westwood+ congestion control algorithms. The results show that the completion times of short flows increase significantly when concurrent long flow traffic is introduced. This is caused by increased buffer occupancy from the long flows. In addition, for 3G and 3.5G the completion times are shown to depend significantly on the congestion control algorithms used for the background flows, with CUBIC leading to significantly larger completion times.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130761247","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 : 2013-06-04DOI: 10.1109/WoWMoM.2013.6583470
D. Westhoff, Osman Ugus
It is the objective of this work to propose an extension of the Concealed Data Aggregation (CDA) approach which has originally been invented to allow some forms of in-network processing on encrypted data for reverse multicast traffic a.k.a. convergecast traffic. Extensions have been done with respect to two axes: Our proposed Malleability Resilient Concealed Data Aggregation (MR-CDA) combines recently presented homomorphic MACs with additively homomorphic encryption schemes and thus helps detecting outsider attacks which maliciously add resp. inject encrypted data to an aggregated encrypted data format. In the visionary part of this work with the malleability resilient premium concealed data aggregation (MR-P-CDA) we investigate what cryptographic primitives are in principle available to provide the most flexible form of encrypted in-network processing. Whereas the MR-CDA is in particular optimized with respect to its computational performance, the MR-P-CDA intentionally is not taking into account performance issues. Instead its focus is on the provisioning of an overall system security without any functional restrictions.
{"title":"Malleability resilient (premium) Concealed Data Aggregation","authors":"D. Westhoff, Osman Ugus","doi":"10.1109/WoWMoM.2013.6583470","DOIUrl":"https://doi.org/10.1109/WoWMoM.2013.6583470","url":null,"abstract":"It is the objective of this work to propose an extension of the Concealed Data Aggregation (CDA) approach which has originally been invented to allow some forms of in-network processing on encrypted data for reverse multicast traffic a.k.a. convergecast traffic. Extensions have been done with respect to two axes: Our proposed Malleability Resilient Concealed Data Aggregation (MR-CDA) combines recently presented homomorphic MACs with additively homomorphic encryption schemes and thus helps detecting outsider attacks which maliciously add resp. inject encrypted data to an aggregated encrypted data format. In the visionary part of this work with the malleability resilient premium concealed data aggregation (MR-P-CDA) we investigate what cryptographic primitives are in principle available to provide the most flexible form of encrypted in-network processing. Whereas the MR-CDA is in particular optimized with respect to its computational performance, the MR-P-CDA intentionally is not taking into account performance issues. Instead its focus is on the provisioning of an overall system security without any functional restrictions.","PeriodicalId":158378,"journal":{"name":"2013 IEEE 14th International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130893884","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
扫码关注我们
求助内容：
应助结果提醒方式：