首页> 外国专利> System and methods for distributed packet programming, and methods for compressing a plurality of neighbor entries from a neighborhood list contained in a network configuration package, for transmitting a network configuration package associated with a node in a ad hoc network, and for broadcast programming on an ad hoc network

System and methods for distributed packet programming, and methods for compressing a plurality of neighbor entries from a neighborhood list contained in a network configuration package, for transmitting a network configuration package associated with a node in a ad hoc network, and for broadcast programming on an ad hoc network

机译:用于分布式分组编程的系统和方法,以及用于压缩包含在网络配置包中的邻居列表中的多个邻居条目,用于发送与自组织网络中的节点相关联的网络配置包以及用于在网络上进行广播编程的方法。临时网络

摘要

"SYSTEM AND METHODS FOR PROGRAMMING DISTRIBUTED PACKAGE AND METHODS FOR COMPRESSING A PLURALITY OF NEIGHBOR INPUTS ON A NETWORK LIST IN A NETWORK CONFIGURATION PACKAGE FOR A PACKAGE OF A PACKAGE OF A PACKAGE OF A PACKAGE. AD HOC NETWORK, AND FOR TRANSMISSION PROGRAMMING IN AN AD HOC NETWORK ". The present invention provides a medium access control (MAC) protocol for packet collision-free transmission on a channel such that nodes are assigned collision-free transmission time slots based on the knowledge they acquire regarding clientele. of your local neighborhoods, and time-lapse announcements when nodes in local neighborhoods will try to broadcast again. The programming procedure can use a network age along with unique node identifiers. Candidate transmission times for each node are determined using a list of subsequent transmission times announced by other nodes. Nodes discard announced transmission times from the list of potential transmission times, and compute their candidate transmission times using a function that provides a varied (pseudo-random) distribution of outputs for a varied sample of inputs. This function can be a reprint function, an encryption function, or a lookup table function. Candidate transmission time computation uses the identifiers of those nodes for which no announced transmission time has been obtained.
机译:“用于对分布式程序包进行编程的系统和方法,以及用于在网络配置程序包中压缩网络列表中的多个相邻输入的方法,用于对一个程序包,一个自组织网络和一个传输程序进行打包HOC网络”。本发明提供了一种用于在信道上进行无分组冲突传输的介质访问控制(MAC)协议,从而基于节点获取的有关客户的知识为节点分配无冲突传输时隙。本地邻居,以及本地邻居节点将尝试再次广播时的延时通知。编程过程可以使用网络年龄以及唯一的节点标识符。使用其他节点宣布的后续传输时间列表来确定每个节点的候选传输时间。节点从潜在传输时间列表中丢弃已宣布的传输时间,并使用为输入的各种样本提供输出的变化(伪随机)分布的函数来计算其候选传输时间。该功能可以是重印功能,加密功能或查找表功能。候选传输时间计算使用那些尚未获得宣布传输时间的节点的标识符。

著录项

  • 公开/公告号BR0212132A

    专利类型

  • 公开/公告日2004-08-24

    原文格式PDF

  • 申请/专利权人 NOKIA CORPORATION;

    申请/专利号BR0212132A

  • 发明设计人 DAVE BEYER;JOSE J. GARCIA-LUNA-ACEVES;

    申请日2002-08-26

  • 分类号H04Q7/20;

  • 国家 BR

  • 入库时间 2022-08-21 23:12:02

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号