Journal of High Speed Networks - Volume 23, issue 1

Authors: Das, Himanish Shekhar | Bhattacharjee, Sanghita

Article Type: Research Article

Abstract: Wireless sensor networks (WSNs) consist of a large number of tiny, low cost, memory/computational constraint, battery-operated sensor nodes deployed randomly in two (or three) dimensional plane. Due to limited amount of energy in sensors, the network seeks to attain energy efficient routing for prolonging their lifetime. Existing grid based routing protocols reduce the energy dissipation at nodes, however they suffer from congestion. Network congestion may lead to excessive energy consumption, which in turn minimizes the lifetime of network. In this paper, we propose a new Congestion Aware Lifetime Improving Routing Protocol (abbreviated shortly as CALIRP) for grid-based WSNs, which …improves the network lifetime by minimizing congestion at nodes. In CALIRP, routing is conducted in a grid by grid manner through the cell-headers. To save the energy and avoid congestion, multiple routing paths are established from the source to the base station. The paths are selected based on Transmitting Factor (TF) of cell-headers which take queue occupancy, queue length and residual energy into account. In addition, CALIRP adjusts node’s transmitting factor for reconstructing the paths so that the lifetime of network is prolonged. Simulation results highlight that the proposed CALIRP outperforms other existing routing algorithms in terms of success rate, queue occupancy and number of alive nodes etc. Show more

Keywords: Grid-based sensor network, grid length, cell-header, neighboring cell, adjacent cell, transmitting factor, multipath routing, congestion, network lifetime

DOI: 10.3233/JHS-170553

Citation: Journal of High Speed Networks, vol. 23, no. 1, pp. 1-14, 2017

Authors: Subhashree, V.K. | Tharini, C.

Article Type: Research Article

Abstract: Major issues found in large scale wireless sensor networks are energy consumption of sensor nodes, redundant data transmission by neighbouring nodes, outlier generation due to unwanted event sensing and node failure. To address these issues, a novel Energy Efficient Routing and Fault Tolerant Data Aggregation (EERFTDA) algorithm is proposed. The key aspects of the proposed algorithm are reliable data aggregation and transmission by eliminating outlier and redundant data using locality sensitive hashing. Another advantage of the proposed algorithm is the bottleneck problem near sink nodes is overcome by the election of relay nodes based on residual energy. The performance of …proposed algorithm is analyzed and compared with Data Routing for In-Network Aggregation (DRINA) algorithm for QoS parameters like delay, packet delivery ratio, energy efficiency and aggregation accuracy. The results indicate that EERFTDA provides improved aggregation accuracy and energy efficiency. Show more

Keywords: Routing, data aggregation, locality sensitive hashing, outliers, fault tolerance, energy efficiency

DOI: 10.3233/JHS-170554

Citation: Journal of High Speed Networks, vol. 23, no. 1, pp. 15-32, 2017

Authors: Wen, Angzhan | Lin, Weiwei | Ma, Yacong | Xie, Haoan | Zhang, Guoqiang

Article Type: Research Article

Abstract: In order to better demonstrate the evolution relationships between the events from newswires and to improve the readability of the event evolution graphs, we propose an improved news event evolution model from a view of users’ reading willingness. The model discusses two factors that affect the willingness of users’ reading, including the comprehensiveness of news information and reading cost. We define the cost function of user’s reading to determine the granularity of news events. After classifying the news stories by K-means clustering algorithm, this model takes the general structure of the news reports into consideration to calculate the TF-IDF weights …and does some correction as well as model fusion. Finally, the parameters of the model are estimated by genetic algorithm based on Levy flight. By generating a more readable event evolution graph, our model is more capable of discovering the evolution relationships between the News events. We carried out experiments to evaluate the performance of our proposed model. The result shows that the proposed model outperformed the baseline and other comparable models in previous work by about 13% in the corpus we collected from the CNN & ABC News websites. Show more

Keywords: Event evolution, term frequency–inverse document frequency (TF-IDF), reading willingness, K-means, information retrieval

DOI: 10.3233/JHS-170555

Citation: Journal of High Speed Networks, vol. 23, no. 1, pp. 33-47, 2017

Authors: Li, Beibei | Liu, Bo | Lin, Weiwei | Zhang, Ying

Article Type: Research Article

Abstract: To compare the performance of the clustering algorithm on two data processing architectures, the implementations of k-means clustering algorithm on two big data architectures are given at first in this paper. Then we focus on the differences of theoretical performance of k-means algorithm on two architectures from the mathematical point of view. The theoretical analysis shows that Spark architecture is superior to the Hadoop in aspects of the average execution time and I/O time. Finally, a text data set of social networking site of users’ behaviors is employed to conduct algorithm experiments. The results show that Spark is significantly less …than MapReduce in aspects of the execution time and I/O time based on k-means algorithm. The theoretical analysis and the implementation technology of the big data algorithm proposed in this paper are a good reference for the application of big data technology. Show more

Keywords: Hadoop, MapReduce, Spark, clustering algorithm, big data, k-means

DOI: 10.3233/JHS-170556

Citation: Journal of High Speed Networks, vol. 23, no. 1, pp. 49-57, 2017

Authors: Cuka, Miralda | Shinko, Ilir | Spaho, Evjola | Oda, Tetsuya | Ikeda, Makoto | Barolli, Leonard

Article Type: Research Article

Abstract: The advances in next generation network and IoT have provided a promising opportunity to resolve the challenges caused by the increasing transportation issues. In this paper, we investigate the performance of different routing protocols in a Vehicular Delay Tolerant Network (VDTN) crossroad scenario. The mobility patterns of vehicles are generated by means of SUMO (Simulation of Urban MObility) and as communication protocol simulator is used ONE (Opportunistic Network Environment). We use Packet Delivery Ratio (PDR), Relay Delivery Ratio (RDR), hop count and delay as evaluation metrics. We compared the performance of six protocols and the simulation results show that for …PDR the Epidemic protocol has better performance than other protocols. Considering RDR and hop count, the performance of Direct Delivery protocol is better than other protocols. While for delay, the performance of Epidemic protocol is better than other protocols. Show more

Keywords: Vehicular Networks, VDTN, ONE, SUMO, Opportunistic Network, IoT

DOI: 10.3233/JHS-170557

Citation: Journal of High Speed Networks, vol. 23, no. 1, pp. 59-66, 2017

Authors: Kaur, Ramanpreet | Sangal, Amrit Lal | Kumar, Krishan

Article Type: Research Article

Abstract: Our dependence on the internet for simple and time critical applications make availability of services a top security concern. There are many attacks to threaten the availability of service, but Distributed Denial of Service (DDoS) attack constitute one of the major and the most growing threat to severely degrade the system performance. DDoS defense has been matured over time and many solutions have been proposed to solve this problem. However, most of the research is focused on detecting and blocking this attack, which results in significant disruption before regaining system control and are not suitable for critical infrastructures. So, researchers …come up with an interesting alternative, overlay based defensive approaches, which try to survive the attack by providing sustainable performance to the legitimate clients in attack situations. This article provides a review of the overlay based defensive techniques by categorizing them into two classes based on their underlying strategy: Proactive and Reactive approaches. The techniques within each category are discussed along with their advantages and disadvantages, and are studied comparatively with respect to relevant performance criteria. This paper also discusses the vulnerabilities of these architectures to guide the development of more robust procedures to combat DDoS attacks. Show more

Keywords: Overlay, distributed defense, proactive DDoS defense, reactive DDoS defense

DOI: 10.3233/JHS-170558

Citation: Journal of High Speed Networks, vol. 23, no. 1, pp. 67-91, 2017