CA2476516C - A system and method for using per-packet receive signal strength indication and transmit power levels to compute path loss for a link for use in layer ii routing in a wireless communication network - Google Patents
A system and method for using per-packet receive signal strength indication and transmit power levels to compute path loss for a link for use in layer ii routing in a wireless communication network Download PDFInfo
- Publication number
- CA2476516C CA2476516C CA2476516A CA2476516A CA2476516C CA 2476516 C CA2476516 C CA 2476516C CA 2476516 A CA2476516 A CA 2476516A CA 2476516 A CA2476516 A CA 2476516A CA 2476516 C CA2476516 C CA 2476516C
- Authority
- CA
- Canada
- Prior art keywords
- node
- value
- instructions
- link quality
- receiving
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000004891 communication Methods 0.000 title claims abstract description 71
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000035945 sensitivity Effects 0.000 claims abstract description 9
- 238000010586 diagram Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 2
- 239000002609 medium Substances 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000006163 transport media Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
- H04B17/318—Received signal strength
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/08—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/18—TPC being performed according to specific parameters
- H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/10—Small scale networks; Flat hierarchical networks
- H04W84/12—WLAN [Wireless Local Area Networks]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
A system and method for evaluating at least one communication link between a transmitting node and a receiving node in a communications network, such as a wireless ad-hoc communications network in accordance with the 802.11 standard. The system and method perform the operation of assigning respective link quality values to the respective communication links based on a transmit power level (TPL) value at which the respective data packets were transmitted by the transmitting node over the respective links, a received sensitivity (RS) value of the receiving node receiving the data packets, and a receive signal strength indication (RSSI) value provided by the network for each respective link. The system and method can examine a content of a data packet being sent between the two nodes to determine the TPL, and can receive the RSSI value from a physical layer of the communications network. Accordingly, the system and method can determine which link that additional data packets are to be sent by the transmitting node to the receiving node via the communication link based on the link quality values. Specifically, the link having the highest link quality value is selected.
Description
A System and Method for Using Per-Packet Receive Signal Strength Indication and Transmit Power Levels to Compute Path Loss for a Link for Use in Layer II Routing in a Wireless Communication Network BACKGROUND OF THE INVENTION
Field of the Invention:
[0001] The present invention relates to a system and method for using a receive signal strength indication and a transmit power level to determine the integrity of a link for use in Layer II routing in a network, such as an 802.11 network. More particularly, the present invention relates to a system and method for using indications of per-packet receive signal strengths and per-packet transmit power levels to compute path losses for links between nodes in a communication network, such as an 802.11 network, in order to select the most suitable link over which to send data packets between the nodes.
Description of the Related Art:
Field of the Invention:
[0001] The present invention relates to a system and method for using a receive signal strength indication and a transmit power level to determine the integrity of a link for use in Layer II routing in a network, such as an 802.11 network. More particularly, the present invention relates to a system and method for using indications of per-packet receive signal strengths and per-packet transmit power levels to compute path losses for links between nodes in a communication network, such as an 802.11 network, in order to select the most suitable link over which to send data packets between the nodes.
Description of the Related Art:
[0002] In recent years, a type of mobile communications network known as an "ad-hoc"
network has been developed. In this type of network, each user terminal (hereinafter "mobile node") is capable of operating as a base station or router for the other mobile nodes, thus eliminating the need for a fixed infrastructure of base stations.
Accordingly, data packets being sent from a source mobile node to a destination mobile node are typically routed through a number of intermediate mobile nodes before reaching the destination mobile node. Details of an ad-hoc network are set forth in U.S.
Patent No.
5,943,322 to Mayor.
network has been developed. In this type of network, each user terminal (hereinafter "mobile node") is capable of operating as a base station or router for the other mobile nodes, thus eliminating the need for a fixed infrastructure of base stations.
Accordingly, data packets being sent from a source mobile node to a destination mobile node are typically routed through a number of intermediate mobile nodes before reaching the destination mobile node. Details of an ad-hoc network are set forth in U.S.
Patent No.
5,943,322 to Mayor.
[0003] More sophisticated ad-hoc networks are also being developed which, in addition to enabling mobile nodes to communicate with each other as in a conventional ad-hoc network, further enable the mobile nodes to access a fixed network and thus communicate with other types of user terminals, such as those on the public switched telephone network (PSTN) and on other networks such as the Internet. Details of these types of ad-hoc networks are described in U.S. Patent No. 7,072,650 entitled "Ad Hoc Peer-to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks", issued on July 4, 2006, in U.S. Patent No. 6,807,165 entitled "Time Division Protocol for an Ad-Hoc, Peer-to-Peer Radio Network Having Coordinating Channel Access to Shared Parallel Data Channels with Separate Reservation Channel", issued on October 19, 2004, and in U.S. Patent No. 6,873,839 entitled "Prioritized-Routing for an Ad-Hoc, Peer-to-Peer, Mobile Radio Access System", issued on March 29, 2005.
[0004] As can be appreciated by one skilled in the art, when a node sends packetized data to a destination node, the node typically checks its routing table to determine whether the destination node is contained in its routing table. If the destination node is contained in the node's routing table, the data is transmitted via a path that leads to the destination node. If the destination node is not listed in the node's routing table, then the packet is sent to one or more other nodes listed in the node's routing table, and those other nodes determine if the destination table is listed in their routing tables. The process continues until the data packet eventually reaches the destination node.
[0005] In these types of ad-hoc networks, the algorithms that are used to determine the path of intermediate nodes via which the data packets are routed between source and destination nodes are typically based on the shortest distance between the source and destination nodes or, assuming that the data packet transport medium is wireless, the least power required to perform the routing. However, such algorithms do not necessarily produce a predictable delivery of data packets. For example, routing of data packets can be delayed due to congestion in intermediate nodes. Also, delivery failure of data packets can occur on noisy radio links between nodes. Moreover, because many of the nodes are mobile, the conditions of the links can be constantly changing.
[0006] In addition, other factors such as the signal strength at which a data-packet is received by a node over a link, as well as the power level at which the node finds it necessary to transmit a data-packet over the link, provide an indication of the integrity of the link. Currently, ad-hoc wireless communications networks, and especially those employing terminals which operate in accordance with 802.11 standards, do not take into account the received signal strength or the transmitted power level when determining the suitability of a link for use in sending data packets between nodes. Details of the 802.11 standards are set forth in ISO/IEC 8802-11, ANSI/IEEE 802.11 "Information Technology -Telecommunications and Information Exchange Between Systems -Local and Metropolitan Area Network Specific Requirements", Part 11: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications. Also, a description of the 802.11 standard is found in a book by Bob O'Hara and Al Petrick entitled IEEE 802.11 Handbook: A
Designer's Companion, IEEE, 1999.
Designer's Companion, IEEE, 1999.
[0007] Accordingly, a need exists for a system and method which enables wireless ad-hoc communications network, such as an 802.11 network, to evaluate the integrity of a link between nodes based on the strength at which a signal is received over the link and transmission power level at which a signal is transmitted over the link, in order to determine whether to use the link for data packet routing between the nodes.
SUMMARY OF THE INVENTION
SUMMARY OF THE INVENTION
[0008] An object of the present invention is to provide a system and method for computing the path loss along a link between nodes in a wireless ad-hoc communications network using transmitted power level information contained in a received data packet and the receive signal strength indication (RSSI) at which the data packet is received.
[0009] Another object of the present invention is to provide a system and method for enabling a node, such as a mobile user terminal, in a wireless communications network, such as an 802.11 network, to compute the path loss along a link between itself and another node using the per-packet RSSI and the per-packet transmitted power level of data packets received and transmitted over that link, to thus determine the suitability of that link.
[0010] A further object of the present invention is to provide a system and method that provides for improved communication between nodes in an ad-hoc wireless communications network, in particular, an 802.11 network, by allowing the nodes to select the path having the least loss as a medium for transporting packets.
[0011] These and other objects are substantially achieved by providing a system and method for evaluating at least one communication link between a transmitting node and a receiving node in a communications network, such as a wireless ad-hoc communications network in accordance with the 802.11 standard. The system and method perform the operation of assigning respective link quality values to the respective communication links based on a transmit power level (TPL) value at which the respective data packets were transmitted by the transmitting node over the respective links, a received sensitivity (RS) value of the receiving node receiving the data packets, and a receive signal strength indication (RSSI) value provided by the network for each respective link. The system and method can examine a content of a data packet being sent between the two nodes to determine the TPL, and can receive the RSSI value from a physical layer of the communications network. Accordingly, the system and method can determine which link that additional data packets are to be sent by the transmitting node to the receiving node via the communication link based on the link quality values. Specifically, the link having the highest link quality value is selected.
BRIEF DESCRIPTION OF THE DRAWINGS
BRIEF DESCRIPTION OF THE DRAWINGS
[0012] 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:
[0013] Fig. 1 is a block diagram of an example of an ad-hoc wireless communications network employing a system and method for evaluating the integrity of links between nodes according to an embodiment of the present invention;
[0014] Fig. 2 is a block diagram illustrating an example of components of a node employed in the network shown in Fig. 1;
[0015] Fig. 3 is a block diagram depicting a comparison of path loss for two routes between nodes in the ad-hoc wireless communications network shown in Fig. 1 according to an embodiment of the present invention; and
[0016] Figs. 4 and 5 are timing diagrams illustrating an example of operations performed for computing a quality value for a link between nodes in the network shown in Fig. 1 according to an embodiment of the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0017] Fig. 1 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 user terminals 102-1 through 102-n (referred to generally as nodes or mobile nodes 102), and a fixed network 104 having a plurality of access points 106-1, 106-2, ...106-n (referred to generally as nodes or access points 106), for providing the nodes 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 nodes 102 with access to other networks, such as other ad-hoc networks, the public switched telephone network (PSTN) and the Internet. The network 100 further includes a plurality of fixed routers 107-1 through 107-n (referred to generally as nodes or fixed routers 107) for routing data packets between other nodes 102, 106 or 107.
Specifically, the network 100 includes a plurality of mobile wireless user terminals 102-1 through 102-n (referred to generally as nodes or mobile nodes 102), and a fixed network 104 having a plurality of access points 106-1, 106-2, ...106-n (referred to generally as nodes or access points 106), for providing the nodes 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 nodes 102 with access to other networks, such as other ad-hoc networks, the public switched telephone network (PSTN) and the Internet. The network 100 further includes a plurality of fixed routers 107-1 through 107-n (referred to generally as nodes or fixed routers 107) for routing data packets between other nodes 102, 106 or 107.
[0018] 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 or 107 operating as a router or routers for data packets being sent between nodes 102, as described in U.S. Patent No. 5,943,322 to Mayor and in U.S. patent application Serial Nos. 09/897,790, 09/815,157 and 09/815,164, referenced above. Specifically, as shown in Fig. 2, 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 or 107, under the control of a controller 112. The packetized data signals can include, for example, voice, data or multimedia.
[0019] 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 or 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 broadcasting mechanism periodically, for example, when a new node 102 enters the network 100, or when existing nodes 102 in the network 100 move. A node 102, 106 or 107 will broadcast its routing table updates, and nearby nodes 102, 106 or 107 will only receive the broadcast routing table updates if within broadcast range (e.g., radio frequency (RF) range) of the broadcasting node 102, 106 or 107. For example, assuming that nodes 102-1, 102-2 and 102-7 are within the RF broadcast range of node 102-6, when node 102-6 broadcasts its routing table information, that information is received by nodes 102-1, 102-2 and 102-7. However, if nodes 102-3, 102-4 and 102-5 through 102-n are out of the broadcast range, none of those nodes will receive the broadcast routing table information from node 102-6.
[0020] An example of the manner in which the integrity of a link is evaluated in accordance with an embodiment of the present invention will now be discussed with reference to Figs. 1-4. Specifically, an embodiment of the present invention uses the available per-packet, receive signal strength indication (RSSI) from an 802.11 physical layer combined with the per-packet transmitted power level to evaluate the path loss along a link for a packet sent within the network 100, which in this example is an 802.11 wireless network as discussed in the Background section above.
[0021] The per-packet path loss is used as a metric that determines the integrity of a link between two 802.11-compliant nodes 102, 106 or 107, as well as the probability that future packets will be successfully transmitted on the link between the two nodes.
Routing algorithms in Layer II of the network 100, which is known as the switching layer as can be appreciated by one skilled in the art, can use this probability to eliminate links that have a low probability of successful packet delivery.
Routing algorithms in Layer II of the network 100, which is known as the switching layer as can be appreciated by one skilled in the art, can use this probability to eliminate links that have a low probability of successful packet delivery.
[0022] Referring to Fig. 3, four nodes 102-1, 102-2, 102-3 and 102-4, which are also identified as nodes NO, N1, N2 and N3, respectively, are depicted as forming two routes. The first route comprises nodes NO, N1 and N3, while the second route comprises nodes NO, N2 and N3. In this example, node NO is the origination node and node N34 is the destination node, while nodes N1 and N2 are intermediate nodes. An example of the manner in which an embodiment of the present invention computes path loss will now be discussed in detail with respect to Figs. 3-5.
[0023] As shown in Figs. 4 and 5, each node NO through N3 in the network 100 periodically broadcasts routing advertisements to other nodes within its broadcast range. In this example, node N3 broadcasts routing advertisements to nodes N2 and Ni which are within the broadcast range of node N3. A broadcast routing advertisement includes information in its header pertaining to the transmit power level (TPL) in Decibels (Dbm).
That is, prior to transmitting a packet, the controller 112 of node N3 causes this information to be included in the header of the packet. The RSSI is available from the 802.11 physical layer implementation Also, each node knows its receive sensitivity (RS), which is the lowest level signal strength at which a received signal containing a data packet can be received in order for the node to be able to successfully recover data from the received data packet. In other words, any signal received with a value less than the threshold RS value will be viewed as noise. The following equation represents an example of the manner in which the value of the link quality ratio (LQR) of the link from node N3 to node N2, and from node N3 to node Ni, can be calculated that yields a ratio which can be used to measure the per packet link quality between wireless nodes in the network 100:
LQR = 1 - (TPL (Dbm) - RSSI (Dbm))/ (TPL (Dbm) - RS (Dbm))
That is, prior to transmitting a packet, the controller 112 of node N3 causes this information to be included in the header of the packet. The RSSI is available from the 802.11 physical layer implementation Also, each node knows its receive sensitivity (RS), which is the lowest level signal strength at which a received signal containing a data packet can be received in order for the node to be able to successfully recover data from the received data packet. In other words, any signal received with a value less than the threshold RS value will be viewed as noise. The following equation represents an example of the manner in which the value of the link quality ratio (LQR) of the link from node N3 to node N2, and from node N3 to node Ni, can be calculated that yields a ratio which can be used to measure the per packet link quality between wireless nodes in the network 100:
LQR = 1 - (TPL (Dbm) - RSSI (Dbm))/ (TPL (Dbm) - RS (Dbm))
[0024] In this example, each node NO through N3 in Fig. 3 has a TPL value of 20 Dbm.
Node NO has an RS value of -90 Dbm, nodes N1 and N2 each have an RS value of -85 Dbm, and node N3 has an RS value of -95 Dbm. In this example, the RSSI for the link from node N3 to node N2 is -70 Dbm, and the RSSI for the link from node N3 to node Ni is -80 Dbm.
Accordingly, applying the LQR equation to the TPL, RS and RSSI values at node N2, a LQR
value can be calculated by the controller 112 of node N2 as follows:
1 - [((20 Dbm - (-70 Dbm))/(20 Dbm -(-85 Dbm))] = 0.142 LQR
Node NO has an RS value of -90 Dbm, nodes N1 and N2 each have an RS value of -85 Dbm, and node N3 has an RS value of -95 Dbm. In this example, the RSSI for the link from node N3 to node N2 is -70 Dbm, and the RSSI for the link from node N3 to node Ni is -80 Dbm.
Accordingly, applying the LQR equation to the TPL, RS and RSSI values at node N2, a LQR
value can be calculated by the controller 112 of node N2 as follows:
1 - [((20 Dbm - (-70 Dbm))/(20 Dbm -(-85 Dbm))] = 0.142 LQR
[0025] The RSSI value for the link between nodes N3 and N2 is -80 Dbm.
Applying the LQR equation as shown results in:
1 - [((20 Dbm - (-80 Dbm))I(20 Dbm - (-85 Dbm))] 0.048 LQR
Applying the LQR equation as shown results in:
1 - [((20 Dbm - (-80 Dbm))I(20 Dbm - (-85 Dbm))] 0.048 LQR
[0026] As indicated, the route from node N3 to node Ni has a higher LQR value that the route from node N3 to node N2, which indicates that the route from node N3 to node Ni has a higher integrity level and there is thus a higher probability that future packets taking this route will have better success than if they took the route from node N3 to node N2. As further shown in Figs. 4 and 5, node NI broadcasts a routing advertisement to nodes NO and N3 which are in the broadcast range of node Ni. Nodes NO and N3 calculate the respective LQR based on these received routing advertisements in the manner described above. It is further noted that the routing advertisements broadcast by node Ni includes information pertaining to the calculated LQR for the link from node N3 to node Ni. Node N2 also broadcasts a routing advertisement to nodes NO and N3 which are in the broadcast range of node N2. It is further noted that the routing advertisements broadcast by node N2 includes information pertaining to the calculated LQR for the link from node N3 to node N2.
[0027] The respective controllers 112 of nodes NO and N3 thus calculate the respective LQR based on these received routing advertisements in the manner described above. It is also noted that node NO is not shown as broadcasting any routing advertisements to any of the nodes within its broadcast range because, as discussed above, node NO in this example is an origination node that sends a data packet to a destination node N3, and thus its routing advertisements are irrelevant for purposes of this description.. However, like all nodes, node NO would broadcast routing advertisements to the nodes in its broadcast range.
[0028] Furthermore, because node NO is the origination node in this example, and is sending a data packet to destination node N3, the controller 112 -of node NO
also calculates the aggregate link quality ratio (ALQR) for the two paths, namely, the path including nodes NO, Ni and N3, and the path including nodes NO, Ni and N3. Hence, node 0 calculates the ALQR for the path including nodes NO, Ni and N3 by adding the LQRs for the links N3 to Ni and Ni to NO as calculated above. The ALQR for this path is calculated to be 0.135 as shown in Fig. 5. Similarly, node 0 calculates the ALQR for the path including nodes NO, N2 and N3 by adding the LQRs for the links N3 to N2 and N2 to NO as calculated above. The ALQR for this path is calculated to be 0.324 as shown in Fig. 5. Assuming that all other variables are equal, the controller 112 of node NO chooses the path having the highest ALQR, namely, the path including nodes NO, N2 and N3
also calculates the aggregate link quality ratio (ALQR) for the two paths, namely, the path including nodes NO, Ni and N3, and the path including nodes NO, Ni and N3. Hence, node 0 calculates the ALQR for the path including nodes NO, Ni and N3 by adding the LQRs for the links N3 to Ni and Ni to NO as calculated above. The ALQR for this path is calculated to be 0.135 as shown in Fig. 5. Similarly, node 0 calculates the ALQR for the path including nodes NO, N2 and N3 by adding the LQRs for the links N3 to N2 and N2 to NO as calculated above. The ALQR for this path is calculated to be 0.324 as shown in Fig. 5. Assuming that all other variables are equal, the controller 112 of node NO chooses the path having the highest ALQR, namely, the path including nodes NO, N2 and N3
[0029] As noted before, the check for LQR is done with the delivery of each packet.
Thus, the technique according to the embodiment of the present invention described above provides a means of determining the best route on a continuous basis.
Therefore, the mobility of the nodes 102 does not have a major effect on the quality of packet transmission for the wireless network 100. Furthermore, a running average of the LQR can be maintained by the source node NO to determine the probable link reliability and can be used in determining which potential route to select. That is, over time, the LQR of the respective links can be accumulated to provide a more statistically meaningful measure of the quality of the links.
Thus, the technique according to the embodiment of the present invention described above provides a means of determining the best route on a continuous basis.
Therefore, the mobility of the nodes 102 does not have a major effect on the quality of packet transmission for the wireless network 100. Furthermore, a running average of the LQR can be maintained by the source node NO to determine the probable link reliability and can be used in determining which potential route to select. That is, over time, the LQR of the respective links can be accumulated to provide a more statistically meaningful measure of the quality of the links.
[0030] It can be assumed that future packets taking the selected route will also have a higher LQR value. However, as noted above, the check for LQR values is done continuously. Therefore, future selected routes can change based on the LQR
values changing for presently used routes. For example, presently used routes can have LQR values that diminish. In another example, presently used routes can maintain the same LQR value, but unused routes can have an increase in LQR value.
values changing for presently used routes. For example, presently used routes can have LQR values that diminish. In another example, presently used routes can maintain the same LQR value, but unused routes can have an increase in LQR value.
[0031] It will also be appreciated by those skilled in the art that although the technique is described above in relation to 802.11 protocols, the technique invention can be modified to include other protocols and still fall within the scope of the present invention. For example, the techniques described above can be employed in other types of wireless mediums, such as Home RF, Bluetooth, and so on.
[0032] 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 (48)
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. A system, for use in a communications network, for evaluating at least one communication link between a transmitting node and a receiving node in the communications network, the system comprising:
a processor, for assigning a link quality value to said communication link based on a transmit power level (TPL) value at which a data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving the data packet, and a receive signal strength indication (RSSI) value provided by said network; and wherein said processor calculates said link quality value as a link quality ratio (LQR) represented by the equation LQR=1-(TPL-RSSI)/(TPL-RS).
a processor, for assigning a link quality value to said communication link based on a transmit power level (TPL) value at which a data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving the data packet, and a receive signal strength indication (RSSI) value provided by said network; and wherein said processor calculates said link quality value as a link quality ratio (LQR) represented by the equation LQR=1-(TPL-RSSI)/(TPL-RS).
2. A system as claimed in claim 1, further comprising:
a packet analyzer, for examining a content of the data packet being sent between said two nodes to determine said TPL.
a packet analyzer, for examining a content of the data packet being sent between said two nodes to determine said TPL.
3. A system as claimed in claim 1, wherein:
said processor receives said RSSI value from a physical layer of said communications network.
said processor receives said RSSI value from a physical layer of said communications network.
4. A system as claimed in claim 1, wherein:
said processor determines whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
said processor determines whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
5. A system as claimed in claim 1, wherein:
said network includes an ad-hoc wireless communications network; and said processor assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
said network includes an ad-hoc wireless communications network; and said processor assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
6. A system as claimed in claim 1, wherein:
said network includes an 802.11-type network; and said processor assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
said network includes an 802.11-type network; and said processor assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
7. A system as claimed in claim 1, wherein:
said processor assigns a respective said link quality value to each respective one of said communication links between said transmitting and receiving nodes.
said processor assigns a respective said link quality value to each respective one of said communication links between said transmitting and receiving nodes.
8. A system as claimed in claim 7, wherein:
said processor selects one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
said processor selects one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
9. A system as claimed in claim 8, wherein:
said processor selects as said selected route one of said communications links having the highest link quality value.
said processor selects as said selected route one of said communications links having the highest link quality value.
10. A system as claimed in claim 1, wherein:
said processor assigns said link quality value on a per packet basis.
said processor assigns said link quality value on a per packet basis.
11. A method for evaluating at least one communication link between a transmitting node and a receiving node in a communications network, the method comprising:
assigning a link quality value to said communication link based on a transmit power level (TPL) value at which a data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving the data packet, and a receive signal strength indication (RSSI) value provided by said network; and wherein said assigning calculates said link quality value as a link quality ratio (LQR) represented by the equation LQR=1-(TPL-RSSI)/(TPL-RS).
assigning a link quality value to said communication link based on a transmit power level (TPL) value at which a data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving the data packet, and a receive signal strength indication (RSSI) value provided by said network; and wherein said assigning calculates said link quality value as a link quality ratio (LQR) represented by the equation LQR=1-(TPL-RSSI)/(TPL-RS).
12. A method as claimed in claim 11, further comprising:
examining a content of the data packet being sent between said two nodes to determine said TPL.
examining a content of the data packet being sent between said two nodes to determine said TPL.
13. A method as claimed in claim 11, further comprising:
receiving said RSSI value from a physical layer of said communications network.
receiving said RSSI value from a physical layer of said communications network.
14. A method as claimed in claim 11, further comprising:
determining whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
determining whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
15. A method as claimed in claim 11, wherein:
said network includes an ad-hoc wireless communications network; and said assigning assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
said network includes an ad-hoc wireless communications network; and said assigning assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
16. A method as claimed in claim 11, wherein:
said network includes an 802.11-type network; and said assigning assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
said network includes an 802.11-type network; and said assigning assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
17. A method as claimed in claim 11, wherein:
said assigning assigns a respective said link quality value to each respective one of said communication links between said transmitting and receiving nodes.
said assigning assigns a respective said link quality value to each respective one of said communication links between said transmitting and receiving nodes.
18. A method as claimed in claim 17, further comprising:
selecting one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
selecting one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
19. A method as claimed in claim 18, wherein:
said selecting selects as said selected route one of said communications links having the highest link quality value.
said selecting selects as said selected route one of said communications links having the highest link quality value.
20. A method as claimed in claim 11, wherein:
said assigning assigns said link quality value on a per packet basis.
said assigning assigns said link quality value on a per packet basis.
21. A computer-readable medium of instructions, for use with a communications network for evaluating at least one communication link between a transmitting node and a receiving node in the communications network, the instructions comprising:
a first set of instructions, for assigning a link quality value to said communication link based on a transmit power level (TPL) value at which a data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving the data packet, and a receive signal strength indication (RSSI) value provided by said network; and wherein said first set of instructions calculates said link quality value as a link quality ratio (LQR) represented by the equation LQR=1-(TPL-RSSI)/(TPL-RS).
a first set of instructions, for assigning a link quality value to said communication link based on a transmit power level (TPL) value at which a data packet was transmitted by said transmitting node, a received sensitivity (RS) value of said receiving node receiving the data packet, and a receive signal strength indication (RSSI) value provided by said network; and wherein said first set of instructions calculates said link quality value as a link quality ratio (LQR) represented by the equation LQR=1-(TPL-RSSI)/(TPL-RS).
22. A computer-readable medium of instructions as claimed in claim 21, further comprising:
a second set of instructions, for examining a content of the data packet being sent between said two nodes to determine said TPL.
a second set of instructions, for examining a content of the data packet being sent between said two nodes to determine said TPL.
23. A computer-readable medium of instructions as claimed in claim 21, further comprising:
a third set of instructions, for obtaining said RSSI value from a physical layer of said communications network.
a third set of instructions, for obtaining said RSSI value from a physical layer of said communications network.
24. A computer-readable medium of instructions as claimed in claim 21, further comprising:
a fourth set of instructions, for determining whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
a fourth set of instructions, for determining whether additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
25. A computer-readable medium of instructions as claimed in claim 21, wherein:
said network includes an ad-hoc wireless communications network; and said first set of instructions assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
said network includes an ad-hoc wireless communications network; and said first set of instructions assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless nodes in said ad-hoc wireless communications network.
26. A computer-readable medium of instructions as claimed in claim 21, wherein:
said network includes an 802.11-type network; and said first set of instructions assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
said network includes an 802.11-type network; and said first set of instructions assigns said link quality value to said communication link between said transmitting and receiving nodes which are each wireless 802.11-type nodes in said 802.11-type network.
27. A computer-readable medium of instructions as claimed in claim 21, wherein:
said first set of instructions assigns a respective said link quality value to each respective one of said communication links between said transmitting and receiving nodes.
said first set of instructions assigns a respective said link quality value to each respective one of said communication links between said transmitting and receiving nodes.
28. A computer-readable medium of instructions as claimed in claim 27, further comprising:
a fifth set of instructions, for selecting one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
a fifth set of instructions, for selecting one of said communication links as a selected route via which additional data packets are to be sent by said transmitting node to said receiving node via said communication link based on said link quality value.
29. A computer-readable medium of instructions as claimed in claim 28, wherein:
said fifth set of instructions selects as said selected route one of said communications links having the highest link quality value.
said fifth set of instructions selects as said selected route one of said communications links having the highest link quality value.
30. A computer-readable medium of instructions as claimed in claim 21, wherein:
said first set of instructions assigns said link quality value on a per packet basis.
said first set of instructions assigns said link quality value on a per packet basis.
31. A system as claimed in claim 1, wherein:
said processor is employed in said receiving node.
said processor is employed in said receiving node.
32. A system as claimed in claim 31, wherein:
said receiving node is a mobile wireless node in said communications network.
said receiving node is a mobile wireless node in said communications network.
33. A system as claimed in claim 5, wherein:
said processor is employed in said receiving node.
said processor is employed in said receiving node.
34. A system as claimed in claim 33, wherein:
said receiving node is mobile.
said receiving node is mobile.
35. A system as claimed in claim 6, wherein:
said processor is employed in said receiving node.
said processor is employed in said receiving node.
36. A system as claimed in claim 35, wherein:
said receiving node is mobile.
said receiving node is mobile.
37. A method as claimed in claim 11, wherein:
said receiving node performs said assigning step.
said receiving node performs said assigning step.
38. A method as claimed in claim 37, wherein:
said receiving node is a mobile wireless node in said communications network.
said receiving node is a mobile wireless node in said communications network.
39. A method as claimed in claim 15, wherein:
said receiving node performs said assigning step.
said receiving node performs said assigning step.
40. A method as claimed in claim 39, wherein:
said receiving node is mobile.
said receiving node is mobile.
41. A method as claimed in claim 16, wherein:
said receiving node performs said assigning step.
said receiving node performs said assigning step.
42. A method as claimed in claim 41, wherein:
said receiving node is mobile.
said receiving node is mobile.
43. A computer-readable medium of instructions as claimed in claim 21, wherein:
said first set of instructions controls said receiving node to assign the link quality value to said communication link based on the transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, the received sensitivity (RS) value of said receiving node receiving said data packet, and the receive signal strength indication (RSSI) value provided by said network.
said first set of instructions controls said receiving node to assign the link quality value to said communication link based on the transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, the received sensitivity (RS) value of said receiving node receiving said data packet, and the receive signal strength indication (RSSI) value provided by said network.
44. A computer-readable medium of instructions as claimed in claim 43, wherein:
said receiving node is a mobile wireless node in said communications network.
said receiving node is a mobile wireless node in said communications network.
45. A computer-readable medium of instructions as claimed in claim 25, wherein:
said first set of instructions controls said receiving node to assign the link quality value to said communication link based on the transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, the received sensitivity (RS) value of said receiving node receiving said data packet, and the receive signal strength indication (RSSI) value provided by said network.
said first set of instructions controls said receiving node to assign the link quality value to said communication link based on the transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, the received sensitivity (RS) value of said receiving node receiving said data packet, and the receive signal strength indication (RSSI) value provided by said network.
46. A computer-readable medium of instructions as claimed in claim 45, wherein:
said receiving node is mobile.
said receiving node is mobile.
47. A computer-readable medium of instructions as claimed in claim 26, wherein:
said first set of instructions controls said receiving node to assign the link quality value to said communication link based on the transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, the received sensitivity (RS) value of said receiving node receiving said data packet, and the receive signal strength indication (RSSI) value provided by said network.
said first set of instructions controls said receiving node to assign the link quality value to said communication link based on the transmit power level (TPL) value at which said data packet was transmitted by said transmitting node, the received sensitivity (RS) value of said receiving node receiving said data packet, and the receive signal strength indication (RSSI) value provided by said network.
48. A computer-readable medium of instructions as claimed in claim 47, wherein:
said receiving node is mobile.
said receiving node is mobile.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/091,035 US7058018B1 (en) | 2002-03-06 | 2002-03-06 | System and method for using per-packet receive signal strength indication and transmit power levels to compute path loss for a link for use in layer II routing in a wireless communication network |
US10/091,035 | 2002-03-06 | ||
PCT/US2003/006632 WO2003077452A1 (en) | 2002-03-06 | 2003-03-06 | A system and method for using per-packet receive signal strength indication and transmit power levels to compute path loss for a link for use in layer ii routing in a wireless communication network |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2476516A1 CA2476516A1 (en) | 2003-09-18 |
CA2476516C true CA2476516C (en) | 2013-02-12 |
Family
ID=27804088
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA2476516A Expired - Fee Related CA2476516C (en) | 2002-03-06 | 2003-03-06 | A system and method for using per-packet receive signal strength indication and transmit power levels to compute path loss for a link for use in layer ii routing in a wireless communication network |
Country Status (7)
Country | Link |
---|---|
US (2) | US7058018B1 (en) |
EP (1) | EP1481499A4 (en) |
JP (1) | JP4455062B2 (en) |
KR (1) | KR100989754B1 (en) |
AU (1) | AU2003213717A1 (en) |
CA (1) | CA2476516C (en) |
WO (1) | WO2003077452A1 (en) |
Families Citing this family (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7215928B2 (en) * | 2003-05-02 | 2007-05-08 | Nortel Networks Limited | Path selection in wireless networks |
US7356341B2 (en) | 2003-12-04 | 2008-04-08 | Qualcomm, Incorporated | Scheduling communications in a wireless network |
CN100346618C (en) * | 2003-12-10 | 2007-10-31 | 联想(北京)有限公司 | Optimal route selection method of wireless network grids |
US20050152283A1 (en) * | 2004-01-08 | 2005-07-14 | David Ritzenthaler | Wireless device discovery |
JP5199061B2 (en) | 2005-03-10 | 2013-05-15 | トムソン ライセンシング | Hybrid mesh routing protocol |
US7477913B2 (en) * | 2005-04-04 | 2009-01-13 | Research In Motion Limited | Determining a target transmit power of a wireless transmission according to security requirements |
US8433355B2 (en) * | 2005-04-21 | 2013-04-30 | Interdigital Technology Corporation | Method and apparatus for generating loud packets to estimate path loss |
EP1897245A4 (en) | 2005-06-20 | 2013-01-16 | Texas Instruments Inc | Slow uplink power control |
JP4782832B2 (en) * | 2005-07-01 | 2011-09-28 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | Link control and routing adapted to end-to-end conditions in multi-hop networks |
JP4687292B2 (en) * | 2005-07-12 | 2011-05-25 | 株式会社Kddi研究所 | Communication device and method for disconnecting unnecessary wireless link in network |
US20080159133A1 (en) * | 2006-12-27 | 2008-07-03 | Ka Ki Yeung | Method of providing wireless signal strength and congestion data of an access point |
CN101237686B (en) * | 2007-01-30 | 2012-10-10 | 诺基亚西门子通信技术(北京)有限公司 | Method, system, network device and user device for identifying routes in wireless communication network |
US20090135836A1 (en) * | 2007-11-25 | 2009-05-28 | Michel Veillette | Collector device and system utilizing standardized utility metering protocol |
WO2009096883A1 (en) * | 2008-01-18 | 2009-08-06 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus for radio link failure recovery in a telecommunication system |
EP2301166B1 (en) | 2008-07-14 | 2017-04-05 | Broadcom Corporation | Method and system for bluetooth 802.11 alternate mac/phy (amp) transmit power control (tpc) |
KR101614085B1 (en) | 2008-12-31 | 2016-04-20 | 인텔렉추얼디스커버리 주식회사 | Method for power control in TDD OFDMA system |
KR101066291B1 (en) | 2009-01-02 | 2011-09-20 | 삼성전자주식회사 | Packet routing method and apparatus |
JP5193162B2 (en) * | 2009-11-12 | 2013-05-08 | 株式会社日立製作所 | Wireless communication state acquisition method and wireless station |
US8509245B1 (en) | 2009-11-16 | 2013-08-13 | The Boeing Company | Polymorphic routing for dynamic networks |
AU2011218961B2 (en) * | 2010-02-23 | 2015-07-09 | Kyushu University, National University Corporation | Communications system, slave node, route building method, and program |
US8958316B2 (en) | 2010-04-26 | 2015-02-17 | Collision Communications, Inc. | Power aware scheduling and power control techniques for multiuser detection enabled wireless mobile ad-hoc networks |
CN101867995B (en) * | 2010-06-24 | 2012-10-03 | 四川平安都市通讯科技有限公司 | Wireless netlike network routing method |
ITTO20110185A1 (en) * | 2011-03-02 | 2012-09-03 | Sisvel Technology Srl | PROCEDURE AND ALARM COOPERATIVE TRANSMISSION APPARATUS |
US8547982B2 (en) * | 2011-11-23 | 2013-10-01 | King Fahd University Of Petroleum And Minerals | Wireless sensor network with energy efficient protocols |
US9179244B2 (en) * | 2012-08-31 | 2015-11-03 | Apple Inc. | Proximity and tap detection using a wireless system |
TWI551179B (en) * | 2014-12-25 | 2016-09-21 | 台達電子工業股份有限公司 | Establishing method for self-organization network of wireless nodes |
CN106656676A (en) * | 2017-01-05 | 2017-05-10 | 国网新疆电力公司信息通信公司 | Storage path selection method and device |
CN113395669A (en) * | 2020-03-11 | 2021-09-14 | 新开普电子股份有限公司 | LoRa networking method, node centralized reading method and network server |
JP7419195B2 (en) | 2020-08-31 | 2024-01-22 | 株式会社東芝 | Communication devices, communication methods and programs |
Family Cites Families (125)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4910521A (en) | 1981-08-03 | 1990-03-20 | Texas Instruments Incorporated | Dual band communication receiver |
US4494192A (en) | 1982-07-21 | 1985-01-15 | Sperry Corporation | High speed bus architecture |
JPS59115633A (en) | 1982-12-22 | 1984-07-04 | Toshiba Corp | Information transmitting system |
US4675863A (en) | 1985-03-20 | 1987-06-23 | International Mobile Machines Corp. | Subscriber RF telephone system for providing multiple speech and/or data signals simultaneously over either a single or a plurality of RF channels |
US4747130A (en) | 1985-12-17 | 1988-05-24 | American Telephone And Telegraph Company, At&T Bell Laboratories | Resource allocation in distributed control systems |
CA1261080A (en) | 1985-12-30 | 1989-09-26 | Shunichiro Tejima | Satellite communications system with random multiple access and time slot reservation |
US4742357A (en) | 1986-09-17 | 1988-05-03 | Rackley Ernie C | Stolen object location system |
GB2229064B (en) | 1987-06-11 | 1990-12-12 | Software Sciences Limited | An area communications system |
US5210846B1 (en) | 1989-05-15 | 1999-06-29 | Dallas Semiconductor | One-wire bus architecture |
US5555425A (en) | 1990-03-07 | 1996-09-10 | Dell Usa, L.P. | Multi-master bus arbitration system in which the address and data lines of the bus may be separately granted to individual masters |
US5068916A (en) | 1990-10-29 | 1991-11-26 | International Business Machines Corporation | Coordination of wireless medium among a plurality of base stations |
KR940007474B1 (en) | 1991-05-16 | 1994-08-18 | 삼성전자 주식회사 | Driving voltage apparatus of magnetron |
US5369748A (en) | 1991-08-23 | 1994-11-29 | Nexgen Microsystems | Bus arbitration in a dual-bus architecture where one bus has relatively high latency |
US5241542A (en) | 1991-08-23 | 1993-08-31 | International Business Machines Corporation | Battery efficient operation of scheduled access protocol |
US5231634B1 (en) | 1991-12-18 | 1996-04-02 | Proxim Inc | Medium access protocol for wireless lans |
US5392450A (en) | 1992-01-08 | 1995-02-21 | General Electric Company | Satellite communications system |
US5896561A (en) | 1992-04-06 | 1999-04-20 | Intermec Ip Corp. | Communication network having a dormant polling protocol |
FR2690252B1 (en) | 1992-04-17 | 1994-05-27 | Thomson Csf | METHOD AND SYSTEM FOR DETERMINING THE POSITION AND ORIENTATION OF A MOBILE, AND APPLICATIONS. |
US5233604A (en) | 1992-04-28 | 1993-08-03 | International Business Machines Corporation | Methods and apparatus for optimum path selection in packet transmission networks |
GB9304638D0 (en) | 1993-03-06 | 1993-04-21 | Ncr Int Inc | Wireless data communication system having power saving function |
US5696903A (en) | 1993-05-11 | 1997-12-09 | Norand Corporation | Hierarchical communications system using microlink, data rate switching, frequency hopping and vehicular local area networking |
IT1270938B (en) | 1993-05-14 | 1997-05-16 | Cselt Centro Studi Lab Telecom | PROCEDURE FOR THE CONTROL OF THE TRANSMISSION ON A SAME CHANNEL OF INFORMATION FLOWS AT VARIABLE SPEED IN COMMUNICATION SYSTEMS BETWEEN MOBILE VEHICLES, AND A SYSTEM USING SUCH PROCEDURE |
US5317566A (en) | 1993-08-18 | 1994-05-31 | Ascom Timeplex Trading Ag | Least cost route selection in distributed digital communication networks |
US5631897A (en) | 1993-10-01 | 1997-05-20 | Nec America, Inc. | Apparatus and method for incorporating a large number of destinations over circuit-switched wide area network connections |
US5465398A (en) * | 1993-10-07 | 1995-11-07 | Metricom, Inc. | Automatic power level control of a packet communication link |
US5857084A (en) | 1993-11-02 | 1999-01-05 | Klein; Dean A. | Hierarchical bus structure access system |
US5412654A (en) * | 1994-01-10 | 1995-05-02 | International Business Machines Corporation | Highly dynamic destination-sequenced destination vector routing for mobile computers |
US5768684A (en) * | 1994-03-04 | 1998-06-16 | Motorola, Inc. | Method and apparatus for bi-directional power control in a digital communication system |
US5491837A (en) * | 1994-03-07 | 1996-02-13 | Ericsson Inc. | Method and system for channel allocation using power control and mobile-assisted handover measurements |
JP2591467B2 (en) | 1994-04-18 | 1997-03-19 | 日本電気株式会社 | Access method |
US5502722A (en) | 1994-08-01 | 1996-03-26 | Motorola, Inc. | Method and apparatus for a radio system using variable transmission reservation |
CA2132180C (en) | 1994-09-15 | 2001-07-31 | Victor Pierobon | Massive array cellular system |
JP3043958B2 (en) | 1994-09-29 | 2000-05-22 | 株式会社リコー | Network communication method by wireless communication |
US6029217A (en) | 1994-10-03 | 2000-02-22 | International Business Machines Corporation | Queued arbitration mechanism for data processing system |
EP0709982B1 (en) | 1994-10-26 | 2004-06-30 | International Business Machines Corporation | Medium access control scheme for wireless LAN using a variable length interleaved time division frame |
US5618045A (en) | 1995-02-08 | 1997-04-08 | Kagan; Michael | Interactive multiple player game system and method of playing a game between at least two players |
US5555540A (en) | 1995-02-17 | 1996-09-10 | Sun Microsystems, Inc. | ASIC bus structure |
US5796741A (en) | 1995-03-09 | 1998-08-18 | Nippon Telegraph And Telephone Corporation | ATM bus system |
US5572528A (en) | 1995-03-20 | 1996-11-05 | Novell, Inc. | Mobile networking method and apparatus |
US5886992A (en) | 1995-04-14 | 1999-03-23 | Valtion Teknillinen Tutkimuskeskus | Frame synchronized ring system and method |
US5517491A (en) | 1995-05-03 | 1996-05-14 | Motorola, Inc. | Method and apparatus for controlling frequency deviation of a portable transceiver |
US5697056A (en) * | 1995-05-08 | 1997-12-09 | Motorola, Inc. | Communication system in which radio subscriber units mitigate interference |
US5822309A (en) | 1995-06-15 | 1998-10-13 | Lucent Technologies Inc. | Signaling and control architecture for an ad-hoc ATM LAN |
US5623495A (en) | 1995-06-15 | 1997-04-22 | Lucent Technologies Inc. | Portable base station architecture for an AD-HOC ATM lan |
US5781540A (en) | 1995-06-30 | 1998-07-14 | Hughes Electronics | Device and method for communicating in a mobile satellite system |
JPH0936799A (en) * | 1995-07-21 | 1997-02-07 | Toshiba Corp | Radio communication equipment |
GB2303763B (en) | 1995-07-26 | 2000-02-16 | Motorola Israel Ltd | Communications system and method of operation |
GB9517943D0 (en) | 1995-09-02 | 1995-11-01 | At & T Corp | Radio communication device and method |
US6132306A (en) | 1995-09-06 | 2000-10-17 | Cisco Systems, Inc. | Cellular communication system with dedicated repeater channels |
US6192053B1 (en) | 1995-09-07 | 2001-02-20 | Wireless Networks, Inc. | Enhanced adjacency detection protocol for wireless applications |
US5615212A (en) | 1995-09-11 | 1997-03-25 | Motorola Inc. | Method, device and router for providing a contention-based reservation mechanism within a mini-slotted dynamic entry polling slot supporting multiple service classes |
US5805842A (en) | 1995-09-26 | 1998-09-08 | Intel Corporation | Apparatus, system and method for supporting DMA transfers on a multiplexed bus |
US5805593A (en) | 1995-09-26 | 1998-09-08 | At&T Corp | Routing method for setting up a service between an origination node and a destination node in a connection-communications network |
US5701294A (en) | 1995-10-02 | 1997-12-23 | Telefonaktiebolaget Lm Ericsson | System and method for flexible coding, modulation, and time slot allocation in a radio telecommunications network |
US5717689A (en) | 1995-10-10 | 1998-02-10 | Lucent Technologies Inc. | Data link layer protocol for transport of ATM cells over a wireless link |
US5732077A (en) * | 1995-11-13 | 1998-03-24 | Lucent Technologies Inc. | Resource allocation system for wireless networks |
US5920821A (en) | 1995-12-04 | 1999-07-06 | Bell Atlantic Network Services, Inc. | Use of cellular digital packet data (CDPD) communications to convey system identification list data to roaming cellular subscriber stations |
US5991279A (en) | 1995-12-07 | 1999-11-23 | Vistar Telecommunications Inc. | Wireless packet data distributed communications system |
US5878036A (en) | 1995-12-20 | 1999-03-02 | Spartz; Michael K. | Wireless telecommunications system utilizing CDMA radio frequency signal modulation in conjunction with the GSM A-interface telecommunications network protocol |
KR100197407B1 (en) | 1995-12-28 | 1999-06-15 | 유기범 | Communication bus architecture between process in the full electronic switching system |
US5680392A (en) | 1996-01-16 | 1997-10-21 | General Datacomm, Inc. | Multimedia multipoint telecommunications reservation systems |
US5684794A (en) | 1996-01-25 | 1997-11-04 | Hazeltine Corporation | Validation of subscriber signals in a cellular radio network |
JP2838998B2 (en) * | 1996-02-07 | 1998-12-16 | 日本電気株式会社 | Mobile terminal and mobile network |
US5706428A (en) | 1996-03-14 | 1998-01-06 | Lucent Technologies Inc. | Multirate wireless data communication system |
US5652751A (en) | 1996-03-26 | 1997-07-29 | Hazeltine Corporation | Architecture for mobile radio networks with dynamically changing topology using virtual subnets |
US5796732A (en) | 1996-03-28 | 1998-08-18 | Cisco Technology, Inc. | Architecture for an expandable transaction-based switching bus |
US5805977A (en) | 1996-04-01 | 1998-09-08 | Motorola, Inc. | Method and apparatus for controlling transmissions in a two-way selective call communication system |
US5943322A (en) | 1996-04-24 | 1999-08-24 | Itt Defense, Inc. | Communications method for a code division multiple access system without a base station |
US6157616A (en) * | 1996-05-31 | 2000-12-05 | Lucent Technologies | Adaptive methods for packet transmission over wireless networks |
US5845097A (en) | 1996-06-03 | 1998-12-01 | Samsung Electronics Co., Ltd. | Bus recovery apparatus and method of recovery in a multi-master bus system |
US5787080A (en) | 1996-06-03 | 1998-07-28 | Philips Electronics North America Corporation | Method and apparatus for reservation-based wireless-ATM local area network |
SE518132C2 (en) | 1996-06-07 | 2002-08-27 | Ericsson Telefon Ab L M | Method and apparatus for synchronizing combined receivers and transmitters in a cellular system |
JP3291199B2 (en) * | 1996-06-07 | 2002-06-10 | 三菱電機株式会社 | Transmission power control method |
US5774876A (en) | 1996-06-26 | 1998-06-30 | Par Government Systems Corporation | Managing assets with active electronic tags |
US5844905A (en) | 1996-07-09 | 1998-12-01 | International Business Machines Corporation | Extensions to distributed MAC protocols with collision avoidance using RTS/CTS exchange |
US5909651A (en) | 1996-08-02 | 1999-06-01 | Lucent Technologies Inc. | Broadcast short message service architecture |
US5987011A (en) * | 1996-08-30 | 1999-11-16 | Chai-Keong Toh | Routing method for Ad-Hoc mobile networks |
US6044062A (en) | 1996-12-06 | 2000-03-28 | Communique, Llc | Wireless network system and method for providing same |
WO1998027675A1 (en) * | 1996-12-18 | 1998-06-25 | Nokia Telecommunications Oy | A method and an apparatus for determining the pathloss between a base transceiver station and a mobile station in a mobile radio network |
US5903559A (en) | 1996-12-20 | 1999-05-11 | Nec Usa, Inc. | Method for internet protocol switching over fast ATM cell transport |
SE512077C2 (en) | 1997-01-22 | 2000-01-24 | Ericsson Telefon Ab L M | Method and apparatus for estimating the attenuation of a radio communication system |
US5877724A (en) | 1997-03-25 | 1999-03-02 | Trimble Navigation Limited | Combined position locating and cellular telephone system with a single shared microprocessor |
US6829226B1 (en) * | 1997-04-04 | 2004-12-07 | Ericsson Inc. | Power control for a mobile terminal in a satellite communication system |
US6052594A (en) | 1997-04-30 | 2000-04-18 | At&T Corp. | System and method for dynamically assigning channels for wireless packet communications |
US5881095A (en) | 1997-05-01 | 1999-03-09 | Motorola, Inc. | Repeater assisted channel hopping system and method therefor |
US5870350A (en) | 1997-05-21 | 1999-02-09 | International Business Machines Corporation | High performance, high bandwidth memory bus architecture utilizing SDRAMs |
US6240294B1 (en) | 1997-05-30 | 2001-05-29 | Itt Manufacturing Enterprises, Inc. | Mobile radio device having adaptive position transmitting capabilities |
GB2326065B (en) | 1997-06-05 | 2002-05-29 | Mentor Graphics Corp | A scalable processor independent on-chip bus |
US6108738A (en) | 1997-06-10 | 2000-08-22 | Vlsi Technology, Inc. | Multi-master PCI bus system within a single integrated circuit |
JP3141820B2 (en) * | 1997-07-18 | 2001-03-07 | 日本電気株式会社 | Ad hoc local area network |
US5987033A (en) | 1997-09-08 | 1999-11-16 | Lucent Technologies, Inc. | Wireless lan with enhanced capture provision |
US6163699A (en) | 1997-09-15 | 2000-12-19 | Ramot University Authority For Applied Research And Industrial Development Ltd. | Adaptive threshold scheme for tracking and paging mobile users |
US6067291A (en) | 1997-09-23 | 2000-05-23 | Lucent Technologies Inc. | Wireless local area network with enhanced carrier sense provision |
US6034542A (en) | 1997-10-14 | 2000-03-07 | Xilinx, Inc. | Bus structure for modularized chip with FPGA modules |
JP3856253B2 (en) * | 1997-10-16 | 2006-12-13 | ソニー株式会社 | Cellular radio communication system and base station |
US6138024A (en) * | 1997-10-23 | 2000-10-24 | Allen Telecom Inc. | Dynamic channel selection in a cellular communication system |
US6035183A (en) * | 1997-12-09 | 2000-03-07 | Nortel Networks Corporation | Basestation RSSI and BER feedback signal quality display and transmit diversity |
US6009553A (en) | 1997-12-15 | 1999-12-28 | The Whitaker Corporation | Adaptive error correction for a communications link |
US5936953A (en) | 1997-12-18 | 1999-08-10 | Raytheon Company | Multi-mode, multi-channel communication bus |
US6175745B1 (en) * | 1997-12-24 | 2001-01-16 | Telefonaktiebolaget Lm Ericsson | Initial transmit power determination in a radiocommunication system |
US6047330A (en) | 1998-01-20 | 2000-04-04 | Netscape Communications Corporation | Virtual router discovery system |
US6065085A (en) | 1998-01-27 | 2000-05-16 | Lsi Logic Corporation | Bus bridge architecture for a data processing system capable of sharing processing load among a plurality of devices |
US6058107A (en) * | 1998-04-08 | 2000-05-02 | Motorola, Inc. | Method for updating forward power control in a communication system |
US6130881A (en) | 1998-04-20 | 2000-10-10 | Sarnoff Corporation | Traffic routing in small wireless data networks |
US6078566A (en) | 1998-04-28 | 2000-06-20 | Genesys Telecommunications Laboratories, Inc. | Noise reduction techniques and apparatus for enhancing wireless data network telephony |
US6064626A (en) | 1998-07-31 | 2000-05-16 | Arm Limited | Peripheral buses for integrated circuit |
US6304556B1 (en) | 1998-08-24 | 2001-10-16 | Cornell Research Foundation, Inc. | Routing and mobility management protocols for ad-hoc networks |
US6115580A (en) | 1998-09-08 | 2000-09-05 | Motorola, Inc. | Communications network having adaptive network link optimization using wireless terrain awareness and method for use therein |
US6519236B1 (en) * | 1998-09-18 | 2003-02-11 | Telefonaktiebolaget Lm Ericsson (Publ) | Automatic power control in uncoordinated frequency-hopping radio systems |
US6208870B1 (en) | 1998-10-27 | 2001-03-27 | Lucent Technologies Inc. | Short message service notification forwarded between multiple short message service centers |
US6285892B1 (en) | 1998-11-24 | 2001-09-04 | Philips Electronics North America Corp. | Data transmission system for reducing terminal power consumption in a wireless network |
US6104712A (en) | 1999-02-22 | 2000-08-15 | Robert; Bruno G. | Wireless communication network including plural migratory access nodes |
US6498934B1 (en) * | 1999-03-24 | 2002-12-24 | Telefonaktiebologet Lm Ericsson (Publ) | Channel allocation using enhanced pathloss estimates |
US6147975A (en) | 1999-06-02 | 2000-11-14 | Ac Properties B.V. | System, method and article of manufacture of a proactive threhold manager in a hybrid communication system architecture |
US6453168B1 (en) | 1999-08-02 | 2002-09-17 | Itt Manufacturing Enterprises, Inc | Method and apparatus for determining the position of a mobile communication device using low accuracy clocks |
US6275707B1 (en) | 1999-10-08 | 2001-08-14 | Motorola, Inc. | Method and apparatus for assigning location estimates from a first transceiver to a second transceiver |
US6327300B1 (en) | 1999-10-25 | 2001-12-04 | Motorola, Inc. | Method and apparatus for dynamic spectrum allocation |
US6678252B1 (en) * | 1999-10-28 | 2004-01-13 | Verizon Laboratories Inc. | Method and apparatus for dynamic source routing in ad hoc wireless networks |
US6349210B1 (en) | 1999-11-12 | 2002-02-19 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for broadcasting messages in channel reservation communication systems |
US6349091B1 (en) | 1999-11-12 | 2002-02-19 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for controlling communication links between network nodes to reduce communication protocol overhead traffic |
US6512935B1 (en) * | 2000-03-24 | 2003-01-28 | Gte Internetworking Incorporated | Energy conserving network protocol |
JP3738205B2 (en) * | 2000-08-12 | 2006-01-25 | 三星電子株式会社 | Network transmission power optimization apparatus and method |
US6735448B1 (en) * | 2000-11-07 | 2004-05-11 | Hrl Laboratories, Llc | Power management for throughput enhancement in wireless ad-hoc networks |
US6973039B2 (en) * | 2000-12-08 | 2005-12-06 | Bbnt Solutions Llc | Mechanism for performing energy-based routing in wireless networks |
US7461164B2 (en) * | 2002-02-08 | 2008-12-02 | Dsp Group Inc. | Medium access control with software -and hardware- based components in a wireless network |
-
2002
- 2002-03-06 US US10/091,035 patent/US7058018B1/en not_active Expired - Lifetime
-
2003
- 2003-03-06 CA CA2476516A patent/CA2476516C/en not_active Expired - Fee Related
- 2003-03-06 WO PCT/US2003/006632 patent/WO2003077452A1/en active Application Filing
- 2003-03-06 AU AU2003213717A patent/AU2003213717A1/en not_active Abandoned
- 2003-03-06 EP EP03711405A patent/EP1481499A4/en not_active Withdrawn
- 2003-03-06 JP JP2003575536A patent/JP4455062B2/en not_active Expired - Lifetime
- 2003-03-06 KR KR1020047013403A patent/KR100989754B1/en not_active IP Right Cessation
-
2006
- 2006-02-23 US US11/360,075 patent/US7672246B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
JP4455062B2 (en) | 2010-04-21 |
CA2476516A1 (en) | 2003-09-18 |
KR20040099287A (en) | 2004-11-26 |
US7058018B1 (en) | 2006-06-06 |
AU2003213717A1 (en) | 2003-09-22 |
WO2003077452A1 (en) | 2003-09-18 |
EP1481499A1 (en) | 2004-12-01 |
EP1481499A4 (en) | 2006-06-07 |
US20060159038A1 (en) | 2006-07-20 |
JP2005519564A (en) | 2005-06-30 |
KR100989754B1 (en) | 2010-10-26 |
US7672246B2 (en) | 2010-03-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2476516C (en) | A system and method for using per-packet receive signal strength indication and transmit power levels to compute path loss for a link for use in layer ii routing in a wireless communication network | |
RU2404525C2 (en) | Method and device for routing based on noise in wireless cellular network | |
EP1629677B1 (en) | Optimal routing in ad hoc wireless communication network | |
KR100825660B1 (en) | System and method for characterizing the quality of a link in a wireless network | |
US7200149B1 (en) | System and method for identifying potential hidden node problems in multi-hop wireless ad-hoc networks for the purpose of avoiding such potentially problem nodes in route selection | |
US6754188B1 (en) | System and method for enabling a node in an ad-hoc packet-switched wireless communications network to route packets based on packet content | |
KR100957920B1 (en) | System and method for utilizing multiple radios to increase the capacity of a wireless communication network | |
KR100830364B1 (en) | System and method for selecting stable routes in wireless networks | |
EP1504614B1 (en) | System and method for performing multiple network routing and provisioning in overlapping wireless deployments | |
KR100890481B1 (en) | Software architecture and hardware abstraction layer for multi-radio routing and method for providing the same | |
US7706390B2 (en) | System and method for routing packets in a wireless multihopping communication network | |
WO2006015007A2 (en) | System and method for detecting transient links in multi-hop wireless networks | |
Chowdhury et al. | XCHARM: A routing protocol for multi-channel wireless mesh networks | |
WO2003051009A1 (en) | Method of using data rates as a routing metric in ad-hoc networks | |
Chiu et al. | On optimization of joint channel assignment and routing in mobile ad hoc networks | |
Colizza et al. | Performance of OLSR in MANETs with Cross-Layer Metrics and TCP/UDP flows | |
KR20050026707A (en) | Monitoring link quality in a mobile ad hoc network | |
Lee et al. | Dynamic power efficient QoS routing algorithm for multimedia services over mobile ad hoc networks | |
Wazwaz et al. | Medium Access and Routing In Multi Hop Wireless Infrastructures | |
Gawas et al. | A CROSS-LAYER QOS AWARE NODE DISJOINT MULTIPATH ROUTING ALGORITHM FOR MOBILE AD HOC NETWORKS | |
KR20090037632A (en) | Routing metric based on channel contentions and collisions |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
MKLA | Lapsed |
Effective date: 20190306 |