in the name of god - ist2018.itrc.ac.irist2018.itrc.ac.ir/sites/default/files/book of...

In The Name of God

Book of Abstracts

27th – 28th Sept. 2016

ICT Research Institute

Table of Contents

Welcoming Message from General Chairman ....................................................................................................... 1

Message from Technical Committee Chair and Organizing Committee Chair .............................................. 2-4

Organizing Committee .................................................................................................................................................. 5

National Technical Program Committee ................................................................................................................ 6-7

International Technical Program Committee ....................................................................................................... 8-10

Ad hoc and Sensor Networks .................................................................................... 11-14

Optical Communications: Components and Networks ............................................. 15-19

Cognitive Networks ................................................................................................... 21-25

Information Security........................................................................................................ 27

Information Security (1) .......................................................................................................................... 29-31

Information Security (2) .......................................................................................................................... 32-35

Information Security (3) ........................................................................................................................... 36-38

Information Security - Poster Session .......................................................................................................... 39

Big Data....................................................................................................................... 41-44

Big Data- Poster Session ........................................................................................................................... 45-46

Satellite and Space Communications & Wireless Communications ............................... 47

Satellite and Space Communications & Wireless Communications (1) ........................................... 49-51




Satellite and Space Communications & Wireless Communications (5) ........................................62-64

Satellite and Space Communications & Wireless Communications- Poster Session........................ 65

Table of Contents

Wireless Networks...................................................................................................... 67-71

Antennas and Propagation.............................................................................................. 73

Antennas and Propagation (1)................................................................................................................. 75-76

Antennas and Propagation (2) ................................................................................................................ 77-79

Antennas and Propagation (3)................................................................................................................. 80-83

Antennas and Propagation- Poster Session........................................................................................... 84-85

Signal Processing in Communications ............................................................................. 87

Signal Processing in Communications (1) .............................................................................................. 89-91



Signal Processing in Communications - Poster Session .......................................................................... 97

Software Defined Networks ..................................................................................... 99-102

Social Networks ..................................................................................................... 103-106

Social Networks- Poster Session.................................................................................................................. 107

Microwave, Millimeter Wave and Terahertz Wireless Components ................... 109-113

Microwave, Millimeter Wave and Terahertz Wireless Components- Poster Session ...................... 114

ICT Development Strategies and Regulatory & Internet of Things ...................... 115-120 Internet Related Technologies and Communication Services

ICT Development Strategies and Regulatory & Internet of Things ............................................121-122

Internet Related Technologies and Communication Services- Poster Session

Cloud Networks & Communications...................................................................... 123-127

Network Science and Technologies ....................................................................... 129-132

Network Science and Technologies- Poster Session................................................................................ 133

Table of Contents

Communications for Smart Grids & Smart Computing......................................... 135-138

System and Networks Security .....................................................................................139

System and Networks Security (1).....................................................................................................141-143

System and Networks Security (2).....................................................................................................144-145

System and Networks Security- Poster Session ....................................................................................... 146

Communications Software, Services and Multimedia Applications .................... 147-152

Broadband Networks- Poster Session.. ................................................................. 153-155

Author Index.. .............................................................................................................................................................. 157

Referee........................................................................................................................................................................... 187

1

Welcoming Message from General Chairman of the 8th

International Symposium on Telecommunications (IST2016)

On behalf of the Ministry of Information & Communications Technology and its

research arm, ICT Research Institute (Formerly known as Iran Telecommunication Research Center, ITRC), it is my great pleasure to welcome you the dear audience to

Iran’s capital, Tehran, which is launching this prestigious symposium which is the

eight since the 1st IST in 2001.

For the sake of your knowledge, the 7th symposium was also held in ITRC with a

renewed ambition and determination to foster a broader exchange and enhanced

interactions than previous ISTs between the university students and researchers as well

as specialists and scholars from other scientific institutions and telecom industries,

with peers from oversees who will often a great opportunity to present and showcase

their latest achievements in the ICT sphere of activities. Due to the successes gained

within this performance, ITRC was persuaded to perform once again this bi-annual

event, this time with a special emphasis on information & communication technology

as well as cyberspace research aspects and their role in promoting the performance of

communication networks & systems.

Hereby, I am quite pleased to offer special welcome to our respectable guests from

overseas countries specially those delivering keynote speeches and holding workshops. I very much hope that IST2016 will once again prove itself as a truly international

symposium consolidating its good reputation garnered over these years with the aid of

its dedicated technical (both national & international) and organizing committees who

have done their best to provide a suitable platform for the esteemed participants from

both our country and abroad.

Mohammad Khansari

General Chairman

2

Message from Technical Committee Chair and Organizing Committee Chair of

the 8th International Symposium on Telecommunications

Thank God, the Merciful the Compassionate; we are honored for the opportunity to

launch the 8th International Symposium on Telecommunication IST2016, a highly prestigious bi-annual event that fosters enhancement of telecommunication and

information technologies in Iran.

The three-day IST Symposium provides unique platform for distinguished researchers,

scholars and experts to participate and have exchanges with their international peers,

share the latest accomplishments with fellow attendees to disseminate the knowledge

gained from their technical endeavors.

The symposium is also the focal point for attendees to assimilate emerging

technological standards and to follow world trend in the growth and development of

ICT and related new policies.

It is our belief that holding such a forum should be viewed as the essence of scientific,

cultural and economical development in this country and it is therefore imperative for

all concerned to inspire and encourage technically minded enthusiasts and other

interested scholars to pursue further research initiatives into practical applications of

this highly promising technology and to try to explore and exploit its advantages to the

fullest possible level. This event certainly can and will provide a conducive medium for formulating

strategies to direct research & development activities in the academia and industry.

It is obvious, however, that this goal can only be achieved through well-structured

collaboration and interaction between the academia, industry as well as other scientific

centers of excellence on a regional and international basis. And given the

determination of its IST organizers a great stride is being made to accomplish most if

not all of the objectives.

There are already indications that the combined effort is paying off which is a

substantial boost to the aspiration of the dedicated organizers of the event whom are

making every endeavor towards attaining that goal.

The organizers are immensely pleased with the fact that their call for papers were well

received across Iran and beyond the borders, judging by the tremendous number of

papers and other contributions including workshop proposals and keynote addresses

submitted by distinguished scholars. Received submissions exceeded well over 410 papers as well as 35 workshop proposals from more than 10 countries. This volume of

proposals entailed holding five Technical Program Committee meetings, attended by

30 scientists and experts from the academia and industry to review and assess for final

decision.

Recognizing the significance of this phase of the whole event, the symposium also

tapped into expertise from many institutes of higher education for their scientific

3

advises, thus further enhancing the profile of IST2016 as a technical event not only in

Iran but at the regional and global levels.

Table I. Status of Received Papers

Topics of the Symposium Accepted

Paper

Received

Papers

Ad hoc and Sensor Networks 4 11

Antennas and Propagation 19 61

Big Data 6 11

Broadband Networks 1 4

Cloud Networks & Communications 5 9

Cognitive Networks 6 21

Communications for Smart Grids 1 4

Communications Software, Services and Multimedia

Applications

6 9

Green Communications 1 1

ICT Development Strategies and Regulatory 3 7

Information Security 18 31

Internet of Things 1 9

Internet Related Technologies and Communication Services 4 11

Microwave, Millimeter Wave and Terahertz Wireless

Components

7 23

Network Science and Technologies 5 9

Optical Communications Components and Networks 5 15

Satellite and Space Communications 1 3

Signal Processing in Communications 16 33

Smart Computing 2 8

Social Networks 6 8

Software Defined Networks 3 6

System and Networks Security 11 16

Wireless Communications 31 81

Wireless Networks 5 19

Final 167 410

To manage the incredible task of processing each and everyone of these submissions within the confine of the deadlines, which had to be extended due to overwhelming

interest of authors in IST especially from abroad, the papers were categorized into 24

fields with every paper receiving up to four reviews before a final decision by the

Technical Program Committee for presentation in either regular session or postal

session or as a keynote address.

Table II. Status of Received Workshops Number. of workshop proposals received 37

Number. of accepted workshops 5

4

Finally, we are indebted to our 8 th IST technical committee, executive committee, all

reviewers for their valued contributions and advices, without the whole-hearted

support of whom the Symposium would not have had much hope of succeeding.

Thanks are also due to the secretariat team members for their assistance who gave their

bests in order to organize and manage the IST symposium successfully. We hope that our collective efforts stimulate further progress in this sphere of activity

with strengthened determination at national and international levels.

Mahmoud Kamarei

Technical Program Committee Chair

Ahmad KhademZadeh

Organizing Committee Chair

5

Organizing Committee

M.Vaezi Honorary Chairman / Minister of ICT

M. Khansari General Chairman

K. Badie Symposium Chair

M. Kamarei Technical Program Committee Chair

A. R. Sharafat

A. Khademzadeh Organizing Committee Chair

S. AbbasiShahkouh

L. Mohammadi International Liaison

M. Sh. Moin Publications

M. Khaleghi

M. Kharrat Workshops & Tutorials

A.R. Yari Industry and University Liaison

A. Ghane Logistics & Financial Supports

F. Ebrahimi Publicity Relations

V. Ghorbani

M. Naghian Information Services

N. Parsa Secretariat Officers

M. B. Fakhar

Sh. Tavasoli

T. Sarhangi

F. S. Tahavi

Sh. Mirzaei

Staff

6

National Technical Program Committee

Sadegh Abbasi Shahkouh Communications Regulatory Authority of The I. R. of

Iran

Hamid Abrishami Moghaddam K. N. Toosi University of Technology

Hassan Aghaeinia Amir Kabir University of Technology

Ali Aghagolzadeh University of Babol

Seyed Mohammad Ahadi AmirKabir University of Technology

Aliasghar Amidian Ministry of ICT

Mohammad Reza Aref Sharif University of Technology

Abbas Asosheh Tarbiat Modarres University

Kambiz Badie ICT Research Institute

Abolfazl Falahati Iran University of Science & Technology

Reza Faraji Dana Tehran University

Mehdi Fasanghari ICT Research Institute

Hossein Gharaie ICT Research Institute

Hassan Ghassemian Tarbiat Modarres University

Jamaleddin Golestani Sharif University of Technology

Farrokh Hodjat Kashani Iran University of Science & Technology

Mohammad Mehdi Homayounpour AmirKabir University of Technology

Babak Hossein Khalaj Sharif University of Technology

Nasrollah Jahangard ICT Research Institute

Mahmoud Kamarei University of Tehran

Ahmad Khademzadeh ICT Research Institute

Mahmoud Khaleghi ICT Research Institute

Mohammad Khansari ICT Research Institute

Mahmoud Kharrat ICT Research Institute

Farrokh Marvasti Sharif University of Technology

Kamal Mohamedpour K. N. Toosi University of Technology

7

National Technical Program Committee

Abbas Mohammadi AmirKabir University of Technology

Leila Mohammadi ICT Research Institute

Mohammad -Shahram Moin ICT Research Institute

Masoumeh Nasiri Kenari Sharif University of Technology

Keyvan Navi Shahid Beheshti University

S. Majid Noorhosseini AmirKabir University of Technology

Narges Noori ICT Research Institute

Homayoon Oraizi Iran University of Science & Technology

Mohammad Reza Pakravan Sharif University of Technology

Hossein Pedram AmirKabir University of Technology

Hamid Reza Rabiee Sharif University of Technology

Seyyed Mohammad Razavizadeh Iran University of Science & Technology

Nasser Rezaee Tehran University

Masoud Sabaei AmirKabir University of Technology

Mostafa Safavi Hemami AmirKabir University of Technology

Ahmad Salahi ICT Research Institute

Javad Salehi Sharif University of Technology

Mahmoud Shahabadi Tehran University

Ahmad Reza Sharafat Tarbiat Modarres University

Amir Ahmad Shishehgar Sharif University of Technology

Vahid Tabataba Vakili Iran University of Science & Technology

Mohammad Hesam Taddayon ICT Research Institute

Fattaneh Taghiyareh Tehran University

Alireza Yari ICT Research Institute

Hossein Zamiri Ferdowsi University of Mashhad

Farzad Zargari Asl ICT Research Institute

Abolghasem Zeidabadi Nezhad Isfahan University of Technology

8

International Technical Program Committee

Behnam Aazang RiceUniversity, Houston, TX, USA

Mohammad Abtahi Laval University, Canada

Shahram Afshar Vahid The University of Adelaide, Australia

Saleh Al-Araji Estisalat University College, Sharjah, UAE

Mohammad Reza Asharif University of the Ryukyus, Okinawa, Japapn

Mohsen Beheshti California State University, USA

Mohammad Reza Beikzadeh Multimedia University (Cyberjaya), Malaysia

Abderrahim Benslimane University of Avignon, France

Nevio Benvenuto University of Padova, Italy

Jean-Pierre Bienaime UMTS Forum, France

Rainer Bruk University of Siegen, Germany

Augusto Casaca Instituto Superior Tecnico in Lisbon, Portugal

Ernesto Damiani University of Milano, Italy

Mahmoud Daneshmand Stevens Institute of Technology, USA

Mohammad Taghi Fatehi Formerly, Lucent Technologies, USA

Luigi Fratta Politecnico di Milano, Italy

Roland Friedrich University of Applied Sciences, Bielefeld, Germany

Saeed Gazor Queen’s University, Canada

Mohammad Ghanbari University of Essex, UK

Fary Z. Ghassemlooy University of Northumbria, Newcastle, UK

Donald Gillies Imperial College London, UK

Roch Glitho Concordia University & Ericsson Research Labs, Canada

Fabrice Guillemin France Telecom R & D, France

Babak Hasibi California Institute of Technology, CA, USA

Yo-Sung Ho Gwangju Institute of Science and Technology, Korea

Villy Beak Iversen Technical University of Denmark, Denmark

Calors Juiz University de les Illes Balears, Spain

9


Mostafa Kaveh University of Minnesota, USA

Mohsen Kavehrad Pennsylvania State University, USA

Gerhard Kramer Technical University of Munich, Germany

Karim Khakzar University of Applied Sciences, fulda, Germany

Amir Khandani University of Waterloo, Canada

Ahmad Khanifar Telecom Technologies (USA) Ltd., California, USA

Angel Lozano Pompeu Fabra University, Barcelona, Spain

Mohammad Madihian NEC Corporation of America, USA

Igor Minin Nivosibirsk State Technical University Russian

Federation, Russia

Dariush Mirshekar University of Essex, UK

Werner Mohr Siemens, Germany

Hussein Mouftah University of Ottawa, Canada

Kaveh Pahlavan Worcester Polytechnic Institute, USA

Andreas Pitsillides University of Cyprus, Cyprus

Guy Pujolle Paris 6 University, France

Herman Rohling Technical University of Hamburg, Germany

Safieddin Safavi-Naeini University of Waterloo, Canada

Bulent Sankur Bogazici University, Turkey

Matilde Pilar Sanchez

Fernandez

Universidad Carlos III de Madrid (UC3M), Spain

Kamal Sarabandi University of Michigan, USA

Wee Ser Nanyang Technological University, Singapore

Bartomeu Serra University de les Illes Balears, Spain

Rahim Tafazolli University of Surrey, UK

Shahrokh Valaee University of Toronto, Canada

Mihaela Vander Schaar University of California, Los Angeles, USA

10


Lorenzo Vangelista University of Padova, Italy

Abbas Yongacoglu University of Ottawa, Canada

Damir Zrno Uiversity of Zagreb, Croatia, EU

11

Ad hoc and Sensor Networks

13

Ad-hoc and Sensor Network

Distributed Area Coverage in Mobile Directional Sensor Networks

Marzieh Varposhti

Azad University of Boroujen, Iran

Peyman Saleh, Shahryar Afzal, Mehdi Dehghan

Amirkabir University of Technology, Tehran, Iran

Abstract One of the fundamental problems in wireless sensor networks is providing area coverage to fulfill a certain task. This problem in directional sensor networks is more challenging because of limited sensing angle of directional sensors. This paper addresses the problem of deployment and orientation of a specific number of directional sensor nodes in order to maximize the area coverage. First, we present an optimization model for this problem. Then, we propose a distributed payoff based learning algorithm in which each sensor tries to maximize its own coverage relative to the coverage of its neighbors by relocating toward uncovered positions and selecting an appropriate working direction. Simulation results demonstrate the performance of proposed algorithm. Keywords- area coverage; mobile sensor networks; learning algorithm.

A Low-Power Smart Temperature Sensor for Passive UHF RFID Tags and Sensor Nets Mohammad Reza Ghaderi Karkani, Mahmud Kamarei

University of Tehran, Tehran, Iran

Ali Fotowat Ahmady Sharif University of Technology, Tehran, Iran

Abstract A low-power wide-range CMOS temperature sensor architecture is proposed for RFID and Sensor Networks based on temperature-to-frequency conversion using supply voltage controlled sub-threshold ring oscillator. The principles of operation are investigated and proved via simulation results. Most errors are canceled out by this ratio-metric design. An inaccuracy of -0.84°C to +0.34°C occurs over a range of -40°C to 80°C after using a novel in-field digital two-point calibration. The entire sensor consumes less than 93nW to 305nW over the temperature range and can be digitally reconfigured for setting sample rate and resolution in a tradeoff. Keywords—CMOS temperature sensor, temperature-to-frequency, low-cost calibration,

wireless sensing, RFID tags.

14

A Game Theoretic Approach to Joint Resource Management in Wireless Ad hoc Networks Moein Aliaskari, Ali Shahzadi

Islamic Azad Universit, Tehran, Iran

Abstract Wireless Ad hoc network consists a set of mobile or immobile nodes. This network provides wireless services for different nodes without any fixed infrastructure. Quick and economical deployment of ad hoc networks yields its well desirability for different applications. One of the most significant issue in resource management of wireless ad hoc networks is power control. It should be done in a rational way to alleviate interference across the network. Efficient power control saves the batteries as well as guaranteeing a minimum level for SINR to satisfy QOS requirements of all nodes. In this work we propose a new approach based on game theory to change rate, modulation and power in the game algorithm. All users are satisfied of incorporating the game rules. Selfishness of autonomous users are bounded consequently under this framework. It implies the game reaches to the desired point called Nash equilibrium point. Through various numerical results, we show that all users have a tradeoff between benefit maximization and transmission power minimization, considering rate and modulation in their strategies.

Keywords- game theory; joint resource management; non-cooperative game; wireless ad hoc networks; nash equilibrium point.

Data Forwarding Scheme to Minimize End-to-End Delay in Opportunistic Networks Narges Arastouie, Masoud Sabaei


Abstract Opportunistic network can help in situations where network connectivity is sparse or with large variations in density, or even when there is no end-to-end connectivity by providing a communication solution for non-real-time applications. Unstable and fluctuate end-to-end path is let to have a significant challenge in routing messages. Uneven nodes’ meeting can transmit the message to reach ultimate destination through the network without ever having an end-to-end connection. To cope with these conditions, optimal route in certain time window where the data is useful is very important. Making the best decision under nondeterministic and typically human-based environment, the undefined connection and meeting nodes, is our contribution in this paper. To our best knowledge, optimize stochastic model for routing message to gain the suitable delivery delay is the first time that the problem is addressed and it can be a valuable criterion to compare all previous models. Keywords—Multi-stage stochastic programming; opportunistic network; delay ratio;

15

Optical Communications:

Components and Networks

17

Optical Communications: Components and Networks

Spectrum-Usage-Aware Resource Allocation and Multicast Routing in Elastic Optical Networks

Mehrdad Moharrami

University of Michigan, Ann Arbor, USA

Hamzeh Beyranvand


Ahmad Fallahpour, Jawad Salehi

Sharif University of Technology, Tehran, Iran

Abstract In this paper, dynamic resource allocation and multicast routing algorithms are proposed for elastic optical networks (EONs). The proposed algorithms find the shortest path trees by modeling either the amount of free spectrum in each link or the link length as the cost function of routing method. The proposed algorithms are simulated in the dynamic operation scenario over the so called US Backbone topology. Simulation results reveal that by considering the cost function of routing algorithm based on the available spectrum in each link will improve the blocking probability while reduce the spectrum efficiency. On the other hand, by considering link length as the cost function, the blocking probability get worsen whereas the bandwidth efficiency is improved. Consequently, in order to compromise the benefits of both algorithms, we consider a mixed cost function based on the normalized cost function of each method and employing a weighting coefficient to trad-off between blocking probability and spectrum efficiency. Index Terms—Elastic Optical Networks (EONs), Multicast Routing and Spectrum Assignment (MRSA), Dynamic Resource allocation, Multicast Traffic.

Efficient Integration of Switching Mechanisms in All -Optical Networks

Lida Ghaemi Dizaji, Akbar Ghaffarpour Rahbar

Sahand University of Technology, Sahand New Town, Tabriz, Iran

Abstract

Hybrid optical networks (HONs) are the combination of different switching mechanisms such as Optical Circuit Switching (OCS), Optical Burst Switching (OBS) and Optical Packet Switching (OPS). The basic idea behind HONs is to integrate the advantages of different switching mechanisms. HONs are classified into three classes as: (1) parallel hybrid optical networks, (2) integrated hybrid optical networks, (3) client-server hybrid optical networks. In this article, we describe these classes in detail and a new integrated hybrid optical network called EISM (Efficient Integration of Switching Mechanisms in all-optical networks) is introduced. The proposed EISM method could perform optimally while considering some implementation criteria; such criteria include network bandwidth utilization, implementation complexity and also the domain of network performance by combining four switching mechanisms- OCS, long-OBS, short-OBS and OPS. Keywords— hybrid optical networks; OBS; OPS; OCS; EISM

18

Improved Routing and Spectrum Assignment Formulations for Optical OFDM Networks Mohammad Hadi, Mohammad Reza Pakravan


Abstract

Efficient resource allocation in OFDM-based optical networks is directly affected by definition and formulations of Routing and Spectrum Assignment (RSA) problem. In this paper, we propose new Binary Linear Programming (BLP) formulations for the RSA problem that provide more efficient resource allocation in comparison with previous formulations. Unlike the conventional formulations that mainly aim at minimizing used spectrum slots, our formulations simultaneously aim at defragmentation and minimization of the assigned spectrum slots. We show contiguity constraint of the conventional formulations may incorrectly make a feasible solution unattainable. To solve this problem, we remove the contiguity constraint and embed its effect as a penalty term in the goal function. Two performance metrics for evaluating the amount of contiguity and defragmentation in a typical network are also defined. Simulation results show that the new formulations provide a considerable improvement in the performance of the RSA process in terms of the amount of contiguity and defragmentation with respect to the previous formulations. Index Terms—Routing and Spectrum Assignment, Binary Linear Programming, Contiguity Constraint, Defragmentation,Continuity Constraint

BER Performance of OFDM-Based Wireless Services Over Radio-on-FSO Links in the Presence of Turbulence and Pointing Errors

Mohammad Taghi Dabiri, Mohammad Javad Saber, Seyed Mohammad Sajad Sadough

Shahid Beheshti University G. C., Tehran, Iran

Abstract Recently the transmission of multiple radio frequency (RF) signals over fiber link, referred to as radio over fiber (RoF), has achieved a great deal of research interest. In case where deployment of optical fiber is not feasible, the new generation of free-space optical (FSO) systems can be used to transmit RF signals, that is referred to as radio over FSO (RoFSO). In this paper, we study the BER performance of a RoFSO system based on orthogonal frequency-division multiplexing (OFDM) scheme with quadrature amplitude modulation (QAM) when the optical beam is experiences the FSO link is affected by gamma-gamma atmospheric turbulence and misalignment errors (pointing errors). We derive a novel closedform BER of the RoFSO M-QAM OFDM system, when both atmospheric turbulence and pointing errors.

19

Best Fit (BF): A New Spectrum Allocation Mechanism in Elastic Optical

Networks (EONs)

Forough Shirin Abkenar, Akbar Ghaffarpour Rahbar

Sahand University of Technology, Tabriz, Iran

Amin Ebrahimzadeh

Optical Zeitgeist Lab, Institut National de la Recherche Scientifique (INRS), Montreal, Canada

Abstract

Routing and spectrum allocation (RSA) is known as a key challenge in elastic optical networks (EON). Specifically, RSA process is categorized as (i) without adjusting modulation format (simply referred to as RSA), and (ii) with adjusting modulation format (referred as routing, modulation level and spectrum allocation (RMSA)). This paper focuses on the former, that is RSA problem which is basically subdivided into two subproblems, (i) routing subproblem, and (ii) spectrum allocation. Up until now, various routing algorithms and different spectrum allocation mechanisms have been introduced by the research community. Nevertheless, we have proposed a new SA mechanism referred to as best fit (BF) with the aim of reducing the blocking rate by means of efficiently assigning the network resources. In particular, the proposed BF tries to assign a slot block (SB) to each connection such that the difference between the SB length and connection length becomes minimum. In order to further improve the performance of the BF, we have developed an optimization framework called optimized BF (Opt BF). Numerical results confirm the fact that the proposed BF outperforms the conventional mechanisms in terms of blocking probability. Moreover, it is verified that the Opt BF successfully alleviates the blocking probability even more, and assigns the networks resources efficiently.

21

Cognitive Networks

23

Cognitive Networks

Sum Throughput Maximization for Downlink MIMO-OFDMA Based Cognitive Radio Networks in Spectrum Overlay Model Mahla Mohammadi, Seyed Mehdi Hosseini Andargoli

Babol Noshirvani University of Technology, Babol, Iran

Abstract In this paper, the resource allocation for MIMO-OFDMA based cognitive radio (CR) network subject to primary user’s (PU)’s constraints is considered. The optimal resource allocation strategy is proposed subject to the total power constraint in the cognitive base station (CBS) and the interference power constraint on the primary users. To this aim, two sub-problems are presented and solved theoretically based on convex optimization framework that can be used in the main body of the proposed algorithm. So, in order to find the optimum solution, our algorithm consists of three sections which are included these sub-problems. Simulation results show that the proposed algorithm achieves better performance in comparison with a benchmark algorithm and converges to sub-problem solutions in high and low regime of interference thresholds. Keywords—Cognitive Radio; MIMO-OFDMA; Resource allocation; Convex optimization; SVD.

Secure Multiple Antennas Spectrum Sensing Under Continuous Attacking Traffic

Ali Karimi, Abbas Taherpour, Zahra Pourghrehkhan

Imam Khomeini International University, Qazvin,

Abstract

Spectrum modeling represents an important tool, of the cognitive radio concept. An accurate spectrum sensing scheme can improve spectrum efficiency, but in practical perspective, reliability of spectrum sensing can be degraded by various factors. Primary user emulation attack (PUEA) is one of the common factors that some of the CRs or some of users outside of network try to emulate the transmission of the Primary User (PU). In this paper, the effect of the malicious users and the PU traffic on the performance of the cognitive radio network, considering existence of PUEA in the CR network is studied. Intelligent attackers are considered not to make the channel busy all the time. In other words, we first consider a traffic model for PUEA and PU simultaneously. Then, an effective fast scheme is proposed to identify the time span that the attacker gets into or departs from the spectrum. We also calculate the performance of the proposed detector analytically. Finally, some simulation results, such as changing the number of the antennas at secondary user’s receiver and changing the number of the PUEA’s samples which are in the spectrum are presented to evaluate the effects of them on the performance of the proposed scheme and obtain the best strategy to overcome the effects of the attacker’s presence in the CR network.

24

Rate Optimization in NOMA Cognitive Radio Networks Negar Zabetian, Mina Baghani, Abbas Mohammadi


Abstract In this paper, the power allocation of Nonorthogonal multiple access (NOMA) for secondary users in underlay cognitive radio is studied. In underlay cognitive radio networks, the interference, which is produced by secondary users (SUs), should be less than predefined threshold. On the other hand, their SINR should be greater than certain threshold, otherwise outage occurs. Accordingly, the total rate of downlink SUs can be maximized under the SUs SINR and interference limits constraints. The optimum power allocation coefficients of users are derived. Due to the low complexity of this new method for power allocation, it can be simply implemented in the practical systems. Simulation results show that the proposed scheme achieves a higher rate and lower outage compared to the previous NOMA schemes with fixed power allocation coefficients as well as conventional orthogonal multiple access. Index Terms—Non-orthogonal multiple access, cognitive radio, spectral efficiency, power allocation

Efficient Collaborative Wideband Soft Detection for Confronting Primary User Emulation Attack Mohammad Javad Saber, Seyed Mohammad Sajad Sadough


Abstract We suggest a cooperative spectrum sensing scheme for wideband cognitive radio network when primary user emulationattack (PUEA) is present. PUEA is known to be one of the practical challenges in deploying cognitive networks, where some malicious users try to emulate the primary signal and seduce unlicensed users to not let them access the unoccupied frequency. In this paper, the detection of primary user is formulated as a joint optimization problem to maximize the aggregate achievable throughput given a bound on the aggregate interference imposed on the primary network. Numerical results are provided to show the superiority of our suggested technique in terms of detection accuracy compared to arbitrary defence methods which are proposed in the literature to tackle the presence of the attacker.

25

A Novel Robust Resource Allocation Algori thm for OFDM-based Cooperative Cognitive Radio Networks with Imperfect CSI considerations

Mehdi Ghamari Adian

University of Zanjan, Zanjan, Iran

Abstract

In this paper, the robust resource allocation problem for the orthogonal frequency division multiplexing (OFDM)based cooperative cognitive radio networks (CRNs) with decodeand forward (DF) protocol considering the imperfect channelstate information (CSI) is studied. On the basis of the resourceallocation scheme with perfect CSI, robust resource allocationalgorithm is proposed to maximize the data rate of the CRN,while the interference to primary user (PU) is below a predefinedinterference threshold. Each channel uncertainty parameter is defined by a bounded distance between its estimated and exactvalues, and then the robust power allocation problem is formulated as a semi-infinite programming (SIP) problem. The worst-case approach is utilized to transform the infiniteconstraints into finite constraints and convert the robust powerallocation problem into a deterministic convex optimizationproblem, which can be solved by Lagrange dual decompositionmethod. Simulation results validate the effectiveness of theproposed robust resource allocation algorithm. Keywords - Cognitive Radio Networks; Cooperative Communications; Multicarrier Systems; Resource Allocation; Imperfect CSI.

Reputation-Based Likelihood Ratio Test with Anchor Nodes Assistance Abbas Ali Sharifi, Morteza Sharifi University of Bonab, Bonab, Iran

Javad Musevi Niya

University of Tabriz, Tabriz, Iran

Abstract

Existing Collaborative Spectrum Sensing (CSS) algorithms in the presence of Spectrum Sensing Data Falsification (SSDF) attacks have been investigated in the small-scale attacks, where malicious users are assumed to be in a minority and have limited effects on final decision. But, in massive attacks, where there are a large number of malicious users, the final decision is unreliable and existing methods have low effectiveness. In contrary, we propose a new Weighted Likelihood Ratio Test (WLRT) that collaborative weight is calculated by comparing the sensing history of each user with the reliable anchor nodes’ global decision. The obtained weights are applied in LRT to improve the CSS performance. Simulation results verify the effectiveness of the proposed method. Keywords—Anchor Nodes; Collaborative Spectrum Sensing; Spectrum Sensing Data Falsification; Likelihood Ratio Test.

27

Information Security

29

Information Security (1)

Proposed New Features to Improve Android Malware Detection Atefeh Torkaman

Science and research campus, Islamic Azad University

Iran Telecommunication Research Center

Marjan Bahrololum, Mahdi Vajdi, M.HesamTadayon, Afshin Salajegheh


Abstract In recent years, Android has become most popular and largest installed operating systems in smartphones. The openness capability of android applications let the users to easily download many applications from markets. Accordingly, a large number of malicious applications may be received carelessly. Developers publish their applications in a market place without regard to special considerations. On the other hand, low knowledge of the users in analyzing the risk of these applications, create further exploits on information and privacy. These malicious applications can perform unauthorized activities such as gaining access to user’s sensitive information, camera, SMS, phone calls, etc. In this paper a system which help the users to identify malicious or benign installed apps is proposed. The mentioned system implements a hybrid model based on AdaBoost, J48 to classify installed applications. We evaluate our system with 11096 real data collected from OCS Lab which includes 2124 malware samples and the rest is benign . The proposed system by addition some technical features; the number of Services, Intent Filter and Broadcast Receivers can improve the average positive rate from 98.9% to 99.2% (by using Gain ratio) and 96.8% to 98.1% (by using CFS). Keywords— Android Malware Detection, Hybrid Model, Classification.

A Secure and Area-Efficient FPGA-Based SR-Latch PUF

Amir Ardakani

Iran University of Science and Technology Tehran, Iran

Shahriar Baradaran Shokouhi

Iran University of Science and Technology, Tehran, Iran

Abstract

SR-Latch Physically Unclonable Function (PUF) is the most popular FPGA-based implementation for cryptographic applications. The implementation of a symmetric unbiased SR-Latch PUF is a difficult task due to some restrictions that are imposed on the FPGA implementation. Researchers have proposed different implementation methods which require increasing the area consumption. In this paper, a new design scheme has been introduced to overcome this problem. Two different methods for generating PUF responses are employed in our proposed work. In the first method, which is called method A, the SR-Latch output in its stable state is used to generate challenge-response pairs. In the second method, which is called method B, the two most significant bits of the mean value of oscillations is counted during the

30

metastable state of the SR-Latch to form the PUF responses. In order to analyze the proposed PUF, we implement the proposed scheme on six Spartan-3 FPGA boards. The experimental results show that the average uniqueness of our approach is close to 50%. It is also demonstrated that the area consumption in the design scheme is at least three times better than the conventional methods. The proposed SR-Latch PUF generates responses with high entropy which is suitable for hardware security applications. Keywords— PUF; SR-Latch; Quality Metrics; Hardware Security.

A Conceptual Trust Model for the Internet of Things Interactions Abouzar Arabsorkhi



Mohammad Sayad Haghighi


Roghayeh Ghorbanloo

Nooretouba Institution of Higher Education

Iran Telecommunication Research Center, Tehran, Iran

Abstract

In the new world that is called the Internet of Things (IoT), people, machines and products communicate with each other via the internet. Trust plays an important role in communications and interactions of objects in this world and is considered as a key factor in the success of online transactions. In this paper, we fist review different definitions of trust and go through the models presented for trust management in this new internet. Inspired by how people put trust to work in everyday social life, we propose a conceptual model that caters for the needs of IoT. The proposed model is capable of working in highly dynamic and decentralized networks. It has multiple parameters which can be tuned to satisfy the level of trust requirements in a specific application. Keywords— Internet of Things; Distributed Networks; Trust Model

31

Deniable Encryption based on Standard RSA with OAEP Habib Allah Yajam, Younes Karimi Ahmadabadi, Mohammadali Akhaee


Abstract There are various methods of anti-forensics many of which are simple and robust, however, some advanced techniques such as Deniable Encryption not only are powerful but also proven to be unbreakable in the mathematical sense. Thus, studying them has a crucial role in the science of digital forensics research. In this research, we propose a new technique for deniable encryption based on RSA with OAEP. The technique is motivated by a work of Klonowski et al. and has security property of sender-deniability without any required pre-shared keys. Moreover, since the proposed method is based on widelyused RSA encryption the deniable encryption raises much less suspicion. Thereafter, by presenting implementation results, we show the applicability of our scheme.

A Multi Sender Attribute-Based Broadcast Authentication Scheme Saeed Aghapour, Mohammad Hassan Ameri, Javad Mohajeri


Abstract Multi sender attribute-based broadcast authentication scheme for the network containing resource constrained nodes is the main focus of this research. In this paper, we proposed a framework in which each element of a set of authorized users whose attributes satisfy a special sign control policy can generate a valid signature. In this framework, there exists a trusted server who receives and verifies the validity of the generated attribute-based signatures and broadcast the intended message through the nodes of the network in an efficient and authenticated manner. We also proposed a new symmetric-based broadcast authentication scheme which is used for broadcasting the authenticated messages in the proposed framework. Index Terms—Broadcast Authentication, Attribute-based signature, TESLA

32


Secure Communications in OFDMA Decode and Forward Relay Assisted Networks in Presence of Multiple Eavesdroppers

Mohammad R. Javan

Shahrood University, Shahrood, Iran

Saeed Sheikhzadeh, Nader Mokariy

Tabiat Modares University, Tehran, Iran

Abstract In this paper, we propose a resource allocation algorithm for secure communications in OFDMA relay networks. In our model, a base station wants to securely communicate with a set of users using a set of decode and forward (DF) relay stations (RS) while at the seme time, a set of malicious users are eavesdropping the link between the BS and the relays. Our problem is to maximize the total secrecy rate of network under individual power constraints for BS and relays. We propose low complexity iterative algorithm to solve the optimization problem and performs subcarrier pairing, relay and user selection, and power allocation. The proposed algorithm has two steps; in the first step the subcarrier paring and relay and user selection is performed and in the second step, based on the results of the previous step, the transmit power levels assigned to subcarriers by BS and RSs are obtained. We finally evaluate our proposed algorithm in various situations using simulations.

Index Terms—OFDMA, DF relay, cooperative communications, secrecy capacity, resource allocation, optimization, dual approach.

Provide a Solution for User Validation and Expertise Degree Dynamic in Collaborative Systems

Ahmad Agha Kardan, Roghaye Ahmadi


Abstract

Collaborative systems such as Wikipedia have taken an important step toward creating content and organizing knowledge. Because they allow all people involve in creating content, such systems will face vandals’ attacks and challenges. Therefore, in order to use this encyclopedia, it is important to trust in its content and measure its quality. User’s reputation is an important factor for trusting electronic content in which different factors involve. Some of these factors are users’ contributions, persistent contributions, number of visits, interest, and etc. The user who has more persistent contributions than another user, has more reputation and expertise, and as we all know, involvement of expert people in their expertise area is much more reliable than that of other users. In order to solve the problem of trust and measuring the quality of Wikipedia content as a great encyclopedia, we propose a method to measure the validity of the Wikipedia author using number of contribution, effective validity. Then by defining the time thresholds for persistent and transient contributions try to make every author’s expert dynamic. Conducted analyses indicate that the presented method provides better and more precise results concerning the measurement of author’s validity and expertise.

Keywords—author’s reputation; Wikipedia; expertise; collaborative systems

33

A Secure Attribute Based Keyword Search Scheme Against Keyword Guessing Attack

Vahid Yousefipoor, Mohammad Hassan Ameri, Javad Mohajeri, Taraneh Eghlidos


Abstract

To provide the privacy of the users who receive some computing services from the cloud, the users must encrypt their documents before outsourcing them to the cloud. Computation on outsourced encrypted data in the cloud rises some complexity to the system specially in the case when an entity would like to find some documents related to a special keyword. Searchable encryption is a tool for data owners to encrypt their data in a searchable manner. Generally, there exist two kinds of searchable encryption, namely symmetric (secret key) and asymmetric (public key) ones. Most of the public key searchable encryption schemes are vulnerable to the keyword guessing attack (KGA). In this paper we propose an attribute-based keyword search scheme which is proved to be secure against KGA.

A Novel Network Based Privacy Framework Mina Yadegari

Tarbiat Modares University, Tehran, Iran

Hossein Gharaee

Iran Telecom. Research Center, Tehran, Iran

Abstract one of the key factors of the acceptance of information systems is privacy. Everyday Information systems and networks become complicated, so organizations are collecting growing amounts of personal information. Accordingly personal information is vulnerable to a variety of risks, including damage, loss, misuse, unauthorized access, and unauthorized disclosure. Information privacy assured by the Safe, Secure, proper, and consistent collection, processing, transmission, use and disposition of personal information all over its life cycle. Digitally-Based Personal information is networked all over its life cycle. In recent years some privacy models proposed but they are general-purpose models and focused on personal information. To the best of our knowledge, In spite of the importance of implementing privacy requirements in network, there is no privacy model dedicated to network context. In this paper we propose a privacy framework based on ISO29100 privacy principals and provides a comprehensive perspective of privacy requirements in network. The proposed privacy framework focuses on the implementation of the privacy principles in computer networks and is applicable to all kinds of networks. Keywords—Privacy Framework; PII; Privacy Principal

34

Analysis of Xiao et al.’s Authentication Protocol Conforming to EPC C1 G2 Standard

Behzad Abdolmaleki, Karim Baghery Sharif University of Technology, Tehran, Iran

Bahareh Akhbari

K. N. Toosi University of Technology, Tehran, Iran

Mohammad Reza Aref


Abstract

Recently, different RFID authentication protocols conforming to EPC Class 1 Generation 2 (EPC C1 G2) standard have been proposed. In 2013, Xiao et al. have proposed an improved mutual authentication protocol which claimed to eliminate the weaknesses of Yoon’s protocol that has been proposed in 2012. In this paper, we study the security and the privacy of Xiao et al.’s protocol. It is shown that their protocol suffers from secret parameters reveal, tag impersonation attack, backward and forward traceability attacks. Then, in order to enhance the security and the privacy of this protocol, a modified version is proposed. In order to evaluate our proposed protocol, its security and privacy are analyzed. Furthermore, the proposed protocol is compared with some similar protocols in the terms of security and privacy. It is shown that the proposed protocol is secure against various attacks and also provides user privacy. Index Terms—RFID authentication protocols, security, privacy, EPC C1 G2 standard.

Security Considerations and Requierements for Cloud Computing Fariba Ghaffari


Hossein Gharaee


Mohammad Reza Forouzandehdoust IT Organization, Tehran, Iran

Abstract Based on the standard definition of cloud computing developed by NIST, Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. Recent studies show security issues in cloud computing are considered as a major concern. There are different models that depict the responsibility of cloud providers and customers for securing the cloud computing environments based on different service models. To the best of our knowledge, despite there are various security standards and segregation of duty models, in most cases binding of security controls to use at each layers of the model is not specified. This problem leads to some ambiguities in how to use the existing security controls in different layers. In this paper, we will combine security sta ndards and segregation of duty modelsof cloud computing to introduce a reference model and useful guidelines for securing the cloud computing environments. The proposed security reference model considers both the security

35

requirements and controls in each service models and, for all cloud layers. Also, it separates the security responsibilities of cloud provider and cloud customer to manage security controls. Since this paper is concerned primarily all aspects of security requirements, it can be directly useful to individuals who want to provide or use the cloud computing environments. Keywords—Cloud computing, Security requirements, Securityconsiderations, Security standards, Security controls, Security risks

36


Lightweight, Anonymous and Mutual Authentication in IoT Infrastructure

Shadi Janbabaei

Shahed University, Tehran, Iran

Hossein Gharaee


Naser Mohammadzadeh


Abstract

Recent development in information technology and internet makes the internet of things (IoT) more popular than before. Since all of entities can be interact with each other, so some security elements such as authentication should be considered. Sensor-to-Sensor connection is one of the important communications in IoT environment. Therefore in this paper, lightweight authentication protocol between sensors in stationary and mobile mode is proposed to be suitable for constraint entities. This protocol can ensure some security and privacy features such as anonymity, untraceability and so on. At the end, security requirements and computational costs between different schemes are compared. Keywords—Internet of Things; authentication; anonymity; lightweight; untraceablity

Welcome to Binder: A Kernel Level Attack Model for the Binder in Android Operating System Majid Salehi


Farid Daryabar, Mohammad Hesam Tadayon

Iran Telecommunication Research, Center (ITRC), Tehran, Iran

Abstract In this paper, we consider to seek vulnerabilities and we conduct possible attacks on the crucial and essential parts of Android OSs architecture including the framework and the Android kernel layers. As a regard, we explain the Binder component of Android OS from security point of view. Then, we demonstrate how to penetrate into the Binder and control data exchange mechanism in Android OS by proposing a kernel level attack model based on the hooking method. As a result, by implementing the attack model, it is illustrated that the Android processes are detectable and the data can be extracted from any process and system calls. Keywords—smartphone security; android security; binder component; kernel level attack

37

Malware Detection using Opcodes Statistical Features

Saeid Rezaei

Islamic Azad University, Tehran, Iran

Fereidoon Rezaei, Ali Afraz, Mohammad Reza Shamani

Kish international campus, Tehran University, Tehran, Iran

Abstract In recent years, malicious software has affected and overshadowed personal computer and computer network securities. For this reason, searching for innovative solutions to detect malware has become increasingly important. In this paper, we develop a malware detection method using similarity measurement algorithms. The purpose of the proposed method is to improve the malware detection rate and detection speed. This method, compared to other static detection techniques, has many advantages, such as a much higher speed due to the direct use of opcodes and better detection results due to being uninfluenced by obfuscation and disassembly techniques. We also evaluate these malware detection algorithms by using the most up-to-date antivirus software. Experimental results show that the proposed method has a detection rate of 90%, while the most up-to-date antivirus software has an average detection rate of about 40%. It is found that the proposed method increases the speed of detection program by 30% compared to the existing techniques. Keywords—malware; edit distance; opcode

Automated Analysis Method for Forensic Investigation of Cloud Applications on Android Farid Daryabar, Mohammad Hesam Tadayon, Ashkan Parsi, Hadi Sadjadi

Iran Telecommunication Research, Center (ITRC), Tehran, Iran

Abstract In this paper, we propose an analysis method for investigation of cloud client applications in order to automatically detect all possible data remnants and data leakage on Android devices. In this analysis method, a set of predefined keywords to conduct the manual examination of acquired forensically sound images of Android’s internal memory (RAM) and internal storage was used. This allows the investigators to detect the data remnants and identify users’ activities patterns. The identified patterns are then used to design an algorithm for detecting cloud client applications data remnants automatically. The outcome of this paper resulted in detection of varieties of artifacts from different user activities, such as installation, login, uploading, downloading, deletion, and the sharing of files on the Android internal memory and internal storages. These findings and method may assist digital forensic examiners and investigators in real world examination of cloud client applications on Android platforms. Keywords—component; digital forensic; smartphone forensic; android forensic; cloud forensic

38

A New Feature Selection IDS based on Genetic Algorithm and SVM Hossein Gharaee

Iran Telecom Research Center, Tehran, Iran

Hamid Hosseinvand


Abstract Intrusion detection systems (IDS) are the main components of network security. IDSs monitor events of a system in a network, analyze the behavior in order to detect intrusions. One of the IDS models is anomaly based IDS which train to distinguish between normal and abnormal traffic. One of the anomaly based IDSs is based on Genetic algorithm as an evolutionary optimization algorithm. This paper has proposed an anomaly based IDS using Genetic algorithm and Support Vector Machine (SVM) with a new feature selection method. The new model has used a feature selection method based on Genetic with an innovation in fitness function reduce the dimension of the data, increase true positive detection and simultaneously decrease false positive detection. In addition, the computation time for training will also have a remarkable reduction. Results show that the proposed method can reach high accuracy and low false positive rate (FPR) simultaneously, though it had earlier been achieved in earlier studies separately. This study proposes a method which can achieve more stable features in comparison with other techniques. The proposed model experiment and test on KDD CUP 99 and UNSW-NB15 datasets. Numeric Results and comparison to other models have been presented. Keywords— Intrusion Detection System; Genetic; SVM; Feature Selection

39

Posters: Information Security

LDPC Decoder Implementation Using FPGA

Mahdie Kiaee


Hossein Gharaee


Naser Mohammadzadeh


Abstract This paper presents a partial-parallel LDPC decoder based on sum-product algorithm with high throughput. The hardware implementation of decoder considers design issues with respect to FPGA and time scheduling is proposed based on modified TPMP1 algorithm in order to reduce the number of clock cycles, hardware resources and power. The decoder is implemented for a code length of 672 whit rate of 3/4, maximum throughput of 3360 Mbps in maximum frequency of 280 MHz and provides power of 150 mW. Keywords— LDPC decoder; hardware implementation; FPGA; time scheduling; TPMP algorithm

Quantum Secret Sharing Using Single States

Razieh Mohajer, Ziba Eslami

Shahid Beheshti University, Tehran, Iran

Abstract In this paper, we propose a secure Quantum Secret Sharing protocol among participants which are far from each other and there is no secure channel between them to reconstruct the secret. This protocol doesn't need any entanglement states or unitary operations. Each participant performs rotations and finally measures single states. Keywords- Quantum secret sharing; Rotation operation; Quantum cryptography; Superposition states;

41

Big Data

43

Big Data

Comparison of Several Sparse Recovery Methods for Low Rank Matrices with Random Samples

Ashkan Esmaeili, Farokh Marvasti


Abstract In this paper, we will investigate the efficacy of IMAT (Iterative Method of Adaptive Thresholding) in recovering the sparse signal (parameters) for linear models with random missing data. Sparse recovery rises in compressed sensing and machine learning problems and has various applications necessitating viable reconstruction methods specifically when we work with big data. This paper will mainly focus on comparing the power of Iterative Method of Adaptive Thresholding (IMAT) in reconstruction of the desired sparse signal with that of LASSO. Additionally, we will assume the model has random missing information. Missing data has been recently of interest in big data and machine learning problems since they appear in many cases including but not limited to medical imaging datasets, hospital datasets, and massive MIMO. The dominance of IMAT over the well-known LASSO in the absence of time-consuming matrix completion methods will be taken into account in terms of RMSE and computational complexity. Simulations and numerical results are also provided to verify the arguments.

Keywords—Iterative Methods; Sparse; Lasso; Adaptive Thresholding; Matrix Completion

A new density estimator based on nearest and farthest neighbor

Azadeh Faroughi, Reza Javidan

Shiraz University of Technology, Shiraz, Iran

Mohsen Emami

Payame Noor University, Tehran, Iran

Abstract Usually nearest-neighbor density estimator methods suffer from problems such as high time

complexity of )( 2nO and high memory requirement especially when indexing is used. These

problems produce limitations on applying them for small datasets. In this paper a new method is proposed that calculates distances to nearest and farthest neighbor nodes to make dataset subgroups; therefore, computational time complexity becomes of O(nlogn) and space complexity becomes constant. After subgroup formation, assembling technique is used to derive correct clusters. The proposed method uses a new parameter to detect clusters which are not obviously separable. The ratio of middle point to minimum density of clusters is compared to this parameter which its value is dependent on the clustering problem. The proposed method is applied to both synthetized and real-world datasets and the results demonstrated the feasibility of the proposed method. Furthermore, the proposed method is compared to the similar algorithm –DBSCAN- on real-world datasets and the results showed significantly higher accuracy of the proposed method.

Keywords—nearest_neighbor density estimator; farthest neighbor; subgroups;

44

An Efficient Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation Farnaz Hoseini

Islamic Azad University, Rasht Branch, Rasht, Iran

Asadollah Shahbahrami

University of Guilan, Rasht, Iran

Abstract

Image segmentation is one of the most common steps in digital image processing. It classifies a digital image into different segments. There are many algorithms for image segmentation such as thresholding, edge detection, and region growing, which finding a suitable algorithm for medical image segmentation is a challenging task. This is due to noise, low contrast, and steep light variations of medical images. The main goal of this paper is improving the performance of fuzzy c-means clustering. Improving is achieved using parallel implementation of this algorithm. Fuzzy c-means clustering is an important iterative clustering algorithm, but it is computationally intensive and it uses the same data between the iterations. The center of the clusters changes in each iteration, which requires considerable amount of time for large data sets. The parallel fuzzy c-means clustering is implemented by using task pipeline concept in CUDA technology. The experimental results show that the performance is improved up to 23.35x. After that watershed algorithm is applied for the final segmentation. The implementation results show that the accuracy of diagnosis in magnetic resonance imaging 97/33% is improved. This improvement is achieved using enhancing edges and reducing noises in images. Keywords -component: Parallel Fuzzy C-Means Clustering, Watershed Algorithm, Parallel Computing, CUDA, GPU.

45

Posters: Big Data

A Modified Hybrid Fuzzy Clustering Method for Big Data

Amir Khoshkbarchi, Ali Kamali, Mehdi Amjadi, Maryam Amir Haeri


Abstract Clustering is among the most common data mining techniques and Fuzzy clustering can model the world even more realistically and more precisely. One of the most favorable fuzzy clustering methods is the Fuzzy C-Means (FCM) algorithm, which is actually identical to the (original) K-Means clustering algorithm fueled with a fuzzy flavor. However, there are some issues with the fuzzy clustering methods; FCM is too sensitive to the initial conditions, like identifying the initial arrangement of clusters. Furthermore, it suffers from a slow convergence and the lack of a guarantee to reach a global optimal solution and it faces problem in the handling big data. Dealing with these problems, and for the sake of an improved precision, this paper proposes a new modified FCM algorithm, based on Particle Swarm Optimization (PSO) with considering multiple dimensions of the data. Besides that, the proposed method utilizes the Map-Reduce technique in order to make the new method suitable for big data. This objective is achieved by selecting the most optimal candidates in the mapping phase and aggregating them in the reduce phase with the purpose of getting the most optimal results. Simulation and experimental results show an improved performance for the proposed method applied to big data, compared to other hybrid FCM-PSO method.

Keywords—clustering; big data; FCM; PSO; mapreduce

Big Data: A Coevolutionary Strategic Roadmap

Davood Maleki, Ehsan Arianyan, Mohammad Reza Ahmadi

Iran Telecom. Research Center, (ITRC), Tehran, Iran

Abstract In recent years, new IT solutions and services have been appeared. One of the challenging topics in this category is big data. Although there have been tremendous researches in this area, emergence of all characteristics and potential of big data are still in its early stages. Success in big data development requires implementation of strong infrastructure which effectively depends on a multidimensional policy and road map that can cover all the aspects of big data in this era. On the other hand, the macro processing and knowledge extraction have been involved in many complicated challenges and needs a clear and multidimensional development plan. A comprehensive roadmap makes it possible that any business entity and organization discover a new vision for future success through collection and analysis of raw data. We propose a roadmap that concentrates on several strategic areas including research activities, infrastructure and platform, data analysis, standard regulation, application services and eventually business development. The roadmap has a Coevolutionary strategy that players evolve in a parallel model. The evaluation of our proposed road map shows its applicability for developing big data services in both developed and underdeveloped countries.

Keywords—Big Data, Road Map, Strategic, Analytics

46

Distributed Processing of DBSCAN Using MapReduce

Garrett Poppe, Jianchao Han, Bin Tang, Mohsen Beheshti

University Dominguez Hills 1000 E. Victoria St., Carson, CA, USA

Abstract

DBSCAN is a clustering algorithm, which can discover clusters with a variety of shapes while compensating for noise. Since this algorithm was presented in 1996, it has been extensively studied and applied in practice. The original algorithm was running on a single process that

compares each point through a neighborhood query and could possibly compare the same point for multiple clusters, which may take O(n²) time for the worst case. To improve the

efficiency of the algorithm, some parallel DBSCAN algorithms have been developed, where using parallel processing it may be possible to achieve a near linear complexity as the number of nodes, used for processing, closes to the number of objects in the dataset. Recently, as

Hapdoop and MapReduce provide a powerful parallel computation platform and framework, parallel DBSCAN algorithms are also implemented based on MapReduce. In this paper, some

MapReduce-based parallel DBSCAN algorithms are reviewed and analyzed, and a possible improvement of DBSCAN implemented with MapReduce on Hadoop is proposed. The improved algorithm is illustrated using examples, and the map and reduce as well as the

merge functions are described.

47

Satellite and Space

Communications

& Wireless Communications

49

Satellite and Space Communications & Wireless Communications (1)

A Ray Tracing Model for Beam Footprint Boundary in Cognitive Satell ite Communication Applications Hamed Montazeri-Shatouri, Amir Reza Forouzan, Kamal Shahtalebi

University of Isfahan, Isfahan, Iran

Abstract

Characterizing the satellite beam footprint boundary can be used to measure the overlap of the

beam coverage area of a satellite with that of other communication systems. A crucial

application of this is in emerging cognitive satellite communication systems. In this paper, an

analytical model based on ray tracing is proposed for specifying the boundary and the size of

the satellite beam footprint and the distance of the footprint center from the beam center on

Earth's surface. These characteristics are primarily a function of four parameters, namely, the

coordinates of satellite, the beam cross-sectional shape, the coordinates of beam center, and

the beamwidth. These parameters are reduced to only two parameters of Earth central angle

between the nadir and the beam center and the beamwidth. Numerical results show that by

increasing any of the two parameters the asymmetry of the footprint, its size, and the distance

between the footprint center and the beam center increase.

Keywords—satellite communicaions; cognitive radio; ray tracing

Spatial Interference Alignment in Relay-Assisted Multi-Cell Multi-User Networks Ali Golestani, Ali Habibi. Bastami, Kamal Mohamed-pour K.N. Toosi University of Technology, Tehran, Iran

Abstract

In this paper, the spatial interference alignment (IA) is investigated in the downlink (DL) of a

relay-assisted multi-cell multi-user network. The transmission from the base station (BS) to

the mobile station (MS) takes place in two phases with the help of the selected relay station

(RS). The closed-form IA algorithms are employed in both the BS to RS and RS to MS links.

The performance of this cooperative scheme is analyzed in terms of the sum rate and the sum

degrees of freedom (DoF) for the amplify-and-forward (AF) and decode-and-forward (DF)

relaying schemes. The simulation results of the sum rate show that the DF scheme

significantly outperforms the noncooperative minleakage and max-SINR iterative algorithms

over the entire range of SNR, and the AF scheme performs very close to the minleakage

algorithm. Moreover, the DF scheme outperforms the noncooperative closed-form IA

algorithm in the low and medium- SNR regimes.

Index Terms—Cellular network, degrees of freedom, interference alignment, relay, sum rate.

50

On the Uplink Spectral Efficiency of Full -Duplex Cooperative OFDMA Systems Jafar Banar, S. Mohammad Razavizadeh

Iran University of Science and Technology (IUST)

Abstract

In this paper, we develop a resource allocation algorithm for uplink of in-band full-duplex

(FD) cellular networks. The FD cellular network is assumed to be based on orthogonal

frequency division multiple access (OFDMA) and consists of a base station communicating

with multiple users. Some of the users in the network act as relay for other users and help

them to transmit their data to the base station. These relays are FD and work based on amplify

and forward (AF) protocol. By appropriate selection of the relays and optimized allocation of

subcarriers and powers to all users, we try to maximize the total sum rate of the network.

During this optimization, we also impose some constraints on the users’ quality of service

(QoS) and power. We propose a new algorithm to select the best relays based on the users’

maximum data rate and also use Linear Assignment Problem Jonker-Volgenant (LAPJV)

algorithm for subcarrier assignment. It is proved that the resulting optimization problem can

be converted to a convex problem, and hence it can be solved by standard numerical methods.

The simulation results demonstrate the effect of the proposed scheme on the sum rate

and coverage of the network.

Index Terms—In-Band Full-Duplex, OFDMA, QoS, Selective Relaying, Uplink resource

allocation.

A Low-Complexity Near-Optimal Algorithm for Blind Estimation of Pseudo-Noise Sequences in DSSS Communication Systems

Saeed Mehboodi, Ali Jamshidi, Mahmoud Farhang

Shiraz University, Shiraz, Iran

Abstract

A novel algorithm is proposed for blind estimation of the spreading sequence in direct-sequence spread-spectrum (DSSS) communication systems. This algorithm is based on the

maximum likelihood decision rule. Due to high computational complexity, the maximum likelihood method is feasible only for spreading sequence with very short periods. The novel algorithm has two steps for estimation. At first, a prior estimation of the spreading sequence is

obtained via a simple algorithm which has a very low computational complexity. In the second step, using the prior estimation and the maximum likelihood decision rule, the

estimation accuracy increases greatly. The proposed algorithm can reach the performance of the eigen value decomposition (EVD) method with low computational complexity.

Keywords—Blind estimation, intelligence, PN sequence estimation, blind despreading, spread spectrum, low probability of intercept.

51

A Cooperative Spectrum Leasing Scheme with Guaranteed Secrecy Rate for Primary Link

Shokufeh Vatanpour, Mohammad Reza Javan

Shahrood University, Shahrood, Iran

Abstract

In this paper, we consider a cooperative cognitive radio network in which there is an OFDM primary link and multiple single carrier secondary links. The primary link is required to

maintain its secrecy rate above a predefined threshold. If the secrecy rate requirement is not satisfied, the secondary system help primary link to maintain its secrecy rate requirement. In doing so, the secondary transmitters work as decode and forward (DF) relays and hence, as a

reward, gains access to network resources to transmit its own information. Our objective is to maximize the data rate of secondary system while satisfying the primary secrecy rate

constraint and individual transmit power constraints for primary link and secondary system. We solve our proposed optimization problem using dual Lagrange approach to find the set of cooperating secondary link, subcarrier assignments, and transmit power over each subcarrier.

Using simulations, we evaluate our proposed scheme in various situations.

Index Terms– Secure communications, cognitive radio network, cooperative communications, OFDM, resource allocation, dual approach.

On Singularity Extraction of Time-Domain Green’s Functions of Layerd Media

Saeed Souri, Mohsen Ghaffari-Miab


Abstract

In this work, an efficient and highly accurate method for extracting the source singularity of

time-domain Green’s functions (TDGFs) of layered media is presented. The proposed method has controllable accuracy and can be easily incorporated into finite difference method in time-domain for subsequent use in a marching-on-in-time (MOT)-based time-domain integral

equation (TDIE) solvers.

Keywords— source singularity extraction; layered media; finite difference generated time-domain Green’s functions (TDGFs)

52


Reduce Impact of False Detection of Adversary States on the Secure Cooperative Network

Moslem Forouzesh, Paeiz Azmi, Nader Mokari


Abstract

This paper investigates the problem of power allocation, in the presence of a malicious adversary. For this scenario, we consider a source, a destination and full-duplex (FD) relay,

that receives private messages and transmits jamming signals on the same time and frequency band.

In this system model, we assume the adversary can jam legitimate link or eavesdrop the private message, and benefit from maximal ratio combining (MRC) technique . Since the global channel state information (CSI) is available for adversary, it can choose

between eavesdropping or jamming modes, such that the final achievable rate in the legitimate destination is minimized. As in practice, the adversary hides its mode from

legitimate source, adversary's mode detection is so challenging. To tackle this issue, we propose an approach that decreases destructive effects of adversary's mode false detection on secrecy rate.

Simulation results show, when adversary is passive, adversary's mode false detection decreases secrecy rate 51\% and when it is active, false detection decreases secrecy rate

92\%, while if is benefited from proposed approach, secrecy rate decreases 10\% and 66\%, respectively.

Index Terms- Physical layer security, cooperative communications, full duplex relay, malicious adversary.

How to Select an Optimum Set of Modes for a Link Adaptive Transmission

Mehrdad Taki

University of Qom,Qom, Iran

Reza Mahin Zaeem

Arta Naghshe Ramona Co.,Tehran, Iran

Abstract

Complexity issues and limited feedback rate strictly constraint the number of transmission modes in discrete link adaptation. A new algorithm is designed for selecting an optimum set

of modes out of all the possible transmission modes based on the link’s characteristics and the constraints. The design goal is to maximize the average spectral efficiency and the selection is

done using a combination of nonlinear quantization and integer programming. As numerical evaluations for adaptive LDPC or convolutional coded, QAM modulated transmission show, performance of the proposed scheme is considerably improved in comparison with the

benchmark schemes.

Keywords— Link Adaptation, Adaptive Modulation and Coding, integer programming.

53

A New Bargaining Approachon theN-userGaussian Interference Channel Atena Ebrahimkhani , Babak Seyfe


Abstract

In this paper, a game with pricing scheme over a N-user Gaussian interference channel is presented. We investigate the Kalai-Smorodinsky bargaining solution (KSBS) to guarantee

fairness in resource allocation among users. It is shown that by using the treating interference as noise scenario and applying proper prices for the transmit power of each user the outcome

of the proposed game is a unique fair point. Also an iterative algorithm is proposed that converges to the KSBS when users update their transmit power and price. Numerical results confirm analytical developments.

Keywords-Gaussian Interference Channel; Kalai-Smorodinsky bargaing solution; Nash

equilibrium; fairness.

On Distributed Transmission of Remote Correlated Gaussian Sources over an Orthogonal Gaussian Multiple-Access Channel Mehdi Setayesh, Hamid Behroozi, Babak H. Khalaj


Abstract

In this paper, we consider the problem of sending a bivariate correlated Gaussian source

through a two-user Gaussian orthogonal multiple-access channel (MAC), where each encoder observes a noisy version of one of the source components, and the receiver aims at

reconstructing each source component. The estimation quality is measured by mean-squared error (MSE) distortion criterion. Different components of the source have their own fidelity requirements instead of total or average distortion measure. It is easy to verify that for this

problem, digital communication has an optimal performance. However, it is not explicit that when there is a constraint on the total power budget, what power allocation reaches the

optimal power-distortion trade-off. This paper determines the power allocated to each encoder in the digital communication setting. Furthermore, we also analyze the performance of uncoded transmission scheme which has considerably lower complexity and delay than

source-channel separation scheme.

Index Terms – Joint source-channel coding, correlated sources, uncoded transmission, power allocation.

54

A Realistic Reciver Model for Neuro-spike Communication

Reyhaneh Bigharaz, Ali Jamshidi, Alireza Keshavaez- Haddad


Abstract

Nano communication is a branch of nanotechnology, which is exploring biological systems via the development and designing of algorithms which can be used in molecular communications (MC). One of the most attractive fields in MC is neuro-spike

communications, which dominates the communications among neurons, is a greatly unexplored area. In this study, we investigated a realistic detection method concerning neuro-

spike communication in different locations of neurons that have difference sense for improving error probability and achieving optimum threshold voltage level in different SNR. Moreover there are some modulators in dendrites of neurons in receiver mode that add a

random amplitude to the signals that receive from another neurons in transmitter mode. By manipulating the characters of distribution function of random amplitude, we can achieved

less error probability. The obtained theoretical receiver model for molecular communications may aid to design new synthetic Nano scale communications approaches for the promoting of practical nanonetworks, suitable in the interconnections of Nanomachines as well as seeking

medical treatment for neural disorders.

A Novel Relay Selection Scheme for SSK Modulation in Cooperative

Communication

Mohammad Esmaeili, Abbas Mohammadi

Amirkabir University of Technology (Tehran Polytechnic) , Tehran, Iran

Abstract

Space shift keying (SSK) modulation is a scheme in which the indices of active transmit antennas play an essential role in carrying information bits . In SSK modulation, the

communication channel acts as modulating unit. Therefore, using the conventional relay selection schemes based on channel coefficients are impossible in cooperative systems using

SSK modulation. In this paper, we propose a novel relay selection scheme that is applicable in cooperative systems using SSK modulation. The proposed scheme is based on calculating and measuring the Euclidean distances between received signal and all active or inactive channel

coefficients. The proposed relay selection scheme is applied for a cooperative communication system with multiple relay nodes and a direct link between source and destination. The

analytical expressions are derived to calculate the average bit error rate (BER) over Rayleigh fading channels. The analytical and simulation results show that this relay selection scheme can provide a full cooperative diversity order, for SSK modulation. The analytical results are

validated using Monte Carlo simulation studies.

55


Performance Enhancement of the Golden Code by Utilizing the ORIOL Antenna

Vahid AmiriKooshki,

Iran University of Science and Technology (IUST), Tehran, Iran

Mohammad Ali SadatHosseini,

Petroleum University of Technology (PUT), Tehran, Iran

Ali Lotfi-Rezaabad,

Sharif University of Technology (SUT), Tehran, Iran

Siamak Talebi

Shahid Bahonar University of Kerman (SBUK), Kerman, Iran

Sharif University of Technology (SUT), Tehran, Iran

Abstract

In this paper, a novel method is exposed to improve the performance of the Golden code. In fact, we recommend using the octagonal reconfigurable isolated orthogonal element (ORIOL) antennas instead of a conventional microstrip patch antenna. In order to obtain a dramatic

improvement, the ORIOL antenna should be employed in both the transmitter and the receiver sides. Accordingly, in this paper, we recommend space-time-polarization diversity instead of

space-time singly; therefore, it is obvious that by employing this technique, the system obtains more strength against destructive fading. The simulations for different rates have confirmed that utilizing the ORIOL antenna outperforms patch microstrip one, which is

roughly about 2 to 3 dB according to the rates.

Index Terms—Multi-input multi-output, LTE, space-time block codes, Golden code,

multipath channels, metasurface, ORIOL antenna.

A Selective Physical Layer Network Codingfor Wireless Two-Way Relaying

Ala Mahdavi, Ali Jamshidi, Alireza Keshavarz-Haddad


Abstract

In this paper, we propose a selective physical layer network coding (SPNC) scheme in two-

way relay channel (TWRC) for binary phase shift keying (BPSK) modulation over Rayleigh fading channels. Physical layer network coding (PNC) shows average throughput gain over traditional relaying in two-way relay systems, but not in all channel conditions PNC performs

better than traditional relaying. The key idea of SPNC is to combine the advantage of PNC and traditional relaying in fading channels to improve throughput of the system. We show that

in channel states when PNC fails to correctly detect XORed data from superimposed signal at the relay, it is still possible to detect one of the sources' data to retrieve up to half of the achievable throughput by a so called single node detection (SND) scheme. Also, we analyze

error performance and throughput gain of SPNC. Simulation results show that SPNC achieves significant throughput gain over PNC in Rayleigh fading channels.

Keywords—netwrok coding; physical layer; bit error rate; throughput; selective physical layer network coding

56

A New Channel Code for Decreasing Inter-Symbol-Interference in Diffusion

Based Molecular Communications

Parvin Akhkandi, Alireza Keshavarz-Hadad, Ali Jamshidi


Abstract

Molecular communication is a new framework in data communication based on biological

mechanisms and systems. In molecular communication system, the transmitter sends information by transmitting certain chemical molecules called data molecules and after

propagation of the molecules in the environment they are collected and decoded by the receiver. Due to randomness in the movement of the molecules, they would arrive at the receiver out of order and cause inter-symbol interferences (ISI) problem. Channel coding

techniques are commonly used in this situation to tackle the problem. In this paper, we introduce a new family of channel codes, called Crossover Resistant Coding with Time Gap

(CRCTG), to reduce the effect of ISI in molecular communications. The performance of the proposed coding schemes are analyzed and compared by simulations with the existing techniques.

Minimizing the Expected Distortion of Two-Hop Networks Using Multi-Layer

Source Coding

Sayed Ali Khodam Hoseini, Soroush Akhlaghi


Mina Baghani


Abstract

This paper concerns minimizing the expected distortion of a Gaussian source, transmitted

over a two-hop block fading channel, under the mean square-error measure. It is assumed that there is not a direct link between the source and destination, and a simple Decode and

Forward (DF) relay, handles the communication. The channel state information (CSI) associated with each hop is available at the corresponding receiver, while the transmitters are unaware of associated CSIs. It is assumed that the source node performs successive

refinement source coding approach, together with multi-layer channel coding to send its information to the relay. Then, the relay re-encodes its received information with a multi-layer

channel code, and forwards it to the destination. Accordingly, the optimal power allocation policy across code layers in terms of minimizing the expected achievable distortion are formulated and addressed and then the results are numerically derived for Rayleigh block

fading environment, showing the proposed method performs better than the Amplify and Forward (AF) relaying for source-channel mismatch factors greater than one.

57

MUSIC-BASED Approaches for Hybrid Millimeter-Wave Channel Estimation

M.Shakhsi Dastgahian, H.Khoshbin Ghomash

Ferdowsi University of Mashhad, Mashhad, Iran

Abstract

Millimeter wave communication (mmWC) over E-band-frequencies between 30 and GHz- is a promising volunteer for 5G indoor/outdoor communication systems with an ultra high data rates thanks to the large bandwidth. To subdue the channel propagation characteristics in this

frequency band, high dimensional antenna arrays need to be deployed at both the base station (BS) and mobile sets (MS). Due to large number of antennas at transceiver, mmW systems

avoid to employ ADC or RF chain in each branch of MIMO system because of power constraints. Thus Such systems leverage to the hybrid analog/digital precoding/combining architecture for downlink single user deployment instead of strict digital process. Large array

at both BS and MS inside of analog beamforming requires developed channel estimation. This paper propose a new algorithm to estimate the mmW channel by exploiting the sparse nature

of the channel and finding the subspace of received signal vectors based on MUSIC. By combining the multiple measurement vector (MMV) concept and MISIC, a modified approach tries to recover support of an unknown channel matric accurately even under the

defective- rank condition. Simulation results indicate MUSIC-based approaches offer lower estimation error and higher sum rates compared with conventional MMV solutions.

Keywords—Millimeter wave MIMO systems; sparse channel estimation; support; multiple measurement vectors (MMV); hybrid architecture.

A Variational Bayesian Method for Improving the BER of the LP Stream in

Hierarchical Modulation

Mahsa Azad, Seyed Mohammad Sajad Sadough


Abstract

Hierarchical modulation (HM) is a multi-level modulation scheme, proposed for enabling unequal error protection. More precisely, HM divides the binary data stream into a higher priority (HP) and a lower priority (LP) stream.

The HP and LP streams vary in their susceptibility to noise. The basic HP signal is more robust, in other words, heavily protected against noise and interference, whereas the LP

stream has much less robustness. In this paper, we propose a variational Bayesian expectation-maximization (VBEM) scheme for semi-blind joint channel estimation and data detection at an iterative receiver based on bit-interleaved coded modulation (BICM), with the

aim of improving the bit error rate (BER) of the noisy LP stream. Moreover, the proposed receiver allows us to reduce the pilot symbol overhead compared to the classical HM

receivers based on pilot-assisted channel estimation.

58


Power Control for D2D Underlay Cellular Communication: Game Theory

Approach

Mohammadamin Baniasadi


Behrouz Maham

Nazarbayev University, Astana, Kazakhstan

Hamed Kebriaei


Abstract

Device-to-device (D2D) communication is considered as a promising resource reuse in cellular networks. However, the allocation of channel resources and power to D2D

communication require precise coordination since D2D user equipments (UEs) can cause interference to cellular UEs. In this paper, we develop Nash Bargaining Solution (NBS) and

Nash Competitive games frameworks to model the power allocation problem. NBS is a type of cooperative games, which has been applied for solving resource allocation problem among competing players. In the NBS game, the optimization problem is not convex. We propose a

method to make the problem convex. In the Nash Competitive game, the problem is convex so that we apply KKT conditions and find a closed form solution for Nash Equilibrium (NE).

Finally, we perform computer simulations to study the performance of the games. Simulation results show that our method for finding NBS has a significant accuracy. Results also indicate that D2D users have higher rates in NBS game compared to Nash Competitive game which

states that the cooperation helps D2D users to gain more efficiency.

Index Terms—Device-to-device (D2D) communication, power allocation, Nash Bargaining

Solution (NBS), Nash Equilibrium (NE).

Price-based Device-to-Device Communication Underlying Cellular Networks

Sara Sharifi, Mohammad Fathi

University of Kurdistan, Sanandaj, Iran

Abstract

Underlay device-to-device (D2D) communication is envisaged to improve the spectral

efficiency in cellular networks. One main challenge in this technology is how to control transmit powers from D2D pairs in order to preserve a certain quality of service requirement for cellular users. To address this challenge, this paper proposes a price-based power control

game, by which transmit power of D2D pairs is so adjusted that a given transmit rate for a cellular user is satisfied. Numerical results are conducted to evaluate the performance of the

proposed scheme.

Keywords— Device-to-device, price-based game, power control, optimization.

59

QoS Improvement in IEEE802.11e using Smart Nodes

Ali Vaezi, Mohammad Yousef Darmani

K. N. Toosi University of Technology, Tehran, Iran

Abstract

This paper aims to improve the QoS of IEEE802.11e standard. It is intelligently performed by

adjusting the contention parameters of the MAC layer based on desired priorities of the nodes. We focus on CW and AIFS that are used for calculating the back-off time to have traffic

priority in accessing the channel in EDCA part of IEEE802.11e standard. The proposed scheme is called SN-EDCA (Smart Node-EDCA).Node priority is defined based on its condition. To do this, a neural network is used to set the contention parameters of each node

which works based on queue length, buffer capacity and traffic priority of the node. Simulation results show that the proposed scheme improves the QoS of IEEE802.11e

standard. Keywords— IEEE802.11e; MAC; QoS; RBF; Neural Network;

Performance Analysis of the clustered caching wireless networks considering

Stochastic Geometry Approach

Leila Enamipour, Zolfa Zeinalpour-Yazdi,

Yazd University, Yazd, Iran

Babak Hossein Khalaj


Abstract

Recently, caching of the popularity video files in the caches near to the users has been proposed as a promising way to reduce data traffic. These caches can be considered as the

nodes which their transmission ranges are limited but have significant storage capacity and are known as the helper nodes. To evaluate the performance and efficiency of the caches, a suitable model for their distributions should be taken into account. Stochastic geometry is a

useful tool for modeling these nodes. In this paper, the helper nodes and users are distributed according to the Poisson point process distribution. However, to manage the interferences and

their access to a distributed cache, the helper nodes are clustered. The clusters center are modeled with matern hard core process which its original feature is the creation of nonoverlapping circles. Then, the closed-form expressions are derived for performance

metrics of the network such as outage probability, average rate, and simulate the proposed model with monte-carlo method. Based on the simulation of the study, the results demonstrate

the validity of the analytical derivations.

60

Hyperspectral Image Classification by High Dimensional Limited Training

Samples Using Weight Function

Majid Roohi

Islamic Azad University, Mehriz, Iran

Hassan Ghassemian


Abstract

Small training sample size in multi-spectral and hyperspectral images and especially the high dimensionality of these samples result in a reduction in supervised parameter classification, particularly parametric supervised classifications such as ML. Two fundamental approaches

for solving this issue are feature reduction using feature extraction methods such as PCA and LDA, and classifying nonparametric supervision methods, such as KNN, which are more

resistant to the Hughes phenomenon. In this paper it is concluded that adopting features using the proposed method based on between-class weights, a classification improvement is seen as compared to LDA and PCA feature extraction methods. It is shown that the KNN

classification operation is much more resistant to the Hughes phenomenon as compared to ML.

Keywords- Feature selection; multi-spectral imaging; remote sensing imaging; classificatio;, limited training sample; weight function.

Closed-Form Error Probability of Blind Detection for Free Space Optical

Systems

Mohammad Taghi Dabiri, Seyed Mohammad Sajad Sadough, Hossein Safi


Abstract

Atmospheric turbulence is a practical obstacle in deployment of free space optical (FSO) communications. Due to its ease of implementation, on-off keying (OOK) is a widely adopted modulation technique for intensity modulation with direct detection (IM/DD) in optical

communications. For optimal signal detection, the receiver needs to know the instantaneous channel fading coefficient to detect OOK symbols. In this paper, to reduce the effect of

atmospheric turbulence, we employ blind detection to estimate the channel and to adjust the detection threshold. Since Monte Carlo analysis requires long simulation time, we derive a closed-form expression for the bit error probability of IM/DD systems. Numerical results are

provided to validate the accuracy of derived analytical expressions.

Index Terms—Free space optical communication, blind detection, channel state information.

61

Robust Resource Allocation in Cloud-RAN Network Based on COMP

Technology

Atefeh Rezaei, Paeiz Azmi, Nader Mokari

Tarbiat Modares Institute of Technology, Tehran, Iran

Abstract—In this paper, we consider a joint transmission scheme of coordinated multi-point

(COMP) technology in communication networks. In this kind of networks, data can be transmited from multiple points to a user in a time-frequency resource, simultaneously.

Because of high signaling and successive delays, channel state information at the transmitter (CSIT) may be incorrect. In this regard, we devise the robust beamformers that minimizes the total transmit power while the quality of service (QoS) constraints are satisfied and

uncertainty of CSIT is taken into account. For CSIT uncertainty model, two schemes are proposed: 1) we assume that CSIT imperfection is a Euclidean ball-shaped uncertainty set

with specified considered error bound. This problem is a quadratically constrained quadratic problem (QCQP) that can be transformed into a semidefinite program (SDP). 2) we choose stochastic robustness method that reformulates the purposed power minimization in a chance

constrained programming (CCP) form. In this kind of problems, some methods are employed to find closed form of constraints. In this article, the closed-form of SINR constraint is

obtained with Bernstein approximation. Finally, it is converted to a SDP problem. Simulation results show that when CSIT is imperfect, more transmit power is needed to guarantee the target of the constraint but by Bernstein approximation this increasing cost is slow and lower

than the other existing methods.

Index Terms- COMP, robust beamformerming, imperfect CSIT, Bernstein approximation

62


Analysis of Energy Efficiency and Area Spectral Efficiency in Small Cell

Networks with Multi-Antenna Base Stations

FahimeSadat Mirhosseini, Aliakbar Tadaion

Yazd University, Yaz, Iran

Abstract

In this paper we study a dense small cell network employing multi-antenna Base Station (BS)s and analyse the two performance metrics, the Energy Efficiency (EE) and the Area Spectral Efficiency (ASE). In this network each BS utilizes the Frequency Reuse (FR) to mitigate the interference of the other BSs. Although the two network parameters, the BS density and the number of its antennas change the both EE and ASE, EE becomes an important metric as these parameters substantially increase. Applying the spatial Poisson Point Process (PPP) model for the distribution of the BSs and the User Equipment (UE)s, we demonstrate that there exists a trade-off between EE and ASE. Therefore, we aim to maximize EE of the networks given a constraint on ASE to derive the optimal network parameters. Some simulation examples justify our derivations.

Joint CFO and Channel Estimation in OFDM-based Massive MIMO Systems

Hamed Hojatian

Isfahan University of Technology, Isfahan, Iran

Hamid Saeedi-Sourcky

Yazd University, Yazd, Iran

Mohammad Javad Omidi

Isfahan University of Technology, Isfahan, Iran

Arman Farhang

CONNECT, Trinity College Dublin, Ireland.

Abstract

Estimation of carrier frequency offset (CFO) is a challenging task in practical systems specifically in the uplink of multiuser systems where multiple CFOs are present in the received signal. Massive MIMO as a multiuser technique has recently attracted a great deal of attention among researchers. However, to the best of our knowledge, there is no study looking into the joint estimation of CFOs and wireless channel in orthogonal frequency division multiplexing (OFDM) based massive MIMO systems. Therefore, in this paper, we propose joint estimation of multiple CFOs and the users’ channel responses based on the maximum likelihood (ML) criteria in such systems. We propose to use the zadoff-chu (ZC) training sequences to reduce the implementation complexity. Additionally, utilization of ZC sequences for training simplifies the multidimensional grid search problem of estimating multiple CFOs and converts it into a set of line search problems, i.e., one line search problem per user. Also this sequence has a low peak to average ratio (PAPR). Finally, we show the efficacy of our proposed algorithm through numerical simulations.

Index Terms—Estimation, ML, CFO, ZC, OFDM, massive MIMO, 5G.

63

Transmit Precoding Aided Spatial Modulation for Multi-User Correlated Large-

Scale MIMO Channels

Marjan Maleki, Kamal Mohamed-Pour

K.N.Toosi University of Technology

Abstract

We propose a transmit preprocessing aided spatial modulation (PSM) scheme for downlink of

multi-user multiple-input multiple-output (MIMO) systems which exploits the spatial correlation matrices of users. In this way, array antennas in base station can be scaled to large

dimensions while requiring reduced dimension channel state information at transmitter (CSIT). This property makes proposed PSM suitable for large-scale MIMO frequency-division-duplexing (FDD) systems in order to decrease the downlink training and the CSIT

feedback from users in uplink. In the proposed PSM effort, a zero forcing (ZF) based two-stage precoding is designed in which the first stage is prebeamforming based on second-order

statistics to reduce the impact of the multi-user interference and at the second stage a precoding is done by exploiting reduced dimension effective channel to enable successful signal detection at each receiver. Our simulation results show that the proposed multi-user

PSM scheme succeeds in eliminating multi-user interference and detecting transmitted spatial symbol which improves in large-scale regimes.

Evaluation of Wideband Link Simulation Process with Extended Kalman Filter

Interpolation for MIMO-OFDM WLAN Channels

Mahdi Nouri, Farbod Setoudeh

Arak University of Technology, Arak, Iran

Sajjad Abazari Aghdam

CEECS Dept., Florida Atlantic University, Boca Raton, USA

Abstract A new wideband simulation environments for multiple input-multiple output (MIMO) wide local area network (WLAN) channels is described, which covering several wireless communication services. Stimulated by the prerequisite of appropriate performance of link simulation techniques in study of communication systems are proposed in this paper. Specially, an algorithm is designated to estimate the fast-fading WLAN channels in high velocity vehicular in this paper. In order to adequately pursue channel response with fast time-varying, adaptive algorithm for channel estimation is essential. A tapped-delay line base-form is utilized for the multi-path channel, and a process with auto-regressive structure is applied for the time-correlation of the channel taps. The proposed algorithm is developed by an extended Kalman filter to estimate the amplitude and phase of channel frequency response. So, these parameters are achieved by applying known pilot symbols. It makes an efficient MIMO WLAN channel estimation for random antenna arrangements at the unknown transmitter and receiver. Some distributions are covering several wireless communication services for model parameters are also provided from 2.4 to 4.8 GHz band, which are used in IEEE 802.11a and the emerging IEEE 802.11n standards.

Keywords— Extended Kalman filtering; MIMO Channel; Tapped-delay filter; WLAN.

64

Performance Analysis of a Multi-User Diversity in a SIMO Spectrum Sharing

System

Behnam Aghazadeh, Mohammad Torabi Shahid Beheshti University, Tehran, Iran

Abstract

In this paper, a performance analysis is presented for a multi-user selection diversity in a single-input multiple-output (SIMO) spectrum sharing system. In the considered system, multiple secondary users (SUs) try to utilize the licensed spectrum of the primary user (PU) in

an opportunistic manner, in which an interference constraint and a quality of service for the primary user are satisfied. The average achievable channel capacity and the outage probability

performance of the system are analyzed and mathematical closed-form expressions are derived for the system under study. The performances of the system are evaluated using the derived mathematical formulas in different cases. In addition, Monte-Carlo simulation results

are also provided to show the accuracy and correctness of the performed analysis.

Index Terms- Ergodic capacity, multi-user diversity, outage probability, spectrum sharing, SIMO.

A Small Dual Band Antenna with Simple Structure for WLAN/WIMAX

Application

Kioumars Pedram, Javad Nourinia, Changiz Ghobadi Urmia University, Urmia, Iran

Abstract

A small dual band antenna is presented to be inserted in a wireless communication device. The proposed antenna consists of L-shaped and mirror L-shaped stubs that are designed for

wireless local area network (WLAN) bands at (5.15-5.8GHz) and worldwide interoperability of microwave access (WiMAX) bands at (3.3-3.7GHz) using a defected ground structure.

The patch of the antenna is printed on an FR-4 substrate with small size of 15×15×0.8 mm3 that can have better impedance bandwidth and radiation characteristics with a simple structure. The dimensions of the proposed antenna are optimized and simulated in Ansoft

HFSS (version 15), the measurement result of the antenna reveals that the impedance bandwidth covers the whole required band for WLAN/WIMAX 802.11a standard.

Keywords—Dual Band; WLAN; WiMAX; Return Loss (S11); Radiation Pattern.

65

Poster: Satellite and Space Communications & Wireless Communications

Outage Probability for Underlaying Device to Device Communications

Hossein Ghavami, Shahriar Shirvani Moghaddam Shahid Rajaee University, Tehran, Iran

Abstract

One of the key strategies for increasing throughput and optimum resource allocation in 5G communications is Device to Device (D2D) communications which can be obtained by minimizing the outage probability. In order to minimize the outage probability, it should be

modeled by considering the effect of interference, noise and multipath phenomena in a joint state. In this paper, by considering the statistical models of Additive White Gaussian Noise

(AWGN) and Rayleigh multipath fading in two scenarios, the exact formulas for outage probability of a D2D communications underlying cellular network is proposed. In the first scenario, each D2D pair is allowed to reuse radio resource of one cellular user whereas in the

second scenario, resources of two cellular users can be reused. The proposed formulas are compared to the approximate (non-exact) ones. The comparative study for the first and second

scenarios show that the non-exact formula and the proposed exact one are in accordance with simulation results in MATLAB. As a remarkable result, based on Non Orthogonal Multiple Access (NOMA) approach, two approximations for the non-exact and the proposed formulas

are extracted which are acceptable for multiple resource reuse scenario. Finally, simulation results show that multiple reuse scenario offers higher throughput in an acceptable outage

probability compared to one reuse scenario when the distance between the D2D pair and respected cellular user is more than 71m.

Keywords- Device to Device Communications; Underlay; Non- Orthogonal; Multiple Access; Outage Probability.

67

Wireless Networks

69

Wireless Networks

Decreasing Delay Variation In Multimedia Applications In Single-Hop Wireless

Motahareh Mobasheri, Mehdi Dehghan Takhtefooladi Amirkabir University of Technology, Tehran, Iran

Abstract

In this paper a sender wants to transmit delay variations sensitive packets to a base station in a single-hop wireless network. Packets arrival to the sending buffer of the sender is Constant Bit Rate (CBR) and Variable Bit Rate (VBR) for audio and video packets respectively. It is

assumed that the transmission energy of the sender is harvested from the environment and its level is random. Channel Signal to Noise Ratio (SNR) levels determine the channel state in

different time steps. In order to sequential decision making with the goal of minimizing the delay of the packets in the sending queue while minimizing variations of this delay (jitter) in nondeterministic environment, variance-penalized Markov Decision Process model is used.

Because of unknown state transition probability of the system, Reinforcement learning (RL) approach is used to optimize the sender’s decisions. The simulation results show the approach

in comparison RL for minimizing only the delay has less delay variations but the delay is more.

Keywords— wireless network; delay; delay variations; multimedia; reinforcement learning

Performance Analysis of Cooperative Wireless Body Area Networks over

Gamma Fading Channels

Maryam Abbaspour Asadolla, Ehsan Soleimani-Nasab University of advanced Technology, Kerman, Iran

Abstract

We investigate the performance of dual-hop cooperative amplify-and-forward relaying systems in wireless body area networks over independent and non-identically distributed

Gamma fading channels. In particular, tight lower bounds on the end-to-end outage and symbol error probabilities, for fixed gain and channel state information (CSI)-assisted relaying scenarios, are derived in closed-form for arbitrary signal-to-noise ratios (SNRs) . We

also present simplified expressions in the high-SNR regime that enable us to quantify the system performance in terms of diversity order and coding gain. The numerical results

provide important physical insights into the implications of model parameters on the system performance; for instance, it is demonstrated that the fixed-gain relaying has a better performance than CSI-assisted relaying, where the former has more realistic assumptions.

70

A Genetic Approach in Relay-Jammer Selection and Power Allocation for

Physical Layer Security

Niloofar Okati, Mohammad Reza Mosavi Iran University of Science & Technology, Tehran, Iran

Hamid Behroozi Sharif University of Technology, Tehran, Iran

Abstract

Node cooperation approaches improve physical layer security in wireless networks without applying data encryption. Selecting the appropriate nodes to cooperate as relays or friendly

jammers, to degrade eavesdropper’s link, is a challenging problem which has attracted a lot of attention in recent years. Various approaches, based on conventional exhaustive search, have been suggested for optimal relay-jammer selection and power allocation in the literature. The

complexity of these methods is proportional to the number of intermediate nodes. As the number of intermediate nodes exceeds a specific bound, conventional exhaustive search

appears infeasible due to high computational complexity. In this paper, we propose a novel approach based on genetic algorithm (GA), for relayjammer selection, power allocation and computational complexity reduction. Our system model consists of a source-destination pair,

one eavesdropper and a number of intermediate nodes which cooperate as relays or friendly jammers. Considering the achievable secrecy rate as the cost function for GA optimization,

the proposed algorithm is performed in two steps. First, we determine the desired channel gains that maximize the secrecy rate using GA. In the second step, nodes for which the corresponding channel gains have the smallest deviation from the obtained values in the first

step, will be chosen as relays or jammers. We compare the proposed method with two kinds of conventional exhaustive search techniques one with fixed and the other with adaptive power allocated to jammers. Simulation results show that the proposed method reduces

computational complexity while attaining a secrecy rate close to conventional techniques. Also the power which is allocated to jammers during each phase of transmission will be

declined using GA optimization. Despite of conventional exhaustive search, the complexity of the proposed algorithm is almost the same as the number of cooperative nodes increases. So, the proposed method will outperform the previous works in terms of simplicity, efficiency

and security.

Index Terms—Physical layer security, cooperation, relayjammer selection, genetic algorithm, secrecy rate, computational complexity

71

Computing Diversity-Multiplexing Trade-off of Static QMF Communication

Strategy in Half-Duplex Diamond Relay Channels

Hediyeh Soltanizadeh, Farzad Parvaresh, S. Mohammad Saberali Department of Electrical Engineering, University of Isfahan, Isfahan, Iran

Abstract

This paper studies the diversity-multiplexing tradeoff (DMT) of half-duplex diamond relay channels. Diversity and multiplexing gains usually evaluate the performance of any relaying

strategy, in wireless relay networks with fading channels. DMT captures the fundamental trade-off between these two gains, for communications at high signal to noise ratios (SNR). In this paper, we propose an efficient algorithm that computes the DMT of static-QMF

communication strategy in half-duplex diamond relay channels. To find DMT of static QMF, one needs to solve a cumbersome optimization problem. The proposed algorithm, breaks the

given optimization to finite number of sub-optimization problems, each one of which is a quasi-concave optimization problem. Then, using a binary search method, each sub-optimization problem is solved efficiently and the results of sub-optimization problems are

combined to find DMT of the static QMF communication in the network.

Non-stationary Sparse System Identification over Adaptive Sensor Networks with

Cyclic Cooperation

Amir Bazdar Islamic Azad University, Urmia branch, Urmia, Iran.

Afsaneh Akhbari Islamic Azad University, Barajin branch, Gazvin, Iran

Ehsan Mostafapour, Changiz Ghobadi Urmia University, Urmia, Iran

Abstract

in this paper we studied the performance of several distributed adaptive algorithms for non-

stationary sparse system identification. Non-stationarity is a feature that is introduced to adaptive networks recently and makes the performance of them degraded. The performance analyses are carried out with the steady-state mean square deviation (MSD) criterion of

adaptive algorithms. Some sparsity aware algorithms are considered in this paper which tested in non-stationary systems for the first time. It is presented and proved that the performance of

incremental least means square/forth (ILMS/F) algorithm surpasses all other algorithms as non-stationarity grows. We hope that this work will inspire researchers to look for other advanced algorithms against systems that are both non-stationary and sparse.

Keywords-Adaptive networks, incremental least mean square, non-stationary condition, sparse system identification

73

Antennas and Propagation

75

Antennas and Propagation (1)

Electromagnetic Plane-Wave Scattering of a Coated and partially filled

Rectangular Crack

Behbod Ghalamkari Islamic Azad University, Science and Research Branch, Tehran, Iran

Abstract

In this paper Kobayashi Potential technique which is a fast and powerful analytical method applied to find the far-field scattering of a coated and partially filled 2D rectangular crack in a PEC plane. The polarization of the incident wave is transverse magnetic (TM) plane-wave.

First, the problem is solved for the electric field inside the coating layer. Then, the field contribution from the crack is added as a perturbation in terms of Bessel Eigenfunctions to the

coating layer and free space. Using the Weber-Schafheitlin discontinuous integrals and applying the KP method, the governing equations of an infinite summations with unknown coefficients are found. Subsequently, the infinite summations are truncated with high

numerical accuracy. Imposing the boundary conditions results in finding the unknown coefficients. Finally, the result of progressively filling the coated rectangular crack on the far-

field scattering is explored. Having the analytical method, both lossy and lossless permeabilities and permittivities are considered for the coating and the filling dielectric. The method is extremely accurate and computationally efficient and also could be applied to both

narrow and wide rectangular cracks.

Keywords— plane-wave scattering, coated and partially filled crack, Kobayashi method,

Weber-Schafheitlin discontinuous integrals.

60 GHz Aperture Coupled Patch Antenna Array using Reflection-Type Liquid

Crystal Phase Shifter

Prafulla Deo The University of Manchester, Manchester M13 9PL,

Dariush Mirshekar-Syahkal University of Essex, Colchester, UK

Lawrence Seddon, Sally E. Day, F. Aníbal Fernández University College London, London, UK

Abstract

An aperture coupled patch antenna array is designed using a compact microstrip reflection-type phase shifter controlled by liquid crystal (LC). This array has a beam steering capability

in one dimension for 60 GHz applications. In this array, each phase shifter provides a differential phase shift of 193° at the operating frequency of 59 GHz. The final design comprises of a 4 × 1 array capable of scanning up to 78° in the Eplane as the bias voltage on

the liquid crystal changes from zero to saturation voltage.

Index Terms—liquid crystal (LC), phased arrays, millimeterwave phase shifters.

76

SIW Leaky Wave Antenna With Non-Uniform Transverse Slots

Maryam Azarnoush Islamic Azad University, Science and Research Branch, Tehran, Iran

Ramezan Ali Sadeghzadeh Khaje Nasir Toosi University of Technology, Tehran, Iran

Fatemeh Geran Shahid Rajaee Teacher Training University, Tehran, Iran

Mohammad Naser Moghaddasi Islamic Azad University, Science and Research Branch, Tehran, Iran

Abstract

A novel slotted substrate integrated waveguide (SIW) leaky-wave antenna is proposed. This

antenna works in the TE10 mode of the SIW. Leakage is obtained by introducing a periodic set of transverse slots on the top of the SIW, which interrupt the current flow on the top wall. It is seen that three modes (a leaky mode, a proper waveguide mode, and a surface-wave-like

mode) can all propagate on this structure. The wavenumbers of the modes are numerically evaluated by HFSS simulation. The leakage loss is also analyzed. A non-uniform slotted SIW

leaky-wave antenna is designed that has good beam scanning from near broadside (though not exactly at broadside) to forward endfire. This type of SIW leaky-wave antenna has a wider impedance bandwidth and a narrower beam than previous similar ones that scans with

frequency. Measured results are consistent with the simulation and the theoretical analysis.

Keywords—Leaky wave; leaky-wave antenna; periodic structure; SIW; substrate integrated waveguide; surface wave.

Gain and Lower Cut-Off Frequency Improvement of Antipodal Vivaldi Antenna

Majid Amiri, Ali Ghafoorzadeh-Yazdi, Abbas-Ali Heidari Yazd Universit, Yazd, Iran

Abstract

A new modified structure of antipodal Vivaldi antenna (AVA), designed and implemented based on the low-cost FR4 substrate, is investigated. In order to reduce the cut-off frequency

and then increase the antenna bandwidth, the radiating element and ground plane are loaded with half-elliptical shape patches. Besides, for improving the antenna gain, an exponentially dielectric loading is placed in the front of the antenna radiation aperture. The results show a

considerable reduction of lower cut-off frequency, about 30%, from 3.85 to 2.7GHz. The proposed antenna has the impedance bandwidth of 2.7-12.5 GHz and is proper for UWB

applications. Also, the improvement of antenna gain at 4-12.5 GHz band, maximum 2dB enhancement at 12.5GHz, is observed. The simulation and analysis of the proposed antenna is performed by using the commercial HFSS software. The simulated and measured results are

in good agreement and validate the design approach.

Keywords- antipodal Vivaldi antenna; dielectric loading; gain; cut-off frequency

77


Ultra Wideband Electromagnetic DORT Time-Reversal Localization of Single-

Defect in Pipe

Javad Ebrahimi-Zadeh, Mojtaba Dehmollaian, Karim Mohammadpour-Aghdam University of Tehran, Tehran, Iran

Abstract

In this paper, an ultra-wideband Structural Health Monitoring (SHM) system based on DORT time reversal signal processing method is designed and implemented. The system is able to

alleviate the channel dispersions by backpropagating the time reversed signal by means of the exact cylindrical Green’s function. The SHM system uses four ultra-wideband quasi-Yagi

antennas to excite a hollow metal pipe. The antennas are designed for multi-modal excitation of the metal pipe and they operate at the central frequency 10GHz with a 4GHz bandwidth to excite several different wavemodes of an infinite cylindrical waveguide. All the antennas are

located at a fixed axial position. This system has the capability to detect and localize multi-defect in any metal pipe whose first cutoff frequency is less than 8 GHz.

Index Terms—Structural health monitoring system, Time re-versal, DORT, Supper-resolution, Cylindrical waveguide, Dyadic Green’s function.

Analytical Approach to Design the Metasurface Based Infrared Cloaking

Mohammad Danaeifar, Nosrat Granpayeh K. N. Toosi University of Technology, Tehran, Iran

Abstract

we demonstrate an analytical approach to find monotone and wideband cloaking by using

equivalent conductivity method. This method gives us a straightforward tool to design the metasurface with an appropriate reactance. The equivalent conductivity is achieved with the aid of the polarizability of a nanoparticle that constituting the metasurface. The designed

metasurface covered the dielectric cylinder plays cloaking shell role and dramatically decreases the scattering from the cloaked object. This scattering reduction is evaluated

numerically and compared with uncloak situation from far infrared to near infrared wavelength ranges.

Keywords—cloaking; metasurface; equivalent conductivity method; scattering cancelation;

78

Propagation and Scattering Analysis in a 2D Rectangular Room Using Closed-

Form Green’s Function

Mohammad Hossein Sadrearhami, Amir Ahmad Shishegar Sharif University of Technology, Tehran, Iran

Abstract

Wave propagation analysis inside a 2D rectangular room in the presence of an object is studied. Closed form Green's function of the empty room is derived and the problem is solved by implementing the Method of Moments. The Green's function is obtained by employing the

Characteristic Green's Function (CGF) technique in conjunction with the Complex Images (CI) method. The proposed form is independent from location of transmitter/receiver and a

single run of the procedure is sufficient to completely model the empty room. The performance of the presented method is studied in an example.

Index Terms—Characteristic Green’s Function (CGF) Technique, Indoor Propagation, Green’s Function, Complex Images Method

Object Locating in Anisotropic Dielectric Background Using MUSIC Algorithm

Faezeh Shirmehenji, Abolghasem Zeidaabadi Nezhad, Zaker Hossein Firouzeh Isfahan University of Technology (IUT), Isfahan, Iran

Abstract

In this paper, MUltiple SIgnal Classification (MUSIC) algorithm is used for locating small

electric inclusions with arbitrary ellipsoid shape, within a three dimentional homogeneous biaxial anisotropic dielectric background medium.

This algorithm is noniterative and uses the scattering amplitude. We use this algorithm at a fixed frequency, where the electric inclusions are apart or closely spaced, with arbitrary contrast of permittivity.

Index Terms—MUSIC algorithm, anisotropic dielectric background, three dimensional.

Gravitational Search Algorithm Used to synthesis a Planar Array Antenna for

Nulling Control and Side Lobe Level Reduction

Ataollah Ebrahimzade, Hajar Abedi, Maryam Hesari University of Technology, Babol, Iran

Abstract

Planar array antenna synthesis is one of the most popular optimization problems in electromagnetic and antenna community. This paper introduces a recently algorithm, known as the Gravitational Search Algorithm (GSA), to the pattern synthesis of planar antenna array

for imposing deeper nulls in the interfering direction and desired side lobe level (SLL) by

79

position-only optimization. The results of GSA are validated by comparing with results obtained using PSO algorithm as reported in literature for planar array. The numerical results

such as radiation pattern show the effectiveness of the proposed method. Keywords— planar array antenna, particle swarm optimization (PSO), Gravitational search

algorithm (GSA), array synthesis, Deeper Nulls, Side lobe level (SLL).

80


Electromagnetic DORT Time Reversal Dielectric Spectroscopy

Javad Ebrahimi Zadeh, Hadi Balegh, Rajab Fallahi Iran Telecommunication Research Center, Tehran, Iran

Abstract

This paper introduces a new method of microwave dielectric spectroscopy based on electromagnetic decomposition of the time reversal operator (known under French acronym

DORT) signal processing. This technique utilizes electromagnetic energy absorption at microwave frequencies. Since dielectric materials are penetrable, so they act as imperfect resonators. By inspecting the spectrum of the singular values of the multi static data matrix, it

can be inferred the permittivity of the dielectric. . Toward this end, we performed full-wave simulations of microwave dielectric spectroscopy of two layered dielectric cylinders by using

the green’s function of multi- layers dielectric cylinder.

Keywords— Dielectric spectroscopy, time reversal imaging, Multistatic data matrix (MDM),

singular value decomposition

Competition Over Resources Algorithm and Its Application for Planar Array

Pattern Synthesis

Reza Gholami, Bijan Zakeri, Hajar Abedi, Sina Mohseni University of Technology, Babol, Iran

Abstract

This paper will investigate a method of synthesizing planar arrays through the application of a new optimization algorithm based on competitive behavior of animal groups that will impose deeper nulls in the interfering direction with the constraint of a reduced Side Lobe Level

(SLL). Simulation results for optimal patterns by position-only and both the element space and amplitude controlling with the imposed single and double nulls are given to show the

effectiveness of the proposed method. In the following, after a general explanation of the algorithm, a comparison of obtained results with particle swarm optimizations, as a well-known heuristic algorithm, is presented. Furthermore, in order to set which design case could

provide a better performance in imposed deeper nulls and side lobe reduction, a comparative evaluation of both proposed methods (position-only, position and amplitude) will be done.

Finally, the optimized design case with a uniform planar array will be achieved. Also, the proposed algorithm on array antenna synthesis, shows faster and superior results compared to other optimization algorithms.

Keywords— Cost Function, Null Control, Particle Swarm Optimization (PSO), Planar Array,

Side Lobe Level Introduction

81

Novel Band-Pass Frequency Selective Surface with Stable Response

Mahdi Taghizadeh, Mohsen Maddahali, Reza Abed Isfahan University of Technology, Isfahan, Iran

Abstract

This paper is about new class of band-pass Frequency Selective Surface (FSS) that works at X-band. For this purpose, two structures are presented. First structure same as traditional FSS uses aperture element and can control bandwidth with changing lengths. For single layer

resonant frequency is located at 9.86GHz and the range of -3dB bandwidth is between 7.44 to 12.42GHz (4.98GHz). In order to made wider bandwidth, we simulated two layers of this

element with thick substrate. But second structure is three layer of new class of band-pass FSS that works at X-bands. Unlike conventional FSS, this FSS uses patch element with non-resonant element instead of aperture element to design band-pass filter. Simulation shows that

the new FSS has stable bandwidth regarding to the change of incident angle. -3dB bandwidth is 8.13GHz and the frequency response is stable within 65° for both TE and TM polarization.

Proposed band pass FSSs can be used for large bandwidth radomes and other structures. Keywords—Frequency Selective Surface; stable angle of incidence and polarization; -3dB

Bandwidth

Challenges in The Application of Electromagnetic Waves for Orchid Pest Control

Mahmood Moghavvemi University of Malaya (UM), Kuala Lumpur, Malaysia

University of science and culture, Tehran, Iran

Hossein Ameri Mahabadi University of Malaya (UM), Kuala Lumpur, Malaysia

Hadi Aliakbarian University of Malaya (UM), Kuala Lumpur, Malaysia

Abstract

One of the challenging problems in the production of Orchid flowers is the control of different kinds of harmful pests. Currently, this problem is addressed via the use of chemical

spray or chemical-based treatments, which harms the people and the environment. To alleviate the hazards caused by chemical-based pest control and protect Orchids, the use of electromagnetic exposure is proposed in this paper. The contribution of technology in

agriculture is briefly touched upon, and the challenges in using electromagnetic waves are discussed. Although the proposed method is still in its infancy and under-investigation, it does

suggest some beneficial advantages, which cannot be ignored. Keywords— Electromagnetic exposure, pest control, Orchid flower

82

Electromagnetic Scattering from a PEC Target Buried Beneath a Rough Surface

Using KA-PO Method

Mahdi Behdani, Ahad Tavakoli, Parisa Dehkhoda Amirkabir University of Technology, Tehran, Iran

Mohammad Zoofaghari Yazd Universit, Yazd, Iran

Abstract

In this paper a new hybrid method is used to solve the electromagnetic scattering from a 2-D PEC target under 1-D random rough surface based on multipath scattering strategy and equivalence principle. In this procedure, the Kirchhoff approximation (KA) and the physical optics (PO) Method are applied to calculate equivalent currents on the rough surface and PEC target respectively. The mutual coupling between rough surface and target is then obtained by multipath scattering strategy and Huygens equivalence principle. The results of KA-PO method is compared with conventional method of moment (MoM) for two different target shapes. The results of KA-PO method are in good accuracy with MoM results except near grazing observation angles and also shows that using KA-PO method can greatly reduce computational time. The effect of the object size and ground loss also studied by using KA-PO method in this paper.

Keywords—rough surface scattering, kirchhoff approximation, multipath scattering, hybrid

methods

Metallic Grating on a Periodic Anisotropic Substrate as a Planar Artificial

Magnetic Conductor

Mahmood Rafaei-Booket, Zahra Atlasbaf Tarbiat Modares University, TMU, Tehran, Iran

Mahmoud Shahabadi University of Tehran, Tehran, Iran

Abstract

In this paper; a planar Artificial Magnetic Conductor (AMC) constituted of a metallic grating on a periodic anisotropic substrate is proposed. The characteristics of this structure are investigated with a full-wave computational technique which utilizes the dyadic Green's function computed by means of an equivalent transmission line (TL) model in the spectral domain. The obtained Green's function is used in an integral equation for the surface electric current on the metallic grating. The integral equation is then solved using the Method of Moments (MoM) with appropriate basis and test functions. With the help of the proposed semi-analytical method, different periodic structures on various substrates are analyzed. To verify the computed results, they are compared with previously published ones. Finally, the phase response of the introduced periodic structure is calculated as a function of the optic axis direction of the anisotropic region within the substrate. It is shown that the proposed metallic grating on the periodic anisotropic substrate can perform as a low-profile and broadband planar AMC at lower frequencies.

Keywords— Artificial Magnetic Conductor (AMC), Dyadic Green’s function, Method of Moments (MoM), Periodic Anisotropic substrates.

83

Composite Right/Left-Handed Transmission-Line Based Wideband Antenna for

WLAN, WiMAX and WiFi Applications

Mohammad Alibakhshi-Kenari, Mohammad Naser-Moghadasi Science and Research Branch, Islamic Azad University, Tehran- IRAN

Ramezan Ali Sadeghzadeh K. N. University of Technology, Tehran- Iran

Bal S. Virdee Sciences and Computing, London N7 8DB, UK

Ernesto Limiti Università degli Studi di Roma Tor Vergata, Via del Politecnico 1, 00133 Roma – ITALY

Abstract

In this article, a new and compact wideband antenna is presented based on metamaterial

composite right/left-handed transmission-line (CRLH-TL) structures. The proposed wideband planar antenna provides enhanced gain performance and is optimized for bandwidth, efficiency and radiation patterns. The CRLH-TL is realized by embedding two inverted F-

shaped slots inside a rectangular radiation patch which is inductively grounded through a metal via-hole. The antenna is constructed using two CRLH-TL unit-cells to cover the

frequency span from 3.1 GHz to 5.4 GHz, which corresponds to a fractional bandwidth of 54.11%. The overall size of the antenna is 11 mm × 7.4 mm × 0.8 mm or 0.15λo×0.1λo×0.011λo, where λo is free space wavelength at the operating frequency of 4.25

GHz. The antenna has a maximum gain and radiation efficiency of 6.4 dBi and 89.04%, respectively, at 5.4 GHz. The proposed antenna finds application in various wireless technologies including WLAN, WiMAX and WiFi.

Index Terms - Small antenna, composite right/left-handed transmission line (CRLH-TL),

wideband antenna, wireless communication systems, F-shaped slots.

84

Posters: Antennas and Propagation

A Very Small Broadband CPW-Fed Circular Polarized Antenna With Two

Semicircles Etched On Ground Plane

Mohsen Karamirad, Fereshteh Samadi, Changiz Ghobadi, Javad Nourinia Urmia University, Urmia, Iran

Abstract

In this paper, a very small broadband circularly polarized planar antenna fed by coplanar waveguide is designed and fabricated. The antenna is composed of a beveled rectangular

radiator patch, a square patch, two inverted L-shaped grounded strip lines, and two semicircles etched on ground. Additionally, to realize the circular polarization a new structure including two semicircles etched on ground and two inverted L-shaped grounded strip lines at

the corner is introduced. The proposed antenna has a very small size of that covers the measured impedance bandwidth ( ) of 113.17% from 3.31 GHz to 13.1

GHz with axial ratio bandwidth of 36.31% from 4.51 GHz to 6.55 GHz for WLAN frequency band. The average gain of the antenna is almost 3.1 dBi within the axial ratio bandwidth

Keywords— Broad bandwidth; circular polarization (CP); coplanar waveguide (CPW); semicircles; unequal L-Shaped strips

A Dual Band Circularly Polarized Antenna with Parasitic Element for Gain

Enhancement

Fereshteh Samadi, Mohsen Karamirad, Changiz Ghobadi, Javad Nourinia, R. Barzeghari Urmia University, Urmia, Iran

Abstract A dual band circularly polarized (CP) antenna for WiMAX and WLAN application is

proposed. By placing a fork-type parasitic element with a ground plane and a rectangular stub connected to the ground, desirable CP dual band characteristics are achieved. The measured

results exhibit %22.2 (3/2-4 GHz) and %21/4 (5-6/2 GHz) impedance bandwidth with axial ratio (AR) of %21.06 (3/4-4/2 GHz) and %35/7 (4/6-6/6 GHz) for WiMAX and WLAN frequency bands, respectively. Additionally, a novel and simple approach in order to enhance

gain of the antenna at the lower frequency is introduced. Indeed, by employing a rectangular shorted parasitic element under the patch, the gain of the proposed antenna is improved nearly

3 dBi. In comparison to recent CP dual band antennas, the proposed antenna has a more desirable gain as well as wide AR bandwidth in both functional bands with a smaller size.

Keywords— Dual band planner antenna; Circular polarization; parasitic element; Wireless applications

85

Development of a Wideband and Inclined Polarized Cavity Backed Slot Antenna

Using SIW Structure

Abbas Soltan, Mohammad Hassan Neshati Ferdowsi University of Mashhad, Mashhad, Iran.

Abstract

This paper presents a broadband, dual-polarized substrate integrated waveguide cavity-backed slot antenna. In this design, high-order cavity resonances are used to generate arbitrary levels of inclined linear polarization. The antenna can provide an adjustable inclined linearly

polarized with an aspect ratio of Ex/Ey ranging from 0.11 to 0.69. The proposed antenna provides fractional impedance bandwidth of 11% with at least front-to-back ratio of 10 dB in

broadside direction and a relative gain of 6 dBi at most of the operating impedance bandwidth. The antenna structure is numerically evaluated using High Frequency Structure Simulator and results including reflection coefficient, axial ratio, and radiation patterns are

reported.

Index Terms- Cavity-backed antenna, Dual polarization, Slot antenna, Substrate integrated waveguide (SIW).

87

Signal Processing in

Communications

89

Signal Processing in Communications (1)

Hyperspectral Data Compression by Using Savitsky- Golay Smoothing Filter and

Curve Fitting

Mersedeh Beitollahi, S. Abolfazl Hosseini Islamic Azad University, Tehran, Iran

Abstract

The collected images of earth's surface over hundreds of narrow spectral bands and close

together, are called hyper spectral images (HS). These images need to be compressed because of the correlation between bands and transmission of a very high amount of storage. There are various methods for compressing in the spatial state or in the Spectrum state that each of these

methods can be lossy or lossless. But it should be considered that in the field of remote sensing Spectral data in hyper spectral images, is more important than location data, so the

compression should be performed somehow spectral data of these images well preserved. Our proposed method in this paper is a lossy compression method that is the main basis for the use of the Curve fitting. It is recognized that the compression method using Curve fitting has very

good performance compared to other methods such as the principal component analysis (PCA).In this method, the spectral signature of each pixel from the original data using

Savitzky- Golay smoothing filter which is smoothed with the best length of the window and grade, then a fractional rational curve with the best grade fitted on that. Coefficients of the numerator and denominator of this function are considered as new features and thus the

original data compressed well. The results indicate that compressed data after recovery has a very close resemblance to the original data.

Keywords—Compression; Curve Fitting; Hyper spectral; Least Square; Savitsky-Golay Filter.

Multimodal Image Fusion via Sparse Representation and Clustering-Based

Dictionary Learning Algorithm in Nonsubsampled Contourlet Domain

Fahim shabanzade, Hassan ghassemian Tarbiat modares university, Tehran, Iran

Abstract

Image fusion is a widely used technique for enhancing the interpretation quality of images in

medical application, which use different medical imaging sensors. This paper presents an image fusion framework for images acquired from two distinct medical imaging sensor

modalities (i.e. PET and MRI) based on sparse representation in Non Sub-sampled Contourlet transform (NSCT) domain. NSCT firstly performed on pre-registered source images to obtain their low-pass and high-pass sub-bands. Then, low-pass sub-bands are fused by sparse

representation based approach, using a clustering-based dictionary learning while high-pass sub-bands are merged using salience match measure rule. Constructing a compact and

90

informative dictionary is an important step toward a successful image fusion technique in sparsity based models. This paper presents efficient dictionary learning method by clustering

patches of several directional sub-bands of different source image in NSCT domain. The experimental results demonstrate effectiveness of the proposed dictionary learning algorithm and priority of general framework, in terms of both subjective and objective evaluation for

image fusion task.

Keywords—Non sub-sampled contourlet; sparse representation; dictionary learning; Multimodal image fusion

A New Pansharpening Method Based On Cartoon+Texture Decomposition

Meysam Lotfi, Hassan Ghassemian Tarbiat Modares University, Tehran, Iran

Abstract

Pansharpening is a fusion of a high resolution panchromatic image and a low resolution multispectral (MS) image to obtain a high resolution MS image. A robust pansharpening

method should increase the spatial resolution while preserving the nature of spectral information. Spectral distortion caused by fusion, could be due to the details injection in

unnecessary pixels and injecting too much details. In this paper, a cartoon+texture decomposition is used to discriminate between necessary and unnecessary pixels to inject details. The piecewise-smooth areas and sharp edges of the cartoon component need less or

no details injection. As a result, the fusion only be done on the texture components. The proposed method is compared with the IAIHS and SFIM methods. Results show it preserves

more spectral features with less spatial distortion. Keywords—Panshaepening; multispectral; spectral distortion; cartoon; texture

Feature Level and Decision Level Fusion in Kernel Sparse Representation based

Classifiers

Tahereh Zare, MohammadTaghi Sadeghi Yazd University Yazd, Iran

Abstract

Sparse Representation based Classifier (SRC) is widely used in a variety of pattern recognition and machine learning tasks. The kernelized version of the classifier (Kernel SRC) attempts to remove the SRC limitations by a nonlinear mapping of the data through kernel

functions. However, the performance of such a method strongly relies on the choice of the kernel function. In this paper, we firstly create composite kernels by combining a set of basis

kernels. This process can be seen as a feature level fusion of the single kernel classifiers. In this step, the basis kernels are linearly combined using different rules. Within the framework of the SRC, in the next step, the reconstruction errors of the resulted classifiers are combined

91

in decision level in order to make the final decision. Our experimental results on different datasets show the merit of the proposed method.

Keywords— Sparse Representation based classiffier (SRC); Kernel Sparse Representation based Classifier (KSRC); Composite Kernel; classifiers fusion.

Hyperspectral Images Classification by Spectral-Spatial Processing

Maryam Imani, Hassan Ghassemian Tarbiat Modares University, Tehran, Iran

Abstract

A spectral-spatial hyperspectral image classification is proposed in this paper. The proposed

method has two main contributions. 1- It removes the useless spatial information such as noise and distortions by applying the proposed smoothing filter. 2- It adds useful spatial

information such as shape and size of objects presented in scene image by applying morphological filters. Moreover, the proposed method copes with the small sample size problem by partitioning the hyperspectral image into several subsets of adjacent bands.

Experimental results show that the proposed method is able to obtain higher classification accuracy compared to some state-of-the-art spectral-spatial classification methods.

Keywords- smoothing filter, morphology, hyperspectral, spectral-spatial classification

92


Supervised speech enhancement using online Group-Sparse Convolutive NMF

Midia Yousefi, Mohammad Hassan Savoji ShahidBeheshti University, Tehran, Iran

Abstract

In supervised speech enhancement methods based on Non-negative Matrix Factorization (NMF), signals are described as linear combinations of dictionary atoms. In order to learn dictionary atoms capable of revealing the hidden structure in speech, long temporal context of

speech signals must be considered. In contrast to the standard NMF, convolutive model has an advantage of finding repeated patterns possessed by many realistic signals. Learning spectro-

temporal atoms spanning several consecutive frames is done through training large volumes of data-sets which places unrealistic demand on computation power and memory. In this paper a new algorithm based on Convolutive NMF is proposed to identify automatically

temporal patterns in speech without the two mentioned obstacles. Online approach is addressed to save memory in processing large data-sets. To tackle the problem of large

computation power, group sparsity constraint is employed. The results of the proposed algorithm show that using online Group-Sparse Convolutive NMF algorithm can significantly increase the enhanced clean speech PESQ.

Index Terms— Convolutive Nonnegative Matrix Factorization, group sparsity, online NMF,

speech enhancement

Study of Speech Features Robustness for Speaker Verification Application in

Noisy Environments

Mohsen Mohammadi, Hamid Reza Sadegh Mohammadi Iranian Research Institute for Electrical Engineering, ACECR, Tehran, Iran

Abstract

This paper presents a comparative study and evaluation of the performances of four speech

feature vectors, i.e., MFCC, IMFCC, LFCC, and PNCC in a speaker verification system based on speaker modeling through the Gaussian mixture model (GMM) under clean and noisy speech conditions. The TIMIT and NOISEX92 dataset were used in implementing the tests

for speech signal and noise, respectively. The evaluation results show that IMFCC and PNCC provide superior performance in the presence of noise. In order to enhance the performance of

the system under noisy conditions, the application of spectral subtraction algorithm as a pre-processing stage was investigated. It only improved the performance for the speech signal contaminated with white noise.

Keywords—SpeakerVerification, speech feature vectors, Gaussian mixture model, noisy

speech

93

Automatic Modulation Classification Using Combination of Wavelet Transform

and GARCH Model

Sara Mihandoost, Mehdi Chehel Amirani University of Urmia, Urmia, Iran,

Abstract Automatic Modulation Classification (AMC) is an important step before demodulation. This process significantly helps to the receiver in recognition which has no, or limited, information of received signals. Nowadays, AMC plays an important role in many applications such as spectrum management, cognitive radio, intelligent modems, surveillance, and interference identification. This paper evaluates the effectiveness of the combination of the Generalized Autoregressive Conditional Heteroscedasticity (GARCH) model with the Discrete Wavelet Transform (DWT) for AMC. In the proposed method, at first, WT is applied on the received data samples. Our exact analysis indicates that the wavelet coefficients have heteroscedasticity property and GARCH model is appropriate to represent them. The parameters of GARCH model are extracted as the features and are applied to the support vector machine (SVM) classifier to determine the modulation type and constellation size simultaneously. We consider six different types of digital modulation schemes including, phase shift keying (PSK) and quadrature amplitude modulated (QAM). The performance of the proposed method in non-fading and fading channels in the presence of Gaussian noise is evaluated. The results indicate the superior performance of the proposed method in comparison with the recently introduced methods.

Keywords— Automatic modulation classification (AMC); GARCH model; PCA; support vector machine (SVM); discrete wavelet transform (DWT).

Inter-Symbol Interference Analysis in Neuro-Synaptic Communications

Abolfazl Amiriy, University of Tehran, Iran

Behrouz Maham

Nazarbayev University, Astana, Kazakhstan

Abstract Neuro-synaptic communication system has a vital role in transporting information in the body

nervous system. This system uses electrical pulses and neurotransmitters as its information carriers and sends them through the body neural network. Some illnesses like seizures,

epilepsy and multiple sclerosis corrupt data transmission by adding extra interference, making it unstable. In this paper, we propose an inter-symbol interference (ISI) model for neuro-synaptic communication system and then, by designing various equalizers, try to compensate

the effect of the ISI in the receiving neuron. The effect of the equalization is compared with the system without the equalizer, and the performance improvement is remarkable. We also

calculate the appropriate sampling time for this system to make external digital systems capable of interconnecting with neuro-synaptic system.

Keywords- Molecular communication, Neuro-spike, Inter symbol interference, Equalizer, Seizures and epilepsy

94


Particle Filter and Mean-Shift Algorithms for Pupil Tracking

Hannaneh Salehifar Islamic Azad University, Rasht, Iran

Asadollad Shahbahrami, Peyman Bayat University of Guilan, Rasht, Iran

Abstract Robust, accurate, real-time pupil tracking is a key component for online gaze estimation. Under some special conditions, such as in the case of eye blinking or eye slightly closed, it is hard to obtain precise pupil parameters by pupil segmentation directly without using the historical information of pupil motion. In this paper, we present a method that tries to track pupil with combination of particle filter and mean-shift. At first we try to segment the eye section using natural image matting, then we look for a pupil on a search window with the knowledge of the shape and the range of the size of pupil. Having around pupil location for the first frame we can initialize mean shift and particle filter. We used alpha matte to make our algorithm robust even for bright pupil tracking compared with most of eye tracking algorithms that only work on dark pupil. For each frame we estimate the location of pupil using particle filter, then we try to find the exact location of pupil by running mean shift on the expected area of pupil. Mean shift try to find the best location that closely meet the previous pupil location in terms of intensity histogram of the area of pupil. Tracking results of particle filtering are the final pupil target parameters. Experimental results demonstrated the effectiveness and feasibility of this method.

Keywords—particle filter; mean-shift; pupil tracking.

Mapping Mel Sub-band Energies Using Deep Belief Network for Robust Speech

Recognition

Mojtaba Gholamipour, Babak Nasersharif K.N. Toosi University of Technology, Tehran, Iran

Abstract

Sub-band speech processing is well-known in robust speech recognition. On the other hand, in recent years, deep neural networks (DNNs) have been widely used in speech recognition for acoustic modeling and also feature extraction and transformation. In this paper, we propose to use deep belief network (DBN) as a post-processing method for de-noising in Mel sub-band level where we enhance logarithm of Mel filter bank energies (LMFBs). In addition, we use DBN for extracting tandem features (posterior probability of phones occurrence) from de-noised LMFBs (obtained from previous stage) to obtain more robust and discriminative features. The final robust feature vector consists of de-noised LMFBs concatenated to mentioned tandem features. Evaluation results on Aurora2 database show that the proposed feature vector performs better than similar and conventional techniques, where it increases recognition accuracy in average by 55.12% in comparison to LMFBs.

Keywords— LMFB; Tandem features; DBN; Robustness; Speech recognition

95

Saliency-guided Wireless Transmission of Still Images Using SoftCast

Hadi Hadizadeh Quchan University of Advanced Technology, Quchan, Iran

Abstract

A novel transmission scheme called SoftCast has recently shown a great potential for wireless transmission of visual signals such as images and videos. In this scheme, the visual input

signal is processed by a set of linear transformations to produce a sequence of decorrelated transform coefficients. After that, the produced numbers are scaled by separate scaling factors

within a power-distortion optimization (PDO) procedure, and the scaled coefficients are then directly transmitted over the channel. The scaling factors are determined by the expected energy of the coefficients such that coefficients with higher expected energy get more

transmission power to get through the noisy channel with lower distortion as compared to coefficients with lower expected energy. Given that, due to the visual attention mechanism of

the human brain, some parts of an image are more visually important (salient) than others, it is reasonable to allocate higher transmission power to more salient regions than others to achieve a high subjective quality. Hence, in this paper we propose to use the visual saliency

information of an image for transmission power allocation in the PDO process of SoftCast. Using an eye-tracking-weighted peak-signal-to-noise ratio (EWPSNR) measure of subjective

quality, our experimental results indicate that at the same channel signal-to-noise ratio (CSNR), the proposed method outperforms the original SoftCast scheme with an average EWPSNR of about 2 dB.

Clipping Noise Estimation in Uniform Tone Reservation Scenario Using OMP

Algorithm

Mohammad Javad Azizipour, Kamal Mohamed-pour Faculty of Electrical Engineering, K. N. Toosi University of Technology, Tehran, Iran

Abstract

In this paper, the clipping noise estimation problem based on compressed sensing (CS) is

investigated when the subcarriers used for creating measurement vector are on the edge of the frequency band. Although selection of such subcarriers would not degrade data rate and is suitable for systems requiring high rates, it still weakens the performance of CS recovery

algorithms especially in the presence of noise. To address this issue, a new approach based on the orthogonal matching pursuit (OMP) algorithm is proposed for improving the clipping

noise estimation. Simulation results indicate that in the chosen scenario under unfavorable conditions, the proposed algorithm is still able to estimate clipping noise and according to its structure, only slightly increases the complexity of the original OMP algorithm.

Index Terms—OFDM, Clipping noise estimation, Compressed sensing, Orthogonal

matching pursuit, Uniform tone reservation.

96

Direction of Arrival Accuracy Improvement in Nonhomogeneous Environments

Atefeh Gholipour Ferdowsi University of Mashhad, Mashhad, Iran

Bijan Zakeri Babol Noshirvani University of Technology, Babol, Iran

Khalil Mafinezhad Ferdowsi University of Mashhad, Mashhad, Iran

Abstract

Performance of direction of arrival (DOA) estimation is significantly degraded in practical situations. One of the conditions that decreases its performance, is the coherent loss caused by

the propagation of the wavefront through random nonhomogeneous media. Most of the previous methods, such as matrix fitting method and covariance matching technique, need the

multidimensional search; therefore their computations are difficult and not suitable for a real time application. In this paper, a three-stage method based on the generalized eigenvalues utilizing signal subspace eigenvectors (GEESE) and Gauss-Newton (GN) algorithms, is

presented. Simulation results show that the proposed method, which is independent of the

coherent loss, has less err Asadpour or than matrix fitting method and covariance matching

technique. Furthermore the computation burden of the simulation is very less than two previous works.

Keywords— Direction-of-arrival estimation; imperfect spatial coherence; multiplicative noise; Nonhomogeneous media

97

Poster: Signal Processing in Communications

Game Theory Modeling of MIMO Radar and ARM Missile Engagement

Neda Henareh, Yaser Norouzi Amirkabir University of Technology, Tehran, Iran

Abstract

Abstract-- In this paper, Multi Input-Multi-Output (MIMO) radar and Anti-Radiation Missiles (ARMs) engagement is modeled using game theory. In this game, each player (radars and

missiles) tries to maximize his payoff in Nash equilibrium point. In this paper, for simplification and better understanding, simplified model of 2 radars and 2 missiles engagement in three time steps is investigated at first, In which, it is assumed that radars are

not turned on and off simultaneously, and the missiles do not attack the same radar at the same time. Then, model of 2 radars and 2 missiles engagement in three time steps with

elimination of aforementioned assumptions is considered, and the simulation results are provided and investigated. Finally, the general form of MIMO Radar and ARM Missiles engagement modeling (r number of radars and m number of missiles) in n time steps, using

game theory is investigated and discussed. In this general form investigation, the influence of time step enhancement, radar enhancement, and missile enhancement on the modelling is

addressed, separately. In this paper, MATLAB software is utilized for the system modeling and simulation.

99

Software Defined Networks

101

Software Defined Networks

QRVE: QoS-Aware Routing and Energy-Efficient VM Placement for Software-

Defined DataCenter Networks

Pooyan Habibi, Masoud Mokhtari, Masoud Sabaei Amirkabir University of Technology (Tehran Polytechnic)

Abstract

Today’s cloud computing Data Centers (DCs) contain tens of thousands of servers with highly significant and remarkable bandwidth requirements as the demands of cloud

computing applications, social applications, multimedia contents, and data intensive analysis are dramatically rising. Even thus, current DC technologies have following problems. First, power consumption of a Data Center Network (DCN) are constant irrespective of the use of

network resources. Second, violation of the users’ SLA according to a static routing technique, a few links in the DCNs are experiencing congestion while other majority links are

being underutilized. Third, VM placement and VM problems are essential in datacenter because current server hardware capacities are more than the requirements of the demands from users. To overcome these limitations of the current DCNs, we proposed a distributed

Software Defined Networking (SDN) -based mechanism, which consists of energy efficient VM placement and QoS Aware routing with elephant flow detection scheme. our mechanism

reduces power consumption of the DCN by turning off/on links, switches and servers. To satisfy user experienced in terms of users’ QoS and decreased network congestion, QRVE distributes traffics using traffic aware multipath routing scheme which recognizes elephant

flows at the edge layer (Access Layer) across DCN. Keywords-Software-Defined Networks (SDN); Cloud Computing; Data Center (DC); Data

Center Networks (DCN); Quality of Service (QoS); Multipath Routing; Energy Efficiency; VM Placement; VM Migration; Elephant Flow Detection

QRTP:QoS-Aware Resource Reallocation Based on Traffic Prediction in

Software Defined Cloud Networks

Mohammad Mahdi Tajiki, Behzad Akbari, Nader Mokari Tarbiat Modares Universit, Tehran, Iran

Abstract

The complexity of network routing infrastructures is increased dramatically. To tackle this

issue, a promising state-of-the-art paradigm called software defined networking (SDN) is introduced. Due to the differences in the network requirements of applications, QoS-aware routing plays an important role in the networks. Recent proposed resource allocation

algorithms focus on the current traffic matrix which is not applicable for dynamic networks (e.g., over-the-top services). In this paper, we exploit an estimation of flow matrix which

102

gives our scheme the ability to sufficiently reduce the total packet loss and simultaneously rises the network throughput. In this way, we mathematically formulate the QoS-aware

resource allocation in software defined cloud networks using traffic prediction. The corresponding optimization problem is to minimize the maximum link utilization subject to delay, bandwidth, and flow conservations. To solve this optimization problem, two schemes

are proposed: 1) exact solution and 2) fast suboptimal one. In the simulation, we first compare the two proposed schemes from accuracy and optimization time perspective. Moreover, the

impact of prediction on resource allocation is discussed. In this way, it is shown that in the existence of burst traffic, our proposed scheme which exploits traffic estimation, decreases the total packet loss, more than 20 percent in compare with conventional approaches. Moreover,

the total throughput increases 30 percent. The experimental results show that relaxed solution is a good approximation of optimal solution in all test cases while the optimization time of

approximate algorithm is superior to the original one. Keywords—QoS; Resource Reallocation; Traffic Engineering; SDN

Detecting malicious packet drops and misroutings using Header Space Analysis

Amir Ahmad Mohammadi Sharif University of Technology, Tehran, Iran

Peyman Kazemian Stanford University and Forward Networks, USA

Mohammad Reza Pakravan Sharif University of Technology, Tehran, Iran

Abstract

Software Defined Networking (SDN) provides a logically centralized view of the state of the network, and as a result opens up new ways to manage and monitor networks. In this paper

we introduce a novel approach to network intrusion detection in SDNs that takes advantage of these attributes. Our approach can detect compromised routers that produce faulty messages, copy or steal traffic or maliciously drop certain types of packets. To identify these attacks and

the affected switches, we correlate the forwarding state of network---i.e. installed forwarding rules---with the forwarding status of packets---i.e. the actual route packets take in the network

and detect anomaly in routes. Thus, our approach turns the network itself into a big intrusion detection system. We have evaluated our approach on topologies from real networks by developing an application over OpenDaylight SDN controller and detected simulated

dropping and duplicating attacks in these networks.

103

Social Networks

105

Social Networks

A Comprehensive Analysis of Tweet Content and Its Impact on Popularity

Mohammad Mahdavi, Masoud Asadpour, Seyed Morteza Ghavami University of Tehran, Iran, Tehran

Abstract

By the appearance of the online social networks, ordinary people have gained more chance to

make and publish content. However, for audiences, as the number of these shared contents grows, the importance of detecting important and related ones increases. So, a significant question is how much would a shared content become popular among audiences, regardless of

the source of content? In this paper, we investigate this question by performing a comprehensive analysis of tweet

content and studying its impact on popularity of tweet. Here, the number of retweets of tweet is used as a popularity measure. We show that tweets with "social" content, have in general more chance of popularity due to their attraction for society. In contrast, tweets with

"individual" content, have little chance to get popular. We collect a fair data set of tweets. In order to do more detailed investigation and access the semantic features, we set an annotation

and labeling process. We analyze the informativeness of content-based features and use them to train predictive models. The results clearly show the importance of content-based features. They specifically support this idea that specifying whether a tweet is speaking about an

individual or social subject, is the most informative content-based feature to predict the popularity i.e. the number of retweets.

Keywords- Online Social Network, Twitter, Tweet Content, Popularity Detection, Retweet Prediction.

Opinion Influence Network Identification, using Convex Programming

S.M. Nematollahzadeh, S. Ozgoli Iran Telecommunication Research Centre,

M. Sojoodi Tarbiat Modares University, Tehran, Iran

Abstract

Recently, significant attention has been dedicated to the models of opinion dynamics in which

opinions are described by real numbers, and agents update their opinions synchronously by taking average of their neighbors’ opinions. One notable example in this setting is the

DeGroot model, which studies in a fixed network, concerning how consensus is formed when individual opinions are updated using the average of the neighbors. One of the most important problems in systems sociology is to use these data to identify the interaction pattern between

individuals in a regulatory network, especially in large scale. The authors use a novel algorithm to identify the network that explains agents' perturbation experimental data. The

106

identification algorithm is able to incorporate and respect a prior knowledge about the network structure. The method is based on a convex programming minimization. In this

paper, the proposed method is applied on the dynamic identification of some small networks of

several artificial experiments, for evaluating the performance of the method. In this way, we encountered with

some lateral problems and introduced solution for them.

Keywords- convex optimization, Identification algorithms, opinion influence, social network.

An agent based positional model for opinion formation in social networks

Sajjad Salehi, Fattaneh Taghiyareh University of Tehran, Tehran, Iran

Abstract

Opinion leaders are individuals who have high confidence about their opinions and high ability to impact on opinion of other individuals named followers. In this paper we are going

to introduce an agent based opinion formation model considering the leadership ability of social members. This ability is defined based on the position of agents in social structure. So each agent has a social status considering leadership ability. In our proposed model opinion of

each agent can be modified based on the opinion of agents with higher status. By applying this model on two complete and scale free graphs, we have investigated the effect of opinion

leader in opinion formation process. The results of our work can be applicable in competitive environments that different parties try to change the social opinion.

Keywords - opinion formation, social network, leader, follower, agent

On the Modularity Improvement for Community Detection in Overlapping Social

Networks

Samaneh Ghaderi, Alireza Abdollahpouri, Parham Moradi University of Kurdistan, Sanandaj, Iran

Abstract

In recent years, community detection in overlapping weighted network became a research challenge. In real networks, a node can belong to two or more communities. Therefore, in this paper, we aim to address the above-mentioned problem by proposing a method to improve the

modularity in overlapping weighted networks. The proposed method is based on optimizing a fitness function and fuzzy belonging degree of nodes. Experimental results on real networks,

confirm a significant improvement of modularity in comparison with a similar algorithm. Keywords- community detection; modularity; weighted network; overlapping

107

Posters: Social Networks

Centrality Measures Analysis in Overlapped Communities: An Empirical Study

Zahra Ebadi Abouzar, Leila Esmaeili, Alireza Hashemi Golpayegani Amirkabir University of Technology, Tehran, Iran

Abstract

Community detection is one of the important issues in social networks analysis. Community detection algorithms identify distinct or overlapped communities and include different

methods. In this article we use clique percolation method (CPM) as an overlapping community detection method for analysis of six datasets. The goal of our study is to survey

the effect of centrality measures on detected overlapped communities by using Clique Percolation Method. The results indicate that in all datasets the nodes which have greater betweenness and degree centralities than average betweenness and degree centralities of

whole network and have lower closeness centrality than average closeness centrality of whole network have potential of being overlapping nodes. But CPM finds overlapped nodes in lower

time than centrality measures. Overlapped nodes are effective nodes for propagation and word of mouth, therefore they can be detected with lower cost.

Keywords- Clique Percolation Method, Overlapping Community Detection, Centrality Measures, Gephi

Improving a recommender system by combining collective matrix factorization

and topic modeling

Mahdi Vajdi, Milad Azizpour Shirsavar, Nasser Yazdani University of Tehran, Tehran, Iran.

Abstract

Recommender systems improve the ability of customers to make their choices more easily. They play a big role in almost all realms that attempt to deliver products to customers.

Recently, extra information such as personal information, connections, previous selections and product information are used to improve system's output. While this information can be

found in heterogeneous relations as well. Collaborative filtering-based methods are considered among others like matrix factorization and graph-based methods which improvely the significant performance.

In this paper, we offer a hybrid solution in which side information is properly used in heterogeneous networks. By analyzing users' reviews and discovering hidden relationships

along with topic modeling techniques, we extract users' features and items of interest while using matrix factorization on all relationships, to predict users' preferences. The proposed hybrid method is applied on the Yelp database. The results show 7.1 percent improvement.

Keywords— Recommender system; User reviews; Topic modeling; Collective matrix factorization

109

Microwave, Millimeter Wave

and Terahertz Wireless

Components

111

Microwave, Millimeter Wave and Terahertz Wireless Components

Travelling-Wave Ka-band Frequency Scanning Antennas For Millimeter-wave

Imaging Applications

Mohammadreza Ranjbar Naeini, Mohammad Fakharzadeh, Forouhar Farzaneh Sharif University of Technology, Tehran,Iran

Abstract

In this paper, a novel travelling-wave printed Frequency Scanning Antenna (FSA), which can be used for imaging purposes, is proposed. All sample designs scan the space symmetrically

about the broadside direction. For different scanning ranges, two low profile antennas are designed on a 6.6 mils thick Rogers 4350 board substrate layer. Impedance bandwidth of the

first one covers 6.5GHz, from 29.5GHz to 36GHz, and this antenna scans 56o in angular space. The second antenna has 5.6GHz bandwidth from 30.6GHz to 36.2GHz, and scans 98o in angular space by means of switching the input port. The average gain and the Side-lobe

level (SLL) of the first and the second antennas are 11.46dBi, 12.8dB, and 10.5dBi, 12.5dB, respectively.

Keywords- Travelling-wave Antenna, Frequency Scanning Antenna, mm-wave, Imaging, Beam Scanning.

Development of a Forward-Wave Directional Coupler Loaded with a Periodic

Shunt Structure

Zahra Sadat Tabatabaeian, Mohammad Hassan Neshati Ferdowsi University of Mashhad, Iran

Abstract

The current paper presents a wideband forward-wave directional coupler. Periodic shunt

structure is employed to design the proposed coupler. Using even- and odd-mode analysis, it is shown that even- and odd-mode characteristic impedances are equal over a wide frequency range. Moreover, an almost constant phase difference between the even and odd modes at this

frequency range is obtained. The introduced coupler is numerically investigated by commercial software. A prototype of the coupler is made using a single layer substrate and it

is successfully tested. The measured results agree well with those obtained by simulation. It is shown that the measured coupling is 0.35 dB with 1 dB flatness over broadband frequency range from 4.36 GHz up to 12.43 GHz corresponding to 96% fractional bandwidth.

Keywords—Forward-wave directional coupler; periodic structures; even/odd modes

112

A Compact 0.18-μm CMOS 5-Bit Phase-Shifter MMIC for X-Band application

Mina Amiri, Mohammad Moghaddam, Nasser Masoumi University of Tehran, Tehran, Iran

Abstract

The design of a compact X-band MMIC phase shifter in 0.18-µm technology is presented in this article. In this design a different topology for 180 degree phase shift causes the reduction of the series switches and improves NF, gain and size. A conventional embedded switch filter

circuit is also used for other stages of phase shifter’s circuit. With this structure 32 state phase shift with high accuracy is achieved. Simulation results of the proposed phase shifter at 9.3

GHz demonstrate 1.2 dB rms insertion loss deviation and 1 degree rms phase error. Insertion loss of this phase shifter is in 14-15.5 dB range for the 1.4 GHz frequency band.

Keywords— Monolithic microwave integrated circuit (MMIC) ; phase shifters; X-band; switch filter

Design of a Wideband Low Noise Amplifier using Modified Cascode Structure

for 45GHz Band Applications

Mehran Nazari, Javad Yavand Hassani, Reza Rezaei Siahrood, Alireza Farahani Science and Technology (IUST), Tehran, Iran

Abstract

In this paper a low noise amplifier (LNA) with modified cascode structure in 45 GHz frequency band is presented. The LNA has been designed using TSMC 0.18 um RF-CMOS Technology The modified cascode structure is used to increase maximum stable gain (MSG),

reduce noise figure and improve stability. In order to achieve wideband matching, band pass networks are used for input and output matching. This two stage LNA has 8 dB small signal

gain and 4.8 dB noise figure in 45 GHz and the 3dB bandwidth is 20 GHz with insertion loss lower than -10 dB in all of the bandwidth. The supply voltage is 1.8 V and the consumed power is 11.2 mW. This LNA has better noise figure and bandwidth in comparison with the

similar reported works.

Keywords— low noise amplifier, cascode, wideband, MSG.

113

Design of a TEM Cell Using Both Multi -Step and Piecewise Linear Tapering

Masoud Arezoomand, ICT Research Institute (ITRC), Tehran, Iran

Mohsen Kalantari Meybodi ICT Research Institute (ITRC), Tehran, Iran

Shahid Beheshti University, Tehran, Iran

Narges Noori ICT Research Institute (ITRC), Tehran, Iran

Abstract

The transverse electromagnetic (TEM) cell is used for electromagnetic interference/compatibility (EMI/EMC) tests of the small RF devices in a laboratory environment. The standard electromagnetic (EM) fields created in the shielded environment of a TEM cell can also be used for calibration of the EM field probes. In this paper, a 50 open TEM cell is designed to generate standard EM fields from 1 MHz up to 1 GHz. The inner conductor of the cell is tapered using two new methods named as multi-step and piecewise linear tapering to adapt to the standard coaxial connectors and achieve a good matching. The resulted matching conditions of these new methods are compared through some simulations to those of the conventional simple linear tapering.

Keywords- TEM Cell design, EMI/EMC tests, calibration of RF field probes.

A Novel Ridge-Gap-Waveguide Slow-Wave Structure for G-Band Travelling-

Wave Tube

Esmaeel Tahanian, Gholamreza Dadashzadeh Shahed university, Tehran, Iran

Abstract In this paper, a novel grating ridge-gap-waveguide (RGW) slow wave structure (SWS) for G-band travelling wave tube is presented. Ease of fabrication, because of no need to metal contact between the upper and lower plates, is one of the most important advantages of this kind of SWS. In addition, this structure has the potential to have higher interaction impedance than the conventional grating amplifiers, due to more uniform axial electric field distribution over the sheet beam cross section. Moreover, the most of higher harmonic modes and backward waves, within the stop band of the RGW, can be considerably suppressed. The high frequency characteristics of the proposed SWS, such as phase velocity and interaction impedance, are calculated by the help of CST software. Furthermore, the PIC simulation has been performed by using CST particle studio to predict the interaction between sheet beam and electromagnetic waves. Our study shows that the proposed TWT can generate the peak power of 149W at 220 GHz, corresponding to the maximum gain and efficiency of 41.7dB and 2.6%, respectively.

Index Terms—G-band, grating amplifier, ridge gap waveguide (RGW), slow wave structure (SWS), travelling wave tube (TWT).

https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0ahUKEwjr64TV8ojMAhXK1xQKHd_cCUwQFggcMAA&url=http%3A%2F%2Fppmtest.com%2Fproduct-category%2Fe-field-sensors%2F&usg=AFQjCNHZf6aJtm9Vg1p26XaN0lk9ksNOgA&bvm=bv.119028448,d.bGs

https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0ahUKEwjr64TV8ojMAhXK1xQKHd_cCUwQFggcMAA&url=http%3A%2F%2Fppmtest.com%2Fproduct-category%2Fe-field-sensors%2F&usg=AFQjCNHZf6aJtm9Vg1p26XaN0lk9ksNOgA&bvm=bv.119028448,d.bGs

114

Poster: Microwave, Millimeter Wave and Terahertz Wireless Components

A Low power UWB CMOS Low Noise Amplifier for 3.1-10.6 GHz in Receivers

Amir Mahdavi, Fatemeh Geran Shahid Rajaee Teacher Training University, Tehran, Iran

Abstract

An ultra-wideband (UWB) low noise amplifier (LNA) with low power is presented in this paper. The proposed circuit is common gate and cascode topology that the power consumption, input and output impedance matching are optimized. Simulation results show

that maximum gain and noise figure are 22.1dB and 2.4-2.9dB over a 3.1–10.6 GHz, respectively. Power consumption of the LNA core, buffer power and IIP3 are 7.7mW, 1.3

mW with 1.8 V supply and -9dBm respectively. The wideband input impedance matching of LNA is obtained by employing a degenerating inductor (|S11|<-7.5 dB). The circuit proposed UWB LNA is implemented using 0.18 μm based CMOS technology under TSMC.

Keywords — Low noise amplifier, Low power, Noise figure.

115

ICT Development Strategies

and Regulatory

&

Internet of Things

& Internet Related Technologies

and Communication Services

117

ICT Development Strategies and Regulatory & Internet ofThings

& Internet Related Technologies and CommunicationServices

Designing E-Services in Rural and Least Developed Areas Using Technology

Road Mapping

Nasrin Dastranj, Tahereh Mirsaeed Ghazi, Masoomeh Sadeghi, Kolsoom Abbasi, Sogol

Babazadeh, Molood Arman, Maryam Gharaee, Mahmood kharrat ICT Research Institute (ex. Iran Telecommunication Research Center)

Abstract Along with the development of communication infrastructures and providing access all over the country, it's necessary to initiate a comprehensive plan in collaboration with public and private sectors in order to develop e-services in rural and least developed areas. In this research1, a roadmap for planning and developing e-services in rural and least developed areas is designed to provide a platform for stakeholders' participation of all sectors, specially the private sector and also to provide access to high quality and effective services. The approach used in this research is technology road mapping (TRM) for 5-year time horizon. In this roadmap, e-services have been defined through interaction with stakeholders of each different categories of services including agriculture, education, health, finance and banking, tourism, public facilities, employment and entrepreneurship, registration, environment, police and judiciary in order to plan for providing and implementing them. It is shown that using technology roadmap approach maintains the integrity and consistency in designed services as well as providing flexibility in the service management.

Keywords—e-services; technology roadmap; rural and least developed areas

A new approach to designing a roadmap: A case study for e- services with respect

to rural and lessdeveloped regions in Iran

Molood Arman, Mahmood Kharrat ICT Research Institut, Tehran, Iran

Abstract Roadmapping is flexible and powerful technique for long-term planning and decision-making. In this paper, the importance of roadmap is depending on knowledge generation during the development of the roadmap and creating common and similar understanding about discussed concepts among roadmap’s designers. In this paper, Roadmap is considered as a management tool that its lifecycle is matched with knowledge management and innovation management lifecycles. In this paper, it has shown that using the roadmap in an organizational Planning can provide the simultaneous capability of knowledge management and innovation management in order to develop a plan or program in an organization.

Keywords—Knowledge Management, Roadmap, Roadmapping, Enterprise Architecture

1 This research is funded by ICT Research Institute (ITRC) as a part of a national project with the code 9332114 (2015- 2016).

118

Framework, Innovation Management, USO

An Optimized Bandwidth Allocation in Broadband Digital Economy

Leila Mansourifar Research Institute for ICT (ITRC), Tehran, Iran

Nasser Mozayani Iran University of Science & Technology (IUST), Tehran, Iran

Mohsen Pazari Research Institute for ICT (ITRC), Tehran, Iran

Abstract Efficient and optimized data transfer in broadband is the anchor point of digital economy in modern era. One the most challenging issues for providing different services in broadband is the bandwidth allocation. That is a real-time multi dimensional problem solving requiring to satisfy QOS and SLA constraints at the same time. In this paper, we present a real-time adaptive framework for the problem of optimal bandwidth allocation to broadband services in Iran. Our approach for the allocation is based on Network Utility Maximization. In this way, the optimal bandwidth is the one which maximizes network users’ utility. For this purpose, the bandwidth is dynamically allocated to the services with highest importance for the user (according to the SLA) and the remaining bandwidth is most appropriately allocated to the less important services. Each service has its own (non-linear) utility function which is considered in each allocation cycle. The utility values are calculated in real-time and the bandwidth allocation pattern which maximizes the total users’ utilities is selected. Simulation results showed satisfactory bandwidth allocation patterns in different scenarios according to the network utility and user preferences in SLA.

Keywords-component; Digital Economy, Network Utility Maximization (NUM); Network traffic Categories; Bandwidth Allocation; QoS; Broadband Services

A Hybrid Intrusion Detection Architecture for Internet of Things

Mansour Sheikhan, Hamid Bostani Islamic Azad University, South Tehran Branch, Tehran, Iran

Abstract

In computer networks, Internet of things (IoT) is an emerging paradigm wherein smart and resource-constrained objects can connect to Internet by using a wide range of technologies. Due to the insecure nature of Internet and also wireless sensor networks (WSNs), which are

the main components of IoT, implementing security mechanisms in IoT seems necessary. To deal with intrusions which may occur in IoT, a novel intrusion detection architecture model

for IoT is proposed in this paper. This model is based on MapReduce approach with the aim of distributed detection. To provide multi-faceted detection (from the Internet and WSNs sides), the proposed model consists of anomaly-based and misuse-based intrusion detection

agents that use supervised and unsupervised optimum-path forest model for intrusion detection. The experimental results of simulated scenarios show the superior performance of

proposed method in intrusion detection for IoT.

119

Keywords—Internet of things; intrusion detection; optimum path forest; anomaly detection

Analyzing the effect of game-elements in e-Learning environments through

MBTI-based personalization

Negar Shabihi, Fattaneh Taghiyareh, Mohammad Hossein Abdoli Electrical and Computer Engineering department, University of Tehran, Tehran, Iran

Abstract

Previous studies indicate that using adaptive learning as well as game techniques enhances

learning process and has significant impact on learning outcomes and motivation of learners. There are plenty of game-elements which can be used in an educational game, but the effect of them may vary due to differences in personality types of learners. The purpose of this

paper is to investigate the impact of various game-elements on learning outcomes. We have focused on personalization of game-elements based on learner’s personality types which can

improve the learning process. For the purpose of our study, an educational game (Rememry) has been developed which is an online vocabulary learning game. The game contains a non-adaptive mode and also an in-game adaptive mode that assigns game-elements due to

learner’s personality type. The results represented a significant difference between engagement levels of two modes; in addition, learning outcomes were better for the adaptive

mode. Besides, in this paper the sensitivity analysis of various personality dimensions relative to the game-elements have been determined and presented in a corresponding table. This paper presents the prominent and influential elements for each of personality types. The

results of this paper can be used to improve effectiveness of using game-elements in designing learning environments.

Keywords—Game-based learning; Game-element; Adaptive learning; Personalization; MBTI; Personality

Domain Specific Ontology Enrichment Using Public Knowledge Resources

Maedeh Mosharraf, Fattaneh Taghiyareh University of Tehran, Tehran, Iran

Abstract

Semantic web technology can influence the next generation of eLearning systems and applications. Ontology as a major component of semantic web can be used in creating meta-

data for eLearning resources to improve adaptive eLearning systems. This paper presents an approach to automatically enrich eLearning domain ontology based on the integration of graph clustering techniques and external knowledge resources. The semantic similarity of

concepts which is measured using the words hierarchy of WordNet combined with relations of concepts extracted from the Wikipedia graph is applied to link the new eLearning concepts

to the domain ontology. The generated ontology as an integrated knowledge of eLearning domain can be used to model educational activities and to build, organize, and update specific

120

learning resources. Explicit representation of eLearning concepts leads to uniform tagging of these resources and improves the results of web services in this domain.

Keywords—ontology enrichment; eLearning; knwoledge resourses; graph clustering; Wikipedia; WordNet

121

Posters: ICT Development Strategies and Regulatory

& Internet ofThings & Internet Related Technologies and CommunicationServices

Personalization of Gamification-elements in an E-Learning Environment based

on Learners’ Motivation Fatemeh Roosta, Fattaneh Taghiyareh, Maedeh Mosharraf University of Tehran, Tehran, Iran

Abstract

Gamified systems benefit from various gamification-elements to motivate users and encourage them to persist in their quests towards a goal. This paper proposes a categorization of gamification-elements and learners’ motivation type to enrich a learning management

system with the advantages of personalization and gamification. This categorization uses the learners’ motivation type to assign gamification-elements in learning environments. To find

out the probable relations between gamification-elements and learners’ motivation type, a field-research is done to measure learners’ motivation along with their interests in gamification-elements. Based on the results of this survey, all the gamification-elements are

categorized according to related motivation types, which form our proposed categorization. To investigate the effects of this personalization approach, a gamified learning management

system is prepared. Our implemented system is evaluated in Technical English course at University of Tehran. Our experimental results on the average participation rate show the effectiveness of the personalization approach on the learners’ motivation. Based on the paper

findings, we suggest an integrated categorization of gamification-elements and learners’ motivation type, which can further enhance the learners’ motivation through personalization.

Keywords—motivation; gamification-elements; gamification; personalization

Similarity based Automatic Web Search Engine Evaluation

Farzaneh Shoeleh, Masoumeh Azimzadeh, Akbar Mirzaei, Mojgan Farhoodi Iran Telecommunication Research Center, Tehran, Iran

Abstract Nowadays, as the usage of Internet has incredibly increased, web search engines become the

common approach to find and retrieve needed information. Hence, evaluating search engine quality is a hot topic which attracts many researches’ attention. In this paper, we propose a

framework named Similarity based Automatic Web Search Engine Evaluation, SAWSEE, to evaluate web search engines. SAWSEE measures the information retrieval effectiveness of web search engines by comparing and voting their returned results, particularly using nDCG

metric to rank search engines. SAWSEE compares the search engines’ results based on their similarity which is calculated in two consecutive levels, the web page address level and the

main content of web page level. To find the similarity of the main content of two search

122

engines’ results, SAWSEE utilizes Winnowing algorithm, a well-known and widely-used plagiarism detection method. We compared our method with the results acquired from human

assessors’ evaluations. The promising comparison shows that SAWSEE provides rankings that are consistent with the rankings resulted from human assessors’ evaluations. Hence, the proposed method can be applied in real world environments for evaluation of web search

engines.

Keywords— Web Quality Assessment, Web Retrieval & Content Analysis

123

Cloud Networks &

Communications

125

Cloud Networks & Communications

A Multi-Dimensional Fairness Combinatorial Double-Sided Auction Model in

Cloud Environment

Reihaneh Hassanzadeh, Ali Movaghar Sharif University of Technology, Tehran, Iran

Hamid Reza Hassanzadeh Georgia Institute of Technology, USA, Georgia 30332

Abstract In cloud investment markets, consumers are looking for the lowest cost and a desirable fairness while providers are looking for strategies to achieve the highest possible profit and

return. Most existing models for auction-based resource allocation in cloud environments only consider the overall profit increase and ignore the profit of each participant individually or the

difference between the rich and the poor participants. This paper proposes a multi-dimensional fairness combinatorial double auction (MDFCDA) model which strikes a balance between the revenue and the fairness among participants. We solve a winner determination

problem (WDP) through integer programming which incorporates the fairness attribute based on the history of participants which is stored in a repository. Our evaluation results show that

the proposed model increases the willingness of participants to take part in the next auction rounds. Moreover the average percentage of resources utilization is increased.

Index Terms—Resource allocation, Cloud Computing, Auction,Fairness

SDN-based Scheduling Strategy on Load Balancing of Virtual Sensor Resources

in Sensor-Cloud

Fatemeh Banaie, Mohammad Hossein Yaghmaee, Seyed Amin Hosseini Ferdowsi University of Mashhad, Mashhad, Iran

Abstract

Sensor-cloud has recently emerged as a promising technology that provides sensor management approaches and facilitates sensor data sharing by virtualizing the physical

sensors on a cloud platform. This framework is a new trend to deploy and execute various smart applications with rapidly changing in the amount of traffic loads. Therefore, it is essential to provide a platform to meet demand variation, while ensuring a given QoS. In this

paper, we present a scheduling strategy on load balancing of virtual sensor resources based on Software Defined Networking (SDN). To do that, we propose to model system using queuing

model with variable number of virtual sensor instances. Experimental results prove that this method is able to realize load balancing and reasonable resources utilization both in stable and variant system load.

Keywords—Sensor-cloud; Virtualizing; Scheduling; Software Defined Networking (SDN);

Resource utilization

126

Mobile Cloud Computing: A Multisite Computation Offloading

Mohammad Goudarzi, Zeinab Movahedi, Masoud Nazari Iran University of Science and Technology (IUST), Tehran, Iran

Abstract

Mobile cloud computing is a promising approach to overcome limitations of mobile devices in terms of battery consumption and capability to execute computation-intensive applications.

It consists in outsourcing some parts of computation-intensive applications to cloud servers, so that the overall energy consumption and execution time of application's running are optimized. In addition to classical public/private clouds, computations can also be offloaded

to nearby clouds, called cloudlets, which may have different access delays, proximity to end users, computation capability and/or monetary cost. In such a heterogeneous context, the

offloading decision becomes very complicated and time-consuming, especially when the number of surrogate sites and application units increase. In this paper, we propose a multisite offloading solution which uses the genetic algorithm to timely achieve the best-possible

offloading outcome in a heterogeneous multisite context. Simulation results demonstrated that our proposal can outperform other existing multisite alternatives for different number of

surrogate sites and various application sizes. Keywords—Mobile Cloud Computing; Computation Offloading; Multisite; Near Optimal

Partitioning

Multi Objective Consolidation of Virtual Machines for Green Computing in

Cloud Data Centers

Ehsan Arianyan Iran telecommunication Research Center (ITRC), Tehran, Iran

Abstract

Cloud computing has emerged as a novel service delivery model for information and

communication technology domains. Vast amount of Cloud users along with rapid demand increase for acquiring Cloud resources have resulted in emergence of huge energy hungry data centers in different geographical locations. One of the major concerns of Cloud providers

is energy saving to reduce electricity bills as well as to respond to legal pressures on reducing CO2 emissions. In this direction, consolidation is proposed as a novel technique for energy

saving in Cloud data centers. One of the major drawbacks of current studies on consolidation solution is that they focus only on one criterion and ignore other ones. However, this study proposes a novel multi objective consolidation solution based on a modified analytic

hierarchy process (AHP) technique which considers three objectives including energy consumption, SLA violation, and number of migrations in decision process. The results of

simulations using Cloudsim simulator shows up to 34.2%, 98.58%, and 71.29% reductions in energy consumption, SLA violation, and number of VM migrations, respectively, in comparison with state of the arts.

Keywords— Cloud computing; Consolidation; Data center; Energy consumption

127

Assignment Look-ahead HEFT for Scheduling Workflows of Communicating

Tasks

Elham Dolkhani, Hamid Abrishami, Amin Rezaeian, Mahmoud Naghibzadeh Ferdowsi University of Mashhad, Mashhad, Iran

Abstract

Scheduling scientific workflows of communicating tasks is the process of mapping tasks of the workflow to the cloud resources and directly or indirectly determining when to execute

each task. Different objectives such as minimizing the makespan or price to be paid to the cloud provider, and respecting privacy are considered by different schedulers. Heterogeneous Earliest Finish Time (HEFT) was first designed to schedule communicating dependent set of

tasks represented as a directed acyclic graph, on heterogeneous distributed systems. Because of its good performance in reducing makespan of running workflows, it is now widely used

on the Grid and especially on the cloud. Based on HEFT, in this study, a static scheduling algorithm is designed to schedule scientific workflows on the cloud with the objective of improving HEFT’s performance with respect to the makespan criterion. With HEFT, when a

task is ready to be scheduled, the resource that can complete it the earliest is selected. With the proposed method, when a task is ready for execution we assume that it is assigned to all

leased resources to be executed. Then k more tasks from the priority queue of ready tasks are hypothetically scheduled with HEFT and whichever resource finishes the job the earliest is selected as the resource to run the task which we started with. The time complexity of the

developed algorithm ant its impact on the reduction of makespan of a number of real workflows are reported.

Index Terms— Workflow scheduling, assignment look-ahead HEFT, Cloud computing, communicating dependent tasks

129

Network Science and

Technologies

131

Network Science & Technologies

A New Similarity Measure for Link Prediction in Heterogeneous Complex

Networks

Hadi Shakibian, Nasrollah Moghadam Charakri Tarbiat Modares University, Tehran, Iran

Abstract

In this paper, we propose a new similarity measure for link prediction in heterogeneous complex networks. Firstly, a degree sequence is extracted for each node pair following a given meta-path. Then, the entropy of degree sequence is measured as the link likelihood. The

proposed similarity measure has been evaluated using DBLP network data and compared with its popular counterparts. The results show that it obtains high prediction accuracy with a low

computational cost Keywords—Heterogeneous Complex Networks, Link Prediction

Predicting election outcomes based on voters’ weighted networks Mohammad Khansari, Mojtaba Sadeghian, Farid Dehgan University Of Tehran, Tehran, Iran

Abstract Researchers study election process from different approaches to predict results or analyze social behavior of voters. We propose a model based on the network science to model voters’

mutual opinions similarity. To model voters’ opinions, weighted networks (agreement and disagreement) are built from voters’ previous votes. Connections in these networks shows

score of individuals’ opinions similarities. Applying community detection algorithms help us to have high-level view of voters’ behavior as groups. Building weighted hyper-graph from groups help to analyze parties’ opinions. A linear probabilistic model predicts nominee’s

success chance in polling using features extracted from networks’ weights. The model is verified on Wikipedia admin-ship election data-set with good precision results.

Index Terms—Election prediction, Network analysis, weighted networks, hyper-graph

132

The Conceptual Model to Solve The Problem of Interoperability in Health

Information Systems

Nahid Zeinali, Abbas Asosheh, Sougand Setareh Tarbiat Modares University, Tehran, Iran

Abstract

In the domain of e-health, there are diverse and heterogeneous health care systems with different brands on various platforms. One of the most important challenges in this field is the

interoperability which plays a key role on information exchange and sharing. Achieving the interoperability is a difficult task because of complexity and diversity of systems, standards,

and kinds of information. The lack of interoperability would lead to increase costs and errors of medical operation in hospitals. The purpose of this article is to present a conceptual model for solving interoperability in health information systems. A Health Service Bus (HSB) as an

integrated infrastructure is suggested to facilitate Service Oriented Architecture. A scenario-based evaluation on the proposed conceptual model shows that adopting web service

technology is an effective way for this task. Keywords— interoperability; Health Service Bus; Health information systems

XY-Axix and Distance Based NoC Mapping (XY-ADB

Elnaz Alikhah-Asl, Midia Reshadi Science and Research, Branch, Islamic Azad University, Tehran, Iran

Abstract

Due to increasing number of cores, the placement of the cores in NoC platform has become an important issue. If we can map the application cores close to each other to place them with

more communication requirements, the performance parameters will improve and the network will be more efficient. In this paper, we propose a low complexity heuristic algorithm for the application mapping onto NoC to improve latency. In addition, one approach has been

proposed to extract an Abstract graph from an application core graph, so, using this resent approach, we can map applications in proposed algorithm. Proposed algorithm and previous

papers were compared on two real applications VOPD and MPEG-4 and results were reported.

Keywords— Application Mapping, Bypass Router, Latency, Network-on-Chip, Throughput

133

Poster: Network Science & Technologies

Aspect and Distance Based NoC Mapping (ADB)

Elnaz Alikhah-Asl, Midia Reshadi Science and Research, Branch, Islamic Azad University, Tehran, Iran

Abstract

As we know, mapping is one of the most important steps in the process of network on chip. If

we can map the application cores close to each other to place them with more communication requirements, the performance parameters will improve and the network will be more efficient. In this paper, we propose a low complexity heuristic algorithm for the application

mapping onto NoC to improve latency. In addition, one approach has been proposed to extract an Abstract graph from an application core graph, so, using this resent approach, we can map

applications in proposed algorithms. The ADB method presented in this paper will be conducted in a single phase and there will be no swap phase. Therefore, mapping process will be simpler. This paper, also tries to reduce the number of steps from source to destination.

Proposed algorithm and previous papers were compared on two real applications VOPD and MPEG-4 and results were reported.

Keywords— Application Mapping, Bypass Router, Latency, Network-on-Chip, Throughput

135

Communications for Smart

Grids

& Smart Computing

137

Communications for Smart Grids & Smart Computing

Location-Based Scheduling: An Approach To Address Challenges of Big Data

and Mobile Cloud Computing

Mohammad Reza Bagheri, Sohrab Mortazavi Ghalati, Reza Gholami, Mehdi Sedighi Amirkabir University of Technology, Tehran, Iran

Abstract

The explosive growth of data produced and disseminated across various networks has contributed to an abundance of data, called Big Data. The diversity and the sheer amount of this data pose significant challenges in efficiently processing and handling it. Addressing

these challenges has drawn much attention in recent years. Existing solutions for memory, data storage, and processing management cannot fulfill the needs of this enormous amount of

data. On the other hand, given the dramatic growth of smart mobile devices in number, popularity, and processing power, Mobile Cloud Computing (MCC) has emerged as a viable extension of

cloud computing concepts to mobile environments. MCC employs cloud computing principles and solutions to overcome problems such as efficiency, battery lifetime, bandwidth,

memory, heterogeneity, availability, scalability and security. In this paper, a new concept of Big Data Mobile Cloud Computing (BDMCC) is introduced. After reviewing the open challenges of this notion, a general architecture is proposed for it. To address one of these

challenges, the idea of location-based scheduling is proposed along with a list of possible scenarios for which this approach may be very effective. Experimental results confirm the

efficacy of the proposed approach.

Keywords—Mobile Cloud Computing; Big Data; Mobile Sensing; Scheduling;

The Role of Network Structure in the Performance of Holonic Multi-agent

Systems

Ahmad Esmaeili, Nasser Mozayani, Mohammad Reza Jahed-Motlagh Iran University of Science and Technology, Tehran, Iran

Abstract

One of the essential steps in the design and development of multi-agent systems is the explicit

or implicit definition of a network structure, through which the agents interact. It is widely agreed that not only the presence of such interaction networks helps coordinate large-scaled multi-agent systems, but also the structure of the network has a notable impact on the

performance of the system. In this article, we use the interaction network of the initial agent population to construct a

holonic multi-agent system. Being based on agent interaction patterns, the performance of the resulting holonic multi-agent system highly depends on the structure of the underlying agent network. Here, we study this dependency in more details. The study is carried out by applying

the holonification algorithm on various network topologies and assessing the constructed holonic structure in a task environment.

138

A Multimarket Approach To Peak-shaving in Smart Grid Using Time-of-Use

Prices

Hamid Manoochehri, Alireza Fereidunian K. N. Toosi University of Technology, Tehran, Iran

Abstract

Multiple challenges in the power system, such as rapid increase in electricity demand,

staggering growth in power plant construction and transmission network extension costs have caused a fast change in the power industry trend toward smart grid technologies. In addition,

the increasing penetration of smart loads that are able to change their power consumption or operation state based on power system conditions (such as electricity prices) is the other important motivation for this change. One of the most popular smart grid technologies,

especially in the distribution grid is the communication infrastructure which enables operation procedures such as establishing energy markets (e.g. active, interactive and transactive

markets) in the distribution system. These markets enable several economic opportunities in the distribution system. Another beneficial gift of the smart grid communication infrastructure is increasing distribution system observability and controllability, which helps demand to

actively participate in power system operations. In this paper, two aforementioned benefits of smart grid communications (distribution system markets and higher controllability) are

combined together to reduce the system daily peak. An optimization is performed on the time-of-use (TOU) pricing patterns, and a multimarket approach is proposed for peak-shaving applications. Results show that both methods can help marketeers to reduce system peak more

than a single-market approach. In addition, with the multimarket approach, the prices that are offered to consumers can be lower.

Keywords—multimarket approach; distribution system; time-of-use (TOU) pricing; peak-shaving; smart grid communications; transactive energy (TE).

139

System and Networks Security

141

System and Networks Security (1)

A Multi-Level Reputation-Based Pollution Attacks Detection and Prevention in

P2P Streaming

Hassan Kooshkaki, Behzad Akbari, Abdollah Ghaffari Sheshjavani Tarbiat Modares University, Tehran, Iran

Abstract Today Peer-To-Peer (P2P) networks are becoming more important from high scalability and low cost point of view, and these networks are popular platform for video streaming. With burgeoning of P2P networks, one of the interesting areas of research is confronting to various attacks and threats against these networks. Since, video streaming is a popular application of P2P networks, some attacks like pollution attacks have made serious challenge. In these attacks fake contents are replaced with the original one, by malicious users, and are broadcasted to the network. Diffusion of these contents cannot be controlled with any control process and causes that the polluted content quickly becomes available in network. Another major impacts of this event are users dissatisfaction performance reduction and poor quality of services. For reason, this article proposes a solution for addressing the pollution attacks on P2P networks. Our approach is based on CDN-P2P architecture which is called "Multi-Level mechanism". This mechanism, unlike produced methods, uses temporary blocked policy and new technique to calculate reputation. Also Multi-Level mechanism works in a distributed reputation system. Experimental results show that our Multi-Level approach has a good performance against pollution attacks.

Keywords— Pollution Attacks, Video Streaming, Peer-to-Peer, Reputation

Optimal Response to Computer Network Threats

Farzaneh Abazari, Afsaneh Madani, Hossein Gharaee Iran TelecommunicationResearch Center (ITRC), Tehran, Iran

Abstract

Mitigating security threats is a big challenge for network administrator, because threats can be

exploited by attackers and lead to a cyber-attack. Therefore, network administrator should spend budget to eliminate vulnerabilities and prevent attacks. Removing all the vulnerabilities

is not cost-effective and in some cases impractical. The primary goal of this paper is to prioritize network nodes based on their position in the attack graph and importance to immunize them against threat. We have introduced a model to calculate threat based on the

weighted attack graph. Next, we propose a multi-objective threat response model to minimize the network threat and cost. Experiments show that our system can suggest proper response

based on the current state of the network and our threat response system can immunize the network efficiently.

Keywords—Network Security; Attack Graph; Security Threat; Optimal Reponse; Vulnerability; Graph Theory

142

An Attack Graph Based Procedure for Risk Estimation of Zero-Day Attacks

Marjan Keramati Computer Science Department, Semnan University, Semnan, Iran

Abstract

Performing risk assessment of computer networks is inevitable when doing network

hardening. To have efficient attack prevention, risk evaluation must be done in an accurate and quantitative manner. Such risk assessment requires thorough understanding of attack’s causes or vulnerabilities and their related characteristics. But the major problem is that, such

information is not always provided because, gathering them is time consuming. Also, there are vulnerabilities that are known by attackers but there is no information about them in

databases like NVD. Such vulnerabilities are referred to as unknown or zero day attacks. Existing standards like NVD ignore the effect of unknown attacks in risk assessment of networks. Therefore, they cannot have exact evaluation of security improvement in network

hardening. In this paper, we proposed an innovative method for predictive risk evaluation of unknown vulnerabilities.

Keywords— Zero day attack; CVSS, Vulnerability, risk assessment

SRAM Hardware Trojan

Roghayeh Saeidi, Hossein Gharaee Garakani Iran Telecommunication Research Center (ITRC)

Abstract

Exploring possible vulnerabilities for making hardware Trojans helps designers to improve the security and trust of integrated circuits (ICs). This paper discusses the hardware Trojan

possibility in SRAM to evaluate the security of SRAM and evaluates the effectiveness of existing detection methods. The paper shows that conventional detection methods fails to

detect some special Trojan designs that use certain address sequence for their trigger condition. Simulations are performed using 90nm CMOS technology process to illustrate the malicious effect of these hardware Trojans on functionality and performance of SRAM

Keywords—SRAM; vulnerability; security; hardware Trojan

143

An Anomaly Based VoIP DoS Attack Detection and Prevention Method Using

Fuzzy Logic

Mahsa Hosseinpour, Mohammad Hossein Yaghmaee Moghaddam, Seyed Amin Hosseini Seno

Hossein Khosravi Roshkhari Ferdowsi University of Mashhad, Mashhad, Iran

Abstract

Today, Voice over IP (VoIP), also known as Internet telephony, has received lots of attention because of its efficiency and flexibility. Meanwhile, features such as being in text form, has

made the Session Initiation Protocol (SIP) as a predominant signaling protocol in VoIP services. However, because of simplicity and openness to public internet, this protocol is exposed to number of threats. One of the most important threats against SIP-VoIP services, is

Denial of Service (DoS) attack. In this paper, by the help of normal SIP traffic, an anomaly based method for detecting this kind of attacks due to different type of SIP signaling packets,

is presented. A Finite State Machine (FSM) is used for extracting SIP traffic parameters and specifications in normal conditions. Then fuzzy logic is used for detecting attacks using extracted parameters. The proposed method, is fully implemented and tested with the help of

Spirent test device. Implementation results showed that this method could detects and prevents DoS attacks with high probability and without causing overhead on the SIP server.

Keywords— Voice over IP; Session Initiation Protocol (SIP); Finite State Machine (FSM); Fuzzy logic

144

System and Networks Security (2)

Secure Hardware Key Based on Physically Unclonable Functions and Artificial

Neural Network

Nima Alimohammadi, Shahriar B. Shokouhi Iran University of Science and Technology, Tehran, Iran

Abstract Nowadays, Physically Unclonable Functions (PUFs) are widely used in hardware security applications such as device authentication, secret key generation and recently as a novel

approach for securing Internet of Things (IoT) devices. Different methods have been proposed to create a unique binary string based on the PUF properties of silicon Integrated Circuit (IC).

In this paper, the RO PUF and SR Latch PUF are implemented on a FPGA platform and their performance metrics such as reliability, uniqueness, and uniformity have been evaluated. An accurate and noiseless key is necessary for cryptography methods. To address this demand

and increase reliability, we also propose two Error Correcting Code (ECC) methods based on Hopfield and Auto-associative memory Neural Networks. We show that the proposed error

correcting code can successfully recognize and regenerate corrupted and noisy keys.

Keywords—physically unclonable function (PUF); error correcting code; neural network;

internet of things; system security

On The Security of YRL, An Anonymous Broadcast Encryption Scheme

Reyhaneh Rabaninejad K.N. Toosi University of Technology, Tehran, Iran

Mahshid Delavar Iran University of Science and Technology, Tehran, Iran

Mohammad Hassan Ameri, Javad Mohajeri Sharif University of Technology, Tehran, Iran

Abstract

Broadcast encryption is a novel concept for sending a special message to a subset of users. In broadcast encryption schemes, the distribution center broadcasts the message in encrypted

form and expect that only the intended users be able to decrypt the message. This concept has several applications such as pay-per-service TVs. In this paper, we investigate one of the most

recent broadcast encryption schemes and show that the introduced scheme does not provide the main requirement of broadcast encryption schemes. For this purpose, we demonstrate that all of the users, including authorized and unauthorized users, can decrypt the broadcasted

encrypted message.

Keywords—Broadcast Encryption, Ciphertext-Policy Attribute-Based Encryption (CP-ABE), Security, Access Structure, Attack

145

New Vulnerability Scoring System for Dynamic Security Evaluation

Marjan Keramati Semnan University, Semnan, Iran

Abstract

Currently, because of the exponential growth of vulnerabilities, one of the most essential requirements for IT managers is to improve network security by eliminating vulnerabilities

that are most hazardous. Achieving this goal requires ranking vulnerabilities based on their peril to the network. Today, this target has become possible by introducing open standards such as Common Vulnerability Scoring System (CVSS) for ranking vulnerabilities. But,

CVSS suffers from basic and serious problems that limits use of it for efficient vulnerability scoring. One constraint is its limited diversity of scores that a small set of discrete values are

used for ranking large amount of vulnerabilities. Another challenge is that, CVSS does not score features of the vulnerability that change over time such as availability of exploit tools. By considering these limitations, in this paper a Vulnerability Scoring System has developed

that assess the risk of each known vulnerability based on its intrinsic and temporal features. Also, in this paper a novel method is proposed for the Impact estimation of vulnerability

exploiting that improves the diversity of risk scores considerably.

Keywords—CVSS; Risk; Vulnerability; Impact.

RFID Light Weight Server-Less Search Protocol Based on NLFSRs

Abolfazl Falahati, Hamid Azizi University of Science and Technology, Tehran

Robert. M. Edwards Loughborough University, UK

Abstract

Spectacular expansion of RFID systems and applications by several industries such as

business, electronics, health, marketing, transportation, etc. has made RFID ever more popular. Within this context, the industry search for lower tag weight and low cost system

together with solemn security to satisfy the consumer. Tag search is among the most requested protocols in such systems. Being light weight is regarded as another important specification for the said protocols, so that they can be utilized in low expense tags. In this

paper, a server-less search protocol is proposed in low expense tags with the aid of NLFSRs and simple logical operations to conflict with security attacks. This protocol requires only a

two steps information exchanges between tag and reader, and although it has simple structure, but is completely safe against most of the known security attacks. In comparison with other protocols, this protocol also requires a small number of gates for implementations. There are

no need to exclude the collisions in tags as its other privileges.

Keywords— RFID System and Security; Light-Weight Search Protocol; Non-Linear Feedback Shift Registers

146

Posters: System and Networks Security

Probability of Infectious nodes in Backward time

Tala Tafazzoli, Babak Sadeghiyan Amirkabir University of Technology, Tehran, Iran

Abstract

Computer worms have infected millions of computers since 1980s. In this paper, we consider the problem of estimating the probability of infection of each node in time steps of worm

propagation backwards in time with Bayesian networks. The probability of infection of a node at each time depends on the out_degree of the node and the number of infectious nodes at that time. We assume to have prior knowledge of worm

infection parameters. We also assume to have a snapshot of the network in which the number of susceptible, infectious and removed nodes are known. We repeatedly collect the

out_degree of nodes in current sliding window. It has already been shown that, the number of infectious nodes can be approximated probabilistically backwards in time, through three Back-to-Origin models, i.e. deterministic

and stochastic Back-to-Origin models and stochastic Back-to-Origin Markov model. Our method estimates origin node and epidemic ripple probabilistically.

Keywords— worm modeling; Back-to-Origin model; infection rate; susceptibility rate;Continuous-Time-Markov-Chain; bayesian network.

Security Operation Center Implementation on OpenStack

Tala Tafazzoli, Hossein Gharaee Garakani Research Institute of ICT (ITRC), Tehran, Iran

Abstract Information security management is a complicated task in cloud environment. Cloud service layers and multi-tenant architecture have created a complicated environment for developing

and managing a monitoring and incident response environment in organizations. The main goal of this paper is to receive and analyze events from OpenStack environment. Events and

system logs are received from OpenStack environment. The organization SOC must be customized to receive and detect cloud specific attacks. In this paper, we customize SOC for OpenStack environment to detect cloud specific attacks. The customized SOC receives and

normalizes OpenStack alerts. We have developed new correlation rules and response scenarios for these alerts. We have presented evaluation results of customized SOC

development in OpenStack. The customized SOC can detect OpenStack and hypervisor based attacks.

Keywords—security operation center; OpenStack; agent;

147

Communications Software,

Services and Multimedia

Applications

149

Communications Software, Services and Multimedia Applications

A Temporal Feature Vector Which is Robust against Aspect Ratio Variations

Farzad Zargari, Farzaneh Rahmani Iran Telecom Research Center (ITRC), Tehran, Iran

Abstract

Motion vectors histogram (MVH) is an effective feature vector in video indexing and analysis

applications. One of the challenges in the use of motion vector histogram is that it is not robust to video aspect ratio (AR). As a result, it is not suitable for comparing videos with different ARs. In this paper a feature vector based on motion vectors in H.264/AVC is

introduced which is robust to variations in aspect ratio. This feature vector, namely scaled motion vector histogram (SMVH), has superior performance compared to common MVH and

experimental results indicates that SMVH achieves on average 10% improvement in similarity detection of videos with different ARs compared with MVH.

Keywords—H.264/AVC compressed domain; motion vector histogram; scaled motion vector histogram

A New Incentive Scheduling Mechanism for Live Video Streaming in Mesh-

Based P2P Networks

Sajjad Momeny, Mehdi Dehghan Amirkabir University of Technology, Tehran, Iran

Abstract

Peer to peer networks offer an extensible framework for supporting video streaming service

over the Internet. P2P networks efficiency highly depends on peers’ contribution. In practice, some peers only use the service, but share few resources or do not share any resources. This phenomenon is called free riding which seriously affects the P2P networks efficiency. So, in

order to encourage the peers to contribute and share their resources in P2P networks, using of incentive mechanisms seems necessary. In this paper, we propose an incentive-based

scheduling method for live video streaming in mesh-based P2P networks. In proposed strategy the amount of contribution of the peers is measured and kept in a distributed manner. In addition, we suggest an improved scheduling method in which peers are served based on

their contribution. Simulation results show positive effect of proposed approach on total performance of the network in terms of delay and frame loss. Keywords—video streaming; free riders; incentive mechanisms; contribution; scheduling

150

Adaptive CSK Modulation Guaranteeing HEVC Video Quality Over Visible

Light Communication Network

Hamed Alizadeh Ghazijahani, Milad Abdollahzadeh, Hadi Seyedarabi, Mir Javad Musevi Niya University of Tabriz, Tabriz, Iran

Abstract

Recently, Visible Light Communication (VLC) has got increasing attention in the field of indoor wireless communications. Color Shift Keying (CSK) is a VLC modulation scheme proposed by IEEE 802.15.7 task group. In this method diffused light wavelengths are symbol

points so that their combination provides an overall white sensation. Modulation depth in CSK influences Bit Error Rate (BER) as determines transmission rate. In the case of video

streaming over VLC network, video encoding rate should be compatible with transmission rate, consequently affects video quality. We have proposed an adaptive modulation scheme for video transmission over VLC network considering the dependency of encoded video

quality and modulation BER to modulation. This algorithm jointly minimizes BER and encoded video distortion via adaptive selection of CSK modulation depth to decline frame

loss besides desirable video quality protection.

Keywords—bit error rate; color shift keying; modulation; video streaming; visible light

communication

CMPVoD: A Cluster Mesh-based Architecture For VoD Streaming over Hybrid

CDN-P2P Networks

Abdollah Ghaffari Sheshjavani, Behzad Akbari Tarbiat Modares University, Tehran, Iran

Hamid Reza Ghaeini Pillar of ISTD, SUTD, Singapore, 487372

Abstract

In current Internet, most of the traffic dedicated to video streaming applications. In recent years, Peer-to-Peer (P2P) streaming approach has gained more attention, due to the high cost of providing the required bandwidth for a large number of users in Client-Server model.

Mesh-based peer-to-peer video streaming is a robust approach which recently employed in many multimedia networking applications. Also, these systems provide robustness against

peer churn with low maintenance complexity, but these systems suffer from issues related to the overhead and sub-optimal neighbor selection. In this paper, the challenges of Video-on-Demand (VoD) streaming will be addressed to design CMPVoD, a new cluster mesh-based

architecture for hybrid CDN-P2P VoD streaming with VCR functions. In the proposed architecture, peers are organized into clusters based on their playback features. So peers with

more upload bandwidth in the cluster are gradually located closer to the video servers. Another interesting feature of CMPVoD is using of adaptive buffer-map exchange that

151

reduces bandwidth overhead and increases the availability of video chunks. The performance of CMPVoD evaluated in different network conditions. The results show that CMPVoD

efficiently reduces the overhead and achieves a reasonable quality of service in different network conditions.

Keywords-Video-on-Demand streaming, CDN-P2P, Mesh-based

Head Pose Estimation based on Fuzzy Systems using Facial Geometric Features

Arezoo Sadeghzadeh, Hossein Ebrahimnezhad Sahand University of Technology, Tabriz, Iran

Abstract

Head pose estimation has many applications in the field of computer vision and it is a useful

part of pose-invariant face recognition. In this paper, we propose a novel method to estimate head pose (yaw and pitch rotations) based on fuzzy systems by facial geometric features. Firstly, seven certain points are selected on face. These points includes some main properties.

They are all visible even for large pose variations. Since no point is selected on mouth region, obviously this method is insensitive to facial expression. By these points, some ratios and

angles are computed as the inputs of two fuzzy systems. The output data of these systems are the corresponding yaw and pitch angles. After training them and determining some parameters, they are used for head yaw and pitch estimation. This method is evaluated on two

databases and the experimental results demonstrate that our proposed method is strongly accurate, robust, and beneficial for head pose estimation.

Keywords—head pose estimstion; facial features; facial geometry; fuzzy systems; facial landmark detection

A Free-riding Resiliency Incentive Mechanism for VoD Streaming Over Hybrid

CDN-P2P Networks

Abdollah Ghaffari Sheshjavani, Behzad Akbari Tarbiat Modares Universit, Tehran, Iran

Hamid Reza Ghaeini Pillar of ISTD, SUTD, Singapore

Abstract

Peer organization is one of the most important issues in peer-to-peer (P2P) video streaming

systems. Free-riding extremely reduces the overall performance of these systems. The peers placed closer to the video source will have a higher quality of service. Therefore, we can

mitigate the free-riding effect and encourage peers to increase uploading participation by putting peers with more upload bandwidth closer to the video sources and setting free riders far from these video sources. In this paper, we propose a distributed incentive mechanism,

which extensively enhance mesh-based P2P video-on-demand (VoD) streaming systems. In

152

our proposed mechanism, peers will organize an overlay based on their playback point and contributed upload bandwidth. This mechanism applies to both P2P, and hybrid CDN-P2P

approaches. The comprehensive results of our simulation show the efficiency of the proposed mechanism in term of the quality of service, robustness in dynamic environments and resiliency against free riding in the network.

Keywords: Free riding, Video-on-Demand streaming, CDN-P2P

153

Broadband Networks

155

Poster: Broadband Networks

Simulation and modeling of loads in high-speed data transmission Technology

through low voltage power lines (BPLC)

Mona Khanjani moaf Khatam Universisty, Tehran, Iran

Seyed Mohammad Taghi Bathaee, Mohammad Ali Nekoui Khajeh Nasir Toosi University of Technology, Tehran, Iran

Abstract

One of the main requirements of a smart grid is fulfilled through safe base in order to transmit

data. One solution for this problem is Broadband Power Line Communication (BPLC) technology that uses power lines to transmit high-speed data in a network. This technology can be implemented without using any new and complex infrastructure, which is its main

advantage. Thus, such a technology is money-saving for household applications. Since before using any communication channel one should be familiar with channel characteristics,

mastering the frequency characteristics of power line is necessary. Although BPLC encountered so many challenges, today many of the problems are solved thanks to new method of modulation like OFDM; furthermore, by applying standards such as Home Plug

AV, this technology is a good choice for household application and smart houses. In this paper the mentioned modulation applied in this technology and modeling of transmission

lines are analyzed. Keywords— BPLC technology, OFDM modulation, Household power network, Household

loads modeling, Spectrum Analyzer

157

Authors Index

159

Name Session Title Page

No.

Abazari Aghdam, Sajjad Satellite and Space Communications

& Wireless Communications (5)

63

Abazari, Farzaneh System and Network Security (1) 141

Abbasi, Kolsoom

ICT Development Strategies and Regulatory &

Internet of Things &

Internet Related Technologies and Communication Services

117

Abbaspour-Asadolla, Maryam

Wireless Networks 69

Abdoli, Mohammad Hossein

ICT Development Strategies and Regulatory

& Internet of Things

& Internet Related Technologies and

Communication Services

119

Abdollahpouri, Alireza Social Networks 106

Abdollahzadeh, Milad Communications Software, Services and

Multimedia Applications 150

Abdolmaleki, Behzad Information Security (2) 34

Abed, Reza Antennas and Propagation (3) 81

Abedi, Hajar Antennas and Propagation (2) 78

Abedi, Hajar Antennas and Propagation (3) 80

Abkenar, Forough Shirin Optical Communications: Components and

Networks 19

Abrishami, Hamid Cloud Networks

& Communications

127

Afraz, Ali Information Security (3) 37

160


No.

Afzal, Shahryar Ad hoc and Sensor Networks 13

Agha Kardan, Ahmad Information Security (2) 32

Aghapour, Saeed Information Security (1) 31

Aghazadeh, Behnam Satellite and Space Communications

&

Wireless Communications (5)

64

Ahmadi, Mohammad Reza Big Data (poster) 45

Ahmadi, Roghaye Information Security (2) 32

Akbari, Behzad Software Defined Networks 101

Akbari, Behzad System and Network Security (1) 141

Akbari, Behzad Communications Software, Services and

Multimedia Applications 150-151

Akhaee, Mohammadali Information Security (1) 31

Akhbari, Afsaneh Wireless Networks 71

Akhbari, Bahareh Information Security (2) 34

Akhkandi, Parvin Satellite and Space Communications


56

Akhlaghi, Soroush Satellite and Space Communications &

Wireless Communications (3) 56

Aliakbarian, Hadi Antennas and Propagation (3) 81

Aliaskari, Moein Ad hoc and Sensor Networks 14

161


No.

Alibakhshi-Kenari, Mohammad

Antennas and Propagation (3) 83

Alikhah-Asl, Elnaz Network Science and Technologies 132

Alikhah-Asl, Elnaz Network Science and Technologies (poster) 133

Alimohammadi, Nima System and Networks Security (2) 144

Alireza Farahani Microwave, Millimeter Wave and Terahertz

Wireless Components 112

Alizadeh Ghazijahani, Hamed


150

Ameri Mahabadi, Hossein Antennas and Propagation (3) 81

Ameri, Mohammad Hassan Information Security (1) 31

Ameri, Mohammad Hassan Information Security (2) 33

Ameri, Mohammad Hassan System and Networks Security (2) 144

Amir Haeri, Maryam Big Data (poster) 45

Amiri, Majid Antennas and Propagation (1) 76

Amiri, Mina Microwave, Millimeter Wave and Terahertz


AmiriKooshki, Vahid Satellite and Space Communications

& Wireless Communications 3)

55

Amiriy, Abolfazl Signal Processing in Communications (2) 93

Amjadi, Mehdi Big Data (poster) 45

Arabsorkhi, Abouzar Information Security (1) 30

162


No.

Arastouie, Narges Ad hoc and Sensor Networks 14

Ardakani, Amir Information Security (1) 29

Aref, Mohammad Reza Information Security (2) 34

Arezoomand, Masoud Microwave, Millimeter Wave and Terahertz


Arianyan, Ehsan Big Data (poster) 45

Arianyan, Ehsan Cloud Networks

& Communications

126

Arman, Molood




117

Asadpour, Masoud Social Networks 105

Asosheh, Abbas Network Science and Technologies 132

Atlasbaf, Zahra Antennas and Propagation (3) 82

Azad, Mahsa Satellite and Space Communications


57

Azarnoush, Maryam Antennas and Propagation (1) 76

Azimzadeh, Masoumeh



Internet Related Technologies and Communication Services (poster)

121

Azizi, Hamid System and Networks Security (2) 145

Azizipour, Mohammad Javad Signal Processing in Communications (3) 95

163


No.

Azizpour Shirsavar, Milad Social Networks (poster) 107

Azmi, Paeiz Satellite and Space Communications


52

Azmi, Paeiz Satellite and Space Communications


61

Babazadeh, Sogol




117

Baghani, Mina Cognitive Networks 24

Baghani, Mina Satellite and Space Communications


56

Bagheri, Mohammad Reza

Communications for Smart Grids

& Smart Computing

137

Baghery, Karim Information Security (2) 34

Bahrololum, Marjan Information Security (1) 29

Balegh, Hadi Antennas and Propagation (3) 80

Banaie, Fatemeh Cloud Networks

& Communications

125

Banar, Jafar Satellite and Space Communications


50

Baniasadi, Mohammadamin Satellite and Space Communications


58

Baradaran Shokouhi, Shahriar

Information Security (1) 29

164


No.

Baradaran Shokouhi, Shahriar

System and Networks Security (2) 144

Barzeghari, Rahim. Antennas and Propagation (poster) 84

Bathaee, S. Mohammad Taghi

Broadband Networks (poster) 155

Bayat, Peyman Signal Processing in Communications (3) 94

Bazdar, Amir Wireless Networks 71

Behdani, Mahdi Antennas and Propagation (3) 82

Beheshti, Mohsen Big Data 46

Behroozi, Hamid Wireless Networks 70

Behroozi, Hamid Satellite and Space Communications


53

Beitollahi, Mersedeh Signal Processing in Communications (1) 89

Beyranvand, Hamzeh Optical Communications: Components and

Networks 17

Bigharaz, Reyhaneh Satellite and Space Communications


54

Bostani, Hamid


Internet of Things & Internet Related Technologies and


118

Chehel Amirani, Mehdi Signal Processing in Communications (2) 93

Dabiri, Mohammad Taghi Optical Communications: Components and

Networks 18

Dabiri, Mohammad Taghi Satellite and Space Communications


60

165


No.

Dadashzadeh, Gholamreza Microwave, Millimeter Wave and Terahertz


Danaeifar, Mohammad Antennas and Propagation (2) 77

Daryabar, Farid Information Security (3) 36-37

Dastranj, Nasrin





117

Dehgan, Farid Network Science and Technologies 131

Dehghan, Mehdi Wireless Networks 69

Dehghan, Mehdi Ad hoc and Sensor Networks 13

Dehghan, Mehdi Communications Software, Services and


Dehkhoda, Parisa Antennas and Propagation (3) 82

Dehmollaian, Mojtaba Antennas and Propagation (2) 77

Delavar, Mahshid System and Networks Security (2) 144

Deo, Prafulla Antennas and Propagation (1) 75

Dolkhani, Elham Cloud Networks

& Communications

127

E Day, Sally Antennas and Propagation (1) 75

Ebadi Abouzar, Zahra Social Networks (poster) 107

Ebrahimi Zadeh, Javad Antennas and Propagation (3) 80

166


No.

Ebrahimi-Zadeh, Javad Antennas and Propagation (2) 77

Ebrahimkhani, Atena Satellite and Space Communications


53

Ebrahimnezhad, Hossein Communications Software, Services and


Ebrahimzade, Ataollah Antennas and Propagation (2) 78

Ebrahimzadeh, Amin Optical Communications: Components and

Networks 19

Eghlidos, Taraneh Information Security (2) 33

Emami, Mohsen Big Data 43

Enamipour, Leila Satellite and Space Communications


59

Eslami, Ziba Information Security (poster) 39

Esmaeili, Ahmad Communications for Smart Grids

& Smart Computing

137

Esmaeili, Ashkan Big Data 43

Esmaeili, Leila Social Networks (poster) 107

Esmaeili, Mohammad Satellite and Space Communications


54

Fakharzadeh, Mohammad Microwave, Millimeter Wave and Terahertz


Falahati, Abolfazl System and Networks Security (2) 145

Fallahi, Rajab Antennas and Propagation (3) 80

Fallahpour, Ahmad Optical Communications: Components and

Networks 17

167


No.

Farhang, Arman Satellite and Space Communications


62

Farhang, Mahmoud Satellite and Space Communications

&


50

Farhoodi, Mojgan



Internet Related Technologies and Communication Services (poster)

121

Faroughi, Azadeh Big Data 43

Farzaneh, Forouhar Microwave, Millimeter Wave and Terahertz


Fathi, Mohammad Satellite and Space Communications


58

Fereidunian, Alireza Communications for Smart Grids

& Smart Computing

138

Fernández, F Aníbal Antennas and Propagation (1) 75

Firouzeh, Zaker Hossein Antennas and Propagation (2) 78

Forouzan, Amir reza Satellite and Space Communications

&


49

Forouzandehdoust, Mohammad Reza

Information Security (2) 34

Forouzesh, Moslem Satellite and Space Communications

&


52

Fotowat Ahmady, Ali Ad hoc and Sensor Networks 13

Geran, Fatemeh Antennas and Propagation (1) 76

168


No.

Geran, Fatemeh Microwave, Millimeter Wave and Terahertz

Wireless Components (poster) 114

Ghaderi Karkani, Mohammad Reza

Ad hoc and Sensor Networks 13

Ghaderi, Samaneh Social Networks 106

Ghaeini, Hamid Reza Communications Software, Services and

Multimedia Applications 150-151

Ghaemi Dizaji, Lida Optical Communications: Components and

Networks 17

Ghaffari Sheshjavani,

Abdollah System and Network Security (1) 141

Ghaffari Sheshjavani, Abdollah


150-151

Ghaffari, Fariba Information Security (2) 34

Ghaffari-Miab, Mohsen Satellite and Space Communications


51

Ghaffarpour Rahbar, Akbar Optical Communications: Components and

Networks 17-19

Ghafoorzadeh-Yazdi, Ali Antennas and Propagation (1) 76

Ghalamkari, Behbod Antennas and Propagation (1) 75

Ghamari Adian, Mehdi Cognitive Networks 25

Gharaee, Hossein System and Network Security (poster) 146

Gharaee, Hossein Information Security (poster) 39

Gharaee, Hossein Information Security (2) 33-34

Gharaee, Hossein Information Security (3) 36-38

169


No.

Gharaee, Hossein System and Network Security (1) 141-142

Gharaee, Maryam


Internet of Things & Internet Related Technologies and


117

Ghassemian, Hassan Satellite and Space Communications

&


60

Ghassemian,Hassan Signal Processing in Communications (1) 89-90-91

Ghavami, Hossein Satellite and Space Communications

& Wireless Communications (poster)

65

Ghavami, S. Morteza Social Networks 105

Ghobadi, Changiz Antennas and Propagation (poster) 84

Ghobadi, Changiz Satellite and Space Communications


64

Ghobadi, Changiz Wireless Networks 71

Gholami, Reza


& Smart Computing

137

Gholami, Reza Antennas and Propagation (3) 80

Gholamipour, Mojtaba Signal Processing in Communications (3) 94

Gholipour, Atefeh Signal Processing in Communications (3) 96

Ghorbanloo, Roghayeh Information Security (1) 30

Golestani, Ali

Satellite and Space Communications


49

170


No.

Goudarzi, Mohammad Cloud Networks & Communications 126

Granpayeh, Nosrat Antennas and Propagation (2) 77

Habibi, Pooyan Software Defined Networks 101

Habibi. Bastami, Ali


&


49

Hadi, Mohammad Optical Communications: Components and

Networks 18

Hadizadeh, Hadi Signal Processing in Communications (3) 95

Han, Jianchao Big Data 46

Hashemi Golpayegani, Alireza

Social Networks (poster) 107

Hassanzadeh, Hamid Reza Cloud Networks & Communications 125

Hassanzadeh, Reihaneh Cloud Networks & Communications

125

Heidari, Abbas-Ali Antennas and Propagation (1) 76

Henareh, Neda Signal Processing in Communications (1) 97

Hesari, Maryam Antennas and Propagation (2) 78

Hojatian, Hamed Satellite and Space Communications

&


62

Hoseini, Farnaz Big Data 44

Hossein Khalaj, Babak Satellite and Space Communications


53

Hossein Khalaj, Babak Satellite and Space Communications


59

171


No.

Hosseini Andargoli, S. Mehdi Cognitive Networks 23

Hosseini Seno, S. Amin System and Network Security (1) 143

Hosseini, S. Abolfazl Signal Processing in Communications (1) 89

Hosseini, S. Amin Cloud Networks

&

Communications

125

Hosseinpour, Mahsa System and Network Security (1) 143

Hosseinvand, Hamid Information Security (3) 38

Imani, Maryam Signal Processing in Communications (1) 91

Jahed-Motlagh, Mohammad Reza

Communications for Smart Grids &

Smart Computing 137

Jamshidi, Ali



50

Jamshidi, Ali Satellite and Space Communications


54

Jamshidi, Ali Satellite and Space Communications


55-56

Janbabaei, Shadi Information Security (3) 36

Javan, Mohammad Reza Satellite and Space Communications


51

Javan, Mohammad Reza Information Security (2) 32

Javidan, Reza Big Data 43

Kalantari Meybodi, Mohsen Microwave, Millimeter Wave and Terahertz


172


No.

Kamali, Ali Big Data (poster) 45

Kamarei, Mahmud Ad hoc and Sensor Networks 13

Karamirad, Mohsen Antennas and Propagation (poster) 84

Karimi Ahmadabadi, Younes Information Security (1) 31

Karimi, Ali Cognitive Networks 23

Kazemian, Peyman Software Defined Networks 102

Kebriaei, Hamed Satellite and Space Communications

&


58

Keramati, Marjan System and Network Security (1) 142

Keramati, Marjan System and Networks Security (2) 145

Keshavarz-Haddad, Alireza Satellite and Space Communications


54

Keshavarz-Haddad, Alireza Satellite and Space Communications


55-56

Khanjani moaf, Mona Broad band Networks (poster) 155

Khansari, Mohammad Network Science and Technologies 131

Kharrat, Mahmood





117

Khodam Hoseini, S. Ali Satellite and Space Communications

&


56

173


No.

KhoshbinGhomash, Hossein Satellite and Space Communications


57

Khoshkbarchi, Amir Big Data (poster) 45

Khosravi Roshkhari, Hossein System and Network Security (1) 143

Kiaee, Mahdie Information Security (poster) 39

Kooshkaki, Hassan System and Network Security (1) 141

Limiti, Ernesto Antennas and Propagation (3) 83

Lotfi, Meysam Signal Processing in Communications (1) 90

Lotfi-Rezaabad, Ali Satellite and Space Communications


55

M. Edwards, Robert System and Networks Security (2) 145

Madani, Afsaneh System and Network Security (1) 141

Maddahali, Mohsen Antennas and Propagation (3) 81

Mafinezhad, Khalil Signal Processing in Communications (3) 96

Maham, Behrouz Signal Processing in Communications (2) 93

Maham, Behrouz Satellite and Space Communications


58

Mahdavi, Ala Satellite and Space Communications


55

Mahdavi, Amir Microwave, Millimeter Wave and Terahertz

Wireless Components (poster) 114

174


No.

Mahdavi, Mohammad Social Networks 105

Mahin Zaeem, Reza Satellite and Space Communications


52

Maleki, Davood Big Data (poster) 45

Maleki, Marjan Satellite and Space Communications


63

Manoochehri, Hamid Communications for Smart Grids

& Smart Computing

138

Mansourifar, Leila




118

Marvasti, Farokh Big Data 43

Masoumi, Nasser Microwave, Millimeter Wave and Terahertz


Mehboodi, Saeed Satellite and Space Communications


50

Mihandoost, Sara Signal Processing in Communications (2) 93

Mirhosseini, Fahimehsadat Satellite and Space Communications


62

Mirsaeed Ghazi, Tahereh



Internet Related Technologies and


117

Mirshekar-Syahkal, Dariush Antennas and Propagation (1) 75

175


No.

Mirzaei, Akbar


Internet of Things

& Internet Related Technologies and Communication Services (poster)

121

Mobasheri, Motahareh Wireless Networks 69

Moghadam Charakri,

Nasrollah Network Science and Technologies 131

Moghaddam, Mohammad Microwave, Millimeter Wave and Terahertz


Moghavvemi, Mahmood Antennas and Propagation (3) 81

Mohajer, Razieh Information Security (poster) 39

Mohajeri, Javad Information Security (1) 31

Mohajeri, Javad Information Security (2) 33

Mohajeri, Javad System and Networks Security (2) 144

Mohamed-pour, Kamal Satellite and Space Communications


49

Mohamed-pour, Kamal Signal Processing in Communications (3) 95

Mohamed-Pour, Kamal Satellite and Space Communications


63

Mohammadi, Abbas Cognitive Networks 24

Mohammadi, Abbas Satellite and Space Communications


54

Mohammadi, Amir Ahmad Software Defined Networks 102

176


No.

Mohammadi, Mahla Cognitive Networks 23

Mohammadi, Mohsen Signal Processing in Communications (2) 92

Mohammadpour-Aghdam, Karim


Mohammadzadeh, Naser Information Security (poster) 39

Mohammadzadeh, Naser Information Security (3) 36

Moharrami, Mehrdad Optical Communications: Components and

Networks 17

Mohseni, Sina Antennas and Propagation (3) 80

Mokari, Nader Information Security (2) 32

Mokari, Nader Software Defined Networks 101

Mokari, Nader Satellite and Space Communications


52

Mokari, Nader Satellite and Space Communications


61

Mokhtari, Masoud Software Defined Networks 101

Momeny, Sajjad Communications Software, Services and


Montazeri-Shatouri, Hamed Satellite and Space Communications


49

Moradi, Parham Social Networks 106

Mortazavi Ghalati, Sohrab


& Smart Computing

137

Mosavi, Mohammad Reza

Wireless Networks 70

177


No.

Mosharraf, Maedeh


Internet of Things



119

Mosharraf, Maedeh




Communication Services (poster)

121

Mostafapour, Ehsan Wireless Networks 71

Movaghar, Ali Cloud Networks

&

Communications

125

Movahedi, Zeinab Cloud Networks

& Communications

126

Mozayani, Nasser





118

Mozayani, Nasser Communications for Smart Grids

& Smart Computing

137

Musevi Niya, Javad Cognitive Networks 25

Musevi Niya, Mir Javad Communications Software, Services and


Naghibzadeh, Mahmoud Cloud Networks

& Communications

127

Naser Moghadasi, Mohammad


178


No.

Naser Moghadasi, Mohammad


Nasersharif, Babak Signal Processing in Communications (3) 94

Nazari, Masoud Cloud Networks

& Communications

126

Nazari, Mehran Microwave, Millimeter Wave and Terahertz


Nekoui, Mohammad Ali Broadband Networks (poster) 155

Nematollahzadeh, S.

Mahmood Social Networks 105

Neshati, Mohammad Hassan Microwave, Millimeter Wave and Terahertz


Neshati, Mohammad Hassan Antennas and Propagation (poster) 85

Noori, Narges Microwave, Millimeter Wave and Terahertz


Norouzi, Yaser Signal Processing in Communications (1) 97

Nouri, Mahdi



63

Nourinia, Javad Antennas and Propagation (poster) 84

Nourinia, Javad



64

Okati, Niloofar Wireless Networks 70

Omidi, Mohammad Javad Satellite and Space Communications

&


62

Ozgoli, Sadjad Social Networks 105

Pakravan, Mohammad Reza Optical Communications: Components and

Networks 18

179


No.

Pakravan, Mohammad Reza Software Defined Networks 102

Parsi, Ashkan Information Security (3) 37

Parvaresh, Farzad Wireless Networks 71

Pazari, Mohsen




118

Pedram, Kioumars



64

Poppe, Garrett Big Data 46

Pourghrehkhan, Zahra Cognitive Networks 23

Rabaninejad, Reyhaneh System and Networks Security (2) 144

Rafaei-Booket, Mahmood Antennas and Propagation (3) 82

Rahmani, Farzaneh Communications Software, Services and


Ranjbar Naeini, Mohammadreza

Microwave, Millimeter Wave and Terahertz Wireless Components

111

Razavizadeh, S. Mohammad Satellite and Space Communications


50

Reshadi, Midia Network Science and Technologies 132

Reshadi, Midia Network Science and Technologies (poster) 133

Rezaei Siahrood, Reza Microwave, Millimeter Wave and Terahertz


Rezaei, Atefeh Satellite and Space Communications


61

180


No.

Rezaei, Fereidoon Information Security (3) 37

Rezaei, Saeid Information Security (3) 37

Rezaeian, Amin Cloud Networks

& Communications

127

Roohi, Majid Satellite and Space Communications


60

Roosta, Fatemeh




Communication Services (poster)

121

Sabaei, Masoud Ad hoc and Sensor Networks 14

Sabaei, Masoud Software Defined Networks 101

Saber, Mohammad Javad Optical Communications: Components and

Networks 18

Saber, Mohammad Javad Cognitive Networks 24

Saberali, S. Mohammad Wireless Networks 71

SadatHosseini, Mohammad Ali

Satellite and Space Communications &


Sadegh Mohammadi, Hamid Reza

Signal Processing in Communications (2) 92

Sadeghi, Masoomeh




117

Sadeghi, MohammadTaghi Signal Processing in Communications (1) 90

181


No.

Sadeghian, Mojtaba Network Science and Technologies 131

Sadeghiyan, Babak System and Network Security (poster) 146

Sadeghzadeh, Arezoo Communications Software, Services and


Sadeghzadeh, Ramezan Ali Antennas and Propagation (1) 76

Sadeghzadeh, Ramezan Ali Antennas and Propagation (3) 83

Sadjadi, Hadi Information Security (3) 37

Sadough, S. Mohammad

Sajad

Optical Communications: Components and

Networks 18

Sadough, S. Mohammad Sajad






60


Cognitive Networks 24

Sadrearhami, Mohammad

Hossein Antennas and Propagation (2) 78

Saeedi-Sourck, Hamid Satellite and Space Communications


62

Saeidi, Roghayeh System and Network Security (1) 142

Safi, Hossein Satellite and Space Communications


60

Salajegheh, Afshin Information Security (1) 29

Saleh, Peyman Ad hoc and Sensor Networks 13

Salehi, Jawad Optical Communications: Components and

Networks 17

Salehi, Majid Information Security (3) 36

182


No.

Salehi, Sajjad Social Networks 106

Salehifar, Hannaneh Signal Processing in Communications (3) 94

Samadi, Fereshteh Antennas and Propagation (poster) 84

Savoji, Mohammad Hassan Signal Processing in Communications (2) 92

Sayad Haghighi, Mohammad Information Security (1) 30

Seddon, Lawrence Antennas and Propagation (1) 75

Sedighi, Mehdi Communications for Smart Grids

&

Smart Computing

137

Setareh, Sougand Network Science and Technologies 132

Setayesh, Mehdi Satellite and Space Communications


53

Setoudeh, Farbod Satellite and Space Communications


63

Seyedarabi, Hadi Communications Software, Services and


Seyfe, Babak Satellite and Space Communications


53

Shabanzade, Fahim Signal Processing in Communications (1) 89

Shabihi, Negar




119

Shahabadi, Mahmoud Antennas and Propagation (3) 82

183


No.

Shahbahrami, Asad Signal Processing in Communications (3) 94

Shahbahrami, Asadollah Big Data 44

Shahtalebi, Kamal Satellite and Space Communications


49

Shahzadi, Ali Ad hoc and Sensor Networks 14

Shakhsi Dastgahian, Majid Satellite and Space Communications


57

Shakibian, Hadi Network Science and Technologies 131

Shamani, Mohammad Reza Information Security (3) 37

Sharifi, Abbas Ali Cognitive Networks 25

Sharifi, Morteza Cognitive Networks 25

Sharifi, Sara Satellite and Space Communications


58

Sheikhan, Mansour




118

Sheikhzadeh, Saeed Information Security (2) 32

Shirmehenji, Faezeh Antennas and Propagation (2) 78

Shirvani Moghaddam, Shahriar


Wireless Communications (poster) 65

Shishegar, Amir Ahmad Antennas and Propagation (2) 78

184


No.

Shoeleh, Farzaneh


Internet of Things

& Internet Related Technologies and Communication Services (poster)

121

Sojoodi, Mehdi Social Networks 105

Soleimani-Nasab, Ehsan Wireless Networks 69

Soltan, Abbas Antennas and Propagation (poster) 85

Soltanizadeh, Hediyeh Wireless Networks 71

Souri, Saeed Satellite and Space Communications


51

Tabatabaeian, S. Zahra Microwave, Millimeter Wave and Terahertz


Tadaion, Aliakbar Satellite and Space Communications


62

Tadayon, Mohammad hesam Information Security (1) 29

Tadayon, Mohammad

Hesam Information Security (3) 36,37

Tafazzoli, Tala System and Network Security (poster) 146

Taghiyareh, Fattaneh Social Networks 106

Taghiyareh, Fattaneh


Internet of Things & Internet Related Technologies and Communication Services

119

Taghiyareh, Fattaneh


Internet of Things & Internet Related

Technologies and Communication Services (poster)

121

185


No.

Taghizadeh, Mahdi Antennas and Propagation (3) 81

Tahanian, Esmaeel Microwave, Millimeter Wave and Terahertz


Taherpour, Abbas Cognitive Networks 23

Tajiki, Mohammad Mahdi Software Defined Networks 101

Taki, Mehrdad Satellite and Space Communications


52

Talebi, Siamak Satellite and Space Communications


55

Tang, Bin Big Data 46

Tavakoli, Ahad Antennas and Propagation (3) 82

Torabi, Mohammad Satellite and Space Communications


64

Torkaman, Atefeh Information Security (1) 29

Vaezi, Ali Satellite and Space Communications


59

Vajdi, Mahdi Information Security (1) 29

Vajdi, Mahdi Social Networks (poster) 107

Varposhti, Marzieh Ad hoc and Sensor Networks 13

Vatanpour, Shokufeh Satellite and Space Communications


51

Virdee, Bal Singh Antennas and Propagation (3) 83

Yadegari, Mina Information Security (2) 33

186


No.

Yaghmaee Moghaddam, Mohammad Hossein

System and Network Security (1) 143

Yaghmaee, Mohammad Hossein

Cloud Networks &

Communications 125

Yajam, Habib Allah Information Security (1) 31

Yavand Hassani, Javad Microwave, Millimeter Wave and Terahertz


Yazdani, Nasser Social Networks (poster) 107

Yousef Darmani,

Mohammad



59

Yousefi, Midia Signal Processing in Communications (2) 92

Yousefipoor, Vahid Information Security (2) 33

Zabetian, Negar Cognitive Networks 24

Zakeri, Bijan Antennas and Propagation (3) 80

Zakeri, Bijan Signal Processing in Communications (3) 96

Zare, Tahereh Signal Processing in Communications (1) 90

Zargari, Farzad Communications Software, Services and


Zeidaabadi Nezhad, Abolghasem


Zeinali, Nahid Network Science and Technologies 132

Zeinalpour-Yazdi, Zolfa Satellite and Space Communications

&


59

Zoofaghari, Mohammad Antennas and Propagation (3) 82

187

Referees

189

Referees

Abadi. M. Tarbiat Modares University

Abbasi Shahkooh, S. Communications Regulatory Authority of

The I. R. of Iran

AbbasiMoghadam, D. Shahid Bahonar University of Kerman

Abiri, H. Shiraz University

Aboutalebi , H.R. Yazd University

Afzalikoosha, A. Tehran University

Aghagolzadeh, A. Babol University of Technology

Ahadi , S. M. AmirKabir University of Technology

Ahmadi , M. R. ICT Research Institute

Ahmadi Borujeni, M. Sharif University of Technology

Akhlaghi, S. Shahed University

Almasganj, F. AmirKabir University of Technology

Amini, A. Sharif University of Technology

Amir Haeri, M. Amirkabir University of Technology

Arabsorkhi, A. ICT Research Institute

Arianyan, E. ICT Research Institute

Ashtiani, F. Sharif university of Technology

Askarpour, A. N. Tehran University

Asosheh, A. Tarbiat Modares University

Azimzadeh, F. University of science & Culture

Azmi, P. Tarbiat Modares University

BabaeiZadeh, M. Sharif University of Technology

Badie, K. ICT Research Institute

Bahrololum, M. ICT Research Institute

190

Referees

Bakhshi, B. Amirkabir University of Technology

Banaie, A. Sharif University of Technology

Bastani, M. H. Sharif University of Technology

Bazargan, K. Shahid Beheshti University

Beheshti Shirazi, A. A. Iran University of science & Technology

Behnia, F. Sharif University of Technology

Behrouzi, H. Sharif University of Technology

Beigy, H. Sharif University of Technology

Berangi, R. Iran University of science & Technology

Beyranvand, H. Amirkabir University of Technology

Biguesh, M. Shiraz University

Dehmollaian, M. Tehran University

Dianat, R. Persian Gulf University

DoostHosseini, A. M. Esfahan University of Technology

Ehsani , S. R. ICT Research Institute

Emadi, M. J Amirkabir University of Technology

Enayati, A. ICT Research Institute

Eshghi, M. Shahid Beheshti University

Fadaeieslam, M. J. Semnan University

Faez, K. Amirkabir university of Technology

FakharZadeh, M. Sharif university of Technology

Falahati, A. Iran University of science & Technology

Faraji Dana, R. Tehran University

Faraji, N. Imam Khomeini International University

Farsi, H. Birjand University

191

Referees

Fasanghari, M. ICT Research Institute

Fathi, M. Iran University of science & Technology

Firouzeh, Z. H. Esfahan University of Technology

Forooraghi, K. Tarbiat Modares University

Fotowat Ahmadi, A. Sharif University of Technology

Ghaffari, F. ICT Research Institute

Ghanbari, M. University of Essex, UK

Gharaee, H. ICT Research Institute

Ghassemian Yazdi, M. H. Tarbiat Modares University

Ghorashi, S.A. Shahid Beheshti University

Goudarzi, P. ICT Research Institute

Habibi Bastami, A. K. N. Toosi University of Technology

Haddadi, F. Iran University of science & Technology

Hamidian, M. ICT Research Institute

Hematyar, A. M. A. Sharif university of Technology

Hodjatkashani, F. Iran University of science & Technology

Homayounpoor, M. M. AmirKabir University of Technology

HosseinKhalaj, B. Sharif University of Technology

Jam, Sh. Shiraz University of Technology

Jamshidi, A. Shiraz University

Jarchi, S. Imam Khomeini International University

Jolai, F. Tehran University

Kahaei, M. H. Iran University of science & Technology

Kahani, M. Ferdowsi University of Mashhad

Kalantari, R. ICT Research Institute

192

Referees

Kardan, A. A. AmirKabir university of Technology

Kargahi, M. Tehran University

Kargar, M. J. University of science & Culture

Kasaei, Sh. Sharif university of Technology

Keshavarz, A. Shiraz University

KhalajamirHosseini, M. Iran University of science & Technology

Khaleghi Bizaki, H. Malek-Ashtar University of Technology

Khaleghi, M. ICT Research Institute

Kharrat, M. ICT Research Institute

Madani, A. ICT Research Institute

MaddahAli, M. Esfahan University of Technology

Majidi, M. Kashan University

Mashhadi, S. Sharif University of Technology

Masoumi, N. Tehrtan University

Mazoochi, M. ICT Research Institute

Mehrshahi, E. Shahid Beheshti University

Minaei, B. Iran University of science & Technology

Mirmohseni, M. Sharif University of Technology

Mirzabaghi, M. ICT Research Institute

Mohajeri, F. Shiraz University

Mohajeri, J. Sharif University of Technology

MohajerZadeh, A. H. Ferdowsi University of Mashhad

Mohamedpour, K. K. N. Toosi University of Technology

Mohammadi, A. ICT Research Institute

Mohammadi. A. AmirKabir University of Technology

193

Referees

MohhamadZadeh, N. Shahed University

Mohseni, H. Shahid Bahonar University of Kerman

Mohseni, S. H. Malek Ashtar University

Moin, M. Sh. ICT Research Institute

Mokari, N. Tarbiat Modares University

MoradHasel, N. ICT Research Institute

Moradi, Gh. R. AmirKabir University of Technology

Moradi, H. Tehran University

MousaviMadani , F. Alzahra University

Mousavinia, M. Tabriz University

Mozayani, N. Iran University of science & Technology

Naderan, M. Shahid Chamran University of Ahvaz

NaghibZadeh, M. Ferdowsi University of Mashhad

Nasersharif, B. K. N. Toosi University of Technology

NasiriKenari, M. Sharif University of Technology

Navi, K. Shahid Beheshti University

NematBakhsh, M. A. Esfahan University

Neshat, M. Tehran university

NikAbahi, A. AmirKabir University of Technology

Noorhosseini, S. M. AmirKabir University of Technology

Oraizi, H. Iran University of science & Technology

Pakravan, M. R. Sharif University of Technology

Panahi, A. H. ICT Research Institute

Paran, K. Shahid Beheshti University

Parvaresh, F. Esfahan University

194

Referees

Pedram, H. AmirKabir University of Technology

Pirhadi, A. Shahid Beheshti University

Rashed Mohassel, J. Tehran University

Rashidi Kanan, H. R. Bu Ali Sina University

Rasti, M. AmirKabir University of Technology

Razavizadeh, S.M. Iran University of science & Technology

Rezaei, N. Tehran University

Rezaei, P. Semnan University

Sabaie, M. AmirKabir University of Technology

Sabani, F. ICT Research Institute

Sadeghi, M. T. Yazd University

Sadeghian, B. AmirKabir University of Technology

Sadjadi, H. ICT Research Institute

Saeidi, R. ICT Research Institute

Safarzadeh Vahed, M. ICT Research Institute

Salahi, A. ICT Research Institute

SalamasiZadeh, M. Sharif University of Technology

Saleh, S. Tehran University

Sarbaziazad, H. Sharif University of Technology

Saviz, M. AmirKabir University of Technology

Shahabadi, M. Tehran University

Shahmansouri, V. Tehran University

Sharafat, A. R. Tarbiat Modares University

Sharifi, A. ICT Research Institute

Sheikhi, A. Shiraz University

195

Referees

Sheikhzadegan, J. Research Center of Intelligent signal

Shishehgar, A. A. Sharif University of Technology

Shokripour, A. ICT Research Institute

Soozani, A. ICT Research Institute

Tabataba, F. S. Esfahan University of Technology

Tadaion Taft, A. A Yazd University

Tadayon, M. H. ICT Research Institute

Tafazzoli, T. ICT Research Institute

Taghiyareh, F. Tehran University

Taheri, H. AmirKabir University of Technology

Taherpour, A. Imam Khomeini International University

Tayarani, M. Iran University of science & Technology

Teimouri, M. Tehran University

Tofighi, S. ICT Research Institute

Torkaman, A. ICT Research Institute

Valaee, Sh. University of Toronto, Canada

Yaghmaie Moghaddam, M. H. Ferdowsi University of Mashhad

Yari, A. ICT Research Institute

Yavari, A. AmirKabir University of Technology

Yeganeh, H. ICT Research Institute

Yousefi, L. Tehran University

Zaker Al- Hosseini, A. Shahid Beheshti University

Zargari, F. ICT Research Institute

ZeidabadiNezhad, A. Esfahan University of Technology

Zeinalpour, Z. Yazd University

in the name of god - ist2018.itrc.ac.irist2018.itrc.ac.ir/sites/default/files/book of...

Documents