公开(公告)号：US08411585B2

公开(公告)日：2013-04-02

申请号：US12498878

申请日：2009-07-07

Applicant: Yongqiang Liu ,  Yanlin Luo ,  Songjie Chen ,  Gang Wang

Inventor： Yongqiang Liu ,  Yanlin Luo ,  Songjie Chen ,  Gang Wang

IPC: G01R31/08 ,  G06F11/00 ,  G08C15/00 ,  H04J1/16 ,  H04J3/14 ,  H04L1/00 ,  H04L12/26 ,  H04W4/00 ,  H04W72/00 ,  H04B7/00 ,  H04B1/00 ,  H04B15/00 ,  H04B17/00

CPC classification number: H04W72/082

Abstract: There are disclosed a network interference evaluating method, a dynamic channel assignment method and apparatus used in wireless networks. The dynamic channel assignment method used in a wireless network, comprising steps of: calculating each pair of visual delayed time for each pair of basic service sets based on received signal strength indicators, traffic information and rate information, and evaluating an overall network interference under a current channel allocation based on the calculated visual delayed time; constructing an undirected graph so that each basic service set is located at a vertex, and each connection line between each pair of basic service sets has a weight obtained from the pair of visual delayed time for this pair of basic service sets; coloring the undirected graph to get a new channel allocation approach and an optimized minimal overall network interference under this new channel allocation approach; comparing a difference between the evaluated overall network interference under the current channel allocation and the optimized minimal overall network interference with a predetermined threshold; and changing channel allocation for the basic service sets according to the new channel allocation approach if the difference is larger than the predetermined threshold.

Abstract translation: 公开了一种在无线网络中使用的网络干扰评估方法，动态信道分配方法和装置。 一种在无线网络中使用的动态信道分配方法，包括以下步骤：基于接收到的信号强度指示符，业务信息和速率信息，计算每对基本业务集合的每对视觉延迟时间，以及评估一个 基于计算出的视觉延迟时间的当前频道分配; 构造无向图，使得每个基本服务集位于顶点，并且每对基本服务集之间的每个连接线具有从该对基本服务集合的一对视觉延迟时间获得的权重; 着色无向图，以获得新的信道分配方法，并在此新的信道分配方法下优化最小的总体网络干扰; 将当前信道分配下的所评估的总网络干扰与所述优化的最小总网络干扰之间的差与预定阈值进行比较; 以及如果差值大于预定阈值，则根据新的信道分配方法改变基本业务集的信道分配。

公开(公告)号：US20110307564A1

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

申请号：US13124770

申请日：2010-03-19

Applicant: Yanlin Luo ,  Yongqiang Liu ,  Songjie Chen ,  Quan Huang

Inventor： Yanlin Luo ,  Yongqiang Liu ,  Songjie Chen ,  Quan Huang

IPC: G06F15/16

CPC classification number: H04L67/1063 ,  H04L67/1072 ,  H04L67/18 ,  H04W4/023 ,  H04W4/50

Abstract: A data node apparatus, a peer information acquisition method and a system are provided. An apparatus that serves as a data node in peer-to-peer (P2P) data exchange, comprising: a data node application unit that issues a peer list request and carries out data exchange with peers; and a list processing unit that intercepts an original peer list provided by an indexing server in response to the peer list request, issues a peer location request to an information server and receives peer location information provided by the information server in response to the peer location request, performs a processing on the original peer list based on the peer location information to derive a processed peer list, and provides the processed peer list to the data node application unit.

Abstract translation: 提供数据节点装置，对等体信息获取方法和系统。 一种用作对等（P2P）数据交换中的数据节点的装置，包括：发送对等体列表请求并与对等体进行数据交换的数据节点应用单元; 以及列表处理单元，其响应于对等体列表请求拦截由索引服务器提供的原始对等体列表，向对方信息服务器发出对等位置请求，并且响应于对等位置请求接收由信息服务器提供的对等位置信息 基于对等位置信息对原始对等体列表执行处理以导出处理的对等体列表，并将处理的对等体列表提供给数据节点应用单元。

公开(公告)号：US20100008316A1

公开(公告)日：2010-01-14

申请号：US12498878

申请日：2009-07-07

Applicant: Yongqiang LIU ,  Yanlin Luo ,  Songjie Chen ,  Gang Wang

Inventor： Yongqiang LIU ,  Yanlin Luo ,  Songjie Chen ,  Gang Wang

IPC: H04W72/00 ,  H04J1/16

CPC classification number: H04W72/082

Abstract: There are disclosed a network interference evaluating method, a dynamic channel assignment method and apparatus used in wireless networks. The dynamic channel assignment method used in a wireless network, comprising steps of: calculating each pair of visual delayed time for each pair of basic service sets based on received signal strength indicators, traffic information and rate information, and evaluating an overall network interference under a current channel allocation based on the calculated visual delayed time; constructing an undirected graph so that each basic service set is located at a vertex, and each connection line between each pair of basic service sets has a weight obtained from the pair of visual delayed time for this pair of basic service sets; coloring the undirected graph to get a new channel allocation approach and an optimized minimal overall network interference under this new channel allocation approach; comparing a difference between the evaluated overall network interference under the current channel allocation and the optimized minimal overall network interference with a predetermined threshold; and changing channel allocation for the basic service sets according to the new channel allocation approach if the difference is larger than the predetermined threshold.

Abstract translation: 公开了一种在无线网络中使用的网络干扰评估方法，动态信道分配方法和装置。 一种在无线网络中使用的动态信道分配方法，包括以下步骤：基于接收到的信号强度指示符，业务信息和速率信息，计算每对基本业务集合的每对视觉延迟时间，以及评估一个 基于计算出的视觉延迟时间的当前频道分配; 构造无向图，使得每个基本服务集位于顶点，并且每对基本服务集之间的每个连接线具有从该对基本服务集合的一对视觉延迟时间获得的权重; 着色无向图，以获得新的信道分配方法，并在此新的信道分配方法下优化最小的总体网络干扰; 将当前信道分配下的所评估的总网络干扰与所述优化的最小总网络干扰之间的差与预定阈值进行比较; 以及如果差值大于预定阈值，则根据新的信道分配方法改变基本业务集的信道分配。

公开(公告)号：US20110099226A1

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

申请号：US13001574

申请日：2010-03-17

Applicant: Yongqiang Liu ,  Yong Xia ,  Yan Hu ,  Yanlin Luo

Inventor： Yongqiang Liu ,  Yong Xia ,  Yan Hu ,  Yanlin Luo

IPC: G06F15/173

CPC classification number: H04L67/104 ,  H04L67/1063 ,  H04L67/1065 ,  H04L67/2814

Abstract: Disclosed is a method for requesting for location information of resources on a P2P network, user node and server for the same, which allow a user to get network resources quickly. The popular files and the unpopular files are managed separately. The metadata of popular files are stored a plurality of SN based on respective areas, while the metadata of the unpopular files are stored and queried in a centralized manner. A function of redirecting a request message is added into the SN so as to inform the user the existence of a SN-R. Meanwhile, in order to improve query efficiency and avoid repeatedly redirecting of the message, a server routing table is provided for the user node which can indicate which files need to be download and which server should be requested to provide the files. Due to the popular filed and the unpopular filed are stored separately and all of unpopular files are stored in a centralized manner, the user can get unpopular files when the user request for the unpopular files in a P2P network.

Abstract translation: 公开了一种在P2P网络，用户节点和服务器上请求资源的位置信息的方法，其允许用户快速获得网络资源。 流行的文件和不受欢迎的文件是单独管理的。 流行文件的元数据基于相应的区域存储多个SN，而不受欢迎的文件的元数据以集中的方式被存储和查询。 将请求消息重定向的功能添加到SN中，以便向用户通知SN-R的存在。 同时，为了提高查询效率并避免重复定向消息，为用户节点提供了一个服务器路由表，可以指示需要下载哪些文件以及哪个服务器需要提供文件。 由于流行的文件和不受欢迎的文件被单独存储，并且所有不受欢迎的文件以集中的方式存储，所以当用户在P2P网络中请求不受欢迎的文件时，用户可以获得不受欢迎的文件。