Journal of High Speed Networks - Volume 24, issue 1

Authors: Nakamura, Shigenari | Sugino, Miyu | Takizawa, Makoto

Article Type: Research Article

Abstract: In order to realize the cooperation of a group of multiple nodes, messages have to be reliably and efficiently delivered to all of them, according to a traditional broadcasting paradigm, by also reducing the electric energy consumed by each involved node. In this paper, we propose three types of energy-efficient broadcast algorithms, namely EEB (energy-efficient broadcast), EEB2 (modified EEB), and AEEB (augmented EEB) whose objective is reducing the total electric energy consumed by nodes. In the EEB algorithm, a wireless link to a farthest child node is truncated until there is no other child node which can forward messages to …it in a more energy-efficient way. In the EEB2 algorithm, a link to a farthest child node is truncated if there is another child node which can forward the message to it. In the EEB and EEB2 algorithms, a child node is selected for each parent node. On the other hand, one parent node is selected among possible parent nodes of each child node, which is nearest to the child node in the AEEB algorithm. We evaluate the EEB, EEB2, and AEEB algorithms and show that the total electric energy consumed by nodes can be reduced in the AEEB algorithm. Show more

Keywords: Broadcast algorithms, Wireless networks, Energy-efficient broadcast (EEB) algorithms, Augmented energy-efficient broadcast (AEEB) algorithm

DOI: 10.3233/JHS-170577

Citation: Journal of High Speed Networks, vol. 24, no. 1, pp. 1-15, 2018

Authors: Mehdi, Rouan-Serik | Mejdi, Kaddour

Article Type: Research Article

Abstract: We study in this paper the problem of minimizing the number and the locations of deployed cameras in visual sensor networks where to objective is to monitor a set of targets with a predefined quality level. To this end, we first propose a mathematical programming formulation, based on mixed-integer linear programming (MILP), which is designed to provide optimal solutions in case where the deployment area is represented through a set of discrete potential locations of the cameras. Due to the combinatorial nature of such problems, finding exact solutions entails a tremendous computational cost. Consequently, we introduce various suboptimal solution approaches, …based on a number of well-known metaheuristics, such as particle swarm optimization (PSO) and genetic algorithms. Numerical results show PSO succeeds to find the best solutions in the majority of considered scenarios. Furthermore, even for large instances, it provides better feasible solutions than those returned the MILPs after a significant amount of time. Show more

Keywords: Visual sensor networks, deployment problem, mixed-integer linear programming, particle swarm optimization, genetic algorithms, greedy algorithms, simulated annealing, target coverage

DOI: 10.3233/JHS-170578

Citation: Journal of High Speed Networks, vol. 24, no. 1, pp. 17-30, 2018

Authors: Al-Zubi, Raed | Darabkh, Khalid A. | Hawa, Mohammed | Jafar, Iyad F.

Article Type: Research Article

Abstract: IEEE 802.22 Wireless Regional Area Network (WRAN) standard employs cognitive radio techniques to utilize the white (i.e., unused) spectrum in the TV frequency band. IEEE 802.22 WRAN employs cellular topology (i.e., point to multi-point communications). IEEE 802.22b is a modified version of IEEE 802.22 that allows peer-to-peer communications among WRAN users of the same cell. One of the issues that significantly affects the performance of WRAN is the spectrum sharing between overlapped WRAN cells (i.e., inter spectrum sharing) as well as among the users of the same cell (i.e., intra spectrum sharing). In this paper, we propose Resource Sharing Protocol …for Inter/Intra WRAN communications (RSP-WRAN), which is based on maximizing the Jain’s fairness index in the spectrum-sharing process. Simulation results show that RSP-WRAN, compared to other protocols, achieves high performance in terms of fairness and network throughput. Show more

Keywords: Resource sharing protocol, WRAN users, Jain’s fairness index, spectrum-sharing

DOI: 10.3233/JHS-170579

Citation: Journal of High Speed Networks, vol. 24, no. 1, pp. 31-47, 2018

Authors: Li, Peng | Dong, Lu | Xu, He | Lau, Ting Fung

Article Type: Research Article

Abstract: In Apache Spark cloud computing environment, computation capability of each node varies, together with the data size and uncertainties in application execution, these result in the differences in task execution time of a job. In order to enhance the accuracy in load execution time prediction, and reasonably guide the user to apply for Spark cluster resources, this paper researches on the execution flow of Spark job, collects the load time consumption index, and puts forward the time index fusion calculation scheme. And then, this paper researches on the multiple linear regression model and support vector machine model to explore the …payload execution time and CPU Core, inputting data volume, memory size and other performance indicators. Based on the two models above, this paper proposes a Standard Regression Coefficient-based Weighted Support Vector Regression time prediction model (SRC-WSVR). Finally, through comparing the results from the prediction model proposed in this paper with conventional regression prediction model and Standard Support Vector Machine model, it proves that SRC-WSVR has a higher prediction accuracy, which can provide valid data reference for predicting Spark resource consumption. Show more

Keywords: Weighted Support Vector Regression Machine, Standard Regression Coefficient, execution time prediction, performance benchmark, keyword five, Spark

DOI: 10.3233/JHS-170580

Citation: Journal of High Speed Networks, vol. 24, no. 1, pp. 49-62, 2018

Authors: Hu, Chao | Liu, Bo | Xing, Changyou | Ding, Ke | Xu, Bo | Wei, Xianglin | Zhang, Xiaoming

Article Type: Research Article

Abstract: Minimizing the flow completion time (FCT) is widely considered as an important optimization goal in designing data center networks. However, existing schemes either rely on the precondition that the size and deadline of each flow is known in advance, or require modifying the switch hardware, which is hard to implement in practice. In this paper, we present a flexible and dynamic flow scheduling strategy, namely, Maximal Completion Probability First (MCPF), to reduce the FCT. This strategy is based on the estimated probabilities of each flow to finish the transmission in a period time, and these flows which have higher completion …probabilities are assigned with higher priority. Meanwhile, switches perform flow scheduling according to these priorities. We employ a queueing theory based mathematical model to analyze the average FCT of MCPF, and compare it with other two flow scheduling strategies. We also introduce the challenges and the solutions to implement MCPF in realistic networks. Finally, we evaluate the performance of MCPF in Mininet. The analysis and experimental results show that MCPF could effectively reduce the FCT. Show more

Keywords: Flow completion time, scheduling strategy, data center networks

DOI: 10.3233/JHS-170581

Citation: Journal of High Speed Networks, vol. 24, no. 1, pp. 63-78, 2018

Authors: Balzano, Walter | Murano, Aniello | Vitale, Fabio

Article Type: Research Article

Abstract: Ubiquitous computing and contextual services have growing importance in nowadays literature due to the current availability of smart personal devices like smartphones. It is becoming increasingly important to have a reliable way to localize users in any possible scenario. In outdoor it’s possible to use GNSS based systems like GPS or GLONASS, but for indoor scenarios a low-energy and affordable positioning system is still under heavy research. In this setting, wireless-based techniques like WiFi fingerprinting allow exploiting of currently available infrastructures to allow reasonable positioning accuracy while keeping power consumption at a minimum. WiFi fingerprinting systems operate in two …phases: one training phase, in which signals are collected with regards to different spots in the interesting area, and one usage or tracking phase in which recorded data are used to localize users in space. The usage phase is effective and reliable, but the training phase can be very time consuming for large areas and it has to be repeated over time in order to maintain localization accuracy, in case of network structure changes or to adapt to environmental changes (like humidity, pressure or temperature). In this paper we propose a novel framework which makes use of an appropriate Wireless Sensor Network (WSN) which allows continuous training over time, in order to achieve real-time updating of the fingerprints database with no human intervention. Show more

Keywords: Indoor localization, wireless fingerprinting, WSN

DOI: 10.3233/JHS-170582

Citation: Journal of High Speed Networks, vol. 24, no. 1, pp. 79-87, 2018