Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing最新文献

On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks 基于最大赤字优先的无线网络实时流量调度性能研究

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491298

Xiaohan Kang, Weina Wang, J. J. Jaramillo, Lei Ying

{"title":"On the performance of largest-deficit-first for scheduling real-time traffic in wireless networks","authors":"Xiaohan Kang, Weina Wang, J. J. Jaramillo, Lei Ying","doi":"10.1145/2491288.2491298","DOIUrl":"https://doi.org/10.1145/2491288.2491298","url":null,"abstract":"This paper considers the problem of scheduling real-time traffic in wireless networks. We consider an ad hoc wireless network with general interference and general one-hop traffic. Each packet is associated with a deadline and will be dropped if it is not transmitted before the deadline expires. The number of packet arrivals in each time slot and the length of a deadline are both stochastic and follow certain distributions. We only allow a fraction of packets to be dropped. At each link, we assume the link keeps track of the difference between the minimum number of packets that need to be delivered and the number of packets that are actually delivered, which we call deficit. The largest-deficit-first (LDF) policy schedules links in descending order according to their deficit values, which is a variation of the largest-queue-first (LQF) policy for non-real-time traffic. We prove that the efficiency ratio of LDF can be lower bounded by a quantity that we call the real-time local-pooling factor (R-LPF). We further prove that given a network with interference degree β, the R-LPF is at least 1/(β+1), which in the case of the one-hop interference model translates into an R-LPF of at least 1/3.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129080399","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}

引用次数: 49

Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks 无线网络中有规律业务保障的大流量最优调度

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491304

Bin Li, Ruogu Li, A. Eryilmaz

{"title":"Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks","authors":"Bin Li, Ruogu Li, A. Eryilmaz","doi":"10.1145/2491288.2491304","DOIUrl":"https://doi.org/10.1145/2491288.2491304","url":null,"abstract":"We consider the design of throughput-optimal scheduling policies in multi-hop wireless networks that also possess good mean delay performance and provide regular service for all links -- critical metrics for real-time applications. To that end, we study a parametric class of maximum-weight type scheduling policies with parameter α ≥ 0, called Regular Service Guarantee (RSG) Algorithm, where each link weight consists of its own queue-length and a counter that tracks the time since the last service. This policy has been shown to be throughput-optimal and to provide more regular service as the parameter α increases, however at the cost of increasing mean delay. This motivates us to investigate whether satisfactory service regularity and low mean-delay can be simultaneously achieved by the RSG Algorithm by carefully selecting its parameter α. To that end, we perform a novel Lyapunov-drift based analysis of the steady-state behavior of the stochastic network. Our analysis reveals that the RSG Algorithm can minimize the total mean queue-length to establish mean delay optimality under heavily-loaded conditions as long as α scales no faster than the order of 1/5√∈, where ∈ measures the closeness of the network load to the boundary of the capacity region. To the best of our knowledge, this is the first work that provides regular service to all links while also achieving heavy-traffic optimality in mean queue-lengths.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126465989","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}

引用次数: 22

Energy-efficient fault-tolerant data storage & processing in dynamic networks 动态网络中高能效容错数据存储与处理

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491325

Chien-An Chen, M. Won, R. Stoleru, G. Xie

引用次数: 20

Informative counting: fine-grained batch authentication for large-scale RFID systems 信息计数:大规模RFID系统的细粒度批量认证

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491299

Wei Gong, Kebin Liu, Xin Miao, Q. Ma, Zheng Yang, Yunhao Liu

引用次数: 41

Adaptive channel bonding in multicarrier wireless networks 多载波无线网络中的自适应信道绑定

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491328

Pei Huang, Xi Yang, Li Xiao

{"title":"Adaptive channel bonding in multicarrier wireless networks","authors":"Pei Huang, Xi Yang, Li Xiao","doi":"10.1145/2491288.2491328","DOIUrl":"https://doi.org/10.1145/2491288.2491328","url":null,"abstract":"To support high data rate applications such as multimedia streaming, the ongoing standardization of the next generation Wi-Fi increases the channel bonding from 40 MHz in 802.11n to 80, and even 160 MHz under certain conditions in 802.11ac. However, inefficiency and unfairness issues arise when devices that use different channel widths coexist in a contention domain. A device with channel bonding has to wait until all bonded channels to be idle to commence a transmission while narrow channel interferers have more channel access opportunities. To address the inefficiency and unfairness issues in channel bonding, we propose an adaptive channel bonding (ACB) protocol in which a node is allowed to initiate a transmission as long as a narrow channel is available and gradually increase channel width during transmission whenever a new narrow channel becomes available. ACB aggregates all available narrow channels as one wide channel, removing the need of setting guard bands between contiguous narrow channels. A challenge in the design is the communication over uncertain channels. To enable fast spectrum agreement between transmitter and receiver, a partial spectrum correlation method is introduced. ACB also considers the severe contention in a wide band of spectrum. When new channels become available, multiple nodes may contend for them. A compound preamble is designed to make collisions detectable in the frequency domain and a parallel bitwise arbitration mechanism is introduced to quickly resolve the collisions in the time domain. We implemented and evaluated the ACB through the GNU Radio/USRP platform. Experimental results show that ACB can well address the inefficiency and unfairness issues caused by heterogeneous radio coexistence.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121187512","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}

引用次数: 8

Community based cooperative content caching in social wireless networks 社交无线网络中基于社区的协作内容缓存

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491318

Mahmoud Taghizadeh, S. Biswas

引用次数: 8

Practical opportunistic routing in high-speed multi-rate wireless mesh networks 高速多速率无线网状网络中的实用机会路由

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491310

Wei Hu, Jin Xie, Zhenghao Zhang

引用次数: 26

SMASHER: a strategy-proof combinatorial auction mechanism for heterogeneous channel redistribution SMASHER:异构渠道再分配的无策略组合拍卖机制

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491330

Zhenzhe Zheng, Fan Wu, Guihai Chen

引用次数: 16

Quantize-map-forward (QMF) relaying: an experimental study 量子化前向映射(QMF)中继:一种实验研究

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491307

M. Duarte, Ayan Sengupta, Siddhartha Brahma, C. Fragouli, S. Diggavi

引用次数: 20

Minimum makespan workload dissemination in DTNs: making full utilization of computational surplus around ddn中最小完工时间工作负载分配:充分利用周围的计算剩余

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing Pub Date : 2013-07-29 DOI: 10.1145/2491288.2491327

S. Zhang, Jie Wu, Sanglu Lu

引用次数: 18