{"title":"Beyond Theory: Development of a Real World Localization Application as Low Power WSN","authors":"M. Baunach, Reiner Kolla, Clemens Muhlberger","doi":"10.1109/LCN.2007.68","DOIUrl":"https://doi.org/10.1109/LCN.2007.68","url":null,"abstract":"The real-world implementation of a just theoretically elaborated idea is sometimes cumbersome, often a couple of obstacles have to be overcome. That's likewise in the area of wireless sensor networks (WSN), but complicated by some further restrictions, e.g. little memory or low power consumption. One well-known and often required application within WSN is the geographical localization of several sensor nodes. That's why this paper deals with some problems arising during the development of a WSN using the time difference of arrival (TDoA) of ultrasound and radio signals for positioning. Its focus is on handling of microcontroller difficulties like little memory, low computational power or low energy consumption as well as hardware driven failures like inaccurate measurements or node failures.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124031563","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":"Light-weight End-to-End QoS as DoS Prevention","authors":"M. Waldvogel, Tobias Kock","doi":"10.1109/LCN.2007.46","DOIUrl":"https://doi.org/10.1109/LCN.2007.46","url":null,"abstract":"This paper proposes a first step into a common solution, where combined and extended interests will hopefully allow us to surpass this threshold. While there are still some open issues, we hope to not only propose a basic working mechanism but also provide fresh ideas to start thinking off the beaten path. Our main contribution is to create a lightweight, end-to-end binding between path and service, which is then used as a basis to associate further attributes and mechanisms to this binding.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114214943","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":"Identifying BT-like P2P Traffic by the Discreteness of Remote Hosts","authors":"W. Cheng, J. Gong, W. Ding","doi":"10.1109/LCN.2007.69","DOIUrl":"https://doi.org/10.1109/LCN.2007.69","url":null,"abstract":"By analyzing application protocols and traffic, we find that the most striking distinguish between BitTorrent (BT)-like peer-to-peer (P2P) applications' traffic and traditional as well as other P2P (such as Skype) applications' traffic of a single user may be the dissimilarity in the distribution of remote hosts involved. Therefore, we propose a method based on discreteness of remote hosts (RHD) to identify BT-like traffic. In this method, traffic for each user host in a stub network need be monitored at the border of the stub network and classified into flows. At intervals concurrent TCP and UDP flows for a single host should be grouped respectively by what stub network the remote host of each flow belongs to, and then calculate instant RHDs for TCP and UDP flows respectively. For any user host, if the sum of two average RHDs for a period of time exceeds specific threshold, then we can deduce that the host has used BT-like P2P application. The method proposed here is a simple traffic characteristic-based traffic classification method. It is more suitable for identifying protean BT-like P2P application than usual content-based methods such as those based on port numbers or application signatures. Experiments results reveal that our method can effectively recognize BT-like traffic and may be particularly appropriate for use to restrict BT-like traffic during working hours if needed.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125699828","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":"Issues in TCP Vegas over Optical Burst Switching Networks","authors":"Olga León, S. Sallent","doi":"10.1109/LCN.2007.116","DOIUrl":"https://doi.org/10.1109/LCN.2007.116","url":null,"abstract":"In this paper we study by means of simulation the effect of the variation of the burstification period in OBS networks on the performance of TCP Vegas.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"89 32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129794201","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}
Sourav Pal, Sumantra R. Kundu, Amin R. Mazloom, Sajal K. Das
{"title":"Channel State Estimation and Scheduling Algorithms for Multi-Rate Wireless Systems","authors":"Sourav Pal, Sumantra R. Kundu, Amin R. Mazloom, Sajal K. Das","doi":"10.1109/LCN.2007.155","DOIUrl":"https://doi.org/10.1109/LCN.2007.155","url":null,"abstract":"Emerging multi-rate wireless systems both cellular (cdma2000, high data rate (HDR)) and Wi-Fi like systems demand that the currently used channel estimation and scheduling techniques be revisited. Not only the channel estimation, prediction algorithms, and protocols need to be modified, the premise for evaluating their performance needs to be changed. Current techniques comprise of scheduling algorithms based on existing channel state. We recommend that for enhanced performance in terms of user satisfaction and system throughput not only channel state but also the demand rate needed for satisfying the user needs to be considered. In this paper, we devise new mechanisms to estimate the varying channel conditions using information theoretic techniques for multi-rate wireless systems. We utilized a non-parametric estimator of Renyi's entropy using the Parzen widowing technique to estimate the probability density function of the channel rate variation as experienced by every user in the system. Scheduling algorithms are proposed based on the channel conditions estimated by the proposed technique as well as the data rate needed for satisfying each user . The proposed mechanism ensures the highest number of satisfied users by maintaining the stipulated QoS requirements and fairness amonst users. We also demonstrate that maximizing the throughput does not necessarily result in maximizing the number of satisfied users. Results demonstrate that the proposed estimation techniques perform better than existing schemes both in terms of number of satisfied user and throughput.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129982676","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}
W. Strayer, Christine E. Jones, B. Schwartz, Sarah Edwards, W. Milliken, A. Jackson
{"title":"Efficient Multi-Dimensional Flow Correlation","authors":"W. Strayer, Christine E. Jones, B. Schwartz, Sarah Edwards, W. Milliken, A. Jackson","doi":"10.1109/LCN.2007.132","DOIUrl":"https://doi.org/10.1109/LCN.2007.132","url":null,"abstract":"Flow correlation algorithms compare flows to determine similarity, and are especially useful and well studied for detecting flow chains through \"stepping stone\" hosts. Most correlation algorithms use only one characteristic and require all values in the correlation matrix (the correlation value of all flows to all other flows) to be updated on every event. We have developed an algorithm that tracks multiple (n) characteristics per flow, and requires updating only the flow's n values upon an event, not all the values for all the flows. The n correlation values are used as coordinates for a point in n-space; two flows are considered correlated if there is a very small Euclidean distance between them. Our results show that this algorithm is efficient in space and compute time, is resilient against anomalies in the flow, and has uses outside of stepping stone detection.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132291696","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":"Cluster-based Forwarding in Delay Tolerant Public Transport Networks","authors":"Shabbir Ahmed, S. Kanhere","doi":"10.1109/LCN.2007.70","DOIUrl":"https://doi.org/10.1109/LCN.2007.70","url":null,"abstract":"Packet forwarding in Public Transport Networks is particularly challenging due to the high mobility, rapidly changing topology and intermittent connectivity observed in these networks. Though clustering of nodes can aid forwarding decision in these delay tolerant networks (DTNs), the clustering process is extremely costly in a large network. In this paper, we introduce a generic efficient clustering method which is suitable for grouping the nodes of large networks. We also demonstrated how encounter frequencies of public transport networks can be fed to that clustering algorithm in order to build clusters of nodes. And finally, our large scale extensive simulation study on real bus traces shows the efficacy of clustering in packet forwarding.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129498733","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":"Graph based Metrics for Intrusion Response Measures in Computer Networks","authors":"M. Jahnke, Christian Thul, P. Martini","doi":"10.1109/LCN.2007.45","DOIUrl":"https://doi.org/10.1109/LCN.2007.45","url":null,"abstract":"This contribution presents a graph based approach for modelling the effects of both attacks against computer networks and response measures as reactions against the attacks. Certain properties of the model graphs are utilized to quantify different response metrics which are well-kown from the pragmatic view of network security officers. Using these metrics, it is possible to (1) quantify practically relevant properties of a response measure after its application, and (2) estimate these properties for all available response measures prior to their application. The latter case is the basis for the selection of an appropriate reaction to a given attack. Our graph-based model is similar to those used in software reliability analysis and was designed for a scalable granularity in representing properties of the network and its components to be protected. Different examples show the applicability of the model and the resulting metric values.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"74 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115498898","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":"Information Coverage and Network Lifetime in Energy Constrained Wireless Sensor Networks","authors":"Bang Wang, V. Srinivasan, K. Chua, Wen Wang","doi":"10.1109/LCN.2007.142","DOIUrl":"https://doi.org/10.1109/LCN.2007.142","url":null,"abstract":"This paper studies the problem of how to maximize the network lifetime while preserving network coverage for an energy constrained wireless sensor network. We consider network coverage from an our recently proposed information coverage model [1] other than the conventional sensing disk model. The lifetime maximization problem is modeled as a nonlinear programming problem and is shown NP-Complete. We then propose a family of greedy algorithms to allocate sensors different roles such that different sensors may consume different amount of energies in different intervals to prolong network lifetime while still guaranteeing application requirements. Simulation results suggest that the algorithm with the best balancing between communication energy consumption and area coverage requirement has the highest network lifetime.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128492452","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 Distributed Scheduling Approach for Ethernet-based Passive Optical Networks","authors":"M. D. Andrade, L. Gutierrez, S. Sallent","doi":"10.1109/LCN.2007.121","DOIUrl":"https://doi.org/10.1109/LCN.2007.121","url":null,"abstract":"Ethernet-based passive optical networks (EPON) are being considered as the best candidates for the next generation broadband access networks. Several algorithms for dynamic bandwidth allocation in EPON have been proposed, as this is an open issue that was left out of the scope of the standard IEEE 802.3ah. Very few of those works address the possibilities for an on-the-fly (immediate) distributed scheduling method. In this paper we propose and simulate a distributed scheduling method where the user devices perform most of the dynamic distribution process. The results show an important improvement in terms of delay and queue size for high network loads.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125911650","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}