{"title":"ESTREL: Transmission and Reception Energy Saving Model for Wireless Ad Hoc Networks","authors":"L. Kaddar, A. Mehaoua","doi":"10.1109/LCN.2007.35","DOIUrl":"https://doi.org/10.1109/LCN.2007.35","url":null,"abstract":"Multimedia streaming over ad hoc networks forms a continuous progress domain due to users' growing needs and wireless devices incessant evolution. Our objective, in this study, is to increase individual wireless nodes lifetime by a saving energy model based on video transmission/reception which allows increasing the ad hoc network lifetime. When arriving at a predefined threshold, we reduce the number of multimedia transmitted/received packets by exploiting the MPEG4 enhancement layers. In our proposal we optimize the tradeoff between the energy consumption and the perceived video quality. Simulation results show that we outperform the conventional approach by increasing the overall network lifetime.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"253 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":"115974612","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":"eSMP: A Multicast Protocol to Minimize SOAP Network Traffic in Low Bandwidth Environments","authors":"K. Phan, Z. Tari, P. Bertók","doi":"10.1109/LCN.2007.44","DOIUrl":"https://doi.org/10.1109/LCN.2007.44","url":null,"abstract":"Web services, which are built on SOAP as the transport protocol, have emerged in recent years as a promising technology to enable interoperability between distributed applications. As such, SOAP may be used to handle a large number of transactions; and consequently it is desirable to have SOAP perform efficiently in high traffic environments. This paper presents eSMP, an extension of our previous work on a similarity-based SOAP multicast protocol (SMP). eSMP offers improvements over SMP in terms of traffic size by using its own routing protocol instead of the conventional shortest path algorithm to route messages to paths that will minimize the number of bytes transmitted in the network. From extensive experiments, it is shown that eSMP achieves a minimum of 25 percent reduction in total network traffic than SMP with a trade-off of 10 percent increase in average response time. Compared to unicast, bandwidth consumptions can by reduced by up to 80 percent when using eSMP and 70 percent when using SMP. Therefore, eSMP is suitable for applications where bandwidth requirement is critical but not time.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"104 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":"122913711","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 Method for Self-Organizing Communication in WSN Based Localization Systems: HashSlot","authors":"M. Baunach, Reiner Kolla, Clemens Muhlberger","doi":"10.1109/LCN.2007.67","DOIUrl":"https://doi.org/10.1109/LCN.2007.67","url":null,"abstract":"Localization of objects within space is a common problem in WSN research. Besides the location estimation itself, wireless communication is a central aspect within such systems. We present the novel HashSlot method for assured and collision-free transmission of radio packets from multiple sources to a common destination within a constant and predictable time. Due to self-organization, our approach needs no prior active coordination between sensor nodes and offers various techniques like selectable quality of service levels to dynamically limit the number of returned information during runtime. Thereby, precision and speed of the localization process can be adjusted, fault tolerance can be achieved and energy consumption will be reduced. This paper describes theory and application of the HashSlot method within a real WSN based localization system.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"95 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850129","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":"RRAND: A New Requirement Aware RAND based Flexible Slot Allocation Mechanism Optimized For Spatial Reuse Of Slots","authors":"Y. K. Rana, S. Jha","doi":"10.1109/LCN.2007.95","DOIUrl":"https://doi.org/10.1109/LCN.2007.95","url":null,"abstract":"Schedule based MAC schemes do not perform well for dynamic network and traffic conditions. Their inflexibility makes them unsuitable for most real life applications. This inflexibility is due to the nature of schedule based approach. However, it depends mainly on the re-scheduling and slot allocation strategies employed. A flexible schedule based scheme should allow for the nodes to access the medium with different periodicity. The periodicity should be based on their traffic requirements which may result in improved channel utilization. However, traditionally used slot allocation protocols, e.g. RAND[1], do not consider the required medium access periodicity while allocating slot to the node. Thus, resulting schemes are not flexible to dynamic traffic conditions. This results in bandwidth wastage. In this paper, we propose a new flexible requirement aware RAND (RRAND) mechanism to allocate slots efficiently. Through simulations we show that our mechanism improves channel utilization on an average by about 60 %. The fairness characteristics are also improved significantly.","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":"126925649","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":"Effect of Delivery Latency, Feedback Frequency and Network Load on Adaptive Multimedia Streaming","authors":"Gabriel-Miro Muntean","doi":"10.1109/LCN.2007.18","DOIUrl":"https://doi.org/10.1109/LCN.2007.18","url":null,"abstract":"As video on demand systems gain popularity, it seems likely that the desire to serve a high number of customers from limited network resources could lead to a degradation of the end- users' perceived quality. Quality-oriented adaptation scheme (QOAS) balances the need for high quality with increased network utilization when streaming multimedia. QOAS requires client-side monitoring of some transmission-related parameters, grading of the end-user's quality and feedback that informs the server about the received quality. In response to this feedback, the server adjusts the streaming process in order to maximize the end-user perceived quality in the current conditions. This paper studies the effect of delivery latency and feedback frequency on quality-oriented adaptive multimedia streaming. It also shows how high end-user perceived quality is maintained in the presence of different types of background traffic while recording a significant increase in link utilization and a very low loss rate.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"106 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":"124085661","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":"Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption","authors":"Sunoh Choi, Sang-Seon Byun, C. Yoo","doi":"10.1109/LCN.2007.64","DOIUrl":"https://doi.org/10.1109/LCN.2007.64","url":null,"abstract":"Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming includes a redundant information, which results in additional bandwidth consumptions in entire distribution trees. In this paper, we deploy core nodes in distribution tree, and give a role of MD coding to each core node, instead of a source node then we show how amount of bandwidth consumption can be reduced. Since the problem of finding an optimal set of core nodes is proved to be NP-hard, an intuitional heuristic-based algorithm is proposed. The simulation results show that our heuristic algorithm reduces the bandwidth consumptions by about 25% in the hierarchical topology compared to the MD coding in source node only.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"75 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":"121500285","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":"An Energy-efficient Multihop Cooperative Transmission Protocol Design for Sensor Networks","authors":"Pan Zhou, Wei Liu, Kanru Xu","doi":"10.1109/LCN.2007.55","DOIUrl":"https://doi.org/10.1109/LCN.2007.55","url":null,"abstract":"We present a cluster-based virtual multiple-input single-output (vMISO) multihop cooperative transmission protocol in wireless sensor networks. In order to construct the cooperative transmission, we arrange each hop into two consecutive time slots: the intra-cluster slot, that accounts for data sharing within the cluster, and the inter-cluster slot for transmission between clusters. In this protocol, we investigate a novel optimal cluster formation method and best cooperative transmission routing selection base on the network energy consumption status. Also, an optimization model is developed to find the optimum number of cooperative nodes, clusters and transmission rates. Simulation results show that the protocol can save energy significantly.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"73 9 cz. 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":"127318837","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":"Digital Ecosystem for Cross-domain Context Sensing and Trading","authors":"T. Pfeifer, P. Malone","doi":"10.1109/LCN.2007.126","DOIUrl":"https://doi.org/10.1109/LCN.2007.126","url":null,"abstract":"There is a need for exchange and trade of contextual information within ubiquitous computing environments between different providers of context-aware services. It is the need of a mobile user to obtain such services wherever he roams during the course of the day, such as home, workplace, leisure and visiting businesses, in a way that is safe and secure for both the user as well as the providers, while generating the maximum benefit from synergetically aggregating pieces of contextual information. A possible method to model the peer-to-peer relationships and complex structure of different interests is the introduction of digital ecosystems. The digital ecosystem is an emerging paradigm for economic and technological innovation. It consists of a self-organising digital infrastructure, aimed at creating a digital environment for networked organisations (or agents) thus supporting the cooperation, knowledge sharing and development of open and adaptive technologies and evolutionary, domain knowledge rich, environments.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"114 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":"132545597","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}
Y. Uhm, Zion Hwang, Minsoo Lee, Yong Kim, Gwanyeon Kim, Sehyun Park
{"title":"A Context-Aware Multi-Agent System for Building Intelligent Services by the Classification of Rule and Ontology in a Smart Home","authors":"Y. Uhm, Zion Hwang, Minsoo Lee, Yong Kim, Gwanyeon Kim, Sehyun Park","doi":"10.1109/LCN.2007.28","DOIUrl":"https://doi.org/10.1109/LCN.2007.28","url":null,"abstract":"This paper proposes a context model which separates the upper and lower layer according to characteristic of each class using the Web Ontology Language (OWL). We also present a context-aware multi-agent system (CAMAS) architecture which provides the solution of policy problem using the classification of rule and implementation of a rule-based engine. We enhance the response time for offering adaptive services. We solve the policy conflict problem among users by using reasoning and privilege delegation.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"73 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":"131397625","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":"TCP Prediction for Adaptive Applications","authors":"R. Karrer","doi":"10.1109/LCN.2007.145","DOIUrl":"https://doi.org/10.1109/LCN.2007.145","url":null,"abstract":"Adaptive applications, such as real-time multimedia streaming applications, are increasingly using TCP as their underlying transport protocol. To adapt the content, an elastic application needs a prediction of the future available bandwidth. Unfortunately, the socket API does not allow an application to get information from the transport layer. Therefore, this paper proposes an approach where a monitor collects packet information from the network interface, creates a time series by sampling the packet information, and uses prediction models to assess the future available bandwidth. We collected more than 55000 raw TCP traces among various hosts in the Internet, sampled them at intervals from 0.01 to 5 seconds, and use standard linear and autoregressive prediction models, including Bestmean, AR, MA and ARMA, to determine the normalized prediction error. We find that the prediction error varies significantly as a function of the above parameters. We therefore derive a simple criterion that allows an adaptive application to dynamically adjust the prediction parameters to reduce the prediction error. We evaluate the benefit of this criterion on the number of correctly received frames at the client, which corresponds to the perceived video quality by the user.","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":"122416835","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}