WO2018233139A1 - Procédé, station de base et support d'informations permettant de sélectionner un nœud de tête de grappe - Google Patents

Procédé, station de base et support d'informations permettant de sélectionner un nœud de tête de grappe Download PDF

Info

Publication number
WO2018233139A1
WO2018233139A1 PCT/CN2017/104997 CN2017104997W WO2018233139A1 WO 2018233139 A1 WO2018233139 A1 WO 2018233139A1 CN 2017104997 W CN2017104997 W CN 2017104997W WO 2018233139 A1 WO2018233139 A1 WO 2018233139A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
target area
cluster head
nodes
target
Prior art date
Application number
PCT/CN2017/104997
Other languages
English (en)
Chinese (zh)
Inventor
马路娟
刘宏举
吕叶青
张传欣
Original Assignee
海信集团有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 海信集团有限公司 filed Critical 海信集团有限公司
Publication of WO2018233139A1 publication Critical patent/WO2018233139A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the present disclosure relates to the field of communications technologies, and in particular, to a method, a base station, and a storage medium for electing a cluster head node.
  • a local area network can be divided into multiple areas, and nodes (ie, devices) in each area form a cluster, and each cluster can include one or more nodes, and all nodes in each area form a cluster.
  • the nodes in the cluster can be further divided into cluster head nodes and cluster member nodes.
  • Cluster head nodes can be used to manage or control cluster member nodes throughout the cluster, as well as to coordinate work between cluster member nodes.
  • a method of electing a cluster head node comprising:
  • Determining a node included in the target area according to location information of a node in the target house and a range of the target area in the target house;
  • the area attribute information of the target area includes a number of nodes of the target area, a maximum side length, and an average distance of the node to the base station in the target area.
  • the number of the cluster head nodes corresponding to the target area is positively correlated with the number of nodes of the target area, and is positively correlated with the maximum side length of the target area, and the average distance from each node to the base station in the target area. It is inversely related.
  • the method for determining the number of cluster head nodes corresponding to the target area according to the area attribute information of the target area includes:
  • k opt is the number of cluster head nodes corresponding to the target area
  • n is the number of nodes of the target area
  • M is the maximum side length of the target area
  • the d toBS is the node to the base station in the target area. Average distance.
  • the target area is a room of the target house.
  • the cluster head node that elects the number of cluster head nodes in the node of the target area according to the contention value of the node in the target area includes:
  • the nodes ranked in the top N are elected as cluster head nodes, where N is the number of cluster head nodes.
  • the method further includes:
  • a base station comprising:
  • a node determining module configured to determine a node included in the target area according to location information of a node in the target house and a range of the target area in the target house;
  • a number determining module configured to determine, according to the area attribute information of the target area, a number of cluster head nodes corresponding to the target area;
  • a first election module configured to elect, according to a contention value of a node in the target area, a cluster head node of the number of cluster head nodes among nodes of the target area.
  • the area attribute information of the target area includes a number of nodes of the target area, a maximum side length, and an average distance of the node to the base station in the target area.
  • the number of the cluster head nodes corresponding to the target area is positively correlated with the number of nodes of the target area, and is positively correlated with the maximum side length of the target area, and the average distance from each node to the base station in the target area. It is inversely related.
  • the number determining module is specifically configured to determine, according to the following calculation formula, a number of cluster head nodes corresponding to the target area:
  • k opt is the number of cluster head nodes corresponding to the target area
  • n is the number of nodes of the target area
  • M is the maximum side length of the target area
  • the d toBS is the node to the base station in the target area. Average distance.
  • the target area is a room of the target house.
  • the first election module includes:
  • a sorting unit configured to sort nodes in the target area according to a competition value of nodes in the target area from large to small;
  • An election unit is configured to elect a node ranked in the top N as a cluster head node, where N is the number of cluster head nodes.
  • the base station after the base station elects the cluster head node, when the new node is detected to join the target area, the base station further includes:
  • a second election module configured to select a node ranked in the top N as a cluster head node in the new node and the cluster head node according to a competition value of the new node and the cluster head node in the target area, where N is the number of cluster head nodes.
  • a base station including:
  • a node determiner configured to determine a node included in the target area according to location information of a node in the target house and a range of the target area in the target house;
  • a number determining unit configured to determine, according to the area attribute information of the target area, a number of cluster head nodes corresponding to the target area;
  • the first electoral device is configured to elect a cluster head node of the number of cluster head nodes among nodes of the target area according to a contention value of a node in the target area.
  • the area attribute information of the target area includes a number of nodes of the target area, a maximum side length, and an average distance of the node to the base station in the target area.
  • the number of the cluster head nodes corresponding to the target area is positively correlated with the number of nodes of the target area, and is positively correlated with the maximum side length of the target area, and the average distance from each node to the base station in the target area. It is inversely related.
  • the number determiner is specifically configured to determine a number of cluster head nodes corresponding to the target area according to the following calculation formula:
  • k opt is the number of cluster head nodes corresponding to the target area
  • n is the number of nodes of the target area
  • M is the maximum side length of the target area
  • the d toBS is the node to the base station in the target area. Average distance.
  • the target area is a room of the target house.
  • the first electoralator includes:
  • a sorter configured to sort nodes in the target area according to a competition value of nodes in the target area from large to small;
  • the elector is configured to elect a node ranked in the top N as a cluster head node, where N is the number of cluster head nodes.
  • the base station after the base station elects the cluster head node, when the new node is detected to join the target area, the base station further includes:
  • a second arbitrator configured to select a node ranked in the top N as a cluster head node in the new node and the cluster head node according to a contention value of the new node and the cluster head node in the target area, where N is the number of cluster head nodes.
  • a base station including a processor and a memory, wherein the memory stores computer instructions executed by the processor to implement the first aspect or A method of electing a cluster head node as shown in its alternative implementation.
  • a computer readable storage medium having stored therein computer instructions executed by a processor to implement the first aspect described above or an alternative implementation thereof The method of electing a cluster head node is shown.
  • the computer readable storage medium may be a non-volatile storage medium.
  • a computer program product in which computer instructions are stored, the computer instructions being executed by a processor to implement the first aspect described above or an alternative implementation thereof The method of electing a cluster head node.
  • FIG. 1 is a flowchart of a method for electing a cluster head node according to an exemplary embodiment
  • FIG. 2 is a schematic diagram showing a region division according to an exemplary embodiment
  • FIG. 3 is a flowchart of a method for electing a cluster head node according to an exemplary embodiment
  • FIG. 4 is a schematic diagram of a cluster connection, according to an exemplary embodiment
  • FIG. 5 is a schematic diagram of a data transmission link according to an exemplary embodiment
  • FIG. 6 is a schematic diagram of a base station according to an exemplary embodiment
  • FIG. 7 is a schematic diagram of a base station according to an exemplary embodiment
  • FIG. 8 is a schematic structural diagram of a base station according to an exemplary embodiment.
  • Computer devices in a local area network are often referred to as nodes in a local area network.
  • the computer device ie, the node
  • the computer device may be a device such as a desktop computer, a laptop computer, a tablet computer, a mobile phone, a refrigerator, a television, a washing machine, an air conditioner, or a sensor.
  • a local area network can be divided into a plurality of clusters, and each cluster can include a plurality of nodes (for example, computer devices).
  • the number of cluster head nodes in each area contained in a local area network is one. This may result in too many or too few cluster member nodes carried by a cluster head node in some areas, thereby affecting communication efficiency within the cluster.
  • the embodiment of the present disclosure provides a method for electing a cluster head node, in which, before electing a cluster head node, first, it is necessary to determine the number of cluster head nodes corresponding to the target area according to the area attribute information of the target area, thereby The number of corresponding cluster head nodes can be flexibly determined for each area according to the attribute information of the target area.
  • the method for electing a cluster head node provided by an embodiment of the present disclosure may be implemented by a base station.
  • a base station in an embodiment of the present disclosure may include components such as a processor, a memory, a transceiver, and the like.
  • the processor may be a CPU (Central Processing Unit) or the like, and may be used for calculating the number of cluster head nodes in the target area and calculating the contention value of each node.
  • the memory may be a RAM (Random Access Memory), a Flash (Flash Memory), or the like, and may be used to store received data, data required for processing, data generated during processing, and the like.
  • the transceiver can be used for data transmission with nodes and other base stations.
  • the transceiver can include an antenna, a matching circuit, a radio frequency circuit, and the like.
  • An exemplary embodiment of the present disclosure provides a method for electing a cluster head node. As shown in FIG. 1 , the processing flow of the method may include the following steps:
  • Step S110 Determine a node included in the target area according to the location information of the node in the target house and the range of the target area in the target house.
  • the base station may pre-store a floor plan of the target house, where the floor plan includes location information and size of each room. Then, the base station can receive each node The location information of each node passed. Then, the base station may determine, according to the floor plan of the target house and the location information of each node, which locations in each of the target houses are specifically located. Finally, determine the nodes included in the target area in the target house. For example, as shown in Figure 2, the target house includes a bathroom, a kitchen, two bedrooms, and a living room. If the living room in the target house is the target area, the area 6 corresponding to the living room includes six nodes, and it can be determined that they are node A, node B, node C, node D, node E, and node F, respectively.
  • the target area may be a room of the target house.
  • the division in the process of dividing the area, the division is performed in units of rooms in the target house, for example, dividing the bathroom into one area and dividing the living room into another area. This ensures that there is no wall penetration in any area that is divided, and the internal communication of the cluster in any area will not pass through the wall, thus avoiding signal attenuation and communication caused by communication through the wall. The problem of performance degradation.
  • Step S120 Determine the number of cluster head nodes corresponding to the target area according to the area attribute information of the target area.
  • the size of the divided area may be different, so it is possible to elect a cluster head node in the area to make a cluster head.
  • the node member nodes carried by the node are too many or too few, which affects the communication efficiency within the cluster.
  • the area attribute information of the target area includes a number of nodes of the target area, a maximum side length, and an average distance of the node to the base station in the target area.
  • the number of cluster head nodes corresponding to the target area is positively correlated with the number of nodes in the target area, and is positively correlated with the maximum side length of the target area, and inversely related to the average distance of each node to the base station in the target area.
  • the number of cluster head nodes corresponding to the target area is positively correlated with the number of nodes in the target area and positively correlated with the maximum side length of the target area. It can be understood that the number of nodes in the target area and/or the maximum side length of the target area increases, and the target The number of cluster head nodes corresponding to the region increases accordingly; the number of cluster head nodes corresponding to the target region is inversely related to the average distance from each node to the base station in the target region, which can be understood as the average distance from each node to the base station in the target region. Small, the number of cluster head nodes corresponding to the target area decreases. Optionally, the number of nodes in the target area is also available.
  • the maximum side length of the target area and the average distance from each node to the base station in the target area are set to a constant weight, or the number of nodes in the target area, the maximum side length of the target area, or the average distance from each node to the base station in the target area may be performed. Square or square and so on.
  • step S120 may include: determining a number of cluster head nodes corresponding to the target area according to the following calculation formula:
  • k opt is the number of cluster head nodes corresponding to the target area
  • n is the number of nodes of the target area
  • M is the maximum side length of the target area
  • d toBS is the average distance of each node in the target area to the base station. It should be noted that M may be the maximum side length in the boundary line of the target area.
  • weights can be set for M and d toBS , and the above formula 1 is adjusted to: Where a and b are the constant weights of M and d toBS , respectively; or, the weight is set in the part of n, and the above formula 1 is adjusted to: Where c is the weight of the number of nodes in the target area.
  • the values of the above-mentioned constants a, b, and c may be determined according to actual conditions, for example, may be obtained from multiple test data, or obtained according to experience, and are not limited in the embodiment of the present invention.
  • the living room corresponding to the area 6 is 10 meters long and 5 meters wide, and the maximum side length is 10 meters.
  • d toBS is a statistical data. Specifically, in planning and erecting a base station, the distance from the surrounding location to the base station is counted. For example, if a residential X cell is 5 kilometers away from the base station, it can be in the memory of the base station. The identifier corresponding to a certain residential X cell is stored in the distance list corresponding to the distance between the base station and a residential X cell.
  • the base station When the base station obtains an identifier corresponding to a residential X-cell, it may perform an inquiry according to the identifier corresponding to a residential X-cell in the distance list to determine a base station corresponding to a certain residential X-cell and a certain residential X. The distance of the cell. When the base station acquires the location information of each node, it can roughly determine which location the nodes are from, and roughly determine the average distance d toBS of the location to the base station.
  • the above formula 1 can be obtained by combining the following formulas 2 to 6, and performing a first-order derivation of the parameter k therein, and making the derivation result 0.
  • Equation 2 is as follows:
  • E CH is the total energy consumed by all cluster head nodes in a cluster in the target area
  • n is the number of nodes in the target area
  • k is the number of cluster head nodes corresponding to the target area
  • E DA is required for data fusion of the cluster head node energy consumption, d toBS each node as a target area from the base station to the average
  • E elec circuit to transmit or receive circuitry of each cluster head transmits 1-bit data or receive energy consumed, ⁇ fs depending transmit circuitry or
  • L is the number of bits of data that needs to be transmitted.
  • E CH , k, L are unknown parameters.
  • E DA and Elec are test data.
  • the performance of the node can be tested, including testing of the nodes E DA and Elec . After multiple tests, the test values of E DA and Elec will be obtained.
  • the user's manual can be directly queried to know E DA and Elec. .
  • values corresponding to the respective E DA and Elec can be stored in advance in the memory of each node. When the base station needs to obtain these values, it can be directly sent to the base station.
  • Equation 3 is as follows:
  • E nonCH L ⁇ E elec +L ⁇ fs ⁇ d 2 tocH (Equation 3)
  • Equation 4 E nonCH is the total energy consumed by all cluster member nodes in a cluster in the target area
  • d toCH is the distance from the cluster member node to the cluster head node.
  • ⁇ (x, y) is the distribution density function of the node
  • x and y are the position coordinates of each node in the target area.
  • Equation 5 is as follows:
  • E cluster is the total energy consumed by all nodes in a cluster in the target area.
  • Equation 6 is as follows:
  • E tot is the total energy consumed by all nodes in the target area.
  • Step S130 selecting a cluster head node of the number of cluster head nodes in the nodes of the target area according to the contention value of the nodes in the target area.
  • the embodiment may provide a contention value algorithm for calculating the contention value of each node in the target area.
  • a contention value algorithm for calculating the contention value of each node in the target area.
  • the node may first confirm which nodes participate in the election of the cluster head node, and do not perform the calculation of the contention value for the nodes that do not need to participate in the election of the cluster head node. Specifically, it may be first determined whether the node is a node with strong communication capability.
  • a node that uses cellular communication can be used as a node with strong communication capabilities, such as a mobile phone using a SIM card communication.
  • the remaining nodes that use WiFi, Bluetooth, Zigbee, and D2D (Device-to-Device Communication) communication can be used as nodes with weak communication capabilities.
  • the above distinctions for the communication capabilities of the nodes are mainly based on the distance of their communication.
  • a mobile phone can be connected to a base station outside of a kilometer via a cellular network, however, the tablet can only be connected to a router within 30 meters via WiFi.
  • the communication capacity of mobile phones is far greater than the communication capabilities of tablet computers.
  • the node having strong communication capability included in the target area is determined according to the judgment result of the communication capability of the node. Then, it can be determined whether these nodes with strong communication capabilities have established a connection with the base station. If so, it is determined that the node that has established a connection with the base station participates in the election of the cluster head node.
  • the contention value of the nodes participating in the election of the cluster head node in the target area is calculated.
  • the contention value of the node may be calculated by the signal connection strength of the node and the base station, and the node link information.
  • the signal connection strength between the node and the base station can be obtained by directly receiving the strength information sent by the node.
  • the node link information includes the connectivity, the load size, the remaining energy of the node, the remaining bandwidth of the node, and the lifetime of the node.
  • the degree of connectivity may be one of neighboring nodes of the node The number of hop nodes. The remaining energy of the node and the remaining bandwidth of the node can be obtained directly from the node.
  • the node lifetime represents the time at which the moving node can exist in the target area. Firstly, the position information of the node can be determined by the position information of the node, and then the time required for the node to move out of the target area according to the motion speed of the node is the node survival time.
  • the formula for calculating the load size can be seen in Equation 7:
  • Q max is the largest data queue length in node i in the target area that needs to be transmitted
  • Q avg (t) is the average data to be transmitted by node i in the target area from t- ⁇ t to t time. Queue size.
  • Equation 8 The method for calculating the contention value of a node by the signal connection strength of the node and the base station and the link information of the node can be seen in Equation 8:
  • N is the number of nodes participating in the election of the cluster head node
  • p j is the normalized value of each parameter included in the link information of the node, such as the degree of connectivity, the size of the load, the remaining energy of the node, the remaining bandwidth of the node, and the lifetime of the node
  • w Indicates the weight corresponding to each parameter.
  • different parameters and their weights can be determined according to different application environments.
  • the node in the target area may also send the network topology map of the neighboring node to the base station.
  • the base station can obtain a network topology diagram of the entire target house according to the network topology map of the node in the target area and the neighboring neighbor nodes.
  • step S130 may include: step S310, sorting nodes in the target area according to the contention value of the nodes in the target area from large to small; and step S320, selecting the node ranked in the top N as the cluster head node.
  • N is the number of cluster head nodes and N is an integer greater than or equal to 1.
  • the target area is the area 6, and the nodes are sorted according to the competition value of each node in the area 6 from large to small, and the ranking result is: node C, node E, node F, Node A, Node D, Node B. If the number of cluster head nodes is 2, node C and node E ranked in the top 2 positions can be elected as cluster head nodes.
  • the cluster head node C can be The surrounding nodes A and B serve as their cluster member nodes, and node D and node F around the cluster head node E can be used as their cluster member nodes.
  • clustering may be performed according to the size of data transmitted by other nodes than the cluster head node.
  • node A is a television
  • node B is a temperature sensor
  • node D is a computer
  • node F is a humidity sensor.
  • the amount of data that TVs and computers need to transmit is large, and the amount of data that temperature sensors and humidity sensors need to transmit is small.
  • nodes with a large amount of data can be separated according to the amount of data to be transmitted, so that they are in a cluster at the same time, and the cluster head node cannot effectively process the data of the cluster member nodes in the cluster.
  • a television and a temperature sensor around the cluster head node C can be used as its cluster member node
  • a computer and a humidity sensor around the cluster head node E can be used as its cluster member node.
  • the base station sends the election result and the clustering result to the nodes participating in the election of the cluster head node.
  • the unsuccessful node can disconnect from the base station and connect to its cluster head node instead.
  • the node that selects the cluster head node can notify its cluster member node to establish a connection with itself.
  • the optimal node can also be continuously updated as a cluster head node.
  • the method provided by the embodiment further includes: according to the competition value of the new node and the cluster head node in the target area, the new node and The cluster head node elects the node ranked in the first N bits as the cluster head node, where N is the number of cluster head nodes.
  • the contention value of the new node may be calculated, according to the new node in the target area and the competition value of each cluster head node, in the new node and each cluster.
  • the node in the top N position is elected as the cluster head node.
  • another method of updating an optimal node as a cluster head node may be provided. After each predetermined time T, the competition value of the nodes in the target area is recalculated, and the election of the cluster head nodes is performed again according to the new competition value.
  • the base station can be connected to the cluster head node, and the cluster head node can be connected to its cluster member node. Communication can also take place between cluster head nodes.
  • the base station may send the network topology map of the entire target house to each node, and each node may be based on the network topology of the entire target house.
  • the graph calculates the routing table. If the node is communicating within the local area network of the home, each node can determine how to send data from the source node to the destination node by querying the routing table. It should be noted that, in the local area network, in addition to the cluster member nodes directly connected to the cluster head node, there are secondary cluster member nodes that cannot be directly connected to the cluster head node, and they need to pass between them. Communication and transmission of data with communication between cluster member nodes that can be directly connected to the cluster head node. Therefore, there may be multiple paths from the source node to the destination node.
  • the data to be transmitted may be divided into three parts, and data transmission is performed through three preferred paths.
  • the node when the node receives any data packet, it can determine whether it is the destination node, and if so, unpack the data packet, if not, determine whether it is the first time to receive the data packet. If the packet is received for the first time, the packet is directly forwarded. If the packet is not received for the first time, it is determined whether the path of the second transmission of the packet intersects with the path of the first transmission, and if so, the packet is discarded. For example, as shown in FIG.
  • the source node sends the data packet Bag from the node A to the node B, and the node B determines that the data packet is received for the first time, and the source node sends the data packet Bag again from the node C to the node B.
  • the Node B determines that the data packet is not received for the first time, it determines whether the path of the second transmission intersects with the path of the first transmission.
  • the data packet Bag is sent from the source node to the node A for the first time and then to the node B and then to the node D.
  • the data packet Bag is sent from the source node to the node C and then to the node B and then to the node.
  • the two paths are intersected, and the intersection point is the node B, so the packet of the packet can be discarded to avoid repeatedly sending the packet to the destination node and wasting the communication resources of the local area network.
  • the cluster head node of the source node needs to forward the data to the base station, and then the base station forwards the data to the network where the destination node is located.
  • the number of cluster head nodes corresponding to the target area is determined according to the area attribute information of the target area, and the number of the cluster head nodes is determined according to the area attribute information of the target area, and the target area is determined for different ranges. If there are different area attributes, the area attribute information is also different, and then the number of cluster head nodes obtained is determined according to the target area attribute.
  • the number of dynamically changing cluster head nodes is more suitable than the fixed number of cluster head nodes. Target areas in different ranges.
  • a further exemplary embodiment of the present disclosure provides a base station, as shown in FIG. 6, the base station includes:
  • a node determining module 610 configured to determine, according to location information of a node in the target house and a range of the target area in the target house, a node included in the target area;
  • the number determining module 620 is configured to determine, according to the area attribute information of the target area, the number of cluster head nodes corresponding to the target area;
  • the first election module 630 is configured to elect, according to a contention value of a node in the target area, a cluster head node of the number of cluster head nodes among nodes of the target area.
  • the area attribute information of the target area includes a number of nodes of the target area, a maximum side length, and an average distance of the node to the base station in the target area.
  • the number of the cluster head nodes corresponding to the target area is positively correlated with the number of nodes of the target area, and is positively correlated with the maximum side length of the target area, and the average distance from each node to the base station in the target area. It is inversely related.
  • the number determining module 620 is specifically configured to determine, according to the following calculation formula, a number of cluster head nodes corresponding to the target area:
  • k opt is the number of cluster head nodes corresponding to the target area
  • n is the number of nodes of the target area
  • M is the maximum side length of the target area
  • the d toBS is the node to the base station in the target area. Average distance.
  • the target area is a room of the target house.
  • the first election module 630 includes:
  • a sorting unit 731 configured to sort nodes in the target area according to a competition value of nodes in the target area from large to small;
  • the election unit 732 is configured to elect a node ranked in the top N as a cluster head node, where N is the number of cluster head nodes.
  • the base station after the base station elects the cluster head node, when the new node is detected to join the target area, the base station further includes:
  • a second election module configured to select a node ranked in the top N as a cluster head node in the new node and the cluster head node according to a competition value of the new node and the cluster head node in the target area, where N is the number of cluster head nodes.
  • the number of cluster head nodes corresponding to the target area is determined according to the area attribute information of the target area, and the number of the cluster head nodes is determined according to the area attribute information of the target area, and the target area is determined for different ranges. If there are different area attributes, the area attribute information is also different, and then the number of cluster head nodes obtained is determined according to the target area attribute.
  • the number of dynamically changing cluster head nodes is more suitable than the fixed number of cluster head nodes. Target areas in different ranges.
  • the method for electing a cluster head node provided by the foregoing embodiment is only exemplified by the division of the foregoing functional modules when the cluster head node is elected. In actual applications, the foregoing functions may be allocated differently according to requirements.
  • the function module is completed, that is, the internal structure of the base station is divided into different functional modules to complete all or part of the functions described above.
  • the method for the base station and the method for electing the cluster head node in the foregoing embodiment are the same. The specific implementation process is described in the method embodiment, and details are not described herein again.
  • the embodiment of the present disclosure further provides a base station, where the base station includes:
  • a node determiner configured to determine a node included in the target area according to location information of a node in the target house and a range of the target area in the target house;
  • a number determining unit configured to determine, according to the area attribute information of the target area, a number of cluster head nodes corresponding to the target area;
  • the first electoral device is configured to elect a cluster head node of the number of cluster head nodes among nodes of the target area according to a contention value of a node in the target area.
  • the area attribute information of the target area includes a number of nodes of the target area, a maximum side length, and an average distance of the node to the base station in the target area.
  • the number of the cluster head nodes corresponding to the target area is positively correlated with the number of nodes of the target area, and is positively correlated with the maximum side length of the target area, and the average distance from each node to the base station in the target area. It is inversely related.
  • the number determiner is specifically configured to determine a number of cluster head nodes corresponding to the target area according to the following calculation formula:
  • k opt is the number of cluster head nodes corresponding to the target area
  • n is the number of nodes of the target area
  • M is the maximum side length of the target area
  • the d toBS is the node to the base station in the target area. Average distance.
  • the target area is a room of the target house.
  • the first electoralator includes:
  • a sorter configured to sort nodes in the target area according to a competition value of nodes in the target area from large to small;
  • the elector is configured to elect a node ranked in the top N as a cluster head node, where N is the number of cluster head nodes.
  • the base station after the base station elects the cluster head node, when the new node is detected to join the target area, the base station further includes:
  • a second arbitrator configured to select a node ranked in the top N as a cluster head node in the new node and the cluster head node according to a contention value of the new node and the cluster head node in the target area, where N is the number of cluster head nodes.
  • Embodiments of the present disclosure provide a base station including a processor and a memory, where the computer instructions are stored in the memory, and the computer instructions are executed by the processor to implement the method for electing the cluster head node shown in the above disclosed embodiments.
  • FIG. 8 it is a schematic structural diagram of a base station 900, which includes a processor 902 and a memory 904.
  • the processor 902 typically controls the overall operation of the base station 900, and the processor 902 can be used to execute computer instructions to perform all or part of the steps of the method of electing a cluster head node as disclosed in the above-described disclosed embodiments.
  • the processor 902 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. It is possible to implement or perform various illustrative logical blocks, modules and circuits described in connection with the embodiments of the present disclosure.
  • the processor can also be a combination of computing functions, for example, including one or more microprocessor combinations, a combination of a DSP and a microprocessor, and the like.
  • Memory 904 can be configured to store various types of data to support operation at base station 900. Examples of such data include instructions for any application or method operating on base station 900.
  • Memory 904 can be implemented by any type of volatile or non-volatile storage device, or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), Erasable Programmable Read Only Memory (EPROM), Programmable Read Only Memory (PROM), Read Only Memory (ROM), Magnetic Memory, Flash Memory, Disk or Optical Disk.
  • SRAM static random access memory
  • EEPROM electrically erasable programmable read-only memory
  • EPROM Erasable Programmable Read Only Memory
  • PROM Programmable Read Only Memory
  • ROM Read Only Memory
  • Magnetic Memory Flash Memory
  • Disk Disk or Optical Disk.
  • Communication component 906 is configured to facilitate wired or wireless communication between base station 900 and other devices.
  • the base station 900 can access a wireless network based on a communication standard, such as 2G, 3G or 4G, or a combination thereof.
  • base station 900 may be implemented by one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable A gate array (FPGA), controller, microcontroller, microprocessor or other electronic component implementation for performing the method of electing a cluster head node as described in the above embodiments of the present disclosure.
  • ASICs application specific integrated circuits
  • DSPs digital signal processors
  • DSPDs digital signal processing devices
  • PLDs programmable logic devices
  • FPGA field programmable A gate array
  • controller microcontroller, microprocessor or other electronic component implementation for performing the method of electing a cluster head node as described in the above embodiments of the present disclosure.
  • the computer readable storage medium having stored thereon computer instructions, wherein instructions in the storage medium are executed by a processor to perform electoral clusters as disclosed in the above disclosed embodiments The method of the head node.
  • the computer readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device.
  • the computer readable storage medium may be a non-volatile storage medium.
  • the embodiment of the present disclosure further provides a computer program product, wherein the computer program product stores a computer instruction, and the computer instruction is executed by a processor to implement the method for electing a cluster head node shown in the above disclosed embodiment.

Landscapes

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

Abstract

La présente invention se rapporte au domaine technique des communications et concerne un procédé, une station de base et un support d'informations permettant de sélectionner un nœud de tête de grappe. Le procédé consiste : à déterminer, en fonction d'informations de position de nœuds dans une maison cible et d'une zone d'une région cible dans la maison cible, des nœuds contenus dans la région cible de la maison cible ; à déterminer, en fonction d'informations d'attribut de région de la région cible, un nombre de nœuds de tête de grappe correspondant à la région cible ; et à sélectionner, en fonction des valeurs de compétition des nœuds dans la région cible, un nombre de nœuds de tête de grappe de nœuds de tête de grappe issus des nœuds dans la région cible. Pour des régions cibles présentant différentes zones, les régions cibles possèdent des attributs de région différents et des informations d'attribut de région différentes, et par conséquent, un nombre de nœuds de tête de grappe déterminé varie en fonction d'un attribut d'une région cible. Ainsi, la présente invention permet à un nombre dynamique de nœuds de tête de grappe de mieux s'adapter à des régions cibles présentant différentes zones qu'un nombre fixe de nœuds de tête de grappe.
PCT/CN2017/104997 2017-06-20 2017-09-30 Procédé, station de base et support d'informations permettant de sélectionner un nœud de tête de grappe WO2018233139A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710471798.1A CN107071849B (zh) 2017-06-20 2017-06-20 一种选举簇头节点的方法和装置
CN201710471798.1 2017-06-20

Publications (1)

Publication Number Publication Date
WO2018233139A1 true WO2018233139A1 (fr) 2018-12-27

Family

ID=59594429

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/104997 WO2018233139A1 (fr) 2017-06-20 2017-09-30 Procédé, station de base et support d'informations permettant de sélectionner un nœud de tête de grappe

Country Status (2)

Country Link
CN (1) CN107071849B (fr)
WO (1) WO2018233139A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107071849B (zh) * 2017-06-20 2020-08-04 海信集团有限公司 一种选举簇头节点的方法和装置
CN111586789A (zh) * 2020-05-19 2020-08-25 北京理工大学 一种数据的传输方法、装置、计算机设备及存储介质
CN113588001A (zh) * 2021-08-12 2021-11-02 上海宏英智能科技股份有限公司 一种工程机械状态监测系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729331A (zh) * 2008-10-28 2010-06-09 华为技术有限公司 成簇方法与装置、簇头与基站的路由方法与装置
CN102176149A (zh) * 2011-02-24 2011-09-07 浙江工业大学 基于无线传感器网络的智能楼宇能耗监测系统
CN102695190A (zh) * 2012-05-16 2012-09-26 东南大学 一种无线传感器网络中的数据采集方法
CN103826282A (zh) * 2014-02-24 2014-05-28 南昌大学 基于剩余能量的集合划分多跳路由方法
CN105704775A (zh) * 2016-01-13 2016-06-22 湖南工业大学 一种改进的低能量自适应分簇路由协议方法
CN107071849A (zh) * 2017-06-20 2017-08-18 海信集团有限公司 一种选举簇头节点的方法和装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102036308B (zh) * 2010-12-09 2013-04-17 江南大学 一种能量均衡的无线传感器网络分簇方法
CN104144425B (zh) * 2013-05-08 2020-06-12 索尼公司 无线通信系统中的网络管理装置、方法和装置

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729331A (zh) * 2008-10-28 2010-06-09 华为技术有限公司 成簇方法与装置、簇头与基站的路由方法与装置
CN102176149A (zh) * 2011-02-24 2011-09-07 浙江工业大学 基于无线传感器网络的智能楼宇能耗监测系统
CN102695190A (zh) * 2012-05-16 2012-09-26 东南大学 一种无线传感器网络中的数据采集方法
CN103826282A (zh) * 2014-02-24 2014-05-28 南昌大学 基于剩余能量的集合划分多跳路由方法
CN105704775A (zh) * 2016-01-13 2016-06-22 湖南工业大学 一种改进的低能量自适应分簇路由协议方法
CN107071849A (zh) * 2017-06-20 2017-08-18 海信集团有限公司 一种选举簇头节点的方法和装置

Also Published As

Publication number Publication date
CN107071849A (zh) 2017-08-18
CN107071849B (zh) 2020-08-04

Similar Documents

Publication Publication Date Title
CN108574970B (zh) 父节点选择方法、网络节点及系统
US20050054346A1 (en) Load leveling in mobile ad-hoc networks to support end-to-end delay reduction, QoS and energy leveling
CN109257319B (zh) 物联网、及其路由、分配标识的方法、装置及设备、介质
WO2018233139A1 (fr) Procédé, station de base et support d'informations permettant de sélectionner un nœud de tête de grappe
TWI721264B (zh) 建立在路由始發節點和路由目的節點之間的雙向路由的方法
CN111436030A (zh) 数据用量上报的方法、装置及系统
KR20150084647A (ko) 상호-청취자 장치 세트에 대하여 가상 인터페이스를 설정하는 방법 및 장치
CN110167198A (zh) 确定协议数据单元会话服务网元的方法和装置
WO2018233138A1 (fr) Procédé, appareil informatique et support de stockage pour sélectionner un nœud de tête de grappe
TW201944801A (zh) 行動通訊中選擇小區之方法及其裝置
JP2010045525A (ja) 無線アドホックネットワークにおける自律的なグループ構築方法及びこの方法を用いたデータ配信方法とデータ収集方法
CN108370610A (zh) 密集网格网络中的干扰减轻
US11064335B2 (en) Method and apparatus for transmitting or receiving data by using bluetooth low energy technology
Fabian et al. Fuzzy-based objective function for routing protocol in the internet of things
KR20210010574A (ko) 서비스 품질 모니터링 방법 및 시스템, 및 장치
CN108390824B (zh) 自组网络路径构筑系统及节点
Mu An improved AODV routing for the zigbee heterogeneous networks in 5G environment
JP2017175619A (ja) 無線ネットワーク構築用補助装置、携帯端末及び無線ネットワーク構築方法
JP2013132052A (ja) パートナー発見・選択方法、装置およびシステム
EP3266252B1 (fr) Prédiction de disponibilité de points d'accès
JP2017532840A (ja) 近傍に基づいて管理される無線送受信機
US20130290560A1 (en) Systems and methods for determining routes in networks
TW201703472A (zh) 異質性網路系統、網路裝置及其聚合路徑選擇方法
WO2014185768A1 (fr) Procédé de routage dépendant du spectre dans un réseau maillé et système dérivé de celui-ci
WO2019104483A1 (fr) Procédé et appareil pour sélectionner un nœud de routage

Legal Events

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

Ref document number: 17914817

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17914817

Country of ref document: EP

Kind code of ref document: A1