公开(公告)号：WO2003003633A1

公开(公告)日：2003-01-09

申请号：PCT/US2002/020521

申请日：2002-06-25

Applicant: RICOCHET NETWORKS, INC.

Inventor： FLAMMER, George, H. ,  PAULSEN, David, L. ,  RITTER, Michael, W.

IPC: H04J3/16

CPC classification number: H04W74/06 ,  H04W28/08 ,  H04W72/12

Abstract: In a mesh communication network, a poll request protocol (PRP) is provided in which a special packet is broadcast by the congested node (12) when it is ready to provide services. The controlling node (14) (usually the more congested node) broadcasts a packet to request poll signals from nodes desiring resources of the controlling node(14). The contending nodes (12) then have equal chances to request the services of the controlling node (14) by sending poll signals. The controlling node (14) 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 (12) then send their packets to the controlling node (14) without loss packets caused by congestion collisions. The controlling node (14) can then send data to the contending nodes (12) also without lost packets.

Abstract translation: 在网状通信网络中，提供了一种轮询请求协议（PRP），其中当拥塞节点（12）准备好提供服务时，特殊分组被广播。 控制节点（14）（通常是更拥塞的节点）广播分组以从期望控制节点（14）的资源的节点请求轮询信号。 然后，竞争节点（12）通过发送轮询信号具有相等的机会来请求控制节点（14）的服务。 控制节点（14）然后可以对请求进行仲裁，确定其资源的最公平有效的使用，并且广播调度分组以通知竞争节点（12）然后将其分组发送到控制节点（14）而不丢失分组 由拥塞冲突造成的。 然后，控制节点（14）也可以在没有丢失分组的情况下向竞争节点（12）发送数据。