Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications最新文献_第7页

Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms 人类移动性对机会转发算法设计的影响

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.172

A. Chaintreau, Pan Hui, J. Crowcroft, C. Diot, Richard Gass, James Scott

引用次数: 648

Towards Performance Modeling of IEEE 802.11 Based Wireless Networks: A Unified Framework and Its Applications 基于IEEE 802.11的无线网络性能建模:一个统一框架及其应用

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.219

K. Medepalli, F. Tobagi

{"title":"Towards Performance Modeling of IEEE 802.11 Based Wireless Networks: A Unified Framework and Its Applications","authors":"K. Medepalli, F. Tobagi","doi":"10.1109/INFOCOM.2006.219","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.219","url":null,"abstract":"We present a simple analytical model for IEEE 802.11 based wireless networks that effectively captures the important network performance characteristics such as throughput, delay and fairness. Several new insights relevant to network design are obtained by considering simple special cases of the model. Key features of our unified model include the ability to handle hidden/exposed terminals, directional antennas, multiple channels and arbitrary traffic matrices. The analytical framework is first applied to study the saturation throughput in a multi-hop setting. The associated flow starvation problem is investigated in detail and it is found that Exponential Backoff (EB) plays a much smaller role in flow starvation when compared to the minimum contention window (CWmin). We then illustrate applicability of our model to address key network design questions such as determining the feasibility of a particular traffic matrix and identifying bottlenecks. We also apply the framework to study the important problem of improving throughput and fairness in a multi-hop setting. It is observed from our results that a MAC protocol that adapts its minimum contention window CWmin is of greater utility than one that adapts to a value between fixed CWmin and CWmax (as the current EB in IEEE 802.11 does). Finally, guided by the model, we present a simple heuristic called Effective Contention Indicator (ECI) which identifies, to first-order, links experiencing severe contention.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"535 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133036356","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}

引用次数: 169

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting 均匀分布和均匀报告传感器网络中最大寿命和避免能量空洞的设计准则

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.296

S. Olariu, I. Stojmenovic

{"title":"Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting","authors":"S. Olariu, I. Stojmenovic","doi":"10.1109/INFOCOM.2006.296","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.296","url":null,"abstract":"This paper investigates theoretical aspects of the uneven energy depletion phenomenon recently noticed in sink-based wireless sensor networks. We consider uniformly distributed sensors, each sending roughly the same number of reports toward the closest sink. We assume an energy consumption model governed by the relation E = d +c where d, (d ≤ tx), is the transmission distance, α ≥ 2 is the power attenuation, c is a technology-dependent positive constant, and tx is the maximum transmission range of sensors. Our results are multifold. First, we show that for α > 2, all sensors whose distance to the sink is min{tx, ( 2c α−2 ) 1 α } should transmit directly to the sink. Interestingly, this limit does not depend on the size of the network, expressed as the largest distance R from a sensor to the closest sink. Next, we prove that in order to minimize the total amount of energy spent on routing along a path originating at a sensor in a corona and ending at the sink, all the coronas must have the same width, equal to the above expression. This choice, however, leads to uneven energy depletion and to the creation of energy holes. We show that for α > 2 the uneven energy depletion can be prevented by judicious system design, resulting in balanced energy expenditure across the network. We describe an iterative process for determining the sizes of coronas. Their optimal sizes (and corresponding transmission radii) and the number of coronas depend on R. As expected, the width of coronas in energy-balanced sensor network increases. Finally, we show that for α = 2, the uneven energy depletion phenomenon is intrinsic to the system and no routing strategy can avoid the creation of an energy hole around the sink.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132122143","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}

引用次数: 550

Landmark-Based Information Storage and Retrieval in Sensor Networks 传感器网络中基于地标的信息存储与检索

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.115

Qing Fang, Jie Gao, L. Guibas

{"title":"Landmark-Based Information Storage and Retrieval in Sensor Networks","authors":"Qing Fang, Jie Gao, L. Guibas","doi":"10.1109/INFOCOM.2006.115","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.115","url":null,"abstract":"For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-centric storage/retrieval scheme for information producers and information consumers in sensor networks. Our scheme is built upon the Gradient Landmark-Based Distributed Routing protocol (GLIDER) [8], a two-level routing scheme where sensor nodes are partitioned into tiles by their graph distances to a small set of local landmarks so that localized and efficient routing can be achieved inside and across tiles. Our information storage and retrieval scheme uses two ideas on top of the GLIDER hierarchy — a distributed hash table on the combinatorial tile adjacency graph and a double-ruling scheme within each tile. Queries follow a path that will provably reach the data replicated by the producer(s). We show that this scheme compares favorably with previously proposed schemes, such as Geographic Hash Tables (GHT), providing comparable data storage performance and better locality-aware data retrieval performance. More importantly, this scheme uses no geographic information, makes few assumptions on the network model, and achieves better load balancing and structured data processing and aggregation even for sensor fields with complex geometric shapes and non-trivial topology.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"107 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113969419","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}

引用次数: 105

QoS, Properties and Views to Achieve Dynamic Adaptivity 实现动态自适应的QoS、属性和视图

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.81

S. Mussino, M. Riva

引用次数: 0

A Novel Dual Channel MAC Protocol for IEEE802.11 Ad-Hoc Networks 一种新的IEEE802.11 Ad-Hoc网络双通道MAC协议

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.70

P. Ng, D. Edwards, S. Liew

引用次数: 0

Capturing the Variability of Internet Flows Across Time 捕捉互联网流量随时间的变化

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.37

Jörg Wallerich, A. Feldmann

引用次数: 17

TCP as an Implementation of Age-Based Scheduling: Fairness and Performance TCP作为基于年龄调度的实现:公平性和性能

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.103

A. Kherani, R. Nunez-queija

{"title":"TCP as an Implementation of Age-Based Scheduling: Fairness and Performance","authors":"A. Kherani, R. Nunez-queija","doi":"10.1109/INFOCOM.2006.103","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.103","url":null,"abstract":"We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are able to position variants of TCP in a wide spectrum having FCFS (first-come first-served) and LAS (least attained service first) as extremal policies, and including PS (processor sharing) as an intermediate case. We argue that for highly loaded systems, providing a fair bandwidth allocation among all users is secondary to ensuring network stability. So as to isolate protocol fairness from congestion effects, we therefore focus on scenarios with infinite buffers. This way, asymmetries in capacity shares are the consequences of the protocol only, and not affected by the packet loss process. The model, however, is flexible enough to include finite buffers with random packet loss as a special case (for example to capture Active Queue Management). The results are helpful in studying fairness and performance concerned with transmission protocols in communication networks. For persistent HTTP connections we study the distributions of the transmission rates and the relative fairness index under various assumptions on the file size distributions and scheduling disciplines. For infinite file sizes, we show that protocols that increase priority more than linearly with the attained service asymptotically behave similar to FCFS. In contrast, protocols with at most linearly increasing (or even decreasing) priority, with TCP's Congestion Avoidance mechanism as the most prominent example, converge to PS scheduling (even in absence of losses). When the priority is exactly linear in the attained service, such as for scalable TCP and TCP's slow start phase, the shares remain constant in between file initiations and completions.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127393353","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}

引用次数: 20

Relayed Multicast Scheme in IEEE 802.11 Wireless LAN Systems IEEE 802.11无线局域网系统中的中继组播方案

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.78

K. Yoon, Y. Kim

引用次数: 4

BPB: A Novel Approach for Obtaining Network Path Characteristics in Non-Cooperative Environments 一种获取非合作环境下网络路径特征的新方法

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.68

Sven Hessler

引用次数: 1