Method and apparatus for end node assisted neighbor discovery
Abstract
This record has no abstract on file.
Term
0.2 yearsto projected expiry
Projected expiry 20 December 2026, counted from filing; an application has no term until it is granted.
- Priority
- Filed
- Published
- Today
- Projected expiry
1 claim: 1 independent, 0 dependent
- 1Zastrzeżenia patentowe 1. Sposób działania terminala bezprzewodowego (810), polegający na:odbieraniu sygnału z pierwszego węzła dostępowego (840) wskazującego, że informacja o trasowaniu jest niedostępna dla wspomnianego pierwszego węzła dostępowego (840) dla trasowania pierwszej wiadomości z wykorzystaniem identyfikatora miejsca przeznaczenia zawartego we wspomnianych pierwszych wiadomościach;i transmitowaniu powiadomienia o sąsiedzie do drugiego węzła dostępowego (850) odpowiadającego wspomnianemu identyfikatorowi miejsca przeznaczenia, przy czym wspomniane powiadomienie o sąsiedzie zawiera informację o identyfikacji odpowiadającą wspomnianemu pierwszemu węzłowi dostępowemu (840). 2. Sposób według zastrzeżenia 1, dodatkowo zawierający: przed odebraniem wspomnianego sygnału z pierwszego węzła dostępowego (840), transmitowanie wspomnianej pierwszej wiadomości do pierwszego węzła dostępowego 53/51P26622PL00 EP 1 964 339 B1 (840) za pomocą bezprzewodowego łącza komunikacyjnego. 3. Sposób według zastrzeżenia 2, dodatkowo zawierający: po odebraniu wspomnianego sygnału i przed transmitowaniem wspomnianej wiadomości powiadomienia o są siedzie, ustanowienie wspomnianego bezprzewodowego łącza komunikacyjnego ze wspomnianym drugim węzłem dostępowym (850). 4. Sposób według zastrzeżenia 3, dodatkowo zawierający: po transmitowaniu wspomnianej wiadomości powiadomienia o sąsiedzie, transmitowanie drugiej wiadomości do wspomnianego pierwszego węzła dostępowego (840), przy czym druga wiadomość zawiera wspomniany identyfikator miejsca przeznaczenia. 5. Sposób według zastrzeżenia 4, dodatkowo zawierający: odbieranie odpowiedzi na wspomnianą drugą wiadomość ze wspomnianego drugiego węzła dostępowego (850). 6. Sposób według zastrzeżenia 2, w którym wspomniany identyfikator miejsca przeznaczenia jest identyfikatorem fizycznego punktu przyłączenia, który identyfikuje fizyczny punkt przyłączenia we wspomnianym drugim węźle dostępowym (850). 7. Sposób według zastrzeżenia 6, w którym wspomniana informacja o identyfikacji odpowiadająca pierwszemu węzłowi dostępowego (840) zawiera co najmniej jedną pozycję spośród: i) identyfikator fizycznego punktu 53/51P26622PL00 EP 1 964 339 B1 przyłączenia odpowiadający pierwszemu węzłowi dostępowemu (840), ii) identyfikator punktu przyłączenia warstwy łącza odpowiadający pierwszemu węzłowi dostępowemu (840);oraz iii) adres IP warstwy sieciowej odpowiadający pierwszemu węzłowi dostępowemu (840). 8. Sposób według zastrzeżenia 7, w którym transmitowanie wspomnianej wiadomości powiadomienia o sąsiedzie zawiera transmitowanie wspomnianych wiadomości powiadomienia o sąsiedzie przez wspomniany pierwszy węzeł dostępowy (840) do wspomnianego drugiego (850);i w którym wspomniana wiadomość powiadomienia o są siedzie zawiera co najmniej jedną pozycję spośród i) identyfikator punktu przyłączenia warstwy łącza odpowiadający wspomnianemu drugiemu węzłowi dostępowemu (850) oraz ii) adres IP warstwy sieciowej odpowiadający drugiemu węzłowi dostępowemu (850). 9. Sposób według zastrzeżenia 6, w którym wspomniany fizyczny punkt przyłączenia jest punktem przyłączenia łącza bezprzewodowego. 10. Sposób według zastrzeżenia 9, w którym wspomniany identyfikator fizycznego punktu przyłączenia zawiera co najmniej dwie pozycje spośród: identyfikator komórki, identyfikator nośnej i identyfikator sektora. 11. Sposób według zastrzeżenia 2, w którym wspomniany identyfikator miejsca przeznaczenia jest identyfikatorem warstwy łącza, który identyfikuje punkt przyłączenia warstwy łącza we wspomnianym drugim węźle dostępowym (850). 53/51P26622PL00 EP 1 964 339 B1 12. Sposób według zastrzeżenia 11, w którym wspomniana informacja o identyfikacji odpowiadająca pierwszemu węzłowi dostępowemu (840) zawiera co najmniej jedną pozycję spośród: i) identyfikator fizycznego punktu przyłączenia odpowiadający pierwszemu węzłowi dostępowemu (840), ii) identyfikator punktu przyłączenia warstwy łącza odpowiadający pierwszemu węzłowi dostępowemu (840);oraz iii) adres IP warstwy sieciowej odpowiadający pierwszemu węzłowi dostępowemu (840). 13. Sposób według zastrzeżenia 12, w którym transmitowanie wspomnianej wiadomości powiadomienia o sąsiedzie zawiera transmitowanie wspomnianej wiadomości powiadomienia o sąsiedzie przez wspomniany pierwszy węzeł dostępowy (840) do wspomnianego drugiego (850);i w którym wspomniana wiadomość powiadomienia o są siedzie zawiera co najmniej jedną pozycję spośród i) identyfikator punktu przyłączenia warstwy łącza odpowiadający wspomnianemu drugiemu węzłowi dostępowemu (850) i ii) adres IP warstwy sieciowej odpowiadający drugiemu węzłowi dostępowemu (850). 14. Urządzenie terminala bezprzewodowego zawierające: środki do odbierania sygnału z pierwszego węzła dostępowego (840) wskazujące, że informacja o trasowaniu jest niedostępna dla wspomnianego pierwszego węzła dostępowego (840) dla trasowania pierwszej wiadomości z wykorzystaniem identyfikatora miejsca przeznaczenia zawartego we wspomnianej pierwszej wiadomości;i środki do transmitowania powiadomienia o sąsiedzie do drugiego węzła dostępowego (850) odpowiadającego wspomnianemu identyfikatorowi miejsca przeznaczenia, 53/51P26622PL00 EP 1 964 339 B1 przy czym wspomniane powiadomienie o sąsiedzie zawiera informację o identyfikacji odpowiadającą wspomnianemu pierwszemu węzłowi dostępowemu (840). 15. Urządzenie według zastrzeżenia 14, w którym środki do transmitowania są dodatkowo skonfigurowane do, przed odebraniem wspomnianego sygnału z pierwszego węzła dostępowego (840), transmitowania wspomnianej pierwszej wiadomości do pierwszego węzła dostępowego (840) za pomocą bezprzewodowego łącza komunikacyjnego. 16. Urządzenie według zastrzeżenia 15, dodatkowo zawierające środki do ustanawiania wspomnianego bezprzewodowego łącza komunikacyjnego ze wspomnianym drugim węzłem dostępowym (850) po odebraniu wspomnianego sygnału i przed transmitowaniem wspomnianej wiadomości powiadomienia o sąsiedzie. 17. Urządzenie według zastrzeżenia 16, w którym środki do transmitowania są dodatkowo skonfigurowane do, po transmitowaniu wspomnianej wiadomości powiadomienia o sąsiedzie, transmitowania drugiej wiadomości do wspomnianego pierwszego węzła dostępowego (840), przy czym druga wiadomość zawiera wspomniany identyfikator miejsca przeznaczenia. 18. Urządzenie według zastrzeżenia 17, w którym środki do odbierania są dodatkowo skonfigurowane do odbierania odpowiedzi na wspomnianą drugą wiadomość ze wspomnianego drugiego węzła dostępowego (850). 19. Urządzenie według zastrzeżenia 15, w którym wspomniany identyfikator miejsca przeznaczenia jest identyfikatorem fizycznego punktu przyłączenia, który jest skonfigurowany 53/51P26622PL00 EP 1 964 339 B1 20. 21. 22. 23. do identyfikowania fizycznego punktu przyłączenia we wspomnianym drugim węźle dostępowym (850). Urządzenie według zastrzeżenia 19, w którym wspomniana informacja o identyfikacji odpowiadająca pierwszemu węzłowi dostępowego (840) zawiera co najmniej jedną pozycję spośród: i) identyfikator fizycznego punktu przyłączenia odpowiadający pierwszemu węzłowi dostępowemu (840), ii) identyfikator punktu przyłączenia warstwy łącza odpowiadający pierwszemu węzłowi dostępowemu (840);oraz ii) adres IP warstwy sieciowej odpowiadający pierwszemu węzłowi dostępowemu (840). Urządzenie według zastrzeżenia 20, w którym środki do transmitowania skonfigurowane do transmitowania wspomnianej wiadomości powiadomienia o sąsiedzie są dodatkowo skonfigurowane do transmitowania wspomnianej wiadomości powiadomienia o sąsiedzie przez wspomniany pierwszy węzeł dostępowy (840) do wspomnianego drugiego (850);i w którym wspomniana wiadomość powiadomienia o są siedzie zawiera co najmniej jedną pozycję spośród i) identyfikator punktu przyłączenia warstwy łącza odpowiadający wspomnianemu drugiemu węzłowi dostępowego (850) oraz ii) adres IP warstwy sieciowej odpowiadający drugiemu węzłowi dostępowemu (850). Urządzenie według zastrzeżenia 19, w którym wspomniany fizyczny punkt przyłączenia jest punktem przyłączenia łącza bezprzewodowego. Urządzenie według zastrzeżenia 22, w którym wspomniany identyfikator fizycznego punktu przyłączenia zawiera co 53/51P26622PL00 EP 1 964 339 B1 24. 25. 26. najmniej dwie pozycje spośród: identyfikator komórki, identyfikator nośnej i identyfikator sektora. Urządzenie według zastrzeżenia 15, w którym wspomniany identyfikator miejsca przeznaczenia jest identyfikatorem warstwy łącza, który jest skonfigurowany do identyfikowania punktu przyłączenia warstwy łącza we wspomnianym drugim węźle dostępowym (850). Urządzenie według zastrzeżenia 24, w którym wspomniana informacja o identyfikacji odpowiadająca pierwszemu węzłowi dostępowemu (840) zawiera co najmniej jedną pozycję spośród: i) identyfikator fizycznego punktu przyłączenia odpowiadający pierwszemu węzłowi dostępowemu (840), ii) identyfikator punktu przyłączenia warstwy łącza odpowiadający pierwszemu węzłowi dostępowemu (840);oraz iii) adres IP warstwy sieciowej odpowiadający pierwszemu węzłowi dostępowemu (840). Urządzenie według zastrzeżenia 25, w którym środki do transmitowania wspomnianej wiadomości powiadomienia o sąsiedzie są skonfigurowane do transmitowania wspomnianej wiadomość powiadomienia o sąsiedzie przez wspomniany pierwszy węzeł dostępowy (840) do wspomnianego drugiego (850);i w którym wspomniana wiadomość powiadomienia o są siedzie zawiera co najmniej jedną pozycję spośród i) identyfikator punktu przyłączenia warstwy łącza odpowiadający wspomnianemu drugiemu węzłowi dostępowemu (850) i ii) adres IP warstwy sieciowej odpowiadający drugiemu węzłowi dostępowemu (850). QUALCOMM Incorporated Pełnomocnik: 53/51P26622PL00 EP 1 964 339 B1 WĘZEŁ KOMORKA WĘZEŁ SERWER WĘZEŁ DOSTĘPOWY WĘZEŁ KOŃCOWY N WĘZEŁ KOŃCOWY 1 KOMORKA KOMORKA WĘZEŁ DOSTĘPOWY WĘZEŁ DOSTĘPOWY WĘZEŁ N OŃCOWY Ν (Y WĘZEŁ OŃCOWY 1 WĘZEŁ KOŃCOWY 1 WĘZEŁ OŃCOWY Ν (X, Fig. 1 141' 148 148' 100 102 WĘZEŁ 53/51P26622PL00 EP 1 964 339 B1 53/51P26622PL00 EP 1 964 339 B1 ί;i Ο Ω (J Ο υ Fig. 3 53/51P26622PL00 EP 1 964 339 B1 53/51P26622PL00 EP 1 964 339 B1 Fig. 6 53/51P26622PL00 EP 1 964 339 B1 53/51P26622PL00 EP 1 964 339 B1 53/51P26622PL00 EP 1 964 339 B1 311 TABLICA ROZKŁADU PID/ADRESU WYŻSZEGO POZIOMU FIG. 9
134 paragraphs in 35 sections, as filed
[0001] The invention relates to a communication system and in particular, methods and apparatus for routing messages based on physical layer information in a wireless, e.g. cellular, communication network.
Background of the Invention [0002] The Open System Interconnection (OSI) reference model is useful when explaining various communication and routing operations. The OSI reference model contains 7 layers, with the application layer as the highest and the physical layer as the lowest. The physical layer is the layer that deals with the actual physical connections and attributes of physical connections in the system. Above the physical layer is the Data Link layer, sometimes called the link layer. The link layer (Layer 2 in the OSI model) is sometimes described as a transfer layer that depends on a particular technology. Above the link layer is the network layer (Layer 3 of the OSI model), where network routing and forwarding are supported. The network layer is sometimes called the packet layer. It is on the network layer in which message / packet routing is performed, e.g. on one or more paths. Different addresses can be used to route messages and signals at different levels. For example, a network address such as an IP address can be used to route messages / packets at the network layer level. MAC addresses can be used to control message routing at the link layer level
53 / 51P26622PL00
EP 1 964 339 B1 relates to the actual characteristics of the data device. At the lowest level of the OSI model, the physical layer, one or more physical identifiers have a physical attribute on the source or target.
Understanding the different communication layers and different addressing techniques used for each layer will facilitate the understanding of the present invention.
[0003] Communication systems often include a plurality of network nodes that are connected to access nodes through which end nodes, e.g., mobile devices, are connected to the network. Network nodes can be arranged hierarchically. End nodes usually communicate with access nodes directly through connections that have been established with said access nodes. Such systems usually rely on the existence of a two-way communication link between the access node and an end node so that they do not support two-way communication between the end node and the access node. It should be noted that in such systems, the end node usually does not know the network layer address of the destination access node, but may have information that it may receive through broadcast channels, which may usually contain a physical layer identifier that is not normally used in such systems to route messages. This approach results in forwarding delays and packet losses when the end node is only able to support one single two-way communication link at a time.
[0004] It should therefore be appreciated that there is a need to develop methods and devices that enable an end node that does not have a current uplink communication connection to the destination access node to communicate with said destination access node via another access node with which the end node has a current uplink communication link, even
53 / 51P26622PL00
EP 1 964 339 B1 with an access node. is inefficient when said end node does not know the network address of the destination access node.
[0005] In some systems, end nodes are able to maintain multiple two-way communication links with different access nodes simultaneously. However, such systems typically require that end nodes send messages to the specific access node to which the end node has a connection, through a link that is directly connected to a specific
This approach, in some cases, because links, especially when they are wireless links, tend to fluctuate in quality (e.g. delay and loss characteristics). As a result, the link to the destination access node may not be the best link available to the end node at the time when the message to said destination access node must be sent. Typically, this restriction is resolved by resorting to network layer communication, which can be routed through multiple hops due to the use of network layer addresses (e.g., IP addresses). This approach of using layer address inefficient, especially when the network is also delivering the message must be done using the function of a specific link layer, because network layer messages, in some systems, tend to be much larger than link layer messages. Such inefficient inefficient signaling is not very suitable for communication over radio links with limited resources.
[0006] Access nodes that support geographically neighboring cells usually know each other through manual configuration. During such configuration, various parameters are configured in the access node corresponding to several of its neighbors. This configuration is usually very labor intensive and prone to entering errors not only because of the possible ones
53 / 51P26622PL00
This is due to human errors, but also because the wireless network layout often changes by expanding the network or even due to environmental conditions. This is in particular related to the gradual phased deployment of the wireless communication system. It should therefore be appreciated that there is a need to develop an assisted neighbor search process for the end node so that access nodes can exchange neighbor information in response to signaling of the end node when end nodes move in the system and encounter newly introduced nodes instead of using techniques manual configuration.
[0007] In addition, it should be
US2004 / 0166857, which secure the potential communication node potential communications note the document relates to security mechanisms, the integrity of the search procedure for access in a mobile network
The access node stores information about the access nodes in the mobile network and updates the information only after verifying the information provided by the mobile terminal after transferring from one access node to another access node. Information about potential access nodes in the mobile communication network can also be associated with a particular mobile terminal and stored in the mobile terminal on the list of potential access node.
Summary of the Invention [0008] According to the present invention, there is provided a method of operating a wireless terminal as set forth in claim 1 and a wireless terminal as set forth in claim 14. Further embodiments are claimed in the dependent claims.
53 / 51P26622PL00
[0009] The present invention is intended, inter alia, for a method of using end nodes, e.g. wireless terminals, to detect base stations and to communicate information about detected access nodes, e.g. base stations, to other access nodes in system. Thus, various embodiments of the present invention are intended for methods based on a wireless terminal to support neighbor discovery in a communication system comprising a plurality of access nodes. When the wireless terminal moves in the system and encounters new access nodes, one or more physically adjacent access nodes will be notified of the presence of a new access node as a result of communication with the wireless terminal.
[0010] In some, but not necessarily all implementations, unsuccessful routing, through the access node, messages from the end node to another access node is used to trigger various signals used to provide updated routing information for an access node that is unable to complete the operation routing. In this way, the access node may have updated routing information to include routing information corresponding to the access nodes that the end node encountered but which the access node had not previously been informed of, or which lacked the relevant routing information.
[0011] By automating all or part of the access node detection process, the methods and apparatus of the present invention perform phased distribution of access nodes more easily than in systems where access nodes must be manually programmed and / or operated by providing them information about their neighbors as part of the deployment process new base stations. In addition, because the search for a neighbor and the upgrade process is done with a small one
53 / 51P26622PL00
In particular, or without direct administrator involvement, the methods and apparatus of the present invention are particularly well suited to systems in which the entire network may be beyond the control of a single administrator, and individual entities may freely add access nodes at their discretion. e.g. base stations, without prior notification to other base station administrators that a new base station has been entered into the system.
[0012] The various features of the invention concern the end node methods of receiving signals from the access nodes indicating the error identifier of the access node address distribution and causing said end node to send a neighbor notification message to establish new neighbors of the access node.
[0013] Although some features relate to the wireless terminal method and device as well as new messages stored in the wireless terminal according to the invention, other features relate to the new method and new access node device. The invention also relates to data storage devices, e.g. storage devices, which store one or more new messages according to the present invention.
[0014] Although various embodiments have been discussed in essence, it should be noted that not all embodiments contain the same features and some of the features described above are not necessary but may be desirable in some embodiments. Numerous additional features, embodiments and advantages of the present invention are discussed in the following detailed description.
Short description of the drawings
53 / 51P26622PL00
[0015] Fig. 1 is a network diagram of an exemplary system with the present node, the terminal access node of the communications implemented in accordance with the invention.
[0016] Fig. 2 shows an example implemented in accordance with the present invention.
[0017] Fig. 3 shows an example implemented in accordance with the present invention.
[0018] Fig. 4 shows an example Identifier
Connections implemented in accordance with the present invention.
[0019] Fig. 5 shows an exemplary message using the Connection Identifier of Fig. 4 implemented in accordance with the present invention.
[0020] Fig. 6 shows an exemplary signaling solution performed when an end node maintains a two-way connection to one access node and wants to communicate with another access node.
[0021] Fig. 7 shows an exemplary signaling solution performed when an end node maintains bidirectional connections with multiple access nodes.
[0022] Fig. 8 shows an exemplary signaling carried out in accordance with the present invention when the end node triggers a neighbor search process between two access nodes.
[0023] Fig. 9 is an exemplary PID distribution table to a higher level address that can be used to map a PID to / from corresponding higher level addresses.
DETAILED DESCRIPTION:
[0024] The methods and apparatus of the present invention for routing messages based on physical layer information, e.g., physical layer identifiers, which can be used to support communication sessions from
53 / 51P26622PL00
EP 1 964 339 B1 connected by a multi-access system using communication frequencies with one or more end nodes, e.g. mobile devices. The method and apparatus of the invention can be used in a wide range of communication systems. For example, the invention may be used in systems that support mobile communication devices such as notebooks equipped with modems, PDAs, and many other devices that support wireless interfaces having in the area of interest device mobility.
[0025] Fig. 1 illustrates an exemplary communication system 100 implemented in accordance with the present invention, e.g., a cellular communication network that includes a plurality of nodes with each other through communication links 100 is, e.g., a distributed spectrum orthogonal split multiplexing (OFDM) communication system. Nodes in the exemplary system 100 exchange information using signals, e.g. messages, based on communication protocols, e.g. Internet Protocol (IP). System 100 communication links can be implemented, for example, using wires, optical fibers, and / or wireless communication techniques. Exemplary communication system 100 includes a plurality of end nodes 144, 146, 144 ', 146', 144 ", 146" that have access to the communication system via a plurality of access nodes 140, 140 ', 140 ". End nodes 144, 146, 144 ', 146', 144 ", 146" can be, e.g. wireless communication devices or terminals, and the access nodes 140, 140 ', 140 "can be e.g. base stations. The base stations can be implemented as wireless access routers. The exemplary communication system 100 also includes a number of other nodes 104, 106, 110, used to provide connectivity or to provide specific services or functions. In particular, the exemplary communication system 100 includes
An example of wireless includes and 112, mutual
53 / 51P26622PL00
EP 1 964 339 B1
Server 104, used to support the transfer and storage of state relating to end nodes. Server Node 104 may be, for example, an AAA server, or may be a Context Transfer Server, or it may be a server containing both AAA server functionalities and context transfer server functionalities.
[0026] The exemplary system 100 of Fig. 1 shows a network 102 that includes a Server 104 and a node 106 that are connected to intermediate network node 110 via the corresponding network link 105 and 107, respectively. Intermediate network node 110 in network 102 also provides the possibility of interconnecting network nodes that are external from the perspective of network 102 via network link 111. Network link 111 is connected to another intermediate network node 112 that provides an additional connection option to a plurality of access nodes 140, 140 ', 140 "via network links 141, 141', 141", respectively.
[0027] Each access node 140, 140 ', 140 "is shown to provide the ability to connect to a plurality of N end nodes (144, 146), (144', 146 '), (144", 146 "), respectively, through respective links access (145, 147), (145 ', 147'), (145 ", 147"). In the exemplary communication system 100, each access node 140, 140 ', 140 "is depicted using wireless technology, e.g., wireless access links to provide access. Radio coverage area, e.g. communication cell 148, 148 ', 148 "of each access node, respectively, 140, 140', 140", is represented as a circle surrounding the respective access node.
[0028] The exemplary communication system 100 is then used as a basis to describe various embodiments of the invention. Alternative embodiments of the invention include various network topologies in which the number and type of network nodes, the number and type of access nodes, the number
53 / 51P26622PL00
And the type of terminal nodes, the number and type of Servers and other agents, the number and type of connections, and the possibilities of connection between nodes may differ from the exemplary communication system 100 shown in Fig. 1.
[0029] In various embodiments of the present invention, some of the functional units shown in Fig. 1 may be omitted or combined together. The location or location of these functional units in the network may also change.
[0030] Fig. 2 provides a detailed illustration of an exemplary end node 200, e.g., wireless terminal such as a mobile node, implemented in accordance with the present invention. The exemplary end node 200 shown in Fig. 2 is a detailed representation of a device that can be used as any of the end nodes 144, 146, 144 ', 146', 144 ", 146" shown in Fig. 1. from Fig. 2, the end node 200 includes a processor 204, a wireless communication interface 230, a user input / output interface 240 and a memory 210 connected together. Thus, they can exchange information, signals and data via the end bus 206. Components 204, 206, 210, 230, 240 of the terminal node 200 are located inside the enclosure 202.
[0031] Wireless communication interface 230 provides which internal node components send and receive signals to / from the nodes of the network, e.g.
Wireless communication interface 230 receiver module 232 with the appropriate antenna and transmitter module 234 with the appropriate antenna via bus 206 various components of the node mechanism using the final 200 can external access devices.
includes, e.g., a receiver 236 sender 238 used to connect the end node
200 to other network nodes, e.g. via wireless communication channels. In some embodiments, a module
53 / 51P26622PL00
By means of interface 240 of transmitter device 242, 244, the transmitter 234 includes a transmitter using orthogonal multiplexing frequency distribution; (OFDM).
[0032] An exemplary end node 200 also includes a user input device 242, e.g., a keyboard, and user output device 244, e.g. a display, which are connected to bus 206 behind user input / output. Therefore;
User input / output can exchange information, signals and data with other components of the end node 200 via the user input / output interface 240 and bus 206. The user input / output interface 240 and associated devices 242, 244 provide a mechanism by which the user can control the node the final 200 to accomplish various tasks. In particular, user input device 242 and user output device 244 provide functionality that allows the user to control terminal node 200 and applications, e.g., modules, programs, procedures and / or functions that execute in memory 210 of terminal node 200.
[0033] Processor 204 under the control of various modules, e.g., procedures, contained in memory 210 controls the operation of the end node 200 to perform various signaling and processing as described below. The modules contained in memory 210 are executed at startup or are called by other modules. Modules can, during execution, exchange data and signal y. Module y can also, during execution information, implementation of this section, share data and information. In the example
Fig. 2, the terminal node memory 210 of the invention includes signaling / control module 212 and signaling / control data 214.
[0034] Signaling / control module 212 controls the processing of receiving and sending signals, e.g., messages, for managing state information storage, searching and processing. Signaling / control data 214
53 / 51P26622PL00
EP 1 964 339 B1 includes status information, e.g. parameters, status information and / or other information regarding end node operation.
Signaling / control
In particular, data 214 includes configuration information 216, e.g., information identifying the end node, and operational information 218, e.g., information about the current processing state, status of ongoing responses, etc. Module 212 has access to and / or modifies data 214, e.g. updating the configuration information 216 and / or operational information 218. [0035] Message generation module 251 is responsible for generating messages for various operations of the end node 200. The neighbor notification message 280 and the signaling message 281 are exemplary messages generated in accordance with this invention.
[0036] Link selection module 213 is responsible for selecting a link, e.g., the best link, from a plurality of links available to end node 200 for transmission of the next message ready to be transmitted via end node 200. The link selection algorithm is based on various link quality parameters including at least some but not limited to: link delays, link channel conditions, link error rate, and link transmission power requirements.
[0037] The identifier (PID) determining module 270 of the physical layer attachment point is responsible for determining the PID identifier corresponding to the transmitted signals received from the access node. The PID identifier module 270 includes a cell identification module 271, a carrier identification module 272, and a sector identification module 273. In some, but not all embodiments, the combination of cell identifier, carrier identifier, and sector identifier are used as physical attachment point identifiers. Each of these identifier elements has a corresponding layer identification information
53 / 51P26622PL00
EP 1 964 339 B1. For example, the cell identifier identifies a physical cell or cell type. The carrier identifier identifies the physical carrier, i.e. carrier frequency or tone block, while the sector identifier identifies the sector in the respective cell. Not all of this information needs to be used to implement the PID and a specific PID element may vary depending on the system implementation. For example, in a system that does not use sectorized cells, there will be no need for a 1D sector. Similarly, on a single carrier system, there is no need for a carrier ID. Determining the PID, in one exemplary system, includes the steps of operating the cell identification module 271 for determining the cell identifier, operating the carrier identification module 272 for determining the operating identifier of the sector identification module 273 for the sector identifier. Thus, it should be appreciated that different signals that pass through a single physical transmitter element, e.g. an antenna, may correspond to different physical layer attachment points, e.g. where each of the different physical layer attachment points can be uniquely identified at least within the local area by combinations of physical identifiers. For example, it should be appreciated that the combination of antenna identifier or sector identifier in combination with the first carrier identifier may be used to identify the first carrier layer attachment point and physical determination, while the second carrier identifier combined with the physical identification identifier.
[0038] Information 260 with the same antenna or sector identifier may be used for the second layer attachment point identifiers (PID) physical layer attachment point is a list of PID identifiers,
53 / 51P26622PL00
EP 1 964 339 B1 (PID1 261, PID2 262), which are PIDs determined using PID identifier module 260. One exemplary implementation of identifiers (PIDs) of the physical layer attachment point may be a connection identifier (CID), which may be included in messages when sending and / or receiving messages. Specific sample CIDs will be discussed further below.
[0039] Memory 210 also includes a neighbor notification module 290, a message control module 292, and a connection establishment module 294. A neighbor notification module 290 is used to transmit a neighbor notification, e.g., neighbor notification messages 280, to access nodes. The message transmission control module 292 is used to control the transmitter module 234. A connection establishment module 294 is used to establish a wireless communication link with access nodes.
[0040] Fig. 3 is a detailed illustration of an exemplary access node 300 implemented in accordance with the present invention. shown in Fig.
The exemplary access node 300, 3 is a detailed mapping of the device that can be used as any of the access nodes 140, 140 ', 140 "shown in Fig. 1. In the embodiment of Fig. 3, the access node 300 includes processor 304, memory 310, network / internet interface 320 and wireless communication interface 330, connected together via bus 306. Thus, via bus 306, various components of the access node 300 may exchange information, signals and data. The components 304, 306, 310, 320, 330 of the access node 300 are located within the housing 302.
[0041] The network / internetwork interface 320 provides a mechanism by which the internal components of the access node 300 can send and receive signals to / from external devices and network nodes. 320 interface
53 / 51P26622PL00
EP 1 964 339 B1 includes a receiver module 322 and a module
324 transmitter used to connect node 300 to other network nodes, e.g. with copper wires or fiber optic connections. Wireless communication interface 330 also provides a mechanism by which the internal components of the access node 300 can send and receive signals to / from external devices and network nodes, e.g., end nodes. The 330 wireless communication interface includes, e.g. the receiver module 332 with the appropriate receiving antenna 336 and the transmitter module 334 with the appropriate transmitting antenna 338. The interface 330 is used to connect the access node 300 with other network nodes, e.g. via wireless communication channels.
[0042] Processor 304 under the control of various modules, e.g., procedures, contained in memory 310 controls the operation of the access node 300 to perform various signaling and processing. The modules y contained in memory 310 are executed at startup or when called by other modules that may be present in memory 310. The modules can, during execution, exchange data, information and signals. Modules can also share data and information during execution.
[0043] In the embodiment of Fig. 3, the memory 310 of the access node 300 according to the present invention comprises a signal generating module 314 for generating signals, a packet routing module 350 responsible for signal and message routing, a mapping module 312 which is responsible for mapping PIDs to network layer addresses, table 311 of the address distribution including mappings 317 of the PID to the IP address. Memory 310 also includes an end node identification module 351 identifying the end nodes with which the access node 300 communicates, resource allocation information 340
53 / 51P26622PL00
The forward link responsible for allocating downlink resources to the end nodes, including resources allocated to the end node X 341 and, 345 information about the allocation of the downlink resource responsible for allocating the downlink resources to the end nodes, including resources allocated to the end node X 346.
[0044] Referring now briefly to Fig. 9, Fig. 9 is an address distribution table 311 'that can be used as the address distribution table 311 shown in Fig. 3. The address distribution table 311' includes PID 902, 904, 906, 908, 910, 912 and information respectively indicating the relevant IP addresses 903, 905, 907, 909, 911 and 913. PID identifiers are locally uniquely unique, e.g. PIDs of directly adjacent cells are unique to each other. It should be noted that the content of PIDs may vary depending on the physical characteristics of the access node and the number of physical layer attachment points served by the access node to which the PID corresponds. In the example of Fig. 9, PIDs 902, 904 correspond to the first access node (AN 1) that supports two sectors that use the same carrier. Thus, in the case of AN 1, it is sufficient for the PID to include the cell identifier and the sector type identifier to uniquely identify the physical layer attachment points in the cell. PIDs 906, 908, 910 correspond to a cell that supports multiple carriers and many sectors. Thus, the PIDs for the access node '2 are implemented as CIDs in the same manner as used in the various exemplary embodiments described below. PID 912 corresponds to a third access node that contains a single sector and uses a single carrier. Thus, it is sufficient for the PID 6 that corresponds to the third node
53 / 51P26622PL00
The access code only contained the cell identifier despite additional physical layer identification, e.g. sector and / or carrier identifier. The inclusion of such additional information may be desirable when, from a processing perspective, compatible PID formats are desired in many cells.
[0045] Referring to Fig. 4, Fig. 4 shows an example Connection Identifier (CID) 400 implemented in accordance with the invention. The CID 400 identifier includes Slope 410, which is the cell identifier, Sector 420, which is the Sector Identifier and the Carrier 430, which is the carrier frequency identifier, also known as the tone block identifier.
[0046] In an exemplary communication system using OFDM technology, in the physical layer, the spectrum is divided into the number of tones and is reused in cells and sectors in neighboring geographical areas. In order to improve the interference characteristics, the tones used in each cell / sector skip over time, and different cells and sectors in adjacent geographical areas use different hopping sequences that determine how the tones should skip. The hopping sequences are generated using a predetermined function controlled by two input variables, namely, cell identifier, e.g., edge value, and sector identifier. The sector identifier may be implemented as a sector type identifier that indicates which of the numerous possible types of sector a particular sector corresponds to. In one embodiment, the slope value is an integer from 1 to 112, and the sector identifier value is an integer from 0 to 5. Adjacent cells and sectors use different pairs of slope identifier and sector identifier such that the generated hop sequences are different. In one embodiment, all sectors in the cell use the same edge value but different identifiers
53 / 51P26622PL00
In the sector, and adjacent, e.g., physically adjacent, cells use different slope values.
[0047] Furthermore, the example OFDM communication system, in some embodiments, uses multiple carriers or tone blocks, so that available tones are grouped into multiple tone blocks. Tones in tone blocks preferably adhere to each other. In one example system, tone hopping in a given tone block is limited to that tone block. That is, the hopping sequences are such that the tones can hop inside a tone block, but they cannot hop between multiple tone blocks. Tone blocks are indexed using a carrier identifier. In an embodiment, the carrier identifier is an integer 0, 1 or 2.
[0048] When the end node sets up a connection to obtain wireless network services, the network side entity is an access node, e.g., a base station in a cell / sector, and the connection is determined with reference to a single tone block. In this way, in the above example OFDM communication system, the slope connection, sector identifier and carrier identifier can be used as a locally unique identifier that identifies the connection for the wireless terminal. The combination is one number, therefore, a connection identifier based on one or more physical layer identifiers. In one embodiment, multiple wireless terminals may have connections to the same cell / sector of the base station on the same tone block. These connections will usually share the same connection identifier because they are connected to the same physical layer attachment point defined by the cell combinations, the wireless connection identifier sector, and the tone block. and identifier used for
Pointing terminal combination
53 / 51P26622PL00
Communication connection with a specific wireless terminal.
[0049] Generally, a connection identifier is a number or combination of numbers that locally uniquely identifies the connection. In various embodiments, the number or numbers are characteristic parameters of the physical layer. In another embodiment, e.g., an embodiment of a CDMA communication system, the connection identifier may be a combination of a pseudo-noise (PN) sequence offset and another parameter, e.g. carrier identifier if multiple carriers are used.
[0050] Fig. 5 shows an example message 500, in accordance with the present invention, which uses the Connection Identifier of Fig. 4: An example message 500 is a link layer message that includes a CID destination / source address. The CID destination / source address is an optional field in the link layer message in accordance with some embodiments of the present invention. The Link Layer 500 message contains a field 510 Link Layer Control (LLC) Type identifying the Content 530 type of the Message contained in the 500 message. The CID 520 is the Connection ID in the form of the ID 400 Connection from Fig. 4. In one embodiment of the present invention, the CID 520 field, when sent from the end node to an access node in accordance with the invention, identifies the physical target attachment point and, when sent from the access node to the end node in accordance with the invention, identifies the source physical attachment.
[0051] Fig. 6 shows an exemplary communication method and corresponding signaling carried out according to the first embodiment. In Fig. 6, end node 630 communicates with access node 620 via access node 610 without a wireless uplink connection between end node 630 and
53 / 51P26622PL00
EP 1 964 339 B1 of the message in the node although the access node 620, wherein the end node does not need to know the IP address of the access node 620. The signaling is shown in the context of the exemplary system 100 shown in Fig. 1. Access nodes 610 and 620 are similar to the access nodes 140, 140 'and 140 "of the system 100 of Fig 1 and are implemented in accordance with the access node 300 of Fig 3. End node 630 is similar to end node 144, 146, 144 ', 146', 144 "and 146" of system 100 of Fig 1, and it is implemented according to end node 200 shown in Fig 2.
[0052] In Fig 6, end node 630 maintains a bi-directional link with access node 610, which means it can send messages to and receive access 610. End node 630 located within the transmission range of access node 620, has no forward link to the node This means that while the end node 630 can receive and process the broadcast information sent by the access node 620 (e.g. broadcast messages 640), end node 630 cannot send messages to access node 620 via a radio channel, and access node 620 cannot receive and process messages sent to it by end node 630 via a radio interface. This may be because end node 630 and access node 620 do not have sufficient time synchronization. Due to some restrictions, e.g. limited hardware capabilities, end node 630 may not be able to establish connection with access node 620 when the transmitting end node 630 currently has a two-way connection to access node 610. In one example, the forward links used by access node 610 and access node 620 are on different carriers , e.g. the forward link frequency band used by the access node 610 is different from the forward link frequency band used by the access node 620. If end node 630 can only generate
53 / 51P26622PL00
For example, because the forward node 630 has only one radio frequency (RF) path due to cost, then the end node 630 cannot simultaneously maintain two forward link connections in two separate bands at one time at a time, for example frequency bands. In another example, when the forward links used by access nodes 610 and 620 are in the same band, the two forward links may not be time synchronized because the two access nodes are not time synchronized or because of the difference in propagation delay for the signal from end node 630 reaching access nodes 610 and 620. If end node 630 at a time can only generate one downlink signal according to one time synchronization scheme, for example, because end node 630 has a single digital processing path limited to one time scheme at a time, then end node 630 cannot simultaneously maintain two uplink connections when the connections are not timely enough synchronized with each other.
[0053] The terminal node 630 receives the broadcast signal (s)
640 that are transmitted by the access node 620. The signal (s) 640 are sufficient to determine the Connection ID, similar to the CID 400 of Fig. 4 corresponding to the particular physical connection of the access node 620 that transmits the broadcast signal 640. Signal Y or signals 640 may include beacon signals and / or pilot signals that can be transmitted in one or more symbol transmission time periods.
[0054] End node 630 transmits message 650 to access node 610. In an exemplary embodiment, said message 650 is the same as or similar to exemplary message 500 of Fig 5. CID identifier field, equivalent to CID 520 of Fig 5 of said message 650
53 / 51P26622PL00
EP 1 964 339 B1 is set to a connection identifier that identifies the physical attachment point of the access node 620 that broadcasts signal 640. Said message 650 is therefore intended for access node 620 despite being sent to access node 610. It should be noted that because end node 630, in the example of Fig. 6, there is no downlink connection to access node 620, it cannot send messages 650 directly to said access node 620.
[0055] Access node 610 receives message 650 and checks the CID field corresponding to CID 520 of Fig 5, messages 650 and realizes, from the stored CID to link layer identification information that it does not identify one of its own physical attachment points . In this case, access node 610 searches its memory for said CID of message field 650 to find a mapping to the corresponding higher layer identifier for access node 620 (e.g., IP address).
[0056] For example, a base station that includes multiple sectors operating under the control of a single link layer controller and / or multiple carriers used under the control of a single link layer controller may have multiple CIDs corresponding to the link layer identifier corresponding to the single link layer controller. In solutions where separate link layer controllers are used for each sector and / or carrier, different link layer identifiers may be used for each of different sectors and / or carriers. In some embodiments, there is unambiguous mapping between physical attachment points and link layers, but this is not mandatory and there may be several physical attachment points operating on a single link layer. Thus, the same link layer link identifier may
53 / 51P26622PL00
EP 1 964 339 B1 contains the target access 620 and is, in the IP of the terminal dependency node
630, (Network Access Identifier
The extracted CID access node correspond to multiple physical layer identifiers, but each physical layer identifier connection identifier typically maps at most to a single link layer identifier.
[0057] Assuming that mapping to the upper layer address exists, access node 610 encapsulates at least a portion of the message 65C into the network layer message 660, which address set to the node identifier transmits said message 660 to the access node 620. According to this solution, the message 660 also includes an end node identifier 630, said solution identifier, one of: a Network Access Identifier (NAI) address of the end node 630 and a temporary identifier. Access node 620 receives said message 660 and extracts from it the encapsulated message portion 650 620 controls the identifier field of the encapsulated message portion 650 and recognizes that the CID identifier field identifies one of its own physical attachment points.
[0058] The access node 620 sends a message 670, which contains at least a portion of the received message 650 encapsulated in the message 660, by the access node 620. Said message 670 also includes an end node identifier 630 similar to that contained in the message 660. The access node 610 receives message 670 and checking the contained end node identifier states that the message 670 encapsulates the message 680 intended for end node 630. Access node 610 then sends a message 680 that contains at least a portion of message 670. According to the invention, message 680 includes the CID of the physical attachment point of access node 620 that broadcasts signal 640.
53 / 51P26622PL00
EP 1 964 339 B1 carried out are shown
Signaling the system 100 they are implemented in Fig. 3. In Fig. 7, [0059] End node 630 receives a message 680 from access node 610, but by checking the CID field contained in said message 680, e.g. by comparing it to stored CID information he finds that message 680 originates from access node 620 in response to message 650 previously sent to him.
[0060] Fig. 7 shows an example of signaling in accordance with the second embodiment. in the context of the example shown in Fig. 1. End node 710 is a simplified representation of end node 200 of Fig 2 and is the same or similar to end nodes 144, 146, 144 ', 146', 144 ", 146" of system 100 of Fig. 1. Access nodes 740 and 750 are similar to access nodes 140, 140 'and 140 "of system 100 of Fig. 1 and using access node 300 with end node 710 includes message generation module 720 and link selection module 730. The message generation module 720 of Fig. 7 can be used by applications running on the end node 710 to generate messages for their purposes. For example, the connection control protocol application may be included and active on end node 710 enabling end node 710 to communicate with access nodes to create, delete and / or modify links between end node 710 and one or both of the access nodes 740, 750. Other an example is the quality of service (QoS) application that can be included in the 710 end node. The QOS application, if present, can modify the QoS characteristics of various end node links 710. The link selection module 730 of Fig. 7 measures various connection quality parameters including link delays, link channel conditions, link error rate, and link transmission power requirements to determine, e.g. message by message or at a specific time point which of
53 / 51P26622PL00
The available links are most suitable for transmitting the next message.
[0061] The received link quality information can, and in various solutions is used to determine which of the many simultaneous links to which a message should be transmitted at a particular time point.
[0062] In Fig. 7, the end node 710 maintains bi-directional links to the access nodes 740 and 750, which means that it can send messages to and receive messages from the access node 740 and 750. In this solution, the end node message generating module 720 710 generates a message 759 with the final destination access node 740. The message 759 is first sent in the terminal 730 link dial module 730. Link selection module 730 selects the link between links to access nodes 740 and 750 through which the next message is to be transmitted. The link determination function is based on link characteristics including at least one of link delay, link channel conditions, link error rate, and link transmission power requirements.
[0063] In the solution shown in Fig. 7, the link selection module 730 selects a link to the access node 740 and transmits a message 760 through it. Message 760 contains at least a certain portion of the message 759 and, in some embodiments, includes additional fields used for message transmission over the link between end node 710 and access node 740. For example, additional fields, in some embodiments, are link framing fields. Because the final destination of messages 759 and 760 is access node 740, access node 740 receives message 760, processes the received message and responds, e.g., by transmitting messages 765 to end node 710. Message 765 is received by end node 710 and delivered to the message generating module as message 766. Message generation module 720, generates a second message 769 from
53 / 51P26622PL00
EP 1 964 339 B1 is an access destination 740. Message 769 is sent to link selection module 730 which selects the link through which the message 769 is to be transmitted. In this solution, a link to the access node 750 is selected and a message 770 is transmitted to the access node 750. Message 770 contains at least a portion of message 769 and, in one embodiment, includes additional fields used to transmit the message over the link between end node 710 and 750. For example, additional fields are, in some embodiments, link framing fields.
[0064] In one implementation, link selection module 730 adds an identifier, e.g., identifier of a physical attachment point, access node 740 together with at least a portion of message 769 in its containing message 770, because the link selected by message link selection module 730 does not corresponds to the final destination of message 770, which is access node 740. In another example, the link selection module adds the ID of the final destination of the messages 760 and 770 before it transmits those mentioned messages 760 and 770, regardless of which link is selected for their transmission. In a further embodiment, messages 759, 769 contain the identifier of their final destination. For example, in the example of the example solution of Fig. 7, the final destination identifier corresponds to the access node 740.
[0065] In one exemplary embodiment, message 770 is implemented according to message 500 of Fig. 5, where CID field 520 identifies access node 740. Access node 750, receives message 770 and processes it. By checking the final destination of the message 770, e.g., the physical attachment point identifier in the CID identifier field 520 of the message 500 of FIG. 5, access node 750 determines that message 770 is not intended for
53 / 51P26622PL00
But for another node identified by the final destination identifiers (e.g., CID in the CID field). Access node 750 looks for the physical attachment point identifier (PID) contained in message 770 in its address distribution table (see address distribution table 311 in access node 300 of Fig. 3) to find the network address (e.g., IP address) corresponding to the PID contained in message 770.
[0066] Access node 750 encapsulates at least a portion of message 770 in a corresponding network layer header and transmits message 775 to access node 740. Message 775 includes at least: message part 770, and at least a portion of the IP address of access node 740. In addition, the 775 message may, and in various solutions, contain some or all of the following: access node IP address 750, access node PID 740 contained in message 770, PID ID of access node 750 through which the 770 message was received, terminal node ID 710 and session identifiers for encapsulation (also called tunneling) of messages between access node 750 and access node 740. The access node 740 receives the message 775, which it recognizes as a message intended for it from the destination PID contained in the message 775.
[0067] In one implementation, the access node 740 responds by transmitting a message 780 that includes at least a portion of the message 775. The access node 750 receives the message 780 which contains the end node identifier 710 and sends the message 785 to the end node 710. Message 785 includes at least a portion of message 780. End node 710 receives message 785 and forwards message 786 to message generating module 720.
In another implementation, access node 740 responds by transmitting, to end node 710, messages 780 '
53 / 51P26622PL00
EP 1 964 339 B1 comprising at least part of the message 775. The message 780 'is transmitted via a direct link between the access node 740 and the end node 710.
shows an example [0069] Fig. carried out according to the invention where the neighbor look-up node and signaling with the exemplary embodiment variant is used as part of the CID routing information update process. Signaling is shown in the context of an exemplary system such as system 100 shown in Fig. 1. End node 810 is a simplified representation of end node 200 of Fig 2 and is the same as or similar to end nodes 144, 146, 144 ', 146', 144 ", 146" of system 100 of Fig 1. Access nodes 840 and 850 are such same or similar to the access nodes 140, 140 'and 140 "of the system 100 of Fig. 1 and can be implemented, e.g. using access nodes of the type shown in Fig.
3. The exemplary end node 810 of Fig. 8 has a two-way communication link with the access node 840 enabling it to send messages to and receive messages from the access node 840.
[0070] In Fig. 8, the end node 810 generates and transmits the message 860 to the access node 840. The message 860 includes an identifier that identifies the access node 850 as the destination of said message. Access node 840 receives the message 860 and attempts to break down the access node identifier 850 contained in said message to the address by searching its distribution table of the table 311 of the address distribution of the access node. Example of the access node 840 of Fig. 8 cannot disassemble the identifier mentioned. Access node 840 then transmits message 865 to end node 810. Message 865 includes an indication that message routing was not possible due to a decay error.
network addresses, e.g. 300 from Fig. 3
53 / 51P26622PL00
[0071] In one embodiment of this invention, the end node 810 at this point establishes a two-way communication link with the access node 850 listing the many different messages shown in Fig 8 as the double arrow message 870. However, this is not necessary if a bi-directional link already exists with access node 850. In another example in which the invention is used, the end node 810 already has a two-way link to the access node 850 in addition to the link to the access node 840.
[0072] Using the link to the access node 850, the end node 810 transmits the new neighbor notification message 875 to the access node 850. The message 875 includes at least the access node identifier 840 and the network layer address of the access node 840. In this way, the access node 850 is provided with both an identifier, e.g. the PID identifier of the 840 access node, and an appropriate link layer address, e.g. MAC address that access node 850 can address and store for future physical layer distribution to the network layer identifier. In one embodiment of this invention, the access node identifier 840 is the identifier of the physical attachment point; in another embodiment of this invention, it is a link layer identifier. The network layer identifier of the access node 840 is known to end node 810 from communication messages 897 forwarded to end node 810 during or after establishing a link with the access node 840.
[0073] In an alternative embodiment of this invention, end node 810 sends message 875 'instead of message 875. Message 875' has the same or similar message content as message 875 but is sent to access node 850 via access node 840 instead of directly to the node access node 850. Access node 840 then routes message 875 'as message 875 "to the node
53 / 51P26622PL00
It should be noted that, unlike message 860, message 875 'is a network layer message containing the network address of access node 850 as its destination. The access node's network address
850 known to end node 810 from communication 899 passed to establish link with access node, access node 840 may route message 875 "to access node 850 using access node network address 850, e.g., address distribution operations.
messages or after
50. For this reason,
IP, without requiring CID to [0074] Access node 850 receives message 875 and sends a message 880 about the creation of a new neighbor to the network address of access node 840 obtained from message 875. Message 880 includes mapping the connection identifier to the network layer address for the access node 850 In another embodiment of this invention, the message 880 comprises mapping the link layer identifier to the network layer address for the access node 850. In another embodiment of this invention, message 880 includes additional neighbor information used to adapt handoffs, including, but not limited to, tunnel address and tunnel session identifiers to re-address the packet between access nodes 840 and 850, access node capabilities 850 in terms of service quality, workload, protocols, and supported applications. The access node 840 receives the message 880 and stores the information contained in the message 880 in its memory, e.g. for later use in CID decomposition operations to the network address. Access node 840 responds with message 882 confirming receipt of said information contained in message 880.
53 / 51P26622PL00
[0075] In one embodiment of this invention, access node 840 includes in the message 882 some mapping of the connection identifier to the network layer address for the access node 850, mapping of the link layer identifiers to the network layer address for the access node 850, information about the neighbor used to adapt handoffs, including but not limited to the tunnel address and tunnel session IDs for re-addressing the packet between access nodes 840 and 850, and or information indicating the capabilities of the access node 840 with respect to quality of service, load, protocols, and supported applications. The access node 840 receives the message 880 and stores the information contained in the message 880 in its memory, e.g. for later use for routing messages. In this particular embodiment of the invention, messages 883 and 884 are not used.
[0076] In another embodiment of the present invention, access node 840 message 882 includes acknowledgment of receipt of information contained in message 880. In this embodiment, the access node 840 sends a message 883 containing at least some mapping of the connection identifier to the network layer address for the access node 850, mapping of the link layer identifiers to the network layer address for the access node 850, neighbor information used to adapt the forwarding of the node (handoffs) including but not limited to tunnel address and tunnel session IDs for re-addressing the packet between access nodes 840 and 850, access node 840 capabilities in terms of service quality, load, protocols, and supported applications. Access node 850 receives message 883 and stores information contained in message 883 in its memory, e.g. for later use. Access node 850 is responsible for
53 / 51P26622PL00
EP 1 964 339 B1 to map between
850 and a network address by means of a message 884 confirming receipt of said information.
[0077] Following the exchange of neighbor information and mapping the identifier to addresses between access nodes 840 and 850 by message 880, 882 and optionally 883 and 884, end node 810 sends message 890 to access node 840. Like message 860, in one example In carrying out the invention, the message 890 is also the same or similar to the message 500 of Fig 5. Message 890 identifies the access node 850 as its final destination. Access node 840, receives message 890, searches its memory in the access node identifier of said node 850, and finds said network address in its address distribution table that was previously full by message 880. Access node 840 encapsulates message 890 according to the information in the distribution table and sends it to access node 850 as message 891. Access node 850 responds with message 892 again using information in its address table and message 891. Access node 840 sends message 893 to end node 810 containing at least a portion of message 892 received from access node 850 terminating communication between end node 810 and the node access 850 via access node 840.
[0078] In the manner described above, by using messages from the end node 810, access nodes 840 and 850 have an address and / or PID information about each other that can be used to route sequentially received messages. Thus, when access nodes are added to the network, end nodes can be used to detect their presence from broadcast signals and to notify access nodes of a new neighbor. As part of the notification process, sufficient address information is distributed to facilitate routing
53 / 51P26622PL00
By using the message software based on the network PID after the notification process has ended.
[0079] In various embodiments, the nodes described herein are implemented using one or more modules to perform steps corresponding to one or more of the methods of the present invention, for example, signal processing, message generation and / or transmission. Thus, in some embodiments, various features of the present invention are implemented using modules. Such modules can be implemented from software, hardware or a combination of hardware. Many of the methods or method steps described above can be implemented using machine executable instructions, such as a computer program, contained on a machine readable medium such as a memory device, e.g. RAM, floppy disk, etc. to control the machine e.g. a universal computer with or without additional hardware to implement all or part of the methods described above, e.g. in one or more nodes. Thus, among other things, the present invention relates to a machine readable medium comprising machine executable instructions for performing through a machine, e.g. a processor and equipment connected thereto, one or more steps of the method (s) described above.
[0080] Many additional variants of the methods and apparatus of the present invention described above will become apparent to those skilled in the art in light of the above description of the invention. These variants will be considered within the scope of the invention. The methods and apparatus of the present invention can be, and in various embodiments are, used in CDMA, orthogonal frequency division multiplexing; (OFDM), or various other types of communication techniques that can be used to provide wireless communication links between access nodes and nodes
53 / 51P26622PL00
EP 1 964 339 B1 mobile. In some embodiments, access nodes are implemented as base stations that establish communication links with mobile nodes using OFDM and / or CDMA. In various embodiments, mobile nodes are implemented as notebooks, personal digital assistants (PDAs), or other portable devices comprising receiver / transmitter systems and logic circuits and / or procedures to implement the methods of the present invention.
Contents35
175 members in 21 offices
Priority claims8
| Document | Office | Kind | Date |
|---|---|---|---|
| 31660305 | United States of America | A | |
| 31660305 | United States of America | A | |
| 06847976 | European Patent Office (EPO) | A | |
| 2006048916 | United States of America | W | |
| 2006048916 | United States of America | W | |
| EP20060847976 | – | – | – |
| US20050316603 | – | – | – |
| WO2006US48916 | – | – | – |
Members175
| Document | Office | Kind | |
|---|---|---|---|
| US838290A | United States of America | A | |
| US2004073786A1 | United States of America | A1 | |
| CA2540897A1 | Canada | A1 | |
| WO2004036823A1 | World Intellectual Property Organization (WIPO) | A1 | |
| AU2003279272A1 | Australia | A1 | |
| EP1556989A1 | European Patent Office (EPO) | A1 | |
| US2007064948A1 | United States of America | A1 | |
| CA2622762A1 | Canada | A1 | |
| WO2007035436A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2007035792A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2007035793A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2007035795A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2007035796A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2007035797A2 | World Intellectual Property Organization (WIPO) | A2 | |
| US2007076653A1 | United States of America | A1 | |
| US2007076658A1 | United States of America | A1 | |
| US2007078999A1 | United States of America | A1 | |
| US2007083669A1 | United States of America | A1 | |
| US2007086389A1 | United States of America | A1 | |
| WO2007035797A3 | World Intellectual Property Organization (WIPO) | A3 | |
| TW200721863A | Taiwan Province of China | A | |
| WO2007035795A3 | World Intellectual Property Organization (WIPO) | A3 | |
| US2007147283A1 | United States of America | A1 | |
| US2007147286A1 | United States of America | A1 | |
| US2007147377A1 | United States of America | A1 | |
| CA2630505A1 | Canada | A1 | |
| CA2630540A1 | Canada | A1 | |
| CA2630585A1 | Canada | A1 | |
| WO2007075671A1 | World Intellectual Property Organization (WIPO) | A1 | |
| WO2007075954A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2007075955A1 | World Intellectual Property Organization (WIPO) | A1 | |
| AR055641A1 | Argentina | A1 | |
| WO2007075954A3 | World Intellectual Property Organization (WIPO) | A3 | |
| TW200738004A | Taiwan Province of China | A | |
| TW200742453A | Taiwan Province of China | A | |
| WO2007130969A2 | World Intellectual Property Organization (WIPO) | A2 | |
| TW200746716A | Taiwan Province of China | A | |
| US2007297329A1 | United States of America | A1 | |
| US2007298788A1 | United States of America | A1 | |
| WO2007130969A3 | World Intellectual Property Organization (WIPO) | A3 | |
| CL2007001248A1 | Chile | A1 | |
| AR058642A1 | Argentina | A1 | |
| AR058644A1 | Argentina | A1 | |
| TW200810467A | Taiwan Province of China | A | |
| TW200820807A | Taiwan Province of China | A | |
| WO2008051632A1 | World Intellectual Property Organization (WIPO) | A1 | |
| EP1938511A1 | European Patent Office (EPO) | A1 | |
| EP1938527A1 | European Patent Office (EPO) | A1 | |
| EP1938528A1 | European Patent Office (EPO) | A1 | |
| EP1938531A2 | European Patent Office (EPO) | A2 | |
| KR20080063324A | Republic of Korea | A | |
| KR20080063331A | Republic of Korea | A | |
| KR20080063333A | Republic of Korea | A | |
| KR20080063334A | Republic of Korea | A | |
| AR060843A1 | Argentina | A1 | |
| EP1964338A2 | European Patent Office (EPO) | A2 | |
| EP1964339A1 | European Patent Office (EPO) | A1 | |
| EP1964430A1 | European Patent Office (EPO) | A1 | |
| KR20080086908A | Republic of Korea | A | |
| KR20080087850A | Republic of Korea | A | |
| KR20080087853A | Republic of Korea | A | |
| CN101305564A | China | A | |
| CN101305565A | China | A | |
| CN101305568A | China | A | |
| CN101310480A | China | A | |
| CN101331722A | China | A | |
| CN101331790A | China | A | |
| CN101341684A | China | A | |
| KR20090007618A | Republic of Korea | A | |
| EP2020159A2 | European Patent Office (EPO) | A2 | |
| KR20090016682A | Republic of Korea | A | |
| EP2025192A1 | European Patent Office (EPO) | A1 | |
| JP2009509463A | Japan | A | |
| JP2009509466A | Japan | A | |
| JP2009509467A | Japan | A | |
| JP2009509468A | Japan | A | |
| CN101433102A | China | A | |
| CN101433106A | China | A | |
| JP2009521846A | Japan | A | |
| JP2009521866A | Japan | A | |
| JP2009521867A | Japan | A | |
| HK1126919A | Hong Kong, China | A | |
| HK1126919A1 | Hong Kong, China | A1 | |
| JP2009536005A | Japan | A | |
| JP2009536006A | Japan | A | |
| RU2008115492A | Russian Federation | A | |
| RU2008130055A | Russian Federation | A | |
| RU2008130068A | Russian Federation | A | |
| RU2008130130A | Russian Federation | A | |
| RU2388158C2 | Russian Federation | C2 | |
| EP2184937A1 | European Patent Office (EPO) | A1 | |
| KR20100052548A | Republic of Korea | A | |
| EP1964339B1 | European Patent Office (EPO) | B1 | |
| AT473570T | Austria | T | |
| ATE473570T1 | Austria | T1 | |
| DE602006015354D1 | Germany | D1 | |
| ES2346696T3 | Spain | T3 | |
| KR100990054B1 | Republic of Korea | B1 | |
| EP1938531B1 | European Patent Office (EPO) | B1 | |
| KR100990340B1 | Republic of Korea | B1 |
Numbers
- Publication, DOCDB
- 1964339
- Publication, EPODOC
- PL1964339T
- Application
- 847976
- Application, DOCDB
- 06847976
- Application, EPODOC
- PL20060847976T
Titles2
- English
- METHOD AND APPARATUS FOR END NODE ASSISTED NEIGHBOR DISCOVERY
- Polish
- Sposób i urządzenie dla węzła końcowego do wspomaganego wykrywania sąsiada
Classification
- CPC, 8
- H04W8/005
- H04W40/248
- H04L41/069
- H04L45/28
- H04W48/16
- H04W8/26
- H04W76/15
- H04L45/02
- IPC, 5
- H04L12 56
- H04L45 02
- H04L47 76
- H04L45 28
- H04W8 00