WO2012044693A1 - Procédé et appareil de recherche de nœud voisin - Google Patents

Procédé et appareil de recherche de nœud voisin Download PDF

Info

Publication number
WO2012044693A1
WO2012044693A1 PCT/US2011/053706 US2011053706W WO2012044693A1 WO 2012044693 A1 WO2012044693 A1 WO 2012044693A1 US 2011053706 W US2011053706 W US 2011053706W WO 2012044693 A1 WO2012044693 A1 WO 2012044693A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
neighbor discovery
time
signature
neighbor
Prior art date
Application number
PCT/US2011/053706
Other languages
English (en)
Inventor
Yigal Bejerano
Katherine Guo
Thyagarajan Nandagopal
Original Assignee
Alcatel-Lucent Usa Inc.
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 Alcatel-Lucent Usa Inc. filed Critical Alcatel-Lucent Usa Inc.
Priority claimed from US13/247,178 external-priority patent/US9066195B2/en
Publication of WO2012044693A1 publication Critical patent/WO2012044693A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/005—Discovery of network devices, e.g. terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/16—Discovering, processing access restriction or access information

Definitions

  • the present invention relates generally to communications and, in particular, to node detection in wireless communication systems.
  • each mobile node periodically broadcasts Hello messages to advertise itself. These Hello messages enable nodes in a given vicinity to discover their neighbors and the link quality for links to them.
  • neighbor discovery itself is not straightforward as one must deal with collisions.
  • distributed schemes are desired as centralized schemes are not energy efficient, especially for networks with a large number of nodes.
  • Commonly used schemes are probabilistic, where a node randomly exchanges messages with its neighbors. The efficiency of randomized schemes can be further improved by using synchronized time slots and receiver feedback information.
  • Neighborhood discovery commonly relies on the assumption that the network forms a single clique where all nodes are within transmission range of each other.
  • nodes are able to detect their neighbors individually by means of a unicast transmission.
  • such neighbor detection schemes suffer from the following shortcomings:
  • determining the Wi-Fi neighborhood of a mobile node can take time on the order of seconds using such schemes. This process also disrupts ongoing communications.
  • FIG. 1 is a block diagram depiction of signaling during a neighbor discovery process in accordance with various embodiments of the present invention.
  • FIG. 2 is a block diagram depiction of signaling during a neighbor discovery process, in accordance with various embodiments of the present invention, in which only two neighboring mobiles are involved.
  • FIG. 3 is a block diagram depiction of signaling during a neighbor discovery process, in accordance with various embodiments of the present invention, in which many neighboring mobiles are involved (only selected entries of four mobiles are depicted).
  • FIG. 4 is a logic flow diagram of functionality performed by a node initiating neighbor discovery in accordance with various embodiments of the present invention.
  • FIG. 5 is a logic flow diagram of functionality performed by a node participating in neighbor discovery in accordance with various embodiments of the present invention. Specific embodiments of the present invention are disclosed below with reference to FIGs. 1-5. Both the description and the illustrations have been drafted with the intent to enhance understanding. For example, the dimensions of some of the figure elements may be exaggerated relative to other elements, and well-known elements that are beneficial or even necessary to a commercially successful implementation may not be depicted so that a less obstructed and a more clear presentation of embodiments may be achieved.
  • a node e.g., a mobile node or a network transceiver node transmits a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur. Then during the neighbor discovery signaling time, the node receives signaling indicating a signature of at least one neighbor node.
  • An article of manufacture is also provided, the article comprising a processor-readable storage medium storing one or more software programs which when executed by one or more processors performs the steps of this first method.
  • the neighbor discovery message that is transmitted further indicates the size of the signature and/or the number of entries to be set in the signature to be transmitted during the neighbor discovery signaling time.
  • the node transmits one or more additional neighbor discovery messages that indicate the time at which neighbor discovery signaling is to occur, the size of the signature, and/or the number of entries to be set in the signature.
  • the node prior to the time at which neighbor discovery signaling is to occur on a channel, the node jams the channel prior to the time at which neighbor discovery signaling is to occur on a channel.
  • the node transmits a neighbor discovery message after jamming the channel and just before the time at which neighbor discovery signaling is to occur.
  • a node receives a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur. Then during the neighbor discovery signaling time, the node transmits a signature identifying itself.
  • An article of manufacture is also provided, the article comprising a processor- readable storage medium storing one or more software programs which when executed by one or more processors performs the steps of this second method.
  • the neighbor discovery message that is received further indicates the size of the signature and/or the number of entries to be set in the signature to be transmitted during the neighbor discovery signaling time.
  • the signature comprises a binary vector Vx of size k such that only d entries are set.
  • transmitting the signature involves transmitting to indicate which signature entries are set.
  • transmitting to indicate which signature entries are set involves transmitting noise to indicate which signature entries are set, and in some embodiments noise is transmitted in the time slot, sub-channel blocks that represent signature entries that are set.
  • transmitting noise to indicate which signature entries are set involves not transmitting any signal in the time slot, sub-channel blocks that represent signature entries that are not set. Furthermore, in some embodiments, during the neighbor discovery signaling time, the node transmits noise over one or more pilots.
  • a node apparatus is also provided.
  • the node being configured to communicate with other devices in the system and being operative to transmit a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur.
  • the node is also operative to then receive, during the neighbor discovery signaling time, signaling indicating a signature of at least one neighbor node.
  • this node apparatus is modified. Examples of such embodiments can be found described above with respect to the first method.
  • a node apparatus is also provided.
  • the node being configured to communicate with other devices in the system and being operative to receive a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur.
  • the node is also operative to then transmit, during the neighbor discovery signaling time, a signature identifying itself.
  • This node apparatus is modified. Examples of such embodiments can be found described above with respect to the second method.
  • FIGs. 1-3 are referenced in an attempt to illustrate some examples of specific neighbor detection embodiments.
  • the node detection methodology is implemented using an orthogonal frequency-division multiplexing (OFDM) based IEEE 802.11 protocol (such as IEEE 802.11- a/g/n). It is contemplated that in some embodiments, the node detection methodology will be applied in a system using a combination of cellular link resources and 802.11 interfaces.
  • OFDM orthogonal frequency-division multiplexing
  • Wi-Fi cell IEEE 802.11 transmission range
  • Wi-Fi network that contains mobile nodes that may or may not support the neighbor detection methodology described herein.
  • the nodes that do not support this methodology cannot infer their presence and are ignored for the purpose of the present discussion.
  • mobile nodes do not send their identities over the air interface; therefore, an assumption is made that mobile nodes either have a list of all node identities that may be located in their vicinity and support the neighbor detection methodology described herein or that mobile nodes are connected (via an AP or any other air interface) to a server that has this information.
  • Various embodiments of our neighbor detection methodology utilize a condensed sensing approach. See Kodialam, et al., "Identifying RFID tag categories in linear time," in WiOpt, 2009. (Referred to herein as [1].) Given a universe of N nodes, assume that at most m nodes are located in the neighborhood of any mobile node or AP. Moreover, assume that every node x is associated with a binary vector Vx of size k such that d bits (entries) are randomly selected to be set to ⁇ ' and the rest are set to ' ⁇ '. The vector Vx of node x is referred to herein as the "signature" of node x.
  • the condensed sensing approach is based on the following property:
  • a node can identify all of the nodes in its neighborhood with probability (1-epsilon) by only knowing all the selected bits by the nodes in its vicinity, if k and d are chosen such that:
  • the method works like a Bloom filter in the sense that, in order to verify if a node is present or not in a vicinity, one needs to query the d bits that the node would have selected had it been present. If all of those slots are 1, then the node is declared to be present. It is noted in [1] that the key difference from Bloom filters is that in Bloom filters the false positive rate of each queried node is epsilon, while in the approach of [1], the false positive rate is epsilon for identifying all m nodes. This approach is more suited to the purpose of neighbor detection, and therefore, will be utilized. A way to implement the condensed sensing approach in OFDM-based, Wi-Fi networks is now described.
  • SI sub-signatures
  • S2 ... Sy
  • each bit may transmit a sub- signature Si with b bits by spreading the sub-signature at the b different sub-channels, such that each bit is mapped to a single sub-channel. If this bit is 1 then node x sends noise on the corresponding sub channel, and if the bit is zero then node x does not transmit any signal.
  • Node w interested in detecting the nodes in its vicinity.
  • Node w selects a time instance tO at which the neighborhood discovery process will start.
  • node w sends several "neighbor discovery" messages (e.g., 101, 102) that indicate the time tO as well as k and d.
  • w jams the channel (103) so no other node transmits at time tO.
  • the time is divided into slots of fixed known duration.
  • every node x in the vicinity of node w (excluding w itself) transmits its sub-signature Si.
  • every node x sends noise on the pilot sub-channels.
  • node w listens to the channel and infers a vector R which represents the aggregated signatures of all the nodes in the vicinity of node w.
  • node w can infer all the nodes in its neighborhood.
  • b 10.
  • the selected entries of the two mobiles are marked with different patterns for the sake of illustration. Moreover, entries that are selected by both mobiles are also indicated.
  • diagram 300 we show that although the number of colliding transmissions is higher than that in diagram 200, every mobile has at least one entry that is not used by any other mobile in the given vicinity. These unique entries are critical to identifying the neighboring mobiles.
  • Diagram 400 of FIG. 4 is a logic flow diagram of functionality performed by a node initiating neighbor discovery
  • diagram 500 of FIG. 5 is a logic flow diagram of functionality performed by a node participating in neighbor discovery.
  • an initiating node e.g., a mobile node or a network transceiver node
  • transmits 401
  • a neighbor discovery message that indicates a time at which neighbor discovery signaling is to occur.
  • a neighbor node receives (501) the neighbor discovery message.
  • the neighbor node transmits (502) a signature identifying itself.
  • the initiating node receives (402) signaling indicating a signature of one or more nodes (for example, the neighboring node's signature).
  • the neighbor discovery message that is transmitted further indicates the size of the signature and/or the number of entries to be set in the signature to be transmitted during the neighbor discovery signaling time.
  • the initiating node transmits one or more additional neighbor discovery messages that indicate the time at which neighbor discovery signaling is to occur, the size of the signature, and/or the number of entries to be set in the signature.
  • the initiating node prior to the time at which neighbor discovery signaling is to occur on a channel, the initiating node jams the channel.
  • the initiating node transmits a neighbor discovery message after jamming the channel and just before the time at which neighbor discovery signaling is to occur.
  • transmitting the signature involves transmitting to indicate which signature entries are set.
  • transmitting to indicate which signature entries are set involves transmitting noise to indicate which signature entries are set, and in some embodiments noise is transmitted in the time slot, sub-channel blocks that represent signature entries that are set.
  • transmitting noise to indicate which signature entries are set involves not transmitting any signal in the time slot, sub-channel blocks that represent signature entries that are not set.
  • the neighbor node transmits noise over one or more pilots.
  • program storage devices e.g., digital data storage media, which are machine or computer readable and encode machine-executable or computer-executable programs of instructions where said instructions perform some or all of the steps of methods described herein.
  • the program storage devices may be, e.g., digital memories, magnetic storage media such as a magnetic disks or tapes, hard drives, or optically readable digital data storage media.
  • the embodiments are also intended to cover computers programmed to perform said steps of methods described herein.
  • the term "comprises,” “comprising,” or any other variation thereof is intended to refer to a non-exclusive inclusion, such that a process, method, article of manufacture, or apparatus that comprises a list of elements does not include only those elements in the list, but may include other elements not expressly listed or inherent to such process, method, article of manufacture, or apparatus.
  • the terms a or an, as used herein, are defined as one or more than one.
  • the term plurality, as used herein, is defined as two or more than two.
  • the term another, as used herein, is defined as at least a second or more.
  • Some, but not all, examples of techniques available for communicating or referencing the object/information being indicated include the conveyance of the object/information being indicated, the conveyance of an identifier of the object/information being indicated, the conveyance of information used to generate the object/information being indicated, the conveyance of some part or portion of the object/information being indicated, the conveyance of some derivation of the object/information being indicated, and the conveyance of some symbol representing the object/information being indicated.

Abstract

La présente invention se rapporte à divers procédés et à divers dispositifs adaptés pour prendre en charge la nécessité d'améliorer la détection de nœuds voisins. Dans un premier procédé selon l'invention, un nœud (par ex., un nœud mobile ou un nœud émetteur-récepteur de réseau) transmet (401) un message de recherche de nœud voisin qui indique une période à laquelle un signal de recherche de nœud voisin doit être transmis. Ensuite, durant la période de transmission du signal de recherche de nœud voisin, le nœud reçoit (402) un signal indiquant une signature d'au moins un nœud voisin. Dans un second procédé selon l'invention, un nœud voisin reçoit (501) un message de recherche de nœud voisin qui indique une période à laquelle un signal de recherche de nœud voisin doit être transmis. Ensuite, durant la période de transmission du signal de recherche de nœud voisin, le nœud voisin reçoit (502) une signature l'identifiant.
PCT/US2011/053706 2010-09-30 2011-09-28 Procédé et appareil de recherche de nœud voisin WO2012044693A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US40427510P 2010-09-30 2010-09-30
US61/404,275 2010-09-30
US13/247,178 US9066195B2 (en) 2011-09-28 2011-09-28 Method and apparatus for neighbor discovery
US13/247,178 2011-09-28

Publications (1)

Publication Number Publication Date
WO2012044693A1 true WO2012044693A1 (fr) 2012-04-05

Family

ID=44913384

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2011/053706 WO2012044693A1 (fr) 2010-09-30 2011-09-28 Procédé et appareil de recherche de nœud voisin

Country Status (1)

Country Link
WO (1) WO2012044693A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104320769A (zh) * 2014-09-05 2015-01-28 总装备部工程设计研究总院 节点数未知单跳网络中基于同步时间片的邻居发现方法
EP2871888A4 (fr) * 2012-07-05 2016-03-09 Lg Electronics Inc Procédé pour transmettre un signal de détection de terminal afin d'établir une communication directe entre des terminaux dans un système de communication sans fil, et son dispositif
CN103384364B (zh) * 2012-05-02 2016-05-11 上海贝尔股份有限公司 配置用于压缩邻居发现的发现周期以及签名序列的方法
EP3381211A4 (fr) * 2016-02-26 2019-07-24 Hewlett-Packard Enterprise Development LP Protection de la confidentialité d'un dispositif

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070211678A1 (en) * 2006-01-11 2007-09-13 Junyi Li Encoding beacon signals to provide identification in peer-to-peer communication
WO2010017414A2 (fr) * 2008-08-06 2010-02-11 Zte U.S.A., Inc. Système et procédé d’identification de femtocellules

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070211678A1 (en) * 2006-01-11 2007-09-13 Junyi Li Encoding beacon signals to provide identification in peer-to-peer communication
WO2010017414A2 (fr) * 2008-08-06 2010-02-11 Zte U.S.A., Inc. Système et procédé d’identification de femtocellules

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
JUN LUO ET AL: "Compressed neighbor discovery for wireless ad hoc networks: The Rayleigh fading case", COMMUNICATION, CONTROL, AND COMPUTING, 2009. ALLERTON 2009. 47TH ANNUAL ALLERTON CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, 30 September 2009 (2009-09-30), pages 308 - 313, XP031616571, ISBN: 978-1-4244-5870-7 *
JUN LUO ET AL: "Neighbor discovery in wireless ad hoc networks based on group testing", COMMUNICATION, CONTROL, AND COMPUTING, 2008 46TH ANNUAL ALLERTON CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, 23 September 2008 (2008-09-23), pages 791 - 797, XP031435234, ISBN: 978-1-4244-2925-7, DOI: 10.1109/ALLERTON.2008.4797638 *
KODIALAM M ET AL: "Identifying RFID tag categories in linear time", 2009 7TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS : (WIOPT 2009) ; SEOUL, KOREA, 23 - 27 JUNE 2009, IEEE, PISCATAWAY, NJ, USA, 23 June 2009 (2009-06-23), pages 1 - 6, XP031573383, ISBN: 978-1-4244-4919-4 *
NATKANIEC M ET AL: "PUMA - a new channel access protocol for wireless LANs", WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS, 2002. THE 5TH INTERNATION AL SYMPOSIUM ON OCT. 27-30, 2002, PISCATAWAY, NJ, USA,IEEE, vol. 3, 27 October 2002 (2002-10-27), pages 1351 - 1355, XP010619314, ISBN: 978-0-7803-7442-3 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103384364B (zh) * 2012-05-02 2016-05-11 上海贝尔股份有限公司 配置用于压缩邻居发现的发现周期以及签名序列的方法
EP2871888A4 (fr) * 2012-07-05 2016-03-09 Lg Electronics Inc Procédé pour transmettre un signal de détection de terminal afin d'établir une communication directe entre des terminaux dans un système de communication sans fil, et son dispositif
CN104320769A (zh) * 2014-09-05 2015-01-28 总装备部工程设计研究总院 节点数未知单跳网络中基于同步时间片的邻居发现方法
EP3381211A4 (fr) * 2016-02-26 2019-07-24 Hewlett-Packard Enterprise Development LP Protection de la confidentialité d'un dispositif
US10587360B2 (en) 2016-02-26 2020-03-10 Hewlett Packard Enterprise Development Lp Device privacy protection

Similar Documents

Publication Publication Date Title
US10873972B2 (en) Method and equipment for channel sensing and signal transmission
US8027288B2 (en) Reducing beacon slot acquisition time in distributed media access control network
TWI430604B (zh) 在多載波系統中配置無線電資源之方法、使用者設備及基地台
CN103428817B (zh) 基于lte蜂窝通信系统的d2d设备发现方法及装置
WO2017076344A1 (fr) Procédé et dispositif de détection d'évaluation de canal libre
KR101754074B1 (ko) 피어-투-피어 네트워크에서 리소스 충돌의 검출 및 해결을 위한 방법 및 장치
WO2018028475A1 (fr) Procédé et appareil de sélection de ressources de communication v2x
JP6350836B2 (ja) 情報伝送方法、基地局、およびユーザ機器
JP2017533679A (ja) 無認可スペクトル上におけるセル検出、同期化及び測定のための方法及び装置
US20110206000A1 (en) Method for random access to uplink in multi-carrier aggregation environment
CN105684540A (zh) 用于高效无线网络中的改进的通信效率的系统和方法
CN108207029B (zh) 一种ue、基站中的方法和设备
WO2011097998A1 (fr) Procédé, système et dispositif pour la programmation d'un accès aléatoire non concurrentiel et pour la transmission d'un préambule
WO2016050196A2 (fr) Station de base pour une transmission laa dans des communications cellulaires, procédé et dispositif pour un équipement d'utilisateur
WO2019154006A1 (fr) Procédé de traitement de signal de mesure d'interférence à distance, station de base et support de stockage
WO2018177332A1 (fr) Procédé de détection de transmission en liaison descendante, station de base et terminal
WO2016062138A1 (fr) Appareil et procédé pour la découverte de dispositif dans des communications de dispositif à dispositif
WO2016004560A1 (fr) Procédé et dispositif de transmission de données
CN105101392A (zh) 用于d2d系统中的sa信息传输的方法和装置
CN105684339A (zh) 增强型子信道选择性传输规程
JP6321815B2 (ja) 情報を送信するための方法および装置、ならびに情報を受信するための方法および装置
WO2012044693A1 (fr) Procédé et appareil de recherche de nœud voisin
WO2017020761A1 (fr) Procédé et dispositif d'envoi et de réception de données
WO2018028675A1 (fr) Procédé, appareil, dispositif, système et support de stockage de configuration de signal d'accès aléatoire
US9066195B2 (en) Method and apparatus for neighbor discovery

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: 11779892

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: 11779892

Country of ref document: EP

Kind code of ref document: A1