US 7,180,875 B1Grant
System and method for performing macro-diversity selection and distribution of routes for routing data packets in Ad-Hoc networks
Issue Date:2007-02-20
•10 Claims
•13 Drawing Sheets
Abstract
A communications network which is capable of effectively and efficiently handling fading between mobile wireless user terminals of a packet-switched network with minimal overhead and packet loss, and a method for using the same. The communications network employs an origination mobile terminal and surrounding macroscopic mobile terminals and/or surrounding fixed infrastructure. Communication is established between the origination mobile terminal and surrounding macroscopic mobile terminals and/or surrounding fixed infrastructure. The communication is established via modified request to send (RTS) and clear to send (CTS) messages, wherein the modified messages provide for an additional two sets of k unicast addresses where k equals the maximum number of routes available per route entry in the origination mobile terminal's route table.
Metadata
Assignee
- MeshNetworks, Inc.
Inventors
- Phillip D. Neumiller
- Guenael T. Strutt
- Dennis W. Davis
Application Information
Application Number:US 10/022,269
Filing Date:2001-12-20
Priority Date:2001-12-20
Art Unit:2616
Classifications
IPC:
H04Q7/00H04Q7/24H04J3/16H04L12/413H04L12/403
Patent Drawings (13 sheets)
Description
Background of the Invention
[0001] 1. Field of the Invention
[0002] The present invention relates to an improved system and method for enabling a node, such as a remote unit in a wireless network, to perform macroscopic selection and distribution of routes for routing data packets to other nodes in the network. More particularly, the present invention relates to a system and method for enabling nodes in an ad-hoc packet switched communications network to reduce the effects of signal fading by modifying request to send (RTS) and clear to send (CTS) messages to include additional unicast addressing fields comprising two sets of multiple unicast addresses representing the maximum number of data packet routes available per route entry in the node's routing table.
[0003] 2. Description of the Related Art
[0004] Wireless communications networks, such as mobile wireless telephone networks, have become increasingly prevalent over the past decade. These wireless communications networks are commonly referred to as “cellular networks”, because the network infrastructure is arranged to divide the service area into a plurality of regions called “cells”.
[0005] Specifically, a terrestrial cellular network or other type of conventional specialized mobile radio (SMR) system includes a plurality of interconnected stationary base stations that are distributed geographically at designated locations throughout the service area. Each stationary base station includes one or more transceivers that are capable of transmitting and receiving electromagnetic signals, such as radio frequency (RF) communications signals, to and from user terminals, such as wireless telephones, located in its coverage area. The communications signals include, for example, voice data that has been modulated according to a desired modulation technique and transmitted as data packets. As can be appreciated by one skilled in the art, the transceiver and user terminals transmit and receive the data packets in multiplexed format, such as time-division multiple access (TDMA) format, code-division multiple access (CDMA) format, frequency-division multiple access (FDMA) format, orthogonal frequency division access (OFDM) or other suitable modulation formats, which enables a single transceiver at the base station to communicate simultaneously with several user terminals in its coverage area.
[0006] Each base station is also connected to one or more gateways that enable communication between the base station and other networks, such as the Internet and the public switched telephone network (PSTN). Accordingly, the base stations in the network enable the user terminals to communicate with each other, as well as with other destinations, such as telephony devices, in the PSTN.
[0007] Because each base station is stationary and can only handle a limited amount of communications signal traffic from the user terminals at any given time, the coverage area of a base station can vary depending on the amount of traffic that the base station is expected to experience. For example, the coverage area of a base station can be set to several kilometers in diameter in sparsely populated regions, such as rural regions having light wireless traffic, and can be set to less than a kilometer in diameter in densely populated regions, such as major metropolitan areas having heavy wireless traffic. The wireless communications network therefore must employ many stationary base stations in heavily populated metropolitan areas in order for the network to adequately service the user terminals in those regions.
[0008] As can be further appreciated by one skilled in the art, it is also common for a mobile user terminal to travel between different base station coverage areas during use, that is, during a single telephone call. When this occurs, the base station whose coverage area the user terminal is leaving must transfer or “handoff” the user terminal to the base station whose coverage area the user terminal is entering, so that the latter base station can become the base station via which the user terminal and network continue to communicate. In densely populated areas having many base stations with small coverage (often sectorized) areas, this handoff process may need to occur several times during a short period of time as the user terminal travels between the different cells and sectors. However, in regions such as high traffic commuting regions having an inadequate number of base stations or overlays or sectors, more user terminals are competing for access to a base station within their coverage area. Accordingly, the number of lost or dropped calls that may occur during the handoff process can be increased due to the lack of adequate base station accessibility and the break before make hard handoff process itself.
[0009] Selection and distribution of data packet routes within wireless communication systems, such as those described above, is known in the art. One such communication system employing selection and distribution is a Code Division Multiple Access (CDMA) communication system as described in Cellular System Remote Unit Base Station Compatibility Standard of the Electronic Industry Association/Telecommunications Industry Association Interim Standard 95A (IS-95A/B), which is incorporated by reference herein.
[0010] Many techniques have been developed using the circuit-switched cellular infrastructure to minimize data packet loss during handoff while also minimizing overhead necessary to successfully perform the handoff. For example, as described in IS-95A/B, as a remote unit moves to the edge of a cell, it may commence communication with an adjacent base station, while the current base station continues to handle the call. Both base stations then handle the call simultaneously. During such a scenario, the remote unit is said to be in soft handoff. Soft handoff provides diversity of forward traffic channels and reverse channel paths on the boundaries between base stations. It should also be noted that when the soft handoff occurs between sectors it is referred to as a “softer handoff”. Each base station involved in a particular soft handoff demodulates the traffic channel frames and provides the frames to a selector function. The selector function then selects the best frame from each of the active call legs and that frame is forwarded on to the rest of the communication network. This can also employ methods such as maximal ratio combining as is typically done in rake receivers or simple packet error detection methods. Likewise, the communication network provides frames to a distribution function that are to be transmitted to the remote unit. The distribution function distributes these frames to all base stations involved in soft handoff with the remote unit. Thus far this powerful technique has only been widely applied and integrated into CDMA based cellular systems such as those specified and proposed by the Third Generation Third Party Partnership Project (3GPP) Universal Mobile Telecommunications System (UMTS), 3GPP2 (CDMA 2000/IS-95C), IS-95 A/B (2G CDMA) and International Mobile Telecommunications (IMT) 2000.
[0011] Macro-diversity selection and distribution is used in cellular systems to allow mobile units to simultaneously communicate with multiple base stations, thus greatly increasing the chances that at least one of the paths will not experience any particular fade or possibly a shadowing. Mobile radios often can experience deep fades of 40 dB or more for milliseconds at a time. FIGS. 1A through 1C depict three independent Rayleigh fading paths of equal envelope power at a frequency of 2.45 GHz. The random occurrence of significant fading events is noteworthy. Fading behavior scales with frequency as a linear compression of the time axis as shown in FIG. 2A . Hence, for mobile radios, the fade rate for a given fade depth will increase linearly with platform speed whereas the mean fade duration will decrease nonlinearly with speed, as depicted in FIGS. 2B and 3 , which is described in the publication by Jhong S. Lee and Leonard Miller entitled “CDMA Systems Engineering Handbook”, Artech House Publishers, 1998, and is herein incorporated by reference.
[0012] U.S. Pat. Nos. 6,226,283, 6,141,559, and 6,072,790 to Neumiller et al., the entire contents of each being incorporated herein by reference, disclose methods for providing macro-diversity selection and distribution in a peer-to-peer distributed manner where the SDU function was moved to the base transceiver stations. However, in hybrid multi-hop ad-hoc network systems that have fixed nodes to backhaul traffic to and from the Internet and the Public Switched Telephone Network (PSTN), a mobile node will use only one of the many routes it may have accumulated via routing protocols to its gateway. A mobile node may also send packets through other mobile nodes if the routing algorithm has no better choices.
[0013] Thus, for a fast moving mobile terminal in an ad-hoc network that has an established route, the signal can suffer from fading as those seen on interstate highways when mobile nodes/terminals are surrounded by a large amount of RF scattering clutter surfaces and reflectors. The call could then be dropped.
[0014] Accordingly, a need exists for a system and method for providing macro-diversity selection and distribution in ad-hoc communication networks to minimize the affects of fading.
Summary of the Invention
[0015] An object of the present invention is to provide a system and method capable of effectively and efficiently reducing the affect of signal fading on wireless user mobile terminals in a communications network, in particular, a packet-switched network, with minimal overhead and packet loss.
[0016] Another object of the present invention is to provide a system and method for achieving the most suitable routing path for the type of data contained in the data packets by enabling a node in an ad-hoc packet switched communications network to reduce transmitter power and maintain a fixed bit error rate (BER) or maintain transmit power and achieve orders-of-magnitude reduction in BER.
[0017] These and other objectives are substantially achieved by providing a system and method for enabling a mobile terminal and surrounding macroscopic fixed wireless routers (or other mobile nodes) in a wireless ad-hoc communications network to establish communication with each other to minimize the effect of fading on data packets being transmitted from the originating mobile terminal to the mobile terminals that experience uncorrelated fading. Upon origination, a mobile terminal shall narrowcast a modified request to send (RTS) to the surrounding macroscopic mobile terminals, which each respond to the mobile terminal with a modified clear to send (CTS) message. The modified RTS and CTS messages each provide for an additional two sets of k unicast addresses, where k equals the maximum number of routes available per route entry in the mobile terminal's route table. Data packets can thus be sent by the originating mobile terminal to the surrounding mobile terminals, which can each then further route the data packets to their destination using a similar technique. In the preferred embodiment of the present invention, if the surrounding router receiving a packet from the originating router is mobile (i.e. moving), it is desirable to use the same technique again. If the surrounding router receiving the narrowcast packet is a fixed wireless router, it may choose to forward the packet using unicast or multi-cast routing. It should also be noted that the fast moving mobiles will experience much more fading than fixed infrastructure equipment. Thus, is it is not necessary to narrow cast packets on links between fixed infrastructure equipment.
[0018] If the packet is destined for the network gateway, that is, leaving the ad-hoc network, the individual routing paths will collapse into one path (possibly a Steiner tree as used in known multi-cast routing art) on route to the destination gateway.
[0019] However, if the packet is destined for another mobile host, it may use the additional set of narrow cast addresses to distribute the packets to the mobile terminal.
Brief Description of the Drawings
[0020] These and other objects, advantages and novel features of the invention will be more readily appreciated from the following detailed description when read in conjunction with the accompanying drawings, in which:
[0021] FIGS. 1A through 1C depict three independent graphs of Rayleigh fading paths of equal envelope power;
[0022] FIG. 2A is a graph illustrating the frequency scaling of Rayleigh fading behavior;
[0023] FIG. 2B is a is a graph illustrating the fade rate versus the speed of a mobile terminal;
[0024] FIG. 3 is a is a graph illustrating the mean fade rate duration versus the speed of a mobile terminal;
[0025] FIG. 4 is a block diagram of an example of an ad-hoc packet switched wireless communications network employing a system and method for enabling a node, such as a mobile user terminal, in the network to apply a route addressing structure including modified request to send (RTSn) and clear to send (CTSn) messages to perform macro-diversity selection and distribution;
[0026] FIG. 5 is a block diagram illustrating an example of a user terminal employed in the network shown in FIG. 4 ;
[0027] FIG. 6A depicts an example of routing paths from mobile terminal A to mobile terminal B according to an embodiment of the present invention;
[0028] FIG. 6B depicts an example of an exchange of modified RTS and CTS messages between mobile terminal A and the surrounding macroscopic mobile terminals shown in FIG. 6A according to an embodiment of the present invention;
[0029] FIG. 7 is a graph of a combined Rayleigh fading path according to an embodiment of the present invention;
[0030] FIG. 8 depicts an exemplary call flow diagram illustrating messaging initiated by terminal A to surrounding macroscopic terminals according to an embodiment of the present invention;
[0031] FIG. 9 depicts an exemplary call flow diagram illustrating messaging initiated by the surrounding macroscopic terminals to terminal A according to an embodiment of the present invention;
[0032] FIG. 10 depicts an exemplary call flow diagram illustrating messaging initiated by terminal A to surrounding macroscopic terminals according to an embodiment of the present invention;
[0033] FIG. 11 depicts an exemplary call flow diagram illustrating messaging initiated by the surrounding macroscopic terminals to terminal A according to an embodiment of the present invention; and
[0034] FIG. 12 is an exemplary illustration of a request to send message structure according to an embodiment of the present invention.
Detailed Description of the Preferred Embodiments
[0035] FIG. 4 is a block diagram illustrating an example of an ad-hoc packet-switched wireless communications network 100 employing an embodiment of the present invention. Specifically, the network 100 includes a plurality of mobile wireless mobile terminals 102-1 through 102-n (referred to generally as mobile terminals 102), and a fixed network 104 having a plurality of access points 106-1, 106-2, . . . , 106-n, for providing the mobile terminals 102 with access to the fixed network 104. The fixed network 104 includes, for example, a core local access network (LAN), and a plurality of servers and gateway routers, to thus provide the mobile terminals 102 with access to other networks, such as the public switched telephone network (PSTN) and the Internet. The fixed network 104 can also include mobile nodes. The network 100 can further include fixed routers 107-1 through 107-n for routing data packets between the mobile terminals 102, the access points 106, and each other. The mobile terminals 102, access points 106, and fixed routers 107 can be referred to collectively as nodes.
[0036] As can be appreciated by one skilled in the art, the nodes 102, 106 and 107 are capable of communicating with each other directly, or via one or more other nodes 102, 106 and 107 operating as a router or routers for data packets being sent between nodes 102, 106 and 107, as described in U.S. Pat. No. 5,943,322 to Mayor and in U.S. patent application Ser. Nos. 09/897,790, 09/815,157 and 09/815,164, referenced above. Specifically, as shown in FIG. 5 , each node 102, 106 and 107 includes a transceiver 108 which is coupled to an antenna 110 and is capable of receiving and transmitting signals, such as packetized data signals, to and from the node 102, 106 and 107, under the control of a controller 112. The packetized data signals can include, for example, voice, data or multimedia.
[0037] Each node 102, 106 and 107 further includes a memory 114, such as a random access memory (RAM), that is capable of storing, among other things, routing information pertaining to itself and other nodes 102, 106 and 107 in the network 100. The nodes 102, 106 and 107 exchange their respective routing information, referred to as routing advertisements or routing table information, with each other via a flooding/broadcast mechanism periodically, for example, when a new mobile terminal 102 enters the network 100, or when existing mobile terminals 102 in the network 100 move. A node 102, 106 and 107 will broadcast its routing table updates, and nearby nodes 102, 106 and 107 will only receive the broadcast routing table updates if within radio frequency (RF) range of the broadcasting node 102, 106 and 107. For example, assuming that mobile terminals 102-1, 102-2 and 102-7 are within the RF broadcast range of mobile terminal 102-6, when mobile terminal 102-6 broadcasts its routing table information, that information is received by mobile terminals 102-1, 102-2 and 102-7. However, if mobile terminal 102-3, 102-4 and 102-5 through 102-n are out of the broadcast range, none of those mobile terminals will receive the broadcast routing table information from mobile terminals 102-6.
[0038] Each of the mobile terminals 102-1, 102-2 and 102-7 (or other nodes) that receive the routing table information from mobile terminal 102-6 can store all or a relevant portion of that routing table information in their respective memory 114. Typically, each node 102, 106 and 107 will perform a pruning operation to reduce the amount of routing table information that it stores in its memory 114 as can be appreciated by one skilled in the art.
[0039] It is also noted that when a node 102, 106 and 107 broadcasts the routing table information to its neighboring nodes 102, 106 and 107 the node 102, 106 and 107 can include routing table information pertaining to some or all of its neighboring nodes 102, 106 and 107 that it has previously received from them and has stored in its memory 114. Accordingly, a node 102, 106 and 107 receiving the broadcast routing table information from another node 102, 106 and 107 also receives some information pertaining to the routing capabilities of the neighbors of that other node 102, 106 and 107. For example, when mobile terminal 102-2 broadcasts its routing table information, assuming that mobile terminals 102-1 and 102-3 through 102-7 are within the RF range, those node will receive the routing table information from mobile terminal 102-2 and update their routing tables accordingly. This routing table information can include information pertaining to, for example, mobile terminals 102-1, 102-6 and 102-7, which are out of RF range of some nodes, such as mobile terminal 102-3. Hence, mobile terminal 102-3 can receive routing information pertaining to mobile terminals 102-1, 102-6 and 102-7 via the routing table information broadcast by mobile terminal 102-2. In this event, a node can store in its memory 114 routing information pertaining to nodes that are several away. It is noted that a hop is simply a link between two points in a route. That is, a routing path that traverses several nodes will have a “hop” between each node.
[0040] An example of the manner in which a mobile terminal 102 can communicate data packets to another mobile terminal 102 in accordance with an embodiment of the present invention will now be described with reference to FIGS. 4–12 . Specifically, an RTS (request to send)/CTS (clear to send) handshake exchange is often used in wireless ad-hoc CSMA/CA networks to mitigate against the so-called “hidden node problem”, which is described in a publication by Kleinrock Leonard entitled “Packet Switching in Radio Channels: Part I—Carrier Sense Multiple Access Modes and Their Throughput-Delay Characteristics”, IEEE Transactions on Communications, Vol. Com-23, No. 12, December, 1975, and in a publication by Phil Karn, entitled “MACA—A New Channel Access Method for Packet Radio”, the entire contents of both of these publications being incorporated herein by reference. Furthermore, in network 100, the RTS/CTS message exchange is also used to exchange channel information (for multi-channel CSMA), code information (for code division multiplexing), and power control information among other purposes. According to an embodiment of the present invention, a new and modified RTS (RTSn) and modified CTS (CTSn) message pair that includes additional unicast addressing fields is used.
[0041] As discussed in the Background section above, conventional RTS/CTS messages use a single unicast or broadcast addressing scheme. However, the present invention provides for an additional two sets of k unicast addresses, where k equals the maximum number of routes available per route entry in the mobile terminal's 102 route table. This allows a mobile terminal 102 to narrowcast to a set of k first-hop neighbors and to remotely deliver the packet to its destination by up to k last hop neighbors of the destination node.
[0042] The present invention can be applied to but is not limited to any popular ad-hoc routing algorithm such as those based on link state routing and/or distance vector approaches. The present invention can be further practiced with routing algorithms that use MAC layer addresses in their routing tables. The present invention can be further practiced when on demand routing is used or when network directed routing is used.
[0043] An example of the manner in which a mobile terminal 102 can determine the surrounding macroscopic mobile terminals 102 can be understood with reference to FIGS. 6A and 6B . In FIG. 6A it can be assumed that mobile terminal (MT) A (origination terminal 102) has been determined to be highly mobile by some means (possibly by using location triangulation or other suitable methods). It is also assumed that MT A is in communication with MT B (destination terminal 102). Normally, the routing algorithm for ad-hoc networks will maintain a number of alternative routes to a given destination. In the case where multicast routing occurs, routes may overlap considerably, that is, the intermediate nodes will be the same. In other cases, the routes may remain fairly independent from end-to-end. The present invention uses k to designate the maximum number of simultaneously maintained routes to a given host. If multiple routes use the same first hop, the route is of little use for macro-diversity, so this address is not used in the narrowcast transmission. Since MT A is highly mobile, it is desirable for MT A to request a narrow cast of its packet via all k routes to the surrounding macroscopic mobile terminals 102. Each of the k destinations will respond with a specially formatted CTS message, if the surrounding macroscopic mobile terminals 102 can participate in the narrowcast redirection of the packet. If a destination MT cannot participate, it sends an NCTS message to MT A indicating that it can not participate. This message exchange is illustrated in FIG. 6B . The new or modified narrowcast RTS and CTS messages are marked as RTSn and CTSn respectively.
[0044] With reference to FIG. 6B , the idea is to get the first hop out of the mobile onto a more stable link, where the fading due to high mobility, will not degrade its first hop onto the network. This is done through message redundancy by narrowcasting messages to and from highly mobile nodes. Specifically, the surrounding terminals 102 are used to simultaneously transmit messages to the destination terminal 102.
[0045] Overall, a mobile terminal 102 in an ad-hoc network 100 will usually maintain a collection of routes to any given host, so that if one route is lost the other routes can be used. The embodiments of present invention take advantage of this knowledge in a pro-active manner. Commonly used channel modulation methods such as QPSK or QAM-16 have bit error rates that are directly related to the signal-to-noise ratio of the channel being used. Typical measurements in CDMA networks show high speed mobiles will often experience 10−2 BERs. With reference to FIG. 6B , applying macroscopic selection and diversity, for example, three independent 10−2 links can be combined to form a 10−6 BER link. Similar gains can be realized in the first and last hop of highly mobile ad-hoc terminals. Stations that hear the RTS/CTS exchange are “supposed” to go dormant during the packet exchange they heard about, provided they are not using another channel as in the case of a multi-channel CSMA/CA system. However, the embodiments of present invention use these stations as macroscopic diversity combiners of the data packets so that fast moving mobile terminals 102 will be guaranteed seamless coverage. This technique is preferably used on mobile terminals 102 that are highly mobile.
[0046] It will be noted that embodiments of the present invention introduce no extra routing overhead, since only routes that have already been discovered are used. The assumption is that an on demand or distance vector or link state ad-hoc routing algorithm is populating the routing table, and the technique is simply taking advantage of this. The present invention also does not degrade network performance noticeably since the mobile terminals 102 that heard the RTS/CTS exchange were to remain idle anyway. It should also be noted that data packets may have had to be re-transmitted anyway due to errors caused by fading. Additionally, there is minimal network overhead for the RTSn since it only needs to be sent once physically (i.e. through narrowcast by a packet sender. At the destination, the packets will need to be sent individually, since typically there is no global synchronization in ad hoc networks.
[0047] More specifically, prior to sending packets to a mobile terminal A, the mobile terminal B normally has no knowledge of the high mobility of the mobile terminal A and thus no knowledge of the surrounding macroscopic terminals MT 1, MT 2, and MT 3. In accordance with an embodiment of the present invention, for the destination node to know about the macroscopic terminals surrounding the origination node so that they can be used in the reverse direction as macroscopic distribution nodes, end-to-end meta-data is placed in the data payload portion of the data packet to indicate the presence of such macroscopic terminals to the destination mobile terminal. This information is only inserted into the payload as meta-data when the information changes, that is, if one or more macroscopic terminals are no longer initial nodes of the preferred k paths used by terminal A, or when the network topology around terminal A changes.
[0048] In the example system of FIG. 6A , when MT A first establishes the condition that it will be using MTs 1, 2 and 3 as macro-diversity repeaters, it forwards this information in meta-data inside the data packet payload to MT B. MT B will then use the new RTSn and CTSn structure when forwarding packets. If MT is B is also a high speed node it will use the same addressing scheme MT A uses upon its own packet originations. This manner the link behavior is symmetrical and progressive towards macro-diversity as needed.
[0049] Unlike a conventional RTS/CTS message which only contains unicast source and destination and broadcasting structures, the RTS/CTS messages according to embodiments of the present invention include additional fields. In terms of the RTS messages, the RTS messages are modified in the following manner with reference to FIG. 12 . Specifically, a RTSnf message includes a first hop narrow cast address set, an RTSn1 message contains a last hop narrow cast address set, and an RTSnf1 message contains both the first and last hop narrow cast address set. The messaging type selected by a mobile terminal 102 varies based on the mobility of the communicating terminals 102. For example, highly mobile terminals can require at a minimum RTSnf addressing and can upgrade to RTSnf1 upon discovering the last hops route via the meta-data in the data packet payload.
[0050] Similarly, the CTS messages are modified in the following manner. That is, a CTSnf message includes a first hop narrow cast address set, a CTSn1 message contains a last hop narrow cast address set, and a CTSnf1 message contains both the first and last hop narrow cast address set.
[0051] FIG. 8 depicts an exemplary call flow diagram illustrating messaging initiated by an origination terminal to surrounding macroscopic terminals according to an embodiment of the present invention. Specifically, the macro-diversity embodiment uses packet selection, or symbol combining. The origination mobile terminal 102 preferably unicasts the packets to surrounding macroscopic mobile terminals 102. The overhead for this embodiment of the present invention is minimal, i.e. k−1 CTSn messages and has a slightly larger RTS message. The value k is typically quite small, for example, 2 to 5 routes.
[0052] The embodiment of the invention will now be further described with reference to the call flow diagram of FIG. 8 . At step 200 the origination mobile terminal 102 (A in FIGS. 6A and 6B ) communicates a modified RTS message to each of the three surrounding macroscopic mobile terminals 102 (1, 2 and 3 in FIGS. 6A and 6B). At step 202 the first macroscopic mobile terminal 102 communicates a modified CTS message to the origination mobile terminal 102. The origination mobile terminal 102 responds by communicating data to the first macroscopic mobile terminal 102 at step 204. This process is repeated by each of the macroscopic surrounding mobile terminals 102 where each one of the macroscopic mobile terminals 102 first communicates a modified CTS message informing the origination mobile terminal 102 that it is clear to send data. The origination mobile terminal 102 then separately sends the data to each of the macroscopic mobile terminals 102 after receiving the modified CTS message from each macroscopic mobile terminal 102. In other words, after a surrounding macroscopic terminal sends a modified CTS message, the originating terminal 102 sends data. The originating terminal 102 does not wait for all the terminals to send a modified CTS message. Rather, the data is sent to each surrounding macroscopic terminal as it transmits a modified CTS message.
[0053] After receiving the data, the macroscopic mobile terminals 102 forward the data in a conventional manner using conventional RTS/CTS message exchanges. Of course, the macroscopic terminals retain the option to also use narrowcast addressing so that macroscopic gain is realized by them as well. This decision can be made based on relative mobility or other metrics.
[0054] FIG. 9 depicts an exemplary call flow diagram illustrating messaging initiated by the surrounding macroscopic terminals (1, 2 and 3 in FIGS. 6A and 6B ) to origination terminal (A in FIGS. 6A and 6B ) according to an embodiment of the present invention. Specifically, embodiment of the present invention is demonstrated in this example by using packet selection, or symbol combining. With reference to the call flow diagram of FIG. 9 , at step 214, the first surrounding macroscopic mobile terminal 102 initiates communication with the origination mobile terminal 102 by transmitting a modified RTS message informing the origination mobile terminal 102 that the first macroscopic mobile terminal 102 has data it wants to send to the origination mobile terminal 102. The origination mobile terminal 102 responds at step 216, by sending a modified CTS message informing the first macroscopic mobile terminal 102 that it is clear to send data. At step 218, the first macroscopic mobile terminal 102 transmits the data to the origination mobile terminal 102. The originating terminal and each of the remaining macroscopic mobile terminals 102 repeats these processes as shown in steps 220 through 230.
[0055] Data is routed separately, and pre-decoded soft-symbols are buffered into the modem for a fixed amount of time. Combining is then performed to decode the message. Thus, macro-diversity is achieved at the symbol level.
[0056] As can be appreciated by one skilled in the art, combining is only necessary when the BER associated with the received packet prevents it from being properly decoded. The destination terminal may therefore perform packet selection to accelerate the routing process.
[0057] FIG. 10 depicts an exemplary call flow diagram illustrating messaging initiated by an origination terminal (A in FIGS. 6A and 6B ) to surrounding macroscopic terminals (1, 2 and 3 in FIGS. 6A and 6B ) according to an embodiment of the present invention. Specifically, the embodiment of the present invention is demonstrated using maximum-ratio combining. At step 232, the origination mobile terminal 102 transmits a modified RTS unicast message to each one of the surrounding macroscopic mobile terminals 102. In response to the unicast message, at steps 234, 236 and 238, each one of the communicates a separate modified CTS message to the origination mobile terminal 102. The originating mobile terminal 102 waits to receive CTSn messages from all surrounding macroscopic mobile terminals 102 before sending data. At step 240, the originating mobile terminal transmits one copy of the data message. The data packet only needs to be sent once since each one of the surrounding macroscopic mobile terminals 102 communicated a modified CTS (CTSn) message.
[0058] FIG. 11 depicts an exemplary call flow diagram illustrating messaging initiated by an the surrounding macroscopic terminals to an origination terminal according to an embodiment of the present invention using maximum-ratio combining. The invention operates in the following manner. At steps 242, 244 and 246, the surrounding macroscopic mobile terminals 102 transmit modified RTS messages to the origination mobile terminal 102. In response to receiving the messages, the origination mobile terminal transmits a unicast modified CTS message to the surrounding macroscopic mobile terminals 102. At step 250, the surrounding macroscopic mobile terminals 102 transmit the same data to the origination mobile terminal 102. Data is transmitted within the RAKE window of the maximum-ratio combiner. Thus, macro-diversity is achieved at the radio frequency (RF) level.
[0059] It will be noted that the surrounding macroscopic mobile terminals 102 are sending the same data. However, since the origination mobile terminal 102 can be moving, Rayleigh fading can occur. By performing maximum-ratio combining, an improved signal is gained as seen in FIG. 7 where the affects of Rayleigh fading is not as great as the Rayleigh fading as shown in FIGS. 1A–1C in the Background section above.
[0060] It will be noted that although the call flows of FIGS. 8–10 were described in the context of the origination mobile terminal, the invention is equally applicable to the destination mobile terminal 102. It will also be appreciated by those skilled in the art that the present invention can be practiced using multi-cast addressing schemes without departing from the scope of the present invention. The presently-disclosed technique also addresses the issue of extended signal dropout in the case of a slow-moving or stationary radio encountering a spatial null in the signal field arriving from a single transmitter. Also, techniques as described in the publication by Phillip D. Neumiller, Peter L. Lei, and Michael L. Needham, entitled “Open Base Station Transport (OBAST) Architecture, Mobile Computing and Communications Review”, ACM-SIGMOBILE, Vol. 4, No. 3, July, 2000, which is herein incorporated by reference, could be applied to cellular ad hoc hybrid architectures.
[0061] Additionally, although only a few exemplary embodiments of the present invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. Accordingly, all such modifications are intended to be included within the scope of this invention as defined in the following claims.
Claims
What is claimed is:
1. A method for transmitting a data packet from a mobile node in a mobile ad-hoc communications network, said data packet being addressed to a destination node in said network, the method comprising:
transmitting a request to send message from said mobile node directed to a plurality of relay nodes in said network;
receiving by said mobile node a respective clear to send message from at least one of said plurality of relay nodes;
transmitting said data packet from said mobile node to said at least one of said plurality of relay nodes;
forwarding said data packet from each of said at least one of said plurality of relay nodes to said destination node via a set of available routes in said network;
receiving at least one realization of said data packet at said destination node via at least one of said available routes; and
processing said received at least one realization of said destination node to minimize a likelihood of packet error.
2. A method as claimed in claim 1, wherein:
when said destination node receives a plurality of realizations of said data packet in a Rake window, said destination node combines said plurality of realizations of said data packet; and
when said destination node receives a plurality of realizations of said data packet outside of said Rake window, said destination node buffers said plurality of realizations of said data packet in a delay jitter buffer and selects one of said plurality of realizations of said data packet meeting a certain criteria.
3. A method as claimed in claim 1, wherein:
said data packet transmitting multicasts said data packet to said at least one of said plurality of relay nodes.
4. A method as claimed in claim 1, wherein:
said request to send message and said clear to send messages each include unicast addressing information representing said set of available routes in said network via which to route said data packet to said destination node, each of said available routes including at least one of said plurality of relay nodes.
5. A method for communicating a data packet addressed to a destination node from a plurality of relay nodes in a mobile ad-hoc communications network to said destination node in said network, the method comprising:
transmitting a request to send message from each of said plurality of relay nodes in said network to said destination node;
transmitting a clear to send message from said destination node to at least one of said plurality of relay nodes;
transmitting said data packet from at least two of said plurality of relay nodes in said network to said destination node via a set of available routes in said network;
receiving at least one realization of said data packet at said destination node via at least one of said available routes; and
processing said received at least one realization of said destination node to minimize a likelihood of packet error.
6. A mobile node in a mobile ad-hoc communications network, adapted to transmit a data packet being addressed to a destination node in said network, said mobile node comprising:
a transmitter, for transmitting a request to send message from said mobile node directed to a plurality of relay nodes in said network; and
a controller, for receiving a respective clear to send message from at least one of said plurality of relay nodes, and further for controlling said transmitter to transmit said data packet to said at least one of said plurality of relay nodes in said network in response to receiving said respective clear to send message,
wherein said request to send message and said clear to send messages each includes unicast addressing information representing a set of available routes in said network via which to route said data packet to said destination node, each of said available routes including at least one of said plurality of relay nodes.
7. A mobile node as claimed in claim 6, wherein:
said transmitter multicasts said data packet to said at least one of said plurality of relay nodes.
8. A mobile ad-hoc communications network, comprising:
a mobile node; and
a plurality of relay nodes, being within broadcast distance of said mobile node;
said plurality of relay nodes comprising means for transmitting a request to send message to said mobile node in said network;
said mobile node comprising means for transmitting a clear to send message to at least one of said plurality of relay nodes acknowledging said mobile node will receive a data packet from said at least one of said plurality of relay nodes,
wherein said request to send messages and said clear to send message each includes unicast addressing information representing a set of available routes in said network via which to route said data packet to said mobile node, each of said available routes including at least one of said plurality of relay nodes; and
each of said at least one of said plurality of relay nodes comprising means for transmitting said data packet to said mobile node upon receiving a respective said clear to send message from said mobile node via at least one of said available routes.
9. A mobile ad-hoc communications network as claimed in claim 8, wherein:
said at least one of said plurality of relay nodes transmits said data packet to said mobile node after every one of said at least one of said plurality of relay nodes has received a respective said clear to send message from said mobile node.
10. A mobile ad-hoc communications network as claimed in claim 8, wherein:
at least one of said plurality of relay nodes is mobile.
Patent Citations (127)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4494192(A) | 1985-01-01 | Lew et al. | Applicant |
| US4617656(A) | 1986-10-01 | Kobayashi et al. | Applicant |
| US4736371(A) | 1988-04-01 | Tejima et al. | Applicant |
| US4742357(A) | 1988-05-01 | Rackley | Applicant |
| US4747130(A) | 1988-05-01 | Ho | Applicant |
| US4910521(A) | 1990-03-01 | Mellon | Applicant |
| US5034961(A) | 1991-07-01 | Adams | Applicant |
| US5068916(A) | 1991-11-01 | Harrison et al. | Applicant |
| US5231634(A) | 1993-07-01 | Giles et al. | Applicant |
| US5233604(A) | 1993-08-01 | Ahmadi et al. | Applicant |
| US5241542(A) | 1993-08-01 | Natarajan et al. | Applicant |
| US5317566(A) | 1994-05-01 | Joshi | Applicant |
| US5392450(A) | 1995-02-01 | Nossen | Applicant |
| US5412654(A) | 1995-05-01 | Perkins | Applicant |
| US5424747(A) | 1995-06-01 | Chazelas | Applicant |
| US5502722(A) | 1996-03-01 | Fulghum | Applicant |
| US5517491(A) | 1996-05-01 | Nanni et al. | Applicant |
| US5555425(A) | 1996-09-01 | Zeller et al. | Applicant |
| US5555540(A) | 1996-09-01 | Radke | Applicant |
| US5572528(A) | 1996-11-01 | Shuen | Applicant |
| US5615212(A) | 1997-03-01 | Ruszczyk et al. | Applicant |
| US5618045(A) | 1997-04-01 | Kagan et al. | Applicant |
| US5621732(A) | 1997-04-01 | Osawa | Applicant |
| US5623495(A) | 1997-04-01 | Eng et al. | Applicant |
| US5627976(A) | 1997-05-01 | McFarland et al. | Applicant |
| US5631897(A) | 1997-05-01 | Pacheco et al. | Applicant |
| US5644576(A) | 1997-07-01 | Bauchot et al. | Applicant |
| US5652751(A) | 1997-07-01 | Sharony | Applicant |
| US5680392(A) | 1997-10-01 | Semaan | Applicant |
| US5684794(A) | 1997-11-01 | Lopez et al. | Applicant |
| US5687194(A) | 1997-11-01 | Paneth et al. | Applicant |
| US5696903(A) | 1997-12-01 | Mahany | Applicant |
| US5701294(A) | 1997-12-01 | Ward et al. | Applicant |
| US5706428(A) | 1998-01-01 | Boer et al. | Applicant |
| US5717689(A) | 1998-02-01 | Ayanoglu | Applicant |
| US5721725(A) | 1998-02-01 | Want et al. | Examiner |
| US5745483(A) | 1998-04-01 | Nakagawa et al. | Applicant |
| US5774876(A) | 1998-06-01 | Wooley et al. | Applicant |
| US5781540(A) | 1998-07-01 | Malcolm et al. | Applicant |
| US5787080(A) | 1998-07-01 | Hulyalkar et al. | Applicant |
| US5794154(A) | 1998-08-01 | Bar-On et al. | Applicant |
| US5796732(A) | 1998-08-01 | Mazzola et al. | Applicant |
| US5796741(A) | 1998-08-01 | Saito et al. | Applicant |
| US5805593(A) | 1998-09-01 | Busche | Applicant |
| US5805842(A) | 1998-09-01 | Nagaraj et al. | Applicant |
| US5805977(A) | 1998-09-01 | Hill et al. | Applicant |
| US5809518(A) | 1998-09-01 | Lee | Applicant |
| US5822309(A) | 1998-10-01 | Ayanoglu et al. | Applicant |
| US5828659(A) | 1998-10-01 | Teder et al. | Examiner |
| US5844905(A) | 1998-12-01 | McKay et al. | Applicant |
| US5845097(A) | 1998-12-01 | Kang et al. | Applicant |
| US5857084(A) | 1999-01-01 | Klein | Applicant |
| US5870350(A) | 1999-02-01 | Bertin et al. | Applicant |
| US5877724(A) | 1999-03-01 | Davis | Applicant |
| US5881095(A) | 1999-03-01 | Cadd | Applicant |
| US5881372(A) | 1999-03-01 | Kruys | Applicant |
| US5886992(A) | 1999-03-01 | Raatikainen et al. | Applicant |
| US5896561(A) | 1999-04-01 | Schrader et al. | Applicant |
| US5903559(A) | 1999-05-01 | Acharya et al. | Applicant |
| US5909651(A) | 1999-06-01 | Chander et al. | Applicant |
| US5936953(A) | 1999-08-01 | Simmons | Applicant |
| US5943322(A) | 1999-08-01 | Mayor et al. | Applicant |
| US5987011(A) | 1999-11-01 | Toh | Applicant |
| US5987033(A) | 1999-11-01 | Boer et al. | Applicant |
| US5991279(A) | 1999-11-01 | Haugli et al. | Applicant |
| US6028853(A) | 2000-02-01 | Haartsen | Applicant |
| US6029217(A) | 2000-02-01 | Arimilli et al. | Applicant |
| US6034542(A) | 2000-03-01 | Ridgeway | Applicant |
| US6044062(A) | 2000-03-01 | Brownrigg et al. | Applicant |
| US6047330(A) | 2000-04-01 | Stracke, Jr. | Applicant |
| US6052594(A) | 2000-04-01 | Chuang et al. | Applicant |
| US6052752(A) | 2000-04-01 | Kwon | Applicant |
| US6064626(A) | 2000-05-01 | Stevens | Applicant |
| US6067291(A) | 2000-05-01 | Kamerman et al. | Applicant |
| US6072790(A) | 2000-06-01 | Neumiller et al. | Applicant |
| US6078566(A) | 2000-06-01 | Kikinis | Applicant |
| US6104712(A) | 2000-08-01 | Robert et al. | Applicant |
| US6108738(A) | 2000-08-01 | Chambers et al. | Applicant |
| US6115580(A) | 2000-09-01 | Chuprun et al. | Applicant |
| US6122690(A) | 2000-09-01 | Nannetti et al. | Applicant |
| US6130881(A) | 2000-10-01 | Stiller et al. | Applicant |
| US6132306(A) | 2000-10-01 | Trompower | Applicant |
| US6141559(A) | 2000-10-01 | Neumiller et al. | Applicant |
| US6147975(A) | 2000-11-01 | Bowman-Amuah | Applicant |
| US6163699(A) | 2000-12-01 | Naor et al. | Applicant |
| US6178337(B1) | 2001-01-01 | Spartz et al. | Applicant |
| US6192053(B1) | 2001-02-01 | Angelico et al. | Applicant |
| US6192230(B1) | 2001-02-01 | Van Bokhorst et al. | Applicant |
| US6208870(B1) | 2001-03-01 | Lorello et al. | Applicant |
| US6223240(B1) | 2001-04-01 | Odenwald et al. | Applicant |
| US6226283(B1) | 2001-05-01 | Neumiller et al. | Applicant |
| US6240294(B1) | 2001-05-01 | Hamilton et al. | Applicant |
| US6246875(B1) | 2001-06-01 | Seazholtz et al. | Applicant |
| US6249516(B1) | 2001-06-01 | Brownrigg et al. | Applicant |
| US6272117(B1) | 2001-08-01 | Choi et al. | Examiner |
| US6275707(B1) | 2001-08-01 | Reed et al. | Applicant |
| US6285892(B1) | 2001-09-01 | Hulyalkar | Applicant |
| US6304556(B1) | 2001-10-01 | Haas | Applicant |
| US6327300(B1) | 2001-12-01 | Souissi et al. | Applicant |
| US6349091(B1) | 2002-02-01 | Li | Applicant |
| US6349210(B1) | 2002-02-01 | Li | Applicant |
| US6370123(B1) | 2002-04-01 | Woo | Examiner |
| US6577613(B1) | 2003-06-01 | Ramanathan | Examiner |
| US7031293(B1) | 2006-04-01 | Srikrishna et al. | Examiner |
| US2001/0053699(A1) | 2001-12-01 | McCrady et al. | Applicant |
| US2002/0006123(A1) | 2002-01-01 | Angelico et al. | Examiner |
| US2002/0045435(A1) | 2002-04-01 | Fantaske | Examiner |
| US2002/0080768(A1) | 2002-06-01 | Garcia-Luna-Aceves et al. | Examiner |
| US2002/0167963(A1) | 2002-11-01 | Joa-Ng | Examiner |
| CA2132180 | 1996-03-01 | Applicant | |
| EP513841(A2) | 1992-11-01 | Applicant | |
| EP513841(A3) | 1992-11-01 | Applicant | |
| EP627827(A2) | 1994-12-01 | Applicant | |
| EP924890(A2) | 1999-06-01 | Applicant | |
| FR2683326 | 1993-07-01 | Applicant | |
| WO9608884 | 1996-03-01 | Applicant | |
| WO9724005 | 1997-07-01 | Applicant | |
| WO9839936 | 1998-09-01 | Applicant | |
| WO9912302 | 1999-03-01 | Applicant | |
| WO34932 | 2000-06-01 | Applicant | |
| WO110154 | 2001-02-01 | Applicant | |
| WO133770 | 2001-05-01 | Applicant | |
| WO135567 | 2001-05-01 | Applicant | |
| WO137481 | 2001-05-01 | Applicant | |
| WO137482 | 2001-05-01 | Applicant | |
| WO137483 | 2001-05-01 | Applicant | |
| WO235253 | 2002-05-01 | Applicant |
Non-Patent Literature (20)
- Spread spectrum medium access protocol with collision avoidance using controlled time of arrival□□Joa-Ng, M.; Communications, 2000. ICC 2000. 2000 IEEE International Conference on vol. 1, Jun. 18-22, 2000 pp. 408-414 vol. 1.Examiner
- Phil Karn, entitled “MACA—A New Channel Access Method for Packet Radio”.Applicant
- Wong et al., “Soft Handoffs in CDMA Mobile Systems”, Dec. 1997, IEEE Personal Communications.Applicant
- Wong et al., “A Pattern Recognition System for Handoff Algorithms”, Jul. 2000, IEEE Journal on Selected Areas in Communications, vol. 18, No. 7.Applicant
- Andras G. Valko, “Cellular IP: A New Approach to Internet Host Mobility”, Jan. 1999, ACM Computer Communication Review.Applicant
- Richard North, Dale Bryan and Dennis Baker, “Wireless Networked Radios: Comparison of Military, Commercial, and R&D Protocols”, Feb. 28-Mar. 3, 1999, 2nd Annual UCSD Conference on Wireless Communications, San Diego CA.Applicant
- Benjamin B. Peterson, Chris Kmiecik, Richard Hartnett, Patrick M. Thompson, Jose Mendoza and Hung Nguyen, “Spread Spectrum Indoor Geolocation”, Aug. 1998, Navigation: Journal of the Institute of Navigation, vol. 45, No. 2, summer 1998.Applicant
- Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu and Jorjeta Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, Oct. 25-30, 1998, Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking.Applicant
- C. David Young, “USAP: A Unifying Dynamic Distributed Multichannel TDMA Slot Assignment Protocol”.Applicant
- Chip Elliott and Bob Heile, “Self-Organizing, Sef-Healing Wireless Networks”, 2000 IEEE.Applicant
- J.J. Garcia-Luna-Aceves and Asimakis Tzamaloukas, “Reversing the Collision-Avoidance Handshake in Wireless Networks”.Applicant
- J.J. Garcia-Luna-Aceves and Marcelo Spohn, “Transmission-Efficient Routing in Wireless Networks Using Link-State Information”.Applicant
- J.J. Garcia-Luna-Aceves and Ewerton L. Madruga, “The Core-Assisted Mesh Protocol”, Aug. 1999, IEEE Journal on Selected Areas in Communications, vol. 17, No. 8.Applicant
- Ad Kamerman and Guido Aben, “Net Throughput with IEEE 802.11 Wireless LANs”.Applicant
- J.R. McChesney and R.J. Saulitis, “Optimization of an Adaptive Link Control Protocol for Multimedia Packet Radio Networks”.Applicant
- Ram Ramanathan and Regina Rosales-Hain, “Topology Control of Multihop Wireless Networks using Transmit Power Adjustment”.Applicant
- Ram Ramanathan and Martha E. Steenstrup, “Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support”.Applicant
- Martha E. Steenstrup, “Dynamic Multipoint Virtual Circuits for Multimedia Traffic in Multihop Mobile Wireless Networks”.Applicant
- Zhenyu Tang and J.J. Garcia-Luna-Aceves, “Collision-Avoidance Transmission Scheduling for AD-Hoc Networks”.Applicant
- George Vardakas and Wendell Kishaba, “QoS Networking With Adaptive Link Control and Tactical Multi-Channel Software Radios”.Applicant