2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems最新文献

筛选
英文 中文
Combining Analytical and Simulation Approaches for Estimating End-to-End Delay in Multi-hop Wireless Networks 多跳无线网络端到端时延估计的分析与仿真相结合
Francois Despaux, Yeqiong Song, Abdelkader Lahmadi
{"title":"Combining Analytical and Simulation Approaches for Estimating End-to-End Delay in Multi-hop Wireless Networks","authors":"Francois Despaux, Yeqiong Song, Abdelkader Lahmadi","doi":"10.1109/DCOSS.2012.31","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.31","url":null,"abstract":"In this work, we present an empirical support of an analytical approach which employs a frequency domain analysis for estimating end-to-end delay in multi-hop networks. The proposed analytical results of the end-to-end delay distribution are validated through simulation and compared with queueing based analysis by defining two concrete scenarios. Our results demonstrate that an analytical prediction schema is insufficient to provide an adequate estimation of the end-to-end delay distribution function, but it requires to be combined with a simulation method for detailed links and nodes latencies distribution.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"567 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123068155","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}
引用次数: 5
Secure Publish-Subscribe-Based In-Network Data Storage Service in Wireless Sensor Networks 基于安全发布订阅的无线传感器网络内数据存储服务
M. Abdullahi, Guojun Wang
{"title":"Secure Publish-Subscribe-Based In-Network Data Storage Service in Wireless Sensor Networks","authors":"M. Abdullahi, Guojun Wang","doi":"10.1109/DCOSS.2012.58","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.58","url":null,"abstract":"Recently, it was argued that the true potential of sensor network services can be realized only if they become an integral part of a larger context-aware distributed system. The benefit is that, the intergration allows sensor network services to be seamlessly accessible to remote users through devices that they are already familiar with. This integration can be simplified using a publish-subscribe system. However, the wireless medium facilitates eavesdropping and some data is sensitive. This makes the security extremely important. Furthermore, sensor nodes have limited power and processing resources, so standard security mechanisms, which are heavy in weight and resource consumption, are unsuitable. These challenges increase the need to develop comprehensive and secure solutions that achieve wider protection, while maintaining desirable network performance. In this paper, we propose a secure publish-subscribe-based in-network data storage service in WSNs to provide different security requirements such as confidentiality, authentication, integrity, availability, and authorized access.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116882091","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}
引用次数: 4
Personal Marks and Community Certificates: Detecting Clones in Wireless Mobile Social Networks 个人标志和社区证书:无线移动社交网络中的克隆检测
M. Barbera, A. Mei
{"title":"Personal Marks and Community Certificates: Detecting Clones in Wireless Mobile Social Networks","authors":"M. Barbera, A. Mei","doi":"10.1109/DCOSS.2012.22","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.22","url":null,"abstract":"We consider the problem of detecting clones in wireless mobile ad-hoc networks. We assume that one of the devices of the network has been cloned. Everything, including saved passwords, certificates and secret keys. We propose a solution in networks of mobile devices carried by individuals - composed by nodes that can communicate by short-range technology like bluetooth or Wi-Fi, and links appear and disappear according to social relationships between users. Our idea is to use social physical contacts, securely collected by wireless personal smart phones, as a biometric way to authenticate the owner of the device and detect the clone attack. We introduce two mechanisms: Personal Marks and Community Certificates. Personal Marks is a simple cryptographic protocol that works well when the adversary is an insider, a malicious node in the network that tries to use the stolen credentials in the social community of the original device that has been cloned. Community Certificates works well when the adversary is an outsider, a node that has the goal of using the stolen credentials when interacting with other nodes that are far in the social network from the original device. When combined, these mechanisms provide an excellent protection against this very strong attack. We prove our ideas and solutions with extensive simulations in both simulated and real world scenarios - with mobility traces collected in a real life experiment.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"155 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128701176","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}
引用次数: 6
Radiation Awareness in Three-Dimensional Wireless Sensor Networks 三维无线传感器网络中的辐射感知
S. Nikoletseas, Dimitra Patroumpa, V. Prasanna, C. Raptopoulos, J. Rolim
{"title":"Radiation Awareness in Three-Dimensional Wireless Sensor Networks","authors":"S. Nikoletseas, Dimitra Patroumpa, V. Prasanna, C. Raptopoulos, J. Rolim","doi":"10.1109/DCOSS.2012.21","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.21","url":null,"abstract":"This research attempts a first step towards investigating the aspect of radiation awareness in environments with abundant heterogeneous wireless networking. We call radiation at a point of a 3D wireless network the total amount of electromagnetic quantity the point is exposed to, our definition incorporates the effect of topology as well as the time domain, data traffic and environment aspects. Even if the impact of radiation to human health remains largely unexplored and controversial, we believe it is worth trying to understand and control. We first analyze radiation in well known topologies (random and grids), randomness is meant to capture not only node placement but also uncertainty of the wireless propagation model. This initial understanding of how radiation adds (over space and time) can be useful in network design, to reduce health risks. We then focus on the minimum radiation path problem of finding the lowest radiation trajectory of a person moving from a source to a destination point of the network region. We propose three heuristics which provide low radiation paths while keeping path length low, one heuristic gets in fact quite close to the offline solution we compute by a shortest path algorithm. Finally, we investigate the interesting impact on the heuristics' performance of diverse node mobility.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127390838","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}
引用次数: 11
Distributed Subspace Projection in Wireless Sensor Networks Using Computational Codes 基于计算码的无线传感器网络分布式子空间投影
Xabier Insausti, P. Crespo, B. Beferull-Lozano
{"title":"Distributed Subspace Projection in Wireless Sensor Networks Using Computational Codes","authors":"Xabier Insausti, P. Crespo, B. Beferull-Lozano","doi":"10.1109/DCOSS.2012.13","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.13","url":null,"abstract":"In this paper, we develop a new power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the Projection of an observed sampled spatial field on a subspace of lower dimension. This is an important problem that is motivated in various applications where there are well defined subspaces of interest (e.g. spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection assuming separation of channel coding and computation, our algorithm combines Computational Coding and a modification of existing Gossip Algorithms, achieving important savings in convergence time and yielding an exponential decrease in energy consumption as the size of the network increases.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125246224","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}
引用次数: 1
Resource Allocation with Stochastic Demands 随机需求下的资源分配
Fangfei Chen, T. L. Porta, M. Srivastava
{"title":"Resource Allocation with Stochastic Demands","authors":"Fangfei Chen, T. L. Porta, M. Srivastava","doi":"10.1109/DCOSS.2012.16","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.16","url":null,"abstract":"Resources in modern computer systems include not only CPU, but also memory, hard disk, bandwidth, etc. To serve multiple users simultaneously, we need to satisfy their requirements in all resource dimensions. Meanwhile, their demands follow a certain distribution and may change over time. Our goal is then to admit as many users as possible to the system without violating the resource capacity more often than a predefined overflow probability. In this paper, we study the problem of allocating multiple resources among a group of users/tasks with stochastic demands. We model it as a stochastic multi-dimensional knapsack problem. We extend and apply the concept of effective bandwidth in order to solve this problem efficiently. Via numerical experiments, we show that our algorithms achieve near-optimal performance with specified overflow probability.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132594467","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}
引用次数: 7
Demonstrating an Enhanced Ethernet Switch Supporting Video Sensing with Dynamic QoS 演示支持动态QoS视频感知的增强型以太网交换机
Rui Santos, P. Pedreiras, L. Almeida
{"title":"Demonstrating an Enhanced Ethernet Switch Supporting Video Sensing with Dynamic QoS","authors":"Rui Santos, P. Pedreiras, L. Almeida","doi":"10.1109/DCOSS.2012.60","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.60","url":null,"abstract":"Video applications, which include industrial uses like machine vision, object tracking, surveillance, driving aids, etc. are becoming increasingly common. These sensors produce large amounts of data, being normally compressed at the source nodes to save network bandwidth. As a side effect, video streams exhibit a large variability in their bandwidth utilization. On the other hand, many video applications are highly dynamic. For instance, a video surveillance application can meet its goals with a low frame-rate video, when the environment being monitored is static, but require an high frame-rate when the environment changes. Another example is applications that have several video sources that are activated on demand. For instance, a rear-view video camera, nowadays commonly found in cars and trucks, is only necessary during certain maneuvers. Applications like the ones presented above can be efficiently supported by enhanced Ethernet switching that provides hierarchical server-based traffic scheduling, in particular by the FTT-enabled switch [1] [2] that resulted from instantiating the FTT (Flexible Time-Triggered) communication paradigm [3] onto a customized Ethernet switch. Servers are, in fact, adequate abstractions to handle real-time video transmission since:1) servers discipline the use of the network, thus coping with the large variability of compressed video sources, 2) the adaptability, obtained by changing the servers budget, permits varying dynamically the bandwidth allocated to each video stream, 3) the reconfigurability permits enabling and disabling video-streams. We demonstrate these features with a simplified video surveillance demo, using the setup shown in Figure 1.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123894450","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
A Novel Virtual Force Approach for Node Deployment in Wireless Sensor Network 基于虚拟力的无线传感器网络节点部署方法
Xiangyu Yu, Weipéng Huáng, Junjian Lan, Xin Qian
{"title":"A Novel Virtual Force Approach for Node Deployment in Wireless Sensor Network","authors":"Xiangyu Yu, Weipéng Huáng, Junjian Lan, Xin Qian","doi":"10.1109/DCOSS.2012.32","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.32","url":null,"abstract":"The effectiveness of wireless sensor networks (WSN) depends on the coverage and connectivity provided by node deployment, which is one of the key topics in WSN. In this paper, a modified virtual force-based node self-deployment algorithm for nodes with mobility is proposed. In the virtual force-based approach, all nodes are seen as points subject to repulsive and attractive force exerted among them, nodes can move according to the calculated force. In the proposed approach, Delaunay triangulation is formed with these nodes, adjacent relationship is defined if two nodes are connected in the Delaunay diagram. Force can only be exerted from those adjacent nodes within the communication range. Simulation results showed that the proposed approach has higher coverage rate and faster convergence time than traditional virtual force algorithm.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121917953","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}
引用次数: 78
Revisiting Multi-channel Communication to Mitigate Interference and Link Dynamics in Wireless Sensor Networks 无线传感器网络中多通道通信缓解干扰和链路动态的研究
A. Gonga, O. Landsiedel, Pablo Soldati, M. Johansson
{"title":"Revisiting Multi-channel Communication to Mitigate Interference and Link Dynamics in Wireless Sensor Networks","authors":"A. Gonga, O. Landsiedel, Pablo Soldati, M. Johansson","doi":"10.1109/DCOSS.2012.15","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.15","url":null,"abstract":"Multichannel communication has been proposed as alternative to adaptive (single-channel) routing protocols for mitigating the impact of interference and link dynamics in wireless sensor networks. While several studies have advocated features of both techniques (not without running up against contradicting arguments) a comprehensive study that aligns these results is still lacking. This paper aims at filling this gap. We present an experimental test bed setup used to perform extensive measurements for both single-channel and multichannel communication. We first analyze single-channel and multichannel communication over a single-hop in terms of packet reception ratio, maximum burst loss, temporal correlation of losses, and loss correlations across channels. Results show that multichannel communication with channel hopping significantly reduces link burstiness and packet loss correlation. For multi-hop networks, multi-channel communication and adaptive routing show similar end-to-end reliability in dense topologies, while multichannel communication can outperform adaptive routing in sparse networks with bursty links.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121518580","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
Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm 传感器网络中的高效图平面化与局部路由算法
Florian Huc, Aubin Jarry, Pierre Leone, J. Rolim
{"title":"Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm","authors":"Florian Huc, Aubin Jarry, Pierre Leone, J. Rolim","doi":"10.1109/DCOSS.2012.64","DOIUrl":"https://doi.org/10.1109/DCOSS.2012.64","url":null,"abstract":"In this paper, we propose an efficient planarization algorithm and a routing algorithm dedicated to Unit Disk Graphs whose nodes are localized using the Virtual Raw Anchor Coordinate system (VRAC).Our first algorithm computes a planar 2-spanner under light constraints on the edge lengths and induces a total exchange of at most 6n node identifiers. Its total complexity is O(nΔ), with Δ the maximum degree of the communication graph. The second algorithm that we present is a simple and efficient algorithm to route messages in this planar graph that requires routing tables with only three entries. We support these theoretical results by simulations showing the robustness of our algorithms when the coordinates are inaccurate.","PeriodicalId":448418,"journal":{"name":"2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121098295","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信