Method and apparatus for contention management in a radio-based packet network

Abstract

In a mesh communication network, a poll request protocol (PRP) is provided in which a special packet is broadcast by the congested node when it is ready to provide services. The controlling node (usually the more congested node) broadcasts a packet to request poll signals from nodes desiring resources of the controlling node. The contending nodes then have equal chances to request the services of the controlling node by sending poll signals. The controlling node can then arbitrate the requests, determine the most fair and efficient use of its resources, and broadcast a scheduling packet to inform the contending nodes when to inform the contending nodes of controlling node scheduling. The contending nodes then send their packets to the controlling node without lost packets caused by congestion collisions. The controlling node can then send data to the contending nodes also without lost packets.

Description

CROSS-REFERENCES TO RELATED APPLICATIONS [0001] This application is a continuation of U.S. patent application Ser. No. 09 / 894,843, filed Jun. 27, 2001, and entitled “METHOD AND APPARATUS FOR CONTENTION MANAGEMENT IN A RADIO-BASED PACKET NETWORK,” the complete disclosure of which is herein incorporated by reference.STATEMENT AS TO RIGHTS TO INVENTIONS MADE UNDER FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT [0002] NOT APPLICABLE REFERENCE TO A “SEQUENCE LISTING,” A TABLE, OR A COMPUTER PROGRAM LISTING APPENDIX SUBMITTED ON A COMPACT DISK NOT APPLICABLE BACKGROUND OF THE INVENTION [0003] This invention relates methods and apparatus for regulating traffic among contending nodes, being particularly advantageous in a wireless mesh packet radio network system. [0004] In a meshed communication system, packets will favor routes which historically have provided the best performance. As traffic increases, previously acceptable paths will provide degraded performance because of congestion unless...

AI Technical Summary

Benefits of technology

[0023] The present invention is an advance on the typical method and apparatus utilized in a mesh network among communicating nodes that experience congestion due to unavoidably high traffic levels. The invention also provides advantages in efficiency and fairness, particularly in a meshed packet radio network system where broadcast must be used and bandwidth is a very limited resource.

[0024] This technique is particularly advantageous when coordinating the resource demands of an indeterminate number of nodes, each generating such demand asynchronously. In this case (which is typical of packet radio networks) the broadcast packet from the contended node provides identical information to all of the potential client nodes; such as timing, load, and availability, thereby giving each contending node an equal view of the controlling node's state. This allows each contending node an equal chance of using the controlling node's resources, thus preventing resource capture by lucky or favored nodes.

[0025] Widespread implementation of PRP increases the network carrying capacity by substantially reducing poll packets over the prior art and limiting them to the active clients of the contended node, the PRP master.

[0027] Since the PRP packet is broadcast, and thus available to a large number of interested and affected nodes, the number of Polls and the number of wasted packets in the media is minimized, leaving greater network capacity for message traffic. Since the radios responding to the single broadcast PRP packet, i.e., doing the polling, are often subscriber devices with a smaller radius of interference, their polls are less deleterious to the network, thus leaving greater network capacity for communicating.

[0029] Since a PRP master can easily listen for another PRP master, and the PRP system operates asynchronously, all nodes in the network, even portable nodes, can use PRP to control their own congestion. In particular, network software code is more manageable since all nodes can run the same algorithm and all nodes react similarly.

Problems solved by technology

The sharing of this medium results in mutual interference and loss of some packets due to collisions caused by congestion.

When a packet is lost, it must be retransmitted, which causes further congestion in the network and causes further packet loss.

The packet loss and retransmission consume the limited bandwidth that is used to provide the communication services the network was installed for.

Any transmissions or packets that are sent that do not deliver data to the users of the network decrease the efficiency of the network.

Particularly in a meshed radio network, the extra transmissions can cause further degradation of services because they can increase congestion for multiple nodes.

Unfortunately, in many topologies, because of unreliable communication channels, each node has only imperfect information about the state of the targeted node.

The limitations of this technique are manifold: the processing gain of the coding used limits the number of simultaneously transmitting mobile units.

This requires additional protocol overhead which reduces the efficiency of the network.

It is well known that CSMA / CD does not work efficiently as a congestion-limiting scheme for meshed radio networks because of the nature of radio where all nodes cannot ‘see’, or simultaneously communicate with, each other and thus are not able to reliably avoid burst transmissions which block each other.

This is a particularly severe problem when the applied load of traffic is large relative to congested node capacity.

They are; however, unable to handle multiple channels and thus take advantage of the inherent efficiencies available in a meshed network where multiple packets can be sent between different pairs of nodes simultaneously.

Protocols designed to handle multiple channels, such as those used for optical networks, have not been designed to efficiently handle unreliable channels, such as those typical in radio networks.

Other protocols (such as PRMA as described by D. J. Goodman, R. A. Valenzuela, K. T. Gayliard and B. Ramamurthy, “Packet Reservation Multiple Access for Local Wireless Communications,” IEEE Transactions on Communications, (August 1989) require even more complicated collision detection that is not cost effective or is not available with current radio technology.

This disclosure teaches a novel way of reducing contention in a frequency hopped packet radio network but under load (heavy contention) is an inefficient and unfair protocol.

This teaches an inefficient polling mechanism that does not take advantage of the broadcast nature of wireless and requires multiple handshakes between each data transfer.

This disclosure teaches a polling system that requires a Master / Slave relationship to be set up and is inefficient in requiring a poll for every data packet sent and a poll to determine if there is any data available to send.

Images