Send Data Packets Research Articles

Bee inspired secured protocol for routing in cognitive radio ad hoc networks

Background: Enhancing security and minimizing the delay is a significant task present in all modern networks. Dynamic emerging problems like node failure, route failure, intrusions, and security attacks lead the network to failure. Hence, there exist needs for development of a protocol that detects the intrusions and find the better route to destination. Objectives: The main objectives of this research is to understand the issues and challenges in routing that rise dynamically in cognitive radio ad hoc network and propose a bio-inspired routing protocol to enhance security and routing efficiency which will result in reduced delay cum energy consumption. Methods: This study proposes Bee Inspired Secured Protocol (BISP) for routing in cognitive radio ad hoc networks that focuses on increasing the security before sending data packets and decreasing the overall delay. An instinctive characteristic of Bees towards searching for food is utilized to design the proposed routing protocol, which selects the better path to the destination. To enrich the security during data transmission, Rivest Shamir Adelman algorithm is applied. The proposed protocol analyzes the security level of the route and neighbor node energy level before sending the data. Findings: NS2.35 simulator used to evaluate the performance of BISP. Simulation results indicate that BISP has better performance than the existing protocol (i.e., WPIP and GRP) in terms of throughput, packet delivery ratio, reduced delay and enhanced security. Novelty : Comprehensive analysis indicates that BISP have superior performance in classifying the intruding nodes, enhancing the security of data getting transmitted, and reducing the delay. Keywords: Routing; security; intrusion; Bee; CRAHN

Game theoretic application for energy efficient mobility handling in wireless sensor network

AbstractWireless sensor network (WSN) are used to sense, process, and send important information relating to surrounding environment. In these network, one of the important issue is timely delivery of packets to destination and thus avoiding packet loss when sensor nodes are mobile. Most of the current research does not allow handling of packets of mobile sensor nodes till next Time‐division multiple access (TDMA) schedule. In this work, we investigate the problem of allocating reserved slots to mobile nodes which come in vicinity of new cluster head in currenTDMAschedule only. We model allocation of reserved slots to mobile nodes as cooperative game. We then propose cooperative coordination scheme to allow cooperation among mobile sensor nodes for accessing of reserved slots with the objective of avoiding unnecessary delay and packet loss in the network. We consider solution for both the cases when reserved slot is limited to 1 and when reserved slots are more than 1. We then propose evolutionary game theory‐based slot allocation scheme for calculation of probability by solving nash equilibrium point. This probability is used by mobile nodes to send data packets to new cluster head. Our scheme avoids end to end delay of packets and network congestion due to buffer overflows. We then present extensive simulation results comparing our scheme with existing techniques. The results show higher performance in terms of average residual energy, network lifetime and packet delivery ratio etc.

A Secure Communication in IoT Enabled Underwater and Wireless Sensor Network for Smart Cities

Nowadays, there is a growing trend in smart cities. Therefore, the Internet of Things (IoT) enabled Underwater and Wireless Sensor Networks (I-UWSN) are mostly used for monitoring and exploring the environment with the help of smart technology, such as smart cities. The acoustic medium is used in underwater communication and radio frequency is mostly used for wireless sensor networks to make communication more reliable. Therefore, some challenging tasks still exist in I-UWSN, i.e., selection of multiple nodes’ reliable paths towards the sink nodes; and efficient topology of the network. In this research, the novel routing protocol, namely Time Based Reliable Link (TBRL), for dynamic topology is proposed to support smart city. TBRL works in three phases. In the first phase, it discovers the topology of each node in network area using a topology discovery algorithm. In the second phase, the reliability of each established link has been determined while using two nodes reliable model for a smart environment. This reliability model reduces the chances of horizontal and higher depth level communication between nodes and selects next reliable forwarders. In the third phase, all paths are examined and the most reliable path is selected to send data packets. TBRL is simulated with the help of a network simulator tool (NS-2 AquaSim). The TBRL is compared with other well known routing protocols, i.e., Depth Based Routing (DBR) and Reliable Energy-efficient Routing Protocol (R-ERR), to check the performance in terms of end to end delay, packet delivery ratio, and energy consumption of a network. Furthermore, the reliability of TBRL is compared with 2H-ACK and 3H-RM. The simulation results proved that TBRL performs approximately 15% better as compared to DBR and 10% better as compared to R-ERR in terms of aforementioned performance metrics.

Performance of Routing Protocol OLSR and BATMAN in Multi-hop and Mesh Ad Hoc Network on Raspberry Pi

Ad hoc network is a network where each node can act as a terminal and also as a router. Ad hoc technology does not require infrastructure that controls communication systems centrally. Therefore, each node on the ad hoc network can manage itself. This study aims to design nodes that can be used for communication on wireless ad hoc networks then compare the networks performance on OLSR and BATMAN routing protocols. There are four performance parameters used, namely Throughput, Round Trip Delay (RTD), Packet Delivery Ratio (PDR), and Convergence Time. The topology used includes P2P communication and multi-hop communication. Network performance testing is done both for P2P and multi-hop communication on MESH networks. Convergence Time Testing is done only for multi-hop communication to find out the time needed by the protocol to repair the path when a path fail occurs. The test results show that OLSR gives a better average value of throughput compared to BATMAN. Whereas RTD shows that the BATMAN routing protocol is better compared to OLSR. Both protocols, OLSR and BATMAN, successfully received all data packets sent by the source node on P2P communications. Failure to send data packets occurs in multi-hop communication as indicated by a PDR value of 98% for the OLSR protocol and 95% for the BATMAN protocol.

Exploring Token-Oriented In-Network Prioritization in Datacenter Networks

In memory computing and high-end distributed storage demand low latency, high throughput, and zero data loss simultaneously from datacenter networks. Existing reactive congestion control approaches cannot both minimize queuing latency and ensure zero data loss. A token-oriented proactive approach can achieve them together by controlling congestion even before sending data packets. However, state-of-the-art token-oriented approaches only strive to optimize network-level metrics: maximizing throughput while achieving flow-level fairness. This article answers the question of how to support objective-aware traffic scheduling in token-oriented approaches. The novelty of Token-Oriented in-network Prioritization (TOP) is that it prioritizes tokens instead of data packets. We make three contributions. Via simulations over a hypothetical TOP system, our first contribution is demonstrating the potential performance gain that can be brought by TOP. Second, we investigate the applicability of TOP. Although the overhead of enabling necessary TOP features in switches is trivial, we find that mainstream commodity datacenter switches do not support them. We hence propose a readily-deployable remedy to achieve in-network prioritization by pushing both switch and end-host hardware capacity to an extreme end. Lastly, we implement a running TOP system with Linux hosts and commodity switches, and evaluate TOP in testbeds and with large-scale simulations for various scenarios.

An Exploration into Energy Efficient Algorithms Based on the Techniques of Particle Swarm Optimization in MANET

This paper throws understanding into nature inspired meta-heuristic algorithm; Particle Swarm Optimization based technique in designing various energy efficient MANET routing algorithms. Mobile ad hoc network (MANET) is a framework-less system of self-directed mobile nodes. Owing to the dynamic topological property of MANET, it’s very rigid task to calculate the performance of routing protocol under unpredictable network conditions and the performance of the network will degrade. The performance of Mobile Ad-hoc network is measured by metrics such as packet delivery ratio, battery power and total delay in delivery. Regular variation in topology affect route selection and lifespan of network, hence it is essential to optimize these metrics parameters. There are various protocols developed for routing. These routing paths are established to send data packets through the shortest path without a satisfying multi-objective approach. The purpose of the research is to discuss different approaches of swarm based intelligence routing algorithms used in MANET under dynamic conditions by comparing the measured metrics and to design a novel effective PSO based routing procedure for MANET.

Deteksi Serangan Denial of Service di Situs Web dengan Wireshark Menggunakan Metode IDS Berbasis Anomali

Denial of Service (DoS) attacks are increasingly dangerous. This DoS attack works by sending data packets continuously so that the target being attacked cannot be operated anymore. DoS attacks attack the most websites, thus making the website inaccessible. An anomaly based intrusion detection system (IDS) is a method used to detect suspicious activity in a system or network on the basis of anomaly pattern arising from such interference. Wireshark is software used to analyze network traffic packets that have various kinds of tools for network professionals.

A mobile fault detection algorithm in heterogeneous wireless sensor networks: a bio-inspired approach

This paper puts forth a novel mobile fault detection algorithm for wireless sensor networks (WSNs) based on bacterial-inspired optimization. We introduce a bio-swarm intelligence approach to mobile fault detection in WSNs by using voltage values. At certain times, the sensor nodes in the clustered network send data packets containing health-fitness information to cluster heads (CHs) selected by the proposed CH selection algorithm. A mobile sink (MS) collects the health status via data from all the nodes as they reach the intersection point of the CHs. After this stage, the data packets are analyzed by the MS, and hardware or software faults are detected by assessing the fitness values of the nodes. The faulty nodes are eventually discarded from the network, and recovery of the rest of the nodes in the network is satisfied. Inspired by the interaction of bacteria for feed collection, their response to chemicals, and their interaction and communication with one another, we bring an innovative approach to finding node failures or software faults in WSNs, and these failures are removed from the network to help its operation and to take measures to maintain the electrical structures. In fact, we adapt our algorithm to low energy harvesting electrical components as an example. We compare our novel algorithm with existing studies through extensive simulations in NS 2 environment based on fault detection accuracy, false alarm rate, and false positive rate criteria versus fault probability, number of nodes, and sink speed. Considering detection accuracy, the simulation results validate that our algorithm shows better performance as compared with others.

Performance Evaluation and Comparison of GRP and OLSR Routing Protocols for Video Streaming Over Mobile Ad Hoc Networks Using OPNET 14.5

Due to the increased use of mobile devices with the high demand for applications such as video application, most companies have tended to pay attention to Mobile Ad hoc Networks. This type of network is characterized by multi-hop wireless networks where data packets are sent in a "store and forward" manner from the source to an arbitrary destination via intermediate nodes. The mobile nodes are connected by multi-routes routing as the nodes in this network not only serve as hosts but also as routers where data is routed to and from other nodes in the network and therefore the mobile node not only sends its data packets but also sends data packets of other mobile nodes. The network architecture changes dynamically, mainly because of Mobility of nodes, so we need routing protocols to establish the connection. Routing protocols are categorized into proactive routing protocols, reactive routing protocols and hybrid routing protocols. So in this research, we has been studied Geographical Routing Protocol (GRP ), Optimized Link State Routing Protocol (OLSR) routing protocols which is one of proactive routing protocols and hybrid routing protocols respectively on the basis of Throughput, Delay and Load..etc and evaluated the performance in a large mobile ad hoc network and in a small mobile ad hoc network as well as for different video resolutions, the OPNET 14.5 network simulator was used to obtain research results. It was found that the GRP protocol performs better for a small number of nodes whether the video resolution is low or high while its performance decreases when the number of nodes increases in the network but the OLSR protocol improves when the number of nodes is increased.

Design & analysis of a distributed routing algorithm towards Internet-wide geocast

Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. This forwarding method is valuable in situations where any number of nodes inside a geographic area need to be reached, such as vehicular networking scenarios. To facilitate large scale geocast, a wired network geographic routing algorithm is needed that can route packets efficiently towards a destination area. Our goal is to design an algorithm that can deliver shortest path tree like geographic forwarding while relying purely on distributed data without central knowledge. In this paper we present and implement two algorithms for geographic routing. One algorithm is based purely on distance-vector data. Another, more complicated algorithm is based on path data. We show that our purely distance-vector-based algorithm can come close to the number of links used by a shortest path tree when a small number of routers are present in the destination area. We also show that our path-based algorithm can come close to the link usage of a shortest path tree in almost all geocast situations. We also show that the algorithms converge relatively quickly following link drops.

Perancangan Sistem Jaringan Komputer Menggunakan Teknik Failover Pada Routing Static Yang Bersifat Recursive Connection

In a computer network system when using more than one router that is interconnected will experience a problem in the process of sending data packets. The problem is that if the main line is disconnected, then the data packet is unable to send data to a computer network system. The purpose of this study is to make a computer network system design with fail over technique on the type of static routing that is not directly connected. In this case the researcher used the Microtub Router Board RB-951-2nd. Failover technique is a way to transfer routing paths when the main line is broken, so it can be diverted to the backup routing path, this is so that the computer network connection path continues smoothly. The researcher used a recursive network connection case or the router is not connected directly to the main point center (main gateway), so the researcher used the optimization of the Target Scope and Distance features in the Microtic Router Board. The results of this study was that the backup routing path was able to channel data packets within the network if the main line did not respond or could not be connected.

Optimal Filtered and Smoothed Estimators for Discrete-Time Linear Systems With Multiple Packet Dropouts Under Markovian Communication Constraints.

This paper concentrates on the linear least mean square (LLMS) filtered and smoothed estimators for networked linear stochastic systems. Multiple packet losses, Markovian communication constraints, and superposed process noise are considered simultaneously. In order to reduce the channel load during communication, at every step, just one transmission node is permitted to send data packets. Hence, a Markovian communication protocol is utilized to arrange the packets of these transmission nodes. Moreover, multiple data packet dropouts occur during transmission due to an imperfect communication channel. Therefore, the global observation information cannot be obtained by the state estimator. The real state of Markov chain is assumed to be unknown to the estimator except the transition probability matrix. By means of the innovation analysis approach and orthogonal projection principle, we design Kalman-like estimators in a recursive form. Finally, through simulation experiments, we verify the effectiveness and superiority of the designed algorithm.

Optimizing Branch Telephone Networks for Campus VoIP with Mobile Clients

During working hours, employees on campus are not always in their room because of other activities in other rooms both in one building and in different buildings. In this study, the development of a branch telephone communication network or private branch exchange (PBX) uses voice over internet protocol (VoIP) technology with a mobile-based client device and utilizes the internet as a media. For system design, network development life cycle (NDLC) method is used where VoIP communication network is monitored with paessler router traffic grapher (PRTG) software to see quality of service (QoS) values with packet loss, delay, and jitter parameters. The results of the monitoring of each parameter are of perfect average which can be seen from the amount of packet loss value of 0%; delay below 150 msec for sending data packets from the transmitter to the receiver; and jitter in a proper category with a time below 75 msec. However, for better development, the installation and configuration of servers that have been created virtually can be implemented on the actual server system; IP usage which is devoted to VoIP communication networks; bandwidth management to provide a separate traffic line for the VoIP communication network that is created.

An efficient scheduling scheme for MIMO-OFDM broadcast networks

A new limited feedback user/antenna scheduling algorithm is proposed for multiple-input multiple-output orthogonal frequency division multiplexing broadcast networks. Feedback of channel state information at users to base station (BS) is inevitable for efficient spectrum utilization by performing the best possible scheduling of users/antennas. The feedback overhead increases with number of users and subcarriers. This enormous feedback information consumes useful bandwidth in uplink channel. Hence, in literature scheduling schemes with clustering of adjacent subcarriers (per-cluster scheduling) are proposed to reduce feedback overhead by considering channel condition of only the center subcarrier of cluster. According to proposed algorithm, channel conditions of all subcarriers are taken into consideration in a novel manner for efficient scheduling. The benefit of this scheme is attaining higher system throughput than the per-cluster scheduling scheme without incurring any additional feedback overhead. Moreover, this scheme achieves higher system throughput for large cluster size and more number of channel taps as compared to per-cluster scheduling scheme. Further throughput is improved by assigning previously unscheduled users randomly to transmit antennas which were not sending data packets to any users previously.

An Energy-Efficient Multi-Ring-Based Routing Scheme for WSNs

Data aggregation is an important solution to decrease energy consumption by reducing the transmitting data in the wireless sensor networks (WSNs). Although there have been many energy-efficient data routing algorithms devoted to data gathering, the highly correlation of sensed data in WSNs is not fully considered in many existing studies. A lot of redundant data is still transmitted to the sink, which increases the energy cost in the WSNs. In this paper, a novel scheme named Energy-efficient Routing Scheme based on Multi-Ring (ERSMR) is proposed to minimize the energy consumption. The core idea of the scheme is to aggregate data packets of nodes in the peripheral area as far as possible to achieve fully utilization of node energy far from the sink. The proposed scheme can not only minimize the size of receiving and sending data packets in hotspots, but also reduce the maximum energy consumption of nodes for prolonging the network lifetime. Furthermore, it could balance energy consumption in the network and increase energy efficiency of the nodes by exploiting the remaining energy of peripheral nodes. The correctness of the proposed scheme is proved by theory analysis. Simulations are implemented to evaluate the efficiency of the proposed scheme. The simulation results show that it could improve the network lifetime and the energy efficiency. Compared with the Data Aggregation scheme Centralized Sink (DACS), the lifetime can be increased by as much as 190%. The energy utilization efficiency can be increased by as much as 200%. In addition, the optimal transmission radius to maximize the network lifetime is described.

Improving the Performance of LOADng Routing Protocol in Mobile IoT Scenarios

Routing protocols represent an important issue on the Internet of Things (IoT) scenarios since they are responsible for creating paths and forwarding data packets among the network nodes. In mobile IoT scenarios, the topology changes caused by the movement of nodes makes the work of routing protocols more difficult. Thus, the current IoT routing solutions tend to present strong limitations and a poor performance in these scenarios, generally requiring complex additional improvement to better support the mobility of the devices. In this context, the Lightweight On-demand Ad hoc Distance-vector Routing Protocol - Next Generation (LOADng), is an emerging solution for IoT networks that despite being adequate for a mobile environment due to its reactive functioning still lacks in performance. Thus, this paper proposes a novel solution to enhance the performance of LOADng in mobile IoT networks. The improved version, LOADng-IoT-Mob, introduces a mechanism that permits nodes to be aware of the availability of their neighbors through the harnessing of control messages. As a result, these nodes can shorten paths and avoid sending data packets through broken routes due to the movement of the nodes. Additionally, a short periodical control message is introduced, allowing the nodes to update their routing table, even with a low control message frequency. Furthermore, a new routing metric is proposed for creating routes based on the reliability of the link and proximity of the neighboring nodes. Finally, through computational simulations, the performance of the LOADng-IoT-Mob is studied under multiple scenarios varying the network size, the number of mobile devices, and maximum nodes' speed. The results obtained demonstrate the efficiency of the proposed solution in terms of packet delivery ratio, latency, and power and overhead efficiency, with a slight increase in memory consumption.

A New Algorithm for High Power Node Multicasting in Wireless Sensor Networks

Multicast routing protocols normally depend upon the standard establishment of a multicast tree that needs maintenance of state information by individual nodes. In the case of dynamic networks with burst traffic, between the bursts of data, a long period of silence is expected. The multicast state preservation appends a huge amount of transmission and memory overload. This is no longer suitable for any applications. Therefore, this paper proposes a stateless high power node multicasting method utilizing a group of sink node data, which are implanted in packet headers, to facilitate recipients to fix the finest technique to send data packets in the multicast traffic. In order to eliminate expensive state information of the neighbor table, the HPN multicast protocol utilizes the awareness of the exact positions of sensor nodes. This protocol will be preferably appropriate for multicasting in active networks. The simulation results confirm that HPN multicast affords elevated success rates and little delay exclusive of the trouble of state information.

Full-duplex relay selection analysis for decode-and-forward and amplify-and-forward relaying

In this paper, we explore the cooperation over a modern wireless communication network, where we promote the communication between a pair of moving nodes, the source and the destination, to exchange information. We assume that fading constraints overrun this environment, so accordingly the direct link between the source and the destination nodes is not considered. Therefore, full-duplex (FD) relays cooperate with the source to send data packets to the destination. In this new generation of networks, the crucial issue for wireless devices is their limited battery capacity that impacts mainly the network lifetime. Note that this constraint becomes as important as when devices forward data to other terminals. Thus, with the aim of keeping a good compromise between the power consumption and the system performance, this paper studies an optimal relay selection to select one best relay to forward data to the destination based on Decode-and-Forward (DF) and Amplify-and-Forward (AF) relaying techniques. We derive the DF and AF outage probability closed form expressions and the AF numerical approximation for the relay selection strategy. For verification, simulation results are presented. We also perform an analysis of asymptotic results in order to evaluate the impact of the power transmission on the system performances.

Optimized Routing for Efficient Data Dissemination in MANET to Meet the Fast-Changing Technology

Mobile Adhoc Network (MANET) is a dynamic network without any centralized control. Due to frequent topological change, routing has been always a challenging task in these networks. This article presents optimized routing for efficient data dissemination in MANETs to meet the fast-changing technology of today's world. A novel metric for such optimized routing in MANET is proposed. The main parameters considered to evaluate this metric are the energy consumed during the communication, link stability, Packet Delivery Ratio (PDR) and traffic. The concept is based on a scenario in which a mobile node (source) sends data packets to another mobile node (destination) through its dynamically connected neighboring nodes. The path which consumes the lowest energy and also shows highest link stability is selected for consideration. In case the paths consume the same amount of energy, the highest stable path is chosen. In this manner, the most optimized path is selected. The authors' routing approach shows more efficiency than earlier in dissemination of data and information over the Mobile Ad-Hoc Networks.

A hybrid geographic-DTN routing protocol based on fuzzy logic in vehicular ad hoc networks

Position-based routing algorithms were proposed to overcome the poor efficiency of traditional routing protocols in vehicular ad hoc networks (VANETs); however, while selecting the next hop to send data packets in greedy mode, these algorithms encounter the so-called local maximum problem. The main objectives of this paper are: (1) improving the greedy routing efficiency and (2) reducing the chance of selecting an absurd node for routing. In fact, the proposed method in this paper is aimed at detecting the absurdity of each node before sending the packets to it. That is, sending packets to an absurd node will be avoided; accordingly, the packet will not be trapped in a local maximum. By applying fuzzy logic and parameters such as the number of neighbors, neighboring vehicles’ speed, their direction, and distance from a destination in the proposed method, a chance value is calculated for each neighbor node. Then, the node having the highest chance value among the neighbors is selected for greedy forwarding. In case the greedy forwarding fails, the proposed algorithm will switch to the perimeter forwarding mode for delivering packets to the destination. However, in case the perimeter forwarding also fails, DTN capability is used in the proposed method for delivering packets to the destination. The simulation results of the proposed method indicated that, due to using fuzzy logic and parameters such as nodes’ direction and speed and applying DTN forwarding approach, it was able to better improve packet delivery ratio and end-to-end delay when compared with GPSR, GPSR-DTN, and LSGO routing protocols.