公开(公告)号：US07251251B2

公开(公告)日：2007-07-31

申请号：US10266302

申请日：2002-10-08

申请人： Theodorus Jacobs Johannes Denteneer ,  Ewa Barbara Hekstra-Nowacka ,  Serverius Petrus Paulus Pronk ,  Ludovicus Marinus Gerardus Maria Tolhuizen

发明人： Theodorus Jacobs Johannes Denteneer ,  Ewa Barbara Hekstra-Nowacka ,  Serverius Petrus Paulus Pronk ,  Ludovicus Marinus Gerardus Maria Tolhuizen

IPC分类号： H04J3/02 ,  H04L12/413

CPC分类号： H04L47/25 ,  H04N7/17309 ,  H04N21/2221 ,  H04N21/2385 ,  H04N21/2393 ,  H04N21/26216

摘要： A method and system of transmitting messages include requesting to submit a first request for transmitting a first message and to submit a second request for transmitting a second message until there is no first collision detected between the submitted first and second requests upon receipt of the submitted first and second requests. Before there is no first collision detected between the submitted first and second requests, it is requested to submit a third request for transmitting a third message and to submit a fourth request for transmitting a fourth message. However, requesting to re-submit the third request for transmitting the third message and to re-submit the fourth request for transmitting the fourth message if a second collision is detected between the submitted third and the second requests upon receipt thereof is delayed until there is no first collision detected between the submitted first and second requests.

摘要翻译： 发送消息的方法和系统包括请求提交发送第一消息的第一请求，并且提交发送第二消息的第二请求，直到在接收到所提交的第一消息之后在所提交的第一和第二请求之间没有检测到第一冲突 和第二个请求。 在所提交的第一和第二请求之前没有发现第一次冲突之前，请求提交发送第三消息的第三请求，并提交发送第四消息的第四请求。 然而，如果在接收到所提交的第三和第二请求之间检测到第二次冲突，则请求重新提交发送第三消息的第三请求并重新提交发送第四消息的第四请求，直到有 在提交的第一和第二个请求之间没有检测到第一次碰撞。

公开(公告)号：US07009993B2

公开(公告)日：2006-03-07

申请号：US10078954

申请日：2002-02-19

申请人： Serverius Petrus Paulus Pronk ,  Ludovicus Marinus Gerardus Maria Tolhuizen

发明人： Serverius Petrus Paulus Pronk ,  Ludovicus Marinus Gerardus Maria Tolhuizen

IPC分类号： H04L12/413

CPC分类号： H04L12/403 ,  H04L12/2801

摘要： A method for contention resolution in a transmission system (1) is described, the system (1) having a primary station (2) and a plurality of secondary stations (3) coupled to the primary station (2). Sign-On request messages are being sent by the primary station (2) marking starts of contention periods, numbered i=0, 1, 2 . . . , and having period length Pi; whereby a number Mi of the secondary stations (3) sends a Sign-On response message to the primary station (2) in contention period i, and, after sending, waits a feedback period of length Tfb for a response from the primary station (2). If Ni denotes the number of secondary stations (3) participating at the start of contention period i; an approximation for Mi save for a possible constant factor reads: Ni. Pi−1/(Pi−1+Tfb) for i=1, 2,  (1) such that the respective period lengths Pi are determined based on said approximation for Mi. An a posteriori estimate of Ni−1, save for a possible constant factor, is given by: S ln (S/Ti−1e) with S=(Tfb+Pi−1)*R where R is the number of contention slots per time unit, and Ti−1e denotes the number of empty slots in an inspection interval having length Pi+Tfb time units.