The method relates to a method for discovering neighboring network nodes by a network node and to a configuration server for auto-configuration of a network node.
The integration of a network node in a network, e. g. of a base station of a mobile radio network or a relocation of a placed network node causes considerable configuration efforts at the manufacturing factory of the network node or on the respective site. In many cases, most of the configuration data for a network node is entered at the manufacturing factory into the network node according to input provided by the corresponding network operator. Thus, the network node is preconfigured by the manufacturer. When the network node is delivered to the planned location, only few configuration data has to be input at the respective location site by a technician. The manufacturer preconfiguration only works if the network node is delivered to the planned location and is void if the network node is delivered to stock or another location.
In the related art the complete configuration is often performed manually by a technician at the location of a network node. In this full on-site configuration, the technician who installs the network node, manually configures the network node according to a print-out of the configuration data of the network node as planned by a planning tool. The manual configuration data includes, for instance, an address and additional identifying attributes which uniquely identify the respective network node. The full on-site configuration requires a high degree of skilled manual effort.
Existing conventional automatic configuration methods for network nodes reduce this configuration effort by enabling to retrieve configuration data for a new or relocated network node from a preconfigured configuration planning data base containing a so-called network plan.
These automatic configuration methods are performed by a standard IETF-protocol DHCP or similar data protocols. A precondition of such an auto-configuration is that a mapping of the network node to a planned network node of a network plan can be made so that a current set of configuration parameters can be applied to the located or relocated network node. This is performed by planning a designated physical network node at a particular location identified by a physical identifier in the corresponding network plan. However, the conventional auto-configuration method by the DHCP-protocol or similar data protocols requires an exact mapping between the pieces of hardware that have to be installed and the location. The identification of a network node by a hardware dependent identifier has the disadvantage that the administrative overhead of a network installation staff is increased, because it is not possible to install any network node of a particular type which is in stock at a particular location. A further disadvantage is that the administrative overhead is increased for the network operator, the network node manufacturer, and the installing technician, since the network operator has to plan the network with a very high level of detail and co-ordinate and exchange the necessary configuration data with the node manufacturer and the installing technician. However, the network operator is only interested in certain network node functions provided at certain locations. Under normal circumstances, a network operator is not interested in a particular piece of hardware used to provide desired functions.
In many applications, the network nodes need to discover neighboring nodes in geographical rather than topological terms. For instance, it might be necessary to establish an interface connection between neighboring network nodes.
Often, physical proximity between network nodes implies also a logical relationship between the network nodes, e. g. in terms of the configuration of the neighboring network nodes. These relationships can require some coordination between two or more network nodes, because a network operator either cannot or does not want to plan all the details of the relationship in advance. This is particular important for network nodes which require a direct communication with adjacent network nodes. For instance, base station network nodes of a mobile access network such as GSM-base stations,
UMTS-base stations, WiMax-base stations or WLAN-base stations have to coordinate the management of the radio resources and have to coordinate a handover of mobile network nodes between the respective radio ranges of the base stations. Other possible reasons that require a direct communication between network nodes such as base stations is, for instance, a redundancy mechanism between network nodes and the above-mentioned automated configuration and optimization of the respective network node.
In many cases, a geographical neighborhood between two network nodes implies a relationship between neighboring network nodes. Examples for such network nodes are devices like remotely configurable traffic signs, smoke sensors or industrial sensors/actuators.
The physical proximity between network nodes which form geographical neighbors does not mean that they are close in terms of wired network topology. In many cases, network nodes neighboring to each other geographically are distant to each other in terms of wired network topology. A neighbor node discovery which is limited to a physical local link is not sufficient since the network node may be attached to distant parts of the wired network.
A neighbor node discovery over a wireless medium is unreliable and may disturb other traffic. Moreover, such a discovery method may be impossible because the neighboring node may be mutually unreachable over the air, but reachable by another device, e. g. reachable for user equipment which can access both network nodes. Sensing of a neighboring network node over the wireless medium and adjusting autonomously the configuration and behavior of the network node accordingly, e. g. switching to another radio channel, requires wireless connectivity to the adjacent network node which may not always be available. Furthermore, due to the lack of a third party involved in a possible resulting neighborhood relationship, it is difficult to control such an established neighborhood relationship, e. g., a neighborhood relationship between two network nodes that is not desired by the network operator.
A concentration of the required coordination functions to a central network element, e. g. RNC in 3G-networks, imposes a certain hierarchy of the network architecture and causes additional undesired complexity of the network architecture because an additional central network element is required and the corresponding functions need to be split appropriately between the central network element and the other network nodes.
Accordingly, it is one possible object to provide a method for discovering neighboring network nodes avoiding the above mentioned disadvantages of conventional discovery methods.
The inventors propose a discovery method which does not need a fully centralized planning in advance of the respective network.
The inventors also propose that the discovery does not require that the adjacent neighboring network nodes are reachable via unreliable air links.
A further aspect of the method is that the discovery method does not involve the provision of further central elements requiring a hierarchical network architecture with high complexity.
Specifically the inventors propose a method for discovering neighboring network nodes by a network node connected to a configuration server, wherein the configuration server matches geographical coordinates of the network node with geographical coordinates of other network nodes stored in a data base and transmits a set of identifiers of the matching neighboring network nodes to the network node.
In one embodiment of the method, the set of identifiers of a neighboring network node comprises as identifiers an IP-address of the neighboring network node and a radio setting of the neighboring network node.
In one embodiment of the method, the network node sends a request message to the configuration server containing geographical coordinates of the network node.
In a further embodiment of the method, the configuration server sends a return message to the network node containing a set of identifiers for each neighboring node of the network node.
In a further embodiment of the method, the return message further contains the geographical coordinates of the neighboring network nodes of the network node.
In one embodiment of the method, the network node is connected to the configuration server via an operation and maintenance (OAM) network.
In one embodiment of the method, the network node is formed by a base station of a wireless access network.
In one embodiment of the method, the geographical coordinates comprise a latitude, a longitude and an altitude of the network node.
In one embodiment of the method, the network node determines its geographical coordinates by a positioning device and transmits its determined geographical coordinates to the configuration server with the request message.
In one embodiment of the method, the positioning device is formed by a GPS-receiver, a Galileo-receiver or a Glonass-receiver.
In one embodiment of the method, the positioning device is connected to the network node.
In an alternative embodiment of the method, the positioning device is integrated in the network node.
In one embodiment of the method, the network node sends a request message containing a device-ID of a device connected to the network node to the configuration server.
In one embodiment of the method, the device-ID is formed by a MSISDN-number of the network node.
In an alternative embodiment of the method, the device-ID is formed by an IMSI-number of the network node.
In an alternative embodiment of the method, the device-ID is formed by an IMEI-number of the network node.
In one embodiment of the method, the device-ID is forwarded by the configuration server to a mobile network server comprising a data base having for each device-ID associated geographical coordinates of the device connected to the network node.
In one embodiment of the method, the geographical coordinates of the device connected to the network node are transmitted by the mobile network server to the configuration server for matching with the geographic coordinates of other network nodes stored in the data base of the configuration server.
In one embodiment of the method, the configuration server decides that the geographical coordinates of the requesting network node and the geographical coordinates of another network node stored in the data base match with each other when the difference between at least one corresponding coordinate of both network nodes is lower than an adjustable threshold value.
In one embodiment of the method, the network node is formed by an immobile network node.
In an alternative embodiment of the method, the network node is formed by a mobile network node.
The inventors also propose a configuration server for auto-configuration of a network comprising network nodes connected to the configuration server, wherein the configuration server matches geographical coordinates of a requesting network node with geographic coordinates of other network nodes of the network stored in a data base and transmits a set of identifiers of the matching network nodes to the requesting network node.
In one embodiment of the configuration server, the configuration server transmits configuration data to the requesting network node.
The inventors further propose a network node connected to a configuration server, wherein the network node sends a request message to the configuration server which matches geographical coordinates of the network node with geographical coordinates of other network nodes and transmits a return message which is received by the requesting network node containing a set of identifiers of the matching neighboring network nodes.
In a preferred embodiment of the network node, the network node is formed by a base station of a wireless access network.
These and other objects and advantages of the present invention will become more apparent and more readily appreciated from the following description of the preferred embodiments, taken in conjunction with the accompanying drawings of which:
Reference will now be made in detail to the preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to like elements throughout.
As can be seen from
In a preferred embodiment, the geographical coordinates determined by the positioning device 6 comprise a latitude x, a longitude y and an altitude z of the network node 1.
In an alternative embodiment, the geographical coordinates comprise only the latitude x and the longitude y of network node 1.
In an alternative embodiment, the positioning device 6 supplies the network node 1 with the latitude x and the longitude y of the location where the network node 1 is placed. In an exceptional case, an automated positioning of the network 1 node by the positioning device 6 is not possible, so that the position data, i. e. the coordinates, are entered manually by the installer. It is sufficient to determine the position or location of the network node 1 once if the location of the network node 1 is not changed thereafter. In the shown example, the network node 1-x as shown in
In a further step, the configuration server 4 compares the received geographical coordinates x, y, z of the network node.
1-x with geographical coordinates x, y, z of other network nodes stored in a data base 7 which is connected to the configuration server 4. In a possible embodiment, the configuration server 4 decides by using a dedicated algorithm that the geographical coordinates of the requesting network node 1-x and the geographical coordinates of another network node stored in the data base 7 match with each other, thereby identifying the network node and the other network node as neighbors. In a possible embodiment the named algorithm verifies if at least one corresponding coordinate x, y, z of both network nodes is lower than an adjustable threshold value.
For determining which nodes form neighbor nodes to a new network node, there are different possibilities. In one embodiment, the relationship between neighboring network nodes are preplanned and stored in a planning or configuration data base of the network operator. In an alternative embodiment, the neighboring network nodes are calculated using a dedicated algorithm. In a possible embodiment, the dedicated algorithm calculates the distance between nodes based on the coordinates of the network nodes. The dedicated algorithm calculates from the available data of other network nodes stored in the configuration data base the distance between the respective network nodes. In a preferred embodiment, the dedicated algorithm also takes into account other information, such as geographical peculiarities of the landscape, data from the frequency assignments of the network operator, electro-magnetic interferences and antenna settings, such as antenna tilt and antenna orientation. In all embodiments, the geo-location data is used for identifying the respective network nodes of a network.
In a possible embodiment, the data stored in the data base 7 is formed by planning data generated by a planning tool.
In an alternative embodiment, the data stored in the data base 7 is acquired by evaluating request messages sent by different network nodes 1-i.
In another embodiment, the data stored in the data base 7 is acquired by both, using existing planning data and using acquired data transmitted with request messages.
When the configuration server 4 decides that the geographical coordinates of the requesting network node 1-x and the geographical coordinates of a network node stored in the data base 7 do match, the configuration server 4 transmits a set of identifiers of the matching neighboring network node stored in the data base 7 to the requesting network node 1 via the operation and maintenance network 3. Furthermore, the configuration server 4 adds or updates a data-set containing the identifier for network node 1-x and its location to the data base 7. A sufficiently good match can be made by the configuration server 4 for one or more other network nodes 1, e. g. network node 1-A and 1-C shown in
When the configuration server 4 has accomplished the matching it sends a return message in case of a successful match. The return message contains information data on the neighboring network nodes, e. g. network nodes 1-A and 1-C of the requesting network node 1-x.
In a possible embodiment, additional configuration data and geographical location data is contained in the return message as well. For example, in a possible embodiment, the configuration server 4 does not only transmit a set of identifiers of the matching neighboring network nodes 1-A and 1-C of the requesting network node 1-x, and also the geographical coordinates x, y, z of the neighboring network nodes 1-A, 1-C. In this embodiment, the network node 1 can evaluate itself the supplied coordinates and decide itself whether the neighboring network nodes 1-A, 1-C are sufficiently close for the respective purpose or application.
After having sent the return message to the requesting network node 1-x, the configuration server 4 further sends update messages to the neighboring network nodes 1-A and 1-C identifying network node 1-x as a new neighbor. This is not performed if the new network node 1-x has been added to an IP-multicast group for reachability. The set of identifiers is transmitted to the inquiring network node 1-x and can comprise any useful identifier for the respective network node 1-x to communicate with its neighboring network nodes. In a possible embodiment, the set of identifiers comprises several identifiers such as an unicast IP-address of the respective neighboring network nodes 1. Alternatively, also an IP-multicast group formed by the members 1-A and 1-C can be transmitted. In the case of a multi-cast group, it is not required to inform the neighboring network nodes 1-A and 1-C explicitly about a new member 1-x, because the communication identifiers are provided with the multicast group-ID. Instead it is required that the network node 1-x joins the multicast group which has been communicated by the configuration server 4. Does the configuration server 4 not find any matching neighboring network node 1, an indication that no network node 1 has been found is transmitted to the inquiring network node 1 in the return message, for instance, by supplying an empty list.
Other examples for indirect positioning methods include radio frequency identification (RFID) positioning or infrared beacon positioning, e. g. within buildings. Further, triangulation can be performed using the network node's 1 own air interface in case of a base station. In the embodiment as shown in
To remove a client network node 1-i from the telecommunication system as shown in
In a possible embodiment, the method can be realized with a new data transmission protocol which fulfills the described message sequences. In alternative embodiments, as a legacy protocol, a DHCP-protocol is used to realize the method. Instead of mapping from a MAC-address to an IP-configuration such as IP-address, gateway etc., the mapping from the client network node geo-location to a list of identifiers of other network nodes is performed.
With the method, geographical neighboring nodes 1 of a network can be reliably discovered independent of the specific network topology. This avoids limiting neighbor relationships to just neighboring network nodes which are reachable over the physical link either wired or wireless to which the requesting network node is directly attached. With the method, extensive preplanning efforts for radio networks plus extensive verification to a built radio network with subsequent adjustments to the planning and to the radio network node configurations can be avoided. Even in the absence of extensive preplanning efforts, a centralized control over the neighbor relationships between network nodes is retained.
In a possible embodiment, the usage of a portable positioning device 6, such as GPS-receiver, which needs to be connected only during the installation phase, allows that the network node 1 determines its position once to use the position thereafter as long as a position of the network node 1 does not change. The positioning device 6 which may be too expensive to be built into network node 1 can be reused for subsequent installations of other network nodes 1. In an alternative embodiment equipment that is anyway part of the network node 1, such as its own air interface or a wireless module attached to serve as a backup communication link is used as a positioning device 6. In a further embodiment, a mobile phone 6 carried by an installer can be used in conjunction with the mobile network positioning method to determine the position of the installed network node 1.
The invention has been described in detail with particular reference to preferred embodiments thereof and examples, but it will be understood that variations and modifications can be effected within the spirit and scope of the invention covered by the claims which may include the phrase “at least one of A, B and C” as an alternative expression that means one or more of A, B and C may be used, contrary to the holding in Superguide v. DIRECTV, 69 USPQ2d 1865 (Fed. Cir. 2004).
Number | Date | Country | Kind |
---|---|---|---|
07001338.8 | Jan 2007 | EP | regional |
This application is based on and hereby claims priority to PCT Application No. PCT/EP2008/050670 filed on Jan. 22, 2008 and EP Application No. EP07001338 filed on Jan. 22, 2007, the contents of which are hereby incorporated by reference.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/EP2008/050670 | 1/22/2008 | WO | 00 | 2/5/2010 |