29th Annual IEEE International Conference on Local Computer Networks最新文献

筛选
英文 中文
Lightweight temporal compression of microclimate datasets [wireless sensor networks] 小气候数据集的轻量级时间压缩[无线传感器网络]
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.72
T. Schoellhammer, E. Osterweil, Ben Greenstein, Michael Wimbrow, D. Estrin
{"title":"Lightweight temporal compression of microclimate datasets [wireless sensor networks]","authors":"T. Schoellhammer, E. Osterweil, Ben Greenstein, Michael Wimbrow, D. Estrin","doi":"10.1109/LCN.2004.72","DOIUrl":"https://doi.org/10.1109/LCN.2004.72","url":null,"abstract":"Since the inception of sensor networks, in-network processing has been touted as the enabling technology for long-lived deployments. Radio communication is the overriding consumer of energy in such networks. Therefore, data reduction before transmission, either by compression or feature extraction, will directly and significantly increase network lifetime. This paper evaluates a simple temporal compression scheme designed specifically to be used by mica motes for the compaction of microclimate data. The algorithm makes use of the observation that over a small enough window of time, samples of microclimate data are linear. It finds such windows and generates a series of line segments that accurately represent the data. It compresses data up to 20-to-1 while introducing errors in the order of the sensor hardware's specified margin of error. Furthermore, it is simple, consumes little CPU and requires very little storage when compared to other compression techniques. This paper describes the technique and results using a dataset from a one-year microclimate deployment.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130660208","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}
引用次数: 89
Sympathy: a debugging system for sensor networks [wireless networks] 一种传感器网络[无线网络]调试系统
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.121
N. Ramanathan, E. Kohler, Lewis Girod, D. Estrin
{"title":"Sympathy: a debugging system for sensor networks [wireless networks]","authors":"N. Ramanathan, E. Kohler, Lewis Girod, D. Estrin","doi":"10.1109/LCN.2004.121","DOIUrl":"https://doi.org/10.1109/LCN.2004.121","url":null,"abstract":"This work presents a preliminary design and evaluation of Sympathy, a debugging tool for pre-deployment sensor networks. Sympathy consists of mechanisms for collecting system performance metrics with minimal memory overhead; mechanisms for recognizing events based on these metrics; and a system for collecting events and their spatio-temporal context. Sympathy introduces the idea of correlating seemingly unrelated events, and providing context for these events, in order to track down bugs and find their root causes. Eventually, Sympathy will be part of a system that can aid in debugging sensor networks both pre- and post-deployment.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133283972","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
Regenerating nodes for real-time transmissions in multi-hop wireless networks 多跳无线网络实时传输的再生节点
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.104
Rui Ma, J. Ilow
{"title":"Regenerating nodes for real-time transmissions in multi-hop wireless networks","authors":"Rui Ma, J. Ilow","doi":"10.1109/LCN.2004.104","DOIUrl":"https://doi.org/10.1109/LCN.2004.104","url":null,"abstract":"The paper extends the analysis of a novel data link layer mechanism introduced in our previous work for real-time service provisioning in multi-hop wireless networks. To combat packet loss along unreliable paths connecting the source with the destination, (i) packet transmissions are distributed along the multiple paths connecting joint nodes and (ii) the redundancy packets are utilized to recover the lost packets on these intermediate connections. The regenerating nodes (RNs), where the actual packet loss recovery is performed in the network, minimize the accumulated number of lost packets at the destination. This joint application of packet level forward error control (FEC) and multiple path routing allows the requirements of real-time transmissions, such as fixed delays and guaranteed packet loss rate (PLR), to be met. The proposed scheme achieves load balancing along the multiple paths which are chosen for packet forwarding based on their PLR. The scheme is sufficiently flexible to accommodate various constraints for delay and reliability that can be tailored to the specific applications. Monte Carlo simulations demonstrate the robust performance of the proposed scheme in different topology and PLR scenarios, with special attention given to the choice of the RN positions in the network.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133481709","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}
引用次数: 16
Multi-layer analysis of Web browsing performance for wireless PDAs 无线pda网页浏览性能的多层分析
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.81
A. Omotayo, C. Williamson
{"title":"Multi-layer analysis of Web browsing performance for wireless PDAs","authors":"A. Omotayo, C. Williamson","doi":"10.1109/LCN.2004.81","DOIUrl":"https://doi.org/10.1109/LCN.2004.81","url":null,"abstract":"This work studies the user-level and network-level performance for a mobile client browsing the Web using a wireless personal digital assistant (PDA). A wireless network analyzer is used to collect traces of the TCP/IP network traffic generated to and from the wireless PDA. Multi-layer protocol analysis is used to assess the Web browsing performance achieved, and identify protocol performance problems. The analyses focus on server response time, document size, HTTP transfer time, TCP performance, and wireless channel quality. The results from our experiments provide insight into strategies that could be used by Web content providers, Web servers, HTTP and TCP to improve Web browsing performance for mobile users.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122381302","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}
引用次数: 4
Virtual prepaid tokens for Wi-Fi hotspot access 用于Wi-Fi热点访问的虚拟预付令牌
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.134
Haidong Xia, J. Brustoloni
{"title":"Virtual prepaid tokens for Wi-Fi hotspot access","authors":"Haidong Xia, J. Brustoloni","doi":"10.1109/LCN.2004.134","DOIUrl":"https://doi.org/10.1109/LCN.2004.134","url":null,"abstract":"We introduce virtual prepaid tokens (VPT), a novel billing scheme that allows users to obtain access at Wi-Fi hotspots without having an account with a hotspot provider or a physical prepaid token (PPT). Upon arrival at a hotspot, a user buys a VPT online, using a third-party payment server with which the user already has an account. Experiments show that users can buy a VPT and gain full Internet connectivity in less than 15 seconds, i.e. much less time than it would take to create another account or to buy and activate a PPT. VPT can be used in hotspots that use a captive portal or IEEE 802.1x for user authentication. The latter alternative enables better security. We also contribute a novel technique that allows a single access point to authenticate users by either method. Hotspots can use this solution for migrating to 802.1x without disrupting legacy captive-portal users. Experiments demonstrate that the proposed technique has little overhead and interoperates broadly.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125636271","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
Security issues in PIM-SM link-local messages PIM-SM链路本地消息中的安全问题
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.110
S. Islam, J. Atwood
{"title":"Security issues in PIM-SM link-local messages","authors":"S. Islam, J. Atwood","doi":"10.1109/LCN.2004.110","DOIUrl":"https://doi.org/10.1109/LCN.2004.110","url":null,"abstract":"In the present Internet draft (ID) of protocol independent multicast-sparse mode (PIM-SM), the IPsec authentication header (AH) protocol without anti-replay mechanism has been proposed to protect the link-local messages. This compromise makes PIM-SM vulnerable to denial of service (DoS) attack. Moreover, in this ID, the security association lookup and the required number of security associations are erroneous. A new proposal is presented to protect PIM link-local messages while activating the anti-replay mechanism. The security association lookup method has also been modified. Finally, this proposal has been formally validated using SPIN.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127197022","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}
引用次数: 6
Predictive Mobile IP for rapid mobility 预测移动IP快速移动
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.97
E. Hernandez, A. Helal
{"title":"Predictive Mobile IP for rapid mobility","authors":"E. Hernandez, A. Helal","doi":"10.1109/LCN.2004.97","DOIUrl":"https://doi.org/10.1109/LCN.2004.97","url":null,"abstract":"Mobile computers require Mobile IP to preserve connectivity and properly route information while roaming over foreign networks. Registration, forwarding delay, and tunnel initialization diminishes the performance of mobility protocols during handoff. We propose a proactive rather than reactive solution to improve the performance of Mobile IP. We extend the current protocol with two new entities: ghost mobile host and ghost foreign agent. Our target is mobility scenarios in which mobile hosts are moving at a very high-speed. Our protocol extension uses the Kalman filter to determine the trajectory and speed of the mobile host and to allocate resources for Mobile IP proactively. Preliminary experiments conducted using the RAMON emulator show that the proposed predictive methods offer a promising range of 20-50% of performance improvement.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127942884","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
Wavelength rerouting for on-line multicast in WDM networks WDM网络中在线组播的波长重路由
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.137
Y. Wan, W. Liang
{"title":"Wavelength rerouting for on-line multicast in WDM networks","authors":"Y. Wan, W. Liang","doi":"10.1109/LCN.2004.137","DOIUrl":"https://doi.org/10.1109/LCN.2004.137","url":null,"abstract":"We consider wavelength rerouting for on-line multicast in all-optical wavelength division multiplexing (WDM) networks where the multicast requests arrive and depart randomly. One limitation of such networks is the wavelength continuity constraint, imposed by the all-optical cross-connect switches, that requires the same wavelength be used on all the links in a multicast tree. With random arrivals and departures of multicast requests, it happens quite often that a new multicast request has to be blocked due to the fact that there are not enough available resources (e.g., wavelengths) to realize the request. Wavelength rerouting, a viable and cost-effective method, has been proposed to improve the blocking probability; it rearranges the wavelengths on certain existing multicast routes to free a wavelength continuous route for the new request. We study the wavelength rerouting problem for on-line multicast in both undirected and directed WDM networks with an objective to minimize the disruption incurred to the existing multicast services, or equivalently, to minimize the number of existing multicast routes to be wavelength-rerouted. We first show that the problem is not only NP-hard but also hard to approximate. We then devise approximation algorithms for it with provable approximation guarantees.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126401311","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}
引用次数: 1
An energy efficient select optimal neighbor protocol for wireless ad hoc networks 一种高效节能的无线自组网选择最优邻居协议
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.19
B. Liu, Yang Gao, C. Chou, S. Jha
{"title":"An energy efficient select optimal neighbor protocol for wireless ad hoc networks","authors":"B. Liu, Yang Gao, C. Chou, S. Jha","doi":"10.1109/LCN.2004.19","DOIUrl":"https://doi.org/10.1109/LCN.2004.19","url":null,"abstract":"We propose two location-aware select optimal neighbor (SON) algorithms that are suitable for CSMA/CA based MAC protocols for wireless ad hoc networks. Both algorithms optimize the energy efficiency by reducing the effective number of neighbors and thus reduce the transmission power as well as the overhearing power consumption at irrelevant receivers. NS-2 simulations show that our algorithms can achieve about 28% and 38% average energy savings per node compared to CSMA/CA based MAC protocols such as IEEE 802.11.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129052900","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}
引用次数: 13
Popularity-wise proxy caching for interactive streaming media 交互式流媒体的流行代理缓存
29th Annual IEEE International Conference on Local Computer Networks Pub Date : 2004-11-16 DOI: 10.1109/LCN.2004.96
Wei Liu, C. Chou, Zongkai Yang, Xu Du
{"title":"Popularity-wise proxy caching for interactive streaming media","authors":"Wei Liu, C. Chou, Zongkai Yang, Xu Du","doi":"10.1109/LCN.2004.96","DOIUrl":"https://doi.org/10.1109/LCN.2004.96","url":null,"abstract":"Most of the current proxy caching algorithms for streaming video media assume that users favor the beginning of the media object. However, this assumption is questionable in highly interactive scenarios, such as e-learning, where some parts of the video other than the prefix can also be popular. A new segment-based proxy caching algorithm, named popularity-wise caching, is proposed for highly interactive streaming. It is designed to deal with arbitrary popularity distribution of media content. Simulations are performed using synthetic traces with different kinds and levels of user interactivity. The results show that the performance of current segment-based caching (such as exponential caching and soccer caching) degrade with increasing user interactivity, while popularity-wise caching can provide the lowest user startup latency for interactive requests and highest bandwidth saving for the backbone network.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"460 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124551874","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
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学术文献互助群
群 号:481959085
Book学术官方微信