Black Hole Attacks on MANETs: Analysis and Prevention

Wireless network technically, refers to the category of network in which communication is carried out without using wires. In modern era wireless network has great importance because the communication is taking place with the use of radio waves. Thus, the use of ad-hoc network starts yielding a great importance in variety of applications. The certain research work is carried out in this particular field. MANET is a constructed from various mobility in the form of mobile nodes and anytime without any need of fixed infrastructure. MANET can be made on fly due to lack of fixed infrastructure. MANET is numerous threats types of attacks due to dynamic changing topologies and wireless medium. Security of the MANET becomes one of the challenging tasks. Black hole attacks is the main type of attack that are possible in MANET. Black hole node not forward any data packets to the neighbour node instead it drops all the data packets. Black hole attacks are bit hard to detect due to lack of centralized access. This research work concentrates to enhance the security of MANET by identifying and blocking black hole assaults from occurring. A reactive routing system such as Ad-Hoc on Demand Distance Vector has previously been used to address security problems in the MANET (AODV). Various attack types were investigated, and the consequences of these assaults were detailed by describing how MANET performance was disrupted. Network Simulator 3 (NS3) is used for the simulation process.

Adopting MQTT for a multi protocols IoMT system

<span>Coronavirus disease (COVID-19) altered the way of caregiving and the new pandemic forced the health systems to adopt new treatment protocols in which remote follow-up is essential. This paper introduces a proposed system to link a remote healthcare unit as it is inside the hospital. Two different network protocols; a global system for mobile communication (GSM) and Wi-Fi were used to simulate the heath data transfer from the two different geographical locations, using Raspberry Pi development board and Microcontroller units. Message queuing telemetry transport (MQTT) protocol was employed to transfer the measured data from the healthcare unit to the hospital’s Gateway. The gateway is used to route the aggregated health data from healthcare units to the hospital server, doctors’ dashboards, and the further processing. The system was successfully implemented and tested, where the experimental tests show that the remote healthcare units using a GSM network consumed about 900 mWh. A high percentage of success data packets transfer was recorded within the network framework as it reaches 99.89% with an average round trip time (RTT) of 7.5 milliseconds and a data transfer rate up to 12.3 kbps.</span>

Probabilistic Cooperative Coded Forwarding for Broadcast Transmissions in Industrial Mobile Edge Communications

Mobile edge computing (MEC) has been considered as a key enabler for the industrial internet of things (IIoT) to cope with the ever-increasing communication and computing demands of nodes. In consideration of the limited power and resource of the IIoT nodes, it is necessary to design cost-effective data sharing mechanisms for MEC-enabled wireless industrial communication networks. In this article, we propose the probabilistic cooperative coded forwarding (PCCF) scheme based on network coding (NC) to minimize the required transmission number in both the data source and relay nodes. The data packets are encoded sparsely in a systematic coding framework so that the decoding process at the receivers can be more efficient. The relationship between the forwarding and coding parameters of the proposed scheme and the successful decoding probability are comprehensively analyzed and the approximations are numerically verified. Throughout the analysis, we find the optimal sparsity of network coding vectors and also the existence of minimum transmission numbers.

Visual Collaboration Leader-Follower UAV-Formation for Indoor Exploration

UAVs operating in a leader-follower formation demand the knowledge of the relative pose between the collaborating members. This necessitates the RF-communication of this information which increases the communication latency and can easily result in lost data packets. In this work, rather than relying on this autopilot data exchange, a visual scheme using passive markers is presented. Each formation-member carries passive markers in a RhOct configuration. These markers are visually detected and the relative pose of the members is on-board determined, thus eliminating the need for RF-communication. A reference path is then evaluated for each follower that tracks the leader and maintains a constant distance between the formation-members. Experimental studies show a mean position detection error (5 × 5 × 10cm) or less than 0.0031% of the available workspace [0.5 up to 5m, 50.43° × 38.75° Field of View (FoV)]. The efficiency of the suggested scheme against varying delays are examined in these studies, where it is shown that a delay up to 1.25s can be tolerated for the follower to track the leader as long as the latter one remains within its FoV.

An Efficient Probe-Based Routing for Content-Centric Networking

With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.

Trilateral Location based Maximum Weighted Directive Spanning Tree for Optimal Routing in IoV

Internet of Vehicles (IoV) is one of the developing models in the Vehicular adhoc networks (VANETs) with the vast improvement of communication technologies. In order to improve data transmission among the multiple communities without link breakage, a novel Trilateral Location Identified Maximum Weighted Directive Spanning Tree (TLIMWDST) technique is introduced. The proposed TLIMWDST technique consists of two major phases, namely location identification and optimal path identification to improve the reliability of data transmission from source vehicle to destination vehicle. In the first phase, the location of the neighboring vehicles is identified by applying a trilateration technique. After the location identification, an optimal route path between the source and destination is identified using Maximum Weighted Directive Spanning Tree (MWDST) through the intermediate nodes. The performance of the TLIMWDST technique is assessed through simulation as compared to the previous path selection techniques in terms of different routing metrics such as packet delivery ratio, packet loss rate, end-to-end delay and throughput with respect to the number of data packets.

An Efficient Data Transmission in Cognitive Radio Networks Using Momentum Search Algorithm

Data Transmission plays an important role in the digital world. In here, We are using Cognitive Radio(CR) a concept on Wireless Sensor Networks(WSN) which is being used as an intelligent wireless Communication Technology having unique Capabilities of monitoring spectrum bands and detecting available channels to enable the usage of statically allocated spectrum Furthermore, by dynamically adjusting its operating parameters, it can utilize available channels and to attack the upcoming spectrum crunch issue. Cognitive Radios can be used to find unused licensed spectrum and it can be utilized by secondary users without causing any interference to licensed users. Existing technologies used in cognitive radio include energy sensing, spectrum databases, and spectrum sensing using pilot channels. In small networks, transmission of small packet size can be transmitted with high efficiency without delay, whereas transmission of large data packets can cause data corruption, data packet corruption and may require retransmission over higher frequency channels. To avoid this type of interference, users need higher efficiency and wider bandwidth for efficient transmission. Here we use the technique of momentum search algorithms working on the law of conservation of momentum and the law of conservation of kinetic energy. Data transferred using this method is always unaltered. The transmitted data is split into fixed-size 64-bit packets. And the channel selection will be changed accordingly for higher channel selection efficiency for lossless data transmission. The rules of the Momentum Search algorithm allow users to transmit larger data packets with higher efficiency with the same level of interference as the primary user (PU). This proposal shows how to achieve the highest level of data transmission performance using a cognitive wireless network based on a Momentum search algorithm.

Pengaruh Push, Pull, dan Mooring terhadap Switching Intention pada Konsumen Pengguna Wifi di Era Pandemi Covid-19

Internet use during the current pandemic is increasing, and most are done online. Work From Home (WFH) and School From Home (SFH) require stable and smooth internet. In addition to the internet, smartphones also play an essential role in people's daily lives during restrictions due to the pandemic. This study aims to analyze and discuss the effect of push, pull and mooring on switching intention. This study uses a push-pull-mooring model with an approach through switching intention. Respondents in this study were at least 20 years old. Due to this age, respondents have entered the adult stage in switching intentions from internet data packages to wifi. The sample used is 110 respondents—the sampling method used non-probability sampling with the judgmental sampling method. The analysis technique uses multiple linear regression with SPSS26 software. Based on the results obtained, it is known that the push variable on switching intention to use wifi has a positive effect. The pull variable has a positive impact on switching intention to use wifi. When the push and pull are getting stronger, consumers will switch. Mooring variable does not affect internet data packet switching intention to private wifi. This result shows that the switching intention of data packets to use wifi privately at home is relatively high. Due to using private wifi, you can access or surf the internet at a stable speed compared to data packet internet, in contrast to using data packet internet whose network is unstable.

ACE: A Routing Algorithm Based on Autonomous Channel Scheduling for Bluetooth Mesh Network

The Internet of Things (IoT) interconnects massive cyber-physical devices (CPD) to provide various applications, such as smart home and smart building. Bluetooth Mesh is an emerging networking technology, which can be used to organize a massive network with Bluetooth Low Energy (BLE) devices. Managed-flooding protocol is used in Bluetooth Mesh to route the data packets. Although it is a highly desirable option when data transmission is urgent, it is inefficient in a larger and denser mesh network due to the collisions of broadcast data packets. In this paper, we introduce ACE: a Routing Algorithm based on Autonomous Channel Scheduling for Bluetooth Mesh Network. ACE relies on the existing Bluetooth Mesh messages to distribute routes without additional traffic overhead and conducts a beacon-aware routing update adaptively as the topology evolves. In ACE, BLE channel resources can be efficiently utilized by a channel scheduling scheme for each node locally and autonomously without any neighborly negotiation. We implement ACE on the nRF52840 from Nordic Semiconductor and evaluate its effectiveness on our testbed. Compared to the Bluetooth Mesh, our experiments proved that ACE could reduce the end-to-end latency by 16%, alleviate packets collisions issues, and increase the packet delivery ratio (PDR) by 30% under heavy traffic. Moreover, simulation results verified that ACE has better scalability when the size and density of networks become larger and denser.

Communication Bandwidth Prediction Technology for Smart Power Distribution Business in Smart Parks

Accurate prediction of power business communication bandwidth is the premise for the effectiveness of power communication planning and the fundamental guarantee for regular operation of power businesses. To solve the problem of scientifically and reasonably allocating bandwidth resources in smart parks, communication bandwidth prediction technology of intelligent power distribution service for smart parks is proposed in this paper. First, the characteristics of mixed service data arrival rate of power distribution and communication mixed services in smart parks were analyzed. Poisson process and interrupted Poisson process were used to simulate periodic and sudden business of smart parks to realize accurate simulation of the business arrival process. Then, a service arrival rate model based on the Markov modulation Poisson process was constructed. An active buffer management mechanism was used to dynamically discard data packets according to the set threshold and achieve accurate simulation of the packet loss rate during the arrival of smart park business. At the same time, considering the communication service quality index and bandwidth resource utilization, a business communication bandwidth prediction model of smart parks was established to improve the accuracy of business bandwidth prediction. Finally, a smart power distribution room in a smart park was used as an application scenario to quantitatively analyze the relationship between the communication service quality and bandwidth configuration. According to the predicted bandwidth, the reliability and effectiveness of the proposed method were verified by comparison with the elastic coefficient method.