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

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing 第十四届ACM移动自组织网络和计算国际研讨会论文集

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

A. Chockalingam, D. Manjunath, M. Franceschetti, L. Tassiulas

引用次数: 17

Cut-and-sew: a distributed autonomous localization algorithm for 3D surface wireless sensor networks 裁剪缝合:三维表面无线传感器网络的分布式自主定位算法

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

Yao Zhao, Hongyi Wu, Miao Jin, Yang Yang, Hongyu Zhou, S. Xia

{"title":"Cut-and-sew: a distributed autonomous localization algorithm for 3D surface wireless sensor networks","authors":"Yao Zhao, Hongyi Wu, Miao Jin, Yang Yang, Hongyu Zhou, S. Xia","doi":"10.1145/2491288.2491301","DOIUrl":"https://doi.org/10.1145/2491288.2491301","url":null,"abstract":"Location awareness is imperative for a variety of sensing applications and network operations. Although a diversity of GPS-less and GPS-free solutions have been developed recently for autonomous localization in wireless sensor networks, they primarily target at 2D planar or 3D volumetric settings. There exists unique and fundamental hardness to extend them to 3D surface. The contributions of this work are twofold. First, it proposes a theoretically-proven algorithm for the 3D surface localization problem. Seeing the challenges to localize general 3D surface networks and the solvability of the localization problem on single-value (SV) surface, this work proposes the {em cut-and-sew} algorithm that takes a divide-and-conquer approach by partitioning a general 3D surface network into SV patches, which are localized individually and then merged into a unified coordinates system. The algorithm is optimized by discovering the minimum SV partition, an optimal partition that creates a minimum set of SV patches. Second, it develops practically-viable solutions for real-world sensor network settings where the inputs are often noisy. The proposed algorithm is implemented and evaluated via simulations and experiments in an indoor testbed. The results demonstrate that the proposed cut-and-sew algorithm achieves perfect 100% localization rate and the desired robustness against measurement errors.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"15 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":"124265623","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

Continuous scanning with mobile reader in RFID systems: an experimental study 无线射频识别系统中移动阅读器的连续扫描:实验研究

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

Lei Xie, Qun A. Li, X. Chen, Sanglu Lu, Daoxu Chen

引用次数: 36

Realtime streaming with guaranteed QoS over wireless D2D networks 在无线D2D网络上具有保证QoS的实时流

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

Navid Abedini, Swetha Sampath, Rajarshi Bhattacharyya, Suman Paul, S. Shakkottai

引用次数: 26

Energy-efficient reliable data dissemination in duty-cycled wireless sensor networks 占空比无线传感器网络中节能可靠的数据传播

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

K. Han, Liu Xiang, Jun Luo, Mingjun Xiao, Liusheng Huang

引用次数: 15

Connecting, scaling and securing RS code and TD based KPDs in WSNs: deterministic merging 无线传感器网络中RS代码和基于TD的kpd的连接、扩展和保护:确定性合并

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

Pinaki Sarkar, B. K. Rai, Aritra Dhar

引用次数: 4

Connectivity in obstructed wireless networks: from geometry to percolation 受阻无线网络中的连接:从几何到渗透

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

Marcelo G. Almiron, Olga Goussevskaia, A. Loureiro, J. Rolim

引用次数: 12

Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks 在不可靠的无线传感器网络中，以最小的远程数据传输成本最大化网络吞吐量

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

Xu Xu, W. Liang, X. Jia, Wenzheng Xu

引用次数: 2

Qute: quality-of-monitoring aware sensing and routing strategy in wireless sensor networks 无线传感器网络中监测质量感知感知与路由策略

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

Shaojie Tang, Jie Wu

{"title":"Qute: quality-of-monitoring aware sensing and routing strategy in wireless sensor networks","authors":"Shaojie Tang, Jie Wu","doi":"10.1145/2491288.2491311","DOIUrl":"https://doi.org/10.1145/2491288.2491311","url":null,"abstract":"Wireless Sensor Networks (WSNs) are widely used to monitor the physical environment. In a highly redundant sensor network, sensor readings from nearby sensors often have high similarity. In this work, we are interested in how to decide an appropriate sensing rate for each sensor node, in order to maximize the overall Quality-of-Monitoring (QoM), while ensuring that all readings can be transmitted to the sink. Note that a feasible sensing rate allocation should satisfy both energy constraint on each sensor node and flow conservation through the network. In order to capture the statistical correlations among sensor readings, we first introduce the concept of correlation graph. The correlation graph is further decomposed into several correlation components, and sensor readings from the same correlation component are highly correlated. For each correlation component, we defined a general utility function to estimate the QoM. The utility function of each correlation component is a non-decreasing submodular function of the total sensing rates allocated to that correlation component. Then we formulate the QoM-aware sensing rate allocation problem as a utility maximization problem under limited power supply on each node. To tackle this problem, we adopted an efficient algorithm, called Qute, by jointly considering both the energy constraint on each node and flow conservation through the network. Under some settings, we analytically show that Qute can find the optimal QoM-aware sensing rate allocation which achieves the maximum total utility. We conducted extensive testbed verifications of our schemes, and experimental results validate our theoretical results.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"4 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":"114979980","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}

引用次数: 10

Characteristic function of connectivity with obstacles 与障碍物连接的特征函数

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

Yun Wu, Xinbing Wang

引用次数: 0