{"title":"Evaluation of Quality-of-Service Support in MultiProtocol Label Switching","authors":"K. Molnar, Martin Vlcek","doi":"10.1109/ICSNC.2010.48","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.48","url":null,"abstract":"The technology of MultiProtocol Label Switching (MPLS) represents one of the most advanced ways how to optimize the packet-forwarding process in routers. In addition, MPLS also offers new possibilities of resource sharing, important from the point of view of service differentiation and quality of service (QoS) support. The aim of the paper is to present the results of our investigation into the efficiency of QoS support mechanisms available in MPLS for different traffic types. For this purpose several simulation scenarios were built to obtain a complex overview of the topic examined.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132676364","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}
L. Gheorghe, R. Rughinis, Răzvan Deaconescu, N. Tapus
{"title":"Authentication and Anti-replay Security Protocol for Wireless Sensor Networks","authors":"L. Gheorghe, R. Rughinis, Răzvan Deaconescu, N. Tapus","doi":"10.1109/ICSNC.2010.9","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.9","url":null,"abstract":"Wireless Sensor Networks are used in domains such as medical monitoring, homeland security, industrial automation and military applications, therefore it is very critical to protect the network against malicious attacks. This paper presents a new security protocol that provides conversation authentication, integrity, intrusion prevention and anti-replay protection. The protocol uses two methods in order to meet these requirements: the last MAC method and an authentication handshake. The protocol has been implemented in TinyOS in two layers of the communication stack: the MAC and Authentication layer. The MAC layer is the implementation of the last MAC method and the Authentication layer generates and verifies the four messages exchanged during the authentication handshake. Authentication and Anti-replay Security Protocol has been tested with TOSSIM in various attack scenarios and has proved that it is able to reject malicious attempts to communicate with the network nodes.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"48 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120868739","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":"Prefilter Bandwidth Effects in Data Symbol Phase Synchronizers of Closed Loop","authors":"A. Reis, J. P. Carvalho, J. F. Rocha, A. Gameiro","doi":"10.1109/ICSNC.2010.75","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.75","url":null,"abstract":"This work studies the effects of the prefilter bandwidth on the symbol synchronizers of closed loop. The prefilter changes its bandwidth B, first B1=• (infinite), after B2=2.tx and next B3=1.tx, tx is the bit rate. The symbol synchronizer is based on a closed loop blocks. We consider four types, namely, the analog (ana), hybrid (hib), combinational (cmb) and sequential (seq). The objective is to study the prefilter bandwidth with the four symbol synchronizers and to evaluate their output jitter UIRMS (Unit Interval Root Mean Square) versus input SNR (Signal to Noise Ratio).","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124501564","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":"Reference Signals Power Allocation for Uplink MU-MIMO in LTE System","authors":"Yi Wang, Hua Zhou, Jianming Wu","doi":"10.1109/ICSNC.2010.55","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.55","url":null,"abstract":"In this paper, an efficient power allocation scheme of reference signals (RS) for uplink MU-MIMO in LTE system is introduced. In LTE system, some virtual subcarriers at the borders of the allocated bandwidth are used which invalidates the conventional power allocation schemes for uniformly placed reference signal. Further, RS for multiuser are multiplexed by cyclic shift. Constant power is required within one step of cyclic shift which adds more constraint on power allocation. The proposed RS power allocation scheme minimizes the mean square error (MSE) of the least square (LS) estimates considering the effect of virtual subcarriers and the constraint due to the cyclic shift. The effectiveness of the proposed scheme is verified by simulation results, showing that 2 dB SNR gain is achieved as opposed to conventional scheme with equal power reference signal.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122362806","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 Study of Bare PC SIP Server Performance","authors":"A. Alexander, A. Wijesinha, R. Karne","doi":"10.1109/ICSNC.2010.68","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.68","url":null,"abstract":"In bare computing, applications run directly on an ordinary PC without using an operating system (OS). Advantages of bare PC computing include elimination of overhead due to the OS, and immunity against attacks targeting OS vulnerabilities. We evaluate the performance of a bare PC SIP server by determining its throughput and latency in a dedicated test network using the open source SIPp workload generator to generate requests for registration (register, register update, and register logout operations), proxying (invite and invite-not-found operations) and redirection (invite redirect operation) with and without authentication. We also report internal timings for the server. The performance of the server is then compared with the OpenSER and Brekeke SIP servers running on Linux and Windows respectively. Our results show that the bare PC SIP server has low cost for internal SIP-related operations, higher throughput than the Windows server, and higher or equal throughput than the Linux server except in the case of redirection. Its latency is more than that of an OS-based server only in the case of invite with authentication and invite-not-found without authentication.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125680273","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 Evaluation of PMCMTP for Large-Scale Wireless Sensor Networks","authors":"J. B. Slimane, Yeqiong Song, A. Koubâa, M. Frikha","doi":"10.1109/ICSNC.2010.10","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.10","url":null,"abstract":"One of the major concerns in wireless sensor networks (WSNs) is improving the network lifetime. This paper addresses the problem of energy saving in an IEEE 802.15.4a large-scale full mesh WSNs based on UWB technology. It presents a network architecture to facilitate resource sharing and to ensure load and energy balancing. With a particular focus on medium access control (MAC) protocols, we propose a multi-channel MAC protocol, Prioritized Multi-Channel Multi-Time slot MAC protocol (PMCMTP), that due to its intelligent management of spectrum resource and time slots, can simultaneously improve energy efficiency and network quality-of-service (QoS). To prove energy efficiency and QoS support of PMCMTP, we implement it in a discrete-time simulator built in JAVA. Simulations results show that PMCMTP succeeds to save energy and to enhance network QoS with a low overhead.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132974498","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 Trusted Platform Module for Near Field Communication","authors":"M. Hutter, Ronald Toegl","doi":"10.1109/ICSNC.2010.27","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.27","url":null,"abstract":"Near Field Communication (NFC) has become widely available on smart phones. It helps users to intuitively establish communication between local devices. Accessing devices such as public terminals raises several security concerns in terms of confidentiality and trust. To overcome this issue, NFC can be used to leverage the trusted-computing protocol of remote attestation. In this paper, we propose an NFC-enabled Trusted Platform Module (TPM) architecture that allows users to verify the security status of public terminals. For this, we introduce an autonomic and low-cost NFC-compatible interface to the TPM to create a direct trusted channel. Users can access the TPM with NFC-enabled devices. The architecture is based on elliptic-curve cryptography and provides efficient signing and verifying of the security-status report. As a proof-of-concept, we implemented an NFC-enabled TPM platform and show that a trust decision can be realized with commodity smart phones. The NFC-enabled TPM can effectively help to overcome confidentiality issues in common public-terminal applications.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130810443","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}
Tao Yang, L. Barolli, Gjergji Mino, F. Xhafa, A. Durresi
{"title":"Impact of Mobile Event Movement on the Performance of Wireless Sensor Networks","authors":"Tao Yang, L. Barolli, Gjergji Mino, F. Xhafa, A. Durresi","doi":"10.1109/ICSNC.2010.19","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.19","url":null,"abstract":"In this paper, we investigate how the sensor network performs in the case when the event moves with special movement path. We compare the simulation results for four scenarios: when the event is stationary, moving randomly, moving with simple 4 path and boids path. The simulation results have shown that for the case when event is moving randomly the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of boids model, the gooput is unstable when the Tr is lower than 10 pps. The consumed energy characteristic increases with the increase of Tr. Simulation results show that the consumed energy of random movement is the worst among four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in the large scale WSNs.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126281240","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 System for Managing Vehicle Location Data with Optimal Privacy Features","authors":"F. Buccafurri, G. Lax","doi":"10.1109/ICSNC.2010.25","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.25","url":null,"abstract":"The high amount of vehicle location data, which come from various sources, raises serious privacy concerns. In this paper, we describe a system to store location data in such a way that privacy can be enforced according to standard requirements. The system maximizes the precision of location data in order that they can be profitable exploited for positive purposes, like crime fighting. The core of the system is the strategy used to reach this goal that combines the approaches of k-anonymity and location obfuscation to preserve privacy and uses a dynamic-programming technique to find the solution compliant with the privacy requirements and having the best accuracy.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126814753","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 Evaluation of Fixed Routing Algorithms in All-Optical Networks under Non-uniform Traffic","authors":"G. Durães, A. Soares, J. Amazonas, W. Giozza","doi":"10.1109/ICSNC.2010.63","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.63","url":null,"abstract":"Most works about all-optical circuit-switched WDM networks considers a shortest path algorithm for fixed routing, like the Dijkstra’ algorithm. However, recently, two new algorithms, searching for better load balancing and presenting superior performance than Dijkstra´s when submitted to an uniform traffic load, were proposed, the Restricted Routing Technique (RRT) and the Best among the Shortest Routes - (BSR). This work evaluates the performance of these algorithms under a non-uniform traffic load. For each topology studied were observed specific characteristics of the impact of the non-uniform traffic load for each routing algorithm. Overall, performance evaluation results showed that the algorithm BSR achieves for all topologies studied superior performance in terms of blocking probability and fairness.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127596216","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}