A Survey of Green Mobile Networks: Opportunities and Challenges

Wang, Xiaofei,Vasilakos, Athanasios V.,Chen, Min,Liu, Yunhao,Kwon, Ted Taekyoung Springer-Verlag 2012 MOBILE NETWORKS AND APPLICATIONS Vol.17 No.1

Security of Cached Content in NDN

Dohyung Kim,Jun Bi,Vasilakos, Athanasios V.,Ikjun Yeom IEEE 2017 IEEE transactions on information forensics and sec Vol.12 No.12

<P>In Named-Data Networking (NDN), content is cached in network nodes and served for future requests. This property of NDN allows attackers to inject poisoned content into the network and isolate users from valid content sources. Since a digital signature is embedded in every piece of content in NDN architecture, poisoned content is discarded if routers perform signature verification; however, if every content is verified by every router, it would be overly expensive to do. In our preliminary work, we have suggested a content verification scheme that minimizes unnecessary verification and favors already verified content in the content store, which reduces the verification overhead by as much as 90% without failing to detect every piece of poisoned content. Under this scheme, however, routers are vulnerable to verification attack, in which a large amount of unverified content is accessed to exhaust system resources. In this paper, we carefully look at the possible concerns of our preliminary work, including verification attack, and present a simple but effective solution. The proposed solution mitigates the weakness of our preliminary work and allows this paper to be deployed for real-world applications.</P>

Bandwidth‐ efficient space–time coded cooperation for resource‐constrained networks

Kim, Jee‐,Hoon,Vasilakos, Athanasios V.,Song, Hyoung‐,Kyu John Wiley Sons, Ltd. 2011 WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Vol.11 No.10

<P><B>Abstract</B></P><P>In cooperative transmission, cooperating nodes must hear the source messages first and forward it to the destination node with decodable composition of symbols. This restriction is one of big questions in cooperative networks since it decreases overall bandwidth‐efficiency. In this paper, we propose a scheme which alleviates it through novel use of dual carrier modulation (DCM) and an adequately designed distributed space–time block code (DSTBC). The proposed scheme achieves comparable error performance to the conventional one while providing 20% higher transmission rate. The performance is always guaranteed by the signal‐to‐noise ratio (SNR) based adaptive cooperation algorithm. Copyright © 2010 John Wiley & Sons, Ltd.</P>

Fair Power Control Using Game Theory with Pricing Scheme in Cognitive Radio Networks

Xie, Xianzhong,Yang, Helin,Vasilakos, Athanasios V.,He, Lu The Korea Institute of Information and Commucation 2014 Journal of communications and networks Vol.16 No.2

This paper proposes a payment-based power control scheme using non-cooperative game with a novel pricing function in cognitive radio networks (CRNs). The proposed algorithm considers the fairness of power control among second users (SUs) where the value of per SU' signal to noise ratio (SINR) or distance between SU and SU station is used as reference for punishment price setting. Due to the effect of uncertainty fading environment, the system is unable to get the link gain coefficient to control SUs' transmission power accurately, so the quality of service (QoS) requirements of SUs may not be guaranteed, and the existence of Nash equilibrium (NE) is not ensured. Therefore, an alternative iterative scheme with sliding model is presented for the non-cooperative power control game algorithm. Simulation results show that the pricing policy using SUs' SINR as price punishment reference can improve total throughput, ensure fairness and reduce total transmission power in CRNs.

A Fingerprint Recognition Scheme Based on Assembling Invariant Moments for Cloud Computing Communications

Jucheng Yang,Naixue Xiong,Vasilakos, A. V.,Zhijun Fang,Dongsun Park,Xianghua Xu,Sook Yoon,Shanjuan Xie,Yong Yang IEEE 2011 IEEE systems journal Vol.5 No.4

<P>In cloud computing communications, information security entails the protection of information elements (e.g., multimedia data), only authorized users are allowed to access the available contents. Fingerprint recognition is one of the popular and effective approaches for priori authorizing the users and protecting the information elements during the communications. However, traditional fingerprint recognition approaches have demerits of easy losing rich information and poor performances due to the complex inputs, such as image rotation, incomplete input image, poor quality image enrollment, and so on. In order to overcome these shortcomings, in this paper, a new fingerprint recognition scheme based on a set of assembled invariant moment (geometric moment and Zernike moment) features to ensure the secure communications is proposed. And the proposed scheme is also based on an effective preprocessing, the extraction of local and global features and a powerful classification tool, thus it is able to handle the various input conditions encountered in the cloud computing communication. The experimental results show that the proposed method has a higher matching accuracy comparing with traditional or individual feature based methods on public databases.</P>

Fair Power Control Using Game Theory with Pricing Scheme in Cognitive Radio Networks

Xianzhong Xie,Helin Yang,Athanasios V. Vasilakos,Lu He 한국통신학회 2014 Journal of communications and networks Vol.16 No.2

This paper proposes a payment-based power controlscheme using non-cooperative game with a novel pricing functionin cognitive radio networks (CRNs). The proposed algorithm considersthe fairness of power control among second users (SUs)where the value of per SU’ signal to noise ratio (SINR) or distancebetween SU and SU station is used as reference for punishmentprice setting. Due to the effect of uncertainty fading environment,the system is unable to get the link gain coefficient tocontrol SUs’ transmission power accurately, so the quality of service(QoS) requirements of SUs may not be guaranteed, and theexistence of Nash equilibrium (NE) is not ensured. Therefore, analternative iterative scheme with sliding model is presented for thenon-cooperative power control game algorithm. Simulation resultsshow that the pricing policy using SUs’ SINR as price punishmentreference can improve total throughput, ensure fairness and reducetotal transmission power in CRNs.

EPCBIR: An efficient and privacy-preserving content-based image retrieval scheme in cloud computing

Xia, Z.,Xiong, N.N.,Vasilakos, A.V.,Sun, X. Elsevier science 2017 Information sciences Vol.387 No.-

The content-based image retrieval (CBIR) has been widely studied along with the increasing importance of images in our daily life. Compared with the text documents, images consume much more storage and thus are very suitable to be stored on the cloud servers. The outsourcing of CBIR to the cloud servers can be a very typical service in cloud computing. For the privacy-preserving purposes, sensitive images, such as medical and personal images, need to be encrypted before being outsourced, which will cause the CBIR technologies in plaintext domain unusable. In this paper, we propose a scheme that supports CBIR over the encrypted images without revealing the sensitive information to the cloud server. Firstly, the feature vectors are extracted to represent the corresponding images. Then, the pre-filter tables are constructed with the locality-sensitive hashing to increase the search efficiency. Next, the feature vectors are protected by the secure k-nearest neighbor (kNN) algorithm. The security analysis and experiments show the security and efficiency of the proposed scheme.

Computation of an Equilibrium in Spectrum Markets for Cognitive Radio Networks

Sang-Seon Byun,Balashingham, Ilangko,Vasilakos, Athanasios V.,Heung-No Lee IEEE 2014 IEEE Transactions on Computers Vol. No.

<P>In this paper, we investigate a market equilibrium in multichannel sharing cognitive radio networks (CRNs): it is assumed that every subchannel is orthogonally licensed to a single primary user (PU), and can be shared with multiple secondary users (SUs). We model this sharing as a spectrum market where PUs offer SUs their subchannels with limiting the interference from SUs; the SUs purchase the right to transmit over the subchannels while observing the inference limits set by the PUs and their budget constraints. Moreover, we consider each SU limits the total interference that can be invoked from all other SUs, and assume that every transmitting SU marks the interference charges to other transmitting SUs. The utility function of SU is defined as least achievable transmission rate, and that of PU is given by the net profit. We define a market equilibrium in the context of extended Fisher model, and show that the equilibrium is yielded by solving an optimization problem, Eisenberg-Gale convex program. To make the solutions of the convex program meet the market equilibrium, we apply monotone-transformation to the utility function of each SU. Furthermore, we develop a distributed algorithm that yields the stationary solutions asymptotically equivalent to the solutions given by the convex program.</P>

Survey on Network Virtualization Using OpenFlow: Taxonomy, Opportunities, and Open Issues

( Ahmed Abdelaziz ),( Tan Fong Ang ),( Mehdi Sookhak ),( Suleman Khan ),( Athanasios Vasilakos ),( Chee Sun Liew ),( Adnan Akhunzada ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.10

The popularity of network virtualization has recently regained considerable momentum because of the emergence of OpenFlow technology. It is essentially decouples a data plane from a control plane and promotes hardware programmability. Subsequently, OpenFlow facilitates the implementation of network virtualization. This study aims to provide an overview of different approaches to create a virtual network using OpenFlow technology. The paper also presents the OpenFlow components to compare conventional network architecture with OpenFlow network architecture, particularly in terms of the virtualization. A thematic OpenFlow network virtualization taxonomy is devised to categorize network virtualization approaches. Several testbeds that support OpenFlow network virtualization are discussed with case studies to show the capabilities of OpenFlow virtualization. Moreover, the advantages of popular OpenFlow controllers that are designed to enhance network virtualization is compared and analyzed. Finally, we present key research challenges that mainly focus on security, scalability, reliability, isolation, and monitoring in the OpenFlow virtual environment. Numerous potential directions to tackle the problems related to OpenFlow network virtualization are likewise discussed

A Survey of Security and Privacy Challenges in Cloud Computing

Yuhong Liu,Yan (Lindsay) Sun,Jungwoo Ryoo,Syed Rizvi,Athanasios V. Vasilakos 한국정보과학회 2015 Journal of Computing Science and Engineering Vol.9 No.3

While cloud computing is gaining popularity, diverse security and privacy issues are emerging that hinder the rapid adoption of this new computing paradigm. And the development of defensive solutions is lagging behind. To ensure a secure and trustworthy cloud environment it is essential to identify the limitations of existing solutions and envision directions for future research. In this paper, we have surveyed critical security and privacy challenges in cloud computing, categorized diverse existing solutions, compared their strengths and limitations, and envisioned future research directions.