International Journal of Computer Network and Information Security
International Journal of Computer Network and Information Security (IJCNIS) is a peer reviewed journal in the field of Computer Network and Information Security. The journal is published 12 issues per year by the MECS Publisher from 2012. All papers will be blind reviewed. Accepted papers will be available on line (free access) and in printed version. No publication fee.
IJCNIS is publishing refereed, high quality original research papers in all areas of Computer Network and Information Security.
IJCNIS has been indexed by several world class databases: Google Scholar, Microsoft Academic Search, CrossRef, DOAJ, IndexCopernicus, INSPEC(IET), EBSCO, VINITI, JournalSeek, ULRICH's Periodicals Directory, WordCat, Scirus, Academic Journals Database, Stanford University Libraries, Cornell University Library, UniSA Library, CNKI Scholar, ProQuest, J-Gate, ZDB, BASE, OhioLINK, iThenticate, Open Access Articles, Open Science Directory, National Science Library of Chinese Academy of Sciences, The HKU Scholars Hub, etc..
The journal publishes original papers in the field of computer network and information security which covers, but not limited to the following scope:
New generation network and its application
Network architectures and protocols
Network University
Network Curriculum
Computer Network Education
Computer Distance Learning
IPV6
Wireless Network
Wireless sensors networking
Grid Computing
Cloud computing
Cluster Computing
Distributed computing
Peer-to-Peer network
RFID Technologies
E-commerce protocols
E-Health
Intrusion Detection and Prevention
Biometric Security and Artificial Intelligence
Cryptography and security protocols
Authentication and Identification
Mobile System Security
Security in social networks
Security for web services
Sensor and Mobile Ad Hoc Network
Security for Web Services
Security for Personal Data and Databases
Piracy detection and tracing
Denial of Service and other attacks
Management of Computing Security
Intelligent Multimedia Security Services
Channel Modeling and Characterization
Modulation/Coding/Signal Processing
B3G Systems, WiMAX and WLAN
Authentication, Authorization and Billing
Applications and Services for B3G/4G era
Radio Resource Management
Network measurement and Management
Theory and Models of Trust
Trust computing
Education of network
Bayesian Networks, Fuzzy and Rough Set
Intrusion Detection and Prevention
Biometric Security and Artificial Intelligence
Cryptography and security protocols
Authentication and Identification
Bayesian Networks, Fuzzy and Rough Set
Mobile System Security
Ubiquitous Computing Security
Sensor and Mobile Ad Hoc Network Security
Security in Wireless Network
Security of GSM/GPRS/UMTS systems
Security for Grid Computing
Security for Web Services
Security for Personal Data and Databases
Peer-to-Peer Security
Risk Assessment
Modern Education & Computer Science Press
Выпуски журнала
Статьи журнала
Tree-Based Matched RFID Yoking Making It More Practical and Efficient
Статья научная
A Radio Frequency Identification (RFID) yoking proof allows an off-line verifier to make sure whether two tags are simultaneously present. Due to off-line property, a reader cannot differentiate valid from invalid proof records when it probes tags, and would generate lots of useless data. This paper proposes a tree-based matched RFID yoking scheme which enhances the cost of identification from O(log N) to O(1), where N is the number of tags, and allows the reader to collect only those matched tags such that it significantly reduces useless data for the verifier to validate off-line.
Бесплатно
A Fair-Priority MAC design in Networked Control System
Статья научная
Media Access Control (MAC) protocols in Wireless Networked Control System (WNCS) must minimize the radio energy costs in sensor nodes. Latency and throughput are also important design features for MAC protocols in the applications. But most of them cannot guarantee quality for real-time traffic. This paper studies the state of the art of current real-time MAC protocols, and then introduces a medium access control protocol and a improved protocol that provide multiple priority levels and hard real-time transmission. The channel is accessed by sensors according to their priorities. Sensors send frames in a round manner with same priority. The fairness between different priorities is provided. The channel access procedure is divided into two stages: broadcast period and transmission period. Simulation and experiment results indicate that our protocol provides high channel utilization and bounded delays for real-time communication and can be well applied in the many fields especially the dynamic wireless sensor networks.
Бесплатно
Performance Analysis of Cluster-based Wireless Sensor Networks with Application Constraints
Статья научная
Clustering is an efficient techniques used to achieve the specific performance requirements of large scale wireless sensor networks. In this paper we have carried out the performance analysis of cluster-based wireless sensor networks for different communication patterns formed due to application constraints based upon LEACH protocol, which is among the most popular clustering protocols proposed for these types of networks. Simulation results based upon this protocol identify some important factors that induce unbalanced energy consumption among sensor nodes and hence affect the network lifetime. This highlights the need for an adaptive clustering protocol that can increase the network lifetime by further balancing the energy consumption among sensor nodes. Paper concludes with some recommendations for such protocol.
Бесплатно
Using P systems to Solve the Discrete Logarithm Problem used in Diffie-Hellman Key Exchange Protocol
Статья научная
The discrete logarithm problem has been used as the basis of several cryptosystems, especially the Diffie- Hellman key exchange protocol. P systems are a cluster of distributed parallel computing devices in a biochemical type. This paper presents a P system with active membranes and strong priority to solve the discrete logarithm problem used in Diffie-Hellman key exchange protocol. To the best of our knowledge, it’s the first time to solve the problem using P systems.
Бесплатно
