Hop Count Parameters Research Articles

Study on the wireless sensor networks routing for Low-Power FPGA hardware in field applications

Very intelligent compact sensors with low-power and inexpensive solutions have been created because of the industrial revolution and subsequent advancements in electrical technology and wireless communications. Modern innovative enhancements have been made for the utilization of small, low-price, and low-power wireless communication devices with fast processing capabilities. The sensor node communication and routing play a significant role in the configuration of a specific WSN environment. There are three types of WSN routing: proactive, reactive, and hybrid. DSDV and OLSR are two proactive routing technologies. AODV and DSR are reactive routing technologies. DSDV Routing requires a progress update of its routing tables even when the network is not in use, which uses battery power and generates negligible data. As a result, this protocol is inappropriate for networks that are both huge in scope and very dynamic. OLSR maintains track of all potential solutions in a routing table. The overhead from control messages rises as there are more mobile hosts. It requires more processing power than other protocols while looking for alternate routes. The DSR protocol relies on the minimal hop count parameter to pick the way without considering other parameters that impact routing algorithm performance, such as energy consumption, residual energy, and connection stabilities. The FPGA realization provides an ascendable computing environment for WSN planning in a specific region. The research articles emphasize the hardware chip simulation and analysis of these routing protocols which can be further applied for field applications and configuration The network performance is evaluated using several performance metrics such as throughput, control overhead, delay, packet delivery ratio, and power consumption. This study offers a key method for creating FPGA-based power estimation and verification models for a WSN planning environment.

An Enhanced Forwarding Method based on Intelligent Water Drops Algorithm in Named Data Network

Although Named Data Network (NDN) has made a bright future in Internet for high volume of requests by many users, how to send a request package (I-Pkt) consciously from the consumer to the Producer and returning the data package (D-Pkt) inversely is still one of its most important challenges. According to the recent limited researches, using service quality parameters beside an optimization algorithm like ant colony to find the optimal path has been an appropriate response to solve this problem. Not considering the service quality parameters sufficiently to find an optimal path is a problem to be focused more on. In line with this, this study has addressed the Intelligent Water Drops (IWD) optimization algorithm. In this algorithm, the best possible path based on many parameters related to path quality like cost, delay and number of steps taken by the package (I-Pkt) will be selected. In other words, the water drop movement tries to find the optimal path through the amount of soil collection in the path or the velocity rate. The results of simulating in ndnSIM simulator show that comparing the ant colony, it has improved in cost parameter on average by 23%, in hit ratio parameter by 24% and in hop count parameter by 13%. The general result is increasing service level quality in NDNs.

QoS Improvement Using In-Network Caching Based on Clustering and Popularity Heuristics in CCN.

Content-Centric Networking (CCN) has emerged as a potential Internet architecture that supports name-based content retrieval mechanism in contrast to the current host location-oriented IP architecture. The in-network caching capability of CCN ensures higher content availability, lesser network delay, and leads to server load reduction. It was observed that caching the contents on each intermediate node does not use the network resources efficiently. Hence, efficient content caching decisions are crucial to improve the Quality-of-Service (QoS) for the end-user devices and improved network performance. Towards this, a novel content caching scheme is proposed in this paper. The proposed scheme first clusters the network nodes based on the hop count and bandwidth parameters to reduce content redundancy and caching operations. Then, the scheme takes content placement decisions using the cluster information, content popularity, and the hop count parameters, where the caching probability improves as the content traversed toward the requester. Hence, using the proposed heuristics, the popular contents are placed near the edges of the network to achieve a high cache hit ratio. Once the cache becomes full, the scheme implements Least-Frequently-Used (LFU) replacement scheme to substitute the least accessed content in the network routers. Extensive simulations are conducted and the performance of the proposed scheme is investigated under different network parameters that demonstrate the superiority of the proposed strategy w.r.t the peer competing strategies.

A novel dynamic source routing (DSR) protocol based on minimum execution time scheduling and moth flame optimization (MET-MFO)

In general, the conventional routing approaches in mobile ad hoc networks (MANETs) provide a route between the source and the target with a minimum hop count. Dynamic source routing (DSR) as a typical prototype of routing protocols relies on the minimum hop count parameter to provide the path without considering any other factors such as energy consumption and node energy level, which significantly affect the routing algorithm performance. To enhance the performance of the DSR, a novel and efficient routing mechanism based on a hybrid approach using the minimum execution time (MET) scheduling and moth flame optimization (MFO) scheme is proposed. This hybridization version of DSR is called the (MET-MFODSR) algorithm, and it aims to improve the routing mechanism through establishing an optimal route with minimum energy consumption, which increases the network lifetime and reduces route failure issues. The proposed MET-MFODSR protocol is implemented using the MATLAB platform, analyzed and evaluated in different simulation environments. The simulation results demonstrate that the suggested routing algorithm is applicative and practicable, and its performance exceeds the performance of the existing Bee DSR (BEEDSR) and Bee-inspired protocol (BeeIP) algorithms.

Optimization of Maximum Routing Hop Count Parameter Based on Vehicle Density for VANET

Vehicular Ad Hoc Network (VANET) is the basic technology of intelligent transportation systems for providing reliable and real-time communications between vehicles and vehicles or roadside units. In order to improve the communication quality of VANET, this paper studies the effects of different maximum routing hop count parameters on the performance of the network under different vehicle densities. We establish the mathematical models of node connectivity probability and the packet delivery ratio by using the Poisson distribution model. And the maximum routing hop count selection algorithm (MRHSA) is proposed based on the theoretical model established in the paper. The simulation experiments and statistical analysis on packet delivery ratio, throughput, and end-to-end delay are performed under the straight road and urban road scenes, supported by the Vehicle in Network Simulation (Veins). The results show that the maximum routing hop count parameter is an important impact factor on the communication quality of the network. It is found that MRSHA proposed in this paper can improve the packet delivery ratio by about 9.1% at most in straight road scenarios, which indicates that MRHSA will contribute to the improvement of the communication quality of VANET.