WO2005025148A1 - Method of providing a medium access protocol - Google Patents

Method of providing a medium access protocol Download PDF

Info

Publication number
WO2005025148A1
WO2005025148A1 PCT/IB2004/051551 IB2004051551W WO2005025148A1 WO 2005025148 A1 WO2005025148 A1 WO 2005025148A1 IB 2004051551 W IB2004051551 W IB 2004051551W WO 2005025148 A1 WO2005025148 A1 WO 2005025148A1
Authority
WO
WIPO (PCT)
Prior art keywords
station
data packet
packet
waiting time
network
Prior art date
Application number
PCT/IB2004/051551
Other languages
French (fr)
Inventor
Klaus Peter May
Guido Hiertz
Joerg Habetha
Olaf Wischhusen
Original Assignee
Philips Intellectual Property & Standards Gmbh
Koninklijke Philips Electronics N. V.
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Philips Intellectual Property & Standards Gmbh, Koninklijke Philips Electronics N. V. filed Critical Philips Intellectual Property & Standards Gmbh
Priority to US10/570,868 priority Critical patent/US8126006B2/en
Priority to JP2006525239A priority patent/JP4633720B2/en
Priority to EP04769846A priority patent/EP1665668B1/en
Publication of WO2005025148A1 publication Critical patent/WO2005025148A1/en

Links

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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433—Allocation of priorities to traffic types
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1657—Implicit acknowledgement of correct or incorrect reception, e.g. with a moving window
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end
    • H04L1/1854—Scheduling and prioritising arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092—Error control systems characterised by the topology of the transmission link
    • H04L2001/0097—Relays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient

Definitions

  • the invention relates to a method of providing a medium access control protocol using a listen-before-talk scheme within a wireless network having a plurality of stations communicating over a channel, wherein a valid route from a source station to a destination station via at least one more station is determined.
  • the data packets are sent from the source station to a forwarding station which copies them and sends them either to the destination station or to another forwarder.
  • the IEEE 802.11 standard for wireless local area networks covers in particular ad hoc networks lacking any fixed infrastructure.
  • An IEEE 802.11 network in general, consists of Basic Service Sets (BSS) consisting of mobile nodes, herein referred to as stations, controlled by a single coordination function that determines when a station transmits and receives via the wireless medium.
  • BSSs are either in infrastmcture mode or they work independently.
  • All stations of the BSS must be in the reception range of a Hybrid Coordinator (HC) or Point Coordinator (PC).
  • HC Hybrid Coordinator
  • PC Point Coordinator
  • all stations must be in the reception range of every other member of the BSS. Otherwise, no communication is possible.
  • the Medium Access Control (MAC) protocol that is common to all types of IEEE 802.11 radio networks is the Distributed Coordination Function (DCF) that works as a listen-before-talk scheme based on the Carrier Sense Multiple Access PHDFmn ⁇ ? 2
  • DCF Distributed Coordination Function
  • CSMA Collision Avoidance
  • CA Collision Avoidance
  • Data frames and the optionally transmitted Request-To-Send/Clear-To-Send control frames include the information of how long it takes to transmit the data packet including its corresponding Acknowledgement (ACK) response, and in case of fragmentation, including the next fragment.
  • the RTS/CTS mechanism helps to protect data packets against hidden stations. Immediate positive acknowledgements are employed to determine the successful reception of each data packet. This is accomplished by the receiving station initiating the transmission of an acknowledgement frame after a time interval Short Interframe Space (SIFS). SIFS are used for the highest priority to transmissions enabling stations with this type of information to access the radio link first. Examples of information which will be transmitted after the SIFS has expired include RTS and CTS messages in addition to positive acknowledgements. To introduce multihop communication into IEEE 802.11, some efficiency problems need to be solved.
  • SIFS Short Interframe Space
  • the method comprises transmitting a data packet over said channel by a first station, receiving that data packet in a second station, analyzing data in said data packet by said second station whether said data packet is to be forwarded further, and if said data packet is to be forwarded further, prioritizing transmission of said data packet on the valid route from source station to destination station.
  • the invention prioritizes the multihop route. Instead of performing a backoff after having received the data packet to be forwarded further, it is suggested to allow the receiving station to retransmit the data to the next hop practically immediately.
  • Each forwarding station analyzes the incoming data and is therefore able to differentiate data to be relayed from data to be processed locally.
  • a wireless network having a plurality of stations communicating over a channel, wherein a valid route from a source station to a destination station via at least one more station is determined, controls communication using the above medium access control protocol. It may also be that the acknowledgement is sent before the data packet is forwarded to the next station.
  • the second station does not send an acknowledgement of receipt to said first station before forwarding the packet, as the forwarded packet is interpreted by said first station as acknowledgement of receipt of the packet.
  • the shortest waiting time will be the Short Interframe Space SIFS.
  • DIFS Distributed Inter-Frame Space
  • AIFS Automatic Inter-Frame Space
  • Fig. 1 illustrates a procedure according to the invention
  • Fig. 2 illustrates the standard procedure for multihop in IEEE 802.11.
  • FIG. 1 shows station B which is forwarding data received from station
  • a forwarding station B sends the data it receives from station A to a third station C which can be the destination station or another forwarding station.
  • the transmission consists of two independent sessions, from station A to station B, then from station B to station C. They are fully conforming to IEEE 802.11 as fully separated by the backoff time in which the channel can be accessed by another node.
  • the invention avoids the backoff mechanism and therefore increases the throughput considerably.
  • the receiving station of a hop can forward the data packet it has just received directly after the shortest wait time defined in IEEE 802.11, the Short Interframe Space, meaning with highest priority. PHDFrnr u ? 5
  • the invention can be used in car-to-car communication, in in-house communication and at access points with meshed networks.

Abstract

A method of providing a medium access control protocol using a listen­before-talk scheme within a wireless network having a plurality of stations communicating over a channel, wherein a valid route from a source station to a destination station via at least one more station is determined, said method comprising: transmitting a data packet over said channel by a first station; receiving said data packet in a second station; analyzing data in said data packet by said second station whether said data packet is to be forwarded further; and if said data packet is to be forwarded further, prioritizing transmission of said data packet on said valid route.

Description

Method of Providing a Medium Access Protocol
The invention relates to a method of providing a medium access control protocol using a listen-before-talk scheme within a wireless network having a plurality of stations communicating over a channel, wherein a valid route from a source station to a destination station via at least one more station is determined. In recent years, there has been an increasing trend towards personal computers, workstations and other communication devices becoming portable and mobile, and consequently there is a growing interest in wireless packet networks. To increase the range and capacity of a wireless network, the traffic is carried over multiple hops. Instead of sending the data packets directly from the source station to the destination station which might be unreachable for the given amount of transmission power, the data packets are sent from the source station to a forwarding station which copies them and sends them either to the destination station or to another forwarder.
The IEEE 802.11 standard for wireless local area networks covers in particular ad hoc networks lacking any fixed infrastructure. An IEEE 802.11 network, in general, consists of Basic Service Sets (BSS) consisting of mobile nodes, herein referred to as stations, controlled by a single coordination function that determines when a station transmits and receives via the wireless medium. Those BSSs are either in infrastmcture mode or they work independently. In the first case, all stations of the BSS must be in the reception range of a Hybrid Coordinator (HC) or Point Coordinator (PC). In the latter case, all stations must be in the reception range of every other member of the BSS. Otherwise, no communication is possible. The Medium Access Control (MAC) protocol that is common to all types of IEEE 802.11 radio networks is the Distributed Coordination Function (DCF) that works as a listen-before-talk scheme based on the Carrier Sense Multiple Access PHDFmnΗ ? 2
(CSMA) strategy with Collision Avoidance (CA). When a data packet is ready for sending, the MAC first senses the channel, and if the channel is idle, the MAC will send the data packet immediately. Otherwise, the system waits until the current transmission has finished to set a timer with a randomly chosen backoff time. When the timer expires, the MAC will send the data packet. During the backoff period, the timer is halted when the MAC layer detects activity on the channel again. Backoff minimizes collisions during contention between multiple stations, but then it causes an unpredictible delay. It also incorporates the risk of collisions which then decreases the throughput even more. The MAC protocol defines a concept called virtual carrier sensing. Data frames and the optionally transmitted Request-To-Send/Clear-To-Send control frames (RTS/CTS) include the information of how long it takes to transmit the data packet including its corresponding Acknowledgement (ACK) response, and in case of fragmentation, including the next fragment. The RTS/CTS mechanism helps to protect data packets against hidden stations. Immediate positive acknowledgements are employed to determine the successful reception of each data packet. This is accomplished by the receiving station initiating the transmission of an acknowledgement frame after a time interval Short Interframe Space (SIFS). SIFS are used for the highest priority to transmissions enabling stations with this type of information to access the radio link first. Examples of information which will be transmitted after the SIFS has expired include RTS and CTS messages in addition to positive acknowledgements. To introduce multihop communication into IEEE 802.11, some efficiency problems need to be solved.
It is the object of the invention to provide a medium access control protocol which avoids frequent backoffs in multihop connections. Since IEEE 802.11 is already a widespread standard, the new protocol has to be compatible to the protocol existing devices rely on, since, even though those legacy devices will not be able to make use of the invention, it is desirable that they can still operate properly together with devices that support the improved multihop protocol. PHDFfVWl l ? 3
This object is solved by a method of claim 1 and a network of claim 10. According to the invention, the method comprises transmitting a data packet over said channel by a first station, receiving that data packet in a second station, analyzing data in said data packet by said second station whether said data packet is to be forwarded further, and if said data packet is to be forwarded further, prioritizing transmission of said data packet on the valid route from source station to destination station. In other words, the invention prioritizes the multihop route. Instead of performing a backoff after having received the data packet to be forwarded further, it is suggested to allow the receiving station to retransmit the data to the next hop practically immediately. Each forwarding station analyzes the incoming data and is therefore able to differentiate data to be relayed from data to be processed locally. It can therefore decide whether to transmit only the acknowledgement frame to the sender or to also forward the data packet to the next hop, preferably after only having waited a shorter waiting time interval than other stations with the same or any traffic class, which can be the shortest waiting time available in the system and is normally given by restrictions due to the listen-before-talk scheme. Said shorter waiting time interval may also be the interframe interval that corresponds to a higher priority class than the original priority of the packet. Also according to the invention, a wireless network having a plurality of stations communicating over a channel, wherein a valid route from a source station to a destination station via at least one more station is determined, controls communication using the above medium access control protocol. It may also be that the acknowledgement is sent before the data packet is forwarded to the next station. An alternative is that said second station does not send an acknowledgement of receipt to said first station before forwarding the packet, as the forwarded packet is interpreted by said first station as acknowledgement of receipt of the packet. Operating under the IEEE 802.11 standard and based on CSMA/CA, the shortest waiting time will be the Short Interframe Space SIFS. In the sub-standard IEEE 802.1 le the Distributed Inter-Frame Space (DIFS), which is the normal waiting time in- between transmissions, has been replaced by the concept of the "Arbitrary Inter-Frame Spaces" (AIFS). There are different AIFS (waiting time) lengths depending on the priority, rsp. traffic category of the packet to be transmitted. As an alternative to PHDFnim i ? 4
employ SIFS instead of DIFS for multihop connections, it is therefore also possible with 802.1 le to employ a shorter AIFS for multihop connections than for all other single hop connections of the same traffic class. Even though the SIFS instead of DIFS solution is more efficient for multihop connections because it is almost impossible for other connections to interrupt the end-to-end transmission of a multihop packet, the short AIFS solution provides at least a basic prioritization of the multihop traffic. The invention will be further described in detail below with reference of the accompanying drawings, wherein
Fig. 1 illustrates a procedure according to the invention; and Fig. 2 illustrates the standard procedure for multihop in IEEE 802.11.
Figure 1 shows station B which is forwarding data received from station
A to station C. After having transmitted the ACK frame to station A and having still waited the SIFS period in between the acknowledgement of the received data packet and its forwarding, the relaying station has highest priority. Stations A and C can be completely standard conform, only the forwarding stations need to be modified. Other stations will not be able to access the medium in the meantime since they will detect a busy medium when station B starts its transmission. This is independent from whether they are able to support the new method themselves. According to the standard procedure in IEEE 802.11 , on the other hand, as shown in figure 2, a forwarding station B sends the data it receives from station A to a third station C which can be the destination station or another forwarding station. The transmission consists of two independent sessions, from station A to station B, then from station B to station C. They are fully conforming to IEEE 802.11 as fully separated by the backoff time in which the channel can be accessed by another node. The invention avoids the backoff mechanism and therefore increases the throughput considerably. The receiving station of a hop can forward the data packet it has just received directly after the shortest wait time defined in IEEE 802.11, the Short Interframe Space, meaning with highest priority. PHDFrnr u ? 5
The invention can be used in car-to-car communication, in in-house communication and at access points with meshed networks.

Claims

τ-rr>Fmmι ? CLAIMS:
1. A method of providing a medium access control protocol using a listen-before-talk scheme within a wireless network having a plurality of stations communicating over a channel, wherein a valid route from a source station to a destination station via at least one more station is determined, said method comprising: - transmitting a data packet over said channel by a first station; receiving said data packet in a second station; analyzing data in said data packet by said second station whether said data packet is to be forwarded further; and if said data packet is to be forwarded further, prioritizing transmission of said data packet on said valid route.
2. The method as claimed in claim 1, characterized in that prioritizing transmission of said data packet on said valid route comprises forwarding said data packet from said second station to a third station after a shorter waiting time interval than other stations with the same or any traffic class.
3. The method as claimed in claim 2, characterized in that said shorter waiting time interval is the shortest waiting time possible in the system.
4. The method as claimed in claim 2, characterized in that said shorter waiting time interval is the inter-frame interval that corresponds to a higher priority class than the original priority of the packet. PT-inFrrmΗ ? 7
5. The method as claimed in claim 2, characterized in that said second station acknowledges receipt of said data packet before forwarding it to said third station.
6. The method as claimed in claim 2, characterized in that said second station does not send an acknowledgement of receipt to said first station before forwarding the packet, as the forwarded packet is interpreted by said first station as acknowledgement of receipt of the packet.
7. Use of a method as defined in any of claims 1 to 6 in car-to-car communication.
8. Use of a method as defined in any of claims 1 to 6 in in-house communication.
9. Use of a method as defined in any of claims 1 to 6 at access points with meshed networks.
10. A wireless network having a plurality of stations communicating over a channel, wherein a valid route from a source station to a destination station via at least one more station is determined, the communication between stations being controlled by a medium access control protocol using a listen-before-talk scheme to transmit a data packet oversack channel by a first station; receive said data packet in a second station; - analyze data in said data packet by said second station whether said data packet is to be forwarded further; and if said data packet is to be forwarded further, prioritizing transmission of said data packet on said valid route.
11. The network as claimed in claim 10, wherein two prioritized transmissions of said data packet on said valid route comprises forwarding said data packet from said second PHDF.m 1 1 8
station to a third station after a shorter waiting time interval than other stations with the same or any traffic class.
12. The network as claimed in claim 11, wherein said shorter waiting time interval is the shortest waiting time possible in the system.
13. The network as claimed in claim 11, wherein said shorter waiting time interval is the inter-frame interval that corresponds to a higher priority class than the original priority of the packet.
14. The network as claimed in claim 11, wherein said second station acknowledges receipt of said data packet before forwarding it to said third station.
15. The network as claimed in claim 11, characterized in that said second station does not send an acknowledgement of receipt to said first station before forwarding the packet, as the forwarded packet is inteφreted by said first station as acknowledgement of receipt of the packet.
PCT/IB2004/051551 2003-09-08 2004-08-24 Method of providing a medium access protocol WO2005025148A1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US10/570,868 US8126006B2 (en) 2003-09-08 2004-08-24 Method of providing a medium access protocol
JP2006525239A JP4633720B2 (en) 2003-09-08 2004-08-24 How to provide a media access protocol
EP04769846A EP1665668B1 (en) 2003-09-08 2004-08-24 Method of providing a medium access protocol

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP03102721.2 2003-09-08
EP03102721 2003-09-08

Publications (1)

Publication Number Publication Date
WO2005025148A1 true WO2005025148A1 (en) 2005-03-17

Family

ID=34259206

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2004/051551 WO2005025148A1 (en) 2003-09-08 2004-08-24 Method of providing a medium access protocol

Country Status (5)

Country Link
US (1) US8126006B2 (en)
EP (1) EP1665668B1 (en)
JP (1) JP4633720B2 (en)
CN (1) CN1849785A (en)
WO (1) WO2005025148A1 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007113730A1 (en) * 2006-03-31 2007-10-11 Koninklijke Philips Electronics N.V. Mobile station for a multi-channel based communications network
WO2009009691A1 (en) * 2007-07-10 2009-01-15 Qualcomm Incorporated Methods and appartus for controlling interference to broadcast signaling in a peer to peer network
US8495232B2 (en) 2007-07-10 2013-07-23 Qualcomm Incorporated Methods and apparatus for supporting broadcast communications in a peer to peer network
US8694662B2 (en) 2007-07-10 2014-04-08 Qualcomm Incorporated Method and apparatus for communicating transmission requests to members of a group and/or making group related transmission decisions
US8861418B2 (en) 2007-07-10 2014-10-14 Qualcomm Incorporated Methods and apparatus for supporting group communications with data re-transmission support

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7304975B2 (en) * 2004-08-16 2007-12-04 Freescale Semiconductor, Inc. Method for providing rapid delayed frame acknowledgement in a wireless transceiver
GB0616475D0 (en) * 2006-08-18 2006-09-27 Fujitsu Ltd Communication systems
US8867518B2 (en) * 2007-04-30 2014-10-21 Avaya Inc. Method and apparatus performing express forwarding bypass for time-critical frames
JPWO2011145345A1 (en) * 2010-05-19 2013-07-22 三洋電機株式会社 Base station apparatus and terminal apparatus
US20120320931A1 (en) * 2011-06-20 2012-12-20 Texas Instruments Incorporated Dynamic selection of mac interframe parameters in plc networks
US10098002B2 (en) 2012-12-31 2018-10-09 Zte Corporation Integrated wireless local area network for spectrum sharing
CN104053213B (en) * 2013-03-11 2018-04-17 中兴通讯股份有限公司 Integrated relaying in cordless communication network
CN104219152A (en) * 2013-06-04 2014-12-17 中兴通讯股份有限公司 Routing method and device among various wireless networks
CN104065720A (en) * 2014-06-19 2014-09-24 清华大学 MAC protocol based on instant forwarding
KR101938513B1 (en) 2015-04-10 2019-04-11 지티이 코포레이션 Method and apparatus for contention of unauthorized carrier

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002041590A1 (en) * 2000-11-17 2002-05-23 University Of Surrey Media access control for wireless systems
WO2003028315A1 (en) * 2001-09-27 2003-04-03 Telefonaktiebolaget Lm Ericsson Method for multihop routing for distributed wlan networks

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2591467B2 (en) * 1994-04-18 1997-03-19 日本電気株式会社 Access method
US5963560A (en) * 1997-03-05 1999-10-05 Advanced Micro Devices, Inc. Method and arrangement for providing multi-level priority in a rotating priority arrangement for access to medium in an ethernet network
JP2001231078A (en) 2000-02-16 2001-08-24 Nippon Telegr & Teleph Corp <Ntt> Radio packet relay station and radio packet relay method
JP3639792B2 (en) * 2000-07-25 2005-04-20 株式会社日立製作所 Network system and communication bandwidth control method thereof
JP3469188B2 (en) * 2000-10-13 2003-11-25 日本電信電話株式会社 Wireless packet relay method, wireless packet relay system, and wireless station
US7299063B2 (en) * 2002-07-01 2007-11-20 Sony Corporation Wireless communication system, wireless communication device and wireless communication method, and computer program
US7787419B2 (en) * 2002-09-17 2010-08-31 Broadcom Corporation System and method for providing a mesh network using a plurality of wireless access points (WAPs)
AU2003279869A1 (en) * 2002-10-04 2004-05-04 Input/Output, Inc. Wireless communication method, system and apparatus
FI112421B (en) * 2002-10-29 2003-11-28 Tellabs Oy Method and device for time allocation of transmission connection capacity between packet switched data communication flows

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002041590A1 (en) * 2000-11-17 2002-05-23 University Of Surrey Media access control for wireless systems
WO2003028315A1 (en) * 2001-09-27 2003-04-03 Telefonaktiebolaget Lm Ericsson Method for multihop routing for distributed wlan networks

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007113730A1 (en) * 2006-03-31 2007-10-11 Koninklijke Philips Electronics N.V. Mobile station for a multi-channel based communications network
WO2009009691A1 (en) * 2007-07-10 2009-01-15 Qualcomm Incorporated Methods and appartus for controlling interference to broadcast signaling in a peer to peer network
US7961698B2 (en) 2007-07-10 2011-06-14 Qualcomm Incorporated Methods and apparatus for controlling interference to broadcast signaling in a peer to peer network
KR101154429B1 (en) 2007-07-10 2012-06-15 콸콤 인코포레이티드 Methods and apparatus for controlling interference to broadcast signaling in a peer to peer network
US8495232B2 (en) 2007-07-10 2013-07-23 Qualcomm Incorporated Methods and apparatus for supporting broadcast communications in a peer to peer network
US8694662B2 (en) 2007-07-10 2014-04-08 Qualcomm Incorporated Method and apparatus for communicating transmission requests to members of a group and/or making group related transmission decisions
US8724609B2 (en) 2007-07-10 2014-05-13 Qualcomm Incorporated Methods and apparatus for controlling interference to broadcast signaling in a peer to peer network
US8861418B2 (en) 2007-07-10 2014-10-14 Qualcomm Incorporated Methods and apparatus for supporting group communications with data re-transmission support

Also Published As

Publication number Publication date
EP1665668A1 (en) 2006-06-07
CN1849785A (en) 2006-10-18
US8126006B2 (en) 2012-02-28
US20070025379A1 (en) 2007-02-01
EP1665668B1 (en) 2012-10-10
JP2007505518A (en) 2007-03-08
JP4633720B2 (en) 2011-02-16

Similar Documents

Publication Publication Date Title
US20220132611A1 (en) Multi-link communications of a wireless network
JP4622503B2 (en) Wireless communication system, wireless communication apparatus, wireless communication method, and computer program
Leung et al. Outdoor IEEE 802.11 cellular networks: MAC protocol design and performance
EP1430619B1 (en) A system and method employing algorithms and protocols for optimizing carrier sense multiple access (CSMA) protocols in wireless networks
US7843819B1 (en) Protocol for wireless multi-channel access control
Zhai et al. DUCHA: A new dual-channel MAC protocol for multihop ad hoc networks
US7391789B2 (en) Ad-hoc network wireless communication system and method thereof
EP2894929B1 (en) Method for access to a medium by a multi-channel device
US7822009B2 (en) Distributed medium access protocol for wireless mesh networks
Choi et al. Multi-channel MAC protocol for mobile ad hoc networks
JP4588465B2 (en) Transmission control method
US8126006B2 (en) Method of providing a medium access protocol
WO2006031587A2 (en) Reducing latency when transmitting acknowledgements in mesh networks
EP1938514A1 (en) Method and apparatus for managing data flow through a mesh network
EP2051559A2 (en) Method and apparatus imposing random delays for avoiding hidden terminal collisions in wireless Mesh networks
US20070223412A1 (en) Method for Signal Transmission in a Radio Communication System
US20220369403A1 (en) Multi-link communications of a wireless network with dynamic link configuration
Hiertz et al. IEEE 802.11 s-mesh deterministic access
CN101729132A (en) Wireless channel access scheme
EP2070262B1 (en) Wireless network
KR20080002296A (en) System and method relaying a frame in a wireless local area network
Wang et al. An improved busy-tone solution for collision avoidance in wireless ad hoc networks
Wang et al. Priority based multiple access for service differentiation in wireless ad-hoc networks
Alonso-Zarate et al. Performance enhancement of DQMAN-based wireless ad hoc networks in multi-hop scenarios
EP1708382A1 (en) Algorithms and protocols for optimizing carrier sense multiple access (CSMA) protocols in wireless networks.

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200480025832.3

Country of ref document: CN

AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2004769846

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2006525239

Country of ref document: JP

WWE Wipo information: entry into national phase

Ref document number: 2007025379

Country of ref document: US

Ref document number: 10570868

Country of ref document: US

WWP Wipo information: published in national office

Ref document number: 2004769846

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 10570868

Country of ref document: US