{"title":"Towards a zero configuration authentication scheme for 802.11 based networks","authors":"C. Latze, U. Ultes-Nitsche, F. Baumgartner","doi":"10.1109/LCN.2008.4664192","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664192","url":null,"abstract":"Compared to many 802.11 based networks, GSM has an significant advantage. In contrast to 802.11, GSM provides a standardized authentication scheme, which requires no configuration on the end userpsilas side, but still allows international roaming. GSM does this by using a trusted module within each client: a subscriber identification module.In contrast to the comparable heavy GSM standard, the early 802.11 standards focused on data transmission within small local area networks, therefore omitting a secure and simple to use authentication mechanism. This caused several different and partly incompatible authentication schemes to evolve, ranging from simple password based login pages to certificate based mutual authentication protocols. While these protocols can provide state of the art secure authentication they are, from a user's point of view, almost unacceptable complex, especially if used in an ad-hoc manner outside an corporate environment. Trusted platform modules, as part of any modern computer, can reduce the user's overhead to establish a secure 802.11 based connection dramatically by providing secure, potentially anonymous identities. As shown in this paper this approach can be further extended by using an modified TLS handshake, allowing an automated, on-the-fly retrieval of required credentials. Together with the trusted platform modules, this extension can provide a full fledged zero configuration authentication for 802.11 networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132435512","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":"Modeling of multi-resolution active network measurement time-series","authors":"P. Calyam, A. Devulapalli","doi":"10.1109/LCN.2008.4664300","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664300","url":null,"abstract":"Active measurements on network paths provide end-to-end network health status in terms of metrics such as bandwidth, delay, jitter and loss. Hence, they are increasingly being used for various network control and management functions on the Internet. For purposes of network health anomaly detection and forecasting involved in these functions, it is important to accurately model the time-series process of active measurements. In this paper, we describe our time-series analysis of two typical active measurement data sets collected over several months: (i) routine, and (ii) event-laden. Our analysis suggests that active network measurements follow the moving average process. Specifically, they possess ARIMA(0,1,q) model characteristics with low q values, across multi-resolution timescales. We validate our model selection accuracy by comparing how well our predicted values using our model match the actual measurements.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132612524","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}
Nam H. Nguyen, S. Krishnamurthy, P. Xie, Douglas L. Jones
{"title":"Improving information availability in storage-centric sensor networks","authors":"Nam H. Nguyen, S. Krishnamurthy, P. Xie, Douglas L. Jones","doi":"10.1109/LCN.2008.4664155","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664155","url":null,"abstract":"We address the issue of improving information availability in a class of delay-tolerant sensor network applications, where the sensor nodes are deployed in disconnected environments. In such environments, since there is no continuous access to a remote base station, there is a need to leverage the collaborative resources of the sensor network to support in-network storage. The stored data can then be retrieved opportunistically by mobile collectors in the proximity. We have developed a data-centric, in-network storage architecture that partitions the network into storage zones. In such a scheme, some of the storage nodes may be unavailable at the time of storage and retrieval, because they are either sleeping to conserve energy or because they have failed.We present two schemes based on random linear network coding for improving information availability within such a storage architecture. In the centralized scheme, the encoding is performed by the managers in each storage zone, whereas in the decentralized scheme, the encoding is done locally by the zone members. We have implemented the network coding schemes in TinyOS and we present results that show the impact of the zone size, duty cycle, and the degree of encoding on the decoding probability, based on our experiments on a testbed of Micaz motes.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133740682","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":"Distributed and scalable control plane for next generation routers: A case study of OSPF","authors":"K. Nguyen, B. Jaumard","doi":"10.1109/LCN.2008.4664205","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664205","url":null,"abstract":"The growing traffic on the core Internet entails new requirements related to scalability and resiliency of the routers. One of the promising trends of router evolution is to build next generation routers with enhanced memory capacity and computing resources, distributed across a very high speed switching fabric. The main limitation of the current routing and signaling software modules, traditionally designed in a centralized manner, is that they do not scale in order to fully exploit such an advanced distributed hardware architecture. This paper discusses an implementation for an OSPF architecture for next generation routers, aiming at increasing the scalability and resiliency. The proposed architecture distributes the OSPF processing functions on router cards, i.e., on both control and line cards. Therefore, it reduces the bottlenecks and improves both the overall performance and the resiliency in the presence of faults. Scalability is estimated with respect to the CPU utilization and memory requirements.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131815354","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":"Energy efficient Ethernet encodings","authors":"Yanpei Chen, T. Wang, R. Katz","doi":"10.1109/LCN.2008.4664160","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664160","url":null,"abstract":"The energy efficiency of network elements is becoming more prominent, with growing concern for Internet power consumption and heat dissipation in datacenters and communications closets. Previous work has looked at energy efficient wireless topologies, network nodes, routers, and protocols. In considering a fresh redesign of the Internet datacenter for energy efficiency, we believe that energy efficient encodings are worthy of study. In this work, we re-examine the choice of Ethernet encoding, develop an associated energy model, evaluate current encodings, and propose new encodings. We found that simpler encodings are more energy efficient, with power savings of around 20% for the best encoding. Our work represents a first step in re-examining the established assumptions and practices of the PHY level of the network stack with respect to energy.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128428512","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}
A. Reinhardt, Matthias Kropff, M. Hollick, R. Steinmetz
{"title":"Designing a sensor network testbed for smart heterogeneous applications","authors":"A. Reinhardt, Matthias Kropff, M. Hollick, R. Steinmetz","doi":"10.1109/LCN.2008.4664271","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664271","url":null,"abstract":"Future buildings and environments are envisioned to provide ambient intelligence, adapting to a userpsilas preferences based on information about his context and status. Smart heterogeneous sensor networks are well suited data sources for such environments, because they allow for dynamic adaptation to newly added sensor types and novel tasks. Realistic verification of protocols and algorithms for smart networks poses special constraints on testbeds, necessitating support for heterogeneous platforms and mobility in the network. These distinct requirements limit the usability of many known testbeds of purely homogeneous nature. In this paper, we determine a minimum set of premises for smart heterogeneous sensor network testbeds and evaluate existing architectures with respect to these requirements. We then present our tubicle node platform, an integrated sensor network node providing inherent support for heterogeneity and fulfilling the determined set of requirements in their entirety. A set of twenty tubicles forms the basis for our TWiNS.KOM testbed. Specifically designed for heterogeneity, the architecture allows rapid validation of smart sensor network algorithms and quick experimental setup.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134231128","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":"A client-based vertical handoff approach for seamless mobility in next generation wireless networks","authors":"Yong-Sung Kim, Dong-Hee Kwon, Young-Joo Suh","doi":"10.1109/LCN.2008.4664199","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664199","url":null,"abstract":"With the rapid growth of mobile Internet, offering seamless connectivity and high-speed multimedia services in different types of wireless networks are important features in next generation wireless networks (4G networks). Many researchers envision that the 4G networks will consist of many radio access technologies which integrate into all IP-based networks while providing seamless handoffs across the heterogeneous wireless networks. Mobile IP is a prominent solution to handle mobile nodespsila movement in IP-based networks. However, Mobile IP suffers from long handoff latency since it is designed to support the macromobility of a mobile node. Therefore, it is necessary to devise a scheme that offers seamless connectivity during Mobile IP handoffs across the heterogeneous wireless networks. In this paper, we propose a client-based handoff management system for multi-networks to provide end-users with seamless connectivity across heterogeneous wireless networks. Our proposed system is designed as a common network interface at a client side and provides transparent services to IP/MIP layers regardless of used wireless technologies. With this system, we also present vertical handoff performance over a loosely coupled cdma2000/WLAN experimental test-bed. The experimental results show that our system enables a mobile node to handoff seamlessly across different types of wireless networks without any modifications to the existing IP/MIP stack and core network.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132752271","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":"Short-term QoS provisioning in MPLS ingress nodes","authors":"M. Torabzadeh, W. Ajib","doi":"10.1109/LCN.2008.4664232","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664232","url":null,"abstract":"In this paper, we propose a new switching scheme to improve the short-term delay and the packet jitter for real-time traffic. Even though, the proposed scheme is general and can be used in different points of the network, we propose to use it in MPLS ingress nodes. In our plan, we manage the delay to improve the QoS provisioning in a flexible manner, since traditional mechanisms such as leaky bucket can not have such kind of flexibility. Also, after using the scheme in MPLS ingress node the impact of short-time scale burstiness of the traffic will be decreased. The performance analysis shows that high quality of service provisioning for the real-time traffic will be achieved.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121965330","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":"Hyperbolic location estimation of malicious nodes in mobile WiFi/802.11 networks","authors":"Christine Laurendeau, M. Barbeau","doi":"10.1109/LCN.2008.4664251","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664251","url":null,"abstract":"Hyperbolic position bounding (HPB) provides a mechanism to probabilistically delimit the location of a wireless network malicious insider to a candidate area. A large scale path loss model is used to construct a probable distance difference range between a rogue transmitter and a pair of trusted receivers. Hyperbolas are constructed at the minimum and maximum bounds of this range to delineate the position of a rogue with a given confidence level. We describe an outdoor experiment with a WiFi/802.11 network. Measured received signal strength (RSS) values, as well as path loss parameters obtained from signal propagation losses, are used by HPB to bound the location of a mobile transmitter within the WiFi/802.11 network with a degree of confidence. Experimental results are compared against prior simulation results and found to be consistent.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123444677","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":"The design of a secure key management system for mobile ad hoc networks","authors":"A. Boukerche, Yonglin Ren","doi":"10.1109/LCN.2008.4664186","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664186","url":null,"abstract":"Key management is an important service for providing secure communications when the network size is large or the topology is undergoing frequent changes. In most existing key management schemes, a centralized key certification authority is used; however, it is not suitable for wireless environments due to the networkspsila scalability and the insufficient computation ability of mobile nodes. In this paper, a novel key management scheme is presented that emphasizes the secure and efficient key updates by using a frequency-based approach. Furthermore, our scheme makes use of a combination of both symmetric and asymmetric key algorithms to protect other aspects of key management, such as data confidentiality, key distribution, etc. Simulation experiments are implemented based on the ns-2 simulator and show that our frequency-based rekeying scheme has a better performance in comparison to other traditional schemes. Our experimental results demonstrate that our scheme not only achieves the necessary and efficient key updates but also provides more security in mobile ad hoc networks.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124727044","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}