In the current specification of Proxy Mobile IPv6, there is no attempts for optimized authentication mechanism. In this paper, we propose a ticket-based authentication mechanism in where the security information are reused for fast authentication during mobile nodes hand off between different links. According to the performance evaluation, the proposed mechanism shows the improved performance up to 89.2% compared to EAP-TLS and Kerberos. In addition, we provide the validity of the proposed mechanism through BAN logic.
{"title":"Ticket-Based Authentication Mechanism for Proxy Mobile IPv6 Environment","authors":"Joong-Hee Lee, Jong‐Hyouk Lee, Tai-Myung Chung","doi":"10.1109/ICSNC.2008.25","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.25","url":null,"abstract":"In the current specification of Proxy Mobile IPv6, there is no attempts for optimized authentication mechanism. In this paper, we propose a ticket-based authentication mechanism in where the security information are reused for fast authentication during mobile nodes hand off between different links. According to the performance evaluation, the proposed mechanism shows the improved performance up to 89.2% compared to EAP-TLS and Kerberos. In addition, we provide the validity of the proposed mechanism through BAN logic.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114167358","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}
Communication infrastructures of highly distributed software architectures are often complex to configure and costly to manage. Dynamics in the environment leading to a need for self-adaptation will further complicate maintenance. For this purpose we introduce Geminga, a service discovery approach for application in ad hoc networks and self-configuration of communication infrastructures. Tailored to unreliability in communication, it bridges the gap between traditional application domains of distributed architectures and groups of mobile robots. The applicability of Geminga is shown by adapting it to a software framework for autonomous soccer robots.
{"title":"Geminga: Service Discovery for Mobile Robotics","authors":"P. Baer, T. Weise, K. Geihs","doi":"10.1109/ICSNC.2008.29","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.29","url":null,"abstract":"Communication infrastructures of highly distributed software architectures are often complex to configure and costly to manage. Dynamics in the environment leading to a need for self-adaptation will further complicate maintenance. For this purpose we introduce Geminga, a service discovery approach for application in ad hoc networks and self-configuration of communication infrastructures. Tailored to unreliability in communication, it bridges the gap between traditional application domains of distributed architectures and groups of mobile robots. The applicability of Geminga is shown by adapting it to a software framework for autonomous soccer robots.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116271623","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}
In a wireless network the communication works in half duplex mode and nodes that can interfere together. In this context, fairness is not obvious. This paper will focus on fairness in the received packets by each node. Fairness is evaluated for a static network topology called Star Network. Some simulations are used to illustrate a way to get fairness in the network by controlling the flow rates of the network.
{"title":"Fairness in a Static Wireless Network","authors":"Marc Gilg, P. Lorenz, A. Makhlouf","doi":"10.1109/ICSNC.2008.23","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.23","url":null,"abstract":"In a wireless network the communication works in half duplex mode and nodes that can interfere together. In this context, fairness is not obvious. This paper will focus on fairness in the received packets by each node. Fairness is evaluated for a static network topology called Star Network. Some simulations are used to illustrate a way to get fairness in the network by controlling the flow rates of the network.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116521799","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}
G. Ramu, R. Hariprakash, K. Visalakshi, S. Ananthi, K. Padmanabhan
Without building new technology and involved hardware circuit boards, how to develop industrial artificial neural network (ANN) based robotic projects for enterprises is explained with special reference to GSM cell and robotic models. In the process of training to develop enterprise robots, one has to make use of all possible resources. Without the need for development of new circuits or methodology, existing devices, components and services can be used to develop a standard robotic project. There are many examples like traffic control, agricultural plantation and adaptive surveillance. The groundwork of technology for the above robot data collection and control is elucidated and schemes using simple readily available hardware for easy and quick rigging up of robotic systems is the theme of this paper.
{"title":"Remote Robot Training of Its Artificial Neural Network through GSM Communication","authors":"G. Ramu, R. Hariprakash, K. Visalakshi, S. Ananthi, K. Padmanabhan","doi":"10.1109/ICSNC.2008.39","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.39","url":null,"abstract":"Without building new technology and involved hardware circuit boards, how to develop industrial artificial neural network (ANN) based robotic projects for enterprises is explained with special reference to GSM cell and robotic models. In the process of training to develop enterprise robots, one has to make use of all possible resources. Without the need for development of new circuits or methodology, existing devices, components and services can be used to develop a standard robotic project. There are many examples like traffic control, agricultural plantation and adaptive surveillance. The groundwork of technology for the above robot data collection and control is elucidated and schemes using simple readily available hardware for easy and quick rigging up of robotic systems is the theme of this paper.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125902664","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}
The IETF is specifying mobility management protocols. Recently, proxy mobile IPv6 has been specified as a network-based localized mobility management protocol. Since the base specification of proxy mobile IPv6 does not cover the route optimization, many research papers have been suggested for route optimization in proxy mobile IPv6. However, most of suggestions are concentrated on the route optimization between two mobile nodes that follows proxy mobile IPv6 operations. In this paper, we propose a new mechanism for route optimization between proxy mobile IPv6 based mobile node and on-link IPv6 prefix based node within proxy mobile IPv6 domain. The proposed mechanism uses the routing table and security policy database of the mobile access gateway to find the optimized route between them. We analyze our proposed mechanism in mathematical method and discuss the enhancement of the performance as well as the effect of the environmental parameters.
{"title":"PMIPv6 Route Optimization Mechanism Using the Routing Table of MAG","authors":"Byung-Jin Han, Jae-Min Lee, Jong-Hyouk Lee, Tai-Myung Chung","doi":"10.1109/ICSNC.2008.9","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.9","url":null,"abstract":"The IETF is specifying mobility management protocols. Recently, proxy mobile IPv6 has been specified as a network-based localized mobility management protocol. Since the base specification of proxy mobile IPv6 does not cover the route optimization, many research papers have been suggested for route optimization in proxy mobile IPv6. However, most of suggestions are concentrated on the route optimization between two mobile nodes that follows proxy mobile IPv6 operations. In this paper, we propose a new mechanism for route optimization between proxy mobile IPv6 based mobile node and on-link IPv6 prefix based node within proxy mobile IPv6 domain. The proposed mechanism uses the routing table and security policy database of the mobile access gateway to find the optimized route between them. We analyze our proposed mechanism in mathematical method and discuss the enhancement of the performance as well as the effect of the environmental parameters.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125321447","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}
M. Mendicute, I. Sobrón, J. Ser, P. Prieto, Ricardo Isasi
This article describes the design and implementation of a channel equalizer for a terrestrial digital television (digital video broadcasting-terrestrial, DVB-T) on-channel repeater, namely gap-filler. Two are the benefits of including this equalizer in a repeater setup: on one hand, the transmitted signal requires a lower dynamic range and its degradation becomes smaller at the output amplifiers, thus allowing for a higher transmit power for the same modulation error rate (MER). On the other hand, it eases the equalization and decoding processes at the final receiver by improving its operation conditions. In this context, we present a novel low-cost equalizer architecture for mid-range and domestic gap-fillers. The design, implementation and validation methodology is also described, from the initial Matlab and advanced design system (ADS) simulations to the final hardware implementation, based on a field programmable gate array (FPGA) device and a Blackfin digital signal processor (DSP). The obtained practical results assess the performance gains predicted by simulation, hence proving the validity and efficacy of the designed equalizer to reduce the cost of the amplifiers and to obtain a better signal quality at the final userpsilas receiver.
{"title":"Design, Simulation and Implementation of a Channel Equalizer for DVB-T On-channel Repeaters","authors":"M. Mendicute, I. Sobrón, J. Ser, P. Prieto, Ricardo Isasi","doi":"10.1109/ICSNC.2008.13","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.13","url":null,"abstract":"This article describes the design and implementation of a channel equalizer for a terrestrial digital television (digital video broadcasting-terrestrial, DVB-T) on-channel repeater, namely gap-filler. Two are the benefits of including this equalizer in a repeater setup: on one hand, the transmitted signal requires a lower dynamic range and its degradation becomes smaller at the output amplifiers, thus allowing for a higher transmit power for the same modulation error rate (MER). On the other hand, it eases the equalization and decoding processes at the final receiver by improving its operation conditions. In this context, we present a novel low-cost equalizer architecture for mid-range and domestic gap-fillers. The design, implementation and validation methodology is also described, from the initial Matlab and advanced design system (ADS) simulations to the final hardware implementation, based on a field programmable gate array (FPGA) device and a Blackfin digital signal processor (DSP). The obtained practical results assess the performance gains predicted by simulation, hence proving the validity and efficacy of the designed equalizer to reduce the cost of the amplifiers and to obtain a better signal quality at the final userpsilas receiver.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121741485","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}
IP multimedia subsystems (IMS) is using session initiation protocol (SIP) as signalling protocol. SIP is becoming computing intensive and hence the ability of entry and exit proxies to process SIP messages has great impact on the overall performance of the IMS core network. This paper shows that the flow of SIP messages during handover process in the IMS core network complies with the well known central server model. The later is validated via discrete event simulation results. The performance prediction study reveals that S-CSCF is the bottleneck device of the IMS core network processing a large number of SIP messages.
{"title":"Performance Modelling and Evaluation of Handover Mechanism in IP Multimedia Subsystems","authors":"I. Mkwawa, D. Kouvatsos","doi":"10.1109/ICSNC.2008.48","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.48","url":null,"abstract":"IP multimedia subsystems (IMS) is using session initiation protocol (SIP) as signalling protocol. SIP is becoming computing intensive and hence the ability of entry and exit proxies to process SIP messages has great impact on the overall performance of the IMS core network. This paper shows that the flow of SIP messages during handover process in the IMS core network complies with the well known central server model. The later is validated via discrete event simulation results. The performance prediction study reveals that S-CSCF is the bottleneck device of the IMS core network processing a large number of SIP messages.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122716970","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}
DSTBC (differential space-time block coding) system does not require CSI (channel state information) in both transmitter and receiver sides, but its SNR (signal to noise ratio) versus BER (bit error rate) characteristic is degraded compared with original STBC scheme which utilizes CSI at the receiver. In this paper, attempting to recover this performance loss originated from the differential decoding, an improved DSTBC system is presented. In the proposed approach, data sequence after the hard decision is fed back and utilized for the channel estimation, and then the noise contained in the received signal is reduced using updated channel information before the differential decoding. Through computer simulations in fading channels assuming mobile applications, it is shown that the improved method could achieve better performance and shows higher tolerance to Doppler effect compared to conventional DSTBC.
{"title":"Performance Improvement of DSTBC Systems Using Decision Feedback Approach","authors":"T. Taniguchi, Yang Liu, Y. Karasawa","doi":"10.1109/ICSNC.2008.58","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.58","url":null,"abstract":"DSTBC (differential space-time block coding) system does not require CSI (channel state information) in both transmitter and receiver sides, but its SNR (signal to noise ratio) versus BER (bit error rate) characteristic is degraded compared with original STBC scheme which utilizes CSI at the receiver. In this paper, attempting to recover this performance loss originated from the differential decoding, an improved DSTBC system is presented. In the proposed approach, data sequence after the hard decision is fed back and utilized for the channel estimation, and then the noise contained in the received signal is reduced using updated channel information before the differential decoding. Through computer simulations in fading channels assuming mobile applications, it is shown that the improved method could achieve better performance and shows higher tolerance to Doppler effect compared to conventional DSTBC.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132673614","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}
In this paper, we present a transceiver design for a broadband multiuser-MIMO communication system, where the co-channel users are equipped with multiple transmit and multiple receive antennas. In particular, we propose a joint coded two-step interference cancellation scheme which effectively combats the effect of co-channel interference (CCI) and inter-symbol interference (ISI) in multipath channels. To overcome the peak-to-average-power ratio limitation of multicarrier systems, the scheme employs single-carrier frequency-domain equalization (SC-FDE) based modulation combined with time-reversed space-time block codes (TR-STBC). The receiver performs minimum mean-squared error (MMSE) interference suppression at the first stage, and then, CCI cancellation is implemented with a bank of single-user channel decoders. Also, forward error correction outer convolutional encoding, and random bit interleaving are used to correct the carrier in deep fades. To verify the utility of the proposed approach, the paper also includes two sets of average symbol error rate simulations for two different channel models. The first set is for a frequency selective quasi-static fading channel while the secondset is for a Rayleigh fading channel modeled by a modified Jakes' model, both of which confirm the advantage of the proposed scheme.
{"title":"A Joint Coded Two-Step Interference Cancellation Technique for a Multiuser MIMO-SC-FDE System","authors":"Abdullah Aljohani, J. Chambers","doi":"10.1109/ICSNC.2008.59","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.59","url":null,"abstract":"In this paper, we present a transceiver design for a broadband multiuser-MIMO communication system, where the co-channel users are equipped with multiple transmit and multiple receive antennas. In particular, we propose a joint coded two-step interference cancellation scheme which effectively combats the effect of co-channel interference (CCI) and inter-symbol interference (ISI) in multipath channels. To overcome the peak-to-average-power ratio limitation of multicarrier systems, the scheme employs single-carrier frequency-domain equalization (SC-FDE) based modulation combined with time-reversed space-time block codes (TR-STBC). The receiver performs minimum mean-squared error (MMSE) interference suppression at the first stage, and then, CCI cancellation is implemented with a bank of single-user channel decoders. Also, forward error correction outer convolutional encoding, and random bit interleaving are used to correct the carrier in deep fades. To verify the utility of the proposed approach, the paper also includes two sets of average symbol error rate simulations for two different channel models. The first set is for a frequency selective quasi-static fading channel while the secondset is for a Rayleigh fading channel modeled by a modified Jakes' model, both of which confirm the advantage of the proposed scheme.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"188 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132281491","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}
Traffic grooming can be used in IP-over-WDM networks to efficiently utilize the bandwidth of wavelength channels. However, providing grooming capability to network nodes increases the network cost that operators must sustain when compared with a non-grooming network. In this paper a minimization cost heuristic approach is presented that seeks for the cheapest IP-over-WDM grooming network. This approach is manageable, allowing an easy study of large networks, and it is generic since it can be applied to OXCs with different switching granularities and/or number of ports. The proposed approach is able to reduce the network grooming cost by efficiently using the induced bandwidth that results from the OXC grooming granularity being coarser than the bandwidth granularity of IP LSP requests. Adaptive and non-adaptive weight functions, that determine the best grooming operation for an arriving IP LSP request, are also proposed and evaluated.
{"title":"A Minimization Cost Heuristic Approach for Traffic Grooming in IP-over-WDM Networks","authors":"N. Correia, J. Coimbra, M. Medeiros","doi":"10.1109/ICSNC.2008.32","DOIUrl":"https://doi.org/10.1109/ICSNC.2008.32","url":null,"abstract":"Traffic grooming can be used in IP-over-WDM networks to efficiently utilize the bandwidth of wavelength channels. However, providing grooming capability to network nodes increases the network cost that operators must sustain when compared with a non-grooming network. In this paper a minimization cost heuristic approach is presented that seeks for the cheapest IP-over-WDM grooming network. This approach is manageable, allowing an easy study of large networks, and it is generic since it can be applied to OXCs with different switching granularities and/or number of ports. The proposed approach is able to reduce the network grooming cost by efficiently using the induced bandwidth that results from the OXC grooming granularity being coarser than the bandwidth granularity of IP LSP requests. Adaptive and non-adaptive weight functions, that determine the best grooming operation for an arriving IP LSP request, are also proposed and evaluated.","PeriodicalId":105399,"journal":{"name":"2008 Third International Conference on Systems and Networks Communications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132850087","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：