Forthcoming and Online First Articles

International Journal of Internet Protocol Technology

International Journal of Internet Protocol Technology (IJIPT)

Forthcoming articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Online First articles are published online here, before they appear in a journal issue. Online First articles are fully citeable, complete with a DOI. They can be cited, read, and downloaded. Online First articles are published as Open Access (OA) articles to make the latest research available as early as possible.

Open AccessArticles marked with this Open Access icon are Online First articles. They are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues are published online.

We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

International Journal of Internet Protocol Technology (12 papers in press)

Regular Issues

  • A cross encryption scheme for data security storage in cloud computing environment   Order a copy of this article
    by Haiyan Kang, Jie Deng 
    Abstract: Cloud computing is one of the popular technologies in the development of information technology. Cloud computing not only provides users with high-performance computing, but also meets the needs of large-scale data storage. However, because the storage service provided by cloud computing is completely transparent to users, users can not understand whether their data is safe in the cloud computing environment. The resulting distrust has brought great obstacles to the development of cloud computing. Therefore, this paper first describes the basic knowledge and system architecture of cloud storage, and analyzes the development status of cloud storage. Secondly, in order to ensure the storage security of user data in the cloud computing environment, this paper studies the data encryption algorithm, and proposes a cross encryption scheme of data security storage in the cloud computing environment. Finally, the scheme is compared with the traditional hybrid encryption method. The experimental results show that the scheme has the advantages of good encryption and decryption effect, fast execution speed and high security. It is an ideal scheme for data security storage in cloud computing environment.
    Keywords: cloud computing; data encryption; DES; RSA; cross encryption.

  • Practical and Scalable Access Control Mechanism for Wireless Sensor Networks   Order a copy of this article
    by Ummer Khan, Ajaz Hussain Mir 
    Abstract: The Access Control Mechanism is a necessary security primitive for deploying a new node within the resource-constrained WSN. The mechanism prevents malicious node deployment, which could disrupt network operations entirely. In addition to accommodating the resource-constrained nature of WSN, the design of the new node access control method must also meet specific security and functional specifications. In literature, new node access control schemes have been proposed for WSN, focusing on efficiency and security strength. However, less attention is given to the functional specification of scalability and independence from time synchronisation. In this paper, an ECC-based new node access control is presented. Besides being computationally effective and secure, the scheme is scalable and doesn't have time synchronization issues. The proposed scheme's security strength and correctness have been proven using BAN logic and the Random Oracle Model. Simulations on AVISPA and Scyther tools have been performed for automatic security verification of the proposed method. The proposed scheme has also been programmed on TinyOS to perform simulation on the TOSSIM simulator and test-bed implementation on MicaZ motes.
    Keywords: Wireless Sensor network ;Access Control ;Authentication ;Key establishment; Elliptical curve Cryptography; AVISPA; TinyOS; TinyECC.

  • Secure and Verifiable Outsourcing of Euclidean Distance and Closest Pair of Points with Single Untrusted Cloud Server   Order a copy of this article
    by Shilpee Prasad, B.R. Purushothama 
    Abstract: Due to the resource constraints, often client has to outsource the computation to the untrusted cloud service provider. As cloud service providers are often untrusted, the result of the computation should be verified for the correctness. Also, the cost of verification should be less than the cost of actual computation. In this paper, we address the problem of verifying the computation of a geometric problem. In particular, we address the problem of verifying the Euclidean distance and closest pair of points returned by the single untrusted cloud service provider. We have designed verification schemes for outsourcing Euclidean distance and closest pair of points. We have proved that the proposed scheme has negligible server cheating probability. Also, the proposed scheme preserves the privacy of the outsourced data. We have implemented the closest pair of points verification scheme and show that the cost of verification is very less compared to actual computation cost. Also, compared to existing scheme the proposed scheme has less server cheating probability.
    Keywords: Outsource computation; Closest pair of points; Euclidean distance;\r\nPrivacy preserving; Cloud service provider.

  • RAD: Reinforcement Authentication Model based on DYMO Protocol for MANET   Order a copy of this article
    by Rushdi Hamamreh, Mohammed Ayyad, Mohammed Abutaha 
    Abstract: This article aimed to develop a new model based on DYMO protocol where a modification was proposed to route discovery and route maintenance processes. In route discovery process we made an authentication process between the nodes by using MD5 hashing algorithm, then we used reinforcement learning to improve the route maintenance process based on machine learning approach. At the end we used Diffie-Hellman key management to exchange the secret key to encrypt and decrypt the data between Source S and Destination D. When we tested the proposed protocol, the results show improvement in the performance of MANETs, despite the little increased in the end to end delay in comparison with DYMO protocol. This is due to the overheads in authentication and encryption processes.
    Keywords: MANET; DYMO; authentication; reinforcement; security; encryption; hashing; key distribution; nodes; path.

  • Research on Personalized Privacy-preserving Model of Multi-Sensitive Attributes   Order a copy of this article
    by Haiyan Kang, Yaping Feng, Xiameng Si, Kaili Lu 
    Abstract: In order to protect user information from being leaked, as far as possible to improve the availability of published data and realize the safe and efficient information sharing. Aiming at the anonymous privacy-preserving of multi-sensitive attribute data release in logistics industry, this paper proposes a Personalized privacy-preserving model of Multi-Sensitive attributes with Weights Clustering and Dividing (PMSWCD) by analyzing existing model. Firstly, according to the different needs of users, the corresponding weight is set for each sensitive attribute value to realize personalization and then weighted clustering. Secondly, divide the records according to the weighted average value, and select records to establish a group that satisfies l-diversity. Finally, release data based on the idea of multi-dimensional bucket. Through experimental analysis, compared with WMBF algorithm, the release ratio of important data of PMSWCD algorithm proposed in this paper is significantly improved, reaching more than 95%, which improves the availability of data.
    Keywords: Multi-Sensitive attributes; data release; personalized; privacy-preserving; weights clustering; dividing; multi-dimensional bucket; l-diversity.

  • Improved network performance in CPS communication with distributed IPC mechanisms of recursive internetworking architecture (RINA)   Order a copy of this article
    by Bhushana Samyuel Neelam, Benjamin A. Shimray 
    Abstract: The network convenience provided by TCP/IP networks in cyber-physical systems (CPS) communication redefined them as intelligent real-time systems. Along with convenience and intelligence, it also brought various network concerns into CPS communication. Some of the concerns include increased response times due to communication overheads, unnecessary delays in packet forwarding due to computational overheads, unwanted Cyber threats in critical CPS infrastructures like energy, oil, gas, etc. As future networks are focused on achieving an optimum networking solution, Recursive internetworking architecture (RINA) based on distributed IPC mechanism seems to be a promising solution. The proposed work discussed extending distributed IPC mechanisms to the client-server communication model of CPS to extract improved and consistent response times compared to TCP/IP. A CPS client-server model is developed on RINA and TCP/IP networks with connection-oriented protocols. Response times are measured by controlling the actuators, sensing the sensors' data. The comparative analysis demonstrates that RINA reduced response times by almost 50% to TCP/IP and provided more consistency than the TCP/IP.
    Keywords: Future network architectures; distributed IPC; CPS; latency; RINA.
    DOI: 10.1504/IJIPT.2023.10045826
     
  • Validating and Verifying LwM2M Clients with Event-B   Order a copy of this article
    by Ines Mouakher, Fatma Dhaou, J. Christian Attiogbé 
    Abstract: Lightweight Machine to Machine (LwM2M) is an open industry standard built to provide a means to remotely perform service enablement and application management for the Internet of Things (IoT). It is a communication protocol used between a client software on an IoT device, and a server software. Modelling, formal verification and validation are crucial and necessary to increase protocol reliability. In this paper, we propose a refinement-based approach that helps us to model, to validate and to verify gradually the LwM2M specification, which was carried out using Event-B and Rodin/ProB frameworks. We present a formal model of the LwM2M client, and we verify deadlock freedom and some functional safety properties like consistency of its configuration. The verification is ensured by theorem prover and model checking techniques, and the validation is supported by animation and bounded exploration of the client formal model. Moreover, the transformation into Event-B opens several possibilities to analyze existing implementations of the LwM2M client and to derive both test cases and executable code.
    Keywords: IoT; internet of things; lightweight protocols; device management; OMA LwM2M; verification and validation; V&V; Event-B.

  • Relaxed Hybrid Routing To Prevent Consecutive Attacks In Mobile Ad-Hoc Networks   Order a copy of this article
    by Dr J. Viji Gripsy, Kanchana K.r 
    Abstract: In the current trends, wi-fi networks and cellular ad-hoc community (MANET) have yielded incredible opportunity and recognition. This opportunity and popularity insisted on many forms of studies to recognition on it. This enormously bendy nature of the MANET additionally creates many community overall performance-associated and protection associated problems. Numerous security vulnerabilities threaten the technique in MANET in diverse ways . Collection variety attacks including grey hole and black hole assaults are such risky assaults that drastically weaken the functioning and performance of the network in specific situations. The proposed technique generates a fusion defines and that organizes with the ad hoc on-call for distance vector (AODV) routing protocol to slight these assaults. the new and changed protocol is called as SRD-AODV (secure route Discovery-Adhoc On-demand Distance Vector) protocol. This protocol includes one-of-a-kind additives and techniques to offer each proactive and reactive answers through deploying powerful authentication the use of the Elliptic Curve Diffie-Hellman algorithm (ECDHA) techniques. This additionally aims to comfortable the records packets and routing desk records and subsequently the incursion detection and prevention from sequential attacks in MANET. The performance of this protocol is measured with the help of overall performance parameters inclusive of packet shipping ratio, and put off. The SRD-AODV protocol additionally compares with attacked AODV and other present protocols.
    Keywords: MANET; Sequential Routing Attacks; AODV; Cryptography; Blackhole attack; Grey hole attack; Denial of Service.

  • Cognitive Wireless Communication Network Information Sharing Method Based On Blockchain Technology   Order a copy of this article
    by Wei Luo 
    Abstract: Cognitive Wireless Communication Networks provides a unified vision of the latest developments to maximize limited radio bandwidth use. The challenges of wireless technologies increase; economics and legislation would demand new multidisciplinary frameworks for spectrum sharing. Recently, cognitive radio technologies have been implemented to deal with the issue of spectrum scarcity. In this paper, a cognitive wireless network based on blockchain technology (CWN-BT) has been proposed. Blockchain strategies can provide encrypted communication networks for closed wireless transactions. Due to its multiple advantages, such as transaction speed, confidentiality, better security, increased performance, etc., blockchain technology has been considered one of the most researched fields in recent years. Since each device in a blockchain depends on the data stored in a successive unit,it ensures secured transactions and resources in the wireless cognitive network. The outcome shows that Blockchain helps to enhance wireless network security in different ways.
    Keywords: Cognitive wireless network; blockchain technology; spectrum sharing.

  • Mathematical Modelling of Packet Transmission during Reclamation Period in NewReno TCP and CTCP   Order a copy of this article
    by Bhavika Gambhava, C.K. Bhensdadia 
    Abstract: Usage of wireless links along with wired links has made the Internet growth viable even in isolated places. TCP/IP protocol suite is an indispensable element of the Internet. TCPs congestion control immensely contributes in the performance and robustness of the Internet. Flow control of TCP is invoked when a packet loss is detected by the sender. Unconditional reduction of congestion window may be considered unbefitting and results in to inferior performance. The issue is compounded in wireless channels where packet losses are frequently due to channel errors rather than congestion. In this condition, treatment for losses can be different for congestion and corruption to improve efficiency. Composite TCP (CTCP) is a loss and delay based mechanism. CTCP utilises duplicate acknowledgements along with RTT estimations to make a fair decision about the type of loss. The primary objective of this paper is to show the critical impact of Reclamation Period to regain the original value of cwnd after an episode of error. In addition to this, the paper attempts to show the performance benefit of CTCP so as to justify that if an appropriate value of cwnd can be determined though a reasonable approach, it leads to significant performance improvement without hurting the other concerns. CTCP improves performance by 96.02% and 11.54% in case of 0.001 packet error rate for erroneous and congested networks respectively. The improvement is higher with increase in error rate.
    Keywords: Reclamation Period; Round Trip Time; Congestion Window; Fast Recovery; TCP; CTCP; cwnd; ssthresh; SRTT.

  • SNTAM - Secure Neuro-Fuzzy Based Trusted Neighbor Selection and Attackers Detection in Multipath Ad-Hoc Network   Order a copy of this article
    by Sandeep Patil, Lalita Admuthe, Meenakshi Patil 
    Abstract: An ad-hoc network comprises a set of wireless nodes with no pre-defined infrastructure. They are provisional in the environment and can be created wherever and dispersed behind a restricted period. They are often validated by the deployment scenarios, where one cannot place and deal with infrastructure. e.g. combat zone, a catastrophe relief or an impulsive meeting and so on. The most well-known attribute of a wireless network is dynamic. They also have inadequate channel strength, security belief issues and functioning with narrowed battery power. In confront of the route, the data packets of an assured pathway to remove the data misleading and control overheads that consume power and bandwidth. This study explores the capabilities of working with different attacks like a vampire attack. This attack is forever hindrance to the networks by reducing the nodes bandwidth and energy. In addition, the protocol detects a replica attack that can capture the neighbor's address and act as a genuine node on the network. These two attacks can spoil the entire system activities and use network abilities. Consequently, creates questions about the trust among the nodes and the honesty of the transmissions. The proposed Secure Neuro-fuzzy Based Trusted Neighbor Selection and Attackers Detection in Multipath Ad-Hoc Network (SNTAM) protocol focused to eliminate these attackers from the network to form the communication path by an optimized way of Neuro-fuzzy techniques. The results show that SNTAM gives effective results in securing the network in all the parameters and attributes especially packet delivery ratio (PDR) which is almost 100% and residual energy of nodes which is more than compared protocol. Furthermore, SNTAM protocol can avoid sampled malicious nodes effectively.
    Keywords: MANET; Channel Capacity; Energy; Attackers; Vampire attack; Replica Attack; Trust; Reliability.

  • Computation on scheduling attacks and optimal resource utilization in wireless sensor networks via optimization techniques   Order a copy of this article
    by Narasimha Prasad S, Senthamil Selvan K, Lakshmi Dhevi B, Niranjil Kumar A 
    Abstract: Security issues of wireless sensor nodes for classifying sensory data and is accuracy is needed to prevent wastage of sensor resources. The limitation occurs due to processing of small scale samples in training or data imbalance which occurs due to nodal density. In this context pre-processing of sensor data to overcome scheduling attacks is considered with two algorithms proposed. The first is “Time Stamp Reordering for Scheduling Attack” (TSRSA) and second is “Energy Efficiency based Routing using Simulated Annealing” (EERSA).The former is susceptible to scheduling attacks whereas the later alleviate this by using Simulated Annealing. EERSA method provides optimal moves as data traverses using energy bound values as well time bound transitions using propagation delay and offset values. The simulation of both developed protocols its misalignment ratio and consolidated residual energy are measured and compared.
    Keywords: Scheduling attacks; Misalignment ratio; Wireless Sensor Networks.
    DOI: 10.1504/IJIPT.2023.10050332