[go: up one dir, main page]

WO2015051495A1 - Appareil et procédé de recherche de dispositif - Google Patents

Appareil et procédé de recherche de dispositif Download PDF

Info

Publication number
WO2015051495A1
WO2015051495A1 PCT/CN2013/084842 CN2013084842W WO2015051495A1 WO 2015051495 A1 WO2015051495 A1 WO 2015051495A1 CN 2013084842 W CN2013084842 W CN 2013084842W WO 2015051495 A1 WO2015051495 A1 WO 2015051495A1
Authority
WO
WIPO (PCT)
Prior art keywords
application
list
applications
user equipment
computer program
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/CN2013/084842
Other languages
English (en)
Inventor
Zhi Zhang
Yixue Lei
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.)
Nokia China Investment Co Ltd
Nokia Technologies Oy
Original Assignee
Nokia China Investment Co Ltd
Nokia Technologies Oy
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 Nokia China Investment Co Ltd, Nokia Technologies Oy filed Critical Nokia China Investment Co Ltd
Priority to PCT/CN2013/084842 priority Critical patent/WO2015051495A1/fr
Publication of WO2015051495A1 publication Critical patent/WO2015051495A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H04W76/14—Direct-mode setup

Definitions

  • LTE Long term evolution
  • UMTS Universal Mobile telecommunications system
  • 3GPP 3 rd generation partnership project
  • GSM global system for mobile
  • HSPA high speed packet access
  • WiMAX worldwide interoperability for microwave access
  • LTE-A LTE- Advanced
  • LTE-A A goal of LTE-A is to provide significantly enhanced services by means of higher data rates and lower latency with reduced cost.
  • LTE-A is directed toward extending and optimizing the current 3 GPP LTE radio access technologies to provide higher data rates at very low cost.
  • LTE-A will be a more optimized radio system fulfilling the International Telecommunication Union Radio-communication sector, ITU-R, requirements for international mobile telecommunications - advanced, IMT-A, while maintaining backward compatibility with the current LTE release.
  • ITU-R International Telecommunication Union Radio-communication sector
  • IMT-A requirements for international mobile telecommunications - advanced
  • Heterogeneous networks in LTE and LTE-A exemplify such integration.
  • Heterogeneous network can include, for example, a deployment of macros, micros, picos, femtos and relays in the same spectrum.
  • One step further is to allow direct communication between devices operating in the cellular system when communicating devices are close to each other to use radio resources in the most efficient manner.
  • a method comprising obtaining a list of applications discoverable by a peer entity; determining whether or not an application in the list has demand to be discovered; generating an application sequence based on the determined information; and including the application sequence as a part of a discovery signal.
  • an apparatus comprising at least one processor, and at least one memory including computer program code, wherein the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to obtain a list of applications discoverable by a peer entity; determine whether or not an application in the list has demand to be discovered; generate an application sequence based on the determined information; and include the application sequence as a part of a discovery signal.
  • a computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer, the computer program code may include code for obtaining a list of applications discoverable by a peer entity; determining whether or not an application in the list has demand to be discovered; generating an application sequence based on the determined information; and including the application sequence as a part of a discovery signal.
  • an apparatus comprising means for obtaining a list of applications discoverable by a peer entity; means for determining whether or not an application in the list has demand to be discovered; means for generating an application sequence based on the determined information; and means for including the application sequence as a part of a discovery signal.
  • a method comprising configuring a list of applications for a first user equipment; transmitting the list of applications to the first user equipment; receiving a request from a second user equipment to inquire information regarding an application mapping table of the first user equipment; and forwarding the information regarding the application mapping table of the first user equipment to the second user equipment.
  • an apparatus comprising at least one processor, and at least one memory including computer program code, wherein the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to configure a list of applications for a first user equipment; transmit the list of applications to the first user equipment; receive a request from a second user equipment to inquire information regarding an application mapping table of the first user equipment; and forward the information regarding the application mapping table of the first user equipment to the second user equipment.
  • a computer program product comprising a computer-readable medium bearing computer program code embodied therein for use with a computer, the computer program code may include code for configuring a list of applications for a first user equipment; transmitting the list of applications to the first user equipment; receiving a request from a second user equipment to inquire information regarding an application mapping table of the first user equipment; and forwarding the information regarding the application mapping table of the first user equipment to the second user equipment.
  • an apparatus comprising means for for configuring a list of applications for a first user equipment; means for transmitting the list of applications to the first user equipment; means for receiving a request from a second user equipment to inquire information regarding an application mapping table of the first user equipment; and means for forwarding the information regarding the application mapping table of the first user equipment to the second user equipment.
  • Figure 1 illustrates an example wireless system 100 as described in some example embodiments which implement device-to-device, D2D, technology;
  • Figure 2 illustrates an example of composite discovery signal structure as described in an example embodiment
  • Figure 3 illustrates an example of application sequence carrying information about an application mapping table as described in an example embodiment
  • Figure 4 illustrates a flow diagram of generating a discovery signal including an application sequence as described in an example embodiment
  • Figure 5 illustrates a flow diagram of a procedure performed by a discovering user equipment, UE, as described in an example embodiment
  • Figure 6 illustrates a flow diagram of a procedure performed by a network element as described in an example embodiment
  • Figure 7 illustrates a simplified block diagram of various example apparatuses that are suitable for use in practicing various described example embodiments.
  • FIG. 1 illustrates an example of a wireless system 100 implemented using the device-to-device, D2D, technology of the following example embodiments.
  • the example wireless system 100 comprises a network element, NE, such as for example, a 3 rd generation partnership project, 3GPP, macro cell evolved NodeB, eNB, 101 connecting to a core network that is not shown for brevity.
  • the NE 101 serves three user equipments, UEs 102, 104 and 106 via a communication path 103, 105, and 107, respectively.
  • the UEs 102 and 104 When the UEs 102 and 104 are being moved to be in close proximity to each other, for the sake of power saving, cost saving, and/or offloading of the core network etc., it may be necessary to put them into a D2D communication mode via a D2D communication path 109, for transporting traffic directly between the two UEs.
  • a D2D communication path 109 For transporting traffic directly between the two UEs.
  • the permission of discovery can be "per-application basis", i.e., a user may just want to be discovered by a specific peer user on a specific application.
  • the application layer based discovery signal design can provide higher granularity of proximity services, ProSe, discovery control at per-UE plus per-application level to support restricted discovery. If the physical layer discovery signal is designed independent of the application layer, a discovering UE needs to inquire the network about on which application the peer UE can be discovered and what is the corresponding permission of the discovery because different applications may have different requirements on the permission of discovery.
  • a user may be open for discovery on one application but is restricted for discovery on another application. This will further involve the procedures that the network will inquire the UE being discovered about which application(s) triggers the discovery signal.
  • the physical layer discovery signal includes the application layer information, a UE may send multiple discovery signals on the physical layer, which brings much radio resource waste from physical layer perspective.
  • Figure 2 illustrates an example of composite discovery signal structure as described in an example embodiment.
  • a composite discovery signal 200 in one discovery cycle transmitted between peer UEs may comprise a discovery sequence 201 , a discovery message 202, and an application sequence 203.
  • the discovery sequence 201 is for proximity detection and the discovery message 202 may carry discovery related information such as UE identity.
  • the application sequence 203 may carry information regarding an application mapping table, such as for example, a bit table.
  • Figure 3 illustrates an example of application sequence carrying information about an application mapping table as described in an example embodiment.
  • the first bit of the bit table indicates whether the mapping relation of the table is updated or not.
  • Each of the rest bits of the bit table has a one to one mapping to different applications.
  • the bit for the corresponding application indicates whether the application has a discovery demand or not.
  • the mapping relation between the bits and the applications may be UE specific and semi-statically configured by the network. For example, the UE may receive a list of applications from the network, which can be the candidates to be discovered by a peer UE.
  • the applications in the list can be discoverable by the peer UE.
  • the UE can generate the application mapping table based at least in part on the received list of applications.
  • the list of applications itself can be an application mapping table.
  • the network When the network reconfigures or updates the list of the application so the mapping relation between bits and applications changes, the UE may obtain an updated list from the network.
  • the network when a UE moves to a new area, such as for example, a new tracking area or a D2D registration area, the network needs to update all D2D related information including D2D application mapping table and UE identity used in discovery procedure.
  • the application mapping table may be changed when the user opens/closes/activates applications which may trigger D2D discovery signal, or when there is a change for active applications.
  • the first bit of the bit table carried in the discovery signal can be set to indicate the update of the mapping relation. Accordingly, the discovering UE may determine based on the received first bit whether it needs to inquire the network to update the mapping relation for the peer UE that transmitted the discovery signal.
  • the discovering UE may miss an earlier discovery message and therefore also miss the update indicator. Hence, it may further lead to mis-understanding of the table by the discovering UE.
  • the UE being discovered can utilize a version number for the application mapping table. For example, the first two or three bits in the bit table of Figure 3 may indicate the version number.
  • the version number may be carried by the discovery message 202 of Figure 2.
  • the discovering UE detects a different version number, it may inquire the network for the new table.
  • the network may configure the list of applications, therefore, the mapping table, independently for different UEs. This may give the network the flexibility to configure the mapping according to applications status of different UEs.
  • the network may apply same configuration for a group of UEs. This may be useful for the scenario where proximity D2D UEs form a D2D group with similar application layer requirement. With same configuration, UEs in the D2D group does not need to inquiry network about the mapping table many times whenever it discovers other UE's application sequence in the group.
  • the UE can indicate this type of high priority services by utilizing a specific discovery sequence to represent the high priority applications on the discovered UE level. If discovering UE detects such a discovery sequence, it will use pre-defined mapping relation to interpret the bit-table carried by the application sequence. In that case, the first bit in the bit table conveyed by the application sequence may also be used to indicate an application.
  • the application sequence 203 may be selected from a set of sequence, such as for example, a set of orthogonal sequences, based on the bit table. For example, if the bit table has a length of 6 bits, a set of 64 sequences can be used.
  • FIG. 4 illustrates a flow diagram of generating a discovery signal including an application sequence as described in an example embodiment.
  • a UE such as for example, the UE 102 or 104 of Figure 1 , wants to establish a D2D communication with a nearby peer UE and needs to send a discovery signal.
  • the UE may obtain a list of applications discoverable by the peer UE.
  • the list of application may be received from a network element or/and stored in the local storage of the UE.
  • the UE determines which application in the list has demand to be discovered. Accordingly, the UE generates an application sequence based on the determined information at 403.
  • the application sequence carries a bit table that is obtained at least in part based on the list of applications.
  • the individual bit of the bit table indicates whether the corresponding application wants to be discovered.
  • the UE includes the application sequence as a part of a discovery signal.
  • Figure 5 illustrates a flow diagram of a procedure performed by a discovering
  • a UE such as for example, the UE 102 or 104 of Figure 1 , wants to establish a D2D communication with its nearby peer UE and needs to receive a discovery signal from the peer UE.
  • the UE may obtain information regarding an application mapping table of the peer UE from the network.
  • the UE may receive the discovery signal from the peer UE that includes an application sequence.
  • the application sequence carries a bit table whose individual bit indicates whether the corresponding application of the peer UE wants to be discovered.
  • the UE may detect an indicator from the received discovery signal and check at 504 whether the indicator shows that the information regarding the application mapping table of the peer UE has been updated.
  • the UE performs the procedure at 506. Otherwise, the UE may communicate the network to update the information at 505. At 506, based on the (updated) information regarding the application mapping table of the peer UE and the received application sequence, the UE may determine which application of the peer UE can be discovered.
  • Figure 6 illustrates a flow diagram of a procedure performed by a network element as described in an example embodiment.
  • a network element such as for example, the NE 101 of Figure 1
  • the applications in the list can be discoverable by a second UE, such as for example, the UE 104 of Figure 1.
  • the NE may transmit the list of applications to the first UE.
  • the NE may receive a request from the second UE at 603, which intends to establish a D2D connection with the first UE.
  • the request conveys an inquiry about the information regarding an application mapping table of the first UE.
  • the application mapping table is associated with the list of applications.
  • the NE may forward information regarding the application mapping table of the first UE to the second UE at 604.
  • a network element 701 is adapted for communication with a UE 71 1.
  • the UE 71 1 may be in vicinity of another UE, which is not shown in Figure 7 for simplicity, and can enter a D2D mode with the other UE.
  • the UE 71 1 includes at least one processor 715, at least one memory (MEM) 714 coupled to the at least one processor 715, and a suitable transceiver (TRANS) 713 (having a transmitter (TX) and a receiver (RX)) coupled to the at least one processor 715.
  • the at least one MEM 714 stores a program (PROG) 712.
  • the TRANS 713 is for bidirectional wireless communications with the NE 701.
  • the NE 701 includes at least one processor 705, at least one memory (MEM) 704 coupled to the at least one processor 705, and a suitable transceiver (TRANS) 703 (having a transmitter (TX) and a receiver (RX)) coupled to the at least one processor 705.
  • the at least one MEM 704 stores a program (PROG) 702.
  • the TRANS 703 is for bidirectional wireless communications with the UE 71 1.
  • the NE 701 is coupled to one or more external networks or systems, which is not shown in this figure.
  • the NE 701 may further include a D2D control unit 706.
  • the unit 706, together with the at least one processor 705 and the PROG 702, may be utilized by the NE 701 in conjunction with various example embodiments of this invention, as described herein, such as for example, the procedure illustrated in Figure 6.
  • the UE 71 1 may further include a D2D communication unit 716.
  • the unit 716, together with the at least one processor 715 and the PROG 712, may be utilized by the UE 71 1 in conjunction with various example embodiments of this invention, as described herein, such as for example, the procedure illustrated in Figure 4 or/and the procedure illustrated in Figure 5.
  • At least one of the PROGs 702 and 712 is assumed to include program instructions that, when executed by the associated processor, enable the electronic apparatus to operate in accordance with the example embodiments of this disclosure, as discussed herein.
  • the various example embodiments of the apparatus 71 1 can include, but are not limited to, cellular phones, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, image capture devices such as digital cameras having wireless communication capabilities, gaming devices having wireless communication capabilities, music storage and playback appliances having wireless communication capabilities, Internet appliances permitting wireless Internet access and browsing, as well as portable units or terminals that incorporate combinations of such functions.
  • PDAs personal digital assistants
  • portable computers having wireless communication capabilities
  • image capture devices such as digital cameras having wireless communication capabilities
  • gaming devices having wireless communication capabilities
  • music storage and playback appliances having wireless communication capabilities
  • Internet appliances permitting wireless Internet access and browsing, as well as portable units or terminals that incorporate combinations of such functions.
  • the example embodiments of this disclosure may be implemented by computer software or computer program code executable by one or more of the processors 705, 715 of the NE 701 and the UE 71 1 , or by hardware, or by a combination of software and hardware.
  • the MEMs 704 and 714 may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor-based memory devices, flash memory, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory, as non-limiting examples.
  • the processors 705 and 715 may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on multi-core processor architecture, as non-limiting examples.
  • a technical effect of one or more of the example embodiments disclosed herein may be balancing different requirements between application layer and physical layer, in the sense that dynamic requirements may be expected from application layer, while semi-static design is more suitable for physical layer.
  • the using of application sequence helps to minimize the waste of resource and simplify the signaling design.
  • the configurable application mapping table provides network the flexibility to facilitate various requirements on the applications from different UEs.
  • Embodiments of the present invention may be implemented in software, hardware, application logic or a combination of software, hardware and application logic.
  • the software, application logic and/or hardware may reside on an apparatus such as a user equipment, a NodeB or other mobile communication devices. If desired, part of the software, application logic and/or hardware may reside on an eNodeB/base station 701 , part of the software, application logic and/or hardware may reside on a UE 71 1 , and part of the software, application logic and/or hardware may reside on other chipset or integrated circuit.
  • the application logic, software or an instruction set is maintained on any one of various conventional computer-readable media.
  • a "computer- readable medium” may be any media or means that can contain, store, communicate, propagate or transport the instructions for use by or in connection with an instruction execution system, apparatus, or device.
  • a computer-readable medium may comprise a computer-readable storage medium that may be any media or means that can contain or store the instructions for use by or in connection with an instruction execution system, apparatus, or device.

Landscapes

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

Abstract

Selon un mode de réalisation de la présente invention, un procédé peut consister à : obtenir une liste d'applications pouvant être recherchées par une entité homologue; déterminer si une application de la liste fait l'objet d'une demande de recherche, ou non; générer une séquence d'application d'après les informations déterminées; et inclure la séquence d'application dans un signal de recherche.
PCT/CN2013/084842 2013-10-08 2013-10-08 Appareil et procédé de recherche de dispositif Ceased WO2015051495A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2013/084842 WO2015051495A1 (fr) 2013-10-08 2013-10-08 Appareil et procédé de recherche de dispositif

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2013/084842 WO2015051495A1 (fr) 2013-10-08 2013-10-08 Appareil et procédé de recherche de dispositif

Publications (1)

Publication Number Publication Date
WO2015051495A1 true WO2015051495A1 (fr) 2015-04-16

Family

ID=52812421

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/084842 Ceased WO2015051495A1 (fr) 2013-10-08 2013-10-08 Appareil et procédé de recherche de dispositif

Country Status (1)

Country Link
WO (1) WO2015051495A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040088369A1 (en) * 2002-10-31 2004-05-06 Yeager William J. Peer trust evaluation using mobile agents in peer-to-peer networks
US20130083779A1 (en) * 2011-09-30 2013-04-04 Electronics And Telecommunications Research Institute Method for device-to-device communication based on cellular telecommunication system
WO2013048296A1 (fr) * 2011-09-30 2013-04-04 Telefonaktiebolaget L M Ericsson (Publ) Procédé et système de gestion de communication d2d (device-to-device) au sein d'un réseau de communication sans fil
US20130204962A1 (en) * 2012-02-02 2013-08-08 Texas Instruments Incorporated Network and peripheral interface circuits, systems and processes

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040088369A1 (en) * 2002-10-31 2004-05-06 Yeager William J. Peer trust evaluation using mobile agents in peer-to-peer networks
US20130083779A1 (en) * 2011-09-30 2013-04-04 Electronics And Telecommunications Research Institute Method for device-to-device communication based on cellular telecommunication system
WO2013048296A1 (fr) * 2011-09-30 2013-04-04 Telefonaktiebolaget L M Ericsson (Publ) Procédé et système de gestion de communication d2d (device-to-device) au sein d'un réseau de communication sans fil
US20130204962A1 (en) * 2012-02-02 2013-08-08 Texas Instruments Incorporated Network and peripheral interface circuits, systems and processes

Similar Documents

Publication Publication Date Title
JP7662755B2 (ja) スライス可用性に基づく周波数又は無線アクセス技術（ｒａｔ）選択
CN111183686B (zh) 用于rat间tdoa中的参考确定的方法
US9468032B2 (en) Inter-device session connectivity enhancement
US11102776B2 (en) Apparatuses for selecting communication beams based on normalized time of arrival (ToA) of reference signals
TW202127942A (zh) 用於頻寬限制之無線裝置之控制資源
CN112823564B (zh) 提供动态nef隧道分配的方法和相关的网络节点
CN110557846B (zh) 一种数据传输方法、终端设备及网络设备
WO2022171051A1 (fr) Procédé et dispositif de communication
US20110264780A1 (en) Access network discovery
CN112840592A (zh) 多符号srs的低开销非周期性触发
RU2760907C1 (ru) Объявление расширяемых наборов возможных свойств для оборудования пользователя (ue)
CN111165022B (zh) 编码plmn的方法、解码plmn的方法及其设备
CN110366112A (zh) 一种定位方法及相关设备
JP7376725B2 (ja) Ｎｅ－ｄｃのためのｕｅケイパビリティ協調
JPWO2014188957A1 (ja) 通信端末、基地局装置およびサーバ装置
CN109151955B (zh) 一种通信方法及设备
CN115669079A (zh) 用于请求5g时间参考的按需过程
WO2022270386A1 (fr) Procédé de premier appareil à fonction de gestion d'accès et de mobilité (amf), procédé d'équipement utilisateur (ue), premier appareil à fonction de gestion d'accès et de mobilité (amf) et équipement utilisateur (ue)
CN116018825A (zh) 用于发现和选择本地nef的方法和装置
CN111869154B (zh) 用于从无线设备向网络传输数据的方法和装置
CN115702559A (zh) 使用重叠资源提供下行链路控制信息和下行链路数据的方法以及相关通信设备和无线电接入网络节点
ES3039511T3 (en) Method and apparatus for controlling a user device in a network
CN115699822B (zh) 无线通信系统中用于支持系统间移动性的方法和装置
US20160073398A1 (en) Methods and apparatus for paging performance improvement using timing information update in multi-sim-multi-standby user equipment
US20240340780A1 (en) Communication method and apparatus

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

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

Country of ref document: EP

Kind code of ref document: A1