ACM Interational Symposium on Mobile Ad Hoc Networking and Computing最新文献_第9页

Adaptive network coding for scheduling real-time traffic with hard deadlines 具有硬截止日期的实时流量调度的自适应网络编码

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2012-03-18 DOI: 10.1145/2248371.2248389

Lei Yang, Y. Sagduyu, Jason H. Li, Junshan Zhang

{"title":"Adaptive network coding for scheduling real-time traffic with hard deadlines","authors":"Lei Yang, Y. Sagduyu, Jason H. Li, Junshan Zhang","doi":"10.1145/2248371.2248389","DOIUrl":"https://doi.org/10.1145/2248371.2248389","url":null,"abstract":"We study adaptive network coding (NC) for scheduling real-time traffic over a single-hop wireless network. To meet the hard deadlines of real-time traffic, it is critical to strike a balance between maximizing the throughput and minimizing the risk that the entire block of coded packets may not be decodable by the deadline. Thus motivated, we explore adaptive NC, where the block size is adapted based on the remaining time to the deadline, by casting this sequential block size adaptation problem as a finite-horizon Markov decision process. One interesting finding is that the optimal block size and its corresponding action space monotonically decrease as the deadline approaches, and the optimal block size is bounded by the \"greedy\" block size. These unique structures make it possible to narrow down the search space of dynamic programming, building on which we develop a monotonicity-based backward induction algorithm (MBIA) that can solve for the optimal block size in polynomial time. Since channel erasure probabilities would be time-varying in a mobile network, we further develop a joint real-time scheduling and channel learning scheme with adaptive NC that can adapt to channel dynamics. We also generalize the analysis to multiple flows with hard deadlines and long-term delivery ratio constraints, devise a low-complexity online scheduling algorithm integrated with the MBIA, and then establish its asymptotic throughput-optimality. In addition to analysis and simulation results, we perform high fidelity wireless emulation tests with real radio transmissions to demonstrate the feasibility of the MBIA in finding the optimal block size in real time.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123202204","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}

引用次数: 42

Towards optimal rate allocation for data aggregation in wireless sensor networks 无线传感器网络中数据聚合的最优速率分配

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107528

Lu Su, Yan Gao, Yong Yang, G. Cao

引用次数: 32

On optimal energy efficient convergecasting in unreliable sensor networks with applications to target tracking 不可靠传感器网络的最优能效收敛及其在目标跟踪中的应用

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107534

S. Hariharan, N. Shroff

{"title":"On optimal energy efficient convergecasting in unreliable sensor networks with applications to target tracking","authors":"S. Hariharan, N. Shroff","doi":"10.1145/2107502.2107534","DOIUrl":"https://doi.org/10.1145/2107502.2107534","url":null,"abstract":"In this paper, we develop a mathematical framework for studying the problem of maximizing the \"information\" received at the sink in a data gathering wireless sensor network. We explicitly account for unreliable links, energy constraints, and in-network computation. The network model is that of a sensor network arranged in the form of a tree topology, where the root corresponds to the sink node, and the rest of the network detects an event and transmits data to the sink over one or more hops. This problem of sending data from multiple sources to a common sink is often referred to as the convergecasting problem. We develop an integer optimization based framework for this problem, which allows for tackling link unreliability using general error-recovery schemes. Even though this framework has a non-linear objective function, and cannot be relaxed to a convex programming problem, we develop a low complexity, distributed solution. The solution involves finding a Maximum Weight Increasing Independent Set (MWIIS) in rectangle graphs over each hop of the network, and can be obtained in polynomial time. Further, we apply these techniques to a target tracking problem where we optimally select sensors to track a given target such that the information obtained is maximized subject to constraints on the per-node sensing and communication energy. We validate our algorithms through numerical evaluations, and illustrate the advantages of explicitly considering link unreliability in the optimization framework.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130899547","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}

引用次数: 13

Self-stabilizing leader election for single-hop wireless networks despite jamming 干扰下单跳无线网络的自稳定领导者选举

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107522

A. Richa, C. Scheideler, S. Schmid, Jin Zhang

引用次数: 20

Putting contacts into context: mobility modeling beyond inter-contact times 将接触置于上下文中:超越接触时间的移动性建模

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107526

T. Hossmann, T. Spyropoulos, F. Legendre

{"title":"Putting contacts into context: mobility modeling beyond inter-contact times","authors":"T. Hossmann, T. Spyropoulos, F. Legendre","doi":"10.1145/2107502.2107526","DOIUrl":"https://doi.org/10.1145/2107502.2107526","url":null,"abstract":"Realistic mobility models are crucial for the simulation of Delay Tolerant and Opportunistic Networks. The long standing benchmark of reproducing realistic pairwise statistics (e.g., contact and inter-contact time distributions) is today mastered by state-of-the-art models. However, mobility models should also reflect the macroscopic community structure of who meets whom. While some existing models reproduce realistic community structure - reflecting groups of nodes who work or live together - they fail in correctly capturing what happens between such communities: they are often connected by few bridging links between nodes who socialize outside of the context and location of their home communities. In a first step, we analyze the bridging behavior in mobility traces and show how it differs to that of mobility models. By analyzing the context and location of contacts, we then show that it is the social nature of bridges which makes them differ from intra-community links. Based on these insights, we propose a Hypergraph to model time-synchronized meetings of nodes from different communities as a social overlay. Applying this as an extension to two existing mobility models we show that it reproduces correct bridging behavior while keeping other features of the original models intact.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132433462","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}

引用次数: 95

O3: optimized overlay-based opportunistic routing O3:优化的基于覆盖的机会路由

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107505

M. Han, Apurv Bhartia, L. Qiu, Eric Rozner

{"title":"O3: optimized overlay-based opportunistic routing","authors":"M. Han, Apurv Bhartia, L. Qiu, Eric Rozner","doi":"10.1145/2107502.2107505","DOIUrl":"https://doi.org/10.1145/2107502.2107505","url":null,"abstract":"Opportunistic routing achieves significant performance gain under lossy wireless links. In this paper, we develop a novel approach that exploits inter-flow network coding in opportunistic routing. A unique feature of our design is that it systematically optimizes end-to-end performance (e.g., total throughput). A key challenge to achieve this goal is a strong tension between opportunistic routing and inter-flow network coding: to achieve high reliability, opportunistic routing uses intra-flow coding to spread information across multiple nodes; this reduces the information reaching an individual node, which in turn reduces inter-flow coding opportunity. To address this challenge, we decouple opportunistic routing and inter-flow network coding by proposing a novel framework where an overlay network performs overlay routing and inter-flow coding without worrying about packet losses, while an underlay network uses optimized opportunistic routing and rate limiting to provide efficient and reliable overlay links for the overlay network to take advantage of. Based on this framework, we develop the first optimization algorithm to jointly optimize opportunistic routes, rate limits, inter-flow and intra-flow coding. We then develop a practical opportunistic routing protocol (O3) based on the optimization results. Using Qualnet simulation, we study the individual and aggregate benefits of opportunistic routing, inter-flow coding, and rate limits. Our results show that (i) rate limiting significantly improves the performance of all routing protocols, (ii) opportunistic routing is beneficial under high loss rates, whereas inter-flow coding is more effective under low loss rates, and (iii) O3 significantly out-performs state-of-the-art routing protocols by simultaneously leveraging optimized opportunistic routing, inter-flow coding, and rate limits.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131712119","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}

引用次数: 31

Barrier coverage in camera sensor networks 相机传感器网络中的屏障覆盖

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107518

Yi Wang, G. Cao

{"title":"Barrier coverage in camera sensor networks","authors":"Yi Wang, G. Cao","doi":"10.1145/2107502.2107518","DOIUrl":"https://doi.org/10.1145/2107502.2107518","url":null,"abstract":"Barrier coverage has attracted much attention in the past few years. However, most of the previous works focused on traditional scalar sensors. We propose to study barrier coverage in camera sensor networks. One fundamental difference between camera and scalar sensor is that cameras from different positions can form quite different views of the object. As a result, simply combining the sensing range of the cameras across the field does not necessarily form an effective camera barrier since the face image (or the interested aspect) of the object may be missed. To address this problem, we use the angle between the object's facing direction and the camera's viewing direction to measure the quality of sensing. An object is full-view covered if there is always a camera to cover it no matter which direction it faces and the camera's viewing direction is sufficiently close to the object's facing direction. We study the problem of constructing a camera barrier, which is essentially a connected zone across the monitored field such that every point within this zone is full-view covered. We propose a novel method to select camera sensors from an arbitrary deployment to form a camera barrier, and present redundancy reduction techniques to effectively reduce the number of cameras used. We also present techniques to deploy cameras for barrier coverage in a deterministic environment, and analyze and optimize the number of cameras required for this specific deployment under various parameters.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115905128","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}

引用次数: 140

A market-clearing model for spectrum trade in cognitive radio networks 认知无线电网络频谱交易的市场出清模型

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107513

Sang-Seon Byun, I. Balasingham, A. Vasilakos

引用次数: 11

Enabling coexistence of heterogeneous wireless systems: case for ZigBee and WiFi 实现异构无线系统的共存:ZigBee和WiFi的案例

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107510

Xinyu Zhang, K. Shin

{"title":"Enabling coexistence of heterogeneous wireless systems: case for ZigBee and WiFi","authors":"Xinyu Zhang, K. Shin","doi":"10.1145/2107502.2107510","DOIUrl":"https://doi.org/10.1145/2107502.2107510","url":null,"abstract":"The ISM spectrum is becoming increasingly populated by emerging wireless networks. Spectrum sharing among the same network of devices can be arbitrated by MAC protocols (e.g., CSMA), but the coexistence between heterogeneous networks remains a challenge. The disparate power levels, asynchronous time slots, and incompatible PHY layers of heterogeneous networks severely degrade the effectiveness of traditional MAC. In this paper, we propose a new mechanism, called the Cooperative Busy Tone (CBT), that enables the reliable coexistence between two such networks, ZigBee and WiFi. CBT allows a separate ZigBee node to schedule a busy tone concurrently with the desired transmission, thereby improving the visibility of ZigBee devices to WiFi. Its core components include a frequency flip scheme that prevents the mutual interference between cooperative ZigBee nodes, and a busy tone scheduler that minimizes the interference to WiFi, for both CSMA and TDMA packets. To optimize CBT, we establish an analytical framework that relates its key design parameters to performance and cost. Both the analytical and detailed simulation results demonstrate CBT's significant throughput improvement over the legacy ZigBee protocol, with negligible performance loss to WiFi. The results are validated further by implementing CBT on sensor motes and software radios.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115777607","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}

引用次数: 168

OmniVoice: a mobile voice solution for small-scale enterprises OmniVoice:面向小型企业的移动语音解决方案

ACM Interational Symposium on Mobile Ad Hoc Networking and Computing Pub Date : 2011-05-17 DOI: 10.1145/2107502.2107509

N. Ahmed, S. Keshav, K. Papagiannaki

{"title":"OmniVoice: a mobile voice solution for small-scale enterprises","authors":"N. Ahmed, S. Keshav, K. Papagiannaki","doi":"10.1145/2107502.2107509","DOIUrl":"https://doi.org/10.1145/2107502.2107509","url":null,"abstract":"We consider the problem of providing mobility support for Voice-over-IP (VoIP) traffic in small-scale enterprises. There is considerable interest in providing on-the-go support for VoIP through the use of WiFi-enabled smart phones. However, existing solutions either do not support client mobility or require client modifications, making them difficult to deploy in practice.\u0000 In this paper, we present OmniVoice, an 802.11 compliant solution that supports mobility for VoIP traffic without any client modifications. To effectively support such traffic, OmniVoice eliminates client handoff delays and manages interference from non-VoIP background traffic. It achieves this by using (a) a single-channel WLAN design and (b) a lightweight central controller for scheduling non-interfering AP-to-client transmissions and dynamically associating clients. The controller minimizes interference with the help of an interference map that models potential exposed and hidden terminal conflicts in the WLAN, while allowing for the serialization of transmissions that would otherwise compete for medium access. We have implemented and extensively evaluated OmniVoice on a 40 node wireless testbed. OmniVoice meets the QoS requirements for VoIP in all operating scenarios and is unaffected by interference from non-VoIP traffic. In particular, OmniVoice provides 100% greater throughput and 130% greater uninterrupted connectivity time to mobile VoIP users as compared to an off-the-shelf 802.11 solution.","PeriodicalId":425643,"journal":{"name":"ACM Interational Symposium on Mobile Ad Hoc Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129153379","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}

引用次数: 14