2013 Proceedings IEEE INFOCOM最新文献_第8页

Data confidentiality and availability via secret sharing and node mobility in UWSN UWSN中基于秘密共享和节点移动的数据保密性和可用性

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566764

R. D. Pietro, Stefano Guarino

引用次数: 13

Inferring the periodicity in large-scale Internet measurements 推断大规模互联网测量的周期性

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566964

Oded Argon, Y. Shavitt, Udi Weinsberg

引用次数: 11

On the capacity of wireless CSMA/CA multihop networks 无线CSMA/CA多跳网络容量研究

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566924

R. Laufer, L. Kleinrock

引用次数: 43

NSFIB construction & aggregation with next hop of strict partial order 具有严格偏序下一跳的NSFIB构造与聚合

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566833

Qing Li, Mingwei Xu, Meng Chen

引用次数: 4

Beam scheduling and relay assignment in wireless relay networks with smart antennas 智能天线无线中继网络中的波束调度与中继分配

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566749

B. Mumey, Jian Tang, I. Judson, R. Wolff

引用次数: 2

Optimizing the collection of local decisions for time-constrained distributed detection in WSNs 基于时间约束的分布式检测的局部决策集合优化

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566992

Seksan Laitrakun, E. Coyle

{"title":"Optimizing the collection of local decisions for time-constrained distributed detection in WSNs","authors":"Seksan Laitrakun, E. Coyle","doi":"10.1109/INFCOM.2013.6566992","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6566992","url":null,"abstract":"We consider a distributed detection application for a fusion center that has a limited time to make a global decision by collecting, weighting, and fusing local decisions made by nodes in a wireless sensor network that uses a random access channel. When this time is not long enough to collect decisions from all nodes in the network, a strategy is needed for collecting those with the highest reliability. This is accomplished with an easily implemented modification of the random access protocol: the collection time is divided into frames and only nodes with a particular range of reliabilities compete for the channel within each frame. Nodes with the most reliable decisions attempt transmission in the first frame; nodes with the next most reliable set of decisions attempt in the next frame; etc. We formulate an optimization problem that determines the reliability interval that defines who attempts in each frame in order to minimize the Detection Error Probability (DEP) at the fusion center. When the noise distribution affecting nodes' local decisions is continuous, symmetric, unimodal, and has a monotone likelihood ratio, reliability thresholds that maximize the channel throughput in each frame are optimal when the ratio of the collection time to the number of nodes is small. The number of frames that should be used depends on whether the average reliability or the worst-case reliability of local decisions in each frame is used to determine the DEP.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134445945","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}

引用次数: 12

Hybrid pricing for TV white space database 电视空白空间数据库的混合定价

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567000

Xiaojun Feng, Qian Zhang, Jin Zhang

{"title":"Hybrid pricing for TV white space database","authors":"Xiaojun Feng, Qian Zhang, Jin Zhang","doi":"10.1109/INFCOM.2013.6567000","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567000","url":null,"abstract":"According to the recent rulings of the Federal Communications Commission (FCC), TV white spaces (TVWS) can now be accessed by secondary users (SUs) after a list of vacant TV channels is obtained via a geo-location database. Proper business models are essential for database operators to manage the cost of maintaining geo-location databases. Database access can be simultaneously priced under two different schemes: the registration scheme and the service plan scheme. In the registration scheme, the database reserves part of the TV bandwidth for registered White Space Devices (WSD) in a soft-license way. In the service plan scheme, WSDs are charged according to their queries. In this paper, we investigate the business model for the TVWS database under a hybrid pricing scheme. We consider the scenario where a database operator employs both the registration scheme and the service plan scheme to serve the SUs. The SUs' choices of different pricing schemes are modeled as a non-cooperative game and we derive distributed algorithms to achieve the Nash Equilibrium (NE). Considering the NE of the SUs, the database operator optimally determines the pricing parameters for both pricing schemes in terms of bandwidth reservation, registration fee and query plans.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134544073","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}

引用次数: 21

Intra-data-center traffic engineering with ensemble routing 集成路由的数据中心内流量工程

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567017

Ziyu Shao, Xin Jin, Wenjie Jiang, Minghua Chen, M. Chiang

{"title":"Intra-data-center traffic engineering with ensemble routing","authors":"Ziyu Shao, Xin Jin, Wenjie Jiang, Minghua Chen, M. Chiang","doi":"10.1109/INFCOM.2013.6567017","DOIUrl":"https://doi.org/10.1109/INFCOM.2013.6567017","url":null,"abstract":"Today's data centers are shared among multiple tenants running a wide range of applications. These applications require a network with a scalable and robust layer-2 network management solution that enables load-balancing and QoS provisioning. Ensemble routing was proposed to achieve management scalability and robustness by using Virtual Local Area Networks (VLANs) and operating on the granularity of flow ensembles, i.e. group of flows. The key challenge of intra-data-center traffic engineering with ensemble routing is the combinatorial optimization of VLAN assignment, i.e., optimally assigning flow ensembles to VLANs to achieve load balancing and low network costs. Based on the Markov approximation framework, we solve the VLAN assignment problem with a general objective function and arbitrary network topologies by designing approximation algorithms with close-to-optimal performance guarantees. We study several properties of our algorithms, including performance optimality, perturbation bound, convergence of algorithms and impacts of algorithmic parameter choices. Then we extend these results to variants of VLAN assignment problem, including interaction with TCP congestion and QoS considerations. We validate our analytical results by conducting extensive numerical experiments. The results show that our algorithms can be tuned to meet different temporal constraints, incorporate fine-grained traffic management, overcome traffic measurement limitations, and tolerate imprecise and incomplete traffic matrices.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130337261","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}

引用次数: 24

Into the Moana1 — Hypergraph-based network layer indirection 进入了基于Moana1 - hypergraph的间接网络层

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6567162

Yan Shvartzshnaider, M. Ott, O. Mehani, Guillaume Jourjon, T. Rakotoarivelo, D. Levy

引用次数: 0

When simplicity meets optimality: Efficient transmission power control with stochastic energy harvesting 当简单性满足最优性:随机能量收集的有效传输功率控制

2013 Proceedings IEEE INFOCOM Pub Date : 2013-04-14 DOI: 10.1109/INFCOM.2013.6566839

Qingsi Wang, M. Liu

引用次数: 44