Journal articles - International Journal of Computer Network and Information Security

All articles: 1240

Role of Mobile Agents in the Layered Architecture of Mobile Ad-hoc Networks

Role of Mobile Agents in the Layered Architecture of Mobile Ad-hoc Networks

Bindiya Bhatia, M.K.Soni, Parul Tomar

Scientific article

In today's world mobile agents and mobile ad-hoc networks are the two technologies that are contributing towards better connectivity and communicability. When the two technologies used jointly, the interest is increased. Due to the properties like self-configuration and infrastructure-less, the mobile ad-hoc networks provide various remarkable features. But the various challenges are also associated with mobile ad-hoc networks like dynamic topology, mobility, energy constraint etc. Mobile agent provides solution to these challenges. A mobile agent is a new way of computer interactions and provides better options for the developers to create applications based on connectivity. Mobile agents move around the ad-hoc networks in a different and better way than the other widespread client server architecture based applications. Due to their mobility and autonomy these agents can perform various functions in mobile ad-hoc networks like topology discovery, routing, key management, congestion control etc. The paper reviews the role of the mobile agents in the mobile ad-hoc networks, and emphasizes its application on the various layers of a layered architecture of mobile ad-hoc networks and concludes its merits as compared to other conventional approaches.

Free

Role of scripting language on Unix operating system for risk assessment

Role of scripting language on Unix operating system for risk assessment

Padma Lochan Pradhan

Scientific article

This proposed dynamic scripting language is a vital role in the complex real-time operating system to review, analysis, protect, detect & correct on data, application, network, software and hardware as per the desired manner to achieve the highest performance of the RTOS. The dynamic language is a primarily responsible for analysis of the fine tuning, performance, fault-tolerance, throughput of the system components at the right time. This research work contributes to the design and development of an automated mechanism that objective to investigate the minimal resource utilization to the robust computing services. We have to define & deployment the Unix scripting codes for real time operating system to achieve the reliability, scalability of the real-time MIMD platform. We have to run this SPL on background process to integrate with real-time hardware, software, network to facilitate to other dependants components. This dynamic code is integrating, interfacing, communicating, message passing, replicating among the several subjects and objects over a real-time operating system.

Free

Router-based Content-aware Data Redirection for Future CDN Systems

Router-based Content-aware Data Redirection for Future CDN Systems

Janaka L. Wijekoon, Erwin H. Harahap, Shinichi Ishida, Rajitha L. Tennekoon, Hiroaki Nishi

Scientific article

Delivery of data-enriched applications has become a top priority on the Internet, and Internet users are demanding faster and higher-quality services. Cater such requirements, Content Delivery Networks (CDNs) were introduced. However, the growth rate of information on the Internet requires infrastructural modifications to keep the consistency while maintaining quality of the Internet services. To this end, the Service-oriented Router is introduced to provide content based services by shifting the current Internet infrastructure to information-based open innovation platform. In this study, initially we provide implementation notes of a software-designed SoR. Then we propose a new method of CDN Request Redirection (RR) (SoR-based RR), which is designed to redirect packets based on the content of packets and the status of content servers using an SoR as an edge router of a CDN. Furthermore, we present the design and implementation of a prototype to realize the SoR-based RR in a testing network. By analyzing the result of the prototype implementation, we show that the SoR-based RR can enhance the both client experience and faster adaptations to the server changes in CDN environments.

Free

Routers Sequential Comparing Two Sample Packets for Dropping Worms

Routers Sequential Comparing Two Sample Packets for Dropping Worms

Kannaiyaraja, Babu, Senthamaraiselvan, Arulandam

Scientific article

Network IDS perform a vital role in protecting network connection in the worldwide from malicious attack. Nowadays the recent experiment work related to inspecting the packet for network security that is a minimal amount of process overhead. In this work, analysis the network intrusion for packet inspection that is together the testing data which inspect only group of packet selected as sample predominantly from small flows and select first two packets and comparing with each other overall packets and create tabelazied for find out different malicious debuggers. This experiment results shows that overcome the existing work.

Free

SM-SIP: Seamless Mobility Management for Heterogeneous Wireless Networks

SM-SIP: Seamless Mobility Management for Heterogeneous Wireless Networks

Khaled Zeraoulia, Nadjib Badache

Scientific article

Next-generation wireless networks (NGN) and internet of Thing (IoT) become two leaders of designing mobile multimedia services. The deployment of these services using heterogeneous wireless networks will be the important factor that leads to profound change in the way that these services are delivered. Also, how these services will be managed is a real challenge. Consequently, Seamless mobility management should be provided to support various services in heterogeneous networks. A SIP-based network appears as a very attractive alternative to mobile multimedia applications. In this paper, we introduce a novel mobility management strategy for mobile SIP networks, in which we develop a seamless handover used mobile SIP scheme called SM-SIP (Seamless Mobility Management for Heterogeneous Wireless Networks for Mobile SIP environment). SM-SIP can significantly reduce the system signaling cost and handover delay, by proactively processing the address allocation and session updates using link layer information of wireless networks. Also, our performance study shows that SM-SIP reduces efficiently packets loss using an anticipated buffering scheme.

Free

SMAODV: A Novel Smart Protocol for Routing in Ad-hoc Wireless Networks Using the PageRank Algorithm

SMAODV: A Novel Smart Protocol for Routing in Ad-hoc Wireless Networks Using the PageRank Algorithm

Ali Gozali, Keivan Borna

Scientific article

The Ad-Hoc networks are the kind of wireless networks that their configuration is done automatically and also the nodes are moving with a certain speed. For this reason the created paths (routes) are often unstable and these paths are usually broken by switching nodes. In this respect, choosing the right path and routing mechanism become more diverse in these networks. In this research by applying some changes to the AODV routing protocols, two new protocols are presented: The first protocol is SAODV, which is a protocol for multi-path which finds the minimum length path between source and destination nodes and then sequentially sends the packets in these paths. The second protocol is SMAODV, which is a verified version of the first one but it finds multi-paths with minimum length for sending the control packets by the use of webpage rank algorithm and a smart mechanism for determining the amount of sending packets. This would cause the energy at any point in the network nodes with minimum variance and increase the network lifetime. The results of simulations in the NS-2 network simulator also verify that our proposed methods have better efficiency than the basic AODV protocol, and improve the network performance and decrease the end-to-end delay of receipt packets.

Free

Satellite Attitude Determination Filter using Square Root based Spherical Simplex Unscented Transformation

Satellite Attitude Determination Filter using Square Root based Spherical Simplex Unscented Transformation

Kaichun Zhao, Zheng You

Scientific article

A square root based spherical simplex unscented transform was adopted in micro satellite attitude determination filter. The filter computation cost was reduced evidently by means of spherical simplex unscented transformation (SSUT) and the square root technique with modified Rodrigues parameters (MRPs). The filter performance and numerical stability were guaranteed by unscented transformation with positive-semi definiteness of the state covariance propagation. The simulation results of some micro-satellite showed that this algorithm could insure accuracy, fast convergence and high robustness with high computation efficiency, which was suitable for the attitude estimation of micro-satellite.

Free

Scalable-pos: Towards Decentralized and Efficient Energy Saving Consensus in Blockchain

Scalable-pos: Towards Decentralized and Efficient Energy Saving Consensus in Blockchain

Anupama B.S., Sunitha N.R., G.S. Thejas

Scientific article

Blockchain has become peer-to-peer immutable distributed ledger technology network, and its consensus protocol is essential to the management of decentralized data. The consensus algorithm, at core of blockchain technology (BCT), has direct impact on blockchain's security, stability, decentralization, and many other crucial features. A key problem in development of blockchain applications is selecting the right consensus algorithm for various scenarios. Ensuring scalability is the most significant drawback of BCT. The industry has been rejuvenated and new architectures have been sparked by the usage of consensus protocols for blockchains(BC). Researchers analyzed shortcomings of proof of work (PoW) consensus process and subsequently, alternative protocols like proof of stake (PoS) arose. PoS, together with other improvements, lowers the unimaginably high energy usage of PoW, making it protocol of time. In PoS, only the user with highest stake becomes the validator. To overcome this, we propose Scalable Proof of Stake (SPoS), a novel consensus protocol, which is an enhancement of PoS protocol. In the proposed algorithm, each stakeholder based on the stake gets a chance to become the validator and can mine blocks in the blockchain. Clustering of the stakeholders is done using mean shift algorithm. Each cluster gets a different number of blocks to mine in BC. Cluster with highest stake will get a greater number of blocks to mine when compared to other groups and the cluster with the least stake gets least number of blocks to mine when compared to other groups. To mine the blocks, validator is chosen based on the cluster in which he is present. Fair mining is ensured for all stakeholders based on number of stakes. Mining is distributed among all the stakeholders. Since the validators are chosen fast, the transaction rate is high in the network. Validators in PoS are selected according to the quantity of cryptocurrency they stake. More stakeholders will get chance of validating blocks and receiving rewards. Over time, this reduces fairness and decentralization by concentrating on wealth and power. This is addressed in SPoS using clustering-based validator assignment.

Free

Scheduling in Grid Systems using Ant Colony Algorithm

Scheduling in Grid Systems using Ant Colony Algorithm

Saeed Molaiy, Mehdi Effatparvar

Scientific article

Task scheduling is an important factor that directly influences the performance and efficiency of the system. Grid computing utilizes the distributed heterogeneous resources in order to support complicated computing problems. Grid can be classified into two types: computing grid and data grid. Job scheduling in computing grid is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. This paper presents a new algorithm based on ant colony optimization (ACO) metaheuristic for solving this problem. In this study, a proposed ACO algorithm for scheduling in Grid systems will be presented. Simulation results indicate our ACO algorithm optimizes total response time and also it increase utilization.

Free

Scrum and Temporal Distance-Based Global Software Development

Scrum and Temporal Distance-Based Global Software Development

Asmaa Fowzi Alotaibi, M. Rizwan Jameel Qureshi

Scientific article

Global software development (GSD) is one of modern trends in software engineering. The last years has witnessed a significant increase in the adoption of Agile in GSD .This paper considers the issue by examining whether Scrum practices used in mitigation of temporal distance-based GSD coordination challenges. We were used Cisco TelePresence tool in Synchronization communication for simulation of face to face meetings. We were designed a simple algorithm to help project managers in determining the appropriate strategies. This algorithm is based on the temporal difference between the sites. This is may be great or simple. Through temporal difference, we calculated number of working hours overlapping. Which are classified in the three cases and each case has number of strategies are sufficient to overcome this challenges.

Free

Searching Methods of MP2P Based on Diffusion Strategy of Resources Index

Searching Methods of MP2P Based on Diffusion Strategy of Resources Index

Fangfang Guo, Jing Xu

Scientific article

The inherent mobility of MP2P peers lead to an efficient of existing resources positioning method low, and the proposed application model is single. The proposed methods considered the resource positioning in the direction of the resource provider's, and implement it base on the diffusion resource index, which are spread in the model of epidemic. Networking connectivity model is built in the diffusion path. Diffusion resources index are used to position resources, so as to solve the low positioning efficiency of existing positioning method and large time delay. By comparing the proposed method, the flooding resource location method and the Structural resources localization methods, the obtained simulation results show that the proposed method can effectively improve resource efficiency and accuracy of the location method.

Free

Sectorized Hamming Concentric Circular Arrays for Stratospheric Platforms Cellular Design

Sectorized Hamming Concentric Circular Arrays for Stratospheric Platforms Cellular Design

Yasser Albagory

Scientific article

Recently, stratospheric platform communications system (SPs) has gained great interest due to its superior performance compared to conventional communications systems. This paper addresses one of the major performance keys in SPs which is the cellular design based on adaptive concentric circular arrays (CCA). The proposed design technique aims to provide circular cells at any elevation angle to overcome the cell flattening and broadening which result in ellipsoidal cell shape. The cell footprint is controlled by adjusting the beamwidths which can be established by sectorizing the CCA and tapering the current amplitudes of the effective sectors by Hamming function while the others are muted and the resulted array is called Sectorized Hamming tapered CCA (SHTCCA). In this array, each sector has an angular width of 90o and some and two opposite sectors are fully fed while the others has less number of quarter-circular arrays. The tapering of the active sectors results in lower sidelobe levels which is a paramount improvement for the cellular systems. In addition, the SHTCCA is analyzed and optimized to provide the desired beamwidths at any elevation angle that are needed to design circular cell footprint.

Free

Secure Access of Folders and Files after Removal of Duplicacy over the Cloud

Secure Access of Folders and Files after Removal of Duplicacy over the Cloud

A. Archana, N. Kumar, Mohammad Zubair Khan

Scientific article

Cloud computing is an emerging concept that makes better use of a large number of distributed resources. The most significant issue that affects the cloud computing environment is resource provisioning. Better performance in the shortest amount of time is an important goal in resource provisioning. Create the best solution for dynamically provisioning resources in the shortest time possible. This paper aims to perform resource provisioning with an optimal performance solution in the shortest time. Hybridization of two Meta-heuristics techniques, such as HSMOSA (Hybrid Spider Monkey Optimization with Simulated Annealing), is proposed in resource provisioning for cloud environment. Finds the global and local value using Spider Monkey Optimization's (SMO) social behavior and then utilizes Simulated Annealing (SA) to search around the global value in each iteration. As a result, the proposed approach aids in enhancing their chances of improving their position. The CloudSimPlus Simulator is used to test the proposed approach. The fitness value, execution time, throughput, mean, and standard deviation of the proposed method were calculated over various tasks and execution iterations. These performance metrics are compared with the PSO-SA algorithm. Simulation results validate the better working of the proposed HSMOSA algorithm with minimum time compared to the PSO-SA algorithm.

Free

Secure Allocation of Resources in Cloud Using Trust

Secure Allocation of Resources in Cloud Using Trust

Usha Divakarla, K. Chandrasekaran

Scientific article

Cloud is the recent emerging technology in all aspects. The basic concern with the usage of this Cloud Technology is security. Security poses a major drawback with data storage, resource utilization, virtualization, etc. In the highly competitive environment the assurances are insufficient for the customers to identify the trust worthy cloud service providers. As a result all the entities in cloud and cloud computing environment should be trusted by each other and the entities that have communication should have valid trust on each other. Trust being the profound component in any network has attracted many researchers for research in various ways. The models developed so far are platform dependent and are not valid for heterogeneous platforms. An efficient model which can be ported on any platform is the current research trend in the research world. Our model is platform independent and also helps in calculating trust while migrating to another platform. The result shows that the proposed model is much more efficient in terms of computation time.

Free

Secure Blockchain-based Routing with Narwhal Optimization for WSNs

Secure Blockchain-based Routing with Narwhal Optimization for WSNs

Ranjeet Yadav, N. Manimegalai, Mercy Beulah E., Mohammed Al-Farouni

Scientific article

Wireless Sensor Networks (WSNs) play a crucial role in various domains, such as environmental monitoring, health, and military applications. These applications necessitate the establishment of secure and efficient communication. This network encounters a major issue since routing attacks along with data tampering are highly prevalent in such networks due to their decentralized architecture and limited resources for computation that make the networks susceptible to a wide range of security threats. The existing techniques-WSN-Block, CEMT, TSRP, ORASWSN, POA-DL, AI-WSN, and EOSR are extensively used for routing but experience inefficiencies in optimizing paths that increases energy consumption drastically and also allows packet loss. In addition, the existing blockchain models for WSN security are not scalable; have high overheads of computation. To address these limitations, we propose the Secure Blockchain-Based Routing with Narwhal Optimization for WSNs (OpNa-SGCDN). Our approach employs Optimized Narwhal-Based Metaheuristic for guaranteed shortest-path communication and minimum energy consumption in optimum routing. Moreover, we provide Scalable Permissionless Blockchain Consensus Model (SP-BlockCM) features enhanced to yield a decentralized solution that is tamper-proof but with improved scalability. The attack detection function is designed by making use of a Stacked Bi-Tier Convolutional Deep Network (SBT-CDN), which is optimized by the Snow Geese Evolutionary Algorithm (SGEA). Experimental results demonstrate that our method improves energy efficiency with 94.7% as well as achieves higher detection accuracy for 96.3% and packet loss for 95.5%, both security and performance, and thus it is better than the available methods. The framework given here is thus obviously comprehensive as well as scalable for secure, energy-efficient WSN communication.

Free

Secure Data Storage and Retrieval over the Encrypted Cloud Computing

Secure Data Storage and Retrieval over the Encrypted Cloud Computing

Jaydip Kumar, Hemant Kumar, Karam Veer Singh, Vipin Saxena

Scientific article

Information security in cloud computing refers to the protection of data items such as text, images, audios and video files. In the modern era, data size is increasing rapidly from gigabytes to terabytes or even petabytes, due to development of a significant amount of real-time data. The majority of data is stored in cloud computing environments and is sent or received over the internet. Due to the fact that cloud computing offers internet-based services, there are various attackers and illegal users over the internet who are consistently trying to gain access to user’s private data without the appropriate permission. Hackers frequently replace any fake data with actual data. As a result, data security has recently generated a lot of attention. To provide access rights of files, the cloud computing is only option for authorized user. To overcome from security threats, a security model is proposed for cloud computing to enhance the security of cloud data through the fingerprint authentication for access control and genetic algorithm is also used for encryption/decryption of cloud data. To search desired data from cloud, fuzzy encrypted keyword search technique is used. The encrypted keyword is stored in cloud storage using SHA256 hashing techniques. The proposed model minimizes the computation time and maximizes the security threats over the cloud. The computed results are presented in the form of figures and tables.

Free

Secure Mobile Agent Migration Using Lagrange Interpolation and Fast Fourier Transformation

Secure Mobile Agent Migration Using Lagrange Interpolation and Fast Fourier Transformation

Pradeep Kumar, Niraj Singhal, Dhiraj Pandey, Avimanyou Vatsa

Scientific article

Mobile agent is a processing unit works on the behalf of host computer. Mobile agent with intelligence provides a new computing prototype that is totally different from conventional prototype. Mobile agents are automatically itinerating from one host Computer to another host computer and execute assigned task on the behalf of user in heterogeneous environment under own control. Because mobile agents roam around distributed networks automatically, the security of the agents and platforms is a major concern. The number of mobile agents-based software applications has increased dramatically over the past year. It has also enhanced the security risks associated with such applications. Most protection systems in the mobile agent paradigm focus on platform security and provide few guidelines for mobile agent security, which is still a challenging topic. There is a risk to information carries by mobile agents from the malicious mobile agents who can modify and steal the confidential information. In this paper proposed multilevel authentication framework of mobile agents and platform based on Lagrange interpolation and fast Fourier transformation (LIFFT). In this frame work ‘n’ number of mobile agent have two level of security first level key used authentication and second level of key used for execution of mobile agents.

Free

Secure Model for SMS Exchange over GSM

Secure Model for SMS Exchange over GSM

Mohammed Baqer M. Kamel, Loay E. George

Scientific article

Distributed systems use General Packet Radio Service (GPRS) to exchange information between different members of the system. The members of the system depend critically upon their ability to access internet connection in order to exchange data via GPRS and the system will shut down in case of unavailability of Internet connection. There is a strong need for developing another backup communication media. In this paper a data transaction method based on encoded Short Message Service (SMS) over Global System for Mobile Communication (GSM) is proposed. This new method guarantees the functionality of the system in case of inaccessibility to GPRS which may be not always available due to measures such as attacks that affect its availability. The proposed method is based on third party agent who can keep the address secrecy of both communicators besides keeping confidentiality, integrity and availability.

Free

Secure Usable Authentication Using Strong Pass text Passwords

Secure Usable Authentication Using Strong Pass text Passwords

C. Shoba Bindu

Scientific article

Traditional alphanumeric passwords used for remote user authentication does not offer both usability and security. Graphical passwords were proposed as an alternative to these textual passwords for improving usability and security. This paper proposes a remote user authentication scheme, which extends the existing pass text scheme. The usability and security of the proposed scheme is analyzed. Using Morea tool the Usability of the proposed scheme is investigated.

Free

Secure and Efficient Image Encryption Scheme Based on Compressive Sensing and AES

Secure and Efficient Image Encryption Scheme Based on Compressive Sensing and AES

Shimaa Sayed Mohamed, Marwa M.A. Hadhoud, Fatty M. Salem

Scientific article

Secure and efficient transmission of medical images requires integrating compression, encryption, and substitution mechanisms to protect sensitive patient data. Compression reduces image size, improving transmission and storage while preserving diagnostic quality. Encryption ensures confidentiality and the Health Insurance Portability and Accountability Act (HIPAA) compliance, safeguarding patient information from unauthorized access. Nonlinear substitution using dynamic S-boxes increases confusion and strengthens resistance to cryptanalysis. This paper presents a hybrid medical image encryption scheme comprising three sequential stages for high security and computational efficiency. In preprocessing, images are resized, normalized, partitioned into uniform blocks, and compressed using compressive sensing based on partial discrete Fourier transform sampling. The encryption stage applies adaptive S-boxes with block interleaving, followed by the Advanced Encryption Standard in Galois/Counter Mode to provide integrity-preserving encryption. During decryption, the Fast Iterative Shrinkage-Threshold Algorithm reconstructs images accurately. Experimental results demonstrate that the scheme preserves image quality, achieves effective compression, and resists statistical and cryptographic attacks, making it suitable for secure medical image communication in resource-limited environments.

Free

Journal