Intelligent communication node object beacon framework (icbf) with temporal transition network protocol (ttnp) in a mobile ad hoc network

<u>Background of the Invention</u>

0001Wireless networks have experienced increased development in the past decade. One of the most rapidly developing areas is mobile ad hoc networks. Physically, a mobile ad hoc network includes a number of geographically-distributed, potentially mobile nodes wirelessly connected by one or more radio frequency channels. Compared with other type of networks, such as cellular networks or satellite networks, the most distinctive feature of mobile ad hoc networks is the lack of any fixed infrastructure. The network is formed of mobile nodes only, and a network is created on the fly as the nodes transmit to or receive from other nodes. The network does not in general depend on a particular node and dynamically adjusts as some nodes join or others leave the network.

0002In a hostile environment where a fixed communication infrastructure is unreliable or unavailable, such as in a battle field or in a natural disaster area struck by earthquake or hurricane, an ad hoc network can be quickly deployed and provide much needed communications. While the military is still a major driving force behind the development of these networks, ad hoc networks are quickly finding new applications in civilian or commercial areas. Ad hoc networks will allow people to exchange data in the field or in a class room without using any network structure except the one they create by simply turning on their computers or PDAs.

0003As wireless communication increasingly permeates everyday life, new applications for mobile ad hoc networks will continue to emerge and become an important part of the communication structure. Mobile ad hoc networks pose serious challenges to the designers. Due to the lack of a fixed infrastructure, nodes must self-organize and reconfigure as they move, join or leave the network. All nodes could potentially be functionally identical and there may not be any natural hierarchy or central controller in the network. Many network-controlling functions are distributed among the nodes. Nodes are often powered by batteries and have limited communication and computation capabilities. The bandwidth of the system is usually limited. The distance between two nodes often exceeds the radio transmission range, and a transmission has to be relayed by other nodes before reaching its destination. Consequently, a network has a multihop topology, and this topology changes as the nodes move around.

0004The Mobile Ad-Hoc Networks (MANET) working group of the Internet Engineering Task Force (IETF) has been actively evaluating and standardizing routing, including multicasting, protocols. Because the network topology changes arbitrarily as the nodes move, information is subject to becoming obsolete, and different nodes often have different views of the network, both in time (information may be outdated at some nodes but current at others) and in space (a node may only know the network topology in its neighborhood usually not far away from itself).

0005A routing protocol needs to adapt to frequent topology changes and with less accurate information. Because of these unique requirements, routing in these networks is very different from others. Gathering fresh information about the entire network is often costly and impractical. Many routing protocols are reactive (on-demand) protocols: they collect routing information only when necessary and to destinations they need routes to, and do not generally maintain unused routes after some period of time. This way the routing overhead is greatly reduced compared to pro-active protocols which maintain routes to all destinations at all times. It is important for a protocol to be adaptive. Ad Hoc on Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) are representative of on-demand routing protocols presented at the MANET working group.

0006Examples of other various routing protocols include Destination-Sequenced Distance Vector (DSDV) routing which is disclosed in <patcit id="pcit0001" dnum="US5412654A"><text>U.S. Patent No. 5,412,654 to Perkins</text></patcit>, and Zone Routing Protocol (ZRP) which is disclosed in <patcit id="pcit0002" dnum="US6304556B"><text>U.S. Patent No. 6,304,556 to Haas</text></patcit>. ZRP is a hybrid protocol using both proactive and reactive approaches based upon distance from a source node.

0007These conventional routing protocols use a best effort approach in selecting a route from the source node to the destination node. Typically, the number of hops is the main criteria (metric) in such a best effort approach. In other words, the route with the least amount of hops is selected as the transmission route.

0008Existing communication node advertisement and communication node neighbor discovery approaches including those for ad hoc networks, only use network-condition-independent mechanisms such as constant transmit rate or random transmit rate "hello" messages from nodes to announce, or advertise, their presence. These transmitted announcements are called "beacons" and under conventional approaches, these beacons are not endowed with any degree of intelligence. Other nodes may detect these beacons and either form a network from scratch or add the newly-detected node to the existing network.

0009Document XP001071991 discloses a preemptive route maintenance and selection to ad hoc routing protocols by finding alternative paths when a link is in danger of breaking (but before the disconnection occurs). More specifically, when two nodes, A and B, are moving out of each other's range, source nodes of active paths that use the hop A to B are warned that a path break is likely to initiate route discovery early and switch to a more stable path potentially avoiding the path break. When a path break is not avoided, the path discovery latency is reduced. The signal strength is used as the preemptive trigger; other warning criteria such as location/velocity and congestion can also be used.

0010Document <patcit id="pcit0003" dnum="WO0173959A1"><text>WO 01/73959 A1</text></patcit> discloses a system, apparatus, and method for conserving energy in a mobile station of an ad-hoc wireless data network. Information concerning motion of the mobile station is obtained, and a rate of motion is used to adjust network parameters such as a beaconing rate and a link change granularity. These parameters may be adjusted to reduce network overhead transmissions, and the power usage associated therewith, at appropriate times. In one embodiment, network-related transmissions, such as beacon signals and link state announcements, are reduced when the mobile station is moving quickly.

0011Document XP010562109 discloses a hybrid routing scheme that combines proactive route optimization to a reactive routing protocol, for reducing the average end-to-end delay in packet transmissions without exceeding the routing overhead. The disclosed scheme uses a pre-emptive route discovery to replace an existing route by a shorter route when the route has been used for a given interval of time. The optimum time for making the pre-emptive search is obtained by studying the statistical distributions of the link and route lifetimes. The preemptive search is restricted within a limited distance from the old route by using a query-localization method.

0012Document XP010538869 discloses a routing algorithm called Adaptive Distance Vector (ADV) for mobile, ad hoc networks (MANETs). ADV is a distance vector routing algorithm that exhibits some on-demand characteristics by varying the frequency and the size of the routing updates in response to the network load and mobility conditions. Document <patcit id="pcit0004" dnum="US6304556B1"><text>US6304556 B1</text></patcit> discloses two network communication protocols, one for routing and one for mobility management suited for use with ad-hoc networks. The routing protocol is a proactive-reactive hybrid routing protocol that limits the scope of the proactive procedure to the node's local neighborhood. The reactive procedure is limited during route discovery to queries of only those nodes located on the periphery of routing zones. The mobility management protocol relies on some network nodes assuming the mobility management function. Each network node is "associated" with one or more mobility management nodes. The mobility management nodes form a virtual network which is embedded within the actual ad-hoc network. Each mobility management node knows the location of all nodes within its zone, and communicates this information to any other mobility management node that requests it.

0013Document <patcit id="pcit0005" dnum="WO0192992A2"><text>WO 01/92992 A2</text></patcit> discloses an apparatus for varying the rate at which the broadcast beacons are transmitted including at least one router. The router transmits beacons which contain various types of data, controls the rate at which the beacons are transmitted, and adaptively varies the rate at which the beacons are transmitted, in response to a variety of network conditions.

0014Document XP010511730 discloses a distributed dynamic routing (DDR) algorithm constructing a forest from a network topology, where each tree of the constructed forest forms a zone. The network is partitioned into a set of non-overlapping dynamic zones. Each zone contains mobile nodes. Then, each node calculates its zone ID independently. Each zone is connected

<u>Summary of the Invention</u>

0015In view of the foregoing background, it is therefore an object of the present invention to provide the "Intelligent Communication Node Object Beacon Framework" (ICBF), for intelligent, adaptive advertisement by any communications node

0016via the nodes that are not in the same tree but they are in the direct transmission range of each other. So, the whole network can be seen as a set of connected zones. The size of zones increases and decreases dynamically depending on some network features such as node density, rate of network connection/disconnection, node mobility and transmission power. object of its presence along with the management and control of route discovery and associated processes via temporal transitioning processes and events in a mobile ad hoc network.

0017This and other objects, features, and advantages in accordance with the present invention are provided by a method for managing and controlling the discovery and maintenance of routes in a mobile ad hoc network, the method comprising the features of claim 1. A route is a set of wireless communication links and mobile nodes from a source to a destination.

0018The method preferably includes switching back to the first one of the proactive and reactive route discovery processes when predicted route stability reaches a second transition parameter, and the first and second transition parameters preferably specify time-dependent conditions. Varying the beacon signal may comprise varying at least one of transmission rate, transmission frequency and transmission pattern. Also, the transmission rate of the beacon signal should not exceed a rate threshold based upon available bandwidth.

0019The node/group condition may include node/group movement, and varying the beacon signal may comprise increasing the transmission rate based upon increased node/group movement and decreasing the transmission rate based upon decreased node/group movement. Node/group movement comprises at least one of node/group velocity, node/group acceleration and node/group movement pattern of the corresponding mobile node or group of mobile nodes. Node/group condition information is based upon node mobility, link failure, link creation, node/group stability and link quality, and storing node/group condition information may comprise creating and updating a time-dependent route stability profile. Furthermore, storing node/group condition information may also include creating and updating a time-dependent route segment stability profile. A segment is a set of links and nodes which define a reusable entity in one or more routes.

0020A mobile ad hoc network according to the present invention includes a plurality of mobile nodes, and a plurality of wireless communication links connecting the mobile nodes together. Each mobile node include a communications device to wirelessly communicate with other nodes of the plurality of nodes via the wireless communication links, and a controller to route communications via the communications device. The controller has a condition determining unit to determine a condition of the mobile node or group of nodes, and a beacon signal generator to generate and transmit beacon signals. The beacon signal generator varies the beacon signals based upon the determined condition of the mobile node/group.

0021Route tables define routes in the network. A route is a set of wireless communication links and mobile nodes from a source to a destination. The controller also includes a route discovery module to discover routes and update the route tables with one of a plurality of route discovery processes, a condition module to receive beacon signals and store node/group condition information, a route stability predictor to predict route stability over time based upon the node/group condition information, and a route discovery process selector to select between the plurality of route discovery processes based upon the predicted route stability.

<u>Brief Description of the Drawing</u>

0022<ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">FIG. 1</figref> is a schematic diagram of a mobile ad hoc network in accordance with the present invention.</li><li><figref idref="f0002">FIG. 2</figref> is a flowchart illustrating the steps of a method for managing and controlling the discovery and maintenance of routes in accordance with the present invention.</li><li><figref idref="f0003">FIG. 3</figref> is a schematic diagram illustrating a router of a node in accordance with the network of the present invention.</li><li><figref idref="f0003">FIG. 4</figref> is a schematic diagram illustrating the details of the controller of the router in <figref idref="f0003">FIG. 3</figref>.</li></ul>

<u>Detailed Description of the Preferred Embodiment</u>

0023The present invention will now be described more fully hereinafter with reference to the accompanying drawings, in which preferred embodiments of the invention are shown. Like numbers refer to like elements throughout, and prime notation is used to indicate similar elements in alternative embodiments.

0024As will be appreciated by those skilled in the art, portions of the present invention may be embodied as a method, data processing system, or computer program product. Accordingly, these portions of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, portions of the present invention may be a computer program product on a computer-usable storage medium having computer readable program code on the medium. Any suitable computer readable medium may be utilized including, but not limited to, static and dynamic storage devices, hard disks, optical storage devices, and magnetic storage devices.

0025The present invention is described below with reference to flowchart illustrations of methods, systems, and computer program products according to an embodiment of the invention. It will be understood that blocks of the illustrations, and combinations of blocks in the illustrations, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, implement the functions specified in the block or blocks.

0026These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture including instructions which implement the function specified in the flowchart block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer or other programmable apparatus implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.

0027Existing node presence advertisement methods (neighbor discovery beacons) supplied by proactive and reactive methods as well as standalone neighbor discovery beacons, do not transmit node movement properties, do not intelligently and in real-time adapt their transmission rates according to how the nodes in the network are moving, and do not advertise the movement and presence of groups of nodes, which could reduce the overhead traffic of such advertisements.

0028The present invention makes use of the temporal transition network protocol (TTNP) in a mobile ad hoc network to efficiently make use of the management and control of route discovery and associated processes via temporal transitioning processes and events in a mobile ad hoc network, as described in <patcit id="pcit0006" dnum="US20030202512A1"><text>US 2003-0202512 A1 filed April 29, 2002</text></patcit> by the same assignee . Furthermore, the present invention makes use of "Intelligent Communication Node Object Beacon Framework" (ICBF), for intelligent, adaptive advertisement by any communications node object of its presence and/or the corresponding detection (neighbor discovery) by another node object or the network of those node objects transmitting such beacons as described in <patcit id="pcit0007" dnum="US2004042417A1"><text>US 2004-042417 A1 filed September 4, 2002</text></patcit> by the same assignee .

0029Referring initially to <figref idref="f0001">FIGs. 1</figref> and <figref idref="f0002">2</figref>, a method for discovering routes from a source node to a destination node in a mobile ad hoc network 10 will now be described. The network 10 includes a plurality of mobile nodes 12 including the source node S and the destination node D with intermediate nodes therebetween. The nodes 12, such as laptop computers, personal digital assistants (PDAs) or mobile phones, are connected by wireless communication links 14 as would be appreciated by the skilled artisan. The Temporal Transition Network Protocol (TTNP) temporally combines, controls and manages both proactive and reactive approaches (and/or other route discovery approaches) in any network architecture whether it is flat or structured such as in a hierarchical network.

0030TTNP provides the protocol suite and transition parameters for supporting the switching back and forth between a plurality of route discovery approaches, e.g., any proactive and reactive network route discovery approaches, during the time-ordered evolution of the network <b>10.</b> The protocol suite supports not only the transition parameters (quantities that signal TTNP to start the transition from a proactive to a reactive approach and vice versa) defined herein, but can also support other transition parameters defined by a system designer. TTNP will carry the negotiations between various subsets of nodes <b>12</b> and links <b>14</b> in the network <b>10</b> and interact with Quality of Service (QoS) and traffic management (which includes Admission Control, scheduling, buffer management and flow control), power management &amp; control, security and any other network service components either internal or external to TTNP to gather the information needed to provide this support.

0031The Intelligent Communication Node Object Beacon Framework" (ICBF) defines temporary or permanent associations of nodes, potentially capable of communication with other temporary or permanent associations of nodes, as "Node Communication Object Association" (NCOA) and the corresponding beacons for this association as "NCOA beacons". In the network <b>10</b> shown in <figref idref="f0001">FIG. 1</figref>, a group (NCOA) of mobile nodes <b>12</b> includes a temporary or permanent association of more than one of the plurality of mobile nodes.

0032The method begins (<figref idref="f0002">FIG. 2</figref>; block <b>100</b>) and includes transmitting beacon signals from each mobile node determining a node or group condition at each mobile node and varying the beacon signals based upon the determined node/group condition. The method also includes building and updating route tables (block <b>108</b>) at each node <b>12</b> with either a proactive or a reactive route discovery protocol/process to define routes in the network, i.e., build and maintain valid routes. A route is a set of links and nodes from a source to a destination. As discussed above, many routing protocols are reactive (on-demand) protocols as they collect routing information only when necessary and to destinations they need routes to, and do not maintain unused routes. This way the routing overhead is greatly reduced compared to proactive protocols which maintain routes to all destinations at all times. Ad Hoc on Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) are examples of reactive routing protocols. Examples of proactive routing protocols include Destination Sequenced Distance-Vector (DSDV) routing, Wireless Routing Protocol (WRP) and Optimal Link State Routing (OSLR).

0033The method also includes receiving the beacon signals and storing node condition information at each node (block <b>110</b>). Route stability is predicted or estimated or tracked over time based upon the node condition information (block <b>112</b>), and, at block <b>114</b>, the method switches to a second one of the proactive and reactive route discovery and their associated processes when predicted route stability reaches a first transition parameter (block <b>116</b>). Of course, building and updating route tables (block <b>118</b>), storing information at each node (block <b>120</b>), and predicting/estimating/tracking route stability over time (block <b>122</b>) would be then be performed under the switched-to route discovery and process. Moreover, the method preferably includes, at block <b>126</b>, switching back to the first one of the proactive and reactive route discovery and their associated processes when predicted route stability reaches a second transition parameter (block <b>124</b>).

0034The beacon signals include information relating to a condition of the corresponding mobile node or group of nodes. Also, the beacon signals may include information relating to a condition of the mobile ad hoc network <b>10,</b> such as information about the status of the links <b>14</b> between the nodes <b>12</b> of the network. Transmitting beacon signals may further include transmitting beacon signal information using a beacon properties signal to advertise a type of beacon signal being transmitted to the plurality of nodes <b>12</b> of the mobile ad hoc network <b>10</b>.

0035The beacon signal is preferably made up of transmission rate, transmission frequency and transmission pattern which collectively define the beacon waveform. Also, the condition preferably includes node/group movement, such as velocity, acceleration and/or movement pattern of the corresponding mobile node <b>12</b> or group of mobile nodes (NCOA) Here, varying the beacon signals includes increasing the transmission rate based upon increased node movement and decreasing the transmission rate based upon decreased node movement. The node movement may be determined using global positioning satellites (GPS), local landmarks, triangulation, and/or by measuring inertia of the mobile node <b>12</b>.

0036The condition may also or alternatively include priority of information and/or quality of service measurements (QoS), such as bit/packet error rate and/or usable available bandwidth. Here, varying the beacon signals may include increasing the transmission rate and/or changing the transmission frequency or pattern based upon decreased QoS or increased priority of information. Likewise, varying the beacon signals may include decreasing the transmission rate and/or changing the transmission frequency or pattern based upon increased QoS or decreased priority of information. The transmission rate of the beacon signals should not exceed a rate threshold based upon available bandwidth. Group beacon signals are transmitted by a subset of mobile nodes <b>12</b> of the group <b>G</b> of mobile nodes <b>12.</b> Such a subset includes a range from one mobile node <b>12</b> to all the mobile nodes <b>12</b> of the group <b>G.</b> The maximum would be all the mobile nodes <b>12</b> of the group <b>G,</b> while the minimum would be only one node <b>12</b> of the group <b>G</b> transmitting the beacons.

0037The first and second transition parameters preferably specify time-dependent conditions which may include thresholds, for example thresholds based upon a rate of change of source-destination subset pairs for at least one source node, as is discussed in detail below. A Source Destination Subset (SDS) is the allowed subset of possible destination nodes for the designated source node. The limiting case is the entire network. A notable special case is a formal subnet. The node or group condition information may be based upon node mobility, link failure, link creation or other quantities or qualities that could affect the time-dependent stability of a route.

0038The Forward Transition Parameter (FXP) is the parameter that is used to specify when to switch (transition) from using the route discovery approach category (i.e., proactive or reactive) that the full network or a formally-designated subset of nodes was initialized with, to a different route discovery category. The Reverse Transition Parameter (RXP) is the parameter that is used to specify when to switch (transition) from using the current, but not initial, route discovery approach category that the full network or a formally-designated subset of nodes is using to that approach with which the network/subset of nodes was initialized.

0039Furthermore, collecting and storing node or group condition information (block 110) may include creating and updating a time-dependent route stability profile and/or a time-dependent route segment stability profile. A route segment (RS) is a set of links and nodes, with some commonality, grouped together to form a reusable entity in potentially more than one route. A route segment would include at least one link and one node. Nothing in the definition requires these links to be spatially contiguous or the nodes to be adjacent to (within 1 hop of) at least one other node in the RS. A spacially contiguous pair of links is defined as two links separated only by a single node connecting both links in a network diagram.

0040A TTNP Default Pool (TDP) contains the internal default objects for capabilities such as QoS, traffic management, link decay profiles, route maintenance, etc. that TTNP will use to accomplish its switching from proactive to reactive and vice versa in the event that such a capability is required by TTNP but not supplied by some other avenue such as via the application or route discovery technique.

0041A system aspect of the invention will now be described with further reference to <figref idref="f0003">FIGs. 3 and 4</figref>. As discussed, the mobile ad hoc network <b>10</b> has a plurality of wireless mobile nodes <b>12,</b> and a plurality of wireless communication links <b>14</b> connecting the nodes together. Each mobile node <b>12</b> includes a router <b>20</b> that has a communications device <b>22</b> to wirelessly communicate with other nodes of the plurality of nodes via the wireless communication links <b>14.</b> Also, the router includes a controller <b>24</b> to route communications via the communications device <b>22.</b> Also, a memory <b>26</b> may be included as part of the controller <b>24</b> or in connection with the controller.

0042The controller <b>24</b> includes route tables <b>36</b> to define routes in the network <b>10.</b> Again, a route is a set of links <b>14</b> and nodes <b>12</b> from a source to a destination. The controller <b>24</b> also includes a route discovery module <b>30</b> to discover routes and update the route tables <b>36</b> with either a proactive or a reactive route discovery process. The controller also includes a beacon signal generator <b>50</b> to generate and transmit beacon signals, and a condition determining unit <b>52</b> to determine a condition of the mobile node <b>12.</b> The beacon signal generator <b>50</b> varies the beacon signals based upon the determined condition of the mobile node <b>12.</b> Again, the beacon signals include information relating to a condition of the mobile node <b>12.</b> The beacon signals may further include information relating to a status of a group G of mobile nodes <b>12</b> which, as discussed above, are a temporary or permanent association of at least two of the plurality of mobile nodes <b>12.</b>

0043Here, the condition determining unit <b>52</b> further determines a condition of the group <b>G</b> of mobile nodes <b>12,</b> and the beacon signal generator <b>50</b> varies the beacon signals based upon the determined condition of the group <b>G</b> of mobile nodes <b>12.</b> Again, the beacon signal is made up of transmission rate, transmission frequency and transmission pattern.

0044The node/group condition may include node/group movement, and the beacon signal generator <b>50</b> may vary the beacon signals by increasing the transmission rate or changing the transmission frequency or pattern based upon increased node/group movement and decreasing the transmission rate or changing the transmission frequency or pattern based upon decreased node/group movement. The node/group movement includes node/group velocity, node/group acceleration and/or node/group movement pattern of the corresponding mobile node <b>12</b> or group <b>G</b> of nodes. The condition determining unit <b>52</b> may comprise a global positioning satellite (GPS) device for determining the node/group movement, and/or may determine the node/group movement using local landmarks, by tracking the relative velocity using triangulation and/or by measuring inertia of the mobile node <b>12</b> or group of nodes <b>G.</b>

0045Furthermore, the node/group condition may include quality of service (QoS) and/or priority of information, and the beacon signal generator <b>50</b> varies the beacon signals by increasing the transmission rate and/or changing the transmission frequency or pattern based upon decreased QoS or increased priority of information and decreasing the transmission rate or changing the transmission frequency or pattern based upon increased QoS and/or decreased priority of information. The beacon signal generator <b>50</b> should not increase the transmission rate of the beacon signals beyond a rate threshold based upon available bandwidth. Again, the beacon signals may also include information relating to a condition of the mobile ad hoc network <b>10,</b> such as information about the links <b>14</b> connecting the nodes <b>12</b> of the network. Additionally, the beacon signal generator <b>50</b> may transmit beacon signal information using a beacon properties signal to advertise a type of beacon signal being transmitted to the plurality of nodes <b>12</b> of the mobile ad hoc network <b>10.</b>

0046A route stability predictor <b>32</b> predicts or estimates or tracks route stability over time based upon the node or group condition information, and a route discovery process selector <b>34</b> selects between the proactive and reactive route discovery processes based upon the predicted route stability. Again, it should be understood that blocks of the illustrations, and combinations of blocks in the illustrations, can be implemented by computer program instructions which may be provided to a processor to implement the functions specified in the block or blocks.

0047In sum, the network <b>10</b> would initially use either a proactive (e.g. OLSR, basic link state, TBRPF) or a reactive (e.g.. DSR, AODV) protocol to discover and maintain routes between source <b>S</b> and destination <b>D</b> pairs in order to build the initial route table at that source node. It is possible that at the network's creation, route tables for some or all of the nodes <b>12</b> may be initialized by predefining a set of routes for each route table knowing that those routes may change over time. As time moves forward, the network topology will generally change through node mobility and link failures/creation. TTNP accounts for these dynamic topological changes in one or more transition parameters such that when some subset of these parameters reached a certain transition level, a switching (transition) would occur from using proactive route discovery to using reactive route discovery or vice versa. This transition could occur over the entire network or be confined to any portion of it as defined by TTNP profiles.

0048Note that whenever a route discovery approach transition occurs, TTNP preferably automatically transitions other functionality associated with the route discovery approach such as route maintenance. One unique capability of TTNP is that it mitigates the selection of redundant or similar supporting functionality such as route maintenance or QoS in the event of conflicts between using what is supplied by the route discovery approach (proactive or reactive) and what is supplied by some other "plug-in" from, for example, a third party or from the TTNP default pool.

0049TTNP will properly operate in either of its two most fundamental cases. First, the initial network state begins using a proactive route discovery process and then upon reaching the threshold value of an applicable forward transition parameter (FXP), the network <b>10</b> transitions to using its companion on-demand/reactive route discovery process. Transition from this state of using an on-demand route discovery process back to using a proactive route discovery process occurs when a relevant reverse transition parameter (RXP) threshold has been reached. This RXP may or may not be the same parameter as the FXP, but even if it is, the value assigned to the RXP may not be the same as the FXP value. The key principal to remember for both FXP and RXP is that these parameters are either time itself or some other parameters which have some type of time-dependent relationship defined for describing the dynamics (actual, estimated or predicted) of these parameters.

0050Note that TTNP does not require any specific approach within a category (proactive or reactive) to use. For example, the application or systems designer may decide what proactive and what reactive techniques to use. TTNP does not make those decisions, but it does determine when to use the application-specified proactive and when to use the application-specified reactive approach. Neither does TTNP decide where to use proactive or where to use reactive approaches to initialize a network or a formal subset of the nodes. That again is in the hands of the applications or systems designer.