Use of alternate communication networks to complement an ad-hoc mobile node to mobile node communication network

Information

  • Patent Grant
  • 9467221
  • Patent Number
    9,467,221
  • Date Filed
    Monday, February 4, 2008
    17 years ago
  • Date Issued
    Tuesday, October 11, 2016
    8 years ago
Abstract
A method of communicating aircraft messages is provided. The method comprises forming an at-hoc communication network of mobile nodes. Communicating messages between the mobile nodes via the at-hoc communication network using mobile node-to-mobile node communication signals and supplementing communication gaps in the ad-hoc communication network with alternative communication signals.
Description
BACKGROUND

The use of mobile nodes to form ad-hoc communication networks provides an efficient and effective method of exchanging messages between mobile nodes as well as between a mobile node and stationary or fixed stations. For example, an ad-hoc communication network of mobile nodes can be used to relay messages to a fixed station from an originating mobile node that is beyond the communication range of the fixed station. In this example, the message is passed from one mobile node to the next mobile node that is in the direction of the fixed station until a mobile node is within the communication range of the destination station. The message is then passed onto the destination station. The use of ad-hoc communication networks eliminates the need to install and maintain significant numbers of fixed stations so that at least one will be within radio range of every mobile node traveling through a coverage area. While, the use of a mobile node-to-mobile node relay system (ad-hoc communication network) will serve many mobile nodes, it is impossible to guarantee that every mobile node will be equipped to set up the ad-hoc communication network or that there will be a sufficient number of mobile nodes positioned within the radio range of each mobile node so that a route can be found for the message from the originating mobile node seamlessly to the destination station.


For the reasons stated above and for other reasons stated below which will become apparent to those skilled in the art upon reading and understanding the present specification, there is a need in the art for an efficient and cost effective way to fill in gaps in routing options in an ad-hoc network.


SUMMARY OF INVENTION

The above-mentioned problems of current systems are addressed by embodiments of the present invention and will be understood by reading and studying the following specification. The following summary is made by way of example and not by way of limitation. It is merely provided to aid the reader in understanding some of the aspects of the invention.


In one embodiment, a method of communicating mobile node messages is provided. The method comprises forming an at-hoc communication network of mobile nodes. Communicating messages between the mobile nodes via the at-hoc communication network using mobile node-to-mobile node communication signals and supplementing communication gaps in the ad-hoc communication network with alternative communication signals.





BRIEF DESCRIPTION OF THE DRAWINGS

The present invention can be more easily understood and further advantages and uses thereof more readily apparent, when considered in view of the detailed description and the following figures in which:



FIG. 1 is an illustration of a communication system of one embodiment of the present invention;



FIG. 2, is a block diagram of a mobile node communication system of one embodiment of the present invention; and



FIG. 3 is a message communication flow diagram of one embodiment of the present invention.





In accordance with common practice, the various described features are not drawn to scale but are drawn to emphasize specific features relevant to the present invention. Reference characters denote like elements throughout Figures and text.


DETAILED DESCRIPTION

In the following detailed description, reference is made to the accompanying drawings, which form a part hereof, and in which is shown by way of illustration specific embodiments in which the inventions may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that logical, mechanical and electrical changes may be made without departing from the spirit and scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the claims and equivalents thereof.


Embodiments of the present invention provide a method of filling gaps in service coverage for an ad-hoc communication network of mobile node network. Although, the below mobile node-to-mobile node communication networks are described in relation to aircrafts, the invention can apply to any type of ad-hoc mobile node-to-mobile node network. For example, such mobile-mobile node networks could include, but are not limited to, ground traversing military vehicles and even soldier radio networks. Hence the present invention is not limited to ad-hoc air-to-air communication networks. In one embodiment, communication satellites are used to fill in service coverage for an ad-hoc mobile node-to-mobile node communication network. In aeronautical communication embodiments, the individual strengths between the two communication systems are complementary to each other. Ad-hoc air-to-air communication networks work well where the aircraft are relatively densely spaced. Some communication satellite services, however, have a limitation that they cannot service a large number of aircraft in a small geographical region due to bandwidth limitations and/or are more expensive to use, which makes them less desirable for aeronautical communications. However, the strengths and limitations of both the air-to-air network and the communication satellite network align in such a way to make a very cost effective aeronautical communication network with world wide coverage in both dense and sparse airspace when compared to prior art solutions.


Referring to FIG. 1 a communication system 100 of one embodiment is illustrated. The communication system 100 includes aircraft 102, aircraft 104 (1-N), satellite 108, satellite ground station 110, and ground station 106. In this example, both aircraft 102 and aircraft 104-1 have messages to be communicated to ground station 106. The communication radio ranges 112 for each aircraft is also illustrated in FIG. 1. Communication signals (mobile node-to-mobile node signals) used for aircraft-to-aircraft communications (mobile node-to-mobile node communications) are typically line of sight communication signals such as but not limited to very high frequency (VHF) signals. In regards to aircraft 104-1, the associated message is passed along through aircraft (mobile node) 104-2, 104-3 and 104-N using the air to air communication signals until it is passed on to the destination node 106 (the ground station 106). As illustrated, the path through aircrafts 104 (2-N) to ground station 106 is possible because each aircraft 104 (2-N) is within the radio range of the aircrafts 104 (2-N) sending the message. Although, FIG. 1 only illustrates the aircraft 104 (1-N) that pass the message to the ground station, it will be understood that other aircraft within the radio range could have been included in an ad-hoc network but only those aircraft that were included in the routing path are illustrated.


In contrast to the passing of the message to the ground station 106 via the air-to-air network of aircraft 104 (1-N), the message generated by aircraft 102 needs help in reaching the ground station 106 because of a gap in the coverage. Since, aircraft 102 is not within the air-to-air communication range (or mobile node-to-mobile node communication range) of another aircraft in the direction of the ground station 106 or the ground station itself, an alternative means of communicating the message is used. In this example, once aircraft 102 discovers it cannot pass the message on to the destination node or another aircraft of an air-to-air communication network, it uses a satellite communication means to pass the message on to the destination node. Referring to FIG. 1, the message is sent from the mobile node 102 to a satellite 108. The satellite 108 then sends the message to a satellite ground station 110 which in turn communicates the message to the destination node 106. In another embodiment, the alternative communication means is a high frequency (HF) communication network including a HF transceiver 108 and an HF ground station 110. Still in other embodiments other air/ground (alternative) communication methods are used such as VHF consumer (non-aeronautical specific) and any similar communication network that serves aircraft. Moreover, it is contemplated that the destination node may not be a ground station but another aircraft or other type of mobile node.



FIG. 2 illustrates a vehicle communication system 200 of an aircraft of one embodiment of the present invention. The vehicle communication system 200 includes a communication management function (CMF) 210 that controls the communication of the vehicle communication system 200. In this embodiment, the vehicle communication system 200 includes two transceivers, a communication transceiver 214 and a satellite (or HF or VHF or other system) transceiver 250 in communication with the CMF 210. The communication transceiver 214 sends and receives signals via antenna 218 and the satellite transceiver 250 sends and receives messages via antenna 252. The communication transceiver 214 is used to send and receive the air-to-air signals to other aircraft. The satellite transceiver 250 is used to send and receive the alternative signals that are used to communicate with a satellite HF, VHF or other system. The vehicle communication system 200 also includes surveillance equipment 201. The surveillance equipment 201 is used to send and receive surveillance information such as vehicle position and vehicle identification. Aircraft use the surveillance information for collision avoidance reasons. As illustrated, the surveillance equipment 201 is in communication with the CMF 210. Moreover, the surveillance equipment 201 sends and receives the surveillance information via the surveillance transceiver 212 and antenna 216. In one embodiment, the surveillance equipment is used to provide position and identification information of other aircraft to the CMF 210, which uses the position and identification information to discover the topology of the ad-hoc communication network and communication paths through topology. In another embodiment, message exchange with overhead data, on the air-to-air communication network, relating to position and identification is exchanged between the aircraft to determine the topology and communication paths.



FIG. 3 illustrates a message flow diagram 300 of one embodiment. This method starts by generating a message to be sent by an originating aircraft 302 (or originating node). The originating node then determines if it is within communication range of the destination node (304). The communication range is the communication range for the mobile node-to-mobile node communication signals. Such signals could include but are not limited to very high frequency (VHF) signals. If the destination node is within the communication range (304), the message is sent to the destination node (320). If however, the destination node 320 is not within the communication range (304), it is determined if a complete path to the destination node is available via mobile node-to-mobile node network (306). In embodiments, it is not only determined that another mobile node is within communication range but also whether the other mobile node is in the general direction of the destination node or a route through a plurality of mobile nodes can be established in the general direction of the destination node. If a complete route to the destination is not available (306), the level of urgency of the message is determined (314).


In this embodiment, messages that are determined to not be urgent are held on to until a later time. However, if a message is determined to be urgent it is sent right away by the alternative communication means (or system). In particular, in this embodiment, if the message is determined as being urgent (314), the message is sent via the alternative communication means (316). The message is then communicated to the destination via the alternative system (318). If the message is determined not to be urgent (314), it then determines if a maximum wait time for the message was accrued (309). If a maximum wait time for the message has accrued (309), the message is sent via the alternate communication means (316). If a maximum wait time for the message has not accrued (312), a select amount of time is allowed to pass without attempting to resend the message (312). After the select amount of wait time, the process continues at (304) where it is again determined if the mobile node is within range of the destination node. Although, this embodiment only categorizes messages as urgent and not urgent it is contemplated that various level of urgency can be assigned to a message with each level warranting a different response (for example, providing different waiting periods before transmission based on the level of urgency). The period of time can be configured for all messages or for each message independently. In other embodiments, messages are held on to for a period time for other reasons such as quality of service reasons, cost of sending the signal, message type, message priority, required reliability, required security, acceptable transit delay and phase of the flight (or mobile node mission). Regarding the cost example, the messages may be held on to for a period of time due to costs associated with using the alternative communication means. Hence, a message in one embodiment is only sent to an alternative network if the available alternative network has an acceptable cost. The mobile node in the ad-hoc network may wait until another ad-hoc route in general direction of the destination becomes available or until a low cost alternative network becomes available. Moreover, in one embodiment, the message urgency is a function of the cost, phase of flight, and/or quality of service. Hence, the present invention is not limited to systems basing the transmission on acceptable delivery time, cost of delivery, quality of service or phase of flight but other factors can be used to determine how a message urgency should be handled during periods implementing the alternative communication system.


Referring back to FIG. 3, when a mobile node-to-mobile node route to the destination is determined (306), the message is sent via the mobile node-to-mobile node network to the destination (310). The mobile node that receives the message then starts the process over at (304) where it determines if it is within the communication range of the destination node. This process further continues as indicated in FIG. 3, until the message is received at the destination node.


The methods and techniques used by the CMF as described above to communication messages in an ad-hoc communication network and supplement routing paths with alternative communication signals are implemented in digital electronic circuitry, or with a programmable processor (for example, a special-purpose processor or a general-purpose processor such as a computer) firmware, software, or in combinations of them. Apparatus embodying these techniques may include appropriate input and output devices, a programmable processor, and a storage medium tangibly embodying program instructions for execution by the programmable processor. A process embodying these techniques may be performed by a programmable processor executing a program of instructions to perform desired functions by operating on input data and generating appropriate output. The techniques may advantageously be implemented in one or more programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and DVD disks. Any of the foregoing may be supplemented by, or incorporated in, specially-designed application-specific integrated circuits (ASICs).


Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement, which is calculated to achieve the same purpose, may be substituted for the specific embodiment shown. This application is intended to cover any adaptations or variations of the present invention. Therefore, it is manifestly intended that this invention be limited only by the claims and the equivalents thereof.

Claims
  • 1. A method of communicating mobile node messages, the method comprising: forming an ad-hoc communication network between mobile nodes, wherein the ad-hoc communication network consists of mobile nodes that are within mobile node-to-mobile node communication range of each other;communicating messages between the mobile nodes via the ad-hoc communication network using mobile node-to-mobile node communication signals;determining at least one path for a message through the ad-hoc communication network toward a destination node;determining when at least one communication gap is encountered in the at least one path to the destination node, the at least one communication gap prohibiting transmission of the message to the destination node through any paths within the ad-hoc communication network;when the at least one communication gap is encountered in the at least one path to the destination node, the at least one communication gap prohibiting transmission of the message to the destination node through the ad-hoc communication network, determining whether or not to use an alternative communication network to supplement the ad-hoc communication network based on at least a first factor, wherein the alternative communication network is distinct from the ad-hoc communication network; anddetermining when to transmit through the alternative communication network based on at least a second factor, wherein determining when to transmit through the alternative communication network comprises: determining whether the message is urgentwhen the message is urgent, immediately transmitting the message using the alternative communication network;when the message is not urgent, waiting a period of time for a path through the ad-hoc communication network to become available before sending the message using the alternative communication network;wherein the first factor includes whether the message is urgent andwherein the second factor includes whether the period of time has passed since it was first determined that the at least one communication gap in the at least one path to the destination node prohibited transmission of the message to the destination node through any paths within the ad-hoc communication network such that the message cannot reach the destination node through the ad-hoc communication network.
  • 2. The method of claim 1, wherein the alternative communication network includes at least one of a satellite network, a high frequency (HF) signal network, a very high frequency (VHF) signal network and a consumer network signal network.
  • 3. The method of claim 1, wherein the first factor includes at least one of whether a period of time has passed since it was determined that at least one communication gap in the path to the destination node prohibited transmission of the message through the ad-hoc communication network, cost of service, class of the message, message type, message priority, required reliability, required security, acceptable transit delay, and phase of node mission.
  • 4. The method of claim 1, wherein forming the ad-hoc communication network between the mobile nodes further comprises: discovering a topology of the mobile nodes within communication range of the mobile node-to-mobile node communication signals.
  • 5. The method of claim 4, wherein communicating the messages between the mobile nodes via the ad-hoc communication network using the mobile node-to-mobile node communication signals further comprises: determining a path through the topology in a general direction toward the destination node, wherein the destination node is one of a mobile node and a fixed station; andpassing a message through the topology based on the path.
  • 6. A method of passing a message to a destination node, the method comprising: forming an ad-hoc communication network between mobile nodes, wherein the ad-hoc communication network consists of mobile nodes that are within mobile node-to-mobile communication range of each other;passing the message between the mobile nodes of the ad-hoc communication network towards the destination node through at least one path using mobile node-to-mobile node communication signals;when at least one communication gap is encountered in the at least one path to the destination node through the ad-hoc communication network and the at least one communication gap prohibits transmission of the message to the destination node through the ad-hoc communication network, determining whether or not to use an alternate communication network to supplement the ad-hoc communication network based on at least a first factor, wherein the alternative communication network is distinct from the ad-hoc communication network; anddetermining when to transmit through the alternative communication network based on at least a second factor, wherein determining when to transmit through the alternative communication network comprises: determining whether the message is urgentwhen the message is urgent, immediately transmitting the message using the alternative communication network;when the message is not urgent, waiting a period of time for a path through the ad-hoc communication network to become available before sending the message using the alternative communication network;wherein the first factor includes whether the message is urgent andwherein the second factor includes whether the period of time has passed since it was first determined that the at least one communication gap in the at least one path to the destination node prohibited transmission of the message to the destination node through any paths within the ad-hoc communication network such that the message cannot reach the destination node through the ad-hoc communication network.
  • 7. The method of claim 6 wherein the alternative communication network includes at least one of a satellite network, a high frequency (HF) signal network, a very high frequency (VHF) signal network, and a consumer communication network signal network.
  • 8. The method of claim 6, wherein the destination node is one of a mobile node and a fixed station.
  • 9. The method of claim 6, wherein determining when to transmit through the alternate communication network comprises: determining a level of urgency associated with the message; andbased on the level of urgency, delaying transmission of the message for a select period of time, wherein the lower the level of urgency of the message, the longer the select period of time.
  • 10. The method of claim 6, wherein forming the ad-hoc communication network between mobile nodes comprises: discovering a topology of the ad-hoc communication network based on mobile node position and identification data obtained by at least one of message exchange and surveillance equipment.
  • 11. The method of claim 10, further comprising: planning a path to the destination node based on the topology.
  • 12. A non-transitory program product comprising program instructions embodied on a processor-readable medium for execution by a programmable processor, wherein the program instructions are operable to cause the programmable processor to: form an ad-hoc communication network between mobile nodes, wherein the ad-hoc communication network consists of mobile nodes that are within mobile node-to-mobile node communication range of each other;determine at least one path for a message through the ad-hoc communication network towards a destination node;determine when at least one communication gap is encountered in the at least one path to the destination node, the at least one communication gap prohibiting transmission of the message to the destination node through the ad-hoc communication network;when the at least one communication gap is encountered in the at least one path to the destination node, the at least one communication gap prohibiting transmission of the message to the destination node through the ad-hoc communication network, determine whether or not to use an alternative communication network to supplement the ad-hoc communication network based on at least a first factor, wherein the alternative communication network is distinct from the ad-hoc communication network; anddetermine when to transmit through the alternative communication network based on at least a second factor, wherein determine when to transmit through the alternative communication network comprises: determining whether the message is urgentwhen the message is urgent, immediately transmitting the message using the alternative communication network;when the message is not urgent, waiting a period of time for a path through the ad-hoc communication network to become available before sending the message using the alternative communication network;wherein the first factor includes whether the message is urgent andwherein the second factor includes whether the period of time has passed since it was first determined that the at least one communication gap in the at least one path to the destination node prohibited transmission of the message to the destination node through any paths within the ad-hoc communication network such that the message cannot reach the destination node through the ad-hoc communication network.
  • 13. The program product of claim 12, wherein the program instructions are further operable to cause the programmable processor to: discover a topology of the ad-hoc communication network.
  • 14. The program product of claim 13, wherein the program instructions are further operable to cause the programmable processor to: use at least one of surveillance data and message exchange data to discover the topology of the ad-hoc communication network.
  • 15. The method of claim 1, wherein the mobile nodes are selected from at least one of aircraft, ground vehicles, and soldiers.
  • 16. The program product of claim 12, wherein at least a first factor includes at least one of whether a period of time has passed since it was determined that at least one communication gap in the path to the destination node prohibited transmission of the message through the ad-hoc communication network, cost of service, class of the message, message type, message priority, required reliability, required security, acceptable transit delay, and phase of node mission.
US Referenced Citations (166)
Number Name Date Kind
4414661 Karlstrom Nov 1983 A
4901307 Gilhousen et al. Feb 1990 A
5095480 Fenner Mar 1992 A
5530909 Simon et al. Jun 1996 A
5710764 Yoshimura et al. Jan 1998 A
5835059 Nadel et al. Nov 1998 A
5933477 Wu Aug 1999 A
6018659 Ayyagari et al. Jan 2000 A
6047165 Wright et al. Apr 2000 A
6064335 Eschenbach May 2000 A
6084870 Wooten Jul 2000 A
6104712 Robert et al. Aug 2000 A
6108539 Ray et al. Aug 2000 A
6115580 Chuprun Sep 2000 A
6147980 Yee et al. Nov 2000 A
6148179 Wright Nov 2000 A
6154636 Wright et al. Nov 2000 A
6160998 Wright et al. Dec 2000 A
6163681 Wright et al. Dec 2000 A
6173230 Camus et al. Jan 2001 B1
6181990 Grabowsky et al. Jan 2001 B1
6195189 Nishihata et al. Feb 2001 B1
6259379 Paterson et al. Jul 2001 B1
6262659 Korkosz et al. Jul 2001 B1
6271768 Frazier, Jr. Aug 2001 B1
6285878 Lai Sep 2001 B1
6308044 Wright et al. Oct 2001 B1
6353779 Simon Mar 2002 B1
6438468 Muxlow et al. Aug 2002 B1
6477152 Hiett Nov 2002 B1
6606055 Halsema et al. Aug 2003 B2
6643274 D'Annunzio Nov 2003 B2
6677888 Roy Jan 2004 B2
6744396 Stone et al. Jun 2004 B2
6778825 Parkman Aug 2004 B2
6781513 Korkosz et al. Aug 2004 B1
6788935 McKenna et al. Sep 2004 B1
6795408 Hiett Sep 2004 B1
6810527 Conrad et al. Oct 2004 B1
6816728 Igloi et al. Nov 2004 B2
6819670 Fenner Nov 2004 B1
6915189 Igloi et al. Jul 2005 B2
6925088 Moreaux Aug 2005 B1
6931248 Borel Aug 2005 B2
6940832 Saadawi et al. Sep 2005 B2
6965816 Walker Nov 2005 B2
6970444 Chwieseni et al. Nov 2005 B2
6990319 Wright et al. Jan 2006 B2
7027812 Dastrup et al. Apr 2006 B2
7072977 Bernard et al. Jul 2006 B1
7085290 Cain Aug 2006 B2
7085562 Holder et al. Aug 2006 B1
7116266 Vesel et al. Oct 2006 B1
7177295 Sholander et al. Feb 2007 B1
7177939 Nelson et al. Feb 2007 B2
7181160 Barrett Feb 2007 B2
7187927 Mitchell Mar 2007 B1
7343157 Mitchell Mar 2008 B1
7398050 Walker Jul 2008 B2
7454203 Levitan Nov 2008 B2
7463890 Herz et al. Dec 2008 B2
7519014 Allen et al. Apr 2009 B2
7522628 Elliott Apr 2009 B1
7599314 Wittenschlaeger Oct 2009 B2
7633873 Kohler Dec 2009 B1
7643426 Lee Jan 2010 B1
7729263 True et al. Jun 2010 B2
7751815 McKenna et al. Jul 2010 B2
7756508 Usher et al. Jul 2010 B1
7769028 Boley et al. Aug 2010 B2
7814322 Gurevich et al. Oct 2010 B2
7848278 Chen et al. Dec 2010 B2
7876736 Inoue Jan 2011 B2
7894475 Bishop et al. Feb 2011 B2
7907893 Karabinis et al. Mar 2011 B2
7924761 Stevens Apr 2011 B1
7940669 Vaswani et al. May 2011 B2
8023936 Hudson et al. Sep 2011 B2
8190147 Kauffman et al. May 2012 B2
8284674 True et al. Oct 2012 B2
8570990 Kauffman Oct 2013 B2
8577369 Achtari et al. Nov 2013 B2
8811265 Horvath Aug 2014 B2
8929830 Ludwig et al. Jan 2015 B2
20020009993 Dastrup et al. Jan 2002 A1
20020114346 Lampe Aug 2002 A1
20020168971 Parkman Nov 2002 A1
20020191573 Whitehill et al. Dec 2002 A1
20030003872 Brinkley et al. Jan 2003 A1
20030030581 Roy Feb 2003 A1
20030053424 Krishnamurthy et al. Mar 2003 A1
20030071743 Seah et al. Apr 2003 A1
20030072252 Gurney Apr 2003 A1
20030073406 Benjamin Apr 2003 A1
20030158963 Sturdy Aug 2003 A1
20030231574 Okuda et al. Dec 2003 A1
20030231584 Zeitfuss Dec 2003 A1
20040008253 Monroe Jan 2004 A1
20040028003 Diener et al. Feb 2004 A1
20040132495 Horton, Jr. et al. Jul 2004 A1
20040157557 Barnett et al. Aug 2004 A1
20040235469 Krug Nov 2004 A1
20050026609 Brinkley et al. Feb 2005 A1
20050053026 Mullan et al. Mar 2005 A1
20050054346 Windham et al. Mar 2005 A1
20050064895 Oesterling et al. Mar 2005 A1
20050090201 Lengies et al. Apr 2005 A1
20050108374 Pierzga et al. May 2005 A1
20050143013 Jha Jun 2005 A1
20050174950 Ayyagari Aug 2005 A1
20050197748 Holst et al. Sep 2005 A1
20050220055 Nelson et al. Oct 2005 A1
20050221814 Fagan et al. Oct 2005 A1
20050221818 Johnson et al. Oct 2005 A1
20050232185 Hudson et al. Oct 2005 A1
20050234788 Hudson et al. Oct 2005 A1
20050281270 Kossi Dec 2005 A1
20050286452 Hardgrave et al. Dec 2005 A1
20060023677 Labrador et al. Feb 2006 A1
20060031394 Tazuma Feb 2006 A1
20060080451 Eckert Apr 2006 A1
20060098608 Joshi May 2006 A1
20060167618 Werback Jul 2006 A1
20060176842 Tamura Aug 2006 A1
20060178141 McGuffin et al. Aug 2006 A1
20060183474 Ziarno et al. Aug 2006 A1
20060205345 Ishikawa Sep 2006 A1
20060270447 Everson et al. Nov 2006 A1
20070026866 Krishnamurthi et al. Feb 2007 A1
20070042773 Alcorn Feb 2007 A1
20070042774 Alcorn Feb 2007 A1
20070072590 Levitan Mar 2007 A1
20070150939 Aaron Jun 2007 A1
20070183435 Kettering et al. Aug 2007 A1
20070198142 Werback Aug 2007 A1
20070200761 Smith Aug 2007 A1
20070213009 Higashida et al. Sep 2007 A1
20070284474 Olson et al. Dec 2007 A1
20070286097 Davies Dec 2007 A1
20070297416 Boley Dec 2007 A1
20080095134 Chen et al. Apr 2008 A1
20080117858 Kauffman May 2008 A1
20080144617 Molsberry et al. Jun 2008 A1
20080150784 Zhang Jun 2008 A1
20080151811 El-Damhougy et al. Jun 2008 A1
20080186897 Rune Aug 2008 A1
20080186907 Yagyuu et al. Aug 2008 A1
20080205283 McGuffin et al. Aug 2008 A1
20080240038 Lynche et al. Oct 2008 A1
20080240062 Lynch et al. Oct 2008 A1
20080274734 Kostanic et al. Nov 2008 A1
20080291843 Sonnenberg et al. Nov 2008 A1
20090005041 Steinberg Jan 2009 A1
20090041041 True et al. Feb 2009 A1
20090058682 True Mar 2009 A1
20090077626 Leclercq et al. Mar 2009 A1
20090092074 Jamalipour et al. Apr 2009 A1
20090103452 Horvath Apr 2009 A1
20090103473 Foster Apr 2009 A1
20090141669 Kauffman Jun 2009 A1
20090197595 Kauffman et al. Aug 2009 A1
20090318137 Kauffman et al. Dec 2009 A1
20090318138 Zeng et al. Dec 2009 A1
20100057899 Henkel Mar 2010 A1
20100157905 Ahn et al. Jun 2010 A1
20100272012 Knefelkamp Oct 2010 A1
Foreign Referenced Citations (11)
Number Date Country
967815 Dec 1999 EP
1793512 Jun 2007 EP
1850543 Oct 2007 EP
1926234 May 2008 EP
03053013 Jun 2003 WO
2005069545 Jul 2005 WO
2007022353 Feb 2007 WO
2007043827 Apr 2007 WO
2007054410 May 2007 WO
2007059560 May 2007 WO
2008007861 Jan 2008 WO
Non-Patent Literature Citations (68)
Entry
Mouza et al. , “Mobility Patterns”, “Proceedings of the Second Workshop on Spatio-Temporal Database Management”, Jul. 23, 2004, Published in: Toronto, Canada.
Samal, “Mobility Pattern Aware Routing in Mobile Ad Hoc Network ”, May 2003, Publisher: Virginia Polytechnic Institute and State University , Published in: Blacksburg, Virginia.
Vyas et al. , “Location and Mobility Pattern Based Routing Algorithm for Mobile Ad Hoc Wireless Networks”, “http://www.scs.org/getDoc.cfm?id=2466”, 2003, Publisher: The Society for Modeling and Simulation International.
European Patent Office, “European Search Report”, Jun. 4, 2009, Published in: EP.
Polajnar et al., “Simple and Efficient Protocols for Guaranteed Message Delivery in Wireless Ad-hoc Networks”, “Wireless and Mobile Computing, Networking and Communications 2005”, Aug. 22, 2005, pp. 93-100, vol. 3, Publisher: IEEE, Published in: Piscataway, NJ.
Sakhaee et al., “Aeronautical ad hoc Networks”, “Wireless Communications and Networking Conference”, Jan. 1, 2006, pp. 246-251, Publisher: IEEE, Published in: Piscataway, NJ.
Zhou et al., “GeoLANMAR: Geo Assisted Landmark Routing for Scalable, Group Motion Wireless Ad Hoc Networks”, “Vehicular Technology Conference 2005”, May 30, 2005, pp. 2420-2424, vol. 4, Publisher: IEEE, Published in: Piscataway, NJ.
“The ATN SARPs Third Edition”, “Manual of Technical Provisions for the Aeronautical Telecommunications Network—ICAO DOC 9705/AN956”, , Publisher: ATN.
Avionica, “Securelink”, , pp. 1-2, Publisher: AVIONICA.
Carlos Jodar et al., “Wi-Fi Gatelink Trial Frankfurt and Muich, Germany White Paper”, Aug. 9, 2006, pp. 1-18, Publisher: ARINC Proprietary.
Eklund et al., “IEEE Standard 802.16: A Technical Overview of the Wirelessman Air Interface for Broadband Wireless Access”, “IEEE Communications Magazine”, Jun. 2002, pp. i-107, Publisher: IEEE.
Hardy et al., “Aircraft Network and File Server—ARINC 763”, Oct. 16, 2002, pp. 1-12, Publisher: AEEC (Airlines Electronic Engineering Committee).
“Technical Overview for Mark III Communications Management Unit (CMU)”, , pp. 1-59, Publisher: Honeywell Aerospace Electronic Systems.
Hurlburt et al., “A Data Communications Concept for a SATS Scenario”, “4th Integrated CNS Technologies Conference and Workshop”, Apr. 2004, pp. 1-20.
Ivancic, “Modular, Cost-Effective, Extensible Avionics Architecture for Secure Mobile Communications”, “2006 IEEE Aerospace Conference—Mar. 4-11, 2006 Big Sky, Montana”, 2006, pp. 1-9, Publisher: IEEE.
Teledyne Technologies Inc., “Wireless Groundlink System (WGL)”, “www.teledyne-controls.com/productsolution.wirelessgroundlink.groundlink.asp”, 2007, pp. 1-2, Publisher: Teledyne Technologies Inc.
Teledyne Technologies Inc., “New Release”, “www.teledyne-controls.com/newscenter/sco.asp”, 2007, pp. 1-2, Publisher: Teledyne Technologies Inc.
Cordeiro et al., “IEEE 802.22: An Introduction to the First Wireless Standard Based on Congitive Radios”, “Journal of Communications”, Apr. 2006, pp. 38-47, vol. 1, No. 1, Publisher: Academy Publisher.
U.S. Patent and Trademark Office, “Final Office Action”, “U.S. Appl. No. 12/143,369”, Sep. 20, 2011.
U.S. Patent and Trademark Office, “Office Action”, “U.S. Appl. No. 12/143,369”, Apr. 14, 2011.
U.S. Patent and Trademark Office, “Office Action”, “U.S. Appl. No. 12/143,369”, Dec. 9, 2011.
U.S. Patent and Trademark Office, “Office Action”, “U.S. Appl. No. 11/875,662”, Oct. 2, 2009.
U.S. Patent and Trademark Office, “Office Action”, “U.S. Appl. No. 11/950,218”, Nov. 1, 2010.
U.S. Patent and Trademark Office, “Office Action”, “U.S. Appl. No. 11/875,660”, Sep. 17, 2010.
U.S. Patent and Trademark Office, “Office Action”, “U.S. Appl. No. 11/875,660”, Jun. 20, 2011.
U.S. Patent and Trademark Office, “Final Office Action”, “U.S. Appl. No. 11/875,662”, Mar. 17, 2010.
U.S. Patent and Trademark Office, “Final Office Action”, “U.S. Appl. No. 11/950,218”, Apr. 11, 2011.
U.S. Patent and Trademark Office, “Final Office Action”, “U.S. Appl. No. 11/875,660”, Feb. 1, 2011.
U.S. Patent and Trademark Office, “Final Office Action”, “U.S. Appl. No. 11/875,660”, Dec. 7, 2011.
U.S. Patent and Trademark Office, “Advisory Action”, “U.S. Appl. No. 11/875,662”, May 20, 2010.
U.S. Patent and Trademark Office, “Advisory Action”, “U.S. Appl. No. 11/950,218”, Jun. 3, 2011.
U.S. Patent and Trademark Office, “Advisory Action”, “U.S. Appl. No. 11/875,660”, Apr. 14, 2011.
U.S. Patent and Trademark Office, “Advisory Action”, “U.S. Appl. No. 11/875,660”, Feb. 22, 2012.
U.S. Patent and Trademark Office, “Pre-Appeal Brief Decision”, “U.S. Appl. No. 11/875,662”, Jun. 25, 2010.
U.S. Patent and Trademark Office, “Examiner's Answer”, “U.S. Appl. No. 11/875,662”, Oct. 27, 2010.
U.S. Patent and Trademark Office, “Pre-Appeal Brief Decision”, “U.S. Appl. No. 11/875,660”, Apr. 23, 2012.
U.S. Patent and Trademark Office, “Notice of Allowance”, “U.S. Appl. No. 12/143,369”, Apr. 12, 2012.
European Patent Office, “European Search Report”, “from Foreign Counterpart of U.S. Appl. No. 11/875,660”, Apr. 10, 2012, pp. 1-3, Published in: EP.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 11/875,660”, May 3, 2012, Published in: EP.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 11/875,660”, Sep. 13, 2012, pp. 1-3, Published in: EP.
U.S. Patent and Trademark Office, “Examiner's Answer”, “U.S. Appl. No. 11/875,660”, Aug. 16, 2012, pp. 1-16.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 11/875,662”, May 3, 2012, pp. 1-5, Published in: EP.
European Patent Office, “European Search Report”, “from Foreign Counterpart of U.S. Appl. No. 11/875,662”, Apr. 5, 2012, pp. 1-3, Published in: EP.
European Patent Office, “Communication under Rule 71(3) EPC”, “from Foreign Counterpart of U.S. Appl. No. 11/950,218”, Apr. 5, 2011, pp. 1-21, Published in: EP.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 11/950,218”, Sep. 29, 2009, p. 1, Published in: EP.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 11/950,218”, May 26, 2010, pp. 1-3, Published in: EP.
European Patent Office, “Extended European Search Report”, “from Foreign Counterpart of U.S. Appl. No. 11/950,218”, Mar. 20, 2009, pp. 1-6, Published in: EP.
U.S. Patent and Trademark Office, “Office Action”, “U.S. Appl. No. 11/950,218”, Aug. 28, 2012, pp. 1-27.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 12/025,685”, Sep. 11, 2009, p. 1, Published in: EP.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 12/025,685”, Jan. 23, 2012, pp. 1-6, Published in: EP.
European Patent Office, “Extended European Search Report”, “from Foreign Counterpart of U.S. Appl. No. 12/025,685”, May 8, 2009, pp. 1-6, Published in: EP.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 12/143,369”, Nov. 13, 2009, pp. 1-6, Published in: EP.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 12/143,369”, Jun. 25, 2010, pp. 1-4, Published in: EP.
European Patent Office, “Office Action”, “from Foreign Counterpart of U.S. Appl. No. 12/143,369”, Apr. 8, 2011, pp. 1-4, Published in: EP.
Drula et al., “Adaptive Energy Conserving Algorithms for Neighbor Discovery in Opportunistic Bluetooth Networks”, “IEEE Journal on Selected Areas in Communications”, Jan. 2007, pp. 96-107, vol. 25, No. 1, Publisher: IEEE.
U.S. Patent and Trademark Office, “Office Action”, “from U.S. Appl. No. 11/875,662”, Dec. 26, 2013, pp. 1-43, Published in: US.
U.S. Patent and Trademark Office, “Decision on Appeal”, “from U.S. Appl. No. 11/875,662”, Sep. 19, 2013, pp. 1-7, Published in: US.
European Patent Office, “Office Action from EP Application No. 09151372.1 mailed Feb. 3, 2014”, “from Foreign Counterpart of U.S. Appl. No. 12/025,685”, Feb. 3, 2014, pp. 1-4, Published in: EP.
U.S. Patent and Trademark Office, “Notice of Allowance”, “from U.S. Appl. No. 11/875,662”, Apr. 15, 2014, pp. 1-16, Published in: US.
Canadian Intellectual Property Office, “Office Action from CA Application No. 2,669,062 mailed Nov. 3, 2015”, “from Foreign Counterpart of U.S. Appl. No. 12/143,369”, Nov. 3, 2015, pp. 1-4, Published in: CA.
U.S. Patent and Trademark Office, “Office Action”, “from U.S. Appl. No. 11/875,660”, Jul. 8, 2015, pp. 1-15, Published in: US.
Canadian Intellectual Property Office, “Office Action from CA Application No. 2,645,527 mailed Jun. 30, 2015”, “from Foreign Counterpart of U.S. Appl. No. 11/950,218”, Jun. 30, 2015, pp. 1-5, Published in: CA.
U.S. Patent and Trademark Office, “Notice of Allowance and Fee(s) Due”, “U.S. Appl. No. 11/875,660”, Oct. 8, 2015, pp. 1-9.
U.S. Patent Office, “Decision on Appeal”, “from U.S. Appl. No. 11/875,660”, Apr. 23, 2015, pp. 1-9.
Canadian Patent Office, “Office Action for Canadian Patent Application No. 2,641,083”, “from Foreign Counterpart to U.S. Appl. No. 11/875,660”, Apr. 15, 2015, pp. 1-3, Published in: CA.
Canadian Patent Office, “Office Action for Canadian Patent Application No. 2,641,082”, “from Foreign Counterpart to U.S. Appl. No. 11/875,662”, Apr. 15, 2015, pp. 1-3, Published in: CA.
Canadian Intellectual Property Office, “Office Action from CA Application No. 2,651,435 mailed May 20, 2015”, “from Foreign Counterpart of U.S. Appl. No. 12/025,685”, May 20, 2015, pp. 1-3, Published in: CA.
Canadian Patent Office, Office Action for Canadian Patent Application No. 2,641,082, from foreign counterpart of U.S. Appl. No. 11/875,662, filed Apr. 5, 2016, pp. 1-3, Published in: CA.
Related Publications (1)
Number Date Country
20090197595 A1 Aug 2009 US