Proceedings of the 2006 IEEE International Conference on Network Protocols最新文献

A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas 无方向性天线无线网络中联合感知与路由的分布式算法

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320215

Chun Zhang, J. Kurose, Yong Liu, D. Towsley, M. Zink

{"title":"A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas","authors":"Chun Zhang, J. Kurose, Yong Liu, D. Towsley, M. Zink","doi":"10.1109/ICNP.2006.320215","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320215","url":null,"abstract":"In many energy-rechargeable wireless sensor networks, sensor nodes must both sense data from the environment, and cooperatively forward sensed data to data sinks. Both data sensing and data forwarding (including data transmission and reception) consume energy at sensor nodes. We present a distributed algorithm for optimal joint allocation of energy between sensing and communication at each node to maximize overall system utility (i.e., the aggregate amount of information received at the data sinks). We consider this problem in the context of wireless sensor networks with directional, non-steerable antennas. We first formulate a joint data-sensing and data-routing optimization problem with both per-node energy-expenditure constraints, and traditional flow routing/conservation constraints. We then simplify this problem by converting it to an equivalent routing problem, and present a distributed gradient-based algorithm that iteratively adjusts the per-node amount of energy allocated between sensing and communication to reach the system-wide optimum. We prove that our algorithm converges to the maximum system utility. We quantitatively demonstrate the energy balance achieved by this algorithm in a network of small, energy-constrained X-band radars, connected via point- to-point 802.11 links with non-steerable directional antennas.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"82 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120989004","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}

引用次数: 27

Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks Ad Hoc和传感器网络中具有保证消息传递的虚拟周边面地理投射

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320213

Jie Lian, S. Naik, Yunhao Liu, Lei Chen

引用次数: 35

Cross-Layer Exploitation of MAC Layer Diversity in Wireless Networks 无线网络中MAC层分集的跨层开发

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320183

M. Cao, V. Raghunathan, P. Kumar

{"title":"Cross-Layer Exploitation of MAC Layer Diversity in Wireless Networks","authors":"M. Cao, V. Raghunathan, P. Kumar","doi":"10.1109/ICNP.2006.320183","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320183","url":null,"abstract":"The conventional function of the medium access control (MAC) layer in wireless networks is interference management. We show how the MAC can also be used to mitigate the effect of fading. We begin by providing experimental data to demonstrate that multipath fading effects are seen at the MAC layer. These effects appear at timescales on the same order of the IEEE 802.11 protocol and therefore, interact negatively with the RTS-CTS-DATA-ACK handshake. We identify two types of MAC diversities to jointly combat fading and interference, called multi-receiver diversity and multi-channel diversity respectively, through canonical scenarios. In order to harness these MAC layer diversities, we propose a simple dynamic-binding multichannel MAC (DB-MCMAC) protocol that is backward compatible with IEEE 802.11. DB-MCMAC exploits MAC diversities by opportunistically acquiring the floor for the best receiver on each channel, and dynamically binding data transmissions after the floor has been acquired. We employ a simple continuous time Markov chain model to analyze the expected performance of the DB-MCMAC protocol. A comprehensive performance evaluation of DB-MCMAC using ns-2 shows that it can successfully harness multi-receiver and multi-channel fading and interference diversities to provide considerable improvements over a baseline multi-channel MAC in several situations.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114346247","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}

引用次数: 29

Throughput Guaranteed Restorable Routing Without Traffic Prediction 无流量预测的吞吐量保证可恢复路由

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320207

M. Kodialam, T. V. Lakshman, S. Sengupta

{"title":"Throughput Guaranteed Restorable Routing Without Traffic Prediction","authors":"M. Kodialam, T. V. Lakshman, S. Sengupta","doi":"10.1109/ICNP.2006.320207","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320207","url":null,"abstract":"Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been recently proposed for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Pre-configuring the network in a traffic independent manner using two-phase routing simplifies network operation considerably. In this paper, we extend this routing scheme by providing resiliency against link failures through two different fast restoration mechanisms - local (link/span) based and end-to-end (path) based. We view this as important progress towards adding carrier-class reliability to the robustness of the scheme so as to facilitate its future deployment in Internet service provider (ISP) networks. The main contribution of the paper is the development of fast combinatorial algorithms for routing under the scheme with link and path restoration mechanisms so as to minimize the maximum utilization of any link in the network, or equivalently, maximize the throughput. The algorithms developed are fully polynomial time approximation schemes (FPTAS) - for any given epsi > 0, an FPTAS guarantees a solution that is within a (1 + epsi) -factor of the optimum and runs in time polynomial in the input size and 1/epsi. To the best of our knowledge, this is the first work in the literature that considers making the scheme resilient to link failures through pre-provisioned fast restoration mechanisms. We evaluate the performance of link and path restoration (in terms of throughput) and compare it with that of unprotected routing. For our experiments, we use actual ISP network topologies collected for the Rocketfuel project.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122022575","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}

引用次数: 9

DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems DPTree:对等系统的平衡树索引框架

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320194

Mei Li, Wang-Chien Lee, A. Sivasubramaniam

{"title":"DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems","authors":"Mei Li, Wang-Chien Lee, A. Sivasubramaniam","doi":"10.1109/ICNP.2006.320194","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320194","url":null,"abstract":"Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally identified by multiple attributes, a fundamental issue in P2P systems is to efficiently support complex queries on multidimensional data. Prior works suffer from some fundamental limitations, such as being constrained to support certain types of queries, excessive maintenance overheads, and etc. In this study, we propose a framework, called distributed peer tree (DPTree), which efficiently supports various types of queries on multidimensional data in P2P systems based on balanced tree indexes. DPTree achieves the efficiency through the following designs: 1) distributing the tree structure among peers in a way preserving the nice properties of balanced tree structures yet avoiding single points of failure and performance bottlenecks; 2) organizing peers into an overlay structure that enables efficient navigation yet is easy to maintain; 3) an efficient navigation algorithm; 4) an innovative wavelet-based load balancing mechanism. Through extensive performance evaluation, we verify the superiority of DPTree over existing works.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123794318","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}

引用次数: 47

Key Grids: A Protocol Family for Assigning Symmetric Keys 密钥网格:分配对称密钥的协议族

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320211

Amitanand S. Aiyer, L. Alvisi, M. Gouda

引用次数: 24

RAIN: A Reliable Wireless Network Architecture RAIN:一个可靠的无线网络架构

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320216

Chaegwon Lim, Haiyun Luo, Chong-Ho Choi

{"title":"RAIN: A Reliable Wireless Network Architecture","authors":"Chaegwon Lim, Haiyun Luo, Chong-Ho Choi","doi":"10.1109/ICNP.2006.320216","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320216","url":null,"abstract":"Despite years of research and development, pioneering deployments of multihop wireless networks have not proven successful. The performance of routing and transport is often unstable due to contention-induced packet losses, especially when the network is large and the offered load is high. In this paper we propose RAIN, a reliable wireless network architecture for large-scale multihop wireless networks. A RAIN network enforces contention control by limiting the queue length at intermediate wireless routers to the minimum. To keep the queue short a RAIN network enforces congestion control through in-network implicit back-pressure. RAIN congestion control is built on wireless datalink layer mechanisms, e.g., mandatory per-frame acknowledgement and inter-frame backoff in popular CSMA/CA wireless transceivers, therefore very efficient and effective compared with those defined at the network or transport layer for the wired Internet. As a result of the built-in contention and congestion control, RAIN presents the end hosts a highly reliable network service model, even more reliable than that of the wired Internet. The end hosts only need to deal with packet losses due to router or routing failures. Therefore, the transport protocol can be significantly simplified. This is in stark contrast to the existing approach of adding more and more complexity to adapt TCP for multihop wireless networks. We propose the details of RAIN datalink layer protocol, and a simple transport protocol at the end hosts. Performance evaluation through intensive simulations shows that RAIN improves the throughput by up to 92% and fairness by up to 48%, with packet losses due to contention and congestion significantly reduced.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115966040","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

Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks 非结构化P2P网络的异构用户流失和局部弹性建模

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320196

Z. Yao, Derek Leonard, Xiaoming Wang, D. Loguinov

引用次数: 140

Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL 严格协议设计的实践:HOL光分组交换机MAC

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320205

Adam Biltcliffe, M. Dales, Sam Jansen, T. Ridge, Peter Sewell

{"title":"Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL","authors":"Adam Biltcliffe, M. Dales, Sam Jansen, T. Ridge, Peter Sewell","doi":"10.1109/ICNP.2006.320205","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320205","url":null,"abstract":"This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between systems and theory researchers. The protocol is a media access control (MAC) protocol for the SWIFT optical network, which uses optical switching and wavelength striping to provide very high bandwidth packet- switched interconnects. The use of optical switching (and the lack of optical buffering) means that the protocol must control the switch within hard timing constraints. We use higher-order logic to express the protocol design, in the general-purpose HOL automated proof assistant. The specification is thus completely precise, but still concise, readable, and without accidental overspecification. Further, we test conformance between the specification and two implementations of the protocol: an NS-2 simulation model and the VHDL code of the network hardware. This involves: (1) proving, within HOL, that the specification is equivalent to an algorithmically-checkable version; (2) using automatic code-extraction to generate a testing oracle; and (3) applying that oracle to traces of the implementation. This design-time use of rigorous methods has resulted in a protocol that is better specified and more correct than it would otherwise be, with relatively little effort.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125332031","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

Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes 覆盖路由中域间策略冲突的表征与缓解

Proceedings of the 2006 IEEE International Conference on Network Protocols Pub Date : 2006-11-12 DOI: 10.1109/ICNP.2006.320219

S. Seetharaman, M. Ammar

{"title":"Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes","authors":"S. Seetharaman, M. Ammar","doi":"10.1109/ICNP.2006.320219","DOIUrl":"https://doi.org/10.1109/ICNP.2006.320219","url":null,"abstract":"The Internet is a complex structure arising from the interconnection of numerous autonomous systems (AS), each exercising its own administrative policies to reflect the commercial agreements behind the interconnection. However, routing in service overlay networks is quite capable of violating these policies to its advantage. To prevent these violations, we see an impending drive in the current Internet to detect and filter overlay traffic. In this paper, we first present results from a case study overlay network, constructed on top of Planetlab, that helps us gain insights into the frequency and characteristics of the different inter-domain policy violations. We further investigate the impact of two types of overlay traffic filtering that aim to prevent these routing policy violations: blind filtering and policy- aware filtering. We show that such filtering can be detrimental to the performance of overlay routing. We next consider two approaches that allow the overlay network to realize the full advantage of overlay routing in this context. In the first approach, overlay nodes are added so that good overlay paths do not represent inter-domain policy violations. In the second approach, the overlay acquires transit permits from certain ASes that allow certain policy violations to occur. We develop a single cost-sharing framework that allows the incorporation of both approaches into a single strategy. We formulate and solve an optimization problem that aims to determine how the overlay network should allocate a given budget between paying for additional overlay nodes and paying for transit permits to ASes. We illustrate the use of this approach on our case study overlay network and evaluate its performance under varying network characteristics.","PeriodicalId":225172,"journal":{"name":"Proceedings of the 2006 IEEE International Conference on Network Protocols","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125247066","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}

引用次数: 45