EP1692624B1 - Procede pour coordination de dispositifs reseau avec echanges de messages explicites limites - Google Patents
Procede pour coordination de dispositifs reseau avec echanges de messages explicites limites Download PDFInfo
- Publication number
- EP1692624B1 EP1692624B1 EP04800755.3A EP04800755A EP1692624B1 EP 1692624 B1 EP1692624 B1 EP 1692624B1 EP 04800755 A EP04800755 A EP 04800755A EP 1692624 B1 EP1692624 B1 EP 1692624B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- beacon
- qosc
- new
- network
- region
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims description 41
- 230000002452 interceptive effect Effects 0.000 claims description 18
- 230000005540 biological transmission Effects 0.000 claims description 10
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 claims 1
- VYLDEYYOISNGST-UHFFFAOYSA-N bissulfosuccinimidyl suberate Chemical compound O=C1C(S(=O)(=O)O)CC(=O)N1OC(=O)CCCCCCC(=O)ON1C(=O)C(S(O)(=O)=O)CC1=O VYLDEYYOISNGST-UHFFFAOYSA-N 0.000 description 41
- 230000008859 change Effects 0.000 description 12
- 230000007246 mechanism Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 230000009471 action Effects 0.000 description 3
- 238000013459 approach Methods 0.000 description 3
- 238000003491 array Methods 0.000 description 3
- 235000008694 Humulus lupulus Nutrition 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000014509 gene expression Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000013475 authorization Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/14—Spectrum sharing arrangements between different networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/0001—Arrangements for dividing the transmission path
- H04L5/0003—Two-dimensional division
- H04L5/0005—Time-frequency
- H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0037—Inter-user or inter-terminal allocation
- H04L5/0039—Frequency-contiguous, i.e. with no allocation of frequencies for one user or terminal between the frequencies allocated to another
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0037—Inter-user or inter-terminal allocation
- H04L5/0041—Frequency-non-contiguous
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/2803—Home automation networks
- H04L2012/284—Home automation networks characterised by the type of medium used
- H04L2012/2843—Mains power line
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload
- H04L5/0046—Determination of how many bits are transmitted on different sub-channels
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/005—Discovery of network devices, e.g. terminals
Definitions
- the networks may compete for access to the channel (i.e., they compete for bandwidth). In the absence of any coordination between the networks, they can destructively interfere with one another, reducing capacity utilization and the bandwidth (BW) available to stations within any network.
- BW bandwidth
- the scenario described above arises when neighboring homes in a residential neighborhoods or apartments deploy local area networks within their individual dwellings. Often the networks share the channel, as is the case in wireless and in powerline networks. This scenario requires a method to allow interfering networks to coordinate with one another.
- the coordination problem may be solved by contention access protocols that are employed by all interfering stations within multiple networks sharing a medium.
- Contention access protocols have been shown to be inefficient in providing QoS guarantees to AV and streaming applications which are increasingly popular.
- a central controller arbitrates among the multiple networks in deciding how the total available BW is apportioned. This centralized decision making scheme can cause large delays and incur heavy messaging overhead as the number of neighboring networks grows.
- US 2003/0186713 relates to a radio communication system comprising network which use different signal systems.
- Embodiments of the present invention comprise systems and methods for neighbor network coordination that require little or no explicit message exchanges. According to the present invention, there is provided the claimed matter according to the appended claims.
- Embodiments of the present invention comprise systems and methods for neighbor network coordination that require little or no explicit message exchanges.
- Some embodiments utilize a distributed coordination approach.
- the advantages of a distributed approach include no chaining effect where a network has to coordinate with networks multiple hops away and no central authority that arbitrates among network devices. These distributed methods may improve capacity over contention access protocols. Additional advantages and improvements can be achieved by limiting or eliminating message exchanges between neighbor networks, namely (1) overhead used by message exchange is reduced which can lead to higher BW efficiency, (2) issues related to collision and retransmission of messages are resolved (e.g., retry timer is not required), and (3) a faster response time in coordination.
- Implementations of the present invention are applicable in scenarios where each network generates its own Beacon periodically and the BW assignments for each network are carried in the Beacon.
- a network will decode the Beacon of each of its interfering neighbors to find out the existing BW assignments. It will then adjust its own BW assignments to coordinate with its neighbor networks, to request for additional BW, or to release its reserved BW.
- basic network operations e.g., network establishment, BW request, and BW release
- BW request e.g., BW request
- BW release e.g., BW release
- advanced network coordination features e.g., shifting the system timing of an existing network, dynamically adjusting system parameters
- a limited set of messages may be exchanged in some embodiments.
- Embodiments of the present invention comprise a distributed method for coordination among multiple interfering networks that requires little or no message exchange.
- a network model is used where each network has a controlling authority (QoS Controller or QoSC).
- QoSC controlling authority
- the QoSC manages the activities of devices within its network and performs functions such as BW allocation to connections.
- the QoSC of each network may transmit a Beacon periodically.
- the Beacon may comprise the BW assignments (among other things) for the network. All devices in a network will decode the Beacon of the network and find out the BW assignments.
- the Beacon is also decoded by other QoSCs in the INL to coordinate their BW assignments.
- the Beacon may specify that a particular time interval and/or a set of frequencies is allocated exclusively to some devices, or it may specify that a time interval is to be shared by all the devices using some contention access protocol, or it may specify that a time interval is not to be used by any devices, etc.
- the period for transmitting the Beacons is the same for all the neighbor networks.
- a time domain multiple access scheme may be used where the networks share bandwidth by operating in different segments of a time frame.
- the QoSC of each network determines its Interfering Network List (INL) by decoding all existing Beacons. It may also monitor existing Beacons to update its INL, if necessary, as existing neighboring networks are shut down and new neighboring networks are established.
- INL Interfering Network List
- Implementations of the present invention may comprise a time frame, as instantiated by the QoSC and observed by all devices in the network controlled by the particular QoSC.
- This time frame may comprise five regions:
- the Beacon of each network may also carry information about the occupancy of the Beacon slots in the Beacon Region. From this information, a new QoSC may choose a vacant Beacon slot to transmit its new Beacon. In some embodiments, a certain number of Beacon slots maybe reserved for the transmission of Beacons. In other embodiments, the Beacons can be transmitted in any time interval that is not being reserved.
- a Beacon may be used to carry BW assignment information to all stations in a network. All stations in a network decode the Beacon from their QoSC and observe the time schedule indicated therein.
- a QoSC may also decode the Beacons of the networks in its INL.
- the QoSC may make sure its BW assignments are "compatible" with BW assignments of the neighbor networks in its INL. For example, a Stayout Region may be specified by the QoSC if one of the neighbor networks has specified a Reserved Region in the same interval.
- Beacon to convey BW assignments to networks in the INL may decrease or eliminate the need for message exchange.
- Algorithms are utilized in some embodiments to set the BW assignments to coordinate with other networks in the INL.
- Some implementations of the present invention comprise a distributed model for coordination among multiple neighboring networks based on Interfering Network Lists. These embodiments do not require a central authority to arbitrate between multiple networks.
- Some implementations of the present invention comprise BW assignments inside the Beacon. These assignments may be used by neighbor networks in the INL for coordination purposes. These implementations comprise methods and systems for establishing new networks and for sharing BW with networks in an INL without message exchanges.
- Some implementations of the present invention comprise a distributed coordination mechanism that bases decision making on data maintained in an INL and does not require networks that are multiple hops away to coordinate with one another.
- Some implementations of the present invention comprise a coordination mechanism that allows networks to re-use portions of time intervals that are already in use by non-interfering networks.
- Implementations of the present invention may be used in conjunction with networks that comply with established standards, such as IEEE 802.15.3, IEEE 802.11 or HomePlug Powerline Communications standards.
- a new QoSC may establish a BSS in the Coordinated Mode if it can detect Beacons reliably from at least one existing BSS.
- the new QoSC may acquire the timing of the existing BSS(s), and join the existing BSS(s) to form a Group.
- a Group (of BSSs) is defined as a collection of one or more BSSs with the same system timing. The Beacon Regions of each BSS in the same Group are coincidental.
- the Schedule Information of each Beacon in the Group should be "compatible" with the others. For example, if a BSS specifies a Reserved Region and an interfering BSS specifies a Stayout Region in the same interval, then the two schedules are said to be compatible. On the other hand, if a BSS specifies a Reserved Region and an interfering BSS specifies a CSMA Region, then they are said to be incompatible. Exemplary rules of determining whether two schedules are compatible are explained below.
- BSSs in one Group have a different system timing than the BSSs in the other Group.
- the schedules of one BSS must still be compatible with each interfering BSS independent of whether the two BSSs are in the same Group or not.
- Communications between different BSSs may be carried out by using the Schedule Information of the Beacons.
- an exemplary TDMA frame may comprise the following five regions.
- the Beacon Region consists of a certain number of Beacon slots. The duration of each slot may be made equal to the sum of the duration of a Beacon PDU and a Beacon Inter-Frame Spacing (BIFS). Each QoSC may transmit a Beacon in one of the Beacon slots every Beacon Cycle. When several BSSs are in the same Group, their Beacon Regions may be aligned with each other and interfering BSSs may use different slots to transmit their Beacons.
- CSMA Region or Contention Period Stations in a BSS are allowed to contend for the channel with other stations using CSMA/CA or another contention access protocol in this region.
- Reserved Region (Contention-Free Period): A Reserved Region may be used for contention-free allocations made by a QoSC to stations within a BSS. Only stations that have been assigned an allocation can transmit in this region. All other stations in the same BSS shall not transmit in the same interval. In addition, all other interfering BSSs shall be assigned to a Stayout Region during an interfering station's Reserved Region.
- a BSS is assigned a Stayout Region if one or more of its interfering BSSs have specified a Reserved Region or a Protected Region (to be defined next) in the same interval. Stations in the BSS are not allowed to transmit in a Stayout Region. Note that it is possible to have two non-interfering BSSs specify a Reserved Region in the same interval. This results in frequency reuse with a higher total capacity.
- Protected Region When a QoSC detects the existence of another Group with a different timing, it may specify a Protected Region for the same interval where the Beacon Region of the other Group is located. Stations in a BSS are not allowed to transmit in a Protected Region.
- the length of a Beacon Cycle may be a constant.
- each Schedule Information may comprise the following fields:
- a new QoSC When a new QoSC is powered up, it may perform the following steps.
- an existing QoSC may transmit information about the slot structure of the Beacon Region so that a new QoSC can join the system. That information may comprise:
- the number of slots in the Bcacon Region may be fixed. Any reasonable number of Beacon slots can be used. If the number of slots is fixed at 8, a total of 2 bytes are required to specify the slot structure of the Beacon Region using this exemplary method. If the number of slots is fixed at 16, a total of 3 bytes are required. A limited set of messages can also be defined to dynamically negotiate between QoSCs the number of Beacon slots in the Beacon Region.
- Beacon PDU comprising the following fields as shown in Fig. 2 .
- a new QoSC may execute the following algorithm to find a Group of BSSs to join and a free slot in the Beacon Region to transmit its new Beacon.
- a flowchart of the algorithm is shown in Fig. 3 .
- Figure 6 shows an exemplary network scenario where the new QoSC can detect one Group of BSSs.
- the new QoSC When the new QoSC decodes the Beacon from QoSC #1, it records the time of its local clock when the Beacon is received. Together with the slot structure of the Beacon Region and the length of the Beacon Cycle, the new QoSC knows the timing of QoSC #1. It also knows that slot #0 and slot #1 cannot be used to transmit its new Beacon if it decides to join this system later.
- the new QoSC When the new QoSC decodes the Beacon from QoSC #2, it records the time of its local clock when the Beacon is received. Together with the slot structure of the Beacon Region and the length of the Beacon Cycle, the new QoSC knows the timing of QoSC #2. The new QoSC compares the timing of QoSC #2 with the timing of QoSC #1. In this case, the two timings are the same. The new QoSC deduces that the two BSSs are from the same Group. It also knows that slot #0, #1 and #2 cannot be used to transmit its new Beacon if it decides to join this system later.
- the new QoSC has found one Group of BSSs, the timing of that Group, and that slots #0, #1, and #2 cannot be used.
- the new QoSC will join the existing Group in the Coordinated Mode. It will transmit its new Beacon in one of the slots between slot #3 and slot #7.
- QoSC #1 and #2 will update the SlotUsage field in their Beacons to indicate that slot #3 is now occupied.
- Figure 7 shows an exemplary network scenario with two existing Groups of BSSs. The timings of the two Groups are different but the new QoSC can still reliably detect Beacons from both Groups.
- the new QoSC When the new QoSC decodes the Beacon from QoSC #1, it records the time of its local clock when the Beacon is received. Together with the length of the Beacon Cycle, the new QoSC knows the timing of QoSC #1. It also knows that slot #0 cannot be used to transmit its new Beacon if it decides to join this system later.
- the new QoSC When the new QoSC decodes the Beacon from QoSC #2, it records the time of its local clock when the Beacon is received. Together with the length of the Beacon Cycle, the new QoSC knows the timing of QoSC #2. The new QoSC compares the timing of QoSC #2 with the timing of QoSC #1. In this case, the two timings are different. The new QoSC knows that they are from two different Groups of BSSs. It also knows that slot #0 cannot be used to transmit its new Beacon if it decides to join this system later.
- the new QoSC will decide to join one of the two Groups in the Coordinated Mode.
- the new QoSC joins the Group with QoSC #1.
- the new QoSC shall specify a Protected Region in the same interval where the Beacon Region of QoSC #2 is located. As a result, there will be no transmissions from the new BSS (and its neighbors in the same Group) during that interval, and thus the Beacon Region of QoSC #2 is protected.
- QoSC #2 when QoSC #2 receives the Beacons of the new QoSC, it shall specify a Protected Region in the same interval where the Beacon Region of the new QoSC is located.
- the existing QoSCs will not be able to decode any of the new Beacons reliably and therefore and they will not update their SlotUsage fields.
- the new QoSCs will then know that collisions have occurred and may choose to transmit their new Beacons again using a different Beacon slot.
- the new QoSC has to define the slot structure of the Beacon Region and the Schedule Information of the TDMA frame. In this subsection, the rules used by the new QoSC to set the contents of its new Beacon are described.
- the new QoSC selects a free Beacon slot using the procedures described above and specifies the values of the NumSlot, SlotID and SlotUsage fields (see Figure 2 ) in its new Beacons.
- the value of the NumSlot field is set to 7 to indicate that there are 8 slots in the Beacon Region.
- the value of the SlotID field is set based on the free Beacon slot selected by the new QoSC.
- the new QoSC should set a bit in the SlotUsage field to "1" if it can decode a neighbor Beacon transmitted in the corresponding Beacon slot. Otherwise, the bit is set to 0.
- the new QoSC establishes a new network in the Uncoordinated Mode, then it should initially specify a CSMA Region for the entire Beacon Cycle.
- the QoSC decodes all neighbor Beacons (from the same and different Groups) and computes the "union" of their allocations. For example, if one neighbor BSS specifies a Reserved Region and another neighbor specifies a CSMA or Stayout Region, then the resultant union allocation is a Reserved Region, because a Reserved Region "outweighs" both CSMA and Stayout Regions.
- ALLOC[n][i] and ENDTIME[n][i] are obtained from the Schedule Information of all neighbor Beacons, where "n" represents which neighbor network, and "i" represents which schedule for that neighbor network.
- ALLOC[n][] and ENDTIME[n][] for each network are shifted to account for the difference in system timing.
- Beacon Regions are also inserted in ALLOC[n][] so that for networks that have the same timing as the QoSC, the first entry of ALLOC[n][] is a Beacon Region, and for a network that has a different timing from the QoSC, the Beacon Region is inserted in the appropriate entry of ALLOC[n][] to account for the timing difference.
- a corresponding entry is also inserted in ENDTIME[n][] to represent the duration of the Beacon Region.
- the exemplary rules are:
- the output may be represented by the arrays, new_alloc[] and new_endtime[].
- the first entry, new_alloc[1] shall be a Beacon Region, and is not transmitted.
- the Schedule Information of the new Beacon is obtained by removing the first entry in the two arrays, and subtracting new_endtime[1] from the remaining entries of new_endtime[].
- This subsection describes the actions that shall be taken by an existing QoSC in order to support the addition of a new QoSC to the system.
- An existing QoSC may announce the slot structure of the Beacon Region through the NumSlot, SlotID, and SlotUsage fields.
- the SlotUsage field specifies the slots in the Beacon Region that are currently used by itself and its neighbors.
- a new QoSC may use this information to find a free slot in the Beacon Region to transmit its new Beacons.
- An existing QoSC may detect for new Beacons in the free slots of its Beacon Region. If a new Beacon is detected, it means that a new QoSC has decided to join the same system. The existing QoSC shall decode the new Beacon and update the SlotUsage field in its own Beacon.
- the existing QoSC shall also decode the Schedule Information of the new Beacon to see if there are any new Protected Regions.
- the presence of Protected Regions in the new Beacon suggests the existence of other independent systems in the vicinity.
- the existing QoSC shall specify a Stayout Region in the same interval where the new Beacon specifies a Protected Region, if the existing QoSC cannot detect that independent system itself. (Otherwise, the existing QoSC should have already specified a Protected Region.)
- the exemplary algorithms described above may be used by the existing QoSCs to set the contents of their Beacons.
- An existing QoSC shall also detect for new Beacons in its CSMA Region. These new Beacons are transmitted by a new QoSC which has decided to join a Group with a different timing.
- the existing QoSC will find out the location of the Beacon Region of the new QoSC and specify a Protected Region in its own Beacon to coincide with it. Consequently,
- the exemplary algorithms described above may be used by the existing QoSCs to set the contents of their Beacons.
- the new QoSC transmitting the new Beacon may or may not know the existence of any existing QoSCs. If the new QoSC specifies a Protected Region that coincides with the Beacon Region of an existing QoSC, it means that the new QoSC knows of the existence of that system. No further action is required by the existing QoSC in this case.
- the new QoSC does not specify a Protected Region in the same interval where the Beacon Region of an existing QoSC is located, it means that the new QoSC does not know of the existence of that existing QoSC.
- the existing QoSC shall send a Dummy Beacon PDU to the new QoSC.
- the purpose of the PDU is to inform the new QoSC of the existence of an existing Group and the offset between the two Beacon Regions.
- the new QoSC Upon receiving the PDU, the new QoSC shall specify a Protected Region in its Schedule Information to protect the Beacon Region of the existing Group. As a result, both the existing QoSC and the new QoSC will be able to detect the Beacons of each other. The new QoSC will then change its Schedule Information to make it compatible with the existing QoSC.
- the format of an exemplary Dummy Beacon PDU is shown below.
- the MAC addresses of the sender and the receiver are part of the header of the PDU, and therefore, are not required in the body of the PDU.
- the Offset field specifies the time offset, in ⁇ sec, between Beacon Regions of the sender and the receiver. It is calculated as the start time of the sender's Beacon Region minus the start time of the receiver's Beacon Region (modulo Beacon Cycle). Its value shall be greater than or equal to 0 and less than the length of the Beacon Cycle.
- the Duration field specifies the duration, in ⁇ sec, of the Beacon Region of the sender. (This field is not needed if the length of the Beacon Region is fixed in the baseline technology specification.)
- the Schedule Information of the new Beacon may be incompatible with the Schedule Information of the existing QoSC.
- a CSMA Region may be specified in the same interval where an existing QoSC has specified a Reserved Region.
- the existing QoSC shall have a safeguard mechanism to maintain its current Schedule Information for a small number of Beacon Cycles while the new QoSC attempts to change its Schedule Information to make it compatible with the Schedule Information of the existing QoSC.
- Each QoSC maintains an array, ERR_COUNT[], for each of its allocations.
- MAX_ERR 1, it means that incompatibility is not allowed at all.
- the QoSC decodes the Beacons of all neighbor networks and computes the content of its next Beacon to make the contents of all Beacons compatible.
- the QoSC checks to see if any previously known neighbor Beacons can be decoded again in this Beacon Cycle. If a neighbor Beacon cannot be decoded, the QoSC will use a previously saved copy of that neighbor Beacon. However, if the neighbor Beacon is absent for MAX_LOST Beacon Cycles in a row, the QoSC will assume that that neighbor network has been powered off. (Note: when a new QoSC wants to establish a new BSS, it shall be able to successfully decode each neighbor Beacon and shall not rely on any previously saved copy.)
- the QoSC will send a Dummy Beacon PDU to that neighbor QoSC.
- the QoSC computes the union allocation of all neighbors.
- a QoSC runs an algorithm to set the contents of its next Beacon to make it compatible with all neighbor Beacons.
- a QoSC wants to release a reserved bandwidth, it just needs to change its Reserved Regions into CSMA Regions.
- the neighbor QoSCs will run the same set of algorithms to update their next Beacons accordingly.
- the union allocations of all neighbor Beacons are denoted by inf_alloc[] and inf_endtime[].
- a flowchart for computing the union allocations is given in Fig. 9 .
- the QoSC should keep a copy of its last Beacon, old_alloc[] and old_endtime[], and compute the contents of its next Beacon, new_alloc[] and new_endtime[].
- the QoSC may need to change the allocation in its next Beacon.
- the new allocation should become a Stayout Region. This case can happen when a neighbor has just announced a share bandwidth request.
- the new allocation should become a CSMA Region.
- the variable old_err_count[] is used to keep track of the number of Beacon Cycles for which each allocation has been incompatible.
- An updated version, new_err_count[], will be generated by the algorithm. This is the exemplary safeguard mechanism mentioned above.
- the interval which the QoSC proposes to use is indicated by an internal TYPE field value of NEW_RESERVED.
- the procedures for the QoSC to propose share bandwidth requests are given are described below.
- the internal TYPE field value of NEW_RESERVED is not actually transmitted. From the point of view of the neighbor, a TYPE field value of RESERVED will be received.) It is considered compatible as long as the neighbor does not specify a Reserved Region in that same interval.
- the neighbor also specifies a Reserved Region in the same interval where the QoSC specifies a New Reserved Region, it means that both the QoSC and the neighbor propose to use the same interval for their share bandwidth requests. Their requests will collide and they will cancel their requests by changing the allocation Type to a CSMA Region in the next Beacons.
- the share bandwidth requests are accepted if the neighbors specify a Stayout Region in the same interval where the QoSC specified the requests. Otherwise, the requests are rejected and the QoSC shall withdraw the requests. In both cases, the QoSC will change its State back to 0.
- the steps taken by the QoSC to add share bandwidth requests are described in this Section.
- the QoSC shall be in State 0 initially, i.e., it does not have any pending requests.
- the QoSC After executing the algorithm to reconcile the Beacons, the QoSC has computed the contents of its next Beacon, given by the arrays, new_alloc[] and new_endtime[].
- the QoSC can propose to reserve any interval that has a TYPE field of CSMA in new_alloc[].
- the QoSC will change the TYPE field value of the interval to NEW_RESERVED to indicate a "New Reserved Region.”
- scheduling policy if any, may be executed in this step as well.
- the TYPE field value of NEW_RESERVED is used internally by the QoSC to distinguish a new request from an existing reservation.
- any value of NEW_RESERVED will be changed to RESERVED.
- the neighbors will receive TYPE field values of PROTECTED, RESERVED, CSMA, and STAYOUT only.
- the QoSC only proposes to use a portion of a CSMA Region, it will split the original interval into two or three smaller intervals. One of the intervals will have a TYPE field of NEW_RESERVED and the remaining interval(s) will have a TYPE field of CSMA.
- the QoSC has already computed the contents of its new Beacon, new_alloc[] and new_endtime[]. It will convert all TYPE field values of NEW_RESERVED to RESERVED, and transmit the resultant Schedule Information in the appropriate Beacon slot.
- the QoSC is initially in State 0 and it is announcing share bandwidth requests in the new Beacon, it will change its State to 1, so that it will use the algorithm described in relation to State 1 to reconcile the neighbor Beacons next time.
- QoSC #4 can assign its new Reserved Region to its stations.
- a set of rules comprising the following rules may be enforced.
- the scheduling policy is a First-Come-First-Served one.
- Rule #4 is a form of admission control.
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
- Electrotherapy Devices (AREA)
- Telephonic Communication Services (AREA)
Claims (9)
- Procédé pour coordonner des réseaux interférents, le procédé comprenant l'initialisation d'un premier réseau comprenant :a) la réception, par une autorité de contrôle du premier réseau, de toutes les balises de réseaux voisins existants, à partir de réseaux voisins ;c) le décodage, par l'autorité de contrôle du premier réseau, des balises de réseaux voisins afin de vérifier des informations de programmation de réseaux pour les réseaux voisins, les informations de programmation de réseaux identifiant les périodes de transmission programmées ;d) le réglage d'attributions de largeur de bande pour le premier réseau, en vue d'une coordination avec les informations de programmation de réseaux pour les réseaux voisins, ledit réglage étant effectué par l'autorité de contrôle du premier réseau, étant précisé que le réglage des attributions de largeur de bande comprend la détermination d'une affectation unifiée de largeur de bande de tous les réseaux voisins selon un schéma de priorité, de manière à éviter une transmission pendant des intervalles où des réseaux voisins ont programmé des périodes de transmission,e) la production d'une nouvelle balise contenant des informations de programmation selon l'affectation unifiée et la diffusion de la balise.
- Procédé selon la revendication 1, étant précisé que les informations de programmation de réseau pour les réseaux voisins comprennent des périodes de transmission programmées pour les réseaux voisins.
- Procédé selon la revendication 2, étant précisé que les périodes de transmission comprennent une période sans conflit d'accès.
- Procédé selon la revendication 1, étant précisé que les informations de programmation de réseaux pour les réseaux voisins comprennent une identification d'appareil et des affectations de largeur de bande d'appareil.
- Procédé selon la revendication 1, étant précisé que des balises de réseaux voisins identifient une période sans conflit d'accès pendant laquelle d'autres appareils peuvent éviter la transmission, et que ladite balise identifie également une période de conflit d'accès.
- Procédé selon la revendication 5, étant précisé que ladite période de conflit d'accès est une période CSMA.
- Procédé selon la revendication 1, étant précisé que le réglage comprend la libération de la largeur de bande réservée précédemment par le premier réseau.
- Procédé selon la revendication 1, étant précisé que l'autorité de contrôle est un Contrôleur de Qualité de Service, QoSC, pour le premier réseau.
- Procédé selon la revendication 1, étant précisé que les balises de réseaux voisins comprennent des demandes de largeur de bande exclusives.
Applications Claiming Priority (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US51857403P | 2003-11-07 | 2003-11-07 | |
US51822403P | 2003-11-07 | 2003-11-07 | |
US51823703P | 2003-11-07 | 2003-11-07 | |
US51803603P | 2003-11-07 | 2003-11-07 | |
US53749204P | 2004-01-19 | 2004-01-19 | |
US57335304P | 2004-05-21 | 2004-05-21 | |
PCT/US2004/036799 WO2005048047A2 (fr) | 2003-11-07 | 2004-11-05 | Systemes et procedes pour coordination de dispositifs reseau avec echanges de messages explicites limites |
Publications (3)
Publication Number | Publication Date |
---|---|
EP1692624A2 EP1692624A2 (fr) | 2006-08-23 |
EP1692624A4 EP1692624A4 (fr) | 2010-08-11 |
EP1692624B1 true EP1692624B1 (fr) | 2016-05-04 |
Family
ID=34577975
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP04800755.3A Expired - Fee Related EP1692624B1 (fr) | 2003-11-07 | 2004-11-05 | Procede pour coordination de dispositifs reseau avec echanges de messages explicites limites |
EP04800753A Expired - Fee Related EP1692619B1 (fr) | 2003-11-07 | 2004-11-05 | Procedes et systemes de coordination de reseaux |
EP04800754A Expired - Fee Related EP1690350B1 (fr) | 2003-11-07 | 2004-11-05 | Procede pour acces a une division de frequence et de temps |
Family Applications After (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP04800753A Expired - Fee Related EP1692619B1 (fr) | 2003-11-07 | 2004-11-05 | Procedes et systemes de coordination de reseaux |
EP04800754A Expired - Fee Related EP1690350B1 (fr) | 2003-11-07 | 2004-11-05 | Procede pour acces a une division de frequence et de temps |
Country Status (5)
Country | Link |
---|---|
US (7) | US8050184B2 (fr) |
EP (3) | EP1692624B1 (fr) |
JP (3) | JP2007516662A (fr) |
ES (2) | ES2377648T3 (fr) |
WO (3) | WO2005048511A2 (fr) |
Families Citing this family (92)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8090857B2 (en) | 2003-11-24 | 2012-01-03 | Qualcomm Atheros, Inc. | Medium access control layer that encapsulates data from a plurality of received data units into a plurality of independently transmittable blocks |
JP4777888B2 (ja) * | 2004-02-24 | 2011-09-21 | パナソニック株式会社 | 相異なる複数の通信システムを共存可能にするための端末装置 |
US7477610B2 (en) * | 2004-03-01 | 2009-01-13 | Alcatel-Lucent Usa Inc. | Methods and devices for coordinating the transmissions of access points in WLANs |
US20050190731A1 (en) * | 2004-03-01 | 2005-09-01 | Yigal Bejerano | Methods and devices for providing a relative level of fairness and QoS guarantees to wireless local area networks |
CA2560603C (fr) * | 2004-03-24 | 2014-07-22 | Koninklijke Philips Electronics N.V. | Periodes de balisage distribuees pour des reseaux ponctuels |
US8683535B2 (en) * | 2004-03-26 | 2014-03-25 | Broadcom Corporation | Fast channel change |
US7684333B1 (en) * | 2004-07-30 | 2010-03-23 | Avaya, Inc. | Reliable quality of service (QoS) provisioning using adaptive class-based contention periods |
US20060040701A1 (en) * | 2004-08-18 | 2006-02-23 | Staccato Communications, Inc. | Beacon group merging |
WO2006067556A1 (fr) * | 2004-12-22 | 2006-06-29 | Telefonaktiebolaget Lm Ericsson (Publ) | Transmission dans un support partage presentant differents modes d'acces |
US7881695B2 (en) * | 2005-04-13 | 2011-02-01 | Sony Corporation | Fixed network master |
KR101233873B1 (ko) * | 2005-05-26 | 2013-02-15 | 파나소닉 주식회사 | 전력선 통신시스템 및 방법 |
US9007954B2 (en) * | 2005-05-26 | 2015-04-14 | Nokia Corporation | Beacon transmission for wireless networks |
US8175190B2 (en) | 2005-07-27 | 2012-05-08 | Qualcomm Atheros, Inc. | Managing spectra of modulated signals in a communication network |
US7856008B2 (en) | 2005-07-27 | 2010-12-21 | Sharp Laboratories Of America, Inc. | Synchronizing channel sharing with neighboring networks |
US20070058659A1 (en) * | 2005-07-27 | 2007-03-15 | Ayyagari Deepak V | Method for providing requested quality of service |
US7848306B2 (en) * | 2005-07-27 | 2010-12-07 | Sharp Laboratories Of America, Inc. | Coexistence of access provider and in-home networks |
US8027345B2 (en) * | 2005-07-27 | 2011-09-27 | Sharp Laboratories Of America, Inc. | Method for automatically providing quality of service |
US7720471B2 (en) * | 2005-07-27 | 2010-05-18 | Sharp Laboratories Of America | Method for managing hidden stations in a centrally controlled network |
US8737420B2 (en) | 2005-07-27 | 2014-05-27 | Sigma Designs Israel S.D.I. Ltd. | Bandwidth management in a powerline network |
US8553706B2 (en) | 2005-07-27 | 2013-10-08 | Coppergate Communications Ltd. | Flexible scheduling of resources in a noisy environment |
WO2007016034A2 (fr) * | 2005-07-27 | 2007-02-08 | Conexant Systems, Inc. | Gestion de largeur de bande dans un reseau d'alimentation |
US8509442B2 (en) * | 2005-07-27 | 2013-08-13 | Sharp Laboratories Of America, Inc. | Association, authentication, and security in a network |
JP4950197B2 (ja) * | 2005-08-04 | 2012-06-13 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | 無線通信用の時間に基づく共存 |
SG130042A1 (en) * | 2005-08-16 | 2007-03-20 | Univ Nanyang | A communications system |
WO2007031960A2 (fr) * | 2005-09-16 | 2007-03-22 | Koninklijke Philips Electronics, N.V. | Procede visant a ameliorer l'auto-coexistence de reseaux de communication sans fil |
DE102005046253A1 (de) * | 2005-09-27 | 2007-04-05 | Nec Europe Ltd. | Verfahren zum Steuern und Überwachen der Qualität eines Dienstes |
US20070081543A1 (en) * | 2005-10-11 | 2007-04-12 | Manrique Brenes | Network utilization control apparatus and method of using |
US7876717B2 (en) * | 2005-12-09 | 2011-01-25 | Sony Corporation | System and method for providing access in powerline communications (PLC) network |
US7756101B2 (en) * | 2005-12-30 | 2010-07-13 | Nokia Corporation | Efficient resolution of relinquishment requests in a wireless communications network |
US8576811B2 (en) * | 2006-02-06 | 2013-11-05 | Motorola Solutions, Inc. | System, method and apparatus for reliable exchange of information between nodes of a multi-hop wireless communication network |
US20070230497A1 (en) * | 2006-03-31 | 2007-10-04 | Samsung Electronics Co., Ltd. | Method and apparatus to negotiate channel sharing in PLC network |
US8351405B2 (en) * | 2006-07-14 | 2013-01-08 | Qualcomm Incorporated | Method and apparatus for signaling beacons in a communication system |
US20070258395A1 (en) * | 2006-04-28 | 2007-11-08 | Medtronic Minimed, Inc. | Wireless data communication protocols for a medical device network |
US8073008B2 (en) * | 2006-04-28 | 2011-12-06 | Medtronic Minimed, Inc. | Subnetwork synchronization and variable transmit synchronization techniques for a wireless medical device network |
US20070255125A1 (en) | 2006-04-28 | 2007-11-01 | Moberg Sheldon B | Monitor devices for networked fluid infusion systems |
US20070255126A1 (en) * | 2006-04-28 | 2007-11-01 | Moberg Sheldon B | Data communication in networked fluid infusion systems |
US20070253021A1 (en) * | 2006-04-28 | 2007-11-01 | Medtronic Minimed, Inc. | Identification of devices in a medical device network and wireless data communication techniques utilizing device identifiers |
CN101047429B (zh) * | 2006-05-10 | 2010-10-27 | 华为技术有限公司 | 子载波组资源分配的方法 |
US7813373B2 (en) * | 2006-05-25 | 2010-10-12 | Motorola, Inc. | Systems, methods and apparatus for detecting time slot interference and recovering from time slot interference in an ad hoc wireless communication network |
US7929546B2 (en) * | 2006-05-25 | 2011-04-19 | Motorola Solutions, Inc. | Systems, methods and apparatus for allocating time slots in an ad hoc wireless communication network |
JP5129244B2 (ja) * | 2006-05-29 | 2013-01-30 | フリースケール セミコンダクター インコーポレイテッド | データを切り替える方法及び装置 |
KR100908007B1 (ko) * | 2006-12-01 | 2009-07-16 | 삼성전자주식회사 | 무선 네트워크 시스템 및 상기 무선 네트워크상에서데이터를 송수신하는 방법 |
TW200826586A (en) * | 2006-12-13 | 2008-06-16 | Inst Information Industry | Bandwidth reservation system and method of dynamically switching channels and readable-by-computer recording medium thereof |
US20080151794A1 (en) * | 2006-12-21 | 2008-06-26 | Nokia Corporation | Apparatus, method, and computer program product for reducing uplink interference |
KR100917888B1 (ko) * | 2007-02-09 | 2009-09-16 | 삼성전자주식회사 | 무선 네트워크 시스템 및 상기 무선 네트워크상에서데이터를 송수신하는 방법 |
US20080233966A1 (en) * | 2007-03-22 | 2008-09-25 | Comsys Communication & Signal Processing Ltd. | Resource allocation apparatus and method in an orthogonal frequency division multiple access communication system |
JP4416008B2 (ja) * | 2007-05-18 | 2010-02-17 | ソニー株式会社 | 通信装置及び通信方法 |
US8429406B2 (en) | 2007-06-04 | 2013-04-23 | Qualcomm Atheros, Inc. | Authorizing customer premise equipment into a network |
US20090150537A1 (en) * | 2007-12-10 | 2009-06-11 | John Fanson | Data communication method for a set of hard-real time applications within a network |
ES2616501T3 (es) | 2008-06-16 | 2017-06-13 | Panasonic Corporation | La administración de la coexistencia entre los protocolos de señalización en un medio compartido |
ES2332349B1 (es) * | 2008-06-23 | 2011-02-10 | Diseño De Sistemas En Silicio, S.A. | Procedimiento para compartir un canal de comunicaciones de forma selectiva entre coordinacion e interferencia. |
US9755705B2 (en) * | 2008-08-07 | 2017-09-05 | Qualcomm Incorporated | Method and apparatus for supporting multi-user and single-user MIMO in a wireless communication system |
US8284738B2 (en) * | 2008-11-14 | 2012-10-09 | Bae Systems Information And Electronic Systems Integration Inc. | Distributed adaptive scheduling of communications among nodes in a mobile ad hoc network |
JP5571699B2 (ja) * | 2009-02-27 | 2014-08-13 | コーニンクレッカ フィリップス エヌ ヴェ | インカンベント信号検出に対する沈黙ゾーンにおける沈黙期間のスケジューリング及び保護 |
EP4312457A3 (fr) * | 2009-04-28 | 2024-03-20 | Mitsubishi Electric Corporation | Système de communication mobile, station de base et équipement utilisateur |
US7749007B1 (en) * | 2009-05-01 | 2010-07-06 | Charles David Gilliam | Micro switch power connector |
US8498579B2 (en) | 2009-07-20 | 2013-07-30 | Qualcomm Incorporated | Channel reuse in communication systems |
CN102056296B (zh) * | 2009-10-30 | 2016-03-30 | 索尼株式会社 | 通信网络中的资源分配方法和装置 |
RS57614B1 (sr) | 2009-10-30 | 2018-11-30 | Sun Patent Trust | Uređaji za bežičnu komunikaciju i metod generisanja referentnog signala |
US20110206017A1 (en) * | 2010-02-03 | 2011-08-25 | Qualcomm Incorporated | Methods and apparatuses for beacon transmission |
US20110211562A1 (en) * | 2010-02-03 | 2011-09-01 | Qualcomm Incorporated | Methods and apparatuses for beacon transmission |
US8861570B2 (en) * | 2010-02-03 | 2014-10-14 | Qualcomm Incorporated | Methods and apparatuses for beacon transmission |
US8451789B2 (en) | 2010-06-15 | 2013-05-28 | Nokia Corporation | Method to request resources in TV white spaces type environment |
US8385286B2 (en) | 2010-09-03 | 2013-02-26 | Nokia Corporation | Resource sharing between secondary networks |
US8412247B2 (en) | 2010-09-03 | 2013-04-02 | Nokia Corporation | Method for generating a coexistence value to define fair resource share between secondary networks |
US20120108179A1 (en) * | 2010-10-29 | 2012-05-03 | Nokia Corporation | Coexistence of heterogeneous secondary networks |
US8363602B2 (en) | 2011-01-14 | 2013-01-29 | Nokia Corporation | Method, apparatus and computer program product for resource allocation of coexistent secondary networks |
US8310991B2 (en) | 2011-03-07 | 2012-11-13 | Nokia Corporation | Method, apparatus and computer program for controlling coexistence between wireless networks |
US8514802B2 (en) | 2011-05-04 | 2013-08-20 | Nokia Corporation | Method to evaluate fairness of resource allocations in shared bands |
US8670780B2 (en) * | 2011-07-15 | 2014-03-11 | Broadcom Corporation | Method and apparatus for establishing an intra-system interface within an unlicensed spectrum |
US8929831B2 (en) | 2011-07-18 | 2015-01-06 | Nokia Corporation | Method, apparatus, and computer program product for wireless network discovery based on geographical location |
US9019909B2 (en) | 2011-12-06 | 2015-04-28 | Nokia Corporation | Method, apparatus, and computer program product for coexistence management |
US8886203B2 (en) * | 2011-12-28 | 2014-11-11 | Qualcomm Incorporated | Dynamic channel reuse in multi-access communication systems |
US9473946B2 (en) | 2012-03-12 | 2016-10-18 | Nokia Technologies Oy | Method, apparatus, and computer program product for temporary release of resources in radio networks |
US8909274B2 (en) | 2012-03-12 | 2014-12-09 | Nokia Corporation | Method, apparatus, and computer program product for resource allocation conflict handling in RF frequency bands |
US8942701B2 (en) | 2012-08-14 | 2015-01-27 | Nokia Corporation | Method, apparatus, and computer program product for transferring responsibility between network controllers managing coexistence in radio frequency spectrum |
US9107089B2 (en) | 2012-11-09 | 2015-08-11 | Nokia Technologies Oy | Method, apparatus, and computer program product for location based query for interferer discovery in coexistence management system |
US9025527B2 (en) | 2012-12-13 | 2015-05-05 | Qualcomm Incorporated | Adaptive channel reuse mechanism in communication networks |
US9537641B2 (en) | 2013-05-30 | 2017-01-03 | Qualcomm Incorporated | Channel adaptation to compensate for interference from neighbor powerline communication networks |
US9986529B2 (en) | 2013-11-12 | 2018-05-29 | Qualcomm Incorporated | Methods and apparatuses for use in determining an altitude of a mobile device |
US20160234807A1 (en) * | 2013-12-19 | 2016-08-11 | Intel IP Corporation | Apparatus, system and method of rescheduling beacon transmissions |
WO2015109595A1 (fr) | 2014-01-27 | 2015-07-30 | 华为技术有限公司 | Procédé de résolution de conflit de canal, point d'accès, et station |
CN103945492B (zh) * | 2014-03-28 | 2017-09-19 | 江苏中科羿链通信技术有限公司 | 一种接入系统 |
JP6310547B2 (ja) | 2014-04-23 | 2018-04-11 | 株式会社東芝 | 無線通信装置および無線通信方法 |
US20170273069A1 (en) * | 2016-03-16 | 2017-09-21 | Futurewei Technologies, Inc. | System and Method for Managing Connections in a Wireless Communications System |
KR101892418B1 (ko) * | 2017-04-25 | 2018-08-28 | 영남대학교 산학협력단 | 사물인터넷 등록을 위한 단말 인증 장치 및 그 장치를 이용한 인증 및 결합 방법 |
WO2018203336A1 (fr) | 2017-05-04 | 2018-11-08 | Liveu Ltd. | Dispositif, système et procédé de prétraitement et de distribution de données pour des communications à liaisons multiples et pour un contenu multimédia |
EP3614780A4 (fr) * | 2017-05-16 | 2020-04-15 | Sony Corporation | Dispositif de communication et procédé de communication |
IL269277B2 (en) | 2017-05-18 | 2023-09-01 | Liveu Ltd | Device, system and method for multi-channel wireless communication for a vehicle |
CN109067511B (zh) * | 2018-09-27 | 2021-04-02 | 深圳友讯达科技股份有限公司 | 双模通信网络的通信方法及装置 |
US11510255B2 (en) * | 2018-11-09 | 2022-11-22 | Sony Interactive Entertainment Inc. | Communication device, electronic apparatus, and wireless connection method |
US11497073B2 (en) * | 2020-11-18 | 2022-11-08 | Charter Communications Operating, Llc | Dual wireless connection mode, control, and bandwidth adjustment |
Family Cites Families (143)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US582963A (en) * | 1897-05-18 | Screw elevating mechanism | ||
US224676A (en) * | 1880-02-17 | James l | ||
US227706A (en) * | 1880-05-18 | Wire-cloth fan for the destruction of insects | ||
US30890A (en) * | 1860-12-11 | Improvement in seeding-machines | ||
US16732A (en) * | 1857-03-03 | Machine | ||
US114826A (en) * | 1871-05-16 | Improvement in washing-machines | ||
US81603A (en) * | 1868-09-01 | A n d r e w christian | ||
US32529A (en) * | 1861-06-11 | perry | ||
US22483A (en) * | 1859-01-04 | Improvement in harvesters | ||
US147368A (en) * | 1874-02-10 | Improvement in nose-jewels for swine | ||
US668175A (en) * | 1899-01-27 | 1901-02-19 | Anton S Froslid | Grain-separator. |
US685098A (en) * | 1901-07-29 | 1901-10-22 | Southington Cutlery Co | Safety-razor. |
US4313212A (en) * | 1978-08-31 | 1982-01-26 | Racal Communications Inc. | Electrical circuit arrangements, for example for use with communications receivers |
US5402413A (en) * | 1991-04-08 | 1995-03-28 | Omnipoint Corporation | Three-cell wireless communication system |
JPH05304530A (ja) | 1992-03-06 | 1993-11-16 | Nec Corp | バス型lan |
AU5550694A (en) * | 1992-11-06 | 1994-06-08 | Pericle Communications Company | Adaptive data rate modem |
US5644573A (en) | 1995-01-20 | 1997-07-01 | Amati Communications Corporation | Methods for coordinating upstream discrete multi-tone data transmissions |
US5495483A (en) * | 1995-01-26 | 1996-02-27 | Motorola, Inc. | Method and apparatus for allocating carrier channels |
US5828963A (en) | 1995-03-24 | 1998-10-27 | Northern Telecom Limited | Selecting radio frequency channels for reuse in micro-cellular radio communications systems |
US5596439A (en) * | 1995-08-01 | 1997-01-21 | Viasat, Inc. | Self-interference cancellation for two-party relayed communication |
US6097700A (en) | 1995-09-18 | 2000-08-01 | Telefonaktiebolaget L M Ericsson (Publ) | Packet switched radio channel congestion control |
US6038455A (en) * | 1995-09-25 | 2000-03-14 | Cirrus Logic, Inc. | Reverse channel reuse scheme in a time shared cellular communication system |
US5949769A (en) * | 1995-10-10 | 1999-09-07 | Sicom, Inc. | Multirate local multipoint data distribution system |
DE937285T1 (de) * | 1995-12-15 | 2000-05-04 | Object Dynamics Corp | Verfahren und system zum erstellen von sofrware-komponenten und von aus unabhängigen teilen aufgebauten systemen |
US5644673A (en) * | 1996-01-16 | 1997-07-01 | Lockheed Martin Corp. | Optical-fiber-cable to bulkhead connector |
US6400819B1 (en) * | 1996-03-28 | 2002-06-04 | Hitachi, Ltd. | Method and apparatus for executing communication in real-time and data structure for real-time data communication |
US5918021A (en) * | 1996-06-03 | 1999-06-29 | Intel Corporation | System and method for dynamic distribution of data packets through multiple channels |
US5794157A (en) * | 1996-08-28 | 1998-08-11 | Telefonaktiebolaget Lm Ericsson | Method and system for autonomously allocating transmit power levels for communication between a cellular terminal and a telephone base station |
US5987069A (en) * | 1996-12-24 | 1999-11-16 | Gte Government Systems Corporation | Method and apparatus for variably allocating upstream and downstream communication spectra |
JP3731901B2 (ja) * | 1997-05-12 | 2006-01-05 | アマティ コミュニケイションズ コーポレイション | スーパフレーム・ビット配分方法及び装置 |
EP0938198B1 (fr) * | 1997-05-16 | 2008-08-13 | NTT DoCoMo, Inc. | Procedes et dispositifs d'emission et de reception a debit variable |
CN1211886A (zh) * | 1997-08-20 | 1999-03-24 | 格维康姆公司 | 用于无线数据系统的通信协议 |
US6751196B1 (en) | 1997-08-27 | 2004-06-15 | Philips Electronics North America Corp. | Apparatus and method for peer-to-peer link monitoring of a wireless network with centralized control |
US6084886A (en) * | 1997-09-30 | 2000-07-04 | Motorola, Inc. | Method and apparatus for facilitating establishment of communications in a messaging system |
US6618366B1 (en) * | 1997-12-05 | 2003-09-09 | The Distribution Systems Research Institute | Integrated information communication system |
JPH11205352A (ja) | 1998-01-07 | 1999-07-30 | Fuji Xerox Co Ltd | 通信ネットワークシステム |
US7298289B1 (en) | 1998-01-27 | 2007-11-20 | Hoffberg Steven M | Mobile communication device |
US7430257B1 (en) | 1998-02-12 | 2008-09-30 | Lot 41 Acquisition Foundation, Llc | Multicarrier sub-layer for direct sequence channel and multiple-access coding |
US7787514B2 (en) * | 1998-02-12 | 2010-08-31 | Lot 41 Acquisition Foundation, Llc | Carrier interferometry coding with applications to cellular and local area networks |
US6006271A (en) * | 1998-02-27 | 1999-12-21 | 3Com Corporation | Method and protocol for complete collision avoidance contention resolution in local area networks |
US6700875B1 (en) * | 1998-03-31 | 2004-03-02 | Motorola, Inc. | System, device, and method for selecting a channel in a multichannel communication network |
US20020133589A1 (en) * | 1998-09-11 | 2002-09-19 | Rajugopal R. Gubbi | Dynamic bandwidth negotiation scheme for wireless computer networks |
JP3821424B2 (ja) | 1998-09-11 | 2006-09-13 | シェアウェーブ・インコーポレーテッド | コンピュータ・ネットワークのための動的通信チャネル切替え |
US6377608B1 (en) * | 1998-09-30 | 2002-04-23 | Intersil Americas Inc. | Pulsed beacon-based interference reduction mechanism for wireless communication networks |
US6169748B1 (en) | 1998-10-27 | 2001-01-02 | Fujitsu Network Communications, Inc. | Frame based quality of service |
JP2000165930A (ja) * | 1998-11-30 | 2000-06-16 | Clarion Co Ltd | 無線通信ネットワークシステム |
DE69926599T2 (de) * | 1999-02-16 | 2006-06-08 | Alcatel | Verfahren und Vorrichtung zur Reglementierung des Datenverkehrs |
US6625219B1 (en) * | 1999-02-26 | 2003-09-23 | Tioga Technologies, Ltd. | Method and apparatus for encoding/framing for modulated signals over impulsive channels |
US6628668B1 (en) * | 1999-03-16 | 2003-09-30 | Fujitsu Network Communications, Inc. | Crosspoint switch bandwidth allocation management |
EP1041850A1 (fr) * | 1999-04-01 | 2000-10-04 | Nortel Matra Cellular | Méthode et appareil pour changer les configurations des liaisons radios dans un système de télécommunications mobiles supportant la commutation douce |
US6480506B1 (en) * | 1999-04-15 | 2002-11-12 | Sharewave Inc | Co-location negotiation scheme for wireless computer networks |
US6445707B1 (en) * | 1999-04-21 | 2002-09-03 | Ems Technologies Canada, Limited | Broadcast rate control allocation (BRCA) for congestion avoidance in satellite ATM networks |
US6535905B1 (en) * | 1999-04-29 | 2003-03-18 | Intel Corporation | Method and apparatus for thread switching within a multithreaded processor |
US6480508B1 (en) * | 1999-05-12 | 2002-11-12 | Westell, Inc. | Router-based domain name system proxy agent using address translation |
SE522068C2 (sv) | 1999-07-15 | 2004-01-13 | Ericsson Telefon Ab L M | Metod och anordning för att åstadkomma radioaccessbärartjänster |
JP4922520B2 (ja) | 1999-06-01 | 2012-04-25 | ヤフー! インコーポレイテッド | 帯域幅アロケーションのための方法およびデバイス |
US6865609B1 (en) * | 1999-08-17 | 2005-03-08 | Sharewave, Inc. | Multimedia extensions for wireless local area network |
JP3597089B2 (ja) | 1999-08-31 | 2004-12-02 | 松下電器産業株式会社 | 監視カメラ装置とそのオートトレース実施方法 |
US6674750B1 (en) * | 1999-09-24 | 2004-01-06 | Paradyne Corporation | Apparatus and method for communicating time-division multiplexed data and packet data on a shared bus |
IL138097A0 (en) | 2000-08-25 | 2003-06-24 | Rafael Armament Dev Authority | Method of managing a distributed communications system |
US6754176B1 (en) * | 2000-03-01 | 2004-06-22 | Sharewave, Inc. | Scheme for managing overlapping wireless computer networks |
US6826186B1 (en) * | 2000-03-07 | 2004-11-30 | Cisco Technology, Inc. | Method and apparatus for distributing packets across multiple paths leading to a destination |
US6278723B1 (en) * | 2000-03-08 | 2001-08-21 | Motorola, Inc. | Method and apparatus for minimizing a probability of self-interference among neighboring wireless networks |
US6934752B1 (en) * | 2000-03-23 | 2005-08-23 | Sharewave, Inc. | Quality of service extensions for multimedia applications in wireless computer networks |
US6795418B2 (en) * | 2000-03-31 | 2004-09-21 | Koninklijke Philips Electronics N.V. | Wireless MAC protocol based on a hybrid combination of slot allocation, token passing, and polling for isochronous traffic |
US7000031B2 (en) * | 2000-04-07 | 2006-02-14 | Broadcom Corporation | Method of providing synchronous transport of packets between asynchronous network nodes in a frame-based communications network |
US20020022483A1 (en) * | 2000-04-18 | 2002-02-21 | Wayport, Inc. | Distributed network communication system which allows multiple wireless service providers to share a common network infrastructure |
US7269185B2 (en) | 2000-05-22 | 2007-09-11 | Nortel Networks Limited | Management and control of multi-layer networks |
AU2001263498A1 (en) * | 2000-06-01 | 2001-12-11 | Bbnt Solutions Llc | Method and apparatus for varying the rate at which broadcast beacons are transmitted |
US6763384B1 (en) | 2000-07-10 | 2004-07-13 | International Business Machines Corporation | Event-triggered notification over a network |
KR100909203B1 (ko) | 2000-07-12 | 2009-07-23 | 퀄컴 인코포레이티드 | Ofdm 시스템의 실시간 서비스 및 비-실시간 서비스의멀티플렉싱 |
US6850981B1 (en) * | 2000-07-14 | 2005-02-01 | At&T Corp. | System and method of frame scheduling for QoS-driven wireless local area network (WLAN) |
WO2002013493A1 (fr) * | 2000-08-03 | 2002-02-14 | Morphics Technology, Inc. | Systeme emetteur universel a reconfiguration dynamique |
US6394554B1 (en) * | 2000-08-04 | 2002-05-28 | Megan E. Hingle | “7”-shaped seat belt pillow |
US7050452B2 (en) * | 2000-10-06 | 2006-05-23 | Cognio, Inc. | Systems and methods for interference mitigation among multiple WLAN protocols |
US7072315B1 (en) | 2000-10-10 | 2006-07-04 | Adaptix, Inc. | Medium access control for orthogonal frequency-division multiple-access (OFDMA) cellular networks |
US7272119B2 (en) | 2000-11-02 | 2007-09-18 | Sharp Laboratories Of America, Inc. | Methods and systems for quality of service in networks comprising wireless devices |
US20020159418A1 (en) | 2000-11-02 | 2002-10-31 | Sharp Laboratories Of America, Inc. | Quality of service using wireless lan |
WO2002039668A2 (fr) * | 2000-11-09 | 2002-05-16 | Hrl Laboratories, Llc | Procede et appareil pour la reservation de bande passante adaptative dans des reseaux ponctuels sans fil |
JP2004514382A (ja) * | 2000-11-17 | 2004-05-13 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | 第一ネットワーク及び第二ネットワークを含有する無線システム |
JP4031707B2 (ja) | 2000-12-15 | 2008-01-09 | アダプティックス インコーポレイテッド | グループベースのサブキャリア割当による多重キャリア通信 |
US6947748B2 (en) * | 2000-12-15 | 2005-09-20 | Adaptix, Inc. | OFDMA with adaptive subcarrier-cluster configuration and selective loading |
CA2436858C (fr) * | 2001-01-16 | 2013-04-30 | Aware, Inc. | Initialisation rapide par adaptation de debit sans coupure |
US7110380B2 (en) * | 2001-02-07 | 2006-09-19 | Freescale Semiconductor, Inc. | System, method, and computer program product for sharing bandwidth in a wireless personal area network or a wireless local area network |
US6934554B2 (en) * | 2001-02-21 | 2005-08-23 | Nippon Telegraph And Telephone Corporation | Radio communication system |
US6891841B2 (en) * | 2001-03-12 | 2005-05-10 | Advent Networks, Inc. | Time division multiple access over broadband modulation method and apparatus |
KR100823972B1 (ko) * | 2001-03-26 | 2008-04-22 | 닛신보세키 가부시키 가이샤 | 이온성 액체, 축전 디바이스용 전해질염, 축전 디바이스용전해액, 전기 2중층 캐패시터, 및 2차 전지 |
US7158759B2 (en) * | 2001-04-13 | 2007-01-02 | Broadcom Corporation | Dynamic frequency selection in a wireless communication network |
ES2186531B1 (es) * | 2001-04-19 | 2005-03-16 | Diseño De Sistemas En Silicio, S.A. | Procedimiento de acceso multiple y multiple transmision de datos para un sistema multiusuario de transmision digital de datos punto a multipunto sobre red electrica. |
GB2375014A (en) | 2001-04-27 | 2002-10-30 | Ericsson Telefon Ab L M | Neighbour discovery in a communication network |
US7295518B1 (en) * | 2001-08-30 | 2007-11-13 | Entropic Communications Inc. | Broadband network for coaxial cable using multi-carrier modulation |
JP3858746B2 (ja) * | 2001-05-08 | 2006-12-20 | ソニー株式会社 | 無線通信システム、無線通信制御装置及び無線通信制御方法、並びにコンピュータ・プログラム |
CA2447698C (fr) | 2001-05-18 | 2011-07-05 | Telstra Corporation Limited | Commande de largeur de bande reseau |
AU2002317073A1 (en) * | 2001-06-27 | 2003-03-03 | Nortel Networks Limited | Mapping information in wireless communications systems |
US7277413B2 (en) * | 2001-07-05 | 2007-10-02 | At & T Corp. | Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation |
US7136361B2 (en) * | 2001-07-05 | 2006-11-14 | At&T Corp. | Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation |
US7245592B2 (en) * | 2001-07-09 | 2007-07-17 | Koninklijke Philips Electronics N.V. | Aligning 802.11e HCF and 802.11h TPC operations |
AU2002355064A1 (en) * | 2001-07-17 | 2003-03-03 | Main.Net Communications Ltd. | Dual purpose power line modem |
US6529044B2 (en) * | 2001-07-31 | 2003-03-04 | Compaq Information Technologies Group, L.P. | Conditional clock gate that reduces data dependent loading on a clock network |
US6791997B2 (en) | 2001-08-25 | 2004-09-14 | Nokia Corporation | System and method for collision-free transmission scheduling using neighborhood information and advertised transmission times |
US20030084283A1 (en) | 2001-09-04 | 2003-05-01 | Pixton Jeffrey Seth | Digital broadcast system |
JP2003110571A (ja) * | 2001-09-28 | 2003-04-11 | Sony Corp | タイムホッピングを選択的に実行する無線伝送方法、無線伝送装置、制御局装置並びにプログラム |
US20030081603A1 (en) | 2001-10-26 | 2003-05-01 | Johan Rune | Pending data announcements |
US7289529B2 (en) | 2001-10-31 | 2007-10-30 | At&T Corp. | Method and system for optimally serving stations on wireless LANs using a controlled contention/resource reservation protocol of the IEEE 802.11e standard |
US7180905B2 (en) * | 2001-11-02 | 2007-02-20 | At & T Corp. | Access method for periodic contention-free sessions |
ATE334531T1 (de) * | 2001-11-28 | 2006-08-15 | Freescale Semiconductor Inc | System und verfahren zur kommunikation zwischen mehreren punktkoordinierten drahtlosen netzwerken |
JP3709393B2 (ja) | 2001-12-14 | 2005-10-26 | 富士ソフトエービーシ株式会社 | 遠隔制御システム及び遠隔制御方法 |
US6915477B2 (en) * | 2001-12-28 | 2005-07-05 | Lucent Technologies Inc. | Delay sensitive adaptive quality control loop for rate adaptation |
US6882635B2 (en) * | 2002-02-05 | 2005-04-19 | Qualcomm Incorporated | Coexistence between interfering communication systems |
JP3885597B2 (ja) * | 2002-02-05 | 2007-02-21 | ソニー株式会社 | 無線通信システム及び無線通信制御方法、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム |
US7339897B2 (en) * | 2002-02-22 | 2008-03-04 | Telefonaktiebolaget Lm Ericsson (Publ) | Cross-layer integrated collision free path routing |
JP3597511B2 (ja) * | 2002-02-22 | 2004-12-08 | エヌ・ティ・ティ・コムウェア株式会社 | 無線装置およびその通信経路制御方法、コンピュータプログラム |
US7315573B2 (en) * | 2002-02-28 | 2008-01-01 | Texas Instruments Incorporated | Channel monitoring for improved parameter selection in a communication system |
US7088677B1 (en) | 2002-03-01 | 2006-08-08 | Bellsouth Intellectual Property Corporation | System and method for delay-based congestion detection and connection admission control |
US6862456B2 (en) | 2002-03-01 | 2005-03-01 | Cognio, Inc. | Systems and methods for improving range for multicast wireless communication |
JP3849551B2 (ja) * | 2002-03-05 | 2006-11-22 | ソニー株式会社 | 無線通信システム、無線通信装置及び方法、並びにコンピュータ・プログラム |
US7333814B2 (en) * | 2002-03-06 | 2008-02-19 | Freescale Semiconductor, Inc. | Method of accommodating overlapping or adjacent networks |
WO2003081848A1 (fr) * | 2002-03-21 | 2003-10-02 | Cognio, Inc. | Protocole de controle ad hoc regissant l'utilisation d'une bande de frequence radio partagee ou non autorisee |
EP1355450B1 (fr) * | 2002-04-10 | 2006-10-25 | Lucent Technologies Inc. | Réduction des effects de chevauchement des canaux dans des réseaux locaux sans fils utilisant un protocol central d'accès |
US7200178B2 (en) | 2002-06-12 | 2007-04-03 | Texas Instruments Incorporated | Methods for optimizing time variant communication channels |
US7551546B2 (en) * | 2002-06-27 | 2009-06-23 | Nortel Networks Limited | Dual-mode shared OFDM methods/transmitters, receivers and systems |
US7634275B2 (en) * | 2002-07-03 | 2009-12-15 | Freescale Semiconductor, Inc. | Method of accommodating periodic interfering signals in a wireless network |
JP3968514B2 (ja) | 2002-07-05 | 2007-08-29 | ソニー株式会社 | 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム |
US20040013135A1 (en) * | 2002-07-17 | 2004-01-22 | Yoram Haddad | System and method for scheduling traffic in wireless networks |
US20040022181A1 (en) * | 2002-08-05 | 2004-02-05 | Coffey John T. | Pseudo-bit-loading for enhanced performance with standards-compliant air interface for multi-tone wireless lans |
US6741554B2 (en) * | 2002-08-16 | 2004-05-25 | Motorola Inc. | Method and apparatus for reliably communicating information packets in a wireless communication network |
US6928283B2 (en) * | 2002-09-20 | 2005-08-09 | Interdigitial Technology Corporation | Method and system for improved beacon acquisition performance with time slot and antenna sector reuse |
US7653012B2 (en) | 2002-09-26 | 2010-01-26 | Sharp Laboratories Of America, Inc. | Relay transmission of data in a centralized network |
FR2846183B1 (fr) * | 2002-10-21 | 2005-01-14 | Evolium Sas | Procede et dispositif de gestion de changements de ressources dans un reseau de communications |
US7002900B2 (en) | 2002-10-25 | 2006-02-21 | Qualcomm Incorporated | Transmit diversity processing for a multi-antenna communication system |
AU2003237337A1 (en) | 2002-11-19 | 2004-06-15 | Bae Systems Information And Electronic Systems Integration Inc | Bandwidth efficient wirless network modem |
CA2516359C (fr) * | 2003-02-19 | 2013-03-19 | Flarion Technologies, Inc. | Procedes et appareil de codage ameliore dans des systemes de communications multi-usagers |
US7206297B2 (en) * | 2003-02-24 | 2007-04-17 | Autocell Laboratories, Inc. | Method for associating access points with stations using bid techniques |
US7885228B2 (en) | 2003-03-20 | 2011-02-08 | Qualcomm Incorporated | Transmission mode selection for data transmission in a multi-channel communication system |
US7116936B2 (en) * | 2003-05-07 | 2006-10-03 | Hughes Network Systems, Inc. | Method and apparatus for estimating beacon power variations |
US6980810B1 (en) * | 2003-05-12 | 2005-12-27 | At&T Corp. | Point coordinated spread-spectrum wireless local area network |
JP4264645B2 (ja) * | 2003-07-31 | 2009-05-20 | ソニー株式会社 | 無線通信システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム |
KR20060063897A (ko) | 2003-07-29 | 2006-06-12 | 소니 가부시끼 가이샤 | 무선 통신 시스템, 무선 통신 장치 및 무선 통신 방법, 및컴퓨터 프로그램 |
US7388882B2 (en) | 2003-08-04 | 2008-06-17 | Lucent Technologies Inc. | Method for dynamically reconfiguring wireless network capacity |
JP4393514B2 (ja) * | 2003-08-06 | 2010-01-06 | パナソニック株式会社 | 通信システムの親局及びアクセス制御方法 |
US7474677B2 (en) * | 2003-08-12 | 2009-01-06 | Bose Corporation | Wireless communicating |
US7233991B2 (en) * | 2003-08-22 | 2007-06-19 | Clearmesh Networks, Inc. | Self-healing tree network |
US7818018B2 (en) | 2004-01-29 | 2010-10-19 | Qualcomm Incorporated | Distributed hierarchical scheduling in an AD hoc network |
-
2004
- 2004-11-05 JP JP2006538485A patent/JP2007516662A/ja active Pending
- 2004-11-05 ES ES04800754T patent/ES2377648T3/es active Active
- 2004-11-05 EP EP04800755.3A patent/EP1692624B1/fr not_active Expired - Fee Related
- 2004-11-05 JP JP2006538487A patent/JP2007521766A/ja active Pending
- 2004-11-05 WO PCT/US2004/036969 patent/WO2005048511A2/fr active Application Filing
- 2004-11-05 EP EP04800753A patent/EP1692619B1/fr not_active Expired - Fee Related
- 2004-11-05 WO PCT/US2004/036799 patent/WO2005048047A2/fr active Application Filing
- 2004-11-05 JP JP2006538486A patent/JP4401390B2/ja not_active Expired - Fee Related
- 2004-11-05 EP EP04800754A patent/EP1690350B1/fr not_active Expired - Fee Related
- 2004-11-05 ES ES04800753T patent/ES2401334T3/es active Active
- 2004-11-05 WO PCT/US2004/036797 patent/WO2005045689A2/fr active Application Filing
-
2005
- 2005-03-23 US US11/089,623 patent/US8050184B2/en active Active
- 2005-03-23 US US11/089,759 patent/US7672232B2/en not_active Expired - Fee Related
- 2005-03-23 US US11/089,882 patent/US7821964B2/en not_active Expired - Fee Related
- 2005-03-23 US US11/089,629 patent/US8300540B2/en active Active
- 2005-03-23 US US11/089,756 patent/US7822058B2/en not_active Expired - Fee Related
- 2005-03-23 US US11/089,792 patent/US7430601B2/en active Active
-
2010
- 2010-01-08 US US12/684,882 patent/US8130739B2/en not_active Expired - Fee Related
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1692624B1 (fr) | Procede pour coordination de dispositifs reseau avec echanges de messages explicites limites | |
US7856008B2 (en) | Synchronizing channel sharing with neighboring networks | |
EP1652348B1 (fr) | Dispositif terminal et procede de transfert maitre-esclave dans un systeme de communication d'acces au support | |
US7848306B2 (en) | Coexistence of access provider and in-home networks | |
US7720471B2 (en) | Method for managing hidden stations in a centrally controlled network | |
JP4873783B2 (ja) | ワイヤレス・ネットワークのための適応通信プロトコル | |
US20090213816A1 (en) | Timeslot Sharing Protocol for Wireless Communication Networks | |
KR20090078298A (ko) | 무선 센서 네트워크에서의 센서 노드 간의 타이밍 스케줄링방법 및 장치 | |
EP1894118A1 (fr) | Procede de transition entre des modes de coordination pour des reseaux voisins interferant | |
CN106912110B (zh) | 一种单发多收空口资源分配方法 | |
Elmachkour et al. | New insights from a delay analysis for cognitive radio networks with and without reservation | |
Benslimane et al. | A new opportunistic MAC layer protocol for cognitive IEEE 802.11-based wireless networks | |
EP1183825B1 (fr) | Protocole de controle d'acces au support destine a un reseau sans fil reparti avec support pour services isochrones | |
WO2023236145A1 (fr) | Procédé et appareil de communication | |
Ayyagari et al. | A coordination and bandwidth sharing method for multiple interfering neighbor networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20060606 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): DE ES FR GB |
|
DAX | Request for extension of the european patent (deleted) | ||
RBV | Designated contracting states (corrected) |
Designated state(s): DE ES FR GB |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SHARP KABUSHIKI KAISHA |
|
A4 | Supplementary search report drawn up and despatched |
Effective date: 20100713 |
|
17Q | First examination report despatched |
Effective date: 20101221 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 602004049247 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: G06F0015173000 Ipc: H04W0016140000 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04W 16/14 20090101AFI20151126BHEP Ipc: H04L 5/00 20060101ALI20151126BHEP Ipc: H04W 8/00 20090101ALN20151126BHEP Ipc: H04W 28/16 20090101ALN20151126BHEP Ipc: H04W 74/08 20090101ALN20151126BHEP Ipc: H04L 12/28 20060101ALN20151126BHEP Ipc: H04W 48/08 20090101ALN20151126BHEP |
|
INTG | Intention to grant announced |
Effective date: 20151211 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE ES FR GB |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602004049247 Country of ref document: DE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160504 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602004049247 Country of ref document: DE |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20170207 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20161105 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20170731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20161130 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20161105 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20171121 Year of fee payment: 14 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 602004049247 Country of ref document: DE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20190601 |