2013 IEEE International Conference on Sensing, Communications and Networking (SECON)最新文献_第2页

Enabling sustainable sensing in adverse environments 在不利环境中实现可持续传感

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644989

Josiah D. Hester, T. King, A. Propst, K. Piratla, Jacob M. Sorber

引用次数: 4

Zigzag: Partial mutual revocation based trust management in tactical ad hoc networks 之字形:战术自组织网络中基于部分相互撤销的信任管理

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644971

Xin Chen, Harshal Patankar, Sencun Zhu, M. Srivatsa, Jeff Opper

{"title":"Zigzag: Partial mutual revocation based trust management in tactical ad hoc networks","authors":"Xin Chen, Harshal Patankar, Sencun Zhu, M. Srivatsa, Jeff Opper","doi":"10.1109/SAHCN.2013.6644971","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6644971","url":null,"abstract":"One of the key challenges in operational trust management is to continually monitor the behavior of a node and update its trust score accordingly - evidently, both speed and accuracy is of great importance here. To achieve these goals, several papers have explored the concept of mutual revocation (sometimes termed suicide) wherein the trust value of both the accuser and the accused node are temporarily set to zero without involving a quorum. In this paper we explore a partial mutual revocation approach wherein we design a class of trust update functions to temporarily punish both the accuser and accused node (without involving a quorum) - however, the trust update function does not essentially set their trust values to zero; instead it partially lowers the trust values of both the accuser and the accused. In addition, we allow a trusted authority or a quorum may (periodically) review such partial mutual revocations and update the trust values of the accuser and the accused nodes accordingly (e.g., reward the accuser and punish the accused if the accusation was deemed true). We present a detailed design of the trust update functions for partial mutual revocation. Through both analysis and simulations, we evaluate the effectiveness of partial revocation under different attack strategies and report its performance in terms of revocation immediacy, revocation accuracy and abuse resistance.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115125174","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

Network self-organization in the Internet of Things 物联网中的网络自组织

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/IOT-NC.2013.6694050

A. Athreya, P. Tague

引用次数: 25

Actuator quality in the Internet of Things 物联网中的执行器质量

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644957

J. Aráuz, Tony Fynn-Cudjoe

引用次数: 11

Ravine streams: Persistent data streams in disruptive sensor networks 峡谷流:破坏性传感器网络中的持久数据流

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6645016

Mingsen Xu, Wenzhan Song

{"title":"Ravine streams: Persistent data streams in disruptive sensor networks","authors":"Mingsen Xu, Wenzhan Song","doi":"10.1109/SAHCN.2013.6645016","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6645016","url":null,"abstract":"Opportunistic network coding has been developed and applied in disruptive networks to provide optimal data delivery. Though network coding system utilizes coding opportunities among multiple paths, its application in data collection suffers from a disconnected sink node and the limited storage space available for data cache. The state-of-the-art approach has studied preserving data persistence as an optimization problem under storage and energy constraints, without considering disruptive network dynamics during data redistribution. In this paper, we propose Ravine Streams (RS) to maximize data preservation under the constraints of limited storage and probabilistic node failure throughout data redistribution. Our RS approach leverages adaptive power control to achieve ensured storage of each redistribution data. Meanwhile, in the course of data redistribution, distributed coding-based rebroadcast strategy not only reduces the data duplication, but also improves the statistical property of symbol randomness. We show that the performance of preserving data persistence of proposed RS is approximately bounded by the optimal solutions. The experimental evaluations demonstrate that RS increases data delivery ratio, consumes even less communication energy with only comparable storage cost, when compared with existing data preserving algorithms.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132073068","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

Capacity optimization of femtocell networks 移动蜂窝网络的容量优化

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6645017

G. Fusco, N. Azimi, Himanshu Gupta

引用次数: 0

A prototype of Virtual Traffic Lights on Android-based smartphones android智能手机上的虚拟交通灯原型

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644984

Manuel Nakamurakare, Wantanee Viriyasitavat, O. Tonguz

引用次数: 21

ASIA: Accelerated secure in-network aggregation in vehicular sensing networks 亚洲:车辆传感网络中的加速安全网络内聚合

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6645023

Xiao Wang, P. Tague

{"title":"ASIA: Accelerated secure in-network aggregation in vehicular sensing networks","authors":"Xiao Wang, P. Tague","doi":"10.1109/SAHCN.2013.6645023","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6645023","url":null,"abstract":"Vehicular Ad-Hoc Networks (VANETs) can potentially become a sensing platform. In-network aggregation, a fundamental primitive for querying sensory data, has been shown to reduce overall communication overhead at large. To secure data aggregation in VANETs, existing schemes mainly rely on digital signatures. However, generating and verifying such signatures can cause high computational overhead. More importantly, time-consuming verifications lead to the vulnerability to signature flooding attacks in which a receiver cannot timely verify all messages before their respective deadlines. In this paper, we propose ASIA as an Accelerated Secure In-network Aggregation strategy that can accelerate message verifications and significantly reduce computational overhead while retaining satisfactory security. We replace the most common tree graph with a directed acyclic graph as the aggregation structure. Resulting redundancy in information flow offers the opportunity for misbehavior detection. Meanwhile, by leveraging time asymmetry, upstream nodes in the structure can verify downstream messages through the modified light-weight TESLA scheme. We analyze the security properties of ASIA and provide evaluation results. We show that ASIA can largely accelerate message verifications and drastically reduce computational and communication overhead compared to existing schemes using the resource-consuming Elliptic Curve Digital Signature Algorithm.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131508415","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

Recursive validation and clustering for distributed spectrum sensing in CR-MANET CR-MANET中分布式频谱感知的递归验证与聚类

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644997

Kanthakumar Pongaliur, T. Camp, Li Xiao

{"title":"Recursive validation and clustering for distributed spectrum sensing in CR-MANET","authors":"Kanthakumar Pongaliur, T. Camp, Li Xiao","doi":"10.1109/SAHCN.2013.6644997","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6644997","url":null,"abstract":"In cognitive radio networks, secondary users need to accurately identify primary user spectrum occupancy in order to use it. Accurate spectrum sensing is hindered by signal fading, hidden terminal problems, byzantine failures, etc. Centralized cooperative spectrum sensing works well if the secondary user network is infrastructure based and there is a centralized basestation making network wide decisions. When the secondary users network is a cognitive radio mobile ad-hoc network (CR-MANET), then decisions need to be made in a distributed manner and cooperative spectrum sensing introduces additional problems due to the presence of malicious users. These malicious secondary users encourage other secondary users to make a wrong spectrum occupancy decision by feeding inaccurate measurements. We study this problem and present a solution to improve primary user spectrum occupancy identification accuracy in the presence of malicious users. A virtual neighbor cluster is created in which the mobile device forms an evolving cluster of past neighbor devices that aids in validating the input gathered from the current neighboring devices. Next, a recursive partitioning around medoids based clustering is performed to identify a tightly bound set of valid inputs. The validated inputs from both the methods form a decision cluster and the data is fused to get the decision on primary user occupancy. Two data fusion strategies are presented and their use depends on the amount of dynamism in the CR-MANET. The analysis and results show the accuracy of primary user occupancy detection even in the presence of large number of malicious users and signal measurement errors.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133505830","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

TAS-MAC: A traffic-adaptive synchronous MAC protocol for wireless sensor networks TAS-MAC:无线传感器网络的流量自适应同步MAC协议

2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1145/2835180

Pei Huang, Chin-Jung Liu, Li Xiao

{"title":"TAS-MAC: A traffic-adaptive synchronous MAC protocol for wireless sensor networks","authors":"Pei Huang, Chin-Jung Liu, Li Xiao","doi":"10.1145/2835180","DOIUrl":"https://doi.org/10.1145/2835180","url":null,"abstract":"Duty cycling improves energy efficiency but limits throughput and introduces significant end-to-end delay in wireless sensor networks. In this paper, we present a traffic-adaptive synchronous MAC protocol (TAS-MAC), which is a high throughput low delay MAC protocol tailored for low power consumption. It achieves high throughput by using Time Division Multiple Access (TDMA) with a novel traffic-adaptive allocation mechanism that assigns time slots only to nodes located on active routes. TAS-MAC reduces the end-to-end delay by notifying all nodes on active routes of incoming traffic in advance. These nodes will claim time slots for data transmission and forward a packet through multiple hops in a cycle. The desirable traffic-adaptive feature is achieved by decomposing traffic notification and data transmission scheduling into two phases, specializing their duties and improving their efficiency respectively. Simulation results and tests on TelosB motes demonstrate that the two-phase design significantly improves the throughput of current synchronous MAC protocols and achieves the similar low delay of slot stealing assisted TDMA with much lower power consumption.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124458137","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}

引用次数: 34