{"title":"TCP computational energy cost within wireless Mobile Ad Hoc Network","authors":"Alaa Seddik-Ghaleb, Y. Ghamri-Doudane, S. Senouci","doi":"10.1109/AICCSA.2009.5069447","DOIUrl":"https://doi.org/10.1109/AICCSA.2009.5069447","url":null,"abstract":"In this paper, we present the results of a detailed measurement study of the computational energy cost of different TCP variants when used in mobile ad hoc networks. The studied TCP variants are TCP New-Reno, Vegas, SACK, and Westwood. We used a hybrid approach using simulation and emulation, through SEDLANE emulation tool. This study investigates different packet loss models (congestion, link loss, signal loss, interference) with different ad hoc routing protocols (reactive and proactive). The study demonstrates that the fast retransmit/fast recovery phase has a mush lower energy cost than both slow start and congestion avoidance phases, sending more TCP data bytes in a shorter period of time.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126917659","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 channel assignment in Wireless Mesh Networks with guaranteed connectivity","authors":"S. Uludag, K. Akkaya","doi":"10.1109/LCN.2008.4664237","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664237","url":null,"abstract":"Using multiple radios/channels in wireless mesh networks (WMNs) can significantly boost the throughput of the network and brings broadband wireless access to more users with reduced cost. However, this requires careful assignment of channels to each radio so that interference due to parallel communications can be minimized and the network is not partitioned. We propose a distributed channel assignment protocol for WMNs to maximize the total number of non-interfering concurrent active links and guarantee the network connectivity. The motivation for maximizing the number of links is to give as much leeway to the routing subsystem as possible. The problem is modeled as a list coloring problem where each channel corresponds to a color. The main idea is to determine the minimum degree spanning tree (MDST) of the network for providing more parallel transmissions and guaranteeing connectivity. The links that are not part of the MDST are assigned channels based on a 5-way handshake protocol to resolve arising conflicting requests in the distributed approach. We validate the performance by comparing our approach to a greedy channel assignment that does not guarantee connectivity.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"73 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":"115752183","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 transmission scheme of JPEG images over Visual Sensor Networks","authors":"A. Mammeri, A. Khoumsi, D. Ziou, Brahim Hadjou","doi":"10.1109/LCN.2008.4664259","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664259","url":null,"abstract":"With Visual Sensor Networks (VSN), designers must respect strict constraints on energy consumption, which make compression standards, such as JPEG, not energy-beneficial to VSN. Our approach for tackling this constraint problem consists in adapting JPEG by exploiting the DCT energy compaction property. This exploitation is performed by processing only a portion of each block of 8 times 8 DCT coefficients of the captured image. This approach induces two conflicting effects. Indeed, reducing the size of the portion of DCT block presents the advantage of reducing the energy consumed for processing and transmitting an image, but it also presents the drawback of reducing the quality of the image received at the sink.We propose two methods to solve this conflict: a global method and a local method. In the global method, an optimal size is computed for all portions of DCT blocks of a whole image.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"21 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":"121340808","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":"Reputation based trust management using TCG in Mobile Ad-Hoc Networks (RTA)","authors":"Sègla Kpodjedo, S. Pierre, M. Pourzandi","doi":"10.1109/LCN.2008.4664218","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664218","url":null,"abstract":"The Mobile Ad-Hoc Networks (MANET) are more and more important due to their increasing use. At the same time, the Trusted Computing Group (TCG) approach in using TPM based hardware root of trust is increasingly used in mobile devices providing a trustable source of knowledge about software composition of devices. In this paper, we develop a new approach to evaluate trust among peers in an Ad Hoc network, based on the reputation of their software composition.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"78 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":"126172598","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":"P2P directory search: Signature Array Hash Table","authors":"M. Jimeno, Kenneth J. Christensen","doi":"10.1109/LCN.2008.4664213","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664213","url":null,"abstract":"Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory accesses for an element test. In this paper, we develop a hash table data structure that stores string signatures in an array. This new signature array hash table (SAHT) supports faster element testing than a bloom filter and requires less memory than a standard hash table that uses linked-list chains. The SAHT also supports removal of elements (which a Bloom filter does not) and addition of elements at the expense of requiring about 1.5x more memory than a bloom filter with same false positive rate.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"29 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":"128646458","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}
Jordi Pujol Ahulló, P. López, Marc Sánchez Artigas, A. Gómez-Skarmeta
{"title":"Supporting geographical queries onto DHTs","authors":"Jordi Pujol Ahulló, P. López, Marc Sánchez Artigas, A. Gómez-Skarmeta","doi":"10.1109/LCN.2008.4664201","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664201","url":null,"abstract":"Location-based services (LBS) are currently receiving world-wide attention as a consequence of the massive usage of mobile devices, but such location services require scalable distributed infrastructures in order to resolve spatial queries efficiently. We propose a novel methodology to enable geographical query support to distributed hash tables (DHTs). The contributions of our methodology are the following: a) our technique is DHT-generic, b) it makes an effective clusterization of nodes and information into geographical areas, c) providing data locality without sacrificing routing and data load balancing, d) it is able to answer classical spatial range queries, as well as e) a new kind of queries we call geocast, all of them in a distributed, scalable way. We demonstrate the feasibility of our approach through representative simulations.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"9 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":"123947399","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 CGA based IP source address authentication method in IPv6 access network","authors":"Guang Yao, J. Bi","doi":"10.1109/LCN.2008.4664225","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664225","url":null,"abstract":"In this paper, we present a novel source address spoofing prevention method for IPv6 access network called CGA based source address authentication (CSAA). It makes use of CGA (cryptographically generated address) to generate an unspoofable identifier of host without PKI, and bind it to the authorized address of the host. Then all the packets sent out by the host can be validated in the first-hop router by a light-weight method.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"127 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":"131996746","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":"QoE-based network selection for multimedia users in IEEE 802.11 wireless networks","authors":"Kandaraj Piamrat, A. Ksentini, C. Viho, J. Bonnin","doi":"10.1109/LCN.2008.4664195","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664195","url":null,"abstract":"Widespread use of wireless networks nowadays raises many challenging issues to be explored. With increasing of multimedia traffic, quality of experience (QoE) needs to be satisfied at users while overall performance needs to be maintained at networks. In order to achieve these goals, the use of network selection mechanism is inevitable. When several access points are present, user should select the best available network while trying to keep load balanced between access networks. In this paper, we present a user-based and network-assisted scheme for network selection in wireless IEEE 802.11 technology. By providing users in decision making process with relevant information about the networks, the proposed solution keeps compromising advantage for both user and network. Our mechanism is based on a technique called pseudo-subjective quality assessment (PSQA), which is used basically to measure quality of experience perceived by users. We propose a new scheme where PSQA tool is used to assist in terminal-centric network selection. We explain the scheme and illustrate its efficient performance compared to a signal-based mechanism.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"14 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":"130909153","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 analysis on error servers for stochastic network calculus","authors":"Jing Xie, Yuming Jiang","doi":"10.1109/LCN.2008.4664168","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664168","url":null,"abstract":"Network calculus is a recently developed theory dealing with queuing systems found in computer networks with focus on service guarantee analysis. In the current network calculus literature, the behavior of a server is typically modeled with the cumulative amount of service it successfully delivers, and the successfulness of service delivery implies no error in the delivered service. However, there are many networks such as wireless networks, where, not only is the service error-prone due to multi-access contention and/or random error on the communication link, but different error handling methods may also be applied. In such cases, it is difficult to directly apply the existing network calculus results due to lack of server models taking error into account. In this paper, an error server model is proposed for stochastic network calculus, based on which, an analysis on error servers is performed. The corresponding concatenation property is derived, which shows that under some general conditions, the tandem of error servers can be treated as an equivalent error server. In addition, to demonstrate the use and implication of the proposed error server model, performance bounds are derived and compared for a simple network. The study of the simple network shows that error handling may have significant impact on the performance bounds, and the proposed error server model can facilitate the analysis.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"15 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":"127858047","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":"Cross-Layer analysis and enhancement of fast MIPv6 in the real IEEE 802.11 based WLANs","authors":"Yilin Song, Yi Sun","doi":"10.1109/LCN.2008.4664219","DOIUrl":"https://doi.org/10.1109/LCN.2008.4664219","url":null,"abstract":"We divide the predictive FMIPV6 handover procedure into 5 phases. Among these phases, the link layer prediction, the predictive tunneling and sender preparation phases are mainly concerned, the latencies and the reasons for the latencies in the 3 phases are analyzed in an IEEE 802.11 test-bed. Based on the analysis, a cross-layer fast handover management mechanism is proposed and proved to be efficient through experiments.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"33 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":"124232354","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}