Latest Articles from JUCS - Journal of Universal Computer Science Latest 10 Articles from JUCS - Journal of Universal Computer Science https://lib.jucs.org/ Fri, 29 Mar 2024 10:15:30 +0200 Pensoft FeedCreator https://lib.jucs.org/i/logo.jpg Latest Articles from JUCS - Journal of Universal Computer Science https://lib.jucs.org/ Mobile Handoff with 6LoWPAN Neighbour Discovery Auxiliary Communication https://lib.jucs.org/article/108446/ JUCS - Journal of Universal Computer Science 30(2): 204-220

DOI: 10.3897/jucs.108446

Authors: Shanshan Jia, Gaukhar A. Kamalova, Dmytro Mykhalevskiy

Abstract: The importance of the topic under investigation stems from the burgeoning prominence of the Internet of Things (IoT) paradigm and the consequent imperative to devise and institute an efficacious methodology for neighbour detection that facilitates supplementary connections to mobile nodes. This research primarily aims to elucidate a mobile handover technique aligning with the neighbour discovery paradigm inherent in 6LoWPAN. The methodological framework employed herein amalgamates a systematic analysis of the foundational tenets governing 6LoWPAN communication standards over the IPv6 protocol in the context of IEEE 802.15.4aa personal wireless networks, supplemented with empirical evaluation of message propagation dynamics among discrete nodes of a designated personal wireless network. The findings of this investigation underscore the pre-eminence of the 6LoWPAN networking standard as a prime vehicle for bolstering the dependable communication of IoT's remote entities, contingent upon the utilization of the IPv6 communication protocol. This iteration of the Internet protocol is superior, particularly in surveillance contexts, given its expansive address capacity (128 bits) juxtaposed against its antecedent, the IPv4 protocol (32 bits). The inherent adaptability of this network connection augments the quality of mobile handover, especially when one considers the real-world application of 6LoWPAN's neighbour discovery auxiliary communication standard. The tangible implications of these findings beckon their potential utility in satiating the demands of IoT system users and actualizing the network collaboration ethos intrinsic to the 6LoWPAN communication standard.

HTML

XML

PDF

]]>
Research Article Wed, 28 Feb 2024 16:00:04 +0200
Detection of Size Modulation Covert Channels Using Countermeasure Variation https://lib.jucs.org/article/22669/ JUCS - Journal of Universal Computer Science 25(11): 1396-1416

DOI: 10.3217/jucs-025-11-1396

Authors: Steffen Wendzel, Florian Link, Daniela Eller, Wojciech Mazurczyk

Abstract: Network covert channels enable stealthy communications for malware and data exfiltration. For this reason, developing effective countermeasures for these threats is important for the protection of individuals and organizations. However, due to the large number of available covert channel techniques, it is considered impractical to develop countermeasures for all existing covert channels. In recent years, researchers started to develop countermeasures that (instead of only countering one particular hiding technique) can be applied to a whole family of similar hiding techniques. These families are referred to as hiding patterns. Considering above, the main contribution of this paper is to introduce the concept of countermeasure variation. Countermeasure variation is a slight modification of a given countermeasure that was designed to detect covert channels of one specific hiding pattern so that the countermeasure can also detect covert channels that are representing other hiding patterns. We exemplify countermeasure variation using the compressibility score, the ε-similarity and the regularity metric originally presented by Cabuk et al. All three methods are used to detect covert channels that utilize the Inter-packet Times pattern and we show that countermeasure variation allows the application of these countermeasures to detect covert channels of the Size Modulation pattern, too.

HTML

XML

PDF

]]>
Research Article Thu, 28 Nov 2019 00:00:00 +0200
Maximum Capacity Overlapping Channel Assignment Based on Max-Cut in 802.11 Wireless Mesh Networks https://lib.jucs.org/article/23822/ JUCS - Journal of Universal Computer Science 20(13): 1855-1874

DOI: 10.3217/jucs-020-13-1855

Authors: Ming Yang, Bo Liu, Wei Wang, Junzhou Luo, Xiaojun Shen

Abstract: By exploiting multi-radio multi-channel technology, wireless mesh networks can effectively provide wireless broadband access to the Internet for mobile users. Due to the limited number of orthogonal channels, overlapping channel assignment is one of the main factors that greatly affect the network capacity. However, current results in this area are not so satisfying. In this paper, we first propose a model for measuring achieved network capacity in MR-WMNs. Then we prove that finding an optimal overlapping channel assignment in a given MR-WMN with odd number of channels, is equivalent to finding an optimal assignment by only using its orthogonal channels. This theory allows us to use fewer channels to solve complicated channel assignment problems. Third, we prove that in 802.11b/g MR-WMN the simplified optimization problem is a Max-3-Cut problem. Although this problem is NP-hard, it has an efficient approximation algorithm that achieves approximation ratio of 1.19616 probabilistically by using the algorithm for Max-Cut whose approximation ratio is 1.1383 probabilistically. Based on the algorithm for Max-Cut, this paper proposes Max-Cut based channel assignment (MCCA) which uses a heuristic method to adjust the result produced by the Max-Cut algorithm to achieve an even better result. Finally, we perform extensive simulations to compare the MCCA with a state-of-the-art Tabu-Search based algorithm. The results show that the Max-Cut based overlapping channel assignment algorithm effectively and efficiently improves on the network capacity compared with existing algorithms.

HTML

XML

PDF

]]>
Research Article Fri, 28 Nov 2014 00:00:00 +0200
A Novel Identity-based Network Architecture for Next Generation Internet https://lib.jucs.org/article/23716/ JUCS - Journal of Universal Computer Science 18(12): 1643-1661

DOI: 10.3217/jucs-018-12-1643

Authors: Pedro Martinez-Julia, Antonio Skarmeta

Abstract: In this paper we show a network architecture for Next Generation Internet (NGI) that prevents operation traceability and protects the privacy of communication parties while raising their identity to be a central element of the network. As a side effect, our architecture inherently supports authentication and mobility of the entities involved in the communication. Moreover, it is designed to be agnostic to any underlying network infrastructure and can be used to enhance them with reduced penalty, which makes it a perfect component to take its features to existing networks without defining a brand new transport layer. We also show the successful verification of the protocol security and demonstrate its feasibility and scalability showing its behavior when instantiated on top of two different architectures.

HTML

XML

PDF

]]>
Research Article Thu, 28 Jun 2012 00:00:00 +0300
Optimization of Gateway Deployment with Load Balancing and Interference Minimization in Wireless Mesh Networks https://lib.jucs.org/article/30039/ JUCS - Journal of Universal Computer Science 17(14): 2064-2083

DOI: 10.3217/jucs-017-14-2064

Authors: Junzhou Luo, Wenjia Wu, Ming Yang

Abstract: In a wireless mesh network (WMN), gateways act as the bridges between the mesh backbone and the Internet, and significantly affect the performance of the whole network. Hence, how to determine the optimal number and positions of gateways, i.e., gateway deployment, is one of the most important and challenging topics in practical and theoretical research on designing a WMN. Although several approaches have been proposed to address this problem, few of them take load balancing and interference minimization into account. In this paper, we study the Load-balancing and Interference-minimization Gateway Deployment Problem (LIGDP), which aims to achieve four objectives, i.e. minimizing deployment cost, minimizing MR-GW path length, balancing gateway load and minimizing link interference. We formulate it as a multi-objective integer linear program (ILP) issue first, and then propose an efficient gateway deployment approach, called LIGDP Heuristic. The approach joints two heuristic algorithms, i.e., MSC-based location algorithm (MLA) and load-aware and interference-aware association algorithm (LIAA), to determine gateway positions and construct GW-rooted trees. Simulation results not only show that the trade-off between deployment cost and network performance can be achieved by adjusting R-hop, GW throughput and MR throughput constraints, but also demonstrate that, compared with other existing approaches, LIGDP Heuristic performs better on MR-GW path, load balancing and interference minimization without deploying more gateways.

HTML

XML

PDF

]]>
Research Article Sat, 1 Oct 2011 00:00:00 +0300
Performance Evaluation of Snort under Windows 7 and Windows Server 2008 https://lib.jucs.org/article/30010/ JUCS - Journal of Universal Computer Science 17(11): 1605-1622

DOI: 10.3217/jucs-017-11-1605

Authors: Khaled Salah, Mojeeb-Al-Rhman Al-Khiaty, Rashad Ahmed, Adnan Mahdi

Abstract: Snort is the most widely deployed network intrusion detection system (NIDS) worldwide, with millions of downloads to date. PC-based Snort typically runs on either Linux or Windows operating systems. In this paper, we present an experimental evaluation and comparison of the performance of Snort NIDS when running under the two newly released operating systems of Windows 7 and Windows Server 2008. Snort's performance is measured when subjecting a PC host running Snort to both normal and malicious traffic. Snort's performance is evaluated and compared in terms of throughput and packet loss. In order to offer sound interpretations and get a better insight into the behaviour of Snort, we also measure the packet loss encountered at the kernel level. In addition, we study the impact of running Snort under different system configurations which include CPU scheduling priority given to user applications or kernel services, uni and multiprocessor environment, and processor affinity.

HTML

XML

PDF

]]>
Research Article Fri, 1 Jul 2011 00:00:00 +0300
An Ambient Assisted Living Platform Integrating RFID Data-on-Tag Care Annotations and Twitter https://lib.jucs.org/article/29709/ JUCS - Journal of Universal Computer Science 16(12): 1521-1538

DOI: 10.3217/jucs-016-12-1521

Authors: Diego López-De-Ipiña, Ignacio Díaz-De-Sarralde, Javier Garcia-Zubia

Abstract: Although RFID is mainly used to identify objects whose data can then be accessed over the network, passive HF RFID tags do have significant data storage capacity (up to 4K), which can be utilised to store data rather than only IDs. This work explores the potential of storing, accessing and exploiting information on tags both, theoretically, by studying how much data can actually be stored in HF RFID tags, and practically, by describing an NFC-supported platform adopting the data-on-tag approach to improve data management in a care centre. Such platform illustrates two key aspects for AAL: a) RFID tags can serve as temporary repositories of care events whenever a continuous data link is not desirable and b) interactions between RFID wristbands worn by residents and care staff's NFC mobiles can improve care data management and keep relatives up-to-date with elderly people's evolution, through a Web 2.0 social service.

HTML

XML

PDF

]]>
Research Article Mon, 28 Jun 2010 00:00:00 +0300
A Resilient P2P Anonymous Routing Approach Employing Collaboration Scheme https://lib.jucs.org/article/29441/ JUCS - Journal of Universal Computer Science 15(9): 1797-1811

DOI: 10.3217/jucs-015-09-1797

Authors: Junzhou Luo, Xiaogang Wang, Ming Yang

Abstract: Node churn is a hindrance to construction of P2P-based anonymous networks, which makes anonymous paths fragile and results in message losses and communication failures. A collaboration scheme combining Friendly Neighbor-based Incentive (FNI) and Re-encryption mechanism is proposed to deal with the high node churn characteristic of P2P networks. The FNI mechanism encourages peers to forward other peers’ messages, and establishes more connections to improve the performance of P2P networks, where only stable and well-behaved nodes can be chosen as relay nodes to improve the durability of anonymous paths. The Re-encryption mechanism is designed to replace those failed relay nodes and achieve routing resilience upon different node availabilities in real-world systems. The results from security analysis and simulation show that the P2P anonymous routing approach employing collaboration scheme significantly improves routing resilience and maintains low latency and modest communication overhead.

HTML

XML

PDF

]]>
Research Article Fri, 1 May 2009 00:00:00 +0300
EMI²lets: A Reflective Framework for Enabling AmI https://lib.jucs.org/article/28585/ JUCS - Journal of Universal Computer Science 12(3): 297-314

DOI: 10.3217/jucs-012-03-0297

Authors: Diego De Ipiña, Juan Vázquez, Daniel García, Javier Fernández, Iván García, David Sainz, Aitor Almeida

Abstract: An interesting new application domain for handheld devices may be represented by Ambient Intelligence (AmI), where they can be used as intermediaries between us and our surrounding environment. Thus, the devices, which always accompany us, will behave as electronic butlers who assist us in our daily tasks, by interacting with the smart objects (everyday objects augmented with computational services) in our whereabouts. In order to achieve such goal, this paper proposes an AmI-enabling framework providing two main functions: a) facilitate the development and deployment of smart objects and b) transform mobile devices into universal remote controllers of those smart objects.

HTML

XML

PDF

]]>
Research Article Tue, 28 Mar 2006 00:00:00 +0300
Analysis, Design, and Performance Evaluation of MS-RTCP: More Scalable Scheme for the Real-Time Control Protocol https://lib.jucs.org/article/28415/ JUCS - Journal of Universal Computer Science 11(6): 874-897

DOI: 10.3217/jucs-011-06-0874

Authors: N. Elramly, A. Habib, O. Essa, H. Harb

Abstract: Recently, some problems related to the use of the Real-time Control Protocol (RTCP) in very large dynamic group have arisen. Some of these problems are: feedback delay, increasing storage state at every member, and ineffective RTCP bandwidth usage, especially for the receivers that obtain incoming RTCP reports through low bandwidth links. More schemes are proposed to alleviate the RTCP problems. The famous and recent one, which was introduced by EL-Marakby and was named Scalable RTCP (S-RTCP), still has several drawbacks. This paper will evaluate the previous model by introducing all its drawbacks. Consequently, we will demonstrate a design of More Scalable RTCP (MS-RTCP) scheme based on hierarchical structure, distributed management, and EL-Marakby scheme. Also, we will show how our scheme will alleviate all the drawbacks found in the S-RTCP. Finally, we will introduce our scheme implementation to analyze and evaluate its performance.

HTML

XML

PDF

]]>
Research Article Tue, 28 Jun 2005 00:00:00 +0300