{"title":"LPKI - A lightweight public key Infrastructure for the mobile environments","authors":"Mohsen Toorani, A. Beheshti","doi":"10.1109/ICCS.2008.4737164","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737164","url":null,"abstract":"The non-repudiation as an essential requirement of many applications can be provided by the asymmetric key model. With the evolution of new applications such as mobile commerce, it is essential to provide secure and efficient solutions for the mobile environments. The traditional public key cryptography involves huge computational costs and is not so suitable for the resource-constrained platforms. The elliptic curve-based approaches as the newer solutions require certain considerations that are not taken into account in the traditional public key infrastructures. The main contribution of this paper is to introduce a Lightweight Public Key Infrastructure (LPKI) for the constrained platforms such as mobile phones. It takes advantages of elliptic curve cryptography and signcryption to decrease the computational costs and communication overheads, and adapting to the constraints. All the computational costs of required validations can be eliminated from end-entities by introduction of a validation authority to the introduced infrastructure and delegating validations to such a component. LPKI is so suitable for mobile environments and for applications such as mobile commerce where the security is the great concern.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125436908","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":"Large-scale IP traffic matrix estimation based on simulated annealing","authors":"Dingde Jiang, Guangmin Hu","doi":"10.1109/ICCS.2008.4737242","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737242","url":null,"abstract":"Traffic matrix (TM) is constructed by all origin-destination (OD) pairs (or flows) in a network, which describes the characteristics of IP networks from the global aspects. Though TM estimation is well-studied, TM is generally unavailable in a large-scale IP network and is difficult to be estimated accurately. This paper proposes a novel method of large-scale IP TM estimation, based on simulated annealing, termed the Simulated Annealing and Iterative Proportional Fitting Procedure (SAIPFP) method. Firstly, based on conventional simulated annealing, we propose a modified simulated annealing method, which considers sufficiently spatial-temporal correlations of OD flows and is combined with partial flow measurement. By the modified method, we can attain good estimations of TM. Secondly, combined with iterative proportional fitting procedure, the more accurate estimations are attained. Finally, we use the real data from the Abilene network to validate our method. The results show that our method can perform quickly the accurate estimation of large-scale IP TM, and track well its dynamics.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130101859","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}
Suhua Tang, Jun Cheng, Chen Sun, R. Suzuki, S. Obana
{"title":"Turbo network coding for efficient and reliable relay","authors":"Suhua Tang, Jun Cheng, Chen Sun, R. Suzuki, S. Obana","doi":"10.1109/ICCS.2008.4737453","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737453","url":null,"abstract":"A turbo network coding based relay model and its decoding method are proposed for the quasi-static fading multi-access up-link channel. In the model a relay assists two mobile nodes simultaneously by forwarding a network coded version of the two interleaved messages. Access Point (AP) performs joint channel and network decoding with signals received from two mobile nodes and the relay. Compared with existing schemes, the proposed turbo network coding scheme has two main contributions: (i) Only parity check bits of two messages are forwarded by relay and they are further XORed together to improve relay efficiency. (ii) The iterative decoding is used in joint network and channel decoding to salvage packets from erroneous signals in the absence of a priori knowledge. Simulation results indicate that the proposed scheme provides up to 1.8 dB gain to the existing scheme in the case of mutual cooperation among mobile nodes.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130176576","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}
Xiang Chen, Zesong Fei, Jingming Kuang, Linnan Liu, Guang-Hua Yang
{"title":"A scheme of multi-user reusing one slot on enhancing capacity of GSM/EDGE networks","authors":"Xiang Chen, Zesong Fei, Jingming Kuang, Linnan Liu, Guang-Hua Yang","doi":"10.1109/ICCS.2008.4737448","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737448","url":null,"abstract":"GSM network is seeing its greatest expansion because of the growing demand for mobile voice services in emerging markets recently. A newly proposed technology, multiuser reusing one slot (MUROS), would help operators in densely populated cities to alleviate the strain on their networks. The concept of MUROS is based on multiplexing two or more users onto one time slot without degrading the speech quality. We improved one solution of MUROS, orthogonal sub channel (OSC) in this contribution. For the downlink (DL) OSC, we designed new training sequence codes (TSCs) which are low cross-correlated with legacy TSCs. For the uplink (UL) OSC, we adopted successive interference cancellation based on minimum mean square error (MMSE-SIC) algorithm. Theoretical analysis and simulation results shows that with proper TSC design, OSC is a promising scheme of MUROS due to its ability to double the capacity of GSM/EDGE networks without degrading the speech quality very much.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129650801","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 approach to service integration in the OSGi architecture of home networks","authors":"Lu Yiqin, Yuan Yao, Sun Yingkai, Yang Xiaodong","doi":"10.1109/ICCS.2008.4737286","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737286","url":null,"abstract":"The Open Services Gateway initiative (OSGi) specification defines a service-oriented framework to allow service applications in a network device to interoperate with each other by sharing resources and to be managed remotely. It is widely applied in home network, car network, etc. However, the mechanism of OSGi services operation is performed in a centralized fashion, which means services published in a local framework are unavailable for other remote frameworks and vice versa. In a word, distributed OSGi services can¿t be shared. To solve this problem, Jini, another java technology for building service-oriented architectures, is employed as a bridge for the connection of distributed OSGi services. A Jini service called `Jini-Bridge¿ is defined. When it is published in an additional OSGi bundle, distributed OSGi users can get remote services, and can publish services not only in local framework but also in remote frameworks. All services in distributed frameworks are shared without any more planning, installation, or human intervention.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124609974","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":"Carrier frequency offset estimation using hidden pilots for MC-DS-CDMA systems","authors":"Licheng Liu, X. Dai","doi":"10.1109/ICCS.2008.4737141","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737141","url":null,"abstract":"This paper develops a new hidden pilots based algorithm for the carrier frequency offset (CFO) estimation of multicarrier DS-CDMA (MC-DS-CDMA) systems. Multiple CFO of different users in the uplink of MC-DS-CDMA systems may violate the orthogonality among subcarriers and induce both inter-carrier interference (ICI) and inter-user interference (IUI). This algorithm utilizes mutually orthogonal hidden pilots for each user and implements fast Fourier transform (FFT) to the received signal matrix after the average operation on its column vectors, so the interference including the IUI caused by users¿ data symbols are greatly depressed and CFOs can be estimated with the performance close to the conventional pilot-based CFO estimator without the requirement of extra transmission bandwidth. The simulation results verify the effectiveness of the proposed approach with CFOs in the fine tracking phase and the slowly time-varying flat-fading channels.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131313447","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 group of modulation schemes for adaptive modulation","authors":"A. T. Le, K. Araki","doi":"10.1109/ICCS.2008.4737309","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737309","url":null,"abstract":"Adaptive modulation increases the throughput of a wireless network by adjusting the modulation scheme to the channel status. To have more capacity and more flexibility in using adaptive modulation, our research attempts to find a group of modulation schemes, which includes M-QAM where the number of signal points is not a power of 2, as well as non-squared QAM (or APSK: amplitude and phase-shift keying), so we can have n-bit modulation where n ranges fully from 1 to 6 including half-integer indices. Some recent research has shown that the gap between QPSK and 16-QAM, 16-QAM and 32-QAM, 32-QAM and 64-QAM can be filled smoothly by introducing 12-QAM, 24-QAM and 48-QAM. But the gap between QPSK (4-QAM) and 12-QAM is still an open problem. In this paper we insert 8-ary modulation schemes, and propose 6-ary modulation schemes. Simulation results show that our proposed group can fill smoothly the gap between QPSK and 12-QAM.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130187823","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":"New memory-efficient hardware architecture of 2-D dual-mode lifting-based discrete wavelet transform for JPEG2000","authors":"Chih-Hsien Hsia, Jen-Shiun Chiang","doi":"10.1109/ICCS.2008.4737288","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737288","url":null,"abstract":"This work presents new algorithms and hardware architectures to improve the critical issues of the 2-D dual-mode (supporting 5/3 lossless and 9/7 lossy coding) lifting-based discrete wavelet transform (LDWT). The proposed 2-D dual-mode LDWT architecture has the advantages of low-transpose memory, low latency, and regular signal flow, which is suitable for VLSI implementation. The transpose memory requirement of the N × N 2-D 5/3 mode LDWT is 2N, and that of 2-D 9/7 mode LDWT is 4N. According to the comparison results, the proposed hardware architecture surpasses previous architectures in the aspects of lifting-based low-transpose memory size. It can be applied to real-time visual operations such as JPEG2000, MPEG-4 still texture object decoding, and wavelet-based scalable video coding.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127280878","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 nature-inspired algorithm for intelligent optimization of network resources","authors":"Xiang Feng, F. Lau, D. Shuai","doi":"10.1109/ICCS.2008.4737189","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737189","url":null,"abstract":"In complex computer networks having the characteristic of social dynamics, bandwidth allocation is a fundamental problem where bandwidth has to be reserved for connections in advance. This paper presents the theory and approach of the economic generalized particle model (EGPM) for intelligent allocation of network bandwidth. This approach transforms the complicated network bandwidth allocation problem into efficient, parallel allocation of network bandwidth. This approach is an important extension and further development of the generalized particle model (GPM) [1]. EGPM emphasizes the use of pricing as the network control mechanism. For the pricing, it makes use of the tatonnement process in economics. EGPM arises from GPM but can overcome some of GPM¿s deficiencies for the network bandwidth allocation problem.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"317 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115869336","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":"Bandwidth efficient cooperative diversity scheme based on relaying superposition symbols","authors":"Mingwei Cao, G. Bi, Xiufeng Jin","doi":"10.1109/ICCS.2008.4737383","DOIUrl":"https://doi.org/10.1109/ICCS.2008.4737383","url":null,"abstract":"A bandwidth efficient three-user cooperative diversity scheme based on relaying superposition symbols is proposed. Each user has two partners and each partner relays superposition symbols of the other two users instead of repetition. Thus, the bandwidth efficiency is improved compared to the baseline decode-and-forward cooperative diversity scheme in which each user retransmits its partner¿s information by employing repetition coding. The proposed scheme can also offer diversity order of two. Then, a new constellation labeling for the superposition 8PSK modulation to exploit the symbol mapping diversity is designed and it is a simple way to obtain a gain of about 2 dB.","PeriodicalId":208126,"journal":{"name":"2008 11th IEEE Singapore International Conference on Communication Systems","volume":"55 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120853050","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}