2014 IEEE International Conference on Distributed Computing in Sensor Systems最新文献_第6页

The Information Funnel: Exploiting Named Data for Information-Maximizing Data Collection 信息漏斗:利用命名数据实现信息最大化

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.32

Shiguang Wang, T. Abdelzaher, S. Gajendran, Ajith Herga, Sachin Kulkarni, Shen Li, Hengchang Liu, C. Suresh, Abhishek Sreenath, Hongwei Wang, William Dron, Alice Leung, R. Govindan, J. P. Hancock

{"title":"The Information Funnel: Exploiting Named Data for Information-Maximizing Data Collection","authors":"Shiguang Wang, T. Abdelzaher, S. Gajendran, Ajith Herga, Sachin Kulkarni, Shen Li, Hengchang Liu, C. Suresh, Abhishek Sreenath, Hongwei Wang, William Dron, Alice Leung, R. Govindan, J. P. Hancock","doi":"10.1109/DCOSS.2014.32","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.32","url":null,"abstract":"This paper describes the exploitation of hierarchical data names to achieve information-utility maximizing data collection in social sensing applications. We describe a novel transport abstraction, called the information funnel. It encapsulates a data collection protocol for social sensing that maximizes a measure of delivered information utility, that is the minimized data redundancy, by diversifying the data objects to be collected. The abstraction leverages named-data networking, a communication paradigm where data objects are named instead of hosts. We argue that this paradigm is especially suited for utility-maximizing transport in resource constrained environments, because hierarchical data names give rise to a notion of distance between named objects that is a function of only the topology of the name tree. This distance, in turn, can expose similarities between named objects that can be leveraged for minimizing redundancy among objects transmitted over bottlenecks, thereby maximizing their aggregate utility. With a proper hierarchical name space design, our protocol prioritizes transmission of data objects over bottlenecks to maximize information utility, with very weak assumptions on the utility function. This prioritization is achieved merely by comparing data name prefixes, without knowing application-level name semantics, which makes it generalizable across a wide range of applications. Evaluation results show that the information funnel improves the utility of the collected data objects compared to other lossy protocols.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123174219","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

A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs 一种快速容错的分布式近最优TDMA调度算法

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.44

Ashutosh Bhatia, R. Hansdah

{"title":"A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs","authors":"Ashutosh Bhatia, R. Hansdah","doi":"10.1109/DCOSS.2014.44","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.44","url":null,"abstract":"The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122677264","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}

引用次数: 3

Trajectory Approximation for Resource Constrained Mobile Sensor Networks 资源受限移动传感器网络的轨迹逼近

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.27

Ghulam Murtaza, S. Kanhere, A. Ignjatović, R. Jurdak, S. Jha

{"title":"Trajectory Approximation for Resource Constrained Mobile Sensor Networks","authors":"Ghulam Murtaza, S. Kanhere, A. Ignjatović, R. Jurdak, S. Jha","doi":"10.1109/DCOSS.2014.27","DOIUrl":"https://doi.org/10.1109/DCOSS.2014.27","url":null,"abstract":"Low-power compact sensor nodes are being increasingly used to collect trajectory data from moving objects such as wildlife. The size of this data can easily overwhelm the data storage available on these nodes. Moreover, the transmission of this extensive data over the wireless channel may prove to be difficult. The memory and energy constraints of these platforms underscores the need for lightweight online trajectory compression albeit without seriously affecting the accuracy of the mobility data. In this paper, we present a novel online Polygon Based Approximation (PBA) algorithm that uses regular polygons, the size of which is determined by the allowed spatial error, as the smallest spatial unit for approximating the raw GPS samples. PBA only stores the first GPS sample as a reference. Each subsequent point is approximated to the centre of the polygon containing the point. Furthermore, a coding scheme is proposed that encodes the relative position (distance and direction) of each polygon with respect to the preceding polygon in the trajectory. The resulting trajectory is thus a series of bit codes, that have pair-wise dependencies at the reference point. It is thus possible to easily reconstruct an approximation of the original trajectory by decoding the chain of codes starting with the first reference point. Encoding a single GPS sample is an O (1) operation, with an overall complexity of O (n). Moreover, PBA only requires the storage of two raw GPS samples in memory at any given time. The low complexity and small memory footprint of PBA make it particularly attractive for low-power sensor nodes. PBA is evaluated using GPS traces that capture the actual mobility of flying foxes in the wild. Our results demonstrate that PBA can achieve up to nine-fold memory savings as compared to Douglas-Peucker line simplification heuristic. While we present PBA in the context of low-power devices, it can be equally useful for other GPS-enabled devices such smartphones and car navigation units.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122891332","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}

引用次数: 2

Cooperative Modulation Diversity Applied to Heterogeneous Wireless Sensor Networks 协同调制分集在异构无线传感器网络中的应用

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-26 DOI: 10.1109/DCOSS.2014.58

M. P. Sousa, W. Lopes, F. Madeiro, M. Alencar

引用次数: 3

Indoor Occupant Positioning System Using Active RFID Deployment and Particle Filters 采用有源RFID部署和粒子过滤器的室内乘员定位系统

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-01 DOI: 10.1109/DCOSS.2014.53

Kevin Weekly, Han Zou, Lihua Xie, Q. Jia, A. Bayen

引用次数: 27

Poster Abstract: Semantically Enriched Object Identification for Internet of Things 摘要:面向物联网的语义丰富对象识别

2014 IEEE International Conference on Distributed Computing in Sensor Systems Pub Date : 2014-05-01 DOI: 10.1109/DCOSS.2014.64

Sejin Chun, Jooik Jung, Xiongnan Jin, Gunhee Cho, Kyong-Ho Lee

引用次数: 7