{"title":"An Efficient Algorithm for Preserving Events' Temporal Relationships in Wireless Sensor Actor Networks","authors":"A. Boukerche, Anahit Martirosyan","doi":"10.1109/LCN.2007.153","DOIUrl":"https://doi.org/10.1109/LCN.2007.153","url":null,"abstract":"This paper proposes an event ordering algorithm for wireless sensor actor networks (WSANs) that could be applied for monitoring critical conditions (such as fires, explosions, toxic gas leaks etc.) in order to ensure the correct interpretation of events. We propose modifications to the ordering by confirmation event ordering protocol for WSANs by introducing clustering into the network's topology. The objectives of the proposed modifications are a reduced number of messages, energy efficiency, scalability and reduced latency. At the same time, we propose a hybrid synchronization scheme for the clustered topology, in which local time scales are used at the level of clusterheads. The clusterheads are synchronized with each other by the actor node using the reference broadcast synchronization technique, while the nodes inside clusters are synchronized with the round trip synchronization technique. The synchronization scheme aims at preserving energy and reducing network delay and it is better suited for the resource sparseness of wireless sensor networks as opposed to methods that use global time scales. Moreover, our proposed algorithm uses the message exchange necessary for event ordering and routing protocols for time synchronization purposes by piggybacking synchronization pulses and replies on these messages, thus reducing the additional traffic needed for time synchronization. In this paper, we present our protocol, discuss its implementation and provide its proof of correctness.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"111 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":"122590925","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":"Performance Degradation of IEEE 802.15.4 Slotted CSMA/CA due to Hidden Nodes","authors":"M. Harthikote-Matha, Tarun Banka, A. Jayasumana","doi":"10.1109/LCN.2007.134","DOIUrl":"https://doi.org/10.1109/LCN.2007.134","url":null,"abstract":"As sensor nodes are subject to strict power limitations and often deployed in harsh environments, there is significant potential for a node to be hidden from another node. The impact of hidden nodes on performance of the IEEE 802.15.4 low-rate wireless personal area network protocol is evaluated. At lower Tx power, as a result of hidden nodes, there are more collisions in the network increasing the cost of packet delivery. The simulation results indicate that there exists an optimum transmission power that minimizes the impact of hidden nodes, and it depends on factors such as network load, desired throughput and beacon order. Results indicate that additional throughput gain and lower cost per packet delivered can be achieved by increasing the beacon order at higher Tx power.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"109 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":"124778715","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":"Power-Aware Link Maintenance (PALM) for Mobile Ad Hoc Networks","authors":"Sungsoon Cho, J. Hayes","doi":"10.1109/LCN.2007.112","DOIUrl":"https://doi.org/10.1109/LCN.2007.112","url":null,"abstract":"We propose a power-aware link maintenance (PALM) algorithm for mobile ad hoc networks (MANETs) that simultaneously performs transmission power control and route connectivity maintenance. Unlike most topology control algorithms, PALM manages the transmission power of active nodes only, and thus eliminates energy and channel resource waste due to unnecessary beaconing. The basic idea of PALM is that by recording the received signal strength on packets, each node continuously estimates the required transmission power, and adapts to location changes due to mobility. We also introduce some efficient local link repair schemes. When a route change is needed due to node movement, overhearing nodes participate in data forwarding, and locally repair the route before disconnection without the need to propagate route error messages. Through these operations, PALM prevents frequent link breaks due to node mobility, reduces the occurrence of rerouting, and significantly improves network performance. Experimental results with the ns simulator confirm that PALM effectively conserves communication energy with modest overhead.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"122 1 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":"128377831","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 capability of the EDCA mechanism to support voice traffic in a mixed voice/data transmission over 802.11e WLANs - an experimental investigation","authors":"M. Narbutt, M. Davis","doi":"10.1109/LCN.2007.152","DOIUrl":"https://doi.org/10.1109/LCN.2007.152","url":null,"abstract":"In this paper we experimentally evaluate the capability of the EDCA mechanism to support voice traffic in a mixed voice/data transmission over 802.1 le WLANs. In particular we investigate how real-time voice transmission can be supported by tuning four EDCA parameters, namely AIFSN, CWmin , CWmax, and TXOP and how this impacts on background data transmission. The experimental set-up involves fifteen VoIP terminals sending bi-directional traffic between wired and wireless subnets and another station injecting various types of heavy background loads to the wireless subnet. End-to-end voice transmission quality is predicted from time-varying transmission impairments with the use of the latest appendix to the ITU-T E-model. Our experimental results show that the AIFSN parameter more effectively protects voice calls against background data traffic than CWmin. We also demonstrate that tuning of the TXOP parameter does not improve the quality of voice transmission. To the best of our knowledge, this is the first experimental investigation regarding tuning of MAC layer EDCA parameters in a real 802.1 le WLAN network from the perspective of end-to-end voice transmission quality and end user satisfaction.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"1 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":"129984219","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 Chord-based Recommender System","authors":"Christoph Sorge","doi":"10.1109/LCN.2007.113","DOIUrl":"https://doi.org/10.1109/LCN.2007.113","url":null,"abstract":"Traditional recommender systems rely on the use of a central server. This server is a single point of failure; moreover, the need for an expensive central infrastructure may lead to economic dependencies, forming an incentive to manipulate recommendations. Decentralized recommender systems on the basis of peer-to-peer networks can help solving this problem. Most existing approaches, however, are not scalable for large networks, or they do not consider security and privacy issues. The article at hand presents a peer-to-peer recommender system based on the chord overlay network and item-based collaborative filtering. Scalability is improved by introducing various optimizations. Additionally, we present an approach that reduces the potential for manipulation by system participants while granting a high degree of privacy.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"53 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":"125683475","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":"Secure Anonymous Broadcasting in Vehicular Networks","authors":"Christine Laurendeau, M. Barbeau","doi":"10.1109/LCN.2007.37","DOIUrl":"https://doi.org/10.1109/LCN.2007.37","url":null,"abstract":"Vehicular networks face a typical quandary in their requirement for communications that are at once secure and private. While the messages broadcast between vehicles and between vehicles and the supporting infrastructure must be authentic and non repudiable, they must also ensure the vehicle driver's anonymity. The Dedicated Short Range Communications (DSRC) framework's Wireless Access in Vehicular Environments (WAVE) application development architecture mandates the use of Public Key Infrastructure (PKI) mechanisms for securing messages, consequently compromising the driver's expectation of privacy. In this paper, we propose a WAVE-based protocol for the secure and anonymous propagation of vehicle safety broadcast messages. A hybrid key infrastructure approach is put forth which combines the use of a shared network authorization key for devices that require anonymity and PKI for devices that do not.","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":"126563213","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":"Towards Smooth Introduction of IPv6 in SIP-based Architectures","authors":"M. Boucadair, Y. Noisette","doi":"10.1109/LCN.2007.12","DOIUrl":"https://doi.org/10.1109/LCN.2007.12","url":null,"abstract":"This paper presents major complications that arise when activating SIP (Session Initiation Protocol) within heterogeneous (i.e. IPv4 and IPv6) realms. It proposes scenarios for migrating SIP-based conversational services to IPv6. It also introduces two new procedures for routing optimization purposes when heterogeneous nodes are involved in the same SIP session.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"8 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":"128181282","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":"RFID Anti-collision Protocol for Dense Passive Tag Environments","authors":"Kashif Ali, H. Hassanein, A. Taha","doi":"10.1109/LCN.2007.140","DOIUrl":"https://doi.org/10.1109/LCN.2007.140","url":null,"abstract":"Tag collisions can impose a major inefficiency in RFID systems, resulting in low identification rates, short reading range and ineffective resource utilization. They are more problematic in passive tags due to limitations on power and functionality. In this paper, we present a novel approach to overcome the passive tag collision problem. The novelty in our scheme is that it requires no additional memory, results in a higher identification rate and reduces power and medium consumption. The proposed scheme can be augmented to tree- based anti-collision proposals, both existing and to come, and substantially improve their performance. Performance results indicate that the augmented schemes bear significant gains that are achieved by reducing collision, overhead and delay.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"24 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":"132178223","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":"Fibre Channel based Storage Area Network Modeling using OPNET for Large Fabric Simulations: Preliminary Work","authors":"J. Staley, S. Muknahallipatna, H. Johnson","doi":"10.1109/LCN.2007.51","DOIUrl":"https://doi.org/10.1109/LCN.2007.51","url":null,"abstract":"Fibre channel based storage area networks have been a common implementation for data storage in enterprise data centers. As the size of the storage area network tends to grow along with geographical distribution leading to distributed storage area network, also known as large fabric, the network seems to exhibit scaling and stability issues. The scaling and stability issues seem to stem from the construction, route discovery, and management process of the network which are fibre channel-2 level traffic more than the actual I/O data transmission process. To determine the scaling and stability issues of a large fabric, an adequate tool is required. The tool is usually a discrete event simulator since an analytical or hardware simulator tool would not be able to handle the large size of the storage area network and model in detail. In this paper, the preliminary work on modeling and simulations of a fibre channel based storage area network using OPNET as a discrete event simulator are presented. As a preliminary step, the fibre channel host bus adapter and its interactions with the fabric login server of a fibre channel switch during the fabric login process is modeled at the fibre channel-2 level and preliminary simulations are performed.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"1 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":"121301453","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":"Investigation of IEEE 802.11k-based Access Point Coverage Area and Neighbor Discovery","authors":"S. Hermann, M. Emmelmann, O. Belaifa, A. Wolisz","doi":"10.1109/LCN.2007.110","DOIUrl":"https://doi.org/10.1109/LCN.2007.110","url":null,"abstract":"Possessing knowledge about access point coverage areas and neighbors is of essential need for the provisioning of, e.g., location based handovers or push services. A convenient method for their discovery is the usage of information obtained by the mobile devices which are currently associated with the access points. The time span being required for the discovery of coverage areas and neighbors is fundamental in order to assess the suitability of such a method in a dynamic environment. In this paper, exemplary numerical results of the required bootstrapping phase for the information determination are presented. Additionally, a relatively simple enhancement of the algorithm computing the coverage areas is introduced, reducing the number of vertices for the description of the areas. Besides, the paper shows how the upcoming IEEE 802.11k standard enables APs to query mobile devices for location and neighbor information and hence presents for the first time an entirely standard compliant acquisition scheme.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"8 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":"116917139","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}