Journal of High Speed Networks - Volume 27, issue 1

Authors: Khalid, Khuram | Woungang, Isaac | Dhurandher, Sanjay K. | Singh, Jagdeep | Barolli, Leonard

Article Type: Research Article

Abstract: Unlike communication networks which are traditionally assumed to be connected, Opportunistic networks (OppNets) are a type of wireless ad hoc networks with no guarantee of end-to-end path for data routing, which is due to node mobility, volatile links, and frequent disconnections. As such, data transmission among the nodes relies on their cooperation and this is realized in a store-and-carry fashion. To this end, several opportunistic routing techniques have been proposed in the literature, some of which using geocasting, a technique that consists of scheduling the message to a specific region toward its destination. This paper proposes a Fuzzy-based Check-and-Spray Geocast …(FCSG) routing protocol for OppNets, in which a Check-and-Spray mechanism is used to control the message flooding within the destination cast and a fuzzy controller is used for selecting the suitable relay nodes to carry the message toward the destination, with the aim to improve the delivery ratio. Using simulations, the proposed FCSG protocol is shown to outperform the F-GSAF, GeoEpidemic and EECSG routing protocols in terms of overhead ratio, average latency, and delivery ratio, under varying number of nodes, buffer size, and Time-to-Live. Show more

Keywords: Opportunistic networks, Geocast, fuzzy controller, Check-and-Spray flooding technique

DOI: 10.3233/JHS-210648

Citation: Journal of High Speed Networks, vol. 27, no. 1, pp. 1-12, 2021

Authors: Badis, Lyes | Amad, Mourad | Aïssani, Djamil | Abbar, Sofiane

Article Type: Research Article

Abstract: The recent privacy incidents reported in major media about global social networks raised real public concerns about centralized architectures. P2P social networks constitute an interesting paradigm to give back users control over their data and relations. While basic social network functionalities such as commenting, following, sharing, and publishing content are widely available, more advanced features related to information retrieval and recommendation are still challenging. This is due to the absence of a central server that has a complete view of the network. In this paper, we propose a new recommender system called P2PCF. We use collaborative filtering approach to recommend …content in P2P social networks. P2PCF enables privacy preserving and tackles the cold start problem for both users and content. Our proposed approach assumes that the rating matrix is distributed within peers, in such a way that each peer only sees interactions made by her friends on her timeline. Recommendations are then computed locally within each peer before they are sent back to the requester. Our evaluations prove the effectiveness of our proposal compared to a centralized scheme in terms of recall and coverage. Show more

Keywords: Decentralized social network, peer to peer, recommender system, collaborative filtering, cold start

DOI: 10.3233/JHS-210649

Citation: Journal of High Speed Networks, vol. 27, no. 1, pp. 13-31, 2021

Authors: Qafzezi, Ermioni | Bylykbashi, Kevin | Ampririt, Phudit | Ikeda, Makoto | Matsuo, Keita | Barolli, Leonard

Article Type: Research Article

Abstract: Vehicular Ad hoc Networks (VANETs) aim to improve the efficiency and safety of transportation systems by enabling communication between vehicles and roadside units, without relying on a central infrastructure. However, since there is a tremendous amount of data and significant number of resources to be dealt with, data and resource management become their major issues. Cloud, Fog and Edge computing, together with Software Defined Networking (SDN) are anticipated to provide flexibility, scalability and intelligence in VANETs while leveraging distributed processing environment. In this paper, we consider this architecture and implement and compare two Fuzzy-based Systems for Assessment of Neighboring Vehicles …Processing Capability (FS-ANVPC1 and FS-ANVPC2) to determine the processing capability of neighboring vehicles in Software Defined Vehicular Ad hoc Networks (SDN-VANETs). The computational, networking and storage resources of vehicles comprise the Edge Computing resources in a layered Cloud-Fog-Edge architecture. A vehicle which needs additional resources to complete certain tasks and process various data can use the resources of the neighboring vehicles if the requirements to realize such operations are fulfilled. The proposed systems are used to assess the processing capability of each neighboring vehicle and based on the final value, it can be determined whether the edge layer can be used by the vehicles in need. FS-ANVPC1 takes into consideration the available resources of the neighboring vehicles and the predicted contact duration between them and the present vehicle, while FS-ANVPC2 includes in addition the vehicles trustworthiness value. Our systems take also into account the neighboring vehicles’ willingness to share their resources and determine the processing capability for each neighbor. We evaluate the proposed systems by computer simulations. The evaluation results show that FS-ANVPC1 decides that helpful neighboring vehicles are the ones that are predicted to be within the vehicle communication range for a while and have medium/large amount of available resources. FS-ANVPC2 considers the same neighboring vehicles as helpful neighbors only if they have at least a moderate trustworthiness value (VT = 0.5 ). When VT is higher, FS-ANVPC2 takes into consideration also neighbors with less available resources. Show more

Keywords: VANETs, SDN, fuzzy logic, cloud computing, fog computing, edge computing, FS-ANVPC, trustworthiness

DOI: 10.3233/JHS-210650

Citation: Journal of High Speed Networks, vol. 27, no. 1, pp. 33-44, 2021

Authors: Lian, Huiqiang | Liu, Bing | Li, Pengyuan

Article Type: Research Article

Abstract: Fuel prices, which are of broad concern to the general public, are always seen as a challenging research topic. This paper proposes a variational Bayesian structural time-series model (STM) to effectively process complex fuel sales data online and provide real-time forecasting of fuel sales. While a traditional STM normally uses a probability model and the Markov chain Monte Carlo (MCMC) method to process change points, using the MCMC method to train the online model can be difficult given a relatively heavy computing load and time consumption. We thus consider the variational Bayesian STM, which uses variational Bayesian inference to make …a reliable judgment of the trend change points without relying on artificial prior information, for our prediction method. With the inferences being driven by the data, our model passes the quantitative uncertainties to the forecast stage of the time series, which improves the robustness and reliability of the model. After conducting several experiments by using a self-collected dataset, we show that compared with a traditional STM, the proposed model has significantly shorter computing times for approximate forecast precision. Moreover, our model improves the forecast efficiency for fuel sales and the synergy of the distributed forecast platform based on an architecture of network. Show more

Keywords: Change point recognition, hierarchical Bayesian model, structural time-series model, variational inference

DOI: 10.3233/JHS-210651

Citation: Journal of High Speed Networks, vol. 27, no. 1, pp. 45-66, 2021

Authors: Rao, Ch Koteswara | Singh, Kunwar | Kumar, Anoop

Article Type: Research Article

Abstract: Multi-party computation (MPC) sorting and searching protocols are frequently used in different databases with varied applications, as in cooperative intrusion detection systems, private computation of set intersection and oblivious RAM. Ivan Damgard et al. have proposed two techniques i.e., bit-decomposition protocol and bit-wise less than protocol for MPC. These two protocols are used as building blocks and have proposed two oblivious MPC protocols. The proposed protocols are based on data-dependent algorithms such as insertion sort and binary search. The proposed multi-party sorting protocol takes the shares of the elements as input and outputs the shares of the elements in …sorted order. The proposed protocol exhibits O ( 1 ) constant round complexity and O ( n log n ) communication complexity. The proposed multi-party binary search protocol takes two inputs. One is the shares of the elements in sorted order and the other one is the shares of the element to be searched. If the position of the search element exists, the protocol returns the corresponding shares, otherwise it returns shares of zero. The proposed multi-party binary search protocol exhibits O ( 1 ) round complexity and O ( n log n ) communication complexity. The proposed multi-party sorting protocol works better than the existing quicksort protocol when the input is in almost sorted order. The proposed multi-party searching protocol gives almost the same results, when compared to the general binary search algorithm. Show more

Keywords: Multi-party computation, oblivious sorting, bit-wise sharing, bit-decomposition protocol, bit-wise less than protocol, searching

DOI: 10.3233/JHS-210652

Citation: Journal of High Speed Networks, vol. 27, no. 1, pp. 67-82, 2021

Authors: Fu, Jinhua | Zhou, Wenhui | Xu, Mixue | Si, Xueming | Yuan, Chao | Huang, Yongzhong

Article Type: Research Article

Abstract: Existing blockchains, especially public blockchains, face the challenges of scalability which means the processing capacity will not get better with the addition of nodes, making it somewhat infeasible for mobile computing applications. Some improved technologies are known to speed up processing capacity by shrinking the consensus group, increasing the block capacity and/or shortening the block interval. Even these solutions are met with major problems such as storage limitations and weak security. To face the realistic application scenarios for blockchain technology in the mobile realm, we propose a new public blockchain designed based on sharding, aggregate signature and cryptographic sortition which …we call SAC . In SAC , the transaction rate increases with the number of shards while the length of the consensus signature is a constant. Meanwhile, in SAC , the assignment of consensus representatives is controlled by a verifiable random function, which can effectively solve the problem of centralized consensus. In addition, this paper analyzes the performance of SAC to give adequate comparison with other sharding technologies while also giving a rational security analysis. Our experimental results clearly show the potential applicability of this novel blockchain protocol to in mobile computation. Show more

Keywords: Public blockchain, aggregate signature, cryptographic sortition, mobile computing, sharding

DOI: 10.3233/JHS-210653

Citation: Journal of High Speed Networks, vol. 27, no. 1, pp. 83-99, 2021