Change search
Refine search result
1234 151 - 198 of 198
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 151.
    Wang, Yufeng
    et al.
    Nanjing University of Posts and Telecommunications, Nanjing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Ma, Jianhua
    Hosei University, Tokyo.
    VPEF: A simple and effective incentive mechanism in community-based autonomous networks2015In: IEEE Transactions on Network and Service Management, ISSN 1932-4537, E-ISSN 1932-4537, Vol. 12, no 1, p. 75-86, article id 7029119Article in journal (Refereed)
    Abstract [en]

    This paper focuses on incentivizing cooperative behavior in community-based autonomous networking environments (like mobile social networks, etc.), in which through dynamically forming virtual and/or physical communities, users voluntarily participate in and contribute resources (or provide services) to the community while consuming. Specifically, we proposed a simple but effective EGT (Evolutionary Game Theory)-based mechanism, VPEF (Voluntary Principle and round-based Entry Fee), to drive the networking environment into cooperative. VPEF builds incentive mechanism as two simple system rules: The first is VP meaning that all behaviors are voluntarily conducted by users: Users voluntarily participate (after paying round-based entry fee), voluntarily contribute resource, and voluntarily punish other defectors (incurring extra cost to those so-called punishers); The second is EF meaning that an arbitrarily small round-based entry fee is set for each user who wants to participate in the community. We presented a generic analytical framework of evolutionary dynamics to model VPEF scheme, and theoretically proved that VPEF scheme's efficiency loss defined as the ratio of system time, in which no users will provide resource, is 4/(8 + M). M is the number of users in community-based collaborative system. Finally, the simulated results using content availability as an example verified our theoretical analysis

  • 152.
    Wazid, Mohammad
    et al.
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad.
    Das, Ashok Kumar
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad.
    Khan, Muhammad Khurram
    Center of Excellence in Information Assurance, King Saud University, Riyadh.
    Al-Dhawailie Al-Ghaiheb, Abdulatif
    Clinical Pharmacy Department, College of Pharmacy, King Saud University, Riyad.
    Kumar, Neeraj
    Department of Computer Science and Engineering, Thapar University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Secure Authentication Scheme for Medicine Anti-Counterfeiting System in IoT Environment2017In: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 4, no 5, p. 1634-1646Article in journal (Refereed)
    Abstract [en]

    A counterfeit drug is a medication or pharmaceutical product which is manufactured and made available on the market to deceptively represent its origin, authenticity and effectiveness, etc., and causes serious threats to the health of a patient. Counterfeited medicines have an adverse effect on the public health and cause revenue loss to the legitimate manufacturing organizations. In this paper, we propose a new authentication scheme for medicine anti-counterfeiting system in the Internet of Things environment which is used for checking the authenticity of pharmaceutical products (dosage forms). The proposed scheme utilizes the near field communication (NFC) and is suitable for mobile environment, which also provides efficient NFC update phase. The security analysis using the widely accepted real-or-random model proves that the proposed scheme provides the session key security. The proposed scheme also protects other known attacks which are analyzed informally. Furthermore, the formal security verification using the broadly accepted automated validation of Internet security protocols and applications tool shows that the proposed scheme is secure. The scheme is efficient with respect to computation and communication costs, and also it provides additional functionality features when compared to other existing schemes. Finally, for demonstration of the practicality of the scheme, we evaluate it using the broadly accepted NS2 simulation

  • 153.
    Wazid, Mohammad
    et al.
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, Hyderabad India 500032 .
    Kumar Das, Ashok
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, Hyderabad India 500032 .
    Kumar, Neeraj
    Department of Computer Science and Engineering, Thapar University, Patiala, Patiala, Punjab India .
    Conti, Mauro
    Department of Mathematics, University of Padua, Padua, Padua Italy .
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A Novel Authentication and Key Agreement Scheme for Implantable Medical Devices Deployment2018In: IEEE journal of biomedical and health informatics, ISSN 2168-2194, E-ISSN 2168-2208, Vol. 2, no 4, p. 1299-1309Article in journal (Refereed)
    Abstract [en]

    Implantable medical devices (IMDs) are man-made devices, which can be implanted in the human body to improve the functioning of various organs. The IMDs monitor and treat physiological condition of the human being (for example, monitoring of blood glucose level by insulin pump). The advancement of information and communication technology (ICT) enhances the communication capabilities of IMDs. In healthcare applications, after mutual authentication, a user (for example, doctor) can access the health data from the IMDs implanted in a patient's body. However, in this kind of communication environment, there are always security and privacy issues such as leakage of health data and malfunctioning of IMDs by an unauthorized access.

  • 154.
    Wazid, Mohammad
    et al.
    Cyber Security and Networks Lab, Innopolis University, Innopolis, Russian Federation.
    Kumar Das, Ashok
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India.
    Kumar, Neeraj
    Department of Computer Science and Engineering, Thapar University, Patiala, India.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Design of secure key management and user authentication scheme for fog computing services2019In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 91, p. 475-492Article in journal (Refereed)
    Abstract [en]

    Fog computing (fog networking) is known as a decentralized computing infrastructure in which data, applications, compute as well as data storage are scattered in the most logical and efficient place among the data source (i.e., smart devices) and the cloud. It gives better services than cloud computing because it has better performance with reasonably low cost. Since the cloud computing has security and privacy issues, and fog computing is an extension of cloud computing, it is therefore obvious that fog computing will inherit those security and privacy issues from cloud computing. In this paper, we design a new secure key management and user authentication scheme for fog computing environment, called SAKA-FC. SAKA-FC is efficient as it only uses the lightweight operations, such as one-way cryptographic hash function and bitwise exclusive-OR (XOR), for the smart devices as they are resource-constrained in nature. SAKA-FC is shown to be secure with the help of the formal security analysis using the broadly accepted Real-Or-Random (ROR) model, the formal security verification using the widely-used Automated Validation of Internet Security Protocols and Applications (AVISPA) tool and also the informal security analysis. In addition, SAKA-FC is implemented for practical demonstration using the widely-used NS2 simulator.

  • 155.
    Wazid, Mohammad
    et al.
    Cyber Security and Networks Lab, Innopolis University, Innopolis, Russia.
    Kumar Das, Ashok
    Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Authenticated key management protocol for cloud-assisted body area sensor networks2018In: Journal of Network and Computer Applications, ISSN 1084-8045, E-ISSN 1095-8592, Vol. 123, p. 112-126Article in journal (Refereed)
    Abstract [en]

    Due to recent advances in various technologies such as integrated circuit, embedded systems and wireless communications, the wireless body area network (WBAN) becomes a propitious networking paradigm. WBANs play a very important role in modern medical systems as the real-time biomedical data through intelligent medical sensors in or around the patients' body can be collected and sent the data to remote medical personnel for clinical diagnostics. However, wireless nature of communication makes an adversary to intercept or modify the private and secret data collected by the sensors in WBANs. In critical applications of WBANs, there is a great requirement to access directly the sensing information collected by the body sensors by an external user (e.g., a doctor) in order to monitor the health condition of a patient. In order to do so, the user needs to first authenticate with the accessed body sensors, and only after mutual authentication between that user and the body sensors the real-time data can be directly accessed securely by the user.

    In this paper, we propose a new user authentication and key management scheme for this purpose. The proposed scheme allows mutual authentication between a user and personal server connected to WBAN via the healthcare server situated at the cloud, and once the mutual authentication is successful, both user and personal server are able to establish a secret session key for their future communication. In addition, key management process is provided for establishment of secret keys among the sensors and personal server for their secure communication. The formal security based on broadly-accepted Real-Or-Random (ROR) model and informal security give confidence that the proposed scheme can withstand several known attacks needed for WBAN security. A detailed comparative analysis among the proposed scheme and other schemes shows that the proposed scheme provides better security & functionality features, low computation and comparable communication costs as compared to recently proposed related schemes. Finally, the practical demonstration using the NS2 based simulation is shown for the proposed scheme and also for other schemes.

  • 156.
    Wei, Wei
    et al.
    School of Computer Science and Engineering, Xi’an University of Technology.
    Song, Houbing
    Department of Electrical and Computer Engineering, West Virginia University, Montgomery, WV .
    Li, Wei
    Centre for Distributed and High Performance Computing, School of Information Technologies, The University of Sydney.
    Shen, Peiyi
    National school of Software, Xidian University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Gradient-driven parking navigation using a continuous information potential field based on wireless sensor network2017In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 408, p. 100-114Article in journal (Refereed)
    Abstract [en]

    Wireless sensor networks can support building and transportation system automation in numerous ways. An emerging application is to guide drivers to promptly locate vacant parking spaces in large parking structures during peak hours. This paper proposes efficient parking navigation via a continuous information potential field and gradient ascent method. Our theoretical analysis proves the convergence of a proposed algorithm and efficient convergence during the first and second steps of the algorithm to effectively prevent parking navigation from a gridlock situation. The empirical study demonstrates that the proposed algorithm performs more efficiently than existing algorithms.

  • 157.
    Wu, Qihui
    et al.
    College of Communications Engineering PLA University of Science and Technology, Nanjing.
    Ding, Guoro
    College of Communications Engineering PLA University of Science and Technology, Nanjing.
    Du, Zhiyong
    PLA Academy of National Defense Information, Wuhan.
    Sun, Youming
    National Digital Switching System Engineering & Technological Research Center, Zhengzhou.
    Jo, Minho
    Department of Computer and Information Science, Korea University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A Cloud-Based Architecture for the Internet of Spectrum Devices (IoSD) over Future Wireless Networks2016In: IEEE Access, E-ISSN 2169-3536, Vol. 4, p. 2854-2862Article in journal (Refereed)
    Abstract [en]

    The dramatic increase in data rates in wireless networks has caused radio spectrum usage to be an essential and critical issue. Spectrum sharing is widely recognized as an affordable, near-term method to address this issue. This article first characterizes the new features of spectrum sharing in future wireless networks, including heterogeneity in sharing bands, diversity in sharing patterns, crowd intelligence in sharing devices, and hyper-densification in sharing networks. Then, to harness the benefits of these unique features and promote a vision of spectrum without bounds and networks without borders, this article introduces a new concept of the Internet of Spectrum Devices (IoSD) and develops a cloud-based architecture for IoSD over future wireless networks, with the prime aim of building a bridging network among various spectrum monitoring devices (SMDs) and massive spectrum utilization devices (SUDs), and enabling a highly-efficient spectrum sharing and management paradigm for future wireless networks. Furthermore, this article presents a systematic tutorial on the key enabling techniques of the IoSD, including big spectrum data analytics, hierarchal spectrum resource optimization, and quality of experience (QoE)- oriented spectrum service evaluation. In addition, the unresolved research issues are also presented.

  • 158.
    Xia, Zhihua
    et al.
    Jiangsu Engineering Center of Network Monitoring, Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology, College of Computer and Software, Nanjing University of Information Science & Technology.
    Xiong, Neal N.
    Department of Business and Computer Science, Southwestern Oklahoma State University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Sun, Xingming
    Jiangsu Engineering Center of Network Monitoring, Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology, College of Computer and Software, Nanjing University of Information Science & Technology.
    EPCBIR: An efficient and privacy-preserving content-based image retrieval scheme in cloud computing2017In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 387, p. 195-204Article in journal (Refereed)
    Abstract [en]

    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.

  • 159.
    Xie, Yao
    et al.
    Shanghai Jiao Tong University.
    Liu, Xiao-Yang
    Shanghai Jiao Tong University.
    Kong, Linghe
    Shanghai Jiao Tong University.
    Wu, Fan
    Shanghai Jiao Tong University.
    Chen, Guihai
    Shanghai Jiao Tong University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Drone-Based Wireless Relay using Online Tensor Update2016In: 2016 IEEE 22nd IEEE International Conference on Parallel and Distributed Systems (ICPADS) / [ed] Liao, X; Lovas, R; Shen, X; Zheng, R, Piscataway, NJ: IEEE Computer Society, 2016, p. 48-55, article id 7823731Conference paper (Refereed)
    Abstract [en]

    In the wireless communication, there are many cases where the transmission path is obstructed by unknown objects. With the rapid development of the drone technology in recent years, the drones are advocated to serve as mobile relays to forward data streams. However, the challenges are that data transmission may suffer severe signal attenuation due to the existence of the obstructions and it is challenging to find the best location for mobile relays due to the dynamic environment and unpredictable interference. To address the problem, this paper proposes an approach that a drone can automatically find the location with the optimal link quality. We design a novel algorithm, named Path-sampling Online Tensor Update (POTU), to estimate the link quality in the space and find the optimal location. Furthermore, the algorithm is practical to the real applications due to the simplicity of implementation. In the experiment, we construct a realistic scene and compare the performance of our algorithm with the classic and the state-of-the-art algorithms. As a result, POTU outperforms existing methods in achieving the trade-off between time cost and estimation accuracy.

  • 160.
    Xiong, Hu
    et al.
    School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu.
    Choo, Kim-Kwang Raymond
    Department of Information Systems and Cyber Security, The University of Texas at San Antonio.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Revocable Identity-Based Access Control for Big Data with Verifiable Outsourced Computing2017In: IEEE Transactions on Big Data, ISSN 2325-5870, E-ISSN 2168-6750Article in journal (Refereed)
    Abstract [en]

    To be able to leverage big data to achieve enhanced strategic insight, process optimization and make informed decision, we need to be an efficient access control mechanism for ensuring end-to-end security of such information asset. Signcryption is one of several promising techniques to simultaneously achieve big data confidentiality and authenticity. However, signcryption suffers from the limitation of not being able to revoke users from a large-scale system efficiently. We put forward, in this paper, the first identity-based (ID-based) signcryption scheme with efficient revocation as well as the feature to outsource unsigncryption to enable secure big data communications between data collectors and data analytical system(s). Our scheme is designed to achieve end-to-end confidentiality, authentication, non-repudiation, and integrity simultaneously, while providing scalable revocation functionality such that the overhead demanded by the private key generator (PKG) in the key-update phase only increases logarithmically based on the cardiality of users. Although in our scheme the majority of the unsigncryption tasks are outsourced to an untrusted cloud server, this approach does not affect the security of the proposed scheme. We then prove the security of our scheme, as well as demonstrating its utility using simulations

  • 161.
    Xiong, Naixue
    et al.
    Department of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK .
    Zhang, Longzhen
    School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai.
    Zhang, Wei
    Department of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Imran, Muhammad
    College of Computer and Information Sciences, King Saud University.
    Design and Analysis of an Efficient Energy Algorithm in Wireless Social Sensor Networks2017In: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 17, no 10, article id 2166Article in journal (Refereed)
    Abstract [en]

    Because mobile ad hoc networks have characteristics such as lack of center nodes, multi-hop routing and changeable topology, the existing checkpoint technologies for normal mobile networks cannot be applied well to mobile ad hoc networks. Considering the multi-frequency hierarchy structure of ad hoc networks, this paper proposes a hybrid checkpointing strategy which combines the techniques of synchronous checkpointing with asynchronous checkpointing, namely the checkpoints of mobile terminals in the same cluster remain synchronous, and the checkpoints in different clusters remain asynchronous. This strategy could not only avoid cascading rollback among the processes in the same cluster, but also avoid too many message transmissions among the processes in different clusters. What is more, it can reduce the communication delay. In order to assure the consistency of the global states, this paper discusses the correctness criteria of hybrid checkpointing, which includes the criteria of checkpoint taking, rollback recovery and indelibility. Based on the designed Intra-Cluster Checkpoint Dependence Graph and Inter-Cluster Checkpoint Dependence Graph, the elimination rules for different kinds of checkpoints are discussed, and the algorithms for the same cluster checkpoints, different cluster checkpoints, and rollback recovery are also given. Experimental results demonstrate the proposed hybrid checkpointing strategy is a preferable trade-off method, which not only synthetically takes all kinds of resource constraints of Ad hoc networks into account, but also outperforms the existing schemes in terms of the dependence to cluster heads, the recovery time compared to the pure synchronous, and the pure asynchronous checkpoint advantage.

  • 162.
    Xu, Changqiao
    et al.
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing.
    Quan, Wei
    National Engineering Laboratory for Next Generation Internet Technologies, School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Zhang, Hongke
    National Engineering Laboratory for Next Generation Internet Technologies, School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing.
    Muntean, Gabriel-Miro
    School of Electronic Engineering, Network Innovations Centre, Rince Institute, Dublin City University.
    Information-centric cost-efficient optimization for multimedia content delivery in mobile vehicular networks2017In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 99, p. 93-106Article in journal (Refereed)
    Abstract [en]

    Providing high-quality multimedia services is a challenging and high-cost task in mobile vehicular networks due to intermittent connectivity, highly dynamic capacity, mostly associated to heterogeneous hosts distribution and their high mobility. Information-centric networking (ICN), which adopts novel content-based dissemination instead of the traditional host-based one, has great potential to accomplish cost-efficient quality-oriented multimedia delivery. This paper proposes a novel cost-Efficient Multimedia content Delivery approach (EcoMD) in vehicular networks leveraging the ICN features. In EcoMD, two essential factors are first analyzed and modeled: content mobility and supply-demand balance, and then, a mixed integer programming (MIP) optimization is formulated to minimize the economic cost associated to guaranteed the quality level of multimedia services. To resolve this NP-hard problem, heuristic mechanisms are proposed covering three aspects: priority-based path selection, least-required source maintaining and on-demand caching enhancement. By comparison with existing state-of-the-art solutions, simulation results demonstrate how EcoMD provides an improved performance in terms of start-up delay, jitter, playback continuity, and Quality of Experience (QoE) while particularly reduces the economic cost.

  • 163.
    Xu, Dan
    et al.
    University of California, Davis.
    Liu, Xin
    University of California, Davis.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Traffic-aware resource provisioning for distributed clouds2015In: I E E E Cloud Computing, ISSN 2325-6095, Vol. 2, no 1, p. 30-39, article id 7091770Article in journal (Refereed)
    Abstract [en]

    Cloud computing's aim is to provide prompt, reliable, diverse, and yet cost-effective Internet services. To achieve this goal, existing work has considered traffic-aware resource provisioning to reduce cloud energy costs. However, much room remains for achieving a fine-grained traffic-awareness. In this article, the authors examine important cloud traffic characteristics and discuss optimization solutions to reduce energy costs while maintaining service quality. Their solution improves traffic-awareness and efficiently reduces energy costs for distributed clouds with dynamic and diverse traffic

  • 164.
    Yan, Huan
    et al.
    School of Electronic and Information Engineering, Beijing Jiaotong University.
    Gao, Deyun
    School of Electronic and Information Engineering, Beijing Jiaotong University.
    Su, Wei
    School of Electronic and Information Engineering, Beijing Jiaotong University.
    Foh, Chuan Heng
    5G-IC, Department of Electrical and Electronic Engineering, Institute for Communication Systems, University of Surrey.
    Zhang, Hongke
    School of Electronic and Information Engineering, Beijing Jiaotong University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Caching Strategy Based on Hierarchical Cluster for Named Data Networking2017In: IEEE Access, E-ISSN 2169-3536, Vol. 5, p. 8433-8443, article id 7898837Article in journal (Refereed)
    Abstract [en]

    The in-network caching strategy in named data networking can not only reduce the unnecessaryfetching of content from the original content server deep in the core network and improve the user responsetime, but also ease the trafc in the core network. However, challenges exist in in-network caching, suchas the distributed locations of storage and relatively small cache space which limit the hit rate, and thecache management introduces further overhead. In this paper, we propose a two-layer hierarchical clusterbasedcaching solution to improve in-network caching efciency. A network is grouped into several clusters,then, a clusterhead is nominated for each cluster to make caching decision. The clustering approach offersscalability and permits multiple aspects of inputs to be used for decision making. Our solution jointlyconsiders the location and content popularity for caching.We implement our strategy in ndnSIM and test it onGEANT-based network and AS3967 network. Our simulation results show signicant improvement over itspeers.INDEX

  • 165.
    Yan, Zheng
    et al.
    State Key Laboratory on Integrated Services Networks, Xidian University.
    Ding, Wenxiu
    State Key Laboratory of Integrated Services Networks, Xidian University.
    Niemi, Valtteri
    State Key Laboratory of Integrated Services Networks, Xidian University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Two Schemes of Privacy-Preserving Trust Evaluation2016In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 62, p. 175-189Article in journal (Refereed)
    Abstract [en]

    Trust evaluation computes trust values by collecting and processing trust evidence. It plays an important role in trust management that automatically ensures trust relationships among system entities and enhances system security. But trust evidence collection and process may cause privacy leakage, which makes involved entities reluctant to provide personal evidence that is essential for trust evaluation. Current literature pays little attention to Privacy-Preserving Trust Evaluation (PPTE). Existing work still has many limitations, especially on generality, efficiency and reliability. In this paper, we propose two practical schemes to guard privacy of trust evidence providers based on additive homomorphic encryption in order to support a traditional class of trust evaluation that contains evidence summation. The first scheme achieves better computational efficiency, while the second one provides greater security at the expense of a higher computational cost. Accordingly, two trust evaluation algorithms are further proposed to flexibly support different application cases. Specifically, these algorithms can overcome attacks raised by internal malicious evidence providers to some extent even though the trust evaluation is partially performed in an encrypted form. Extensive analysis and performance evaluation show the security and effectivity of our schemes for potential application prospect and their efficiency to support big data process

  • 166.
    Yan, Zheng
    et al.
    State Key Laboratory on Integrated Services Networks, Xidian University.
    Li, Xueyun
    Department of Communications and Networking, Aalto University.
    Wang, Mingjun
    State Key Laboratory of Integrated Services Networks, Xidian University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Flexible Data Access Control based on Trust and Reputation in Cloud Computing2017In: I E E E Transactions on Cloud Computing, E-ISSN 2168-7161, Vol. 5, no 3, p. 485-498, article id 7208817Article in journal (Refereed)
    Abstract [en]

    Cloud computing offers a new way of services and has become a popular service platform. Storing user data at a cloud data center greatly releases storage burden of user devices and brings access convenience. Due to distrust in cloud service providers, users generally store their crucial data in an encrypted form. But in many cases, the data need to be accessed by other entities for fulfilling an expected service, e.g., an eHealth service. How to control personal data access at cloud is a critical issue. Various application scenarios request flexible control on cloud data access based on data owner policies and application demands. Either data owners or some trusted third parties or both should flexibly participate in this control. However, existing work hasn’t yet investigated an effective and flexible solution to satisfy this demand. On the other hand, trust plays an important role in data sharing. It helps overcoming uncertainty and avoiding potential risks. But literature still lacks a practical solution to control cloud data access based on trust and reputation. In this paper, we propose a scheme to control data access in cloud computing based on trust evaluated by the data owner and/or reputations generated by a number of reputation centers in a flexible manner by applying Attribue-Based Encryption and Proxy Re-Encryption. We integrate the concept of context-aware trust and reputation evaluation into a cryptographic system in order to support various control scenarios and strategies. The security and performance of our scheme are evaluated and justified through extensive analysis, security proof, comparison and implementation. The results show the efficiency, flexibility and effectiveness of our scheme for data access control in cloud computing

  • 167.
    Yan, Zheng
    et al.
    State Key Laboratory of ISN, Xidian University.
    Liu, Jun
    Xi’an Jiaotong University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Yang, Laurance T.
    Department of Computer Science, St. Francis Xavier University, Antigonish.
    Trustworthy data fusion and mining in Internet of Things2015In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 49, p. 45-46Article in journal (Refereed)
  • 168.
    Yan, Zheng
    et al.
    State Key Laboratory on Integrated Services Networks, Xidian University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Yang, Laurence T.
    School of Computer Science and Technology, Huazhong University of Science and Technology.
    Editorial: Recent Advances on the Next Generation of Mobile Networks and Services2015In: Journal on spesial topics in mobile networks and applications, ISSN 1383-469X, E-ISSN 1572-8153, Vol. 20, no 6, p. 781-782Article in journal (Other academic)
  • 169.
    Yan, Zheng
    et al.
    State Key Laboratory on Integrated Services Networks, Xidian University.
    Wang, Mingjun
    State Key Laboratory on Integrated Services Networks, Xidian University.
    Li, Yuxian
    State Key Laboratory on Integrated Services Networks, Xidian University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Encrypted Data Management with Deduplication in Cloud Computing2016In: I E E E Cloud Computing, ISSN 2325-6095, Vol. 3, no 2, p. 28-35Article in journal (Refereed)
    Abstract [en]

    Cloud computing plays an important role in supporting data storage, processing, and management in the Internet of Things (IoT). To preserve cloud data confidentiality and user privacy, cloud data are often stored in an encrypted form. However, duplicated data that are encrypted under different encryption schemes could be stored in the cloud, which greatly decreases the utilization rate of storage resources, especially for big data. Several data deduplication schemes have recently been proposed. However, most of them suffer from security weakness and lack of flexibility to support secure data access control. Therefore, few can be deployed in practice. This article proposes a scheme based on attribute-based encryption (ABE) to deduplicate encrypted data stored in the cloud while also supporting secure data access control. The authors evaluate the scheme's performance based on analysis and implementation. Results show the efficiency, effectiveness, and scalability of the scheme for potential practical deployment.

  • 170.
    Yang, Helin
    et al.
    Chongqing Key Laboratory of Mobile Communications Technology and Institute of Personal Communication, Chongqing University of Posts & Telecommunications, Chongqing.
    Xie, Xianzhong
    Chongqing Key Laboratory of Mobile Communications Technology and Institute of Personal Communication, Chongqing University of Posts & Telecommunications, Chongqing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Noncooperative and Cooperative Optimization of Electric Vehicle Charging Under Demand Uncertainty: A Robust Stackelberg Game2016In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 65, no 3, p. 1043-1058Article in journal (Refereed)
    Abstract [en]

    This paper studies the problem of energy charging using a robust Stackelberg game approach in a power system composed of an aggregator and multiple electric vehicles (EVs) in the presence of demand uncertainty, where the aggregator and EVs are considered to be a leader and multiple followers, respectively. We propose two different robust approaches under demand uncertainty: a noncooperative optimization and a cooperative design. In the robust noncooperative approach, we formulate the energy charging problem as a competitive game among self-interested EVs, where each EV chooses its own demand strategy to maximize its own benefit selfishly. In the robust cooperative model, we present an optimal distributed energy scheduling algorithm that maximizes the sum benefit of the connected EVs. We theoretically prove the existence and uniqueness of robust Stackelberg equilibrium for the two approaches and develop distributed algorithms to converge to the global optimal solution that are robust against the demand uncertainty. Moreover, we extend the two robust models to a time-varying power system to handle the slowly varying environments. Simulation results show the effectiveness of the robust solutions in uncertain environments.

  • 171.
    Yang, Helin
    et al.
    Chongqing Key Laboratory of Mobile Communications Technology and Institute of Personal Communication, Chongqing University of Posts & Telecommunications, Chongqing.
    Xie, Xianzhong
    Chongqing Key Laboratory of Mobile Communications Technology and Institute of Personal Communication, Chongqing University of Posts & Telecommunications, Chongqing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Stackelberg Game Based Power Control with Outage Probability Constraints for Cognitive Radio Networks2015In: International Journal of Distributed Sensor Networks, ISSN 1550-1329, E-ISSN 1550-1477, Vol. 2015, article id 604915Article in journal (Refereed)
    Abstract [en]

    This paper firstly investigates the problem of uplink power control in cognitive radio networks (CRNs) with multiple primary users (PUs) and multiple second users (SUs) considering channel outage constraints and interference power constraints, where PUs and SUs compete with each other to maximize their utilities. We formulate a Stackelberg game to model this hierarchical competition, where PUs and SUs are considered to be leaders and followers, respectively. We theoretically prove the existence and uniqueness of robust Stackelberg equilibrium for the noncooperative approach. Then, we apply the Lagrange dual decomposition method to solve this problem, and an efficient iterative algorithm is proposed to search the Stackelberg equilibrium. Simulation results show that the proposed algorithm improves the performance compared with those proportionate game schemes.

  • 172.
    Yaqoob, Ibrar
    et al.
    Centre for Mobile Cloud Computing Research (C4MCCR), Faculty of Computer Science and Information Technology, University of Malaya.
    Abaker Targio Hashem, Ibrahim
    Centre for Mobile Cloud Computing Research (C4MCCR), Faculty of Computer Science and Information Technology, University of Malaya.
    Gani, Abdullah
    Centre for Mobile Cloud Computing Research (C4MCCR), Faculty of Computer Science and Information Technology, University of Malaya.
    Mokhtar, Salimah
    Centre for Mobile Cloud Computing Research (C4MCCR), Faculty of Computer Science and Information Technology, University of Malaya.
    Ahmed, Ejaz
    Centre for Mobile Cloud Computing Research (C4MCCR), Faculty of Computer Science and Information Technology, University of Malaya.
    Badrul Anuar, Nor
    Centre for Mobile Cloud Computing Research (C4MCCR), Faculty of Computer Science and Information Technology, University of Malaya.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Big data: From beginning to future2016In: International Journal of Information Management, ISSN 0268-4012, E-ISSN 1873-4707, Vol. 36, no 6B, p. 1231-1247Article in journal (Refereed)
    Abstract [en]

    Big data is a potential research area receiving considerable attention from academia and IT communities. In the digital world, the amounts of data generated and stored have expanded within a short period of time. Consequently, this fast growing rate of data has created many challenges. In this paper, we use structuralism and functionalism paradigms to analyze the origins of big data applications and its current trends. This paper presents a comprehensive discussion on state-of-the-art big data technologies based on batch and stream data processing. Moreover, strengths and weaknesses of these technologies are analyzed. This study also discusses big data analytics techniques, processing methods, some reported case studies from different vendors, several open research challenges, and the opportunities brought about by big data. The similarities and differences of these techniques and technologies based on important parameters are also investigated. Emerging technologies are recommended as a solution for big data problems.

  • 173.
    Ye, Dayong
    et al.
    School of Software and Electrical Engineering, Swinburne University of Technology, Melbourne.
    Zhang, Minjie
    School of Computer Science and Software Engineering, University of Wollongong.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A Survey of Self-Organization Mechanisms in Multiagent Systems2017In: IEEE Transactions on Systems, Man, and Cybernetics: Systems, ISSN 2168-2216, Vol. 47, no 3, p. 441-461Article in journal (Refereed)
    Abstract [en]

    This paper surveys the literature over the last decades in the field of self-organizing multiagent systems. Self-organization has been extensively studied and applied in multiagent systems and other fields, e.g., sensor networks and grid systems. Self-organization mechanisms in other fields have been thoroughly surveyed. However, there has not been a survey of self-organization mechanisms developed for use in multiagent systems. In this paper, we provide a survey of existing literature on self-organization mechanisms in multiagent systems. We also highlight the future work on key research issues in multiagent systems. This paper can serve as a guide and a starting point for anyone who will conduct research on self-organization in multiagent systems. Also, this paper complements existing survey studies on self-organization in multiagent systems.

  • 174.
    Yin, Lihua
    et al.
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, .
    Guo, Yunchuan
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing.
    Li, Fenghua
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing.
    Sun, Yanwei
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing .
    Qian, Junyan
    Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A game-theoretic approach to advertisement dissemination in ephemeral networks2018In: World wide web (Bussum), ISSN 1386-145X, E-ISSN 1573-1413, Vol. 21, no 2, p. 241-260Article in journal (Refereed)
    Abstract [en]

    In ephemeral networks, disseminating advertisements faces two dilemmatic problems: on the one hand, disseminators own the limited resources and have privacy concerns, thus, often preferring to avoid disseminating advertisements without enough incentives; Even if advertisements are disseminated, their dissemination accuracy is lower. On the other hand, false advertisements may flood in ephemeral networks if too many incentives but no punishments are given. Thus, it is a challenge to design an effective scheme to guarantee rational disseminators have sufficient impetus to forward true advertisements to the interested consumers and report false advertisements, despite facing the limitation of resources and the risk of privacy leakage. To solve this problem, in this paper, a bargaining-based scheme is proposed to motive disseminators to forward the true advertisements to the interested node and a semi-grim policy is designed for punishing the disseminators who releases and disseminates false advertisements. Acknowledging the assumption of incomplete information, a repeated dissemination game is proposed to help disseminators to decide whether to forward advertisements or report false advertisements. Simulation results demonstrate that our scheme not only provides disseminators a strong impetus to disseminate the advertisements with higher dissemination accuracy, but also effectively prevents disseminators from forwarding false advertisements.

  • 175.
    Yin, Zekun
    et al.
    Shandong University, Jinan.
    Lan, Haidong
    Shandong University, Jinan.
    Tan, Guanming
    Institute of Computing Technology, Chinese Academy of Sciences.
    Lu, Mian
    Huawei Singapore Research Centre.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Liu, Weiguo
    Shandong University, Jinan.
    Computing Platforms for Big Biological Data Analytics: Perspectives and Challenges2017In: Computational and structural biotechnology journal, E-ISSN 2001-0370, Vol. 15, p. 403-411Article in journal (Refereed)
    Abstract [en]

    The last decade has witnessed an explosion in the amount of available biological sequence data, due to the rapid progress of high-throughput sequencing projects. However, the biological data amount is becoming so great that traditional data analysis platforms and methods can no longer meet the need to rapidly perform data analysis tasks in life sciences. As a result, both biologists and computer scientists are facing the challenge of gaining a profound insight into the deepest biological functions from big biological data. This in turn requires massive computational resources. Therefore, high performance computing (HPC) platforms are highly needed as well as efficient and scalable algorithms that can take advantage of these platforms. In this paper, we survey the state-of-the-art HPC platforms for big biological data analytics. We first list the characteristics of big biological data and popular computing platforms. Then we provide a taxonomy of different biological data analysis applications and a survey of the way they have been mapped onto various computing platforms. After that, we present a case study to compare the efficiency of different computing platforms for handling the classical biological sequence alignment problem. At last we discuss the open issues in big biological data analytics.

  • 176.
    Yu, Xixun
    et al.
    The State Key Laboratory on Integrated Services Networks, School of Cyber Engineering, Xidian University, Xi’an.
    Yan, Zheng
    The State Key Laboratory on Integrated Services Networks, School of Cyber Engineering, Xidian University, Xi’an.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Survey of Verifiable Computation2017In: Mobile Networks and Applications, ISSN 1383-469X, Vol. 22, no 3, p. 438-453Article in journal (Refereed)
    Abstract [en]

    Internet of Things (IoT) has taken place to motivate various intelligent applications with the data collected by the things”. Meanwhile, Cloud computing offers an efficient and convenient way to store, process and analyze huge amount of data. Because a Cloud Service Provider (CSP) that is employed to store and process user private data is actually not in the trust domains of cloud users, data security becomes a serious issue in cloud computing. One crucial problem in cloud is the cloud data processing result may be incorrect, thus cannot be fully trusted. This calls for research to verify the correctness of data processing at the cloud in order to enhance its trustworthiness, especially for encrypted data processing. At present, various cryptosystems have been proposed to achieve verifiability with different characteristics and quality. However, the literature still lacks a thorough survey to review the current state of art in order to get a comprehensive view of this research field, named verifiable computation. In this paper, we review existing work of verifiable computation by comparing and discussing pros and cons according to performance requirements, highlight open research issues through serious review and analysis and propose a number of research directions in order to guide future research

  • 177.
    Yu, Yong
    et al.
    Big Data Research Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu.
    Xue, Liang
    Department of Computing, The Hong Kong Polytechnic University.
    Au, Man Ho
    Department of Computing, The Hong Kong Polytechnic University.
    Susilo, Willy
    Center for Computer and Information Security Research, School of Computing and Information Technology, University of Wollongong.
    Ni, Jianbin
    Big Data Research Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu.
    Zhang, Yafang
    Big Data Research Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Shen, Jian
    School of Computer and Software at Nanjing University of Information Science and Technology, Nanjing.
    Cloud data integrity checking with an identity-based auditing mechanism from RSA2016In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 62, p. 85-91Article in journal (Refereed)
    Abstract [en]

    Cloud data auditing is extremely essential for securing cloud storage since it enables cloud users to verify the integrity of their outsourced data efficiently. The computation overheads on both the cloud server and the verifier can be significantly reduced by making use of data auditing because there is no necessity to retrieve the entire file but rather just use a spot checking technique. A number of cloud data auditing schemes have been proposed recently, but a majority of the proposals are based on Public Key Infrastructure (PKI). There are some drawbacks in these protocols: (1) It is mandatory to verify the validity of public key certificates before using any public key, which makes the verifier incur expensive computation cost. (2) Complex certificate management makes the whole protocol inefficient. To address the key management issues in cloud data auditing, in this paper, we propose ID-CDIC, an identity-based cloud data integrity checking protocol which can eliminate the complex certificate management in traditional cloud data integrity checking protocols. The proposed concrete construction from RSA signature can support variable-sized file blocks and public auditing. In addition, we provide a formal security model for ID-CDIC and prove the security of our construction under the RSA assumption with large public exponents in the random oracle model. We demonstrate the performance of our proposal by developing a prototype of the protocol. Implementation results show that the proposed ID-CDIC protocol is very practical and adoptable in real life.

  • 178.
    Zhai, Haoyang
    et al.
    School of Communication Information Engineering, University of Electronic Science and Technology of China.
    Liu, Qiang
    School of Communication Information Engineering, University of Electronic Science and Technology of China..
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Anti-ISI Demodulation Scheme and Its Experiment-based Evaluation for Diffusion-based Molecular Communication2018In: IEEE Transactions on Nanobioscience, ISSN 1536-1241, E-ISSN 1558-2639, Vol. 17, no 2, p. 126-133Article in journal (Refereed)
    Abstract [en]

    In diffusion-based molecular communication (MC), the most common modulation technique is based on the concentration of information molecules. However, the random delay of molecules due to the channel with memory causes severe inter-symbol interference (ISI) among consecutive signals. In this paper, we propose a detection technique for demodulating signals, the increase detection algorithm (IDA), to improve the reliability of concentration-encoded diffusion-based molecular communication. The proposed IDA detects an increase (i.e., a relative concentration value) in molecule concentration to extract the information instead of detecting an absolute concentration value. To validate the availability of IDA, we establish a real physical tabletop testbed. And we evaluate the proposed demodulation technique using bit error rate (BER) and demonstrate by the tabletop molecular communication platform that the proposed IDA successfully minimizes and even isolates ISI so that a lower BER is achieved than the common demodulation technique.

  • 179.
    Zhai, Haoyang
    et al.
    University of Electronic Science and Technology of China, Chengdu.
    Nakano, Tadashi
    Osaka University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Yang, Kun
    University of Essex, Colchest.
    Liu, Qiang
    University of Electronic Science and Technology of China, Chengdu.
    Increase detection algorithm for concentration-encoded diffusion-based molecular communication2017In: Proceedings of the 4th ACM International Conference on Nanoscale Computing and Communication, NanoCom 2017, New York: ACM Digital Library, 2017, article id 10Conference paper (Refereed)
    Abstract [en]

    In this paper, we propose a demodulation technique, the increase detection algorithm (IDA), to improve the reliability of concentration-encoded diffusion-based molecular communication. The proposed demodulation technique detects an increase (i.e., a relative concentration value) in molecule concentration to demodulate information as opposed to detecting an absolute concentration value. We evaluate the proposed demodulation technique in terms of bit error rate (BER) and demonstrate that the proposed demodulation technique successfully isolates ISI from concentration-encoded diffusion-based molecular communication to achieve a lower BER than a commonly used demodulation technique.

  • 180.
    Zhang, Baoxian
    et al.
    Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences, Beijing.
    Jiao, Shenzhen
    Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences, Beijing.
    Li, Cheng
    Electrical and Computer Engineering, Faculty of Engineering and Applied Science, Memorial University of Newfoundland, St. John's.
    Jiao, Zheng
    Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences, Beijing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Efficient location-based topology control algorithms for wireless ad hoc and sensor networks2016In: Wireless Communications & Mobile Computing, ISSN 1530-8669, E-ISSN 1530-8677, Vol. 16, no 14, p. 1943-1955Article in journal (Refereed)
    Abstract [en]

    Topology control is an efficient strategy for improving the performance of wireless ad hoc and sensor networks by building network topologies with desirable features. In this process, location information of nodes can be used to improve the performance of a topology control algorithm and also ease its operations. Many location-based topology control algorithms have been proposed. In this paper, we propose two location-assisted grid-based topology control (GBP) algorithms. The design objective of our algorithm is to effectively reduce the number of active nodes required to keep global network connectivity. In grid-based topology control, a network is divided into equally spaced squares (called grids). We accordingly design cross-sectional topology control algorithm and diagonal topology control algorithm based on different network parameter settings. The key idea is to build near-minimal connected dominating set for the network at the grid level. Analytical and simulation results demonstrate that our designed algorithms outperform existing work. Furthermore, the diagonal algorithm outperforms the cross-sectional algorithm

  • 181.
    Zhang, Bo
    et al.
    Nanjing University of Posts and Telecommunications.
    Wang, Yufeng
    Nanjing University of Posts and Telecommunications.
    Wei, Li
    Nanjing University of Posts and Telecommunications.
    Jin, Qun
    Department of Human Informatics and Cognitive Sciences, Waseda University, Saitama.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    BLE mesh: A practical mesh networking development framework for public safety communications2018In: Tsinghua Science and Technology, ISSN 1007-0214, E-ISSN 1878-7606, Vol. 23, no 3, p. 333-346Article in journal (Refereed)
    Abstract [en]

    Owing to advanced storage and communication capabilities today, smart devices have become the basic interface between individuals and their surrounding environment. In particular, massive devices connect to one other directly in a proximity area, thereby enabling abundant Proximity Services (ProSe), which can be classified into two categories: public safety communication and social discovery. However, two challenges impede the quick development and deployment of ProSe applications. From the viewpoint of networking, no multi-hop connectivity functionality component can be directly operated on commercially off-the-shelf devices, and from the programming viewpoint, an easily reusable development framework is lacking for developers with minimal knowledge of the underlying communication technologies and connectivity. Considering these two issues, this paper makes a twofold contribution. First, a multi-hop mesh networking based on Bluetooth Low Energy (BLE) is implemented, in which a proactive routing mechanism with link-quality (i.e., received signal strength indication) assistance is designed. Second, a ProSe development framework called BLE Mesh is designed and implemented, which can provide significant benefits for application developers, framework maintenance professionals, and end users. Rich application programming interfaces can help developers to build ProSe apps easily and quickly. Dependency inversion principle and template method pattern allow modules in BLE Mesh to be loosely coupled and easy to maintain and update. Callback mechanism enables modules to work smoothly together and automation processes such as registration, node discovery, and messaging are employed to offer nearly zero-configuration for end users. Finally, based on the designed ProSe development kit, a public safety communications app called QuoteSendApp is built to distribute emergency information in close area without Internet access. The process illustrates the easy usability of BLE Mesh to develop ProSe apps.

  • 182.
    Zhang, Changsen
    et al.
    College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan.
    Chen, Pengpeng
    College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan.
    Ren, Jianji
    College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan.
    Wang, Xiaofeng
    Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A backoff algorithm based on self-adaptive contention window update factor for IEEE 802.11 DCF2017In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 23, no 3, p. 749-758Article in journal (Refereed)
    Abstract [en]

    The binary exponential backoff (BEB) mechanism is applied to the packet retransmission in lots of wireless network protocols including IEEE 802.11 and 802.15.4. In distributed dynamic network environments, the fixed contention window (CW) updating factor of BEB mechanism can’t adapt to the variety of network size properly, resulting in serious collisions. To solve this problem, this paper proposes a backoff algorithm based on self-adaptive contention window update factor for IEEE 802.11 DCF. In WLANs, this proposed backoff algorithm can greatly enhance the throughput by setting the optimal CW updating factor according to the theoretical analysis. When the number of active nodes varies, an intelligent scheme can adaptively adjust the CW updating factor to achieve the maximal throughput during run time. As a result, it effectively reduces the number of collisions, improves the channel utilization and retains the advantages of the binary exponential back-off algorithm, such as simplicity and zero cost. In IEEE 802.11 distributed coordination function (DCF) protocol, the numerical analysis of physical layer parameters show that the new backoff algorithm performance is much better than BEB, MIMD and MMS algorithm.

  • 183.
    Zhang, Heng
    et al.
    School of Information Engineering, East China Jiaotong University.
    Liu, Yanli
    School of Information Engineering, East China Jiaotong University.
    Xiong, Nealnaixue
    Department of Business and Computer Science, Southwestern Oklahoma State University.
    Imran, Muhammad Al
    College of Computer and Information Sciences, Almuzahmiyah, King Saud University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    An improved similarity based adaptive step size glowworm algorithm2015In: Journal of Internet Technology, ISSN 1607-9264, E-ISSN 2079-4029, Vol. 16, no 5, p. 905-914Article in journal (Refereed)
    Abstract [en]

    This paper presents the similarity based adaptive step size glowworm swarm optimization algorithm (SBASS-GSO), an improved version of glowworm swarm optimization algorithm (GSO). The standard GSO algorithm lacks unified metric standard to different problems in the selection of neighbor set, which makes the algorithm converge slowly because of improper selection. Because the step size s is fixed, the oscillation phenomenon may occur in local search space, which leads to inferior search accuracy In SBASS-GSO algorithm, we change neighborhood definition base on the similarity not on the distance. The neighborhood is selected by computing average similarity, which provides priori knowledge for the adaptive size s. The dynamic size s is useful for removing oscillation phenomenon and improving the convergence speed. Experimental results demonstrate the efficacy of the proposed glowworm algorithm in capturing multiple optima of a series of complex test functions, such as Zakharov and Sphere functions. We also provide some comparisons of SBASS-GSO with GSO and verify the superiority in the precision and convergence speed.

  • 184.
    Zhang, Qingke
    et al.
    School of Computer Science and technology, Engineering Research Center of Digital Media Technology, Ministry of Education, Shandong University, Jinan.
    Liu, Weiguo
    School of Computer Science and technology, Engineering Research Center of Digital Media Technology, Ministry of Education, Shandong University, Jinan.
    Men, Xiangxu
    School of Computer Science and technology, Engineering Research Center of Digital Media Technology, Ministry of Education, Shandong University, Jinan.
    Jiang, Bo
    Shandong Provincial Key Laboratory of Network based Intelligent Computing, University of Jinan.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Vector coevolving particle swarm optimization algorithm2017In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 394-395, p. 273-298Article in journal (Refereed)
    Abstract [en]

    In this paper, we propose a novel vector coevolving particle swarm optimization algorithm (VCPSO). In VCPSO, the full dimension of each particle is first randomly partitioned into several sub-dimensions. Then, we randomly assign either one of our newly designed scalar operators or learning operators to update the values in each sub-dimension. The scalar operators are designed to enhance the population diversity and avoid premature convergence. In addition, the learning operators are designed to enhance the global and local search ability. The proposed algorithm is compared with several other classical swarm optimizers on thirty-three benchmark functions. Comprehensive experimental results show that VCPSO displays a better or comparable performance compared to the other algorithms in terms of solution accuracy and statistical results.

  • 185.
    Zhang, Shengzhi
    et al.
    Florida Institute of Technology, Melbourne, FL.
    Makke, Omar
    Ford Motor, Detroit, MI.
    Gusikhin, Oleg Yu
    Ford Motor, Detroit, MI.
    Shah, Ayush
    Ford Motor, Detroit, MI.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A security model for dependable vehicle middleware and mobile applications connection2018In: VEHITS 2018: Proceedings of the 4th International Conference on Vehicle Technology and Intelligent Transport Systems / [ed] Gusikhin O.,Helfert M., 2018, p. 379-386Conference paper (Refereed)
    Abstract [en]

    Nowadays automotive industry has been working on the connectivity between automobile and smartphones, e.g., Ford’s SmartDeviceLink, MirrorLink, etc. However, as the interoperability between the smartphone and automotive system increase, the security concern of the increased attack surface bothers the automotive industry as well as the security community. In this paper, we thoroughly study the attack vectors against the novel connection framework between automobile and smartphones, and propose a generic security model to implement a dependable connection to eliminate the summarized attack vectors. Finally, we present how our proposed model can be integrated into existing automotive framework, and discuss the security benefits of our model. Copyright

  • 186.
    Zhang, Weizhe
    et al.
    School of Computer Science and Technology, Harbin Institute of Technology.
    Li, Xiong
    School of Computer Science and Technology, Harbin Institute of Technology.
    Xiong, Naixue
    Department of Business and Computer Science, Southwestern Oklahoma State University, Oklahoma, OK.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Android platform-based individual privacy information protection system2016In: Personal and Ubiquitous Computing, ISSN 1617-4909, E-ISSN 1617-4917, Vol. 20, no 6, p. 875-884Article in journal (Refereed)
    Abstract [en]

    With the popularity of mobile phones with Android platform, Android platform-based individual privacy information protection has been paid more attention to. In consideration of individual privacy information problem after mobile phones are lost, this paper tried to use SMS for remote control of mobile phones and providing comprehensive individual information protection method for users and completed a mobile terminal system with self-protection characteristics. This system is free from the support of the server and it can provide individual information protection for users by the most basic SMS function, which is an innovation of the system. Moreover, the protection mechanism of the redundancy process, trusted number mechanism and SIM card detection mechanism are the innovations of this system. Through functional tests and performance tests, the system could satisfy user functional and non-functional requirements, with stable operation and high task execution efficiency

  • 187.
    Zhang, Wenbin
    et al.
    School of Mathematical Sciences, Yangzhou University, Jiangsu.
    Tang, Yang
    Key Laboratory of Advanced Control and Optimization for Chemical Processes, Ministry of Education, East China University of Science and Technology, Shanghai.
    Huang, Tingwen
    Texas A & M University at Qatar.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Consensus of Networked Euler-Lagrange Systems under Time-Varying Sampled-Data Control2018In: IEEE Transactions on Industrial Informatics, ISSN 1551-3203, E-ISSN 1941-0050, Vol. 14, no 2, p. 535-544Article in journal (Refereed)
    Abstract [en]

    This paper is concerned with the consensus of multiple Euler-Lagrange systems with pulse-width modulated sampled-data control. Different from traditional sampled-data strategies, a pulse-modulated sampled-data strategy is developed to realize the consensus of multiple Euler-lagrange systems, in which a pulse function that can be distinct at different sampling instants is proposed to modulate the sampling interval. In addition, a new definition of average sampling interval, which is parallel to the average dwell time in switching control or average impulsive interval in impulsive control, is proposed to characterize the number of the updating of the sampling controller during some certain interval. The proposed average sampling interval makes our sampled-data strategy more suitable for a wide range of sampling signals. By utilizing the comparison principle, a sufficient criterion is obtained to guarantee the consensus of multiple Euler-Lagrange systems. The sufficient criterion is heavily dependent on the actual control duration time, the upper and lower bounds of the pulse function and the communication graph. Finally, a simulation example is presented to verify the applicability of the proposed results.

  • 188.
    Zhang, Yi-Qing
    et al.
    Adaptive Networks and Control Laboratory, Department of Electronic Engineering, and the Center of Smart Networks and Systems, School of Information Science and Engineering, Fudan University.
    Li, Xiang
    Adaptive Networks and Control Laboratory, Department of Electronic Engineering, and the Center of Smart Networks and Systems, School of Information Science and Engineering, Fudan University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Spectral Analysis of Epidemic Thresholds of Temporal Networks2017In: IEEE Transactions on Cybernetics, ISSN 2168-2267, E-ISSN 2168-2275Article in journal (Refereed)
    Abstract [en]

    Many complex systems can be modeled as temporal networks with time-evolving connections. The influence of their characteristics on epidemic spreading is analyzed in a susceptible-infected-susceptible epidemic model illustrated by the discrete-time Markov chain approach. We develop the analytical epidemic thresholds in terms of the spectral radius of weighted adjacency matrix by averaging temporal networks, e.g., periodic, nonperiodic Markovian networks, and a special nonperiodic non-Markovian network (the link activation network) in time. We discuss the impacts of statistical characteristics, e.g., bursts and duration heterogeneity, as well as time-reversed characteristic on epidemic thresholds. We confirm the tightness of the proposed epidemic thresholds with numerical simulations on seven artificial and empirical temporal networks and show that the epidemic threshold of our theory is more precise than those of previous studies.

  • 189.
    Zhang, Yunquan
    et al.
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Cao, Ting
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Li, Shigang
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Tian, Xinhui
    Advanced Computer Systems Research Center, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Yuan, Liang
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Yia, Haipeng
    State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Parallel Processing Systems for Big Data: A Survey2016In: Proceedings of the IEEE, ISSN 0018-9219, E-ISSN 1558-2256, Vol. 104, no 11, p. 2114-2136Article in journal (Refereed)
    Abstract [en]

    The volume, variety, and velocity properties of big data and the valuable information it contains have motivated the investigation of many new parallel data processing systems in addition to the approaches using traditional database management systems (DBMSs). MapReduce pioneered this paradigm change and rapidly became the primary big data processing system for its simplicity, scalability, and fine-grain fault tolerance. However, compared with DBMSs, MapReduce also arouses controversy in processing efficiency, low-level abstraction, and rigid dataflow. Inspired by MapReduce, nowadays the big data systems are blooming. Some of them follow MapReduce's idea, but with more flexible models for general-purpose usage. Some absorb the advantages of DBMSs with higher abstraction. There are also specific systems for certain applications, such as machine learning and stream data processing. To explore new research opportunities and assist users in selecting suitable processing systems for specific applications, this survey paper will give a high-level overview of the existing parallel data processing systems categorized by the data input as batch processing, stream processing, graph processing, and machine learning processing and introduce representative projects in each category. As the pioneer, the original MapReduce system, as well as its active variants and extensions on dataflow, data access, parameter tuning, communication, and energy optimizations will be discussed at first. System benchmarks and open issues for big data processing will also be studied in this survey.

  • 190.
    Zhang, Zhongshan
    et al.
    University of Science and Technology, Beijing, Beijing Engineering and Technology Center for Convergence Networks and Ubiquitous Services, University of Science and Technology Beijing (USTB).
    Long, Keping
    University of Science and Technology, Beijing, Beijing Engineering and Technology Center for Convergence Networks and Ubiquitous Services, University of Science and Technology Beijing (USTB).
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Hanzo, Lajos
    University of Southampton, School of Electronics and Computer Science, University of Southanpton.
    Full-Duplex Wireless Communications: Challenges, Solutions, and Future Research Directions2016In: Proceedings of the IEEE, ISSN 0018-9219, E-ISSN 1558-2256, Vol. 104, no 7, p. 1369-1409Article in journal (Refereed)
    Abstract [en]

    The family of conventional half-duplex (HD) wireless systems relied on transmitting and receiving in different time slots or frequency subbands. Hence, the wireless research community aspires to conceive full-duplex (FD) operation for supporting concurrent transmission and reception in a single time/frequency channel, which would improve the attainable spectral efficiency by a factor of two. The main challenge encountered in implementing an FD wireless device is the large power difference between the self-interference (SI) imposed by the device’s own transmissions and the signal of interest received from a remote source. In this survey, we present a comprehensive list of the potential FD techniques and highlight their pros and cons. We classify the SI cancellation techniques into three categories, namely passive suppression, analog cancellation and digital cancellation, with the advantages and disadvantages of each technique compared. Specifically, we analyze the main impairments (e.g., phase noise, power amplifier nonlinearity, as well as in-phase and quadrature-phase (I/Q) imbalance, etc.) that degrading the SI cancellation. We then discuss the FD-based media access control (MAC)-layer protocol design for the sake of addressing some of the critical issues, such as the problem of hidden terminals, the resultant end-to-end delay and the high packet loss ratio (PLR) due to network congestion. After elaborating on a variety of physical/MAC-layer techniques, we discuss potential solutions conceived for meeting the challenges imposed by the aforementioned techniques. Furthermore, we also discuss a range of critical issues related to the implementation, performance enhancement and optimization of FD systems, including important topics such as hybrid FD/HD scheme, optimal relay selection and optimal power allocation, etc. Finally, a variety of new directions and open problems associated with FD technology are pointed out. Our hope is that this treatise will stimul- te future research efforts in the emerging field of FD communications.

  • 191.
    Zhang, Zhongshan
    et al.
    University of Science and Technology, Beijing.
    Wang, Xiyuan
    University of Science and Technology, Beijing.
    Long, Keping
    University of Science and Technology, Beijing.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Hanzo, Lajos
    University of Southampton.
    Large-scale MIMO-based wireless backhaul in 5G networks2015In: IEEE wireless communications, ISSN 1536-1284, E-ISSN 1558-0687, Vol. 22, no 5, p. 58-66Article in journal (Refereed)
    Abstract [en]

    In order to enhance the attainable transmission rates to the levels specified by future wireless communications, a paradigm shift from conventional small-scale MIMO to large-scale (LS)-MIMO is highly desirable. LS-MIMO technology as a "cleanslate" approach is shown to be capable of dramatically increasing the area spectral efficiency (SE, as measured in bits per second per Hertz per square kilometer) while simultaneously improving the energy efficiency as measured in bits per Joule. Furthermore, the concept of LS-MIMO has established itself as a beneficial transmission/detection paradigm, thus substantially reducing the impact of interference relying on some advanced transmit precoding/ beamforming/detection techniques. This article is intended to offer a state-of-the-art survey on LS-MIMO research, to promote the discussion of its beneficial application areas and the research challenges associated with BF aided wireless backhaul, LS-MIMO channel modeling, signal detection, and so on. Additionally, a joint group power allocation and pre-beamforming scheme called JGPAPBF is proposed to substantially improve the performance of LS-MIMO-based wireless backhaul in heterogeneous networks. Our hope is that this article will stimulate future research efforts.

  • 192.
    Zhou, Biyu
    et al.
    Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences, Bejing.
    Zhang, Fa
    Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    Wang, Lin
    SnT, University of Luxembourg.
    Hou, Chenying
    Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences, Bejing.
    Anta, Antonio Fernández
    IMDEA Networks Institute.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Wang, Youshi
    Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences, Bejing.
    Wu, Jie
    Department of Computer and Information Sciences, Temple University, Philadephia.
    Liu, Zhiyong
    State Key Laboratory for Computer Architecture, Beijing Key Laboratory of Mobile Computing and Pervasive Device, Institute of Computing Technology, Chinese Academy of Sciences, Beijing.
    HDEER: A Distributed Routing Scheme for Energy-Efficient Networking2016In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 34, no 5, p. 1713-1727Article in journal (Refereed)
    Abstract [en]

    The proliferation of new online Internet services has substantially increased the energy consumption in wired networks, which has become a critical issue for Internet service providers. In this paper, we target the network-wide energy-saving problem by leveraging speed scaling as the energy-saving strategy. We propose a distributed routing scheme-HDEER-to improve network energy efficiency in a distributed manner without significantly compromising traffic delay. HDEER is a two-stage routing scheme where a simple distributed multipath finding algorithm is firstly performed to guarantee loop-free routing, and then a distributed routing algorithm is executed for energy-efficient routing in each node among the multiple loop-free paths. We conduct extensive experiments on the NS3 simulator and simulations with real network topologies in different scales under different traffic scenarios. Experiment results show that HDEER can reduce network energy consumption with a fair tradeoff between network energy consumption and traffic delay.

  • 193.
    Zhou, Fanfu
    et al.
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Qi, Zhengwei
    School of Software, Shanghai Jiao Tong University, Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Yao, Jianguo
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Guan, Haibing
    School of Software, Shanghai Jiao Tong University, Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    D2FL: design and Implementation of Distributed Dynamic Fault Localization2018In: IEEE Transactions on Dependable and Secure Computing, ISSN 1545-5971, E-ISSN 1941-0018, Vol. 15, no 3, p. 378-392Article in journal (Refereed)
    Abstract [en]

    Compromised or misconfigured routers have been a major concern in large-scale networks. Such routers sabotage packet delivery, and thus hurt network performance. Data-plane fault localization (FL) promises to solve this problem. Regrettably, the path-based FL fails to support dynamic routing, and the neighbor-based FL requires a centralized trusted administrative controller (AC) or global clock synchronization in each router and introduces storage overhead for caching packets. To address these problems, we introduce a dynamic distributed and low-cost model, D2FL. Using random 2-hop neighborhood authentication, D2FL supports volatile path without the AC or global clock synchronization. Besides, D2FL requires only constant tens of KB for caching which is independent of the packet transmission rate. This is much less than the cache size of DynaFL or DFL which consumes several MB. The simulations show that D2FL achieves low false positive and false negative rate with no more than 3% bandwidth overhead. We also implement an open source prototype and evaluate its effect. The result shows that the performance burden in user space is less than 10% with the dynamic sampling algorithm. 

  • 194.
    Zhou, Lina
    et al.
    Information Systems Department, UMBC, Baltimore.
    Pan, Shimei
    Information Systems Department, UMBC, Baltimore.
    Wang, Jianwu
    Information Systems Department, UMBC, Baltimore.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Machine Learning on Big Data: Opportunities and Challenges2017In: Neurocomputing, ISSN 0925-2312, E-ISSN 1872-8286, Vol. 237, p. 350-361Article in journal (Refereed)
    Abstract [en]

    Machine learning (ML) is continuously unleashing its power in a wide range of applications. It has been pushed to the forefront in recent years partly owing to the advert of big data. ML algorithms have never been better promised while challenged by big data. Big data enables ML algorithms to uncover more fine-grained patterns and make more timely and accurate predictions than ever before; on the other hand, it presents major challenges to ML such as model scalability and distributed computing. In this paper, we introduce a framework of ML on big data (MLBiD) to guide the discussion of its opportunities and challenges. The framework is centered on ML which follows the phases of preprocessing, learning, and evaluation. In addition, the framework is also comprised of four other components, namely big data, user, domain, and system. The phases of ML and the components of MLBiD provide directions for the identification of associated opportunities and challenges and open up future work in many unexplored or under explored research areas.

  • 195.
    Zhu, Nanhao
    et al.
    CETC Group, GCI Science and Technology Co.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A generic framework for energy evaluation on wireless sensor networks2016In: Wireless networks, ISSN 1022-0038, E-ISSN 1572-8196, Vol. 22, no 4, p. 1199-1220Article in journal (Refereed)
    Abstract [en]

    Due to reliance on batteries, energy consumption has always been of significant concern for sensor node networks. This work presents the design and implementation of a house-build experimental platform, named Energy Management System for Wireless Sensor Networks (EMrise) for the energy management and exploration on wireless sensor networks. Consisting of three parts, the SystemC-based simulation environment of EMrise enables the HW/SW co-simulation for energy evaluation on heterogeneous sensor networks. The hardware platform of EMrise is further designed to facilitate the realistic energy consumption measurement and calibration as well as accurate energy exploration. In the meantime, a generic genetic algorithm based optimization framework of EMrise is also implemented to automatically, quickly and intelligently fine tune hundreds of possible solutions for the given task to find the best suitable energy-aware tradeoffs

  • 196.
    Zhu, Nanhao
    et al.
    CETC Group, GCI Science and Technology Co.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    EMrise: An Energy Management Platform for WSNs/WBANs2016In: Energy Management in Wireless Cellular and Ad-hoc Networks, Encyclopedia of Global Archaeology/Springer Verlag, 2016, p. 367-395Chapter in book (Refereed)
    Abstract [en]

    Due to reliance on batteries, energy consumption has always been of significant concern for sensor node networks. This work presents the design and implementation of a house-build experimental platform, named EMrise (Energy Management System for Wireless Sensor Networks) for the energy management and exploration on wireless sensor networks. Consisting of three parts, the SystemC-based simulation environment of EMrise enables the HW/SW co-simulation for energy evaluation on heterogeneous sensor networks. The hardware platform of EMrise is further designed to facilitate the realistic energy consumption measurement and calibration as well as accurate energy exploration. In the meantime, a generic GA (genetic algorithm) based optimization framework of EMrise is also implemented to automatically, quickly and intelligently fine tune hundreds of possible solutions for the given task to find the best suitable energy-aware tradeoffs.

  • 197.
    Zhu, Xudong
    et al.
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Li, Jun
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Gao, Xiaofeng
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Wu, Fan
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Chen, Guihai
    Shanghai Key Laboratory of Scalable Computing and Systems, Department of Computer Science and Engineering, Shanghai Jiao Tong University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    A distributed approximation for multi-hop clustering problem in wireless sensor networks2016In: 2015 IEEE Global Communications Conference (GLOBECOM): San Diego, CA, 6-10 Dec 2015, Piscataway, NJ: IEEE Communications Society, 2016, article id 7416941Conference paper (Refereed)
    Abstract [en]

    In wireless sensor networks (WSNs), there is no predefined infrastructure. Nodes need to frequently flood messages to discover routes, which badly decreases the network performance. To overcome such drawbacks, WSNs are often grouped into several disjointed clusters, each with a representative cluster head (CH) in charge of the routing process. In order to further improve the efficiency of WSNs, it is crucial to find a cluster partition with minimum number of clusters and the distance between each node to its corresponding CH can be bounded by a constant number of hops. Finding such a partition is defined as minimum d-hop cluster head set (d-MCHS) problem, which is proved to be NP-hard. In this paper, we propose a distributed approximation algorithm, named d^2-Cluster, to address d-MCHS problem and prove that the approximation ratio of d^2-Cluster under unit disk graph (UDG) is a constant factor \lambda which is related to d. To the best of our knowledge, it is the first constant approximation ratio for d-MDS problem in UDG

  • 198.
    Zhuang, Hui
    et al.
    Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, University of Science and Technology.
    Li, Jintao
    Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, University of Science and Technology.
    Geng, Weibiao
    Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, University of Science and Technology.
    Dai, Xiaoming
    Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, University of Science and Technology.
    Zhang, Zhogshan
    Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, University of Science and Technology.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Duplexer design and implementation for self-interference cancellation in full-duplex communications2016In: European Signal Processing Conference, EUSIPCO 2016, Piscataway, NJ: IEEE Computer Society Digital Library, 2016, p. 125-129, article id 7760223Conference paper (Refereed)
    Abstract [en]

    The full-duplex (FD) based devices are capable of concurrently transmitting and receiving signals with a single frequency band. However, a severe self-interference (SI) due to the large difference between the power of the devices' own transmission and that of the signal of interest may be imposed on the FD based devices, thus significantly eroding the received signal-to-interference-plus-noise ratio (SINR). To implement the FD devices, the SI power must be sufficiently suppressed to provide a high-enough received SINR for satisfying the decoding requirement. In this paper, the design and implementation of the duplexer for facilitating SI cancellation in FD based devices are investigated, with a new type of duplexer (i.e. an improved directional coupler) designed and verified. It is shown that the SI suppression capability may be up to 36 dB by using the proposed design, which is much higher than that attainable in the commonly designed ferrite circulator

1234 151 - 198 of 198
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf