IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications最新文献

筛选
英文 中文
Preserving Area Coverage in Sensor Networks with a Realistic Physical Layer 基于逼真物理层的传感器网络区域覆盖保护
A. Gallais, F. Ingelrest, J. Carle, D. Simplot-Ryl
{"title":"Preserving Area Coverage in Sensor Networks with a Realistic Physical Layer","authors":"A. Gallais, F. Ingelrest, J. Carle, D. Simplot-Ryl","doi":"10.1109/INFCOM.2007.292","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.292","url":null,"abstract":"We consider the problem of activity scheduling and area coverage in sensor networks, and especially focus on problems that arise when using a more realistic physical layer. Indeed, most of the previous work in this area has been studied within an ideal environment, where messages are always correctly received. In this paper, we argue that protocols developed with such an assumption can hardly provide satisfying results in a more realistic world. To show this, we replace the classic unit disk graph model by the lognormal shadowing one. The results show that either the resulting area coverage is not sufficient or the percentage of active nodes is very high. We thus present an original method, where a node decides to turn off when there exists in its vicinity a sufficiently reliable covering set of neighbors. We show that our solution is very efficient as it preserves area coverage while minimizing the quantity of active nodes.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125987845","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}
引用次数: 14
Quality of Field Reconstruction in Sensor Networks 传感器网络中现场重建的质量
A. Nordio, C. Chiasserini, E. Viterbo
{"title":"Quality of Field Reconstruction in Sensor Networks","authors":"A. Nordio, C. Chiasserini, E. Viterbo","doi":"10.1109/INFCOM.2007.290","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.290","url":null,"abstract":"We consider the problem of obtaining a high quality estimates of band-limited sensor fields when sensor measurements are noisy and the nodes are irregularly deployed and subject to random motion. We consider the mean square error (MSE) of the estimate and we analytically derive the performance of several reconstruction/estimation techniques based on linear filtering. For each technique, we obtain the mean value of the MSE, as well as its asymptotic expression in the case where the field bandwidth and the number of sensors grow to infinity, while their ratio is kept constant. Our results provide useful guidelines for the design of sensor networks when many system parameters have to be traded off.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121564055","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
Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks 面向移动Ad-hoc网络的鲁棒可扩展地理组播协议
Xiaojing Xiang, Zehua Zhou, Xin Wang
{"title":"Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks","authors":"Xiaojing Xiang, Zehua Zhou, Xin Wang","doi":"10.1109/INFCOM.2007.269","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.269","url":null,"abstract":"Group communications are important in mobile ad hoc networks (MANET). Multicast is an efficient method to implement the group communications. However, it is challenging to implement scalable, robust and efficient multicast in MANET due to the difficulty in group membership management, multicast packet forwarding and the maintenance of a tree-or mesh-based multicast structure over the dynamic topology for a large group size or network size. We propose a novel robust and scalable geographic multicast protocol (RSGM). Scalable and efficient group membership management has been performed through zone-based structure, and the location service for group members is combined with membership management. Both the control messages and data packets are forwarded along efficient tree-shape paths, but there is no need to actively maintain a tree structure, which efficiently reduces the maintenance overhead and makes the transmissions more robust to dynamics. Geographic forwarding is used to achieve further scalability and robustness. To avoid periodic flooding-based sources' announcements, an efficient source tracking mechanism is designed. Furthermore, we handle the empty zone problem faced by most zone-based routing protocols. Our simulation studies show that RSGM can scale to large group size and large network size, and a high delivery ratio is achieved by RSGM even under high dynamics.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124779704","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}
引用次数: 33
Cooperating with Smartness: Using Heterogeneous Smart Antennas in Ad-Hoc Networks 与智能协同:在Ad-Hoc网络中使用异构智能天线
K. Sundaresan, Raghupathy Sivakumar
{"title":"Cooperating with Smartness: Using Heterogeneous Smart Antennas in Ad-Hoc Networks","authors":"K. Sundaresan, Raghupathy Sivakumar","doi":"10.1109/INFCOM.2007.43","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.43","url":null,"abstract":"The ability of smart antennas to improve performance in a typically constrained ad-hoc network environment, has helped them garner significant attention over the last few years. However, not much light has been shed on wireless ad-hoc networks that have nodes with varying antenna capabilities. While homogeneous ad-hoc networks with all nodes having the same antenna capabilities will have certain applications, we argue that ad-hoc networks with nodes having heterogeneous antenna capabilities are more likely to be the norm due to a variety of motivating factors. In the context of such heterogeneous smart antenna networks (HSANs), we investigate and motivate the need for a simple form of node cooperation called retransmit diversity. We show that while such a simple form of node cooperation cannot bring significant benefits to homogeneous omni-directional and smart antenna networks, they can bring several folds improvement to heterogeneous smart antenna networks. We then present several key properties pertaining to node cooperation in HSANs. In the process, we identify a fundamental trade-off between exploiting smart antenna gain and cooperation gain, that undermines the ability of HSANs to leverage node cooperation to their maximum potential. To address this tradeoff, we then present an adaptive cooperation mechanism and incorporate this mechanism through the design of a simple but efficient MAC protocol. The performance of the MAC protocol is evaluated through ns2 simulations.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123204199","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}
引用次数: 10
Fundamental Complexity of Optical Systems 光学系统的基本复杂性
Hadas Kogan, I. Keslassy
{"title":"Fundamental Complexity of Optical Systems","authors":"Hadas Kogan, I. Keslassy","doi":"10.1109/INFCOM.2007.310","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.310","url":null,"abstract":"It is often claimed that future systems will necessarily be all-optical, because electronic devices are not fast enough to keep up with the increase in fiber capacity. However, two objections are commonly raised: first, optical systems need many basic optical components, which are typically very expensive; and second, optical systems need many switch reconfigurations, which are typically very slow. In this paper, we examine whether these two costs can be fundamentally bounded. First, we develop the equivalence between coding theory and optical system design by introducing the concept of super switches. Then, we show how the minimal expected number of switch reconfigurations is almost equal to the state space entropy of the optical system. Finally, we point out the trade-off between the two types of costs.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123221322","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
Attack Detection in Wireless Localization 无线定位中的攻击检测
Yingying Chen, W. Trappe, R. Martin
{"title":"Attack Detection in Wireless Localization","authors":"Yingying Chen, W. Trappe, R. Martin","doi":"10.1109/INFCOM.2007.228","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.228","url":null,"abstract":"Accurately positioning nodes in wireless and sensor networks is important because the location of sensors is a critical input to many higher-level networking tasks. However, the localization infrastructure can be subjected to non-cryptographic attacks, such as signal attenuation and amplification, that cannot be addressed by traditional security services. We propose several attack detection schemes for wireless localization systems. We first formulate a theoretical foundation for the attack detection problem using statistical significance testing. Next, we define test metrics for two broad localization approaches: multilateration and signal strength. We then derived both mathematical models and analytic solutions for attack detection for any system that utilizes those approaches. We also studied additional test statistics that are specific to a diverse set of algorithms. Our trace-driven experimental results provide strong evidence of the effectiveness of our attack detection schemes with high detection rates and low false positive rates across both an 802.11 (WiFi) network as well as an 802.15.4 (ZigBee) network in two real office buildings. Surprisingly, we found that of the several methods we describe, all provide qualitatively similar detection rates which indicate that the different localization systems all contain similar attack detection capability.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131409245","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}
引用次数: 91
Broadcast Flooding Revisited: Survivability and Latency 广播洪水重访:生存能力和延迟
P. Mannersalo, A. Keshavarz-Haddad, R. Riedi
{"title":"Broadcast Flooding Revisited: Survivability and Latency","authors":"P. Mannersalo, A. Keshavarz-Haddad, R. Riedi","doi":"10.1109/INFCOM.2007.82","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.82","url":null,"abstract":"This paper addresses the dynamics of broadcast flooding in random wireless ad hoc networks. In particular, we study the subset of nodes covered by a flood as well as timing issues related to the first (latency) and the last time (duration of back-chatter) at which a broadcast is received by a fixed node. Notably, this analysis takes into account the MAC-layer as well as background traffic which both are often neglected in related studies. Assuming a protocol model for the transmission channel which accounts for carrier sensing and interference, we find bounds for the probability of survival of the flood and for its coverage probabilities. Moreover, under certain conditions on the parameters, we establish asymptotical linear bounds on the latency as the distance from the origin of the flood increases and show that the duration of the back-chatter is stochastically bounded. The analytical results are compared to simulation.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131422075","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}
引用次数: 3
Network Coding-Based Broadcast in Mobile Ad-hoc Networks 移动自组网中基于网络编码的广播
Erran L. Li, R. Ramjee, M. Buddhikot, Scott C. Miller
{"title":"Network Coding-Based Broadcast in Mobile Ad-hoc Networks","authors":"Erran L. Li, R. Ramjee, M. Buddhikot, Scott C. Miller","doi":"10.1109/INFCOM.2007.203","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.203","url":null,"abstract":"Broadcast operation, which disseminates information network-wide, is very important in multi-hop wireless networks. Due to the broadcast nature of wireless media, not all nodes need to transmit in order for the message to reach every node. Previous work on broadcast support can be classified as probabilistic (each node rebroadcasts a packet with a given probability) or deterministic approaches (nodes pre-select a few neighbors for rebroadcasting). In this paper, we show how network-coding can be applied to a deterministic broadcast approaches, resulting in significant reductions in the number of transmissions in the network. We propose two algorithms, that rely only on local two-hop topology information and makes extensive use of opportunistic listening to reduce the number of transmissions: 1) a simple XOR-based coding algorithm that provides up to 45% gains compared to a non-coding approach and 2) a Reed-Solomon based coding algorithm that determines the optimal coding gain achievable for a coding algorithm that relies only on local information, with gains up to 61% in our simulations. We also show that our coding-based deterministic approach outperforms the coding-based probabilistic approach presented in (C. Fragouli et al, 2006).","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131483826","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}
引用次数: 190
Neighborhood Watch for Internet Routing: Can We Improve the Robustness of Internet Routing Today? 互联网路由的邻里观察:我们今天能提高互联网路由的健壮性吗?
Georgos Siganos, M. Faloutsos
{"title":"Neighborhood Watch for Internet Routing: Can We Improve the Robustness of Internet Routing Today?","authors":"Georgos Siganos, M. Faloutsos","doi":"10.1109/INFCOM.2007.151","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.151","url":null,"abstract":"Protecting BGP routing from errors and malice is one of the next big challenges for Internet routing. Several approaches have been proposed that attempt to capture and block routing anomalies in a proactive way. In practice, the difficulty of deploying such approaches limits their usefulness. We take a different approach: we start by requiring a solution that can be easily implemented now. With this goal in mind, we consider ourselves situated at an AS, and ask the question: how can I detect erroneous or even suspicious routing behavior? We respond by developing a systematic methodology and a tool to identify such updates by utilizing existing public and local information. Specifically, we process and use the allocation records from the Regional Internet Registries (RIR), the local policy of the AS, and records used to generate filters from Internet Routing Registries (IRR). Using our approach, we can automatically detect routing leaks. Additionally, we identify some simple organizational and procedural issues that would significantly improve the usefulness of the information of the registries. Finally, we propose an initial set of rules with which an ISP can react to routing problems in a way that is systematic, and thus, could be automated.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128247798","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}
引用次数: 39
Availability in BitTorrent Systems 可用性在bt系统
G. Neglia, Giuseppe Reina, Honggang Zhang, D. Towsley, A. Venkataramani, John S. Danaher
{"title":"Availability in BitTorrent Systems","authors":"G. Neglia, Giuseppe Reina, Honggang Zhang, D. Towsley, A. Venkataramani, John S. Danaher","doi":"10.1109/INFCOM.2007.256","DOIUrl":"https://doi.org/10.1109/INFCOM.2007.256","url":null,"abstract":"In this paper, we investigate the problem of highly available, massive-scale file distribution in the Internet. To this end, we conduct a large-scale measurement study of BitTorrent, a popular class of systems that use swarms of actively downloading peers to assist each other in file distribution. The first generation of BitTorrent systems used a central tracker to enable coordination among peers, resulting in low availability due to the tracker's single point of failure. Our study analyzes the prevalence and impact of two recent trends to improve BitTorrent availability: (i) use of multiple trackers, and (ii) use of Distributed Hash Tables (DHTs), both of which also help to balance load better. The study considered more than 1,400 trackers and 24,000 DHT nodes (extracted from about 20,000 torrents) over a period of two months. We find that both trends improve availability, but for different and somewhat unexpected reasons. Our findings include: (i) multiple trackers improve availability, but the improvement largely comes from the choice of a single highly available tracker, (ii) such improvement is reduced by the presence of correlated failures, (iii) multiple trackers can significantly reduce the connectivity of the overlay formed by peers, (iv) the DHT improves information availability, but induces a higher response latency to peer queries.","PeriodicalId":426451,"journal":{"name":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130332917","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}
引用次数: 94
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信