hop count


Also found in: Dictionary, Thesaurus, Wikipedia.

hop count

The number of point-to-point links in a transmission path. Since each link is terminated at a network device such as a router or gateway, the processing performed within the device to determine how to forward the packet adds overhead to the transmission. Although each point-to-point link is technically a hop, the hop count is the number of network devices between the starting node and the destination node. An IP packet traveling over the Internet can easily "hop" through more than a dozen routers.


Hops in a Network
Electrical signals may travel near the speed of light in a wire, but each junction point (router, gateway, etc.) adds processing overhead.
References in periodicals archive ?
Fuzzication Module: convert each crisp input into a fuzzy set, for this purpose membership functions are used, It is proposed here that Route metrics that are used to make a decision are Total energy available in a path, and hop count. On another hand the output linguistic variable is Fuzzy route.
- Accumulated hop count: the MAs dispatched by the sink move among the source nodes of the network to gather data.
When hop count is greater than zero, it forwards the query to its neighbors; otherwise, the query is stopped.
On the other hand, the source node S ignores the benign RREP packet received from the node 1 which is generated by the destination node D as the RREP has a lower sequence number and higher hop count as compared to those received from the fabricated RREP generated by the adversary node M.
Hop Count refers to the total number of Intermediate devices through which the data travels from source to destination.
It was also evidenced that RIPng uses a 1 to 16 metric, which represents the hop count and also shows 15 as the maximum amount of hops.
It first checks the hop count to the final destination in the current network topology and the hop count of an L1 packet in a previous ComFrame.
The routing protocol with hop count metric will choose the smallest number of hops as the path to deliver the data, which is S-C-D, with 2 hops.
In Section 5, we show optimal hop distance and hop count to minimize the outage performance and propose suboptimal hop distance and hop count that give close enough outage probabilities to the optimal ones.
In location broadcast, the anchor node broadcasts its location information and initializes the hop count to zero among its neighbors.
Figure10(g) shows the average hop counts is decreasing with the increasing number of mobile nodes at different security schemes with and without WHA because UEs offers zero hop-count.
Nodes join tree index update cost is 6logN a hop count and the 2log n a hop number is used to update the neighbor nodes of the parent node of the routing table, the 2log n a hop count for update routing tables in the new node's neighbor nodes, as well as 2log n a hop count for building its own routing table.