2011 31st International Conference on Distributed Computing Systems Workshops最新文献_第4页

Cooperative File Sharing in Hybrid Delay Tolerant Networks 混合容延迟网络中的协同文件共享

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.68

Cong Liu, Jie Wu, X. Guan, Li Chen

引用次数: 7

Understanding Graph Sampling Algorithms for Social Network Analysis 理解社会网络分析的图采样算法

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.34

Tianyi Wang, Yang Chen, Zengbin Zhang, Tianyin Xu, Long Jin, Pan Hui, Beixing Deng, Xing Li

引用次数: 105

Link-Level Network Topology Generation 链路级网络拓扑生成

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.25

Mehmet Burak Akgün, M. H. Gunes

引用次数: 10

ID-based Safety Message Authentication for Security and Trust in Vehicular Networks 基于id的车载网络安全与信任安全消息认证

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.38

S. Biswas, J. Misic, V. Mišić

引用次数: 59

Performance Analysis of DSR Protocol under the Influence of RPGM Model in Mobile Ad-hoc Networks 移动自组网中RPGM模型影响下的DSR协议性能分析

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.57

K. Amjad

引用次数: 5

Fine-Grained Localization with Pairwise Nodes Coverage 具有成对节点覆盖的细粒度定位

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.19

Xiaoguang Li, Jie Wu

引用次数: 3

SenSec: A Scalable and Accurate Framework for Wireless Sensor Network Security Evaluation SenSec:无线传感器网络安全评估的可扩展和精确框架

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.26

Yi-Tao Wang, R. Bagrodia

引用次数: 13

Localized Energy-Aware Fault Management in Relay Based Sensor Networks 基于中继的传感器网络局部能量感知故障管理

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.21

A. Bari, S. Bandyopadhyay, A. Jaekel

{"title":"Localized Energy-Aware Fault Management in Relay Based Sensor Networks","authors":"A. Bari, S. Bandyopadhyay, A. Jaekel","doi":"10.1109/ICDCSW.2011.21","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.21","url":null,"abstract":"In a relay based two-tier sensor network the individual sensor nodes, constituting the lower tier of the network, are partitioned into clusters and transmit their data directly to their respective cluster heads. Higher-powered relay nodes act as cluster heads and form the upper tier of the sensor network, that communicates received data to the base station. In this model, if a relay node becomes faulty, all data from the cluster of the faulty node, as well as data from other clusters that is routed through the faulty node will be lost. To avoid this potentially large data loss, it is critical that, after a failure is detected, data is rerouted as quickly as possible to avoid the failed relay node. This is best achieved by allowing each individual relay node to take corrective action immediately after discovering that a relay node is faulty, without any directive from the base station. Furthermore, it is also important to ensure that the energy dissipation of the relay nodes, using the new route, is as low as possible. In this paper, we propose a novel approach, where only the nodes originally transmitting to the failed node has to change their routing information, and all other nodes continue to operate as before. This greatly simplifies the coordination and synchronization required to establish a new routing scheme, resulting in a faster response time and reduced data loss. We have proposed an integer linear program (ILP) formulation that determines a routing scheme using this approach. We also present a simple but effective heuristic, capable of handling much larger networks. Our simulation results clearly demonstrate that the proposed approach can lead to significant improvements in the lifetime of a two tier network, compared to existing techniques.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114189520","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}

引用次数: 0

Secure Location Verification with Randomly-Selected Base Stations 随机选择基站的安全位置验证

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.44

Matthew Holiday, N. Mittal, S. Venkatesan

引用次数: 8

A Low Energy and Adaptive Architecture for Efficient Routing and Robust Mobility Management in Wireless Sensor Networks 无线传感器网络中高效路由和鲁棒移动管理的低能量自适应架构

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.39

F. J. Atero, J. J. Vinagre-Díaz, E. Morgado, M. Wilby

{"title":"A Low Energy and Adaptive Architecture for Efficient Routing and Robust Mobility Management in Wireless Sensor Networks","authors":"F. J. Atero, J. J. Vinagre-Díaz, E. Morgado, M. Wilby","doi":"10.1109/ICDCSW.2011.39","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.39","url":null,"abstract":"Wireless sensor networks are composed of low cost and extremely power constrained sensor nodes which are scattered over a region forming multi-hop and self organized networks, making energy consumption a crucial design issue. These networks are used for various applications such as field monitoring, home automation, seismic and medical data collection or surveillance. Research has shown that clustering sensor nodes is an efficient method to manage energy consumption for prolonging the network lifetime. In this paper we propose a new architecture called HARP, a emph{Hierarchical Adaptive and Reliable Routing Protocol}, a clustering algorithm which builds inter-cluster and intra-cluster hierarchical trees, which are optimized to save power. This architecture is scalable and can be used in both homogeneous and heterogeneous wireless sensor networks. By means of the addition of a emph{recovery slot} in the scheduling scheme, HARP provides efficient link fault tolerance and also supports node mobility management. The same process can additionally function as a joining mechanism for newly deployed nodes. This architecture is highly adaptive to specific application requirements and provides bounded-time data transmissions. Furthermore, a new cluster head election formulation and its associated data gathering protocol (s-HARP) is proposed. This protocol optimizes and balances the energy consumption in the network. Our performance evaluation has shown that HARP and s-HARP can significantly reduce the energy consumption and prolong the useful lifetime of the network in typical applications as compared with the most popular wireless sensor network protocol.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125086574","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