Optimized node access method based on self-adaptive backoff window and backoff speed

Abstract

The invention discloses an optimized node access method based on a self-adaptive backoff window and a backoff speed in a mobile Ad hoc network, comprising the steps of: in a frame of the traditional IEEE (Institute of Electrical and Electronics Engineers) 802.11DCF access protocol binary backoff algorithm, computing the optimal initial backoff window according to real-time node density, and setting a reducing speed for the backoff time according to real-time channel occupying state, thereby simultaneously realizing the self-adaptive update of the backoff window and the self-adaptive update of the node access channel speed. In the Ad hoc network scene in which the nodes are in frequent activities, according to the optimized node access method based on the self-adaptive backoff window and the backoff speed, the network throughput and the average time delay are increased to the greater extent, and the package loss is reduced.

Description

technical field [0001] The invention relates to an access layer method in the technical field of mobile communication, in particular to a node optimization access method based on an adaptive backoff window and backoff speed in a mobile Ad hoc network. Background technique [0002] As a new type of mobile multi-hop wireless network, the mobile Ad hoc network (wireless ad hoc network, referred to as the ad hoc network) has many different characteristics from the traditional wireless network: 1. The self-organization of the network - the largest The characteristic is that it can quickly build a mobile communication network at any time and any place without the support of basic network facilities (such as base stations). 2. Dynamically changing network topology - in the ad hoc network, communication nodes can join and disappear arbitrarily, move in the network at any speed and in any way, and the network topology formed between communication nodes through wireless channels may b...

AI Technical Summary

Problems solved by technology

However, there is a general hidden node problem in competing access protocols: two nodes outside the communication range send messages to the common node at the same time, resulting in message collisions and information loss, which in turn affects other network performance

[0006] We can find that the binary backoff algorithm cannot adjust the performance of the algorithm according to different network conditions because the main parameters of the backoff algorithm are preset fixed values. This defect will be more obvious in networks with rapid node topology changes.

Images