{"title":"Performance of Spatially Distributed Large Interference Relay Networks","authors":"T. Riihonen, K. Doppler, A. Hottinen","doi":"10.1109/IZS.2006.1649112","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649112","url":null,"abstract":"In this paper we consider a special type of wireless ad hoc network, called interference relay network, where a set of source-destination pairs concurrently communicate through a set of half-duplex relays. We study the performance of the large interference relay network, when the network nodes are spatially distributed. We introduce a new weighted relaying protocol generalizing the recently proposed protocols and an efficient method for allocating relays to the communicating pairs. We investigate the performance scaling in an interference relay network with low number of communicating pairs and study the effect of spatial separation and different network topologies. Our results show that spatial separation can improve the performance of interference relay networks and that the behavior largely depends on the network topology","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130365259","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}
Manuel Costa, Jon Crowcroft, Miguel Castro, A. Rowstron, Lidong Zhou, Lintao Zhang, Paul Barham
{"title":"Stopping Internet Epidemics","authors":"Manuel Costa, Jon Crowcroft, Miguel Castro, A. Rowstron, Lidong Zhou, Lintao Zhang, Paul Barham","doi":"10.1109/IZS.2006.1649086","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649086","url":null,"abstract":"As we become increasingly dependent on computers connected to the Internet, we must protect them from worm attacks. Worms can gain complete control of millions of hosts in a few minutes, and they can use the infected hosts for malicious activities such as distributed denial of service attacks, relaying spam, corrupting data, and disclosing confidential information. Since worms spread too fast for humans to respond, systems that strive to contain worm epidemics must be completely automatic. We propose Vigilante, a new end-to-end architecture to contain worms automatically that addresses the limitations of network-centric systems. Vigilante relies on collaborative worm detection at end hosts, but does not require hosts to trust each other. In Vigilante, hosts run instrumented software to detect worms. We introduce dynamic dataflow analysis, a broad-coverage detection algorithm, and we show how to integrate other detection mechanisms into the Vigilante architecture. Upon worm detection, hosts generate self-certifying alerts (SCAs), a new type of security alert that can be inexpensively verified by any vulnerable host. SCAs are then broadcast over a resilient overlay network that can propagate alerts with high probability, even when under active attack. Finally, hosts receiving an SCA generate protective filters with dynamic data and control flow analysis of the vulnerable software. Our results show that Vigilante can contain fast spreading worms that exploit unknown vulnerabilities without false positives. Vigilante does not require any changes to hardware, compilers, operating systems or to the source code of vulnerable programs, and therefore can be used to protect software as it exists today in binary form","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132868797","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}
{"title":"Analysis of Cellular CDMA Systems under UWB Interference","authors":"C. Fischer","doi":"10.1109/IZS.2006.1649097","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649097","url":null,"abstract":"In this paper we analyse the behaviour of CDMA-based cellular systems to wideband interference and use these results to estimate the impact of ultra-wideband (UWB) radio interference on UMTS. Based on measurements confirming the analysis, we present the tools necessary to quickly obtain a system level view of the likely power increase caused by the interference","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131640993","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}
D. Katabi, Sachin Katti, Wenjun Hu, Hariharan Rahul, M. Médard
{"title":"On Practical Network Coding for Wireless Environments","authors":"D. Katabi, Sachin Katti, Wenjun Hu, Hariharan Rahul, M. Médard","doi":"10.1109/IZS.2006.1649085","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649085","url":null,"abstract":"In this extended abstract, we briefly describe COPE, an opportunistic approach to network coding that provides orders of magnitudes improvement in the throughput of dense wireless mesh networks. COPE supports multiple unicast flows, deals with bursty and unknown demands, and is simple and easy to deploy. Our COPE prototype provides the first implementation of network coding in the wireless environment. It shows the supremacy of opportunistic network coding over current wireless implementations","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131651835","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}
{"title":"Review of Rate Regions for Interference Channels","authors":"G. Kramer","doi":"10.1109/IZS.2006.1649105","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649105","url":null,"abstract":"Interference affects many types of communication channels including digital subscriber lines and wireless links. A basic model for studying coding for such scenarios is known as the interference channel (IC). Several of the fundamental results known about ICs are reviewed with special emphasis on Gaussian channels. We further discuss four recent results including an improvement of a standard achievable rate region","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"280 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126908640","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}
{"title":"Resource Allocation in Multi-hop Wireless Networks","authors":"A. Eryilmaz, R. Srikant","doi":"10.1109/IZS.2006.1649087","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649087","url":null,"abstract":"We describe and analyze a joint scheduling, routing and congestion control mechanism for wireless networks, that asymptotically guarantees stability of the buffers and fair allocation of the network resources. The queue lengths serve as common information to different layers of the network protocol stack, which are otherwise decoupled. Our main contribution is to prove the asymptotic optimality of a primal-dual congestion controller","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127353365","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}
{"title":"Network Coding Techniques for Network Monitoring: a Brief Introduction","authors":"C. Fragouli, A. Markopoulou","doi":"10.1109/IZS.2006.1649084","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649084","url":null,"abstract":"Monitoring and diagnosis of network conditions is a central problem in networking. As such, it has received a lot of attention in the Internet community in general and in the context of overlay networks in particular. Independently, recent advances in network coding have shown that it is possible to increase network capacity and better share the available resources by allowing intermediate nodes to perform processing operations, in addition to just forwarding packets. We here review use of network coding techniques in this context. As a specific application, we examine the well-known problem of network tomography, and in particular for inferring link loss rates from end-to-end measurements. Use of network coding can decrease the bandwidth used by probes, improve the accuracy of estimation, and decrease the complexity of selecting paths or trees to send probes","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124477635","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}
{"title":"Upper limits on performance from two hop relaying in a high data rate cellular system","authors":"A. K. Dinnis, J. Thompson","doi":"10.1109/IZS.2006.1649113","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649113","url":null,"abstract":"High data rate cellular systems such as 1xEV-DO can provide data at high rates to users, but generally these high rates will only be available to users with good links from the base station (BS). Using multi-hops where a relay can receive and retransmit a signal has the potential to improve the data rates for users with poor links from the BS. In this paper we consider the performance which is possible from such a system if all users could be reached using a two hop link at a data rate which is half the maximum data rate for a direct links. This gives us an upper limit on the performance possible from such a multihop system and allows us to consider issues such as fairness and bandwidth allocation","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131165092","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}
{"title":"Operator Assisted Dynamic Spectrum Assignment with Dual Beacons","authors":"S. Mangold, A. Jarosch, C. Monney","doi":"10.1109/IZS.2006.1649077","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649077","url":null,"abstract":"Dynamic spectrum assignment refers to a new approach for radio regulation. Whereas today either command-and-control licensing, or alternatively unlicensed bands are used to coordinate the radio spectrum utilization, it is envisioned to coordinate the spectrum utilization in a more flexible way with the help of dynamic spectrum assignment. With this new approach, radio systems will share spectrum either horizontally with distributed spectrum allocation such as listen-before-talk and equal rights to access the radio spectrum, or vertically, where so-called primary radio systems have higher priority to access the radio spectrum than the so-called secondary radio systems. Horizontal and vertical spectrum sharing are often discussed in the context of opportunistic spectrum usage and cognitive (secondary) radio. To guarantee the spectrum access priorities when spectrum is shared, and to coordinate the vertical spectrum sharing between primary and cognitive radio systems, beaconing concepts are often proposed but criticized for their poor reliability in hidden station scenarios. In this paper, we introduce an improved beaconing concept that is based on operator assistance with two instead of one single beacon. Our analysis illustrates that our proposed dual beacon concept provides high flexibility and at the same time improves the reliability of spectrum coordination","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133069254","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}
{"title":"Broadcasting over Two-Hop Relay Fading Channels","authors":"A. Steiner, S. Shamai","doi":"10.1109/IZS.2006.1649070","DOIUrl":"https://doi.org/10.1109/IZS.2006.1649070","url":null,"abstract":"We consider a two-hop relay channel, with stringent delay constraints, which require transmission without channel state information (CSI), where only decoders possess perfect CSI estimation. Various relaying protocols and single-user broadcasting strategies are studied. For a decode-and-forward (DF) relay several broadcasting strategies are considered. Then, for an amplify-and-forward (AF) relay, a maximal broadcasting achievable rate is analytically derived. A quantize-and-forward (QF) relay is also considered. When coupled with a single-level code at the source it uses codebooks matched to the received signal power and performs optimal minimal mean square error (MMSE) quantization. This scheme is simplified by a hybrid amplify-quantize-forward (AQF) relay, which scales the input, and performs optimal MMSE quantization with a single codebook. It is shown that the latter is optimal in means of throughput on the relay-destination link, while maintaining a lower coding complexity than the QF setting. A further extension of the AQF allows the relay to perform successive refinement quantization coupled with a matched multi-level code. Numerical results show that for high SNRs the broadcast approach over AF relay may achieve higher throughput gains than the other relaying protocols that were numerically tractable","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134253400","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}