2010 Proceedings IEEE INFOCOM最新文献_第10页

An Optimization Based Distributed Algorithm for Mobile Data Gathering in Wireless Sensor Networks 一种基于优化的无线传感器网络移动数据采集分布式算法

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462184

Miao Zhao, Yuanyuan Yang

引用次数: 12

Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks 速率自适应无线网络并发传输的实用调度算法

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462013

Zhe Yang, Lin X. Cai, Wu-Sheng Lu

{"title":"Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks","authors":"Zhe Yang, Lin X. Cai, Wu-Sheng Lu","doi":"10.1109/INFCOM.2010.5462013","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462013","url":null,"abstract":"Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, because, due to mutual interference, each flow's throughput in a time slot is unknown before the scheduling decision of that slot is finalized. The capacity bound derived for rate-nonadaptive networks is no longer applicable either. In this paper, we first formulate the optimal scheduling problems with and without minimum per-flow throughput constraints. Given the hardness of the problems and the fact that the scheduling decisions should be made within a few milliseconds, we propose two simple yet effective searching algorithms which can quickly move towards better scheduling decisions. Thus, the proposed scheduling algorithms can achieve high network throughput and maintain long-term fairness among competing flows with low computational complexity. For the constrained optimization problem involved, we consider its dual problem and apply Lagrangian relaxation. We then incorporate a dual update procedure in the proposed searching algorithm to ensure that the searching results satisfy the constraints. Extensive simulations are conducted to demonstrate the effectiveness and efficiency of the proposed scheduling algorithms which are found to achieve throughputs close to the exhaustive searching results with much lower computational complexity.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116606516","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}

引用次数: 23

Metrics for Evaluating Video Streaming Quality in Lossy IEEE 802.11 Wireless Networks 有损IEEE 802.11无线网络中视频流质量评估指标

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5461979

An Chan, K. Zeng, P. Mohapatra, Sung-Ju Lee, S. Banerjee

{"title":"Metrics for Evaluating Video Streaming Quality in Lossy IEEE 802.11 Wireless Networks","authors":"An Chan, K. Zeng, P. Mohapatra, Sung-Ju Lee, S. Banerjee","doi":"10.1109/INFCOM.2010.5461979","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5461979","url":null,"abstract":"Peak Signal-to-Noise Ratio (PSNR) is the simplest and the most widely used video quality evaluation methodology. However, traditional PSNR calculations do not take the packet loss into account. This shortcoming, which is amplified in wireless networks, contributes to the inaccuracy in evaluating video streaming quality in wireless communications. Such inaccuracy in PSNR calculations adversely affects the development of video communications in wireless networks. This paper proposes a novel video quality evaluation methodology. As it not only considers the PSNR of a video, but also with modifications to handle the packet loss issue, we name this evaluation method MPSNR. MPSNR rectifies the inaccuracies in traditional PSNR computation, and helps us to approximate subjective video quality, Mean Opinion Score (MOS), more accurately. Using PSNR values calculated from MPSNR and simple network measurements, we apply linear regression techniques to derive two specific objective video quality metrics, PSNR-based Objective MOS (POMOS) and Rates-based Objective MOS (ROMOS). Through extensive experiments and human subjective tests, we show that the two metrics demonstrate high correlation with MOS. POMOS takes the averaged PSNR value of a video calculated from MPSNR as the only input. Despite its simplicity, it has a Pearson correlation of 0.8664 with the MOS. By adding a few other simple network measurements, such as the proportion of distorted frames in a video, ROMOS achieves an even higher Pearson correlation (0.9350) with the MOS. Compared with the PSNR metric from the traditional PSNR calculations, our metrics evaluate video streaming quality in wireless networks with a much higher accuracy while retaining the simplicity of PSNR calculation.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131566062","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}

引用次数: 68

A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks 齐次无线网络中计算3连通m控制集的一种新的常因子逼近

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462105

Donghyun Kim, Wei Wang, Xianyue Li, Zhao Zhang, Weili Wu

引用次数: 60

Topological Properties Affect the Power of Network Coding in Decentralized Broadcast 拓扑特性对分散广播网络编码能力的影响

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462081

Di Niu, Baochun Li

引用次数: 6

High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting 基于概率多重计数的高速逐流流量测量

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5461921

Peter Lieven, B. Scheuermann

引用次数: 43

Routing for Energy Minimization in the Speed Scaling Model 速度缩放模型中能量最小化的路由

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462071

M. Andrews, Antonio Fernández, Lisa Zhang, Wenbo Zhao

{"title":"Routing for Energy Minimization in the Speed Scaling Model","authors":"M. Andrews, Antonio Fernández, Lisa Zhang, Wenbo Zhao","doi":"10.1109/INFCOM.2010.5462071","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462071","url":null,"abstract":"We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the power consumption of telecommunication networks by matching the consumption of each network element to the amount of processing required for its carried traffic. Most existing research on speed scaling focuses on a single network element in isolation. We aim for a network-wide optimization. Specifically, we study a routing problem with the objective of provisioning guaranteed speed/bandwidth for a given demand matrix while minimizing energy consumption. Optimizing the routes critically relies on the characteristic of the energy curve $f(s)$, which is how energy is consumed as a function of the processing speed $s$. If $f$ is superadditive, we show that there is no bounded approximation in general for integral routing, i.e., each traffic demand follows a single path. This contrasts with the well-known logarithmic approximation for subadditive functions. However, for common energy curves such as polynomials $f(s) = mu s^{alpha}$, we are able to show a constant approximation via a simple scheme of randomized ounding. The scenario is quite different when a non-zero tartup cost $sigma$ ppears in the energy curve, e.g. $f(s) = left{ begin{array}{ll} 0 & mbox{ if } s=0sigma + mu s^{alpha}& mbox{ if } s>0 end{array}right.$. For this case a constant approximation is no longer feasible. In fact, for any alpha>1$, we show an $Omega(log^{frac{1}{4}}N)$ hardness result under a common complexity assumption. Here $N$ is the size of the network.) On the positive side we present $O((sigma/mu)^{1/alpha})$ and $O(K)$ approximations, where $K$ is the number of demands.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131834471","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}

引用次数: 101

A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping 基于交换跳径的节点故障弹性匿名通信协议

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462114

Fengjun Li, Bo Luo, Peng Liu, C. Chu

{"title":"A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping","authors":"Fengjun Li, Bo Luo, Peng Liu, C. Chu","doi":"10.1109/INFCOM.2010.5462114","DOIUrl":"https://doi.org/10.1109/INFCOM.2010.5462114","url":null,"abstract":"With rising concerns on user privacy over the Internet, anonymous communication systems that hide the identity of a participant from its partner or third parties are highly desired. Existing approaches either rely on a relative small set of pre-selected relay servers to redirect the messages, or use structured peer-to-peer systems to multicast messages among a set of relay groups. The pre-selection approaches provide good anonymity, but suffer from node failures and scalability problem. The peer-to-peer approaches are subject to node churns and high maintenance overhead, which are the intrinsic problems of P2P systems. In this paper, we present CAT, a node-failure-resilient anonymous communication protocol. In this protocol, relay servers are randomly assigned to relay groups. The initiator of a connection selects a set of relay groups instead of relay servers to set up anonymous paths. A valid path consists of relay servers, one from each selected relay group. The initiator explores valid anonymous paths via a probing process. Since the relative positions of relay servers in the path are commutative, there exist multiple anonymous yet commutative paths, which form an anonymous tunnel. When a connection encounters a node failure, it quickly switches to a nearest backup path in the tunnel through ``path hopping'''', without tampering the initiator or renegotiating the keys. Hence, the protocol is resilient to node failures. We also show that the protocol provides good anonymity even when facing types of active and passive attacks. Finally, the operating cost of CAT is analyzed and shown to be similar to other node-based anonymous communication protocols.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134417521","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

Towards Reliable Scheduling Schemes for Long-lived Replaceable Sensor Networks 长寿命可替换传感器网络的可靠调度方案研究

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462010

Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang

引用次数: 6

Estimating Link Reliability in Wireless Networks: An Empirical Study and Interference Modeling 无线网络链路可靠性评估:实证研究与干扰建模

2010 Proceedings IEEE INFOCOM Pub Date : 2010-03-14 DOI: 10.1109/INFCOM.2010.5462250

Shinuk Woo, Hwangnam Kim

引用次数: 19