{"title":"On the Complexity of the Multi-Robot, Multi-Depot Map Visitation Problem","authors":"Eric Aaron, E. Kranakis, D. Krizanc","doi":"10.1109/MASS.2011.90","DOIUrl":"https://doi.org/10.1109/MASS.2011.90","url":null,"abstract":"This paper discusses the multi-robot, multidepot Map Visitation Problem, a multi-robot inspection problem in which a team of robots originating from multiple home base depots must visit a collection of previously identified critical locations in a two-dimensional navigation environment. In its precise focus on location inspection, it is related yet complementary to other inspection or surveillance problems such as boundary coverage or patrol. In the paper, we analyze graph representations and an agent model appropriate for the Map Visitation Problem, and we present complexity results for a variety of categories of map structures, including lines, rings, trees, and general graphs. In addition to complexity results, we present an algorithm for the Map Visitation Problem on trees that is optimal for single-robot problems and a second algorithm that is provably within a factor of two of optimal for two robots inspecting arbitrary graphs.","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127541810","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":"Distributed Spectrum Sensing in Cognitive Radio Networks with Fairness Consideration: Efficiency of Correlated Equilibrium","authors":"Sabita Maharjan, Yan Zhang, C. Yuen, S. Gjessing","doi":"10.1109/MASS.2011.143","DOIUrl":"https://doi.org/10.1109/MASS.2011.143","url":null,"abstract":"Cooperative spectrum sensing improves the reliability of detection. However, if the secondary users are selfish, they may not collaborate for sensing. In order to address this problem, Medium Access Control (MAC) protocols can be designed to enforce cooperation among secondary users for spectrum sensing. In this paper, we investigate this problem using game theoretical framework. We introduce the concept of correlated equilibrium for the cooperative spectrum sensing game among non-cooperative secondary users and formulate the optimization problem for the case where secondary users have heterogeneous traffic dynamics. We show that the correlated equilibrium improves the system utility, as compared to the mixed strategy Nash equilibrium. While maximizing system payoff is important, fairness is also equally important in systems with dissimilar users. In order to address fairness issue, we propose a new fair social welfare correlated equilibrium, which maximizes the system utility and ensures that the less well-off users do not starve. We employ a no-regret learning algorithm for distributed implementation of the correlated equilibrium. Finally, we propose a neighbourhood based learning algorithm and show that it achieves better performance than the no-regret algorithm.","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"81 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115048751","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}
Ruiting Zhou, Zongpeng Li, Chuan Wu, C. Williamson
{"title":"Physical Layer Network Coding with Signal Alignment for MIMO Wireless Networks","authors":"Ruiting Zhou, Zongpeng Li, Chuan Wu, C. Williamson","doi":"10.1109/MASS.2011.142","DOIUrl":"https://doi.org/10.1109/MASS.2011.142","url":null,"abstract":"We propose signal alignment (SA), a new wireless communication technique that enables physical layer network coding (PNC) in multi-input multi-output (MIMO) wireless net- works. Through calculated precoding, SA contracts the perceived signal space at a node to match its receive diversity, and hence facilitates the demodulation of linearly combined data packets. PNC coupled with SA (PNC-SA) has the potential of fully exploiting the precoding space at the senders, and can better utilize the spatial diversity of a MIMO network for higher transmission rates, outperforming existing techniques including MIMO or PNC alone, interference alignment (IA) and interference alignment and cancellation (IAC). PNC-SA adopts the seminal idea of'demodulate a linear combination'from PNC. The design of PNC-SA is also inspired by recent advances in IA, though SA alignssignalsnotinterferences. We study the optimal precoding and power allocation problem of PNC-SA, for SNR maximization at the receiver. The mapping from SNR to BER is then analyzed,revealing that the throughput gain of PNC-SA does not come with a sacrifice in BER. Wefinally demonstrate general applications of PNC-SA, and show via network level simulations that it can substantially increase the throughput of unicast and multicast sessions, by opening previously unexplored solution spaces in multi-hop MIMO routing.","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116056586","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":"Fractional Frequency Reuse to Mitigate Interference in Self-Configuring LTE-Femtocells Network","authors":"A. Dalal, Hailong Li, D. Agrawal","doi":"10.1109/MASS.2011.138","DOIUrl":"https://doi.org/10.1109/MASS.2011.138","url":null,"abstract":"Development of femtocells is the most recent step towards increasing the network capacity of a wireless network and improving the quality of service for cellular users. However, as all the femtocells use the same radio band, it poses a serious interference issue amongst neighboring femtocells, especially when femtocells are densely deployed. In this paper, we study the problem of DL (downlink) and UL (uplink) interference amongst closed-access neighboring femtocells used in conjunction with the Long Term Evolution (LTE) technology and propose a solution to mitigate this interference using Fractional Frequency Reuse (FFR) technique. User equipments (UEs) report to their serving femto base stations (F-BSs) periodically. If the report reveals high interference level, neighboring F-BSs locally adopt FFR in a coordinated but decentralized way. FFR divides the femtocell in cell-center and cell-edge areas where the cell-edge of interfering F-BSs use distinct set of sub-carriers (SCs). The division takes place in a way such that the affected UE falls in the cell-edge area. The simulation results indicate that the proposed scheme decreases interference in the neighboring F-BSs, femto UEs (F-UEs) and macro UEs (M-UEs) and improves the overall throughput. KeywordsFemtocell; Macrocell; Fractional frequency reuse","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122081504","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":"TALB: A Traffic-Aware Load Balancer for Throughput Improvement in Wireless Mesh Networks","authors":"Emilio Ancillotti, R. Bruno, M. Conti","doi":"10.1109/MASS.2011.20","DOIUrl":"https://doi.org/10.1109/MASS.2011.20","url":null,"abstract":"In this paper we design, implement and evaluate a practical flow-based routing architecture for WMNs, called TALB, which exploits traffic measurements to balance traffic load over available mesh paths and gateways. To achieve throughput enhancements while mitigating inter-flow interference, TALB implements a emph{Constrained Maximal Bottleneck Path} computation algorithm to maximize the bottleneck capacity of the paths used to reach the Internet, while preserving a given degree of traffic locality. The distinctive aspect of our proposed scheme is that it relies on a traffic-aware definition of residual link capacities to properly take into account the heterogeneity of Internet applications (e.g., inelastic vs. elastic traffic) and their service requirements (e.g., fixed vs. adaptive demands). Then, each mesh node monitors the main features of long-lived traffic flows, and reports such information to a network manager, which decides upon the sub-optimal paths to allocate to each new session. Tests performed in a 10-node wireless mesh testbed show that TALB provides remarkably throughput gains over nearest gateway strategies in case of mixed TCP and UDP traffic scenarios, or low to moderate load conditions.","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129715949","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":"CCD: Locating Event in Wireless Sensor Network without Locations","authors":"Shuo Lian, Yuan He, Jizhong Zhao","doi":"10.1109/MASS.2011.72","DOIUrl":"https://doi.org/10.1109/MASS.2011.72","url":null,"abstract":"Event detection is a typical application of wireless sensor networks. The existing approaches of event detection usually employ certain event models that are constructed with prior domain knowledge. The resulting event detection processes appear to be cost-inefficient, which require either intensive data exchanges among neighboring nodes or caching large columns of history data. In this paper, we focus on the issue of locating event in wireless sensor network without locations. This involves two tasks, namely detecting an event and identifying an area in the network where the event occurs. Motivated by the real system, we propose a model-free approach for event detection called CCD (Coding Cost based event Detection). Coding cost is a metric that quantifies the diversity of a set of sensor readings. Incorporated into the inherent data collection mechanism, CCD passively constructs a gradient map of coding cost throughout the network. An event is then detected where a change point of gradient appears and identifies the event pattern automatically. CCD is fully distributed and does not incur apparent communication overhead. We implement CCD and evaluate its performance with extensive experiments and simulations. The results demonstrate that CCD is accurate, scalable, and applicable to a variety of sensor networks.","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126887455","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}
Tae-Seok Kim, G. Jakllari, S. Krishnamurthy, M. Faloutsos
{"title":"A Unified Metric for Routing and Rate Adaptation in Multi-Rate Wireless Mesh Networks","authors":"Tae-Seok Kim, G. Jakllari, S. Krishnamurthy, M. Faloutsos","doi":"10.1109/MASS.2011.31","DOIUrl":"https://doi.org/10.1109/MASS.2011.31","url":null,"abstract":"In this paper, we propose a new metric that is applicable both to routing and rate adaptation in multi-rate wireless mesh networks. Unlike many previous efforts, our metric is comprehensive; it considers several factors that affect end-to-end performance such as the effect of the relative positions of the links on a path when choosing the rates of operation and the importance of avoiding congested areas. We call our metric ETM (for Expected Transmission cost in Multi-rate wireless networks). We analytically derive the ETM metric. We show that the ETM metric can be used (a) to determine the best end-to-end path with a greedy routing approach and (b) it can be used to dynamically select the best transmission rate for each link on the path via a dynamic programming approach. Based on ETM, we design and implement the ETM-framework on an indoor wireless mesh network and compare its performance with that of the popular ETT and the recently proposed ETOP metrics. Our experiments show that the ETM-framework yields throughput improvements of up to 253% and 368% as compared with the ETT and ETOP frameworks.","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121719600","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}
Monica Navarro, Marcello Antonucci, L. Sarakis, T. Zahariadis
{"title":"VITRO Architecture: Bringing Virtualization to WSN World","authors":"Monica Navarro, Marcello Antonucci, L. Sarakis, T. Zahariadis","doi":"10.1109/MASS.2011.96","DOIUrl":"https://doi.org/10.1109/MASS.2011.96","url":null,"abstract":"This paper presents the architecture of the VITRO system concept developed under the VITRO project for the realization of Virtual Sensor Networks. The aim of the proposed architecture is to enable the realization of scalable, flexible, adaptive, energy-efficient and trust-aware Virtual Sensor Network platforms, focusing on the reduction of deployment complexity and on advanced interoperability mechanisms. The efforts have been put towards specifying a Service Provisioning architecture and mechanisms for advanced sensor and middleware design.","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131379404","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":"Multicast and Virtual Road Side Units for Multi Technology Alert Messages Dissemination","authors":"D. Câmara, C. Bonnet, N. Nikaein, M. Wetterwald","doi":"10.1109/MASS.2011.115","DOIUrl":"https://doi.org/10.1109/MASS.2011.115","url":null,"abstract":"This paper presents a method to disseminate alert messages in the context of new emerging communication standards, such as LTE and Wave. The applications involving the broadcast of periodic messages, can be described using the MBMS (Multicast/Broadcast Multimedia Service). Public Safety alert systems perform one important task in the context of Public Safety Networks (PSNs). The method proposed here is responsible for delivering alert messages to the greatest number of people in a specified area. To accomplish this task a new method, Virtual Road Side Unit (vRSU) is proposed to help the authorities to reach isolated people. The system works even if the deployed structure is severed damaged, i.e. most part of the regular Road Side Units (RSU) are out of order. In our method nodes work cooperatively to propagate the message to other nodes, when re-propagating messages nodes, vRSUs, behave as regular RSUs. KeywordsPublic Safety; multicast; alert; LTE; data","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132024411","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}
Karim El Shabrawy, Grégory Baudeau, Thierry Deniaud
{"title":"Public Safety and ad hoc Networks: Coverage Extension and Interoperability","authors":"Karim El Shabrawy, Grégory Baudeau, Thierry Deniaud","doi":"10.1109/MASS.2011.111","DOIUrl":"https://doi.org/10.1109/MASS.2011.111","url":null,"abstract":"The HNPS project aims at defining solutions for the integration and the interoperability between various heterogeneous communication networks. The solutions described in this document propose to enlarge the service capabilities by extending the interoperability and the coverage of the services required by the Public Safety and Security community. The general approach is divided in various parts including: extending the PMR (Professional Mobile Radiocommunications) network coverage by using existing or deployable technologies; creating bridges to extend PMR coverage thanks to IP networks. The experiments reported in this document are based on the introduction of an ad hoc network (OLSR / MOLSR protocols) in order to extend the PMR network (e.g. extension in a building): ad hoc networks are quickly deployable, do not need any infrastructure, offer a larger coverage through its multi-hop feature, so are suitable to extend a network. A gateway is also designed in order to ensure the interoperability between the PMR network and the ad hoc network: the group communication service proposed in the PMR network (including Push-To-Talk feature) is shared between both networks. Moreover, as security is a main feature of the PMR networks, solutions for the security architecture are also described in this paper. Keywords-Public Safety; ad hoc network; coverage extension; interoperability; group communication; security","PeriodicalId":253543,"journal":{"name":"2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132393563","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}