US20020006123A1 - Enhanced adjacency detection protocol for wireless applications - Google Patents
Enhanced adjacency detection protocol for wireless applications Download PDFInfo
- Publication number
- US20020006123A1 US20020006123A1 US09/776,406 US77640601A US2002006123A1 US 20020006123 A1 US20020006123 A1 US 20020006123A1 US 77640601 A US77640601 A US 77640601A US 2002006123 A1 US2002006123 A1 US 2002006123A1
- Authority
- US
- United States
- Prior art keywords
- node
- link
- adjacent
- packet
- adjacent node
- 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.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
- H04W74/0816—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision avoidance
-
- 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/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/324—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/325—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the network layer [OSI layer 3], e.g. X.25
Definitions
- the present invention relates generally to wireless data communications, and more particularly to a method and apparatus for establishing at a given wireless node, the availability of neighboring nodes for communications and certain characteristics of these neighboring nodes.
- CSMA/CD multiple access protocol commonly used to resolve shared media contention in local area networks (LANs).
- This link layer protocol takes advantage of so-called carrier sensing to reduce the frequency of collisions on a shared medium. When one node coupled to the shared medium is transmitting, other nodes can sense this and stay off the medium until it is free.
- Radio-based protocols despite relying on a shared medium, cannot usually rely on carrier sensing. In the first place, it is fairly difficult and time consuming to determine in a wireless context whether or not a transmitter is active. Furthermore, another obstacle to the successful application of carrier sensing techniques is that the physical medium used by wireless communications is not shared in the same sense as the LAN medium is shared. In the LAN context, a node that can talk to one node, can talk to and be heard by all nodes. In the wireless context, a node A may be able to communicate with a node B that itself can communicate with a node C while node A cannot itself communicate with node C.
- a transmission from node C to node B could interfere with a transmission from node A to node B, even though node A cannot hear node C and thus would not know to inhibit itself from transmitting while node C is transmitting.
- This is the so-called hidden terminal problem. If only node C can communicate with a node D, another problem would arise in that a transmission from B to A would inhibit a transmission from C to D even though D would not be able to hear B. This is the so-called exposed terminal problem.
- ARP Address Resolution Protocol
- IP Internet Protocol
- ARP is a network layer protocol belonging to the Internet Protocol (IP) suite and is widely used to translate IP addresses into LAN addresses.
- IP Internet Protocol
- a node connected to a LAN that needs to translate an IP address into a LAN link layer address sends out an ARP broadcast message specifying the IP address.
- the LAN node having that IP address responds to the ARP broadcast message with a message including the IP address and LAN address.
- broadcasting ARP messages to acquire link layer addresses is impractical in the wireless context because all nodes cannot hear a single broadcast and thus the ARP messages would have to be endlessly relayed, causing congestion and degradation of network performance.
- Protocols used to establish routing information in wired systems such as the open Shortest Path First (OSPF) protocol used in IP require complex synchronization of routing information between adjacent nodes and do not take into account the less reliable nature of wireless links, in that some connections may be asymmetric (one way channel), and that wireless links in general will have a high bit error rate. Nor do they take into account that, for wireless links, transmission and processing delays vary on a per link basis.
- OSPF Shortest Path First
- the invention provides an Adjacency Detection Protocol (ADP) whereby a node in a wireless network may collect information about its neighbors.
- ADP Adjacency Detection Protocol
- the collected information enables the efficient establishment of link layer connectivity between a node and its neighbors and also is useful for translating network layer addresses into link layer addresses.
- the collected information finds further use in preventing medium contention among adjacent nodes and in handling collisions.
- a selected node in a wireless network listens for certain link layer protocol messages from its neighbors.
- the link layer protocol message may be a broadcast message sent out for this purpose, a targeted message sent to the selected node for this purpose, or a link layer protocol message having some other purpose. If one is received, the selected node creates an entry in a link table for the originating node, sets a timer, and sends a reply specifically addressed to the originating node. If an acknowledgement is received from the originating node prior to expiration of the timer, the link is marked as a good link.
- the acknowledgement may include certain useful parameters of the originating node relating to its latency time in processing messages.
- a protocol for resolving medium contention in a wireless network is enhanced by taking advantage of stored information about the message processing time of neighbors.
- a first node in the wireless network receives a packet from a second node that includes parameters relating to the second node's message processing time. Thereafter, when the first node overhears a ready-to-send packet sent by a third node to the second node, it responds by inhibiting its own transmitter for long enough to allow the second node to respond with a clear-to-send packet.
- this inhibition time incorporates the second node's latency time.
- the first node overhears a clear-to-send packet sent by a third node to the second node, it inhibits its own transmitter for long enough to allow the second node respond by transmitting data. This inhibition time also incorporates the second node's latency time.
- a selected node in a wireless network collects network layer address information about its neighbors.
- the network layer is notified of the new link and responds by invoking a network layer protocol that obtains network layer address information about the selected node.
- the network layer address information is then available to network layer protocols for routing and other purposes.
- FIG. 1 depicts a representative wireless packet communication network suitable for implementing the present invention.
- FIG. 2 is a simplified diagram of a wireless router system suitable for implementing the present invention.
- FIG. 3 depicts the organization of link information stored within a wireless node in accordance with one embodiment of the present invention.
- FIG. 4 depicts a transition diagram for a state machine that maintains a link table in accordance with one embodiment of the present invention.
- FIG. 5 depicts a transition diagram for a state machine that regulates the broadcast of certain messages in accordance with one embodiment of the present invention.
- FIG. 6 depicts a transition diagram for a state machine that regulates the collection of network layer address information in accordance with one embodiment of the present invention.
- FIGS. 7 A- 7 B depict problems raised by the application of carrier sensing to wireless networks.
- FIG. 8 is a flowchart describing the steps of responding to an overheard RTS packet in accordance with one embodiment of the present invention.
- FIG. 9 is a flowchart describing the steps of responding to an overheard CTS packet in accordance with one embodiment of the present invention.
- FIG. 1 depicts a representative wireless network 100 suitable for implementing the present invention.
- a plurality of local area networks (LANs) 102 each interconnect a number of host computers 104 and a single wireless router system 106 .
- the wireless router systems 106 in turn are interconnected by a regional network 108 to multiple points of presence (PoPs) 110 which serve as interconnects to a backbone network 112 .
- PoPs points of presence
- Host computers 104 may incorporate any processor or operating system DOS/Windows, Apple System 7, UNIX, OS/2, etc. but preferably support a TCP/IP protocol stack.
- LAN 102 is preferably of the well known Ethernet type. End user packets originating from a host computer 104 are routed via wireless router system 106 and regional network 108 to the nearest POP 110 . This is either done directly when the wireless router system 106 is within rage of a POP 110 , or done indirectly when that is not the case.
- backbone network 108 is configured to require a maximum of three hops. The choices of frequency, modulation scheme etc. are not important to the present invention.
- Traffic from the POP is aggregated and ported out to a connection to backbone network 112 , either via a wireline network, a high-speed radio link, or using microwave or satellite technology.
- backbone network 112 which provides a long distance link that cross-connect regional networks could make use of wireline, microwave, or satellite technology.
- the overall networking scheme described herein supports the transport of IP packets and thus enables host computers 104 to take advantage of Internet applications such as electronic mail, World Wide Web access, etc. despite the lack of a wired link to the Internet. Thus, particularly beneficial uses will be found in remote environments where wired connections are expensive or unavailable for other reasons.
- the networking scheme described herein will also find use in mobile applications.
- FIG. 2 depicts wireless router system 106 in accordance with one embodiment of the invention.
- Wireless router system 106 includes a router subsystem 202 , a wireless subsystem 204 , and an antenna 206 .
- Router subsystem 202 has an AC power input and a connection to LAN 102 .
- the present embodiment of router subsystem 202 includes an IBM PC compatible motherboard with a networking capability to connect to the LAN. Networking protocols necessary to the implementation of regional network 108 including networking protocols of the present invention are stored as firmware.
- Router subsystem 202 is connected to wireless subsystem 204 via the well-known synchronous EIA-530 interface.
- Wireless subsystem 204 itself has an AC power input and is connected to antenna 206 via an RF cable.
- Wireless subsystem 204 incorporates modulation/demodulation circuitry, a transceiver, and power amplification for the transmitted signal. The details of modulation, spectral allocation etc. are not important to the present invention.
- not every router subsystem 202 need be associated with a LAN 102 .
- Regional network 108 may also incorporate additional router subsystems 202 that are used exclusively for relaying packets to and from other routers or PoPs.
- Router subsystems 202 can be understood to be nodes of regional network 108 and the terms “router subsystem”, “router”, and “node” will be used interchangeably herein.
- the preferred embodiment of the present invention is directed primarily toward the operation of router subsystems within regional network 108 to transport network layer packets.
- the network layer operates in accordance with IP, although other network layer protocols would be possible within the scope of the present invention.
- IP IP
- several support functions are required. One essential function is the translation of IP addresses to the link layer addresses specific to the architecture of regional network 108 . Another is collection of adjacency information about neighboring router subsystems. This adjacency information is essential to IP routing protocols.
- the present invention provides an Adjacency Detection Protocol (ADP) suitable to wireless applications to collect information about adjacent routers.
- the information collected at each routing subsystem or node preferably includes the availability of links to adjacent nodes and message processing speed parameters of adjacent nodes. As will be explained below, this last parameter is particularly useful in resolving physical medium contention by competing nodes.
- the ADP also assists network layer protocols in the efficient collection of network layer address information about adjacent nodes.
- the ADP of the present invention preferably operates at the link layer of the well known seven layer model of digital communications, relying on the exchange of various link layer packets to collect the needed information.
- the present invention provides a simple yet powerful protocol for accumulating information about adjacent nodes. Transmission of messages is minimized, greatly reducing implementation cost in the wireless context.
- FIG. 3 depicts a simplified representation of an electronically stored link table.
- Each link table entry preferably includes a link layer address 302 identifying an adjacent node, a state of the link 304 , a measure 306 of the adjacent node's processing speed, a measure 308 of the adjacent node's system load and a measure 310 of interrupt latency.
- the link table is stored within each router system 202 .
- Higher level IP routing and address translation protocols make use of the adjacency information stored in the link table of FIG. 3.
- a link layer protocol for preventing medium contention takes advantage of measures 306 , 308 , and 310 .
- An adjacent node having an entry marked with a GOOD state is one to which connections are possible.
- a CANDIDATE state indicates awareness of an adjacent node that is currently being evaluated for promotion to GOOD.
- a SUSPECT state indicates an adjacent node for which connection is still possible but if nothing is heard from that link for a predetermined time period, the link may be marked as DEAD. After a time, a DEAD link may be deleted from the link entry table.
- a node with no entry in the link table is described herein as being in the NO LINK state.
- FIG. 4 depicts a transition diagram 400 for a state machine that maintains a link table in accordance with one embodiment of the present invention.
- the state machine of FIG. 4 is currently implemented in software though those of skill in the art will appreciate that a hardware implementation would also be possible within the scope of the present invention.
- HelloDirected A message with a specific destination link layer address.
- HelloReply A message with a specific destination link layer address that also includes measures 306 , 308 , and 310 of the node sending the message.
- Measure 306 indicates processing speed and is determined by running a fixed loop of code.
- Measure 308 indicates system load and is determined by measuring a time between invocations of the lowest priority task.
- Measure 310 indicates interrupt latency, the time from when a hardware device requests service and to when the request is serviced, and is a value entered by an operator.
- the following events at a selected node may trigger a transition either to another state or to the same state in the state machine of FIG. 4.
- HBrd Heard a HelloBroadcast from an adjacent node X.
- HDir Heard a HelloDirected addressed to this node.
- LLCm Heard an link layer control (LLC) dialogue message addressed to this node from node X, and this message was a type which was in reply to something this node sent to X, implying that X heard this node.
- LLC dialogue messages include clear-to-send (CTS), return-to-send (RTS), acknowledge (ACK), and the HelloDirected and HelloReply messages.
- LLCx Heard an LLC dialog message from node X addressed to some other node.
- T1exp Timer T1 has expired.
- T2exp Timer T2 has expired.
- T3exp Timer T3 has expired.
- T4exp Timer T4 has expired.
- a change in states in FIG. 4 may be accompanied by various actions.
- Set timer signifies starting a particular timer with its timeout value when it is not currently running; when the time elapses, an expiration event is triggered.
- “Clear timer” signifies stopping a timer without causing its expiration event trigger.
- Reset timer signifies restarting a timer with its timeout value without triggering its expiration event.
- Set LLPs means extracting and storing the remote node's processing parameters, such as processor speed, interrupt latency, and approximated traffic load.
- T1 60 seconds.
- T2 60 seconds.
- T3 60 seconds.
- T4 3600 seconds.
- the operation of the state machine of FIG. 4 at a selected node may now be described in detail.
- the possible states are NO LINK 402 , CANDIDATE 404 , GOOD 406 , SUSPECT 408 , and DEAD 410 .
- a line between states, or a line returning to the same state signifies a transition with the events triggering the transition and the actions associated with the transition being indicated by text written by the line.
- An adjacent node begins in NO LINK state 402 , that is with no link table entry. If a HelloBroadcast, HelloDirected, or LLCx message is heard from this adjacent node, the adjacent node is moved to CANDIDATE state 402 , taking a transition 412 to the CANDIDATE state 404 . Several actions are also taken. An entry, X, marked CANDIDATE, is created in the link table for this adjacent node. The selected node sends an HelloDirected message to this adjacent node and starts timer T1.
- the selected node If the selected node itself receives a HelloReply from the adjacent node while in CANDIDATE state 404 , it responds by taking a transition 418 to GOOD state 406 . It also clears timer T1 and sets timer T2.
- the HelloReply message includes the processing parameters including processor speed, service load, and operating system latency. These values are entered in the link table. Now connections may be made to the adjacent node.
- timer T3 If, while in SUSPECT state 408 , timer T3 expires, then the adjacent node takes a transition 426 to DEAD state 410 . Timer T3 clears and timer T4 is set. Connections to an adjacent node in DEAD state 410 are not possible.
- DEAD state 410 if an LLCm message is received from the adjacent node, the adjacent node returns to CANDIDATE state 406 via a transition 428 . If the LLCm message is a HelloDirected, a HelloReply is sent. If timer T4 expires, the adjacent node returns to NO LINK state 402 via transition 430 and its link entry is deleted.
- FIG. 5 depicts a transition diagram 500 for a state machine that regulates the transmission of HelloBroadcast messages in accordance with one embodiment of the present invention.
- PRIME LINK TABLE state 502 HelloBroadcasts are periodically transmitted to accelerate updating of the link table.
- MAINTAIN LINK TABLE state 504 HelloBroadcasts are not transmitted.
- the link table will continue to be modified since messages will be received from adjacent nodes.
- PRIME LINK TABLE state 502 is entered via a transition 506 . Furthermore, timer T5 is set to 15 seconds and timer T6 is set to 600 seconds. Once in PRIME LINK TABLE state 502 , if T5 expires, a HelloBroadcast is sent out. The selected node then returns to PRIME LINK TABLE 502 state via a transition 508 and resets timer T5. If T6 expires, the selected node moves to MAINTAIN LINK TABLE state 504 via a transition 510 and clears timer T5.
- the present invention also provides a method and apparatus for collecting network layer address information about adjacent nodes without the use of broadcast messages.
- the network layer is notified and a network layer protocol is invoked to identify the network layer address of the adjacent node.
- the network layer address is stored with the link layer address of the adjacent node in an address resolution table.
- the address resolution table facilitates translation from network layer addresses to link layer addresses.
- the network layer operates in accordance with IP and the network layer protocol invoked is Reverse Address Resolution Protocol (RARP).
- RARP Reverse Address Resolution Protocol
- FIG. 6 depicts a transition diagram 600 for a state machine that regulates the collection of network layer address information for a particular adjacent node in accordance with one embodiment of the present invention.
- the state machine of FIG. 6 is operative at the link layer.
- the network layer (IP in the preferred embodiment) is notified to take action to discover the network layer address of the new adjacent node and a timer T7 is set to 5 seconds.
- the action taken by the network layer is invocation of Reverse Address Resolution Protocol (RARP) to discover the IP address of the adjacent node via an exchange of IP layer messages.
- RARP Reverse Address Resolution Protocol
- IP WAIT state 604 if T7 expires before there is any indication that RARP has successfully acquired the needed IP address, it is reset, and the network layer is notified to repeat the RARP operation.
- the IP WAIT state continues via a transition 608 . This step of repeating is necessary because the IP layer will not automatically repeat the RARP operation if the IP address is not successfully acquired for some reason.
- the link layer thus operates to keep repeating the RARP operation until the IP address of the adjacent node is successfully acquired. If RARP successfully acquires the needed IP address, or if the adjacent node leaves GOOD state 606 , timer T7 is cleared and a transition 610 is taken to QUIET state 602 .
- the processing parameters collected by ADP are used to optimize the performance of link layer protocols used to prevent collisions, i.e., simultaneous transmissions by competing nodes on the same radio channel. While one node is transmitting, other nodes can sense this and inhibit transmission until the common medium is free.
- link layer protocols used to prevent collisions, i.e., simultaneous transmissions by competing nodes on the same radio channel. While one node is transmitting, other nodes can sense this and inhibit transmission until the common medium is free.
- carrier sensing to wireless network raises certain problems however.
- FIG. 7A depicts the classic hidden terminal problem raised by the application of carrier sensing to wireless networks.
- a node A may be able to communicate with a node B that itself can communicate with a node C while node A cannot itself communicate with node C.
- a transmission from node C to node B could interfere with a transmission from node A to node B, even though node A cannot hear node C and thus would not know to inhibit itself from transmitting while node C is transmitting.
- FIG. 7B depicts the classic exposed terminal problem raised by the application of carrier sensing to wireless networks. If only node C can communicate with a node D, a problem arises in that a transmission from B to A would inhibit a transmission from C to D even though D would not be able to hear B.
- a node with data to transmit sends a ready-to-send (RTS) packet to the desired destination node.
- the RTS packet includes the amount of data to be transmitted.
- the destination node responds with a clear-to-send (CTS) packet that also includes the amount of data to be transmitted. Any other node overhearing the RTS packet inhibits its own transmission for long enough to allow the destination node to respond with a CTS packet. Any other node overhearing the CTS packet inhibits its own transmission long enough for the data to be transmitted.
- CTS clear-to-send
- the present invention provides an enhanced technique for determining the proper inhibition times that takes advantage of the processing parameter information collected concerning adjacent nodes.
- the inhibition times thus take into account the processing speed and traffic loads of the adjacent nodes. Since inhibition times are more accurate, the frequency of collisions is further reduced while maintaining efficient usage of available radio channels.
- each node stores various indicia of processing speed for the neighbors to which it has active links. These include measures of raw processing speed, system load, and interrupt latency. The calculation of overall message processing latency time takes into account these factors as well as an estimate of propagation time.
- the three message processing parameters are received from the adjacent nodes as independent values.
- a single value incorporating the sum of the three indicia could also be sent but sending the parameters separately facilitates troubleshooting of adjacent nodes.
- FIG. 8 is a flowchart describing the steps of responding to an overheard RTS packet in accordance with one embodiment of the present invention.
- a first node overhears a RTS packet from a second node to a third node.
- the first node must now determine for how long to inhibit its own transmissions to allow the third node to respond.
- the first node checks to see if it has an entry to its link table for the third node that includes the processing parameters of the third node.
- an inhibition time is calculated by summing these parameters with a worst case estimated propagation time of 53 microseconds which represents a propagation delay of 5.3 microseconds per mile over 10 miles.
- the inhibition time is calculated by summing a worst case operating system latency of 1.2 milliseconds with the worst case propagation time of 53 microseconds.
- transmission is inhibited for the calculated time.
- FIG. 9 is a flowchart describing the steps of responding to an overheard CTS packet in accordance with one embodiment of the present invention.
- a first node overhears a CTS packet from a second node to a third node.
- the first node must now determine for how long to inhibit its own transmissions to allow the third node to respond.
- the first node extracts the amount of data to be sent from the CTS packet.
- the first node checks to see if it has an entry to its link table for the third node that includes the processing parameters of the third node.
- an inhibition time is calculated by summing these parameters with a worst case estimated propagation time of 53 microseconds which represents a propagation delay of 5.3 microseconds per mile over 10 miles and with the time necessary to transmit the length of data obtained in step 904 .
- the inhibition time is calculated by summing a worst case operating system latency of 1.2 milliseconds with the worst case propagation time of 53 microseconds and the time needed to transmit the length of data obtained in step 904 .
- transmission is inhibited for the calculated time.
Abstract
An Adjacency Detection Protocol (ADP) whereby a node in a wireless network may collect information about its neighbors. The collected information enables the establishment of link layer connectivity between a node and its neighbors and also is useful for translating network layer addresses into link addresses. The collected information finds further use in preventing medium contention among adjacent nodes and in handling collisions.
Description
- The present application is related to the subject matter of “CSMA with Dynamic Persistence”, U.S. application Ser. No. ______, filed Sep. 7, 1995, assigned to the assignee of this application and expressly incorporated by reference for all purposes.
- The present invention relates generally to wireless data communications, and more particularly to a method and apparatus for establishing at a given wireless node, the availability of neighboring nodes for communications and certain characteristics of these neighboring nodes.
- It is desirable to provide wireless data communications services comparable to those available via wired links. However, the physical limitations inherent in wireless communications prevent the ready adaptation of protocols developed in the wired context to wireless applications. In particular, protocols that require nodes in a network to collect and take advantage of information about the other nodes with which they may communicate do not readily transfer to the wireless context.
- One example of a wired communications protocol unsuitable for wireless application is the CSMA/CD multiple access protocol commonly used to resolve shared media contention in local area networks (LANs). This link layer protocol takes advantage of so-called carrier sensing to reduce the frequency of collisions on a shared medium. When one node coupled to the shared medium is transmitting, other nodes can sense this and stay off the medium until it is free.
- Radio-based protocols, despite relying on a shared medium, cannot usually rely on carrier sensing. In the first place, it is fairly difficult and time consuming to determine in a wireless context whether or not a transmitter is active. Furthermore, another obstacle to the successful application of carrier sensing techniques is that the physical medium used by wireless communications is not shared in the same sense as the LAN medium is shared. In the LAN context, a node that can talk to one node, can talk to and be heard by all nodes. In the wireless context, a node A may be able to communicate with a node B that itself can communicate with a node C while node A cannot itself communicate with node C. Thus, a transmission from node C to node B could interfere with a transmission from node A to node B, even though node A cannot hear node C and thus would not know to inhibit itself from transmitting while node C is transmitting. This is the so-called hidden terminal problem. If only node C can communicate with a node D, another problem would arise in that a transmission from B to A would inhibit a transmission from C to D even though D would not be able to hear B. This is the so-called exposed terminal problem.
- Another such protocol unsuitable for wireless application is the Address Resolution Protocol (ARP). ARP is a network layer protocol belonging to the Internet Protocol (IP) suite and is widely used to translate IP addresses into LAN addresses. Typically, to support address translation by ARP, a node connected to a LAN that needs to translate an IP address into a LAN link layer address sends out an ARP broadcast message specifying the IP address. The LAN node having that IP address then responds to the ARP broadcast message with a message including the IP address and LAN address. Unfortunately, broadcasting ARP messages to acquire link layer addresses is impractical in the wireless context because all nodes cannot hear a single broadcast and thus the ARP messages would have to be endlessly relayed, causing congestion and degradation of network performance.
- Other problems related to knowledge of neighboring nodes arise in the area of routing protocols. Protocols used to establish routing information in wired systems such as the open Shortest Path First (OSPF) protocol used in IP require complex synchronization of routing information between adjacent nodes and do not take into account the less reliable nature of wireless links, in that some connections may be asymmetric (one way channel), and that wireless links in general will have a high bit error rate. Nor do they take into account that, for wireless links, transmission and processing delays vary on a per link basis.
- The invention provides an Adjacency Detection Protocol (ADP) whereby a node in a wireless network may collect information about its neighbors. The collected information enables the efficient establishment of link layer connectivity between a node and its neighbors and also is useful for translating network layer addresses into link layer addresses. The collected information finds further use in preventing medium contention among adjacent nodes and in handling collisions.
- According to a first aspect of the invention, a selected node in a wireless network listens for certain link layer protocol messages from its neighbors. The link layer protocol message may be a broadcast message sent out for this purpose, a targeted message sent to the selected node for this purpose, or a link layer protocol message having some other purpose. If one is received, the selected node creates an entry in a link table for the originating node, sets a timer, and sends a reply specifically addressed to the originating node. If an acknowledgement is received from the originating node prior to expiration of the timer, the link is marked as a good link.
- The acknowledgement may include certain useful parameters of the originating node relating to its latency time in processing messages.
- According to a second aspect of the invention, a protocol for resolving medium contention in a wireless network is enhanced by taking advantage of stored information about the message processing time of neighbors. A first node in the wireless network receives a packet from a second node that includes parameters relating to the second node's message processing time. Thereafter, when the first node overhears a ready-to-send packet sent by a third node to the second node, it responds by inhibiting its own transmitter for long enough to allow the second node to respond with a clear-to-send packet. In accordance with the invention, this inhibition time incorporates the second node's latency time. Alternatively, if the first node overhears a clear-to-send packet sent by a third node to the second node, it inhibits its own transmitter for long enough to allow the second node respond by transmitting data. This inhibition time also incorporates the second node's latency time.
- According to a third aspect of the invention, a selected node in a wireless network collects network layer address information about its neighbors. When a link to a neighbor is created in accordance by the link layer, the network layer is notified of the new link and responds by invoking a network layer protocol that obtains network layer address information about the selected node. The network layer address information is then available to network layer protocols for routing and other purposes.
- The invention will be better understood by reference to the following detailed description in connection with the accompanying drawings.
- FIG. 1 depicts a representative wireless packet communication network suitable for implementing the present invention.
- FIG. 2 is a simplified diagram of a wireless router system suitable for implementing the present invention.
- FIG. 3 depicts the organization of link information stored within a wireless node in accordance with one embodiment of the present invention.
- FIG. 4 depicts a transition diagram for a state machine that maintains a link table in accordance with one embodiment of the present invention.
- FIG. 5 depicts a transition diagram for a state machine that regulates the broadcast of certain messages in accordance with one embodiment of the present invention.
- FIG. 6 depicts a transition diagram for a state machine that regulates the collection of network layer address information in accordance with one embodiment of the present invention.
- FIGS.7A-7B depict problems raised by the application of carrier sensing to wireless networks.
- FIG. 8 is a flowchart describing the steps of responding to an overheard RTS packet in accordance with one embodiment of the present invention.
- FIG. 9 is a flowchart describing the steps of responding to an overheard CTS packet in accordance with one embodiment of the present invention.
- Network Suitable for Implementing Present Invention
- FIG. 1 depicts a representative
wireless network 100 suitable for implementing the present invention. A plurality of local area networks (LANs) 102 each interconnect a number ofhost computers 104 and a singlewireless router system 106. Thewireless router systems 106 in turn are interconnected by aregional network 108 to multiple points of presence (PoPs) 110 which serve as interconnects to abackbone network 112. -
Host computers 104 may incorporate any processor or operating system DOS/Windows, Apple System 7, UNIX, OS/2, etc. but preferably support a TCP/IP protocol stack. LAN 102 is preferably of the well known Ethernet type. End user packets originating from ahost computer 104 are routed viawireless router system 106 andregional network 108 to thenearest POP 110. This is either done directly when thewireless router system 106 is within rage of aPOP 110, or done indirectly when that is not the case. Preferably,backbone network 108 is configured to require a maximum of three hops. The choices of frequency, modulation scheme etc. are not important to the present invention. Traffic from the POP is aggregated and ported out to a connection tobackbone network 112, either via a wireline network, a high-speed radio link, or using microwave or satellite technology. Similarly,backbone network 112, which provides a long distance link that cross-connect regional networks could make use of wireline, microwave, or satellite technology. - The overall networking scheme described herein supports the transport of IP packets and thus enables
host computers 104 to take advantage of Internet applications such as electronic mail, World Wide Web access, etc. despite the lack of a wired link to the Internet. Thus, particularly beneficial uses will be found in remote environments where wired connections are expensive or unavailable for other reasons. The networking scheme described herein will also find use in mobile applications. - FIG. 2 depicts
wireless router system 106 in accordance with one embodiment of the invention.Wireless router system 106 includes arouter subsystem 202, awireless subsystem 204, and anantenna 206.Router subsystem 202 has an AC power input and a connection toLAN 102. The present embodiment ofrouter subsystem 202 includes an IBM PC compatible motherboard with a networking capability to connect to the LAN. Networking protocols necessary to the implementation ofregional network 108 including networking protocols of the present invention are stored as firmware. -
Router subsystem 202 is connected towireless subsystem 204 via the well-known synchronous EIA-530 interface.Wireless subsystem 204 itself has an AC power input and is connected toantenna 206 via an RF cable.Wireless subsystem 204 incorporates modulation/demodulation circuitry, a transceiver, and power amplification for the transmitted signal. The details of modulation, spectral allocation etc. are not important to the present invention. Also, not everyrouter subsystem 202 need be associated with aLAN 102.Regional network 108 may also incorporateadditional router subsystems 202 that are used exclusively for relaying packets to and from other routers or PoPs.Router subsystems 202 can be understood to be nodes ofregional network 108 and the terms “router subsystem”, “router”, and “node” will be used interchangeably herein. - Overview of the Preferred Embodiment
- The preferred embodiment of the present invention is directed primarily toward the operation of router subsystems within
regional network 108 to transport network layer packets. In the preferred embodiment, the network layer operates in accordance with IP, although other network layer protocols would be possible within the scope of the present invention. In order to permit the smooth operation of IP overregional network 108, several support functions are required. One essential function is the translation of IP addresses to the link layer addresses specific to the architecture ofregional network 108. Another is collection of adjacency information about neighboring router subsystems. This adjacency information is essential to IP routing protocols. - The present invention provides an Adjacency Detection Protocol (ADP) suitable to wireless applications to collect information about adjacent routers. The information collected at each routing subsystem or node preferably includes the availability of links to adjacent nodes and message processing speed parameters of adjacent nodes. As will be explained below, this last parameter is particularly useful in resolving physical medium contention by competing nodes. The ADP also assists network layer protocols in the efficient collection of network layer address information about adjacent nodes. The ADP of the present invention preferably operates at the link layer of the well known seven layer model of digital communications, relying on the exchange of various link layer packets to collect the needed information.
- Accumulation of Adjacency Information
- The present invention provides a simple yet powerful protocol for accumulating information about adjacent nodes. Transmission of messages is minimized, greatly reducing implementation cost in the wireless context.
- FIG. 3 depicts a simplified representation of an electronically stored link table. Each link table entry preferably includes a
link layer address 302 identifying an adjacent node, a state of thelink 304, ameasure 306 of the adjacent node's processing speed, ameasure 308 of the adjacent node's system load and ameasure 310 of interrupt latency. The link table is stored within eachrouter system 202. Higher level IP routing and address translation protocols make use of the adjacency information stored in the link table of FIG. 3. As will be further described below, in accordance with the invention, a link layer protocol for preventing medium contention takes advantage ofmeasures - An adjacent node having an entry marked with a GOOD state is one to which connections are possible. A CANDIDATE state indicates awareness of an adjacent node that is currently being evaluated for promotion to GOOD. A SUSPECT state indicates an adjacent node for which connection is still possible but if nothing is heard from that link for a predetermined time period, the link may be marked as DEAD. After a time, a DEAD link may be deleted from the link entry table. A node with no entry in the link table is described herein as being in the NO LINK state.
- The process by which the link table of FIG. 3 is maintained by the ADP will be discussed in detail with reference to FIG. 4. FIG. 4 depicts a transition diagram400 for a state machine that maintains a link table in accordance with one embodiment of the present invention. The state machine of FIG. 4 is currently implemented in software though those of skill in the art will appreciate that a hardware implementation would also be possible within the scope of the present invention.
- The following link layer messages are used to implement ADP.
- HelloBroadcast: A message with NO destination link layer address.
- HelloDirected: A message with a specific destination link layer address.
- HelloReply: A message with a specific destination link layer address that also includes
measures Measure 306 indicates processing speed and is determined by running a fixed loop of code.Measure 308 indicates system load and is determined by measuring a time between invocations of the lowest priority task.Measure 310 indicates interrupt latency, the time from when a hardware device requests service and to when the request is serviced, and is a value entered by an operator. - The following events at a selected node may trigger a transition either to another state or to the same state in the state machine of FIG. 4.
- HBrd: Heard a HelloBroadcast from an adjacent node X.
- HDir: Heard a HelloDirected addressed to this node.
- HRep: Heard a HelloReply addressed to this node.
- LLCm: Heard an link layer control (LLC) dialogue message addressed to this node from node X, and this message was a type which was in reply to something this node sent to X, implying that X heard this node. Examples of LLC dialogue messages include clear-to-send (CTS), return-to-send (RTS), acknowledge (ACK), and the HelloDirected and HelloReply messages.
- LLCx: Heard an LLC dialog message from node X addressed to some other node.
- Other events relate to the operation of timers maintained in connection with the state machine of FIG. 4.
- T1exp: Timer T1 has expired.
- T2exp: Timer T2 has expired.
- T3exp: Timer T3 has expired.
- T4exp: Timer T4 has expired.
- A change in states in FIG. 4 may be accompanied by various actions.
- “Set timer” signifies starting a particular timer with its timeout value when it is not currently running; when the time elapses, an expiration event is triggered.
- “Clear timer” signifies stopping a timer without causing its expiration event trigger.
- “Reset timer” signifies restarting a timer with its timeout value without triggering its expiration event.
- “Set LLPs” means extracting and storing the remote node's processing parameters, such as processor speed, interrupt latency, and approximated traffic load.
- There are four timers with the following timer values:
- T1=60 seconds.
- T2=60 seconds.
- T3=60 seconds.
- T4=3600 seconds.
- With the above definitions understood, the operation of the state machine of FIG. 4 at a selected node may now be described in detail. As described above, the possible states are NO
LINK 402,CANDIDATE 404,GOOD 406,SUSPECT 408, andDEAD 410. A line between states, or a line returning to the same state signifies a transition with the events triggering the transition and the actions associated with the transition being indicated by text written by the line. - An adjacent node begins in NO
LINK state 402, that is with no link table entry. If a HelloBroadcast, HelloDirected, or LLCx message is heard from this adjacent node, the adjacent node is moved toCANDIDATE state 402, taking atransition 412 to theCANDIDATE state 404. Several actions are also taken. An entry, X, marked CANDIDATE, is created in the link table for this adjacent node. The selected node sends an HelloDirected message to this adjacent node and starts timer T1. - Once in
CANDIDATE state 404, if T1 expires the adjacent node returns to NO LINK via atransition 414 and the link is deleted from the table. If the selected node receives a HelloDirected message from the adjacent node, it replies with a HelloReply that includes its processing parameters but the adjacent node returns to CANDIDATE state via atransition 416. This HelloReply assists the adjacent node in the preparation of its own link table. - If the selected node itself receives a HelloReply from the adjacent node while in
CANDIDATE state 404, it responds by taking atransition 418 toGOOD state 406. It also clears timer T1 and sets timer T2. The HelloReply message includes the processing parameters including processor speed, service load, and operating system latency. These values are entered in the link table. Now connections may be made to the adjacent node. - Once in
GOOD state 406, receipt of an LLCm message from the adjacent node will cause timer T2 to be set and continuation inGOOD state 406 via atransition 420. If the received LLCm message is a HelloDirected message, a HelloReply is sent to the adjacent node. Thus, periodic link activity maintains the link inGOOD state 406. If however, timer T2 expires, atransition 422 to SUSPECTstate 408 occurs along with transmission of an HelloDirected message to the adjacent node, and setting of timer T3. Connection to the adjacent node remains possible inSUSPECT state 408. - If while in
SUSPECT state 408, an LLCm message is received from the adjacent node, the adjacent node returns toCANDIDATE state 406 via atransition 424. If the LLCm message is a HelloReply, the processing parameters are extracted and stored in the link table. If the LLCm message is a HelloDirected, a HelloReply is sent to the adjacent node. Timer T2 is also set. - If, while in
SUSPECT state 408, timer T3 expires, then the adjacent node takes atransition 426 toDEAD state 410. Timer T3 clears and timer T4 is set. Connections to an adjacent node inDEAD state 410 are not possible. - Once in
DEAD state 410, if an LLCm message is received from the adjacent node, the adjacent node returns toCANDIDATE state 406 via atransition 428. If the LLCm message is a HelloDirected, a HelloReply is sent. If timer T4 expires, the adjacent node returns to NOLINK state 402 via transition 430 and its link entry is deleted. - The above-described process assumes the periodic transmission of HelloBroadcast messages to accelerate completion and updating of the link table. FIG. 5 depicts a transition diagram500 for a state machine that regulates the transmission of HelloBroadcast messages in accordance with one embodiment of the present invention. There are two states, a PRIME
LINK TABLE state 502 and a MAINTAINLINK TABLE state 504. In PRIMELINK TABLE state 502, HelloBroadcasts are periodically transmitted to accelerate updating of the link table. In MAINTAINLINK TABLE state 504, HelloBroadcasts are not transmitted. The link table will continue to be modified since messages will be received from adjacent nodes. - Referring now to FIG. 5, when the link layer control software of a selected node starts, PRIME
LINK TABLE state 502 is entered via atransition 506. Furthermore, timer T5 is set to 15 seconds and timer T6 is set to 600 seconds. Once in PRIMELINK TABLE state 502, if T5 expires, a HelloBroadcast is sent out. The selected node then returns to PRIME LINK TABLE 502 state via atransition 508 and resets timer T5. If T6 expires, the selected node moves to MAINTAINLINK TABLE state 504 via atransition 510 and clears timer T5. The selected node remains in MAINTAINLINK TABLE state 504 until any of the links in the link table transitions toDEAD state 410. Once this happens, timer T5 is set to 15 seconds, timer T2 is set to 600 seconds, and the selected node returns to PRIME LINK TABLE state via atransition 512. - Providing Link Layer to Network Layer Connectivity
- The present invention also provides a method and apparatus for collecting network layer address information about adjacent nodes without the use of broadcast messages. Once a link to an adjacent node is established, the network layer is notified and a network layer protocol is invoked to identify the network layer address of the adjacent node. The network layer address is stored with the link layer address of the adjacent node in an address resolution table. The address resolution table facilitates translation from network layer addresses to link layer addresses. In the preferred embodiment, the network layer operates in accordance with IP and the network layer protocol invoked is Reverse Address Resolution Protocol (RARP).
- FIG. 6 depicts a transition diagram600 for a state machine that regulates the collection of network layer address information for a particular adjacent node in accordance with one embodiment of the present invention. Like the state machines of FIGS. 4-5, the state machine of FIG. 6 is operative at the link layer. There are two states for each adjacent node, a
QUIET state 602, and anIP WAIT state 604. Operation begins in the QUIET state. Once a link to any adjacent node transitions toGOOD state 406, the adjacent node transitions toIP WAIT state 604 via a transition 606. The network layer (IP in the preferred embodiment) is notified to take action to discover the network layer address of the new adjacent node and a timer T7 is set to 5 seconds. In the preferred embodiment, the action taken by the network layer is invocation of Reverse Address Resolution Protocol (RARP) to discover the IP address of the adjacent node via an exchange of IP layer messages. - Once in
IP WAIT state 604, if T7 expires before there is any indication that RARP has successfully acquired the needed IP address, it is reset, and the network layer is notified to repeat the RARP operation. The IP WAIT state continues via atransition 608. This step of repeating is necessary because the IP layer will not automatically repeat the RARP operation if the IP address is not successfully acquired for some reason. The link layer thus operates to keep repeating the RARP operation until the IP address of the adjacent node is successfully acquired. If RARP successfully acquires the needed IP address, or if the adjacent node leaves GOOD state 606, timer T7 is cleared and atransition 610 is taken to QUIETstate 602. - Applying Message Processing Time to Resolving Medium Contention
- In accordance with the invention, the processing parameters collected by ADP are used to optimize the performance of link layer protocols used to prevent collisions, i.e., simultaneous transmissions by competing nodes on the same radio channel. While one node is transmitting, other nodes can sense this and inhibit transmission until the common medium is free. The application of carrier sensing to wireless network raises certain problems however.
- FIG. 7A depicts the classic hidden terminal problem raised by the application of carrier sensing to wireless networks. A node A may be able to communicate with a node B that itself can communicate with a node C while node A cannot itself communicate with node C. Thus, a transmission from node C to node B could interfere with a transmission from node A to node B, even though node A cannot hear node C and thus would not know to inhibit itself from transmitting while node C is transmitting.
- FIG. 7B depicts the classic exposed terminal problem raised by the application of carrier sensing to wireless networks. If only node C can communicate with a node D, a problem arises in that a transmission from B to A would inhibit a transmission from C to D even though D would not be able to hear B.
- In recognition of these problems, an alternative scheme for resolving medium contention in wireless networks has been described in P. Karn,MACA—A New Channel Access Method for Packet Radio, (Conference Paper from Sep. 22, 1990 ARRL Conference in London, Ontario), the contents of which are herein expressly incorporated by reference for all purposes. Therein is disclosed the so-called MACA (Multiple Access with Collision Avoidance) technique, a method for avoiding collisions without relying on carrier sensing.
- In accordance with the MACA method, a node with data to transmit sends a ready-to-send (RTS) packet to the desired destination node. The RTS packet includes the amount of data to be transmitted. The destination node then responds with a clear-to-send (CTS) packet that also includes the amount of data to be transmitted. Any other node overhearing the RTS packet inhibits its own transmission for long enough to allow the destination node to respond with a CTS packet. Any other node overhearing the CTS packet inhibits its own transmission long enough for the data to be transmitted.
- The present invention provides an enhanced technique for determining the proper inhibition times that takes advantage of the processing parameter information collected concerning adjacent nodes. The inhibition times thus take into account the processing speed and traffic loads of the adjacent nodes. Since inhibition times are more accurate, the frequency of collisions is further reduced while maintaining efficient usage of available radio channels.
- Recalling from the discussion in reference to FIG. 3, each node stores various indicia of processing speed for the neighbors to which it has active links. These include measures of raw processing speed, system load, and interrupt latency. The calculation of overall message processing latency time takes into account these factors as well as an estimate of propagation time.
- In the preferred embodiment of the present invention, the three message processing parameters are received from the adjacent nodes as independent values. A single value incorporating the sum of the three indicia could also be sent but sending the parameters separately facilitates troubleshooting of adjacent nodes.
- FIG. 8 is a flowchart describing the steps of responding to an overheard RTS packet in accordance with one embodiment of the present invention. At
step 802, a first node overhears a RTS packet from a second node to a third node. The first node must now determine for how long to inhibit its own transmissions to allow the third node to respond. - At
step 804, the first node checks to see if it has an entry to its link table for the third node that includes the processing parameters of the third node. Atstep 806, if processing parameters are available for the third node, an inhibition time is calculated by summing these parameters with a worst case estimated propagation time of 53 microseconds which represents a propagation delay of 5.3 microseconds per mile over 10 miles. Atstep 808, if processing parameters are not available for the third node, e.g., because there is no link to the third node, the inhibition time is calculated by summing a worst case operating system latency of 1.2 milliseconds with the worst case propagation time of 53 microseconds. Atstep 810, transmission is inhibited for the calculated time. - FIG. 9 is a flowchart describing the steps of responding to an overheard CTS packet in accordance with one embodiment of the present invention. At
step 902, a first node overhears a CTS packet from a second node to a third node. The first node must now determine for how long to inhibit its own transmissions to allow the third node to respond. - At
step 904, the first node extracts the amount of data to be sent from the CTS packet. Atstep 906, the first node checks to see if it has an entry to its link table for the third node that includes the processing parameters of the third node. Atstep 908, if processing parameters are available for the third node, an inhibition time is calculated by summing these parameters with a worst case estimated propagation time of 53 microseconds which represents a propagation delay of 5.3 microseconds per mile over 10 miles and with the time necessary to transmit the length of data obtained instep 904. Atstep 910, if processing parameters are not available for the third node, e.g., because there is no link to the third node, the inhibition time is calculated by summing a worst case operating system latency of 1.2 milliseconds with the worst case propagation time of 53 microseconds and the time needed to transmit the length of data obtained instep 904. Atstep 912, transmission is inhibited for the calculated time. - The application of the processing parameters to resolving collisions once they occur is discussed in “CSMA with Dynamic Persistence”, U.S. application Ser. No. ______, assigned to the assignee of the present application.
- As will be understood by those familiar with the art, the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. Accordingly, reference should be made to the appended claims which set forth the scope of the present invention.
Claims (16)
1. In a wireless packet communication network comprising a plurality of nodes, wherein a first node may directly communicate with some nodes and not with others, a method for preventing contention over a shared communications medium comprising the steps of:
receiving, at said first node, a packet from a second node including an estimated receiver processing delay of said second node; thereafter
receiving, at said first node, a request to send (RTS) packet sent by a third node and addressed to said second node; and thereafter
responding, at said first node, to said RTS packet, by inhibiting transmission at said first node for a time period, wherein said time period represents an estimate of time required at said third node to reply to said RTS packet with a clear-to-send (CTS) packet and is determined in accordance with said estimated receiver processing delay.
2. In a wireless packet communication network comprising a plurality of nodes, wherein a first node may directly communicate with some nodes and not with others, a method for preventing contention over a shared communications medium comprising the steps of:
receiving, at said first node, a packet from a second node including an estimated receiver processing delay of said second node; thereafter
receiving, at said first node, a clear to send (CTS) packet sent by a third node and addressed to said second node, said CTS packet including a length of data to be transmitted from said second node to said third node; and thereafter
responding, at said first node, to said CTS packet, by inhibiting transmission at said first node for a time period, wherein said time period is determined in accordance with said length of data and said estimated receiver processing delay of said second node.
3. A first node adapted to transmit and receive data packets in a wireless communication network, said first node comprising:
means for receiving a packet from a second node including an estimated receiver processing delay;
means for receiving a request to send (RTS) packet sent by a third node and addressed to said second node; and
means for responding to said RTS packet by inhibiting transmission at said first node for a time period, wherein said time period represents an estimate of time required at said third node to reply to said RTS packet with a clear-to-send packet and is determined in accordance with said estimated receiver processing delay.
4. A first node adapted to transmit and receive data packets in a wireless communication network, said first node comprising:
means for receiving a packet from a second node including an estimated receiver processing delay of said second node;
means for receiving a clear to send (CTS) packet sent by a third node and addressed to said second node, said CTS packet including a length of data to be transmitted from said second node to said third node; and
means for responding to said CTS packet, by inhibiting transmission at said first node for a time period, wherein said time period is determined in accordance with said length of data and said estimated receiver processing delay of said second node.
5. In a wireless packet communication network, a method for collecting, at a selected node, information about adjacent nodes with which said selected node may directly communicate, said method comprising the steps of:
a) receiving a first link protocol message sent by a first adjacent node; thereafter
b) responding to said first link protocol message by electronically storing an entry including a link layer address of said first adjacent node in a link table, said indication including an indication of a candidate link to said first adjacent node;
setting a first timer to count for a first predetermined time period;
transmitting a second link protocol message including a link layer address of said first adjacent node;
c) if said first timer expires prior to receipt of any third link protocol message from said first adjacent node, deleting said link table entry; and
d) if a third link protocol message including parameters of said first adjacent node is received prior to expiration of said first timer, changing said candidate link indication to a good link indication.
6. The method of claim 5 wherein said (d) step comprises the substeps of:
if said third link protocol message replying to said second link protocol message is received prior to expiration of said first timer,
(d1) extracting parameters of said first adjacent node from said third link protocol message; and
(d2) storing said parameters as a part of said link table entry.
7. The method of claim 5 wherein said (d) step comprises the substeps of:
if said third link protocol message replying to said second link protocol message is received prior to expiration of said first timer,
(d1) invoking a network layer protocol to obtain an network layer address of said first adjacent node,
(d2) electronically storing, at said selected node, said network layer address of said first adjacent node and said link layer address of said first adjacent node as an entry in an address resolution table.
8. The method of claim 7 wherein said (d1) step comprises invoking a Reverse Address Resolution Protocol (RARP) program.
9. In a wireless packet communication network, apparatus for collecting, at a selected node, information about adjacent nodes with which said selected node may directly communicate, said apparatus comprising:
a) means for receiving a first link protocol message sent by a first adjacent node;
b) means for responding to said first link protocol message by
electronically storing an entry including a link layer address of said first adjacent node in a link table, said indication including an indication of a candidate link to said first adjacent node; and
setting a first timer to count for a first predetermined time period;
transmitting a second link protocol message including a link layer address of said first adjacent node; thereafter
c) means for, if said first timer expires prior to receipt of any third link protocol message from said first adjacent node, deleting said link table entry; and
d) means for, if a third link protocol message including parameters of said first adjacent node is received prior to expiration of said first timer, changing said candidate link indication to a good link indication.
10. The apparatus of claim 9 further comprising:
means for, if said third link protocol message replying to said second link protocol message is received prior to expiration of said first timer,
extracting parameters of said first adjacent node from said third link protocol message; and
storing said parameters as a part of said entry.
11. The apparatus of claim 9 further comprising means for:
if said third link protocol message replying to said second link protocol message is received prior to expiration of said first timer,
invoking a network layer protocol to obtain a network layer address of said first adjacent node,
electronically storing, at said selected node, said IP address of said first adjacent node and said link layer address of said first adjacent node as an entry in an address resolution table.
12. The method of claim 11 wherein said invoking means comprises means for invoking a Reverse Address Resolution Protocol (RARP) program.
13. In a wireless packet communication network, a method for collecting, at a selected node, IP address information about adjacent nodes with which said selected node may directly communicate, said method comprising the steps of:
establishing a link between a selected node and a first adjacent node using a link layer protocol, wherein a link layer address of said first adjacent node is obtained; thereafter
invoking, responsive to successful establishment of a link in said establishing step, a network layer protocol to obtain a network layer address of said first adjacent node; and thereafter
storing said network layer address of said adjacent node and said link layer address of said adjacent node as an entry in an address resolution table.
14. The method of claim 13 wherein said invoking step comprises invoking a Reverse Address Resolution Protocol (RARP) routine to obtain an IP address of said first adjacent node.
15. In a wireless packet communication network, apparatus for collecting, at a selected node, IP address information about adjacent nodes with which said selected node may directly communicate, said apparatus comprising:
means for establishing a link between a selected node and a first adjacent node using a link layer protocol, wherein a link layer address of said first adjacent node is obtained;
means for invoking, responsive to successful establishment of a link in said establishing step, a network layer protocol to obtain a network layer address of said first adjacent node; and
means for storing said network layer address of said adjacent node and said link layer address of said adjacent node as an entry in an address resolution table.
16. The apparatus of claim 15 wherein said invoking means comprises means for invoking a Reverse Address Resolution Protocol (RARP) routine to obtain an IP address of said first adjacent node.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/776,406 US20020006123A1 (en) | 1995-09-07 | 2001-02-02 | Enhanced adjacency detection protocol for wireless applications |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/526,130 US6192053B1 (en) | 1995-09-07 | 1995-09-07 | Enhanced adjacency detection protocol for wireless applications |
US09/776,406 US20020006123A1 (en) | 1995-09-07 | 2001-02-02 | Enhanced adjacency detection protocol for wireless applications |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/526,130 Division US6192053B1 (en) | 1995-09-07 | 1995-09-07 | Enhanced adjacency detection protocol for wireless applications |
Publications (1)
Publication Number | Publication Date |
---|---|
US20020006123A1 true US20020006123A1 (en) | 2002-01-17 |
Family
ID=24096040
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/526,130 Expired - Fee Related US6192053B1 (en) | 1995-09-07 | 1995-09-07 | Enhanced adjacency detection protocol for wireless applications |
US09/776,406 Abandoned US20020006123A1 (en) | 1995-09-07 | 2001-02-02 | Enhanced adjacency detection protocol for wireless applications |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/526,130 Expired - Fee Related US6192053B1 (en) | 1995-09-07 | 1995-09-07 | Enhanced adjacency detection protocol for wireless applications |
Country Status (1)
Country | Link |
---|---|
US (2) | US6192053B1 (en) |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020128041A1 (en) * | 2001-03-09 | 2002-09-12 | Parry Travis J. | Methods and systems for controlling multiple computing devices |
US7180875B1 (en) * | 2001-12-20 | 2007-02-20 | Meshnetworks, Inc. | System and method for performing macro-diversity selection and distribution of routes for routing data packets in Ad-Hoc networks |
US20070195798A1 (en) * | 2006-02-21 | 2007-08-23 | Jun Peng | Medium access control method and device |
US20080151860A1 (en) * | 2003-10-24 | 2008-06-26 | Sony Corporation | Wireless communication system, wireless communication device and wireless communication method, and computer program |
US7617302B1 (en) * | 2001-11-02 | 2009-11-10 | Nortel Networks Limited | Communication networks |
US20100057919A1 (en) * | 2008-08-27 | 2010-03-04 | At&T Intellectual Property I, L.P. | System and Method to Provide a Network Service |
US20160100441A1 (en) * | 2012-08-03 | 2016-04-07 | Honggang Li | High efficiency distributed device-to-device (d2d) channel access |
US10425846B2 (en) | 2012-08-03 | 2019-09-24 | Intel Corporation | Network assistance for device-to-device discovery |
US11122647B2 (en) | 2012-08-03 | 2021-09-14 | Apple Inc. | Enhanced node B, user equipment and methods for discontinuous reception in inter-eNB carrier aggregation |
Families Citing this family (86)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6625162B2 (en) * | 1997-12-17 | 2003-09-23 | Canon Kabushiki Kaisha | Method and apparatus for data transmission with control over access to a transmission medium |
US6133912A (en) * | 1998-05-04 | 2000-10-17 | Montero; Frank J. | Method of delivering information over a communication network |
US20080034113A1 (en) | 1998-05-04 | 2008-02-07 | Frank Montero | Method of contextually determining missing components of an incomplete uniform resource locator |
JP3519616B2 (en) * | 1998-10-21 | 2004-04-19 | 株式会社日立製作所 | Relay device |
US6385174B1 (en) * | 1999-11-12 | 2002-05-07 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for transmission of node link status messages throughout a network with reduced communication protocol overhead traffic |
US6349210B1 (en) | 1999-11-12 | 2002-02-19 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for broadcasting messages in channel reservation communication systems |
US6980537B1 (en) | 1999-11-12 | 2005-12-27 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for communication network cluster formation and transmission of node link status messages with reduced protocol overhead traffic |
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 |
US6556582B1 (en) * | 2000-05-15 | 2003-04-29 | Bbnt Solutions Llc | Systems and methods for collision avoidance in mobile multi-hop packet radio networks |
US7031288B2 (en) * | 2000-09-12 | 2006-04-18 | Sri International | Reduced-overhead protocol for discovering new neighbor nodes and detecting the loss of existing neighbor nodes in a network |
US6807165B2 (en) | 2000-11-08 | 2004-10-19 | Meshnetworks, Inc. | 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 |
US6873839B2 (en) | 2000-11-13 | 2005-03-29 | Meshnetworks, Inc. | Prioritized-routing for an ad-hoc, peer-to-peer, mobile radio access system |
US7072650B2 (en) | 2000-11-13 | 2006-07-04 | Meshnetworks, Inc. | Ad hoc peer-to-peer mobile radio access system interfaced to the PSTN and cellular networks |
US7151769B2 (en) * | 2001-03-22 | 2006-12-19 | Meshnetworks, Inc. | Prioritized-routing for an ad-hoc, peer-to-peer, mobile radio access system based on battery-power levels and type of service |
CN1628450B (en) * | 2001-05-01 | 2010-05-26 | Meta4hand公司 | Wireless network computing |
US7756041B2 (en) * | 2001-06-14 | 2010-07-13 | Meshnetworks, Inc. | Embedded routing algorithms under the internet protocol routing layer of a software architecture protocol stack in a mobile Ad-Hoc network |
US6931441B1 (en) * | 2001-06-29 | 2005-08-16 | Cisco Technology, Inc. | Method and apparatus for managing a network using link state information |
US7206294B2 (en) * | 2001-08-15 | 2007-04-17 | Meshnetworks, Inc. | Movable access points and repeaters for minimizing coverage and capacity constraints in a wireless communications network and a method for using the same |
US7349380B2 (en) * | 2001-08-15 | 2008-03-25 | Meshnetworks, Inc. | System and method for providing an addressing and proxy scheme for facilitating mobility of wireless nodes between wired access points on a core network of a communications network |
US7072323B2 (en) * | 2001-08-15 | 2006-07-04 | Meshnetworks, Inc. | System and method for performing soft handoff in a wireless data network |
US7613458B2 (en) * | 2001-08-28 | 2009-11-03 | Meshnetworks, Inc. | System and method for enabling a radio node to selectably function as a router in a wireless communications network |
US7145903B2 (en) * | 2001-09-06 | 2006-12-05 | Meshnetworks, Inc. | Multi-master bus architecture for system-on-chip designs |
WO2003028245A1 (en) * | 2001-09-25 | 2003-04-03 | Meshnetworks, Inc. | A system and method employing algorithms and protocols for optimizing carrier sense multiple access (csma) protocols in wireless networks |
US6754188B1 (en) | 2001-09-28 | 2004-06-22 | Meshnetworks, Inc. | System and method for enabling a node in an ad-hoc packet-switched wireless communications network to route packets based on packet content |
US6768730B1 (en) | 2001-10-11 | 2004-07-27 | Meshnetworks, Inc. | System and method for efficiently performing two-way ranging to determine the location of a wireless node in a communications network |
US6982982B1 (en) | 2001-10-23 | 2006-01-03 | Meshnetworks, Inc. | System and method for providing a congestion optimized address resolution protocol for wireless ad-hoc networks |
US6771666B2 (en) | 2002-03-15 | 2004-08-03 | Meshnetworks, Inc. | System and method for trans-medium address resolution on an ad-hoc network with at least one highly disconnected medium having multiple access points to other media |
WO2003037009A1 (en) * | 2001-10-23 | 2003-05-01 | Meshnetworks, Inc. | System and method for providing a congestion optimized address resolution protocol for wireless ad-hoc networks |
US7181214B1 (en) | 2001-11-13 | 2007-02-20 | Meshnetworks, Inc. | System and method for determining the measure of mobility of a subscriber device in an ad-hoc wireless network with fixed wireless routers and wide area network (WAN) access points |
US7136587B1 (en) | 2001-11-15 | 2006-11-14 | Meshnetworks, Inc. | System and method for providing simulated hardware-in-the-loop testing of wireless communications networks |
US6728545B1 (en) | 2001-11-16 | 2004-04-27 | Meshnetworks, Inc. | System and method for computing the location of a mobile terminal in a wireless communications network |
US7221686B1 (en) | 2001-11-30 | 2007-05-22 | Meshnetworks, Inc. | System and method for computing the signal propagation time and the clock correction for mobile stations in a wireless network |
US7190672B1 (en) | 2001-12-19 | 2007-03-13 | Meshnetworks, Inc. | System and method for using destination-directed spreading codes in a multi-channel metropolitan area wireless communications network |
US7106707B1 (en) | 2001-12-20 | 2006-09-12 | Meshnetworks, Inc. | System and method for performing code and frequency channel selection for combined CDMA/FDMA spread spectrum communication systems |
US7280545B1 (en) | 2001-12-20 | 2007-10-09 | Nagle Darragh J | Complex adaptive routing system and method for a nodal communication network |
US7072618B1 (en) | 2001-12-21 | 2006-07-04 | Meshnetworks, Inc. | Adaptive threshold selection system and method for detection of a signal in the presence of interference |
US6674790B1 (en) | 2002-01-24 | 2004-01-06 | Meshnetworks, Inc. | System and method employing concatenated spreading sequences to provide data modulated spread signals having increased data rates with extended multi-path delay spread |
US6617990B1 (en) | 2002-03-06 | 2003-09-09 | Meshnetworks | Digital-to-analog converter using pseudo-random sequences and a method for using the same |
US7058018B1 (en) | 2002-03-06 | 2006-06-06 | Meshnetworks, Inc. | 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 |
US6904021B2 (en) | 2002-03-15 | 2005-06-07 | Meshnetworks, Inc. | System and method for providing adaptive control of transmit power and data rate in an ad-hoc communication network |
AU2003223263A1 (en) | 2002-03-15 | 2003-09-29 | Meshnetworks, Inc. | System and method for auto-configuration and discovery of ip to mac address mapping and gateway presence |
US6987795B1 (en) | 2002-04-08 | 2006-01-17 | Meshnetworks, Inc. | System and method for selecting spreading codes based on multipath delay profile estimation for wireless transceivers in a communication network |
US7200149B1 (en) | 2002-04-12 | 2007-04-03 | Meshnetworks, Inc. | 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 |
US7697420B1 (en) | 2002-04-15 | 2010-04-13 | Meshnetworks, Inc. | System and method for leveraging network topology for enhanced security |
US7107498B1 (en) | 2002-04-16 | 2006-09-12 | Methnetworks, Inc. | System and method for identifying and maintaining reliable infrastructure links using bit error rate data in an ad-hoc communication network |
US6580981B1 (en) | 2002-04-16 | 2003-06-17 | Meshnetworks, Inc. | System and method for providing wireless telematics store and forward messaging for peer-to-peer and peer-to-peer-to-infrastructure a communication network |
US7142524B2 (en) * | 2002-05-01 | 2006-11-28 | Meshnetworks, Inc. | System and method for using an ad-hoc routing algorithm based on activity detection in an ad-hoc network |
US6970444B2 (en) | 2002-05-13 | 2005-11-29 | Meshnetworks, Inc. | System and method for self propagating information in ad-hoc peer-to-peer networks |
US7284268B2 (en) | 2002-05-16 | 2007-10-16 | Meshnetworks, Inc. | System and method for a routing device to securely share network data with a host utilizing a hardware firewall |
US7016306B2 (en) * | 2002-05-16 | 2006-03-21 | Meshnetworks, Inc. | System and method for performing multiple network routing and provisioning in overlapping wireless deployments |
US7167715B2 (en) * | 2002-05-17 | 2007-01-23 | Meshnetworks, Inc. | System and method for determining relative positioning in AD-HOC networks |
US7106703B1 (en) | 2002-05-28 | 2006-09-12 | Meshnetworks, Inc. | System and method for controlling pipeline delays by adjusting the power levels at which nodes in an ad-hoc network transmit data packets |
US7054126B2 (en) * | 2002-06-05 | 2006-05-30 | Meshnetworks, Inc. | System and method for improving the accuracy of time of arrival measurements in a wireless ad-hoc communications network |
US6744766B2 (en) | 2002-06-05 | 2004-06-01 | Meshnetworks, Inc. | Hybrid ARQ for a wireless Ad-Hoc network and a method for using the same |
US7610027B2 (en) * | 2002-06-05 | 2009-10-27 | Meshnetworks, Inc. | Method and apparatus to maintain specification absorption rate at a wireless node |
US6687259B2 (en) | 2002-06-05 | 2004-02-03 | Meshnetworks, Inc. | ARQ MAC for ad-hoc communication networks and a method for using the same |
AU2003238968A1 (en) * | 2002-06-11 | 2003-12-22 | Meshnetworks, Inc. | System and method for multicast media access in ad-hoc communication networks |
US7215638B1 (en) | 2002-06-19 | 2007-05-08 | Meshnetworks, Inc. | System and method to provide 911 access in voice over internet protocol systems without compromising network security |
US7072432B2 (en) * | 2002-07-05 | 2006-07-04 | Meshnetworks, Inc. | System and method for correcting the clock drift and maintaining the synchronization of low quality clocks in wireless networks |
US7796570B1 (en) | 2002-07-12 | 2010-09-14 | Meshnetworks, Inc. | Method for sparse table accounting and dissemination from a mobile subscriber device in a wireless mobile ad-hoc network |
US7046962B1 (en) | 2002-07-18 | 2006-05-16 | Meshnetworks, Inc. | System and method for improving the quality of range measurement based upon historical data |
US7042867B2 (en) * | 2002-07-29 | 2006-05-09 | Meshnetworks, Inc. | System and method for determining physical location of a node in a wireless network during an authentication check of the node |
EP1584160B1 (en) * | 2003-01-13 | 2011-07-06 | Meshnetworks, Inc. | System and method for achieving continuous connectivity to an access point or gateway in a wireless network following and on-demand routing protocol |
WO2004084022A2 (en) * | 2003-03-13 | 2004-09-30 | Meshnetworks, Inc. | Real-time system and method for computing location of mobile subcriber in a wireless ad-hoc network |
US7171220B2 (en) * | 2003-03-14 | 2007-01-30 | Meshnetworks, Inc. | System and method for analyzing the precision of geo-location services in a wireless network terminal |
WO2004109476A2 (en) * | 2003-06-05 | 2004-12-16 | Meshnetworks, Inc. | System and method to maximize channel utilization in a multi-channel wireless communication network |
WO2004109475A2 (en) * | 2003-06-05 | 2004-12-16 | Meshnetworks, Inc. | System and method for determining synchronization point in ofdm modems for accurate time of flight measurement |
US7215966B2 (en) * | 2003-06-05 | 2007-05-08 | Meshnetworks, Inc. | System and method for determining location of a device in a wireless communication network |
JP5037120B2 (en) * | 2003-06-05 | 2012-09-26 | メッシュネットワークス インコーポレイテッド | Optimal routing in ad hoc wireless communication networks |
EP1631915A4 (en) * | 2003-06-06 | 2012-04-25 | Meshnetworks Inc | System and method for characterizing the quality of a link in a wireless network |
JP4505454B2 (en) * | 2003-06-06 | 2010-07-21 | メッシュネットワークス インコーポレイテッド | System and method for improving overall performance of a wireless communication network |
US7126951B2 (en) * | 2003-06-06 | 2006-10-24 | Meshnetworks, Inc. | System and method for identifying the floor number where a firefighter in need of help is located using received signal strength indicator and signal propagation time |
US7075890B2 (en) | 2003-06-06 | 2006-07-11 | Meshnetworks, Inc. | System and method to provide fairness and service differentation in ad-hoc networks |
JP4460577B2 (en) | 2003-06-25 | 2010-05-12 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Distributed media access control method in communication network |
WO2005006660A1 (en) * | 2003-07-14 | 2005-01-20 | Nippon Telegraph And Telephone Corporation | Radio packet communication method and radio packet communication device |
US7532639B2 (en) * | 2003-09-10 | 2009-05-12 | Broadcom Corporation | System and method for message queue management in a power-save network |
US7167463B2 (en) * | 2004-10-07 | 2007-01-23 | Meshnetworks, Inc. | System and method for creating a spectrum agile wireless multi-hopping network |
US7688544B1 (en) * | 2005-05-23 | 2010-03-30 | Seagate Technology Llc | Magnetic heads disk drives and methods with floating pole tip or shunted pole tip for reduced pole tip erasure |
JP4604916B2 (en) * | 2005-08-29 | 2011-01-05 | パナソニック株式会社 | Wireless network system, wireless communication method, and wireless communication apparatus |
US7333903B2 (en) * | 2005-09-12 | 2008-02-19 | Acuity Brands, Inc. | Light management system having networked intelligent luminaire managers with enhanced diagnostics capabilities |
US7817063B2 (en) | 2005-10-05 | 2010-10-19 | Abl Ip Holding Llc | Method and system for remotely monitoring and controlling field devices with a street lamp elevated mesh network |
KR100695074B1 (en) * | 2006-01-09 | 2007-03-14 | 삼성전자주식회사 | Time synchronizing method in wireless sensor networks |
US8594976B2 (en) | 2008-02-27 | 2013-11-26 | Abl Ip Holding Llc | System and method for streetlight monitoring diagnostics |
US9781814B2 (en) | 2014-10-15 | 2017-10-03 | Abl Ip Holding Llc | Lighting control with integral dimming |
US9693428B2 (en) | 2014-10-15 | 2017-06-27 | Abl Ip Holding Llc | Lighting control with automated activation process |
US10481589B1 (en) * | 2019-05-08 | 2019-11-19 | Nll, Llc | Networked system for coordinated laser labelling of conveyed food products |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5504746A (en) * | 1991-10-01 | 1996-04-02 | Norand Corporation | Radio frequency local area network |
US5841764A (en) * | 1995-10-30 | 1998-11-24 | Ericsson Inc. | Method and apparatus for permitting a radio to originate and receive data messages in a data communications network |
US6041358A (en) * | 1996-11-12 | 2000-03-21 | Industrial Technology Research Inst. | Method for maintaining virtual local area networks with mobile terminals in an ATM network |
US6046992A (en) * | 1991-10-01 | 2000-04-04 | Intermec Ip Corp. | Radio frequency local area network |
US6151312A (en) * | 1996-02-12 | 2000-11-21 | Stanford Telecommunications, Inc. | Network protocol for wireless broadband-ISDN using ATM |
US6195705B1 (en) * | 1998-06-30 | 2001-02-27 | Cisco Technology, Inc. | Mobile IP mobility agent standby protocol |
US6307843B1 (en) * | 1997-07-18 | 2001-10-23 | Nec Corporation | Ad hoc network of mobile hosts using link table for identifying wireless links and destination addresses |
US6701375B1 (en) * | 1999-01-22 | 2004-03-02 | Northrop Grumman Corporation | Ultra-low bandwidth intra-network routing method |
Family Cites Families (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
ATE125088T1 (en) | 1988-11-14 | 1995-07-15 | Datapoint Corp | LOCAL NETWORK WITH MULTIPLE DYNAMIC OPERATING MODE CAPABILITIES. |
US5274841A (en) * | 1990-10-29 | 1993-12-28 | International Business Machines Corporation | Methods for polling mobile users in a multiple cell wireless network |
US5231534A (en) * | 1991-01-17 | 1993-07-27 | Olympus Optical Co., Ltd. | Real image mode variable magnification finder optical system |
US5231624A (en) | 1991-08-01 | 1993-07-27 | Tandy Corporation | System and method using a reduce profile light beam for high density recording on optical media |
US5276703A (en) * | 1992-01-13 | 1994-01-04 | Windata, Inc. | Wireless local area network communications system |
US5384777A (en) * | 1993-04-19 | 1995-01-24 | International Business Machines Corporation | Adaptive medium access control scheme for wireless LAN |
CA2103134C (en) * | 1993-11-15 | 1999-07-27 | Jeane Shu-Chun Chen | Medium access control protocol for wireless communication |
-
1995
- 1995-09-07 US US08/526,130 patent/US6192053B1/en not_active Expired - Fee Related
-
2001
- 2001-02-02 US US09/776,406 patent/US20020006123A1/en not_active Abandoned
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5504746A (en) * | 1991-10-01 | 1996-04-02 | Norand Corporation | Radio frequency local area network |
US6046992A (en) * | 1991-10-01 | 2000-04-04 | Intermec Ip Corp. | Radio frequency local area network |
US5841764A (en) * | 1995-10-30 | 1998-11-24 | Ericsson Inc. | Method and apparatus for permitting a radio to originate and receive data messages in a data communications network |
US6151312A (en) * | 1996-02-12 | 2000-11-21 | Stanford Telecommunications, Inc. | Network protocol for wireless broadband-ISDN using ATM |
US6041358A (en) * | 1996-11-12 | 2000-03-21 | Industrial Technology Research Inst. | Method for maintaining virtual local area networks with mobile terminals in an ATM network |
US6307843B1 (en) * | 1997-07-18 | 2001-10-23 | Nec Corporation | Ad hoc network of mobile hosts using link table for identifying wireless links and destination addresses |
US6195705B1 (en) * | 1998-06-30 | 2001-02-27 | Cisco Technology, Inc. | Mobile IP mobility agent standby protocol |
US6701375B1 (en) * | 1999-01-22 | 2004-03-02 | Northrop Grumman Corporation | Ultra-low bandwidth intra-network routing method |
Cited By (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020128041A1 (en) * | 2001-03-09 | 2002-09-12 | Parry Travis J. | Methods and systems for controlling multiple computing devices |
US7617302B1 (en) * | 2001-11-02 | 2009-11-10 | Nortel Networks Limited | Communication networks |
US7180875B1 (en) * | 2001-12-20 | 2007-02-20 | Meshnetworks, Inc. | System and method for performing macro-diversity selection and distribution of routes for routing data packets in Ad-Hoc networks |
US20080151860A1 (en) * | 2003-10-24 | 2008-06-26 | Sony Corporation | Wireless communication system, wireless communication device and wireless communication method, and computer program |
US8891456B2 (en) * | 2003-10-24 | 2014-11-18 | Sony Corporation | Wireless communication system, wireless communication device and wireless communication method, and computer program |
US20070195798A1 (en) * | 2006-02-21 | 2007-08-23 | Jun Peng | Medium access control method and device |
US7979565B2 (en) * | 2008-08-27 | 2011-07-12 | International Business Machines Corporation | System and method to provide a network service |
US20100057919A1 (en) * | 2008-08-27 | 2010-03-04 | At&T Intellectual Property I, L.P. | System and Method to Provide a Network Service |
US20160100441A1 (en) * | 2012-08-03 | 2016-04-07 | Honggang Li | High efficiency distributed device-to-device (d2d) channel access |
US10405211B2 (en) * | 2012-08-03 | 2019-09-03 | Intel Corporation | High efficiency distributed device-to-device (D2D) channel access |
US10425846B2 (en) | 2012-08-03 | 2019-09-24 | Intel Corporation | Network assistance for device-to-device discovery |
US20200021632A1 (en) * | 2012-08-03 | 2020-01-16 | Intel Corporation | High efficiency distributed device-to-device (d2d) channel access |
US10992722B2 (en) * | 2012-08-03 | 2021-04-27 | Apple Inc. | High efficiency distributed device-to-device (D2D) channel access |
US11122647B2 (en) | 2012-08-03 | 2021-09-14 | Apple Inc. | Enhanced node B, user equipment and methods for discontinuous reception in inter-eNB carrier aggregation |
Also Published As
Publication number | Publication date |
---|---|
US6192053B1 (en) | 2001-02-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6192053B1 (en) | Enhanced adjacency detection protocol for wireless applications | |
EP0903906B1 (en) | Devices for adaptive control of transport-layer connections between mobile and fixed hosts | |
US5661727A (en) | Schemes to determine presence of hidden terminals in wireless networks environment and to switch between them | |
Haas et al. | Dual busy tone multiple access (DBTMA)-performance evaluation | |
Garcia-Luna-Aceves et al. | Distributed assignment of codes for multihop packet-radio networks | |
US5673031A (en) | Redundant radio frequency network having a roaming terminal communication protocol | |
US7916747B2 (en) | Redundant radio frequency network having a roaming terminal communication protocol | |
US5339316A (en) | Wireless local area network system | |
US6360260B1 (en) | Discovery features for SNMP managed devices | |
KR20050100398A (en) | Method and apparatus for transmitting information within a communication system | |
JPH08204746A (en) | Inter-lan connection router | |
JP2004336716A (en) | Path mtu discovery system and method for ad-hoc network | |
JP2002111684A (en) | Radio communication system and its time out value updating method | |
KR100770073B1 (en) | Method and Apparatus for Efficient Data Broadcast Within Beaconing Network | |
US7248568B1 (en) | Apparatus for detecting hidden nodes in a wireless network | |
US6069901A (en) | Use of energy bursts for wireless networks | |
US6301239B1 (en) | Distributed packet communication network | |
WO2002003147A2 (en) | Method for detecting invalid packets by rewriting transaction identifiers | |
US11916683B2 (en) | Overloading broadcast dwell intervals in unsynchronized channel hopping mesh networks | |
CN100452922C (en) | Wireless channel allocation in a base station processor. | |
CN110784244B (en) | Data transmission method and full-duplex Ad Hoc network system | |
JPH11205384A (en) | Data communication system and data communication equipment | |
JPH0964871A (en) | Network management system | |
Hercog et al. | Medium Access Control | |
EP0991243B1 (en) | Method for data addressing in a local area network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |