Types of Threats and Appropriate Countermeasures for Internet Communications

Threats can translate into various types of attacks an intruder can take on entities in a network: flooding the target with protocol messages, smurfing (targeted broadcasting of an ICMP protocol-based messaging protocol), distributed attacks that lead to blocking the service for legitimate users, IP address theft and flooding targets with unsolicited emails, identity theft, or fraudulent routing. Against these threats, a variety of security measures can be implemented, such as: configuration management, firewall installation, intrusion detection system installation. Used separately or together, these protection measures can eliminate or even minimize the probability of materializing security threats and preventing attacks on the security features of a system.

Specification of Synchronous Network Flooding in Temporal Logic

In distributed network algorithms, network flooding algorithm is considered one of the simplest and most fundamental algorithms. This research specifies the basic synchronous memory-less network flooding algorithm where nodes on the network don’t have memory, for any fixed size of network, in Linear Temporal Logic. The specification can be customized to any single network topology or class of topologies. A specification of the termination problem is formulated and used to compare different topologies for earlier termination. This research gives a worked example of one topology resulting in earlier termination than another, for which we perform a formal verification using the model checker NuSMV

ASDSR: An Adaptive Stable DSR Routing Protocol for Mobile Ad-hoc Networks

<p class="Abstract">Abstract—The process of finding a route between the transmitter and the receiver node in the Mobile Adhoc Networks (MANets) is a renewed issue that is becoming more and more interesting to the researchers as this type of networks grow and expand. The dynamic nature of MANET and the limited capabilities of wireless nodes in terms of memory size and battery charge are the most important obstacles to the routing (path-finding) process between nodes. In this research, we introduced a new protocol based on the well-known DSR protocol to add a mechanism that controls the RREQ Flooding process, which aims to reach more stable (life-long) routes while reducing the overhead of routing process caused by link breakage between nodes and reduce the overhead of network flooding with RREQ messages with each attempt to find a path. In this proposed mechanism, a specific group is selected from within the devices adjacent to the transmitter to be sent RREQ so that these devices are selected based on the stability evaluation criterion. The stability criterion is calculated based on three weighted factors: the speed of the node, the out-degree value (the number of adjacent nodes), and the number of tracks stored in the device memory. The proportion of devices selected is automatically changed adaptively to ensure that the expected throughput of this network is achieved. The proposed protocol was tested using simulation where results showed that ASDSR proved an enhancement in route stability about (0.13), and a decrease in the number of deleted routes by (9%), while maintaining the expected packet delivery ratio of the original DSR by about (0.86).</p>

Discussion on Short Video Production and Transmission Path in New Media Environment

<p>Under the background of the vigorous development of science and technology in China, the new media times come gradually. With the rapid emergence of various new media, people's methods and habits of media contact have changed. As an emerging medium, short video has gradually become an important way for people to communicate and interact with each other due to its low production and transmission threshold. However, the current problems such as network flooding have affected the effective dissemination of short videos and even directly affected people's social activities. Therefore, short video dissemination needs certain supervision channels to promote its healthy, stable and benign development.</p>

Performance Evaluation and Validation of QCM (Query Control Mechanism) for QoS-Enabled Layered-Based Clustering for Reactive Flooding in the Internet of Things

Internet of Things (IoT) facilitates a wide range of applications through sensor-based connected devices that require bandwidth and other network resources. Enhancement of efficient utilization of a heterogeneous IoT network is an open optimization problem that is mostly suffered by network flooding. Redundant, unwanted, and flooded queries are major causes of inefficient utilization of resources. Several query control mechanisms in the literature claimed to cater to the issues related to bandwidth, cost, and Quality of Service (QoS). This research article presented a statistical performance evaluation of different query control mechanisms that addressed minimization of energy consumption, energy cost and network flooding. Specifically, it evaluated the performance measure of Query Control Mechanism (QCM) for QoS-enabled layered-based clustering for reactive flooding in the Internet of Things. By statistical means, this study inferred the significant achievement of the QCM algorithm that outperformed the prevailing algorithms, i.e., Divide-and-Conquer (DnC), Service Level Agreements (SLA), and Hybrid Energy-aware Clustering Protocol for IoT (Hy-IoT) for identification and elimination of redundant flooding queries. The inferential analysis for performance evaluation of algorithms was measured in terms of three scenarios, i.e., energy consumption, delays and throughput with different intervals of traffic, malicious mote and malicious mote with realistic condition. It is evident from the results that the QCM algorithm outperforms the existing algorithms and the statistical probability value “P” < 0.05 indicates the performance of QCM is significant at the 95% confidence interval. Hence, it could be inferred from findings that the performance of the QCM algorithm was substantial as compared to that of other algorithms.

CONE: A Connected Dominating Set-Based Flooding Protocol for Wireless Sensor Networks

Wireless sensor networks (WSNs) play a significant role in a large number of applications, e.g., healthcare and industry. A WSN typically consists of a large number of sensor nodes which rely on limited power sources in many applications. Therefore, improving the energy efficiency of WSNs becomes a crucial topic in the research community. As a fundamental service in WSNs, network flooding offers the advantages that information can be distributed fast and reliably throughout an entire network. However, network flooding suffers from low energy efficiency due to the large number of redundant transmissions in the network. In this work, we exploit connected dominating sets (CDS) to enhance the energy efficiency of network flooding by reducing the number of transmissions. For this purpose, we propose a connected dominating set-based flooding protocol (CONE). CONE inhibits nodes that are not in the CDS from rebroadcasting packets during the flooding process. Furthermore, we evaluate the performance of CONE in both simulations and a real-world testbed, and then we compare CONE to a baseline protocol. Experimental results show that CONE improves the end-to-end reliability and reduces the duty cycle of network flooding in the simulations. Additionally, CONE reduces the average energy consumption in the FlockLab testbed by 15%.

QoS Enabled Layered Based Clustering for Reactive Flooding in the Internet of Things

The Internet of Things has gained substantial attention over the last few years, because of connecting daily things in a wide range of application and domains. A large number of sensors require bandwidth and network resources to give-and-take queries among a heterogeneous IoT network. Network flooding is a key questioning strategy for successful exchange of queries. However, the risk of the original flooding is prone to unwanted and redundant network queries which may lead to heavy network traffic. Redundant, unwanted, and flooded queries are major causes of inefficient utilization of resources. IoT devices consume more energy and high computational time. More queries leads to consumption of more bandwidth, cost, and miserable QoS. Current existing approaches focused primarily on how to speed up the basic routing for IoT devices. However, solutions for flooding are not being addressed. In this paper, we propose a cluster-based flooding (CBF) as an interoperable solution for network and sensor layer devices which is also capable minimizing the energy consumption, cost, network flooding, identifying, and eliminating of redundant flooding queries using query control mechanisms. The proposed CBF divides the network into different clusters, local queries for information are proactively maintained by the intralayer cluster (IALC), while the interlayer cluster (IELC) is responsible for reactively obtain the routing queries to the destinations outside the cluster. CBF is a hybrid approach, having the potential to be more efficient against traditional schemes in term of query traffic generation. However, in the absence of appropriate redundant query detection and termination techniques, the CBF may generate more control traffic compared to the standard flooding techniques. In this research work, we used Cooja simulator to evaluate the performance of the proposed CBF. According to the simulation results the proposed technique has superiority in term of traffic delay, QoS/throughput, and energy consumption, under various performance metrics compared with traditional flooding and state of the art.