{"title":"Fingerprint-Based Location Estimation with Virtual Access Points","authors":"A. Hossain, H. N. Van, Wee-Seng Soh","doi":"10.1109/ICCCN.2008.ECP.99","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.99","url":null,"abstract":"Location fingerprinting techniques generally make use of existing wireless network infrastructure. Consequently, the positions of the access points (APs), which constitute an integral part of a location system, will invariably be dictated by the network administrator's convenience regarding data communication. But the localization accuracy of fingerprint-based solutions is largely dependent on the APs' placements over the area. In this paper, we developed the idea of virtual access point (VAP), where one can have AP's functionality at a desired position for localization purpose, without physically placing an AP there. We argue that, placing VAPs at favorable positions helps to improve localization accuracy. VAP also serves the purpose of virtually increasing the number of APs over the localization area, which according to previous works should enhance the localization accuracy further. We test the feasibility of our VAP idea both analytically and experimentally. Finally, we present our results using a well-known localization algorithm, namely, k-nearest neighbor, when our VAP idea is implemented. The findings are quite encouraging, which report significant improvement in the localization accuracy.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127219083","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":"Clique-Based Location Estimations for Wireless Sensors in GPS-Free Environments","authors":"P. Mazurkiewicz, K. Leung","doi":"10.1109/ICCCN.2008.ECP.54","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.54","url":null,"abstract":"In this paper we present a distributed, self-organizing, localization method for wireless sensors and a scheme for reducing position estimate errors by employing a novel concept of cliques of nodes. We describe an applicable theoretical foundation of peer-to-peer distance-vector (DV) exchange algorithm, which can operate without any manual pre-configuration. This method allows for propagating the complete information of a reference system (i.e., axes orientation and origin position) using angle and range measurements. In order to take advantage of possible spatial-diversity of measurements and to produce enhanced position estimates, we propose here an enhancement method which is based on groups of interconnected nodes (cliques) to combine localization measurements using a minimum-square-error (MSE) criterion and spatial transformations. This enables propagation of the reference system among all the nodes in a clique more accurately than by regular peer-to-peer distance-vector exchanges. Computer simulation reveals that the new clique based error mitigating scheme reduces the localization error by 65% for a typical underground tunnel setting.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127481008","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":"Jitter Buffer Analysis","authors":"Boris Oklander, M. Sidi","doi":"10.1109/ICCCN.2008.ECP.33","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.33","url":null,"abstract":"VoIP is rapidly growing and widely used real-time voice service. On the path through the packet-switched networks, the regularity of VoIP stream is impaired by routing, queuing, scheduling and serialization effects, consequently resulting in loss and delay jitter of packets. Achieving high quality real-time voice requires smoothing the delay jitter at the receiver which is generally done by means of jitter buffer mechanism. Although being an important VoIP element, the exact analysis of the jitter buffer is rather rare. In this paper we model the jitter buffer mechanism and carry out the analysis of its performance. The relations between such quantities as initial playout delay, delay jitter and loss are established. Then, these relations are used together with the voice quality evaluation methodologies MOS and E-model, to optimally choose the controlling parameters of the jitter buffer, in order to increase the perceived quality of the voice. The analytic results developed in this work are applicable for incorporation in playout algorithms to achieve better voice quality.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128897477","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":"Bargaining and Multi-User Detection in MIMO Interference Networks","authors":"M. Nokleby, A. L. Swindlehurst","doi":"10.1109/ICCCN.2008.ECP.103","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.103","url":null,"abstract":"We investigate the use of multi-user detection to improve performance in MIMO interference networks. Unfortunately, while multi-user detection often allows higher data rates, it greatly complicates the problem: in addition to choosing a transmit covariance for each transmitter, we must decide which signals each receiver will detect and which data rates make such detection feasible. We discuss methods to optimize the data rates in two ways: maximizing the sum throughput of the network, and choosing rates based on the Kalai-Smorodinsky bargaining solution from cooperative game theory. Simulation results suggest that, while sum-rate maximization yields higher average throughput, the Kalai-Smorodinsky solution provides a superior solution in terms of fairness. The simulations also suggest that multi-user detection significantly improves network performance.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125596055","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":"Weighted-Fairness AIMD Congestion Control for Streaming Media Delivery","authors":"Jun Liu","doi":"10.1109/ICCCN.2008.ECP.53","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.53","url":null,"abstract":"Streaming media applications require acceptable levels of quality of service (QoS). Appropriate rate control mechanism is needed to make streaming media applications to adapt to dynamic network conditions. This paper discusses a window-based weighted-fairness AIMD (WF-AIMD) congestion control algorithm which allows competing flows to share a common bandwidth according to their weights. By making flows to reduce their congestion window sizes with respect to their weights upon detection of congestion indications, flows can be made to unevenly share a common network path. The queueing scheme adopted at the bottleneck link largely impact the bandwidth share of a flow. Following a fluid modeling approach, we derived the modeling of the sending rate of a flow that is controlled under a WF-AIMD algorithm. This modeling has been validated under the DropTail FIFO queueing scheme and the RED scheme. We found that our modeling works well for both the RED scheme and for the DropTail FIFO queueing scheme with a relatively small queue size limit. Our modeling fails when flows become synchronized. The synchronization usually happens when the bottleneck queue adopts a DropTail FIFO queueing scheme with a large queue size limit.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121441155","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}
R. Maunder, A. Weddell, G. Merrett, B. Al-Hashimi, L. Hanzo
{"title":"Iterative Decoding for Redistributing Energy Consumption in Wireless Sensor Networks","authors":"R. Maunder, A. Weddell, G. Merrett, B. Al-Hashimi, L. Hanzo","doi":"10.1109/ICCCN.2008.ECP.36","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.36","url":null,"abstract":"In this paper, we propose a method for desirably redistributing a wireless sensor network's energy consumption from its sensor nodes (which may have scarce energy resources obtained through energy harvesting, for example) to its central node (which often has an abundant energy resource, such as the mains). At the cost of increasing the central node's decoding complexity, our method facilitates (1) a significant reduction in the number of times the sensor nodes are required to retransmit data owing to transmission errors and/or (2) a reduction of up to 3.99 dB in the sensor node's total transmit energy consumption. We show that our approach can reduce the overall energy consumption of transmitting sensor nodes by more than 20% in practice.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126606794","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}
Zheng Huang, Xunrui Yin, Xin Wang, Jin Zhao, X. Xue
{"title":"CODED IP: On the Feasibility of IP-Layer Network Coding","authors":"Zheng Huang, Xunrui Yin, Xin Wang, Jin Zhao, X. Xue","doi":"10.1109/ICCCN.2008.ECP.28","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.28","url":null,"abstract":"Nowadays, the real practice of network coding in wireline networks is focused on the P2P overlay networks. Although it can help to utilize network resources more efficiently, P2P network coding does not exhibit benefits in terms of the maximum throughput. Our work aims to implement network coding at the IP layer, which is an idea not fundamentally new, but with little real practice because of the enormous difficulties involved. In this paper we propose CODED IP, a protocol framework that plugs network coding into the current IP stack. Experiments on a 22-node testbed show that CODED IP provides multicast traffic with not only a significantly higher throughput than overlay network coding and naive IP multicast, but also a more balanced load distribution as compared with overlay network coding.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121390380","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 Personalized Group Trust Management System for Collaborative Services","authors":"Xiaolin Li, Huanyu Zhao","doi":"10.1109/ICCCN.2008.ECP.178","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.178","url":null,"abstract":"In this paper, we present a group trust management system S3Trust for collaborative services in peer-to-peer grid systems. S3Trust is based on personalized trust rating and selective aggregation algorithms. Leveraging the robustness of a simplistic but elegant co-constraint aggregation algorithm (inspired by H-index) under incomplete and uncertain circumstances, S3Trust offers a robust and lightweight reputation evaluation mechanism for both individual and group trusts with minimal communication and computation overheads. The five phases of S3Trust scheme are presented in detail, including trust recording, local trust evaluation, trust query phase, spatial-temporal update phase, and group reputation evaluation phases. Simulation results demonstrate that S3Trust is robust and can efficiently aggregate cooperative groups in systems with malicious users.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121510021","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":"Security Extensions for Space-Link Communication","authors":"D. Fischer, M. Merri, T. Engel","doi":"10.1109/ICCCN.2008.ECP.91","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.91","url":null,"abstract":"In recent times, the importance of information security in civilian space communication systems has increased significantly among space agencies. Those systems often require a high degree of flexibility, interoperability and scalability. Therefore the usage of traditional, physical layer based security solutions is not a desirable option for the agencies. In this paper, we investigate the application of security services to the CCSDS Packet TM/TC space communication protocol stack and propose a transparent and open solution that provides an optimal trade-off between security, interoperability and technical implementation feasibility. We take into consideration the special restrictions that are superimposed by the space environment and existing legacy systems.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134315335","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}
Andrew R. Dalton, William P. McCartney, K. G. Dastidar, J. Hallstrom, Nigamanth Sridhar, T. Herman, William Leal, A. Arora, M. Gouda
{"title":"DESAL alpha: An Implementation of the Dynamic Embedded Sensor-Actuator Language","authors":"Andrew R. Dalton, William P. McCartney, K. G. Dastidar, J. Hallstrom, Nigamanth Sridhar, T. Herman, William Leal, A. Arora, M. Gouda","doi":"10.1109/ICCCN.2008.ECP.108","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.108","url":null,"abstract":"We present DESALalpha, a realization of the dynamic embedded sensor-actuator language for Telos-based devices. The platform provides native support for: (i) rule-based programming; (ii) synchronized action scheduling; (iii) neighborhood management; and (iv) distributed state sharing. We describe the design and implementation of DESALalpha, present examples that illustrate its use, and summarize the resource requirements of compiled applications. Finally, we present lessons learned based on our use of DESALalpha during the past year.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133800957","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}