{"title":"A low-voltage low-power X-band cascode down-conversion mixer for wideband communication","authors":"H. Bameri, M. Rahiminejad, A. Hakimi","doi":"10.1109/ISTEL.2014.7000690","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000690","url":null,"abstract":"In this paper, a new wide-band low-voltage low-power mixer is proposed. Using a modified stacked topology in conjunction with current bleeding technique, the mixer has a power consumption of 10mw while it uses a voltage supply of 1.2 V. Parallel peaking inductors are used to increase the RF frequency and broaden the bandwidth of the mixer. The 3-dB RF frequency band of the mixer is form 7GHz to 15GHz, which covers X-band completely, where its maximum power conversion gain is 10.6dB. The mixer has been simulated using 0.13μm CMOS technology model and results have been reported.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122598777","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":"Reducing the complexity of the linear programming decoding","authors":"H. Tavakoli","doi":"10.1109/ISTEL.2014.7000772","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000772","url":null,"abstract":"In this paper we show how the complexity of Linear Programming (LP) decoder can decrease. We use the degree 3 check equation to model all variation check degrees. The complexity of LP decoding is directed relative to the number of constraint. Number of constraint for original LP decoder is O(n2n). Our method decrease the number of the constraint to O(n).","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131377892","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}
Parvin Sharifara, Alireza Yari, Mohammad Mansour Riahi Kashani
{"title":"An evolutionary algorithmic based web service composition with quality of service","authors":"Parvin Sharifara, Alireza Yari, Mohammad Mansour Riahi Kashani","doi":"10.1109/ISTEL.2014.7000670","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000670","url":null,"abstract":"Quality of service is one of the most important factors in the design and composition of web services. In recent years number of web services has increased dramatically, resulting in similar services with similar functionality are available. So the quality of the services is a criteria which causes difference among similar functionality services. In addition, users considering their needs may require a combination of these services. Therefore, choosing the optimal composite web services has become a challenging and time consuming problem. In this paper, two aspects of this problem have been studied. First, the problem has been converted to a single-objective problem. In this state, to increase the speed, accuracy and reliability, we apply a combination of genetic algorithm, fuzzy logic and support services. Then the problem has been changed to a multi-objective problem and solved by multi-objective evolutionary algorithm, such as Non-dominated Sorting Genetic Algorithm (NSGA-II). Experiment result shows that the improved algorithm increases the speed when a large number of web services are available.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125292064","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 utility preserving data-oriented anonymization method based on data ordering","authors":"M. Salari, S. Jalili, Reza Mortazavi","doi":"10.1109/ISTEL.2014.7000842","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000842","url":null,"abstract":"Due to recent advances, data collection and publishing for scientific purposes are made by some organizations. Published data should be anonymized such that being useful while privacy of data respondents are preserved. So, there is a trade-off between data utility and privacy. Microaggregation is a popular family of anonymization methods that operates on numerical data. In this paper, we propose a microaggregation algorithm called NFPN_MHM that first sorts data in a spiral shape, next it finds a partitioning with the lowest utility loss with respect to the sorted data. Experimental results show that the proposed method attains lower information loss than traditional microaggregation methods and provides a better trade-off between data utility and privacy, especially for scattered data.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123091392","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 survey of pattern matching algorithm in intrusion detection system","authors":"Hossein Gharaee, Shokoufeh Seifi, Nima Monsefan","doi":"10.1109/ISTEL.2014.7000839","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000839","url":null,"abstract":"The most common method of IDS functioning is based on pattern matching which recognizes the vandalism occurring on the network using particular patterns and rules. In order to do so, normal behaviors of the network are modeled and then used as a base pattern for recognizing abnormal behavior of the network. The article, in hand, tries to recognize and choose the best algorithms for this operation by surveying, implementing and also collecting all kinds of pattern matching methods so that the best conclusion is reached during matching known attacks with main patterns. In this paper, to collect all algorithms related to the subject, we investigated the discussion of pattern compatibility operation from different aspects. Another aspect studied in this paper is to determine the indexes for grouping the algorithms, meaning the algorithms were classified based on important indexes which more effect on the performance of pattern compatibility operations.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130639323","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}
Maryam Miri Estahbanati, M. Rasti, Seyyed Mostafa Safavi Hamami
{"title":"A mobile ad hoc network routing based on energy and Markov chain trust","authors":"Maryam Miri Estahbanati, M. Rasti, Seyyed Mostafa Safavi Hamami","doi":"10.1109/ISTEL.2014.7000775","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000775","url":null,"abstract":"Transmission of data in infrastructureless mobile ad hoc network (MANET) is performed by cooperation among nodes which requires devising efficient routing schemes. When there is a possibility of non-cooperative and selfish behaviors of nodes in the network, in order to improve the performance, both trust and energy consumption associated with intermediate nodes should be jointly taken into account for devising routing schemes in MANET. This would improve the packet delivery ratio and quality of service (QoS). In this paper, trust of nodes is measured based on a hidden Markov model (HMM), and then we use it to devise a new routing scheme based on the Markov chain trust and available energy of nodes. Our proposed routing scheme is based on the highest level of trust and available energy of nodes. Via simulation, we demonstrate that our proposed algorithm results in improved QoS and packet delivery ratio in a MANET with possible selfish and non-cooperative users.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130767607","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 overview of cell association in heterogeneous network: Load balancing and interference management perspective","authors":"Maryam Chinipardaz, M. Rasti, M. Nourhosseini","doi":"10.1109/ISTEL.2014.7000895","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000895","url":null,"abstract":"Rapid growth in data traffic necessitates a proportional growth and improvement in the capacity of cellular networks. A heterogeneous network in which macro cells are overlaid with small cells is a cost efficient and effective paradigm shift for increasing the network traffic capacity. Unplanned deployment of low power base stations with divergent power levels introduces new challenges in heterogeneous network cell association problem, thus, requiring innovative cell association schemes. An efficient cell association scheme must consider balancing the load among different base stations while minimizing the interference at the same time. In this article we provide an overview of different load balancing and interference management schemes used in cellular networks. We would discuss the importance of each in heterogeneous network as well as cell association challenges involved, and give some ideas for handing those challenges.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357851","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}
Mehran Alidoost Nia, Reza Ebrahimi Atani, A. K. Haghi
{"title":"Ubiquitous IoT structure via homogeneous data type modelling","authors":"Mehran Alidoost Nia, Reza Ebrahimi Atani, A. K. Haghi","doi":"10.1109/ISTEL.2014.7000715","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000715","url":null,"abstract":"In this paper, the main idea is to establish IoT structure for ubiquitous communications. This structure has been made by data type modelling. Type modeling is useful to construct homogeneous computational pattern. A design cycle has been introduced here. This cycle is a wizard to cluster and insert computational nodes. For IoT intentions, data that should be transmitted to the higher protocol layer, must be processed at first. So computational nodes are responsible for these innetwork computations. The problem is response time and time wasting. The experimental results show that this problem can be eliminated by limited case scenario. The amount of transmitted data has been restricted by a higher bound. This type model is efficient and also reliable for ubiquitous communications. The result says that the same resources can be responsible for new computational demands according to the same type operations. In this way computational nodes can be accessible for all nodes.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132021262","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. Karami, R. Afrouzian, S. Kasaei, Hadi Seyedarabi
{"title":"Multiview 3D reconstruction based on vanishing points and homography","authors":"M. Karami, R. Afrouzian, S. Kasaei, Hadi Seyedarabi","doi":"10.1109/ISTEL.2014.7000730","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000730","url":null,"abstract":"3D reconstruction is one of the long lasting research topics in computer vision. It is the task of regenerating a model in three-dimensional (3D) space by images taken from the scene. An image-based method for 3D reconstruction based on intersection of planar visual hulls from projective images taken by multiview videos is proposed. Reconstruction can be performed without any further information related to camera calibration, feature extraction, and dense matching. This process computes the homography of reference plane along with one corresponding point off the reference plane, and vanishing points in all views. The 2D visual hulls along the object structure are generated. By stacking 2D visual hull slices, the 3D model of the object is obtained efficiently with least imposed constraints.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132041140","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 clustering scheme for resource allocation of OFDMA based cellular systems","authors":"Mohammad Reza Etemadi Nia, S. Ghorashi","doi":"10.1109/ISTEL.2014.7000879","DOIUrl":"https://doi.org/10.1109/ISTEL.2014.7000879","url":null,"abstract":"This paper presents a cluster based resource allocation scheme for allocating physical resource blocks (PRBs) in downlink of OFDMA based cellular systems. The proposed scheme includes two phases of clustering and sum rate maximization. In the first phase users are clustered by using an interference graph in a way that users in each cluster are allocated the same PRB. This interference graph helps users to avoid severe interference caused by neighbor cell base stations (BSs), since users that receive high interference from each other's serving BSs are not in the same cluster. In the second phase, the sum weighted rate of users in each cluster is calculated for all PRBs. These values shape the rate matrix. Then, by applying Hungarian algorithm to rate matrix, the optimal resource allocation that maximizes the sum rate of clusters is obtained. Furthermore, users are grouped into cell center users and cell edge ones according to their distance from the BSs. The transmission power levels of users are fixed in two levels, in which the higher level is for cell edge users. Simulation results show that our proposed scheme improves both the throughput of cell edge users and cell center users, compared with the other schemes.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"356 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132894242","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}