[go: up one dir, main page]

WO2009128037A1 - Annonce flexible dans des réseaux de type maillé - Google Patents

Annonce flexible dans des réseaux de type maillé Download PDF

Info

Publication number
WO2009128037A1
WO2009128037A1 PCT/IB2009/051571 IB2009051571W WO2009128037A1 WO 2009128037 A1 WO2009128037 A1 WO 2009128037A1 IB 2009051571 W IB2009051571 W IB 2009051571W WO 2009128037 A1 WO2009128037 A1 WO 2009128037A1
Authority
WO
WIPO (PCT)
Prior art keywords
propagation
status information
information
advertisement
advertising
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.)
Ceased
Application number
PCT/IB2009/051571
Other languages
English (en)
Inventor
Theodorus J. J. Denteneer
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Koninklijke Philips Electronics NV
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 Koninklijke Philips Electronics NV filed Critical Koninklijke Philips Electronics NV
Publication of WO2009128037A1 publication Critical patent/WO2009128037A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • 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
    • H04W48/10—Access restriction or access information delivery, e.g. discovery data delivery using broadcasted information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the present invention generally relates to apparatuses, a system and a method of advertising status information (e.g. reservations or the like) in wireless transmission systems such as - but not restricted to - a mesh of a wireless local area network (WLAN).
  • advertising status information e.g. reservations or the like
  • WLAN wireless local area network
  • end stations In WLAN deployments without mesh services, end stations (STAs) must associate with an access point (AP) in order to gain access to the network. These end stations are dependent on the access point with which they are associated to communicate.
  • AP access point
  • a so-called mesh network appears functionally equivalent to a broadcast
  • the mesh network may be an LAN according to the IEEE (Institute of Electrical and Electronics Engineers) 802.11 specifications, where links and control elements forward frames among the network members. Thus, it normally appears as if all mesh points (MPs) in a mesh are directly connected at the link layer. This functionality is transparent to higher layer protocols.
  • MDA mobile phone
  • TX- RX transmitter-receiver
  • MDAOP mesh deterministic access opportunity
  • the reserved data transmission can now be protected from interference, for example, by the following rules. Firstly, radio nodes that advertise a reservation (either in a "TX-RX" times section or in an "interference time” section) may not be allowed to initiate a transmission during a reserved time period, unless the transmission concerned is the reserved transmission itself, or unless the reserved transmission has already been completed.
  • radio nodes that overhear an advertisement of such a reserved transmission may initiate a transmission during the reserved time period, but not with a radio node that advertises the transmission.
  • a transmission range may be defined as the distance at which a transmission can still be correctly received, when there is no interference present.
  • an interference range can be defined as the maximum distance, relative to a transmitter-receiver pair, at which a concurrent transmission destructively interferes with a transmission between the pair.
  • a conventional mechanism may prevent transmissions in an area which is fixed around a receiver. Thereby, the receiver can be protected against interference from transmissions within the area with itself at the center and with radius equal to one transmission range.
  • a station which is outside the transmission range of both receiver and transmitter does not receive an advertisement of the reservation in the "TX-RX" section of the advertised reservation. Hence, it can initiate a transmission to another radio node which is outside this transmission range. This, however, generates a problem with the reservation- advertisement mechanism.
  • the reservation area (in which no transmissions can be initiated) is fixed and independent of the distance between the transmitter and the receiver. However, the actual interference area, i.e. the area from which a destructively interfering transmission can be initiated may be larger or smaller, depending on the distance between the transmitter and receiver in the transmitter receiver pair.
  • Figs. 2 A and 2B show different scenarios where the interference area depends on a distance between a transmitter (TX) and a receiver (RX). Respective transmission ranges 310 and an interference range 320 are shown around the transmitter and the receiver.
  • the area (e.g. interference range 320) reserved via the advertisements may be too large. This results in an "exposed" radio node issue in which radio nodes are prevented from initiating a transmission, although they could do so without causing destructive interference.
  • the area (e.g. interference range 320) reserved via the advertisements may be too small. This results in a "hidden" terminal issue in which radio nodes, that cause destructive interference, are not prevented from initiating a transmission.
  • the interference area 320 may depend on a modulation and coding scheme used for transmission. Thus, if the data transmission rate is high, the transmission is more vulnerable to interference and the interference area 320 could be large. Conversely, if the used transmission rate is low, the transmission is less vulnerable, the interference area 320 is smaller and the reservation area can be decreased to improve spatial reuse.
  • both transmitter and receiver may act as both transmitter and as receiver, because of the required transmission and reception of acknowledgements. It can thus easily happen that the received signal strength of the transmitter to receiver transmission is remarkably different from the transmission from the receiver to the transmitter. Consequently, the interference area around the station with the weakest received signal strength must be larger than the interference area around the station with the strongest received signal strength.
  • the proposed apparatuses may be implemented as processor devices, modules, chips, chip sets or circuitries provided in a network node or station.
  • a processor may be controlled by a computer program product comprising code means for performing the steps of the claimed method when run on a computer or processor device.
  • the estimator may be adapted to estimate received signal strength and to estimate the required amount of protection based on the estimated signal strength.
  • the received signal strength provides a good indicator for reception or channel conditions, so that reliable or adequate adaptation of the advertisement area can be achieved.
  • the estimator may be adapted to estimate the received signal strength during a reservation handshake. This provides the advantage that no additional or separate estimation phase or test signal is required for the proposed estimation.
  • the estimator may be adapted to estimate the required amount of protection based on the estimated signal strength and at least one of a modulation and coding scheme.
  • the additional consideration of the modulation and/or coding scheme may lead to an enhanced estimation result.
  • the propagation information may comprise a propagation count to be decremented or incremented during advertisement.
  • the proposed use of the propagation count for advertisement control enables straight forward control by simply incrementing or decrementing the propagation count until a predetermined number or value has been reached.
  • the advertising controller may be adapted to modify the propagation information by decrementing or incrementing the propagation count if the propagation count does not match with a predetermined number, or to drop the status information if the propagation count matches with the predetermined number. This decision enables direct control of the advertisement area by dropping the advertised status information and thus discontinuing re-advertisement if the propagation count has reached a predetermined number.
  • the advertising controller may be adapted to consider only the highest propagation count if more than one advertisement of the same status information is received. This measure ensures that in a decrementing control system only those advertisements with least amounts of deduction from the propagation count and thus smallest numbers of re-transmissions are considered.
  • the advertising controller may be adapted to check the propagation information only if it is received at least with a predetermined signal strength. Thereby, only advertisements with sufficient quality are considered.
  • the advertising controller may be configured to re-advertise the status information to a subset of those radio nodes overhearing the status information.
  • the subset of radio nodes may be those nodes which have a peer link established with an advertising node which has advertised the status information. This provides the advantage that advertisement can be limited to desired radio nodes.
  • the status information may be a reservation information for avoiding interference during a reserved transmission
  • the advertisement area may be a reservation area.
  • the proposed flexible advertisement control can be used for controlling a reservation area used for reservation advertisements.
  • Fig. 1 shows a schematic network topology of several wireless nodes in a mesh network
  • Figs. 2 A and 2B show an interference area and its dependency on a distance between a transmitter and a receiver;
  • Fig. 3 shows a schematic flow diagram of a transmitter-side advertisement control procedure according to a first embodiment
  • Fig. 4 shows a schematic flow diagram of a receiver-side advertisement control procedure according to a second embodiment
  • Fig. 5 shows a schematic block diagram of an advertisement controller according to a third embodiment.
  • an access point can be enhanced by interoperable wireless links or multi-hop paths between multiple APs.
  • End-user devices such as end stations (STAs) 10 can benefit from the ability to establish interoperable peer-to-peer wireless links with neighbouring end-user devices and APs in a mesh network.
  • Mesh points (MPs) 30 can be quality of service (QoS) STAs that support mesh services, i.e. they participate in interoperable formation and operation of the mesh network.
  • An MP may be collocated with one or more other entities (e.g., AP, portal, etc.).
  • the configuration of an MP that is collocated with an AP is referred to as a mesh access point (MAP) 20.
  • MAP mesh access point
  • STAs associate with APs to gain access to the network.
  • the configuration of an MP that is collocated with a portal (P) is referred to as a mesh portal 40.
  • MPs participate in mesh functionalities such as path selection and forwarding, etc.
  • the mesh portal 40 provides an interface to other networks 100, e.g., to other IEEE 802 LAN segments.
  • Fig. 3 shows a schematic flow diagram of an advertisement control mechanism or procedure in a mesh network, according to a first embodiment.
  • a propagation count is used as propagation (control) information for controlling the advertisement area.
  • both transmitter (or transmitting end) and receiver (or receiving end) involved in an advertisement estimate the received signal strength of the transmission by the other party in the transmission, e.g. based on a reservation handshake or another suitable preparatory or dedicated signaling (step SlOl). Based on this estimate and optionally also at least one of a modulation and coding scheme in use, they can estimate the amount of protection needed to correctly receive the messages from the other party (step S 102).
  • This amount of protection which can be a qualitative or quantitative classification, is then translated in step S 103 into a propagation parameter or information, such as for example a propagation count to be incremented or decremented, based on which the actual advertisement area (e.g.
  • the propagation count can be a non-negative number adapted to the received signal strength and optionally also to at least one of the modulation scheme, the coding scheme and any other suitable parameter in use, which influences reception quality.
  • Fig. 4 shows a schematic flow diagram of an advertisement control mechanism according to a second embodiment at a receiving side of an advertised information, e.g. at any radio node in radio communication range, which overhears this advertisement.
  • the propagation count is used as propagation (control) information for controlling the advertisement area, wherein a decrementing control function is selected.
  • propagation control may as well be based on an incrementing control function.
  • the control procedure in Fig. 4 is triggered whenever an advertisement is detected.
  • step SlOl it is checked whether the propagation count (PC) of a received advertisement has reached a predetermined threshold value, which is zero in the present example. If the PC has reached zero, the procedure ends and the advertisement will not be re-advertised and thus dropped.
  • PC propagation count
  • step S 102 it may optionally be checked in step S 102 whether more than one advertisement of the same status information (e.g. reservation) has been received. If so, the procedure branches to step S 105 and the highest PC of the received advertisements of the same status information is selected for further use in the remaining procedure. Then, the procedure continues with step S 103. If only one advertisement of the same status information has been determined in step S 102, the procedure proceeds with step S 103 and the PC is decremented by one. Then, in step S 104, the received advertisement is re-advertised with the decremented PC and the procedure ends.
  • the same status information e.g. reservation
  • Every radio node overhearing an advertisement may act similarly. So the propagation count will be lowered until it reaches zero. The rule then is that a radio node overhearing an advertisement with a propagation count equal to zero no longer propagates the advertisement. Rather, in case of an advertised reservation, it will respect the advertisement by not transmitting a message to the advertising radio node during the reserved period. It is free, however, to transmit to any radio node which does not advertise the reservation. In the above procedure according to the second embodiment, if a radio node receives or overhears several advertisements of the same status information (e.g. reservation), with different propagation counts, it advertises this reservation only once, but with the highest received propagation count decremented by one.
  • the same status information e.g. reservation
  • a similar rule may be applied to a transmitter-receiver pair involved in setting up a reservation.
  • one of the two nodes uses a propagation count which is two or more higher than the propagation count of the other party.
  • this latter node will use the propagation count of the former node minus one, rather than its own (lower) propagation count.
  • the proposed advertisement control procedure can also be finer grained. For example, not every radio node overhearing an advertisement starts re-advertising the advertisement (with lower PC) in its own advertisements. Rather, they may only do so when they detect an advertisement which is received with at least predefined signal strength. Also, it is possible to limit the re-advertisements to a subset of the radio nodes overhearing the advertisement. E.g., only those nodes having a peer link established with the advertising radio node, re-advertise the reservation (with lower PC).
  • Fig. 5 shows a schematic block diagram of an advertisement controller or control functionality according to a third embodiment, which can be provided in a radio node (e.g. mesh point, mesh access point, mesh portal, or any other type of radio node). It can be implemented as a discrete hardware circuit or circuitry, a chip, a chip set, a module or a software-controlled processor or computer device where the functions of Fig. 5 are provided as software programs or routines.
  • a radio node e.g. mesh point, mesh access point, mesh portal, or any other type of radio node. It can be implemented as a discrete hardware circuit or circuitry, a chip, a chip set, a module or a software-controlled processor or computer device where the functions of Fig. 5 are provided as software programs or routines.
  • Advertisements can be received and transmitted by a transceiver (TRX) circuit 52 which may be provided in a radio frequency (RF) front end of the radio node. Advertisements which are initiated at the advertisement controller can be generated in an advertisement generator (AG) 54 and supplied to the TRX 52 via a propagation control unit
  • Control values such as the PC threshold value for selective dropping of an advertisement, or other PCs of same advertisements can be stored in a look-up table (LUT)
  • a signal estimation unit 53 which estimates signal strength of a received advertisement, or an initial handshake signaling in case of an initiation of a new advertisement at the concerned node.
  • the signal estimation may be based on signal- to-noise ratio, an error rate or any other kind of parameter or ratio suitable to estimate the quality of the received advertisement.
  • the functionalities of the advertisement controller of Fig. 5 enable implementation of either one or both of the advertisement control procedures described in connection with Figs. 3 and 4.
  • a method and apparatuses have been described, which enable flexible spreading of an advertised information (e.g. reservation) by addition of a propagation control value or information (e.g. propagation count), which is spread along the advertised information to flexibly adapt the spreading area to a current channel situation at hand.
  • an advertised information e.g. reservation
  • a propagation control value or information e.g. propagation count
  • the proposed procedure can be used in connection with any kind of status information which needs to be advertisement. It is thus not limited to reservation advertisements.
  • the propagation information used for controlling the advertisement area may be any type of information.
  • a bit pattern may be modified in a predetermined manner or predetermined bit positions may be set in accordance with predetermined rules.
  • a predetermined value may be assigned or allocated to each re-advertisement.
  • a computer program used for controlling processor to perform the claimed features may be stored/distributed on a suitable medium, such as an optical storage medium or a solid-state medium supplied together with or as part of other hardware, but may also be distributed in other forms, such as via the Internet or other wired or wireless telecommunication systems. Any reference signs in the claims should not be construed as limiting the scope thereof.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention porte sur un procédé et des appareils qui permettent un étalement flexible d'informations annoncées par addition d'une valeur ou d’informations de commande de propagation, qui est étalé le long des informations annoncées afin d'adapter de façon flexible la zone d'étalement à une situation de canal courante à portée de main.
PCT/IB2009/051571 2008-04-17 2009-04-15 Annonce flexible dans des réseaux de type maillé Ceased WO2009128037A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP08154679A EP2111000A1 (fr) 2008-04-17 2008-04-17 Publicité flexible dans des réseaux de type maillés
EP08154679.8 2008-04-17

Publications (1)

Publication Number Publication Date
WO2009128037A1 true WO2009128037A1 (fr) 2009-10-22

Family

ID=39743720

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2009/051571 Ceased WO2009128037A1 (fr) 2008-04-17 2009-04-15 Annonce flexible dans des réseaux de type maillé

Country Status (3)

Country Link
EP (1) EP2111000A1 (fr)
TW (1) TW201006277A (fr)
WO (1) WO2009128037A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11678372B1 (en) 2021-11-29 2023-06-13 Rockwell Collins, Inc. System and method for hidden node resolution via collision avoidance in 4G automatic link establishment (ALE) stations

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005076544A1 (fr) * 2004-02-06 2005-08-18 Koninklijke Philips Electronics, N.V. Systeme et procede pour un protocole de reservation repartie de commande d'acces au support a bande ultra large
WO2006106450A1 (fr) * 2005-04-08 2006-10-12 Philips Intellectual Property & Standards Gmbh Procede de commande de puissance et d'adaptation de liaison base sur une detection multi-utilisateur
WO2006120648A2 (fr) * 2005-05-12 2006-11-16 Koninklijke Philips Electronics N.V. Procede destine a une reservation de ressources de canaux multiples dans un reseau maille sans fil

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005076544A1 (fr) * 2004-02-06 2005-08-18 Koninklijke Philips Electronics, N.V. Systeme et procede pour un protocole de reservation repartie de commande d'acces au support a bande ultra large
WO2006106450A1 (fr) * 2005-04-08 2006-10-12 Philips Intellectual Property & Standards Gmbh Procede de commande de puissance et d'adaptation de liaison base sur une detection multi-utilisateur
WO2006120648A2 (fr) * 2005-05-12 2006-11-16 Koninklijke Philips Electronics N.V. Procede destine a une reservation de ressources de canaux multiples dans un reseau maille sans fil

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
HIERTZ G R ET AL: "IEEE 802.15.3a Wireless Personal Area Networks - The MBOA Approach", EUROPEAN WIRELESS CONFERENCE, XX, XX, 1 April 2005 (2005-04-01), pages 1 - 7, XP002329983 *

Also Published As

Publication number Publication date
EP2111000A1 (fr) 2009-10-21
TW201006277A (en) 2010-02-01

Similar Documents

Publication Publication Date Title
US11089603B2 (en) Improving wireless communication in an environment with electromagnetic interference
CN100574119C (zh) 操作无线局域网中转发器的方法
Zhou et al. RCTC: Rapid concurrent transmission coordination in full DuplexWireless networks
US8599809B2 (en) Routing method for wireless mesh networks and wireless mesh network system using the same
US10237751B2 (en) Communications device
US20090175324A1 (en) Dynamic interference control in a wireless communication network
US11258722B2 (en) Telegram splitting transmission method for bidirectional networks
US12348263B2 (en) Enhanced channel hopping sequence
JP2005508594A (ja) インターネット制御メッセージプロトコルによるチャンネル特性の測定方法
US8493945B2 (en) Characterizing transmission of access nodes within a wireless network
US20190036834A1 (en) Telegram splitting transmission method for bidirectional networks
US7920507B2 (en) Time division multiple access for network nodes with multiple receivers
Kim et al. Asymmetric simultaneous transmit and receive in WiFi networks
US11968613B2 (en) Spectrum access restriction and re-routing of data
CN114731613B (zh) 位置感知空间重用
EP2111000A1 (fr) Publicité flexible dans des réseaux de type maillés
So et al. A simple and practical scheme using multiple channels for improving system spectral efficiency of highly dense wireless LANs
Kim et al. Distributed power control for enhanced spatial reuse in CSMA/CA based wireless networks
Chatterjee et al. A new protocol for concurrently allocating licensed spectrum to underlay cognitive users
Maesako et al. Asymmetric hidden node problem aware routing metric for wireless mesh networks
Spachos et al. Comparison of traditional and opportunistic multihop routing in wireless networking scalability
Dai et al. Performance of csma/ca multi-hop network considering intra-flow interference under fading environment
JP2009038754A (ja) 無線通信装置および干渉検出方法
USER et al. NEW PROTOCOL for ALLOCATING LICENSED SPECTRUM CONCURRENTLY to UNDERLAY COGNITIVE USERs, Digital Communications and Networks, http://dx. doi. org/10.1016/j. dcan. 2017.04. 004 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of
Chatterjee et al. Digital Communications and Networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09732796

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09732796

Country of ref document: EP

Kind code of ref document: A1