{"title":"Experimental evaluation of a wireless community mesh network","authors":"Llorenç Cerdà-Alabern, Axel Neumann, P. Garcia","doi":"10.1145/2507924.2507960","DOIUrl":"https://doi.org/10.1145/2507924.2507960","url":null,"abstract":"Nowadays there are inexpensive WiFi devices that have fostered the deployment of wireless communities. Well known routing protocols used in the Internet do not fit well to time varying characteristic of wireless networks. This has motivated an intensive research on routing protocols for wireless mesh networks. At this time there are a number of mature and stable implementations that are being deployed in production networks. In this paper we focus on the experimental evaluation of a production Wireless Mesh network being deployed in a testbed at Universitat Politècnica de Catalunya (UPC) and a quarter of the city of Barcelona, Spain. To our best knowledge, this is the first paper where a production community wireless network using 802.11an is analyzed.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"22 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":"126482372","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}
{"title":"Efficient relay deployment for controlling connectivity in delay tolerant mobile networks","authors":"Zhiyu Wang, M. Nascimento, M. MacGregor","doi":"10.1145/2507924.2507966","DOIUrl":"https://doi.org/10.1145/2507924.2507966","url":null,"abstract":"In mobile networks, node movements may lead to a situation called network partition where an end-to-end path may never exist because the network is divided into several isolated subnetworks. Deploying stationary relays introduces new transmission opportunities leading to the improvement of network connectivity and performance. The majority of the proposed solutions concentrated on deploying the minimum number of relays in the network. However, relay deployment should also be resilient regarding relay node failures. In this paper, we show how the relay deployment problem can be modelled as a k-element connectivity problem in which multiple relay-disjoint paths are deployed to connect isolated subnetworks. To solve this problem, we present three heuristic algorithms targeting at finding the minimum number of relays to form k-element connected networks. Our experiments using synthetic and real data showed that the proposed greedy algorithm is 2 or 3 orders of magnitude faster and never worse than the other two algorithms.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"36 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":"133545963","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}
{"title":"An energy efficient adaptive HELLO algorithm for mobile ad hoc networks","authors":"Danping He, N. Mitton, D. Simplot-Ryl","doi":"10.1145/2507924.2507952","DOIUrl":"https://doi.org/10.1145/2507924.2507952","url":null,"abstract":"HELLO protocol or neighborhood discovery is essential in wireless ad hoc networks. It makes the rules for nodes to claim their existence/aliveness. In the presence of node mobility, no fix optimal HELLO frequency and optimal transmission range exist to maintain accurate neighborhood tables while reducing the energy consumption and bandwidth occupation. Thus a Turnover based Frequency and transmission Power Adaptation algorithm (TFPA) is presented in this paper. The method enables nodes in mobile networks to dynamically adjust both their HELLO frequency and transmission range depending on the relative speed. In TFPA, each node monitors its neighborhood table to count new neighbors and calculate the turnover ratio. The relationship between relative speed and turnover ratio is formulated and optimal transmission range is derived according to battery consumption model to minimize the overall transmission energy. By taking advantage of the theoretical analysis, the HELLO frequency is adapted dynamically in conjunction with the transmission range to maintain accurate neighborhood table and to allow important energy savings. The algorithm is simulated and compared to other state-of-the-art algorithms. The experimental results demonstrate that the TFPA algorithm obtains high neighborhood accuracy with low HELLO frequency (at least 11% average reduction) and with the lowest energy consumption. Besides, the TFPA algorithm does not require any additional GPS-like device to estimate the relative speed for each node, hence the hardware cost is reduced.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","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":"131627233","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}
{"title":"Efficient algorithm for serial data fusion in wireless sensor networks","authors":"A. Mostefaoui, Mahmoud Melkemi, A. Boukerche","doi":"10.1145/2507924.2507964","DOIUrl":"https://doi.org/10.1145/2507924.2507964","url":null,"abstract":"Although Wireless Sensor Networks (WSNs) are capable of generating a huge amount of data, the ultimate objective of the underlying applications/end-users is to derive an estimate of a parameter or function of interest through queries sent to nodes containing raw data. The way these queries are handled by the network has a deep impact on its overall performances ( e.g., required communications, consumed energy, etc.). Among the numerous centralized and distributed approaches addressing this issue, serial ones have shown an interesting improvements in terms of reducing communication needed for each query and hence reducing required energy. Nevertheless, serial approaches suffer two main drawbacks: (a) they require to construct a path passing through all nodes of the network (which is known to be a NP-Complete problem) and (b) they experience poor scalability. In this paper, we investigate these issues by proposing a novel localized serial approach, called Peeling Algorithm (PA). The proposed approach, because of its localized nature (i.e., no extra-information is needed rather than what it is already available at each node), has shown better support for scalability while reducing significantly needed communications to accomplish a query. The extensive simulation evaluations we made have confirmed the effectiveness of our proposed approach in comparison to other serial approaches. We also provide in this paper formal proofs of its correctness i.e., our distributed approach terminates (free of looping) and visits all connected nodes in the network.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","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":"130246809","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}
{"title":"Measurement-based simulation of WiFi interference","authors":"Mustafa Al-Bado, C. Sengul","doi":"10.1145/2507924.2507990","DOIUrl":"https://doi.org/10.1145/2507924.2507990","url":null,"abstract":"A typical wireless network exhibits time-varying channel conditions and complex interference relationships, which are also influenced by different vendor implementations. Therefore, to improve the mapping between wireless simulation and real life, site and device specific models are needed. In this paper, we propose such interference models, called BOWLsim-advanced, based on measurements in two WiFi testbeds. We validate BOWLsim-advanced in complex interference scenarios comprising of hidden terminals, multi-hop flows, and inter-flow interference and show that it has better accuracy compared to both our earlier work and the default interference model of ns-3 (Network Simulator 3). However, the maximum improvement is observed for hidden terminals at the PHY layer, and for multi-hop flows and unicast communication, performance varies based on whether nodes are able to carrier-sense each other or have asymmetric interference. Essentially, our results show that PHY-layer models become insufficient for asymmetric interference, which requires better MAC layer models for higher accuracy.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","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":"130705667","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}
Pedro O. S. Vaz de Melo, A. C. Viana, M. Fiore, K. Jaffrès-Runser, Frédéric Le Mouël, A. Loureiro
{"title":"RECAST: telling apart social and random relationships in dynamic networks","authors":"Pedro O. S. Vaz de Melo, A. C. Viana, M. Fiore, K. Jaffrès-Runser, Frédéric Le Mouël, A. Loureiro","doi":"10.1145/2507924.2507950","DOIUrl":"https://doi.org/10.1145/2507924.2507950","url":null,"abstract":"In this paper, we argue that the ability to accurately spot random and social relationships in dynamic networks is essential to network applications that rely on human routines, such as, e.g., opportunistic routing. We thus propose a strategy to analyze users' interactions in mobile networks where users act according to their interests and activity dynamics. Our strategy, named Random rElationship ClASsifier sTrategy (RECAST), allows classifying users' wireless interactions, separating random interactions from different kinds of social ties. To that end, RECAST observes how the real system differs from an equivalent one where entities' decisions are completely random. We evaluate the effectiveness of the RECAST classification on real-world user contact datasets collected in diverse networking contexts. Our analysis unveils significant differences among the dynamics of users' wireless interactions in the datasets, which we leverage to unveil the impact of social ties on opportunistic routing.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","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":"128969597","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}
{"title":"Cactus: a hybrid digital-analog wireless video communication system","authors":"H. Cui, Zhihai Song, Zhe Yang, Chong Luo, Ruiqin Xiong, Feng Wu","doi":"10.1145/2507924.2507987","DOIUrl":"https://doi.org/10.1145/2507924.2507987","url":null,"abstract":"This paper challenges the conventional wisdom that video redundancy should be removed as much as possible for efficient communications. We discover that, by keeping spatial redundancy at the sender and properly utilizing it at the receiver, we can build a more robust and even more efficient wireless video communication system than existing ones. In the proposed framework, inter-frame (temporal) redundancy in video is removed at the encoder, but intra-frame (spatial) redundancy is retained. In doing so, pixel values after a transform-domain scaling are directly transmitted with amplitude modulation. At the receiver, spatial redundancy is utilized by image denoising. Note that denoising in our decoder is not a post-processing, but have to be immediately performed on channel output. We implement the video communication system called Cactus on SORA platform, and make the denoising processing real-time through GPU implementation. Cactus is evaluated in 802.11a/g WLAN environment. On average, Cactus outperforms SoftCast by 4.7 dB in video PSNR and is robust to packet losses.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"187 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":"121062985","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}
{"title":"Epidemic content distribution: empirical and analytic performance","authors":"Ljubica Pajevic, G. Karlsson, Ó. Helgason","doi":"10.1145/2507924.2507998","DOIUrl":"https://doi.org/10.1145/2507924.2507998","url":null,"abstract":"Epidemic content dissemination has been proposed as an approach to mitigate frequent link disruptions and support content-centric information dissemination in opportunistic networks. Stochastic modeling is a common method to evaluate performance of epidemic dissemination schemes. The models introduce assumptions which, on one hand make them analytically tractable, while on the other, ignore attested characteristics of human mobility. In this paper, we investigate the fitness and limitations of an analytical stochastic model for content dissemination by comparison with experimental results obtained from real mobility traces. Our finding is that a homogeneous analytic model is unable to capture the performance of content dissemination with respect to content delivery delays.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"15 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":"123352665","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}
Enrique Hernández-Orallo, Juan-Carlos Cano, C. Calafate, P. Manzoni
{"title":"A representative and accurate characterization of inter-contact times in mobile opportunistic networks","authors":"Enrique Hernández-Orallo, Juan-Carlos Cano, C. Calafate, P. Manzoni","doi":"10.1145/2507924.2507936","DOIUrl":"https://doi.org/10.1145/2507924.2507936","url":null,"abstract":"A representative characterisation of inter-contact times between nodes is essential for the performance evaluation of mobile networks. The most common characterization of inter-contact times is based on the study of the aggregate distribution of contacts between individual pairs of nodes. The problem with this aggregate distribution is that it is not always representative of the individual pair distributions, especially in the short term and when the number of nodes in the network is high. Thus, deriving results from this characterisation, can lead to inaccurate performance evaluations results. In this paper, we propose and evaluate two new methods for characterising the inter-contact times distribution in mobile networks. We prove that these characterizations have a higher representativeness, thereby improving the accuracy of the derived performance results. For evaluating the precision of the different characterizations we use the epidemic routing protocol, which has an analytical performance expression that is based on a contact rate lambda. We derive from each of the characterizations the corresponding lambda values. Then, we compare the results obtained using the analytical expression with simulation results using both synthetic and real contact traces. It is shown that the new characterization methods are very accurate, even for reduced contact traces and high number of nodes.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"63 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":"126446872","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}
{"title":"Understanding the benefits of open access in Femtocell networks: stochastic geometric analysis in the uplink","authors":"Wei Bao, B. Liang","doi":"10.1145/2507924.2507945","DOIUrl":"https://doi.org/10.1145/2507924.2507945","url":null,"abstract":"We introduce a comprehensive analytical framework to compare between open access and closed access in two-tier femtocell networks, with regard to uplink interference and outage. Interference at both the macrocell and femtocell levels is considered. A stochastic geometric approach is employed as the basis for our analysis. We further derive sufficient conditions for open access and closed access to outperform each other in terms of the outage probability, leading to closed-form expressions to upper and lower bound the difference in the targeted received power between the two access modes. Simulations are conducted to validate the accuracy of the analytical model and the correctness of the bounds.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132648679","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}