IEEE INFOCOM 2008 - The 27th Conference on Computer Communications最新文献_第5页

Capacity of Asynchronous Random-Access Scheduling in Wireless Networks 无线网络中异步随机访问调度的容量

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.170

Deepti Chafekar, Dave Levin, V. S. A. Kumar, M. Marathe, S. Parthasarathy, A. Srinivasan

{"title":"Capacity of Asynchronous Random-Access Scheduling in Wireless Networks","authors":"Deepti Chafekar, Dave Levin, V. S. A. Kumar, M. Marathe, S. Parthasarathy, A. Srinivasan","doi":"10.1109/INFOCOM.2008.170","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.170","url":null,"abstract":"We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible. We show that the competitiveness of our strategies are nearly the best achievable via random-access scheduling, thus establishing fundamental limits on the performance of random- access. A notable outcome of our work is that random access compares well with deterministic scheduling when link transmission durations differ by small factors, and much worse otherwise. The distinguishing aspects of our work include modeling and rigorous analysis of asynchronous communication, asymmetry in link transmission durations, and hidden terminals under arbitrary link-conflict based wireless interference models.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128999650","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

CTU: Capturing Throughput Dependencies in UWB Networks CTU:捕获超宽带网络中的吞吐量依赖关系

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.88

Ioannis Broustis, Angelos Vlavianos, P. Krishnamurthy, S. Krishnamurthy

{"title":"CTU: Capturing Throughput Dependencies in UWB Networks","authors":"Ioannis Broustis, Angelos Vlavianos, P. Krishnamurthy, S. Krishnamurthy","doi":"10.1109/INFOCOM.2008.88","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.88","url":null,"abstract":"The inherent channel characteristics of impulse-based UWB networks affect the MAC layer performance significantly. Previous studies on evaluating MAC protocols are based on prolonged simulations, and do not account for the multiple-access interference that arises due to multipath delay spread. In this work, we develop CTU, an analytical framework that captures the performance of MAC protocols, while taking into account the underlying PHY layer effects. The key attributes that make CTU novel are: (a) It is modular and therefore flexible; it can be easily modified to provide a basis for characterizing and evaluating a wide range of MAC protocols designed for impulse-based UWB networks. The only requirements are that the MAC protocol under study be based on time-hopping, and the modulation scheme be pulse position modulation; these are common design decisions in most impulse based UWB networks, (b) It considers the channel characteristics in addition to MAC layer effects; in particular, CTU correlates probabilistically the multipath delay profile of the channel with the packet error rate. We employ CTU to evaluate the performance of a generic medium access procedure. We compare the results with those from extensive simulations and show the high accuracy of CTU. We use CTU to assess the impact of various system parameters on the MAC layer performance; we make several interesting observations that are discussed in depth.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129141591","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

Confidentiality Protection for Distributed Sensor Data Aggregation 分布式传感器数据聚合的保密性保护

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.20

Taiming Feng, Chuang Wang, Wensheng Zhang, L. Ruan

引用次数: 75

End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks 基于OFDM的线性多跳网络的端到端资源分配

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.140

Xiaolu Zhang, Wenhua Jiao, M. Tao

{"title":"End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks","authors":"Xiaolu Zhang, Wenhua Jiao, M. Tao","doi":"10.1109/INFOCOM.2008.140","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.140","url":null,"abstract":"We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple relays. The problem is to maximize the end-to-end average transmission rate under a long-term total power constraint by adapting the transmission power on each subcarrier over each hop and the transmission time used by each hop in every time frame. The solution to the problem is derived by decomposing it into two subproblems: short-term time and power allocation given an arbitrary total power constraint for each channel realization, and total power distribution over all channel realizations. We show that the optimal solution has the following features: the power allocation on subcarriers over each hop has the water-filling structure and a higher water level is given to the hop with relatively poor channel condition; meanwhile, the fraction of transmission time allocated to each hop is adjusted to keep the instantaneous rates over all hops equal. To tradeoff between performance, computational complexity and signalling overhead, three suboptimal resource allocation algorithms are also proposed. Numerical results are illustrated under different network settings and channel environments.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125394752","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

Circular Sailing Routing for Wireless Networks 无线网络的环形航行路由

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.192

Fan Li, Yu Wang

{"title":"Circular Sailing Routing for Wireless Networks","authors":"Fan Li, Yu Wang","doi":"10.1109/INFOCOM.2008.192","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.192","url":null,"abstract":"Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the shortest paths between sources and destinations in routing protocols to achieve smallest traveled distance. However, this leads to the uneven distribution of traffic load in a network. For example, wireless nodes in the center of the network will have heavier traffic since most of the shortest routes go through them. In this paper, we first describe a novel routing method, called circular sailing routing (CSR), which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by the distance on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path). We then extend CSR to a localized version, Localized CSR, by modifying the greedy routing without any additional communication overhead. Finally, we further propose CSR protocols for 3D networks where nodes are distributed in a 3D space instead of a 2D plane. For all proposed methods, we conduct simulations to study their performances and compare them with global shortest path routing or greedy routing.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123165052","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}

引用次数: 25

On the Feasibility of the Link Abstraction in (Rural) Mesh Networks 农村Mesh网络中链路抽象的可行性研究

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.21

Dattatraya Y. Gokhale, Sayandeep Sen, Kameswari Chebrolu, B. Raman

{"title":"On the Feasibility of the Link Abstraction in (Rural) Mesh Networks","authors":"Dattatraya Y. Gokhale, Sayandeep Sen, Kameswari Chebrolu, B. Raman","doi":"10.1109/INFOCOM.2008.21","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.21","url":null,"abstract":"Outdoor community mesh networks based on 802.11 have seen tremendous growth in the recent past. The current understanding is that wireless link performance in these settings in inherently unpredictable, due to multipath delay spread. Consequently, researchers have focused on developing intelligent routing techniques to achieve the best possible performance. In this paper, we are specifically interested in mesh networks in rural locations. We first present detailed measurements to show that the PHY layer in these settings is indeed stable and predictable. There is a strong correlation between the error rate and the received signal strength. We show that interference, and not multipath fading, is the primary cause of unpredictable performance. This is in sharp contrast with current widespread knowledge from prior studies. Furthermore, we corroborate our view with a fresh analysis of data presented in these prior studies. Based on our results, we argue that outdoor rural mesh networks can indeed be built with the link abstraction being valid. This has several design implications, and opens up a fresh perspective on a wide range of technical issues in this domain.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123029487","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}

引用次数: 56

iBubble: Multi-Keyword Routing Protocol for Heterogeneous Wireless Sensor Networks 异构无线传感器网络的多关键字路由协议

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.150

Xiaoming Lu, M. Spear, K. Levitt, S. F. Wu

{"title":"iBubble: Multi-Keyword Routing Protocol for Heterogeneous Wireless Sensor Networks","authors":"Xiaoming Lu, M. Spear, K. Levitt, S. F. Wu","doi":"10.1109/INFOCOM.2008.150","DOIUrl":"https://doi.org/10.1109/INFOCOM.2008.150","url":null,"abstract":"Many tasks require multiple sensing capabilities; in wireless sensor networks (WSNs), it is expensive to deploy a homogeneous network wherein every sensor has the same functionality. Instead, it is economical to deploy a heterogeneous network wherein sensors differ in their capabilities; in such a network, efficient data querying is essential. We propose a multi-keyword routing protocol, iBubble, for heterogeneous wireless sensor networks (HWSNs) where keywords describe sensor functionalities. iBubble provides an efficient query interface for locating data; queries are routed only along paths with nodes matching the query. iBubble utilizes an intelligent bubbling mechanism to propagate keywords to the base-station (BS). The keywords are aggregated via a novel use of lattices to reduce network cost. We show that iBubble can emulate diffusion and generally produce less traffic by restricting the query dissemination based upon both application type and data value. Our study analytically compares iBubble and diffusion, and formally characterizes the conditions required for iBubble to outperform diffusion in both static (fixed) and dynamic (mobile) networks. We did extensive simulations, our results match our theory and show that iBubble can outperform diffusion in many heterogeneous deployments when keyword distributions are \"clustered\" enough to satisfy the fraction of the network involved in a query/update defined by our analytical bound. Additionally, iBubble handles mobility, fault-tolerance, and provides network diagnosis via keyword bubbling. By utilizing keywords, iBubble bridges many routing and energy problems prevalent in WSNs, and provides a simple, uniform solution.","PeriodicalId":447520,"journal":{"name":"IEEE INFOCOM 2008 - The 27th Conference on Computer Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124988919","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

An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks 无线Ad-Hoc传感器网络中地理贪婪转发的信息模型

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.134

Zhen Jiang, Junchao Ma, W. Lou, Jie Wu

引用次数: 51

Channelization for Network Coding in Wireless Networks 无线网络中网络编码的信道化

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.82

Raju Kumar, Heesook Choi, Jaesheung Shin, T. L. Porta

引用次数: 1

DSCM: An Energy-Efficient and Rate-Optimal Multicast Protocol for Multihop Wireless Networks Using Distributed Source Coding DSCM:一种基于分布式源编码的多跳无线网络节能且速率最优的多播协议

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications Pub Date : 2008-04-13 DOI: 10.1109/INFOCOM.2008.295

Mina Sartipi, B. Vellambi, N. Rahnavard, F. Fekri

引用次数: 2