英语翻译RoutingA possible routing algorithm for a cluster-tree network is shown in Figure 6-10.In this algorithm,a device first checks to see if the cluster identifier of the destination is in its routing table .If not,the destination is an unkno

英语翻译RoutingA possible routing algorithm for a cluster-tree network is shown in Figure 6-10.In this algorithm,a device first checks to see if the cluster identifier of the destination is in its routing table .If not,the destination is an unkno
英语翻译
Routing
A possible routing algorithm for a cluster-tree network is shown in Figure 6-10.In this algorithm,a device first checks to see if the cluster identifier of the destination is in its routing table .If not,the destination is an unknown cluster and the device routers the message to its parent.
However,if there is a cluster identifier match in the routing table,the device then checks those table entries with a cluster identifier match for a network identifier match.If one is found,the message is routed according to the table entry.If one is not found,the destination is an unknown network device in a known cluster,and the device must choose which network device to use to relay the message to the cluster by some set of arbitration rules.
If the cluster identifier of the destination is the same as that of that of the network device attempting to route the message,as in the cluster network,the message should be routed to the parent of the network device.However,the arbitration rules governing the relay of messages to other clusters can be significantly more flexible,and may consider,for example,the time a routing table entry was made – routing the message via the network device most recently added to the table,in the belief that the rout is the most up-to-date and most accurately reflects the present state of the network.Other considerations are possible,many of which are optimal for particular applications.
THE NETWORK TOPOLOGY DECISION
Because IEEE Std 802.15.4.is capable of supporting a large number of ad hoc network topologies,an application designer employing IEEE Std 802.15.4 must select an appropriate network topology for the intended application.Further,if the selected network topology is a peer-to-peer topology in which multihop communication is planned,the routing algorithm must also be selected.
As an aid to this decision-making process,Table 6-1 summarizes the major network types discussed in this chapter,including their strengths,weakness,and potential applications.Note that Table 6-1 is only a guide,intending to establish general trends; almost any of these networks may be used successfully in almost any application,albeit with variations in network performance parameters such as message throughput and latency,and network device performance parameters such as power consumption.

英语翻译RoutingA possible routing algorithm for a cluster-tree network is shown in Figure 6-10.In this algorithm,a device first checks to see if the cluster identifier of the destination is in its routing table .If not,the destination is an unkno
发送群树网络的A可能的发送算法在表6-10显示.在这种算法,设备首先检查看目的地的群标识符是否在它的路线表里.否则,目的地是未知的群和设备路由器消息给它的父母.
However,如果有群标识符比赛在路线表里,设备然后检查那些表项目与群标识符比赛网络标识符比赛.如果找到一个人,消息根据表项目寻址.如果没找到一个人,目的地是在已知的群的一个未知的网络设备,并且使用的网络设备传递消息到群由某一套仲裁统治的设备必须选择.
If目的地的群标识符是试图那网络的设备寻址消息,在群网络,应该寻址对网络设备的父母消息的相同的象.然而,治理消息的中转仲裁规则对其他群是更加灵活的,并且也许考虑,例如,发送表项目被做寻址消息的–通过网络设备最近增加到桌的时间,在信仰溃败最新和最准确地反射网络的现状.其他考虑是可能的,许多为特殊应用是优选的.
THE网络拓扑结构决定
Because IEEE Std 802.15.4.is能够支持很大数量的特别网络拓扑结构,使用IEEE Std 802.15.4的应用设计师必须为意欲的应用选择一个适当的网络拓扑结构.进一步,如果选择的网络拓扑结构是多次反射的通信计划的对等拓扑结构,必须也选择发送算法.
As对这决策过程的援助,表6-1总结在本章谈论的主要网络类型,包括他们的力量、弱点和潜在的应用.注意表6-1是仅指南,意欲建立一般趋向; 这些网络几乎中的任一个在几乎所有应用也许顺利地使用,虽然与在网络性能参量上的变化例如消息生产量和潜伏和网络设备性能参数例如电力消费.