公开(公告)号：US08064377B2

公开(公告)日：2011-11-22

申请号：US12018956

申请日：2008-01-24

申请人： Yunjung Yi ,  John J. Shackleton

发明人： Yunjung Yi ,  John J. Shackleton

IPC分类号： H04H1/00 ,  H04L12/26 ,  H04B7/216

CPC分类号： H04L12/1877 ,  H04L12/189 ,  H04W40/24 ,  H04W84/18

摘要： A method for enhancing the reliability of a simplified multicasting forwarding protocol in a wireless network is provided. The method comprises establishing a list of multi-point relaying (MPR) nodes for each of a plurality of nodes. The list of MPR nodes includes neighbor nodes that cover each of the plurality of nodes within two hops. A first set of nodes is identified that is not already in the list of MPR nodes. In a first approach, the first set of nodes includes nodes that are the only neighbor node to a node in the list of MPR nodes. In a second alternative approach, the first set of nodes includes nodes that are sequentially previous to a node in the list of MPR nodes. Once the first set of nodes is identified, the first set of nodes is added to the list of MPR nodes. If the first approach is used, the method further comprises identifying a second set of nodes that is not already in the list of MPR nodes. The second set of nodes comprises nodes that have the largest number of neighboring MPR nodes. The second set of nodes is then added to the list of MPR nodes.

摘要翻译： 提供了一种用于增强无线网络中的简化多播转发协议的可靠性的方法。 该方法包括为多个节点中的每一个建立多点中继（MPR）节点的列表。 MPR节点的列表包括覆盖两跳内的多个节点中的每一个节点的邻居节点。 识别出尚未在MPR节点列表中的第一组节点。 在第一种方法中，第一组节点包括作为MPR节点列表中节点的唯一邻居节点的节点。 在第二替代方法中，第一组节点包括在MPR节点列表中的节点之前的顺序的节点。 一旦识别出第一组节点，则将第一组节点添加到MPR节点列表。 如果使用第一种方法，则该方法还包括识别尚未在MPR节点列表中的第二组节点。 第二组节点包括具有最大数量的相邻MPR节点的节点。 然后将第二组节点添加到MPR节点列表。

公开(公告)号：US20110060828A1

公开(公告)日：2011-03-10

申请号：US12944863

申请日：2010-11-12

申请人： John J. Shackleton ,  Yunjung Yi

发明人： John J. Shackleton ,  Yunjung Yi

IPC分类号： G06F15/16 ,  G06F15/173

CPC分类号： G08G1/161 ,  G08G1/22

摘要： A method of determining the sequence of traversing nodes in a communication network is provided. The method comprises with each node, determining other nodes in the network it can reach in a single hop. Creating a local sequence connection order based on the determined other nodes the node can reach in a single communication hop. Storing historical data of local sequence connection order information and determining a new local sequence connection order based in part on the historical data and communication information.

摘要翻译： 提供一种确定通信网络中遍历节点序列的方法。 该方法包括与每个节点，确定网络中可以在单跳中达到的其他节点。 基于确定的节点可以在单个通信跳跃中达到的本地序列连接顺序。 存储本地序列连接顺序信息的历史数据，并且部分地基于历史数据和通信信息确定新的本地序列连接顺序。

公开(公告)号：US07864775B2

公开(公告)日：2011-01-04

申请号：US11961508

申请日：2007-12-20

申请人： John J. Shackleton ,  Yunjung Yi

发明人： John J. Shackleton ,  Yunjung Yi

IPC分类号： H04L12/28

CPC分类号： G08G1/161 ,  G08G1/22

摘要： A method of determining the sequence of traversing nodes in a communication network is provided. The method comprises with each node, determining other nodes in the network it can reach in a single hop. Creating a local sequence connection order based on the determined other nodes the node can reach in a single communication hop. Storing historical data of local sequence connection order information and determining a new local sequence connection order based in part on the historical data and communication information.

公开(公告)号：US20090160679A1

公开(公告)日：2009-06-25

申请号：US11961508

申请日：2007-12-20

申请人： John J. Shackleton ,  Yunjung Yi

发明人： John J. Shackleton ,  Yunjung Yi

IPC分类号： G08G1/123 ,  H04B7/26

CPC分类号： G08G1/161 ,  G08G1/22

摘要： A method of determining the sequence of traversing nodes in a communication network is provided. The method comprises with each node, determining other nodes in the network it can reach in a single hop. Creating a local sequence connection order based on the determined other nodes the node can reach in a single communication hop. Storing historical data of local sequence connection order information and determining a new local sequence connection order based in part on the historical data and communication information.

摘要翻译： 提供一种确定通信网络中遍历节点序列的方法。 该方法包括与每个节点，确定网络中可以在单跳中达到的其他节点。 基于确定的节点可以在单个通信跳跃中达到的本地序列连接顺序。 存储本地序列连接顺序信息的历史数据，并且部分地基于历史数据和通信信息确定新的本地序列连接顺序。

公开(公告)号：US08081573B2

公开(公告)日：2011-12-20

申请号：US12944863

申请日：2010-11-12

申请人： John J. Shackleton ,  Yunjung Yi

发明人： John J. Shackleton ,  Yunjung Yi

IPC分类号： G01R31/08

CPC分类号： G08G1/161 ,  G08G1/22

摘要： A method of determining the sequence of traversing nodes in a communication network is provided. The method comprises with each node, determining other nodes in the network it can reach in a single hop. Creating a local sequence connection order based on the determined other nodes the node can reach in a single communication hop. Storing historical data of local sequence connection order information and determining a new local sequence connection order based in part on the historical data and communication information.

摘要翻译： 提供一种确定通信网络中遍历节点序列的方法。 该方法包括与每个节点，确定网络中可以在单跳中达到的其他节点。 基于确定的节点可以在单个通信跳跃中达到的本地序列连接顺序。 存储本地序列连接顺序信息的历史数据，并且部分地基于历史数据和通信信息确定新的本地序列连接顺序。

公开(公告)号：US20090190514A1

公开(公告)日：2009-07-30

申请号：US12018956

申请日：2008-01-24

申请人： Yunjung Yi ,  John J. Shackleton

发明人： Yunjung Yi ,  John J. Shackleton

IPC分类号： H04H20/71

CPC分类号： H04L12/1877 ,  H04L12/189 ,  H04W40/24 ,  H04W84/18

摘要： A method for enhancing the reliability of a simplified multicasting forwarding protocol in a wireless network is provided. The method comprises establishing a list of multi-point relaying (MPR) nodes for each of a plurality of nodes. The list of MPR nodes includes neighbor nodes that cover each of the plurality of nodes within two hops. A first set of nodes is identified that is not already in the list of MPR nodes. In a first approach, the first set of nodes includes nodes that are the only neighbor node to a node in the list of MPR nodes. In a second alternative approach, the first set of nodes includes nodes that are sequentially previous to a node in the list of MPR nodes. Once the first set of nodes is identified, the first set of nodes is added to the list of MPR nodes. If the first approach is used, the method further comprises identifying a second set of nodes that is not already in the list of MPR nodes. The second set of nodes comprises nodes that have the largest number of neighboring MPR nodes. The second set of nodes is then added to the list of MPR nodes.

摘要翻译： 提供了一种用于增强无线网络中的简化多播转发协议的可靠性的方法。 该方法包括为多个节点中的每一个建立多点中继（MPR）节点的列表。 MPR节点的列表包括覆盖两跳内的多个节点中的每一个节点的邻居节点。 识别出尚未在MPR节点列表中的第一组节点。 在第一种方法中，第一组节点包括作为MPR节点列表中节点的唯一邻居节点的节点。 在第二替代方法中，第一组节点包括在MPR节点列表中的节点之前的顺序的节点。 一旦识别出第一组节点，则将第一组节点添加到MPR节点列表。 如果使用第一种方法，则该方法还包括识别尚未在MPR节点列表中的第二组节点。 第二组节点包括具有最大数量的相邻MPR节点的节点。 然后将第二组节点添加到MPR节点列表。