WO2010055602A1 - Système de réseau - Google Patents

Système de réseau Download PDF

Info

Publication number
WO2010055602A1
WO2010055602A1 PCT/JP2009/004338 JP2009004338W WO2010055602A1 WO 2010055602 A1 WO2010055602 A1 WO 2010055602A1 JP 2009004338 W JP2009004338 W JP 2009004338W WO 2010055602 A1 WO2010055602 A1 WO 2010055602A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
nodes
moving
coupled
network system
Prior art date
Application number
PCT/JP2009/004338
Other languages
English (en)
Japanese (ja)
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 日本電気株式会社
Priority to JP2010537664A priority Critical patent/JP5392265B2/ja
Publication of WO2010055602A1 publication Critical patent/WO2010055602A1/fr

Links

Images

Classifications

    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition

Definitions

  • the present invention relates to a network system that constructs a network topology by autonomously distributed operation of a plurality of nodes having a communication function and a movement function.
  • each wireless node In constructing an ad-hoc network by wireless communication, each wireless node basically forms a network topology in an autonomous and distributed manner, and exchanges information therein.
  • the sensor network is composed of a plurality of sensor nodes equipped with sensors, and is used to collect real-world information such as temperature simultaneously over a wide area.
  • sensor networks may be expensive, and there is a special node called a sink node that has functions for collecting information from sensor nodes and distributing information to sensor nodes. Information was collected directly from the sensor nodes and the control information was distributed to them.
  • a sensor network can be regarded as a network in which a wireless node in the wireless network described above has a sensor function.
  • each sensor node collects and distributes information by communicating with other adjacent sensor nodes.
  • the topology of the sensor network is such that at least one other sensor node exists in a communicable area determined by a circle whose radius is a communicable distance determined by the performance of the wireless communication function centered on each sensor node. Must be determined. However, if the area that can be sensed by the sensor of the sensor node is smaller than the communicable area and the target area is sensed at high density, the distance between adjacent sensor nodes must be shorter than the communicable distance. There is.
  • the method of configuring a network topology that satisfies the above conditions is based on the premise that each sensor node can move autonomously and a static topology configuration method that assumes that each sensor node does not move. And a dynamic topology configuration method.
  • a typical example of a static topology configuration method is a method of distributing sensor nodes at high density or a method of manually installing sensor nodes.
  • density density is likely to occur.
  • Sensor nodes are wasted at high density locations.
  • the method of installing by hand is difficult to apply when sensing a place where a person cannot easily step on, such as a mountain or a forest, in addition to requiring a lot of manpower.
  • the dynamic topology configuration method has many advantages over the static topology configuration method, such as the ability to configure the network topology by autonomously distributed operation of each node without human intervention.
  • the present invention relates to such a dynamic topology configuration method.
  • each sensor node has an Expand state and a Bridge state that search for neighboring nodes while moving using a moving function, and a Stay state in which the movement is stopped.
  • Two or more nodes that are independent of each other not having a neighboring node and not having a neighboring node relationship with each other in the Bridge state when transitioning to the Stay state occurs when connection to neighboring nodes in one State state becomes possible
  • the connection becomes possible the state does not matter
  • the state transitions to the Stay state together with these two or more nodes, and each node dynamically switches between the Expand state and the Bridge state while staying
  • a network topology is formed by transitioning to a state.
  • the neighboring node whose radio wave intensity exceeds a predetermined value and the neighboring node whose radio wave intensity falls below a predetermined value try to avoid connection relationships.
  • An object of the present invention is to provide a gap that is not covered by any node inside a closed curve surrounding all nodes in a network system that constructs a network topology by autonomously distributed operation of a plurality of nodes having communication functions and mobile functions. It is to construct a network topology so as to prevent as much as possible.
  • the network system of the present invention A network system comprising a plurality of nodes provided with communication means and movement means, Each node searches for other neighboring nodes capable of communicating by the communication means while moving using the moving means, and joins with the searched other nodes while maintaining a predetermined condition.
  • the network system construction method of the present invention includes: A method of constructing a network system composed of a plurality of nodes provided with communication means and movement means, Each node searches for other neighboring nodes capable of communicating by the communication means while moving using the moving means, and joins with the searched other nodes while maintaining a predetermined condition. Creates a cluster consisting of two or more nodes, Each node constituting the cluster searches for another node in the vicinity that can communicate with the communication unit while moving using the moving unit while maintaining the combined state of the connected nodes. It joins with this searched other node while maintaining an interval that satisfies the predetermined condition. The structure is taken.
  • the node device of the present invention A node device comprising communication means, movement means and control means, Under the control of the control means, a search is made for other nearby nodes capable of communication by the communication means while moving using the moving means, and an interval satisfying a predetermined condition is maintained with the other searched nodes.
  • a search is made for other nearby nodes capable of communication by the communication means while moving using the moving means, and an interval satisfying a predetermined condition is maintained with the other searched nodes.
  • the program of the present invention A computer constituting a node device including a communication unit and a movement unit, 2 or more by searching for other neighboring nodes capable of communicating by the communication means while moving by using the moving means, and combining the searched other nodes with an interval satisfying a predetermined condition. Further, another node in the neighborhood that can communicate with the communication unit while moving using the moving unit while maintaining the coupled state of the coupled nodes is generated.
  • a control means for performing control to search for and combine with other searched nodes while maintaining an interval satisfying the predetermined condition It is a program that functions as
  • a network topology in which a void that is not covered by any node is generated as much as possible inside a closed curve that surrounds all the nodes by autonomously distributed operation of a plurality of nodes.
  • the 1st Embodiment of this invention it is a figure which shows an example of the formula which describes the moving speed and the direction of a movement of a two-dimensional random walk.
  • the 1st Embodiment of this invention it is a schematic diagram of the initial state suitably scattered in the area which many sensor nodes want to sense.
  • bonded In the 1st Embodiment of this invention, it is a schematic diagram which shows a state when the cluster comprised from two sensor nodes and one sensor node each approached and couple
  • FIG. 3 is a schematic diagram illustrating a state in which three sensor nodes are coupled to each other to form a regular triangular cluster in the first embodiment of the present invention. It is a schematic diagram which shows a mode that the cluster with a space
  • a moving method for quickly transitioning a cluster in which three sensor nodes are connected in a row to a cluster in which three sensor nodes are connected to each other to form a regular triangle It is a schematic diagram which shows. It is a block diagram of the network system which concerns on the 2nd Embodiment of this invention.
  • a sensor node 10 constituting a network system includes a sensor function unit 11, a wireless communication function unit 12, a movement function unit 13, a storage unit 14, and a control unit 15. ing.
  • the sensor function unit 11 includes sensors for collecting real-world environmental information such as a temperature sensor and a pressure sensor.
  • the wireless communication function unit 12 has a function of performing wireless communication with other sensor nodes according to IEEE802.11, Bluetooth (registered trademark), and other arbitrary communication protocols.
  • the wireless communication function unit 12 has a direction detection function that detects from which direction the communication partner has seen wireless communication as viewed from its own node.
  • the direction of the other node viewed from the own node can be measured, for example, by rotating the antenna with strong directivity and the antenna rotation angle when receiving the radio wave from the target other node at the highest level.
  • the movement function unit 13 is configured by a mechanism such as a wheel, a belt conveyor, or a movable leg, and has a function of moving the node 10 at a movement direction and a movement speed instructed from the control unit 15.
  • the storage unit 14 is configured by a semiconductor memory, a magnetic disk, or the like, and stores a density value, a binding list, etc., which will be described later, and a program for controlling the operation of the sensor node 10.
  • the control unit 15 is configured by a CPU or the like, and reads a program stored in the storage unit 14 and executes the program, thereby performing a sensing operation by the sensor function unit 11, a wireless communication operation by the wireless communication function unit 12, and a moving function. It controls the entire node including the movement operation by the unit 13.
  • FIG. 2 is a flowchart showing an example of a control operation by the control unit 15.
  • the operation of the sensor node 10 according to the present embodiment will be described with reference to FIG.
  • the control unit 15 of the sensor node 10 performs an initial setting process when activated by power-on or the like (step S101).
  • the density value of the own node stored in the storage unit 14 is set to an initial value of 1.
  • the density value is a variable that is increased or decreased according to the number of other nodes coupled to the own node.
  • the value is incremented by 1 when not coupled to any other node, and then incremented by 1 each time coupled to one other node.
  • the concentration value decreases conversely.
  • the combined list stored in the storage unit 14 is set to NULL.
  • the combined list is a list of identifiers of other nodes that are combined with the own node.
  • control unit 15 determines whether the density value of the node 10 is 1, 2, or 3 or more (steps S102 and S103), and performs control according to the determined density value.
  • step S102 When the density value is 1 (YES in step S102), that is, when the own node 10 is not coupled to any other node, the control unit 15 until the other node is found. Control for searching for another node by a two-dimensional random walk is performed (steps S105 and S106).
  • control unit 15 determines a random moving direction and moving speed by, for example, a random number, and instructs the moving function unit 13 to determine the moving direction and moving speed, so that the node 10 is two-dimensional. Random walk.
  • a search message including the current concentration value of the own node 10 and the identifier of the own node is transmitted to the surroundings by broadcast communication through the wireless communication function unit 12 at a fixed period, while receiving a search message from another node. Monitor.
  • each sensor node 10 can communicate only with other nodes existing in a circle having a radius Lr centered on the own node.
  • the search for another node is an operation for checking whether or not there is another node that is not connected to the own node in this circle by transmitting and receiving a search message to each other.
  • the control unit 15 receives the search message from another node whose identifier is not described in the link list of the own node (YES in step S106), that is, the own node and the node not within the circle of radius Lr centered on the own node.
  • a connected other node it is determined whether the number of found other nodes is singular or plural (step S112). If the number is one, a search response message including an identifier of the own node for the found other node. Is transmitted to bring the own node 10 and other nodes into a coupled state, and at the same time, the density value of the own node is incremented by one (step S114).
  • the node identifier of the other node is added to the combined list stored in the storage unit 14, and the interval between the other node and the own node described in the combined list is predetermined. Is to maintain the condition of In this way, two or more nodes maintained so that the distance between the nodes satisfies a predetermined condition constitutes one cluster.
  • the predetermined condition for example, the following condition a or b can be considered.
  • the sensing areas of the two nodes are almost in contact with each other, or partially overlap with each other within a preset width.
  • the distance between the centers of the two nodes is within a range of L 1 which is less than or equal to the communicable distance Lr and a distance L 2 which is shorter than L 1 by ⁇ .
  • L 1 is desirably a distance that can suppress the deterioration of the signal-to-noise ratio between the nodes to a predetermined value or less.
  • ⁇ corresponds to the size of the width where the communicable areas overlap, and is set in advance. This width ⁇ is preferably as narrow as possible in order to maximize the range covered by all nodes.
  • the distance between the centers of the two nodes can be derived from the relationship between the received radio wave intensity and the distance when using radio waves for wireless communication.
  • the sensing area of the sensor node 10 is constant, whether the sensing areas of the two nodes are almost in contact with each other or whether they partially overlap within a preset width is derived from the relationship between the received radio wave intensity and the distance. It can be obtained from the distance between the nodes and the size of the sensing area.
  • control unit 15 selects another node having a larger density value in order to combine with the larger cluster side (step S113). Then, a search response message including the identifier of the own node is transmitted to bring the own node 10 and the other node into a coupled state, and the density value of the own node is incremented by 1 to 2 (step S114).
  • step S103 When the density value is 2 (YES in step S103), that is, when the own node 10 is coupled to only one other node, the control unit 15 is not coupled to the own node. Until another other node is found, control is performed to search for another node by the two-dimensional random walk while maintaining the connection state with the already connected other node (steps S107 and S108).
  • control unit 15 determines a random moving direction and moving speed and commands the moving function unit 13 within a range in which the interval with another node that has already been combined satisfies the predetermined condition. By doing so, the self-node 10 is walked two-dimensionally while being coupled with other nodes. Similarly to the case of the density value 1, the search message is periodically transmitted, and the reception of the search message from another node is monitored. When the control unit 15 receives a search message from another node not listed in the combined list (YES in step S108), one of the other nodes found and the own node are processed by the same process as in the case of the density value 1. 10 are connected (steps S112 to S114).
  • control unit 15 determines whether the density value is 3 or 4 or more (step S104).
  • the control unit 15 continues to connect the two other nodes that are currently coupled until it finds another node that is not coupled to the own node.
  • the control unit 15 selects two other nodes having the smallest sum of density values among the coupled other nodes. (If there are a plurality of minimum pairs, an arbitrary one of them) is selected (step S109), and the process proceeds to step S110 to perform the same control as described above. That is, the control unit 15 maintains the connection state with the selected two other nodes until it finds another other node that is not connected to the own node, and Control is performed to search for other nodes while moving so that the curvature of the formed arc is minimum (that is, the radius of the arc is maximum) (steps S110 and S111).
  • control unit 15 When the control unit 15 receives a search message from another node that is not listed in the combined list (YES in step S111), the control unit 15 performs processing similar to the case of the density value 1 and one of the found other nodes and its own node. 10 are connected (steps S112 to S114).
  • FIG. 3 is a diagram for explaining movement of a sensor node in which two or more other nodes are coupled to the own sensor node
  • FIG. 4 is a movement speed of the sensor node in which two or more other nodes are coupled to the own sensor node.
  • Equation 1 shown in FIG. 4 is a description in a music coordinate format, but can also be described in a two-dimensional orthogonal coordinate system. Note that these music coordinates and two-dimensional orthogonal coordinates are coordinates temporarily set by each sensor node in calculating the movement direction.
  • Equation 1 k ( ⁇ , t, ⁇ , d) is the curvature of the arc formed by the sensor node j, k joined by the sensor node i at the angle ⁇ at time t.
  • ⁇ is variable in the range of 0 ⁇ ⁇ ⁇ 2 ⁇ with the phase of the sensor node i, and this value is set to be different from other sensor nodes connected in the cluster, for example, by a random number,
  • a cluster composed of three or more sensor nodes can move in any direction.
  • the first term on the right side of Equation 1 is a term for the node i to move in the radial direction of the curvature of the arc formed with the coupled node j and node k.
  • the own node i how far the other nodes j and k exist in which direction. Need to be.
  • the distance to the other node is known because the other node and its own node maintain a coupled state.
  • the direction of the other node viewed from the own node is measured using the direction detection function of the wireless communication function unit 12.
  • Equation 1 The second term on the right side of Equation 1 is a term that moves to minimize the curvature over time.
  • Equation 1 The third term and the fourth term on the right side of Equation 1 are terms representing the strength of coupling, which means that the nodes with higher density d are more easily coupled.
  • G is a positive proportionality coefficient, and its value is set so as to keep the coupling distance between the nodes within a certain range by balancing with the repulsive force according to the fifth and sixth terms.
  • F (r, ⁇ , t, ⁇ , d) of the fifth term and the sixth term of Equation 1 is a phase ⁇ in which a sensor node i at a distance r and an angle ⁇ from the node center is coupled at time t.
  • This is a suppression term for achieving a distance that satisfies a predetermined condition with another sensor node of density d.
  • the predetermined condition is that the sensing areas overlap at a certain distance
  • the fifth and sixth terms correspond to the repulsive force that pushes the distance between any two or more coupled sensor nodes to the limit of the sensing area. .
  • Equation 2 an example of formulation of a two-dimensional random walk is shown in Equation 2 in FIG. Note that variables in () as in Equation 1 are omitted.
  • the first term on the right side is the term of the two-dimensional random walk of the node
  • the second term and the third term on the right side are the terms of the attractive force from the node where the communication areas overlap (the higher the density d, the easier the coupling)
  • the term after the term is a repulsive force that pulls the distance between nodes to the limit of the sensing area.
  • the proportionality coefficient a is a positive number. In a single node that is not coupled to any other node, the third and subsequent terms are omitted.
  • FIG. 6 is a schematic diagram of an initial state in which a large number of sensor nodes 10 are appropriately dispersed in an area to be sensed. Each sensor node 10 searches for another sensor node 10 that can communicate while performing a two-dimensional random walk. It is in a state of being. In the figure, the center black circle indicates the sensor node 10, and the circle centered on the black circle indicates a communicable area. In an initial state in which each sensor node 10 is not coupled to any other sensor node, the density value of each sensor node is 1.
  • FIG. 7 schematically shows a state in which two sensor nodes A and B that have been performing a two-dimensional random walk are coupled close to each other.
  • an outer circle in each sensor node indicates a communicable area
  • an inner filled circle indicates a sensing area
  • a small white circle at the center indicates a position of the sensor node.
  • each density value changes from 1 to 2 by the combination.
  • the sensor node A and the sensor node B coupled to each other constitute one cluster, and the cluster as a whole performs a two-dimensional random walk.
  • FIG. 8 schematically shows a state in which the cluster composed of the sensor node A and the sensor node B and the sensor node C approach each other while two-dimensional random walking, and the sensor node C is combined with the sensor node B. Show. Due to the coupling, the density value of the sensor node C changes from 1 to 2, and the sensor node B changes from 2 to 3.
  • FIG. 9 is a schematic diagram showing the movement of a cluster composed of three sensor nodes A, B, and C formed as shown in FIG.
  • the middle sensor node B moves in a direction that minimizes the curvature of the arc indicated by the broken line in the figure formed by the own node B and the other nodes A and C.
  • the sensor node A that is coupled only to the sensor node B and the sensor node C that is coupled only to the sensor node B perform a two-dimensional random walk within a range in which the coupling is maintained.
  • a two-dimensional random walk is performed while changing the positional relationship between the nodes (that is, changing the shape of the cluster). With this two-dimensional random walk, when each sensor node finds another uncoupled sensor node, it joins with it.
  • the communicable areas of the sensor node A and the sensor node C overlap in the process of two-dimensional random walk while changing the positional relationship between the nodes.
  • Sensor node A and sensor node C are coupled, and as shown in FIG. 10, three sensor nodes A, B, and C are coupled to each other to form a regular triangular cluster.
  • a sensor node that is coupled to one or more other sensor nodes searches for other neighboring nodes while moving using the moving function while maintaining the coupled state of the coupled nodes. Even if a gap that is not covered by any sensor node is temporarily generated in the cluster because it is combined with other nodes that have been searched, the sensor node that has advanced in the direction of filling the gap will be connected to the cluster without the gap. And change.
  • the sensor node coupled to two or more other sensor nodes selects a set of two other nodes having the smallest sum of density values, and the selected two other nodes and the own node. Therefore, even if a gap that is not covered by any sensor node is temporarily generated in the cluster, the sensor nodes around the gap are moved in the direction of the gap. It moves and quickly forms clusters without voids.
  • FIG. 11 schematically shows such a state.
  • sensor nodes A, B, D, E, G, H, and I there are seven sensor nodes A, B, D, E, G, H, and I in contact with the air gaps existing in the cluster of FIG.
  • a sensor node in contact with a gap has a smaller density value than a sensor node whose periphery is filled with another sensor node.
  • the sensor nodes A, B, D, E, G, H, and I that are in contact with the air gap select a set of two nodes including the sensor nodes that are also in contact with the air gap, and the other two selected
  • the probability of moving in the direction indicated by the arrow in the figure that minimizes the curvature of the arc formed by the node and the self node increases.
  • the diagram on the left side of FIG. 12 is a schematic diagram showing a part of the largest cluster formed by combining all sensor nodes. Since the density value of all the sensor nodes is 4 or more, each sensor node selects a set of two other nodes having the smallest sum of density values among the other nodes connected, and this selected 2 It moves in a direction that minimizes the curvature of the arc formed by the two other nodes and its own node. In each sensor node in the cluster in which there are a plurality of pairs having the minimum sum of density values, as a result of randomly selecting a pair, the movement direction of each sensor node in the cluster becomes random.
  • the sensor nodes on the outer periphery of the cluster have the smallest sum of density values in the set of adjacent sensor nodes on the outer periphery so that the curvature of the arc formed with the sensor node on the adjacent outer periphery is minimized.
  • the shape of the cluster gradually approaches a circle, and the shape of the circle is maintained. In this way, a circular cluster having the maximum area (coverage) covered by all sensor nodes is finally generated.
  • the control unit 15 of each sensor node that constitutes the cluster simultaneously broadcasts a search message including the identifier of the own node by the wireless communication function unit 12 at a fixed period, and simultaneously transmits search messages from other nodes. The reception is monitored.
  • the control unit 15 performs the combining process with the other node as described above, but is already described in the combined list.
  • the timer corresponding to the described node identifier is reset to the initial value. This timer counts up as time elapses, and times up when it reaches a preset value.
  • the timer will not time out by receiving periodic search messages from the other node.
  • reception of the search message from another node is interrupted, so the timer times out.
  • the control unit 15 determines that the other node that has timed up has stopped functioning due to failure or failure, deletes the identifier of the other node from the combined list, and decreases the density value of the own node by one.
  • the density value of the normal sensor node that is in contact with the gap caused by the sensor node that has stopped functioning is smaller than the density value of the normal sensor node that is filled with the normal sensor node.
  • the gap generated by the sensor node whose function is stopped is filled with the normal sensor node in the vicinity by the same operation as that described with reference to FIG.
  • a network topology in which a gap that is not covered by any node does not occur as much as possible inside a closed curve that surrounds all nodes is achieved by autonomously distributed operation of a plurality of nodes. Can be built. The reason for this is that each node operating as a member of the cluster maintains another coupled state of the coupled nodes, while other nodes in the neighborhood that can communicate using the communication function while moving using the move function are selected. This is because the probability that a void is generated is reduced because the search is performed and combined with other searched nodes.
  • a sensor node combined with two or more other sensor nodes selects a set of two other nodes having the smallest sum of density values, and is formed by the selected two other nodes and the own node. According to the configuration that moves in the direction that minimizes the curvature of the arc, even if a gap that is not covered by any sensor node is temporarily generated in the cluster, the sensor nodes around the gap move in the gap direction. Finally, it is possible to form a cluster without voids in a shorter time.
  • the gap generated by the sensor node whose function has been stopped is replaced with the normal sensor node in the vicinity. It can be filled by autonomous distributed operation.
  • a normal sensor node that has been combined with a sensor node that has stopped functioning needs to maintain a predetermined interval with the sensor node that has stopped functioning in order to cancel the connection relationship with the sensor node that has stopped functioning. This is because the movement in the direction of the sensor node that has disappeared and has stopped functioning becomes possible, and induces an operation of being coupled with another normal sensor node in contact with the gap.
  • a sensor node combined with two or more other sensor nodes selects a set of two other nodes having the smallest sum of density values, and is formed by the selected two other nodes and the own node. According to the configuration of moving in the direction that minimizes the curvature of the arc, the sensor nodes around the gap generated by the sensor node whose function has been stopped due to a failure or the like move in the direction of the gap. It becomes possible to solve with.
  • a sensor node coupled to two or more other sensor nodes selects a set of two other nodes having a minimum sum of density values, and is formed by the selected two other nodes and the own node. According to the configuration of moving in the direction that minimizes the curvature of the arc, it is possible to generate a single cluster having a maximum area (coverage) covered by all sensor nodes.
  • the present invention is applied to a sensor network, but it can also be applied to a wireless network.
  • each sensor node when the number of other nodes coupled to the own node is two or more, each sensor node includes two of the two or more other nodes coupled to each other that have the smallest sum of density values.
  • the movement control is performed so that the moving direction is the direction in which the curvature of the arc formed by the other node and the own node is minimized.
  • different movement control may be performed under a specific situation.
  • a sensor node B coupled to two or more other sensor nodes A and C has a sensor node A and a sensor node C when there is a node whose density value is not 3 or more among the sensor nodes A and C.
  • the moving direction of the node B may be reversed 180 degrees so that the curvature is maximized (that is, the radius of the arc is minimized).
  • each sensor node in which the number of other nodes coupled to the own node is two or more is determined by the failure of the other nodes in the cluster to which the node belongs, and the two other nodes having the smallest sum of density values and the own node. If it is not possible to move in the direction that minimizes the curvature of the arc formed in step 1, the direction is reversed by 180 degrees and the curvature is moved to the maximum (that is, the radius of the arc is minimum). Also good. According to such an operation, for example, it is possible to reliably prevent the nodes from continuing on the line to form a circumferential cluster.
  • the network is configured with only sensor nodes, but nodes other than sensor nodes may be added.
  • nodes other than sensor nodes may be added.
  • a single node or a plurality of nodes called “sink nodes” having a function of collecting and aggregating information from sensor nodes (but sufficiently smaller than the number of sensor nodes) may be added.
  • the sink node has a fixed density value larger than the maximum density value of the sensor node, and transmits a search message including its own node identifier and density value at a fixed period.
  • the sink node may be fixed or movable. If it is possible to move, add a position measurement function such as GPS, and move to the center or near the center of the area you want to cover as much as possible so that the maximum distance from all sensor nodes is uniform in all directions. Also good.
  • the sensor node or the wireless node of the present embodiment can be realized by a computer and a program as well as by realizing the function of the sensor node or the wireless node in hardware.
  • the program is provided by being recorded on a computer-readable recording medium such as a magnetic disk or a semiconductor memory, and is read by the computer at the time of starting up the computer and the computer is controlled by controlling the operation of the computer.
  • it functions as a wireless node.
  • FIG. 14 is a block diagram showing the configuration of the network system in the present embodiment.
  • an outline of the network system described above will be described.
  • the network system in the present embodiment includes a plurality of nodes 100 including communication means 110 and moving means 120, and each node 100 communicates while moving using moving means 120.
  • a cluster composed of two or more nodes 100 by searching for other neighboring nodes 100 capable of communication by means 110 and combining the searched other nodes 100 with an interval satisfying a predetermined condition. The structure of generating is adopted.
  • each node 100 configuring the cluster maintains another coupled state of the coupled nodes 100, and other neighboring nodes 100 that can communicate with the communication unit 110 while moving using the moving unit 120.
  • the other node 100 that has been searched is combined with an interval that satisfies the predetermined condition.
  • Each node 100 has a configuration including a sensor.
  • each node 100 holds a density value corresponding to the number of other nodes 100 coupled to the own node 100, and simultaneously searches for a plurality of other nodes 100 that can communicate with the communication means.
  • a configuration is adopted in which the node is coupled to another node 100 that holds a larger density value.
  • each node 100 has the smallest sum of density values among the two or more other nodes 100 coupled.
  • a configuration is adopted in which movement control is performed in which the direction in which the curvature of the arc formed by the two other nodes 100 and the own node 100 is minimized is the movement direction.
  • each node 100 performs the movement control in which the direction in which the curvature of the arc formed by the two other nodes 100 and the own node 100 is the minimum is the movement direction.
  • the density value of at least one other node 100 of the two other nodes 100 is a density value indicating that the number of other nodes 100 to be combined is one
  • the moving direction of the own node 100 Is reversed 180 degrees, and a movement control is performed in which the moving direction is a direction in which the curvature of the arc formed by the two other nodes 100 and the own node 100 is maximized.
  • the movement direction of the own node 100 is changed.
  • a configuration is adopted in which the movement control is performed so that the direction of rotation is the direction in which the curvature of the arc formed by the two other nodes 100 and the node 100 is maximized.
  • the moving means 120 when each node 100 is not coupled to another node 100 at all, or when coupled to only one other node 100, the moving means 120 performs two-dimensional randomness.
  • the structure is to walk.
  • the network system adopts a configuration in which the interval that satisfies the predetermined condition is an interval that is determined depending on the communicable distance of each node 100.
  • the network system adopts a configuration in which the interval satisfying the predetermined condition is an interval determined depending on the size of the sensing area of the sensor provided in each node 100.
  • a network system construction method which is executed when the network system described above operates, constructs a network system composed of a plurality of nodes having communication means and movement means.
  • a method Each node searches for other neighboring nodes capable of communicating by the communication means while moving using the moving means, and joins the searched other nodes with an interval satisfying a predetermined condition.
  • each node includes a sensor.
  • each node holds a density value according to the number of other nodes coupled with the own node, and when simultaneously searching for other nodes that can communicate with the communication means, A configuration is adopted in which it is combined with another node that holds a larger density value.
  • each node has 2 with the smallest sum of density values among the two or more other nodes coupled when the number of other nodes coupled to the own node is two or more.
  • a configuration is adopted in which movement control is performed in which a direction in which the curvature of an arc formed by two other nodes and its own node is minimized is the movement direction.
  • each node performs the above-described movement control with the direction of movement in which the curvature of the arc formed by the other two nodes and the self node is minimized.
  • the density value of at least one other node of the two other nodes is a density value indicating that the number of other nodes to be coupled is one
  • the moving direction of the own node is reversed by 180 degrees.
  • a configuration is adopted in which movement control is performed in which the direction in which the curvature of the arc formed by the two other nodes and the own node is maximum is the movement direction.
  • the movement direction of the self node is set to 180 degrees. Inverted, a configuration is adopted in which movement control is performed in which the direction in which the curvature of the arc formed by the two other nodes and the self node becomes maximum is the movement direction.
  • a node device including a communication unit, a moving unit, and a control unit, wherein the communication device moves while using the moving unit under the control of the control unit.
  • the above node device has a configuration including a sensor.
  • the above node device holds a density value according to the number of other nodes coupled to its own node, and holds a larger density value when a plurality of other nodes capable of communication by the communication means are simultaneously searched. It adopts a configuration that connects with other nodes.
  • the number of other nodes coupled to the own node is two or more, among the two or more other nodes coupled to the node device, two nodes having the smallest sum of density values are compared with the other nodes.
  • a configuration is adopted in which movement control is performed in which the direction of curvature of the arc formed by the nodes is the minimum in the movement direction.
  • the movement of the two other nodes even after performing movement control in which the direction of curvature of the arc formed by the two other nodes and the self node is the minimum, the movement of the two other nodes
  • the density value of at least one of the other nodes is a density value indicating that the number of other nodes to be combined is one
  • the moving direction of the own node is reversed by 180 degrees
  • the two other nodes A configuration is adopted in which movement control is performed in which the moving direction is the direction in which the curvature of the arc formed by the node and the own node is maximized.
  • the moving direction of the own node is reversed by 180 degrees
  • a configuration is adopted in which movement control is performed in which the direction in which the curvature of the arc formed by the other node and the own node is maximum is the movement direction.
  • the above-described node device can be realized by incorporating a program into a computer.
  • the program according to another aspect of the present invention can communicate with the communication means while moving a computer constituting a node device including the communication means and the movement means using the movement means.
  • a cluster composed of two or more nodes is generated.
  • searching for another node in the neighborhood that can communicate with the communication means while moving using the moving means while maintaining the combined state of It is made to function as a control means for performing control for coupling while maintaining a satisfying interval.

Landscapes

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

Abstract

L'invention porte sur un système de réseau qui construit une topologie de réseau de telle sorte que l'occurrence de vides est minimisée par le fonctionnement distribué autonome de multiples nœuds comportant chacun un moyen de communication et un moyen de mouvement. Le système de réseau comprend de multiples nœuds (100) comportant chacun un moyen de communication (110) et un moyen de mouvement (120). Chacun des nœuds (100) cherche un nœud différent proche (100) pouvant communiquer par l'intermédiaire du moyen de communication (110) tout en se déplaçant au moyen du moyen de mouvement (120), et se couple au nœud différent recherché (100) avec un espace qui satisfait une condition prédéterminée maintenu entre eux et, ainsi, un groupe composé de deux nœuds ou plus (100) est généré. Chacun des nœuds (100) composant le groupe recherche en outre un autre nœud différent proche (100) pouvant communiquer par l'intermédiaire du moyen de communication (110) tout en se déplaçant au moyen du moyen de mouvement (120) en maintenant l'état couplé des nœuds couplés (100), et se couple au nœud différent recherché (100) avec l'espace qui satisfait la condition prédéterminée maintenu entre eux.
PCT/JP2009/004338 2008-11-14 2009-09-03 Système de réseau WO2010055602A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2010537664A JP5392265B2 (ja) 2008-11-14 2009-09-03 ネットワークシステム

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2008-291736 2008-11-14
JP2008291736 2008-11-14

Publications (1)

Publication Number Publication Date
WO2010055602A1 true WO2010055602A1 (fr) 2010-05-20

Family

ID=42169749

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2009/004338 WO2010055602A1 (fr) 2008-11-14 2009-09-03 Système de réseau

Country Status (2)

Country Link
JP (1) JP5392265B2 (fr)
WO (1) WO2010055602A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013171868A1 (fr) * 2012-05-16 2013-11-21 富士通株式会社 Dispositif de nœud et procédé de communication
JP2014039157A (ja) * 2012-08-16 2014-02-27 Nippon Telegr & Teleph Corp <Ntt> データ転送方法および無線ネットワークシステム
WO2017051513A1 (fr) * 2015-09-24 2017-03-30 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ Robot mobile autonome et procédé de commande de mouvement
US10289122B2 (en) * 2014-10-27 2019-05-14 Sikorsky Aircraft Corporation Communication link accessibility aware navigation
US10368290B2 (en) 2014-10-27 2019-07-30 Sikorsky Aircraft Corporation Cooperative communication link mapping and classification

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006165695A (ja) * 2004-12-02 2006-06-22 Sony Corp ネットワーク・システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム
JP2006186446A (ja) * 2004-12-27 2006-07-13 Hiroshima Industrial Promotion Organization 通信方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006165695A (ja) * 2004-12-02 2006-06-22 Sony Corp ネットワーク・システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム
JP2006186446A (ja) * 2004-12-27 2006-07-13 Hiroshima Industrial Promotion Organization 通信方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
YOSHITO TOBE: "Jissekai Joho Monitoring ni Muketa Sensor Network Gijutsu", JOURNAL OF THE ROBOTICS SOCIETY OF JAPAN, vol. 25, no. 4, 2007, pages 514 - 519 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013171868A1 (fr) * 2012-05-16 2013-11-21 富士通株式会社 Dispositif de nœud et procédé de communication
JPWO2013171868A1 (ja) * 2012-05-16 2016-01-07 富士通株式会社 ノード装置および通信方法
US9450830B2 (en) 2012-05-16 2016-09-20 Fujitsu Limited Node apparatus and communication method
JP2014039157A (ja) * 2012-08-16 2014-02-27 Nippon Telegr & Teleph Corp <Ntt> データ転送方法および無線ネットワークシステム
US10289122B2 (en) * 2014-10-27 2019-05-14 Sikorsky Aircraft Corporation Communication link accessibility aware navigation
US10368290B2 (en) 2014-10-27 2019-07-30 Sikorsky Aircraft Corporation Cooperative communication link mapping and classification
WO2017051513A1 (fr) * 2015-09-24 2017-03-30 パナソニック インテレクチュアル プロパティ コーポレーション オブ アメリカ Robot mobile autonome et procédé de commande de mouvement

Also Published As

Publication number Publication date
JP5392265B2 (ja) 2014-01-22
JPWO2010055602A1 (ja) 2012-04-05

Similar Documents

Publication Publication Date Title
Kumar et al. Location-based routing protocols for wireless sensor networks: A survey
Sandeep et al. Review on clustering, coverage and connectivity in underwater wireless sensor networks: A communication techniques perspective
Zhang et al. A novel multicast routing method with minimum transmission for WSN of cloud computing service
Rani et al. Multi-hop routing in wireless sensor networks: an overview, taxonomy, and research challenges
JP4124196B2 (ja) ネットワーク・システム、無線通信装置及び無線通信方法、並びにコンピュータ・プログラム
Sheu et al. Efficient path planning and data gathering protocols for the wireless sensor network
JP5392265B2 (ja) ネットワークシステム
Cirstea Energy efficient routing protocols for Wireless Sensor Networks: A survey
Sahoo et al. Target tracking and boundary node selection algorithms of wireless sensor networks for internet services
Davis et al. A survey of wireless sensor network architectures
Hayes et al. Robust Ad-hoc Sensor Routing (RASeR) protocol for mobile wireless sensor networks
Kim et al. Cooperative multipath routing with path bridging in wireless sensor network toward IoTs service
Sahoo et al. Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks
Karunanithy et al. Directional antenna based node localization and reliable data collection mechanism using local sink for wireless sensor networks
de Oliveira et al. An enhanced location-free Greedy Forward algorithm with hole bypass capability in wireless sensor networks
Li et al. Zoner: A zone-based sensor relocation protocol for mobile sensor networks
Dhall et al. Review of protocol stack development of flying ad-hoc networks for disaster monitoring applications
Won et al. Destination-based cut detection in wireless sensor networks
Baresi et al. MAGNET: A middleware for the proximal interaction of devices based on Wi-Fi direct
Gupta et al. Anchor-based void detouring routing protocol in three dimensional IoT networks
Khedr et al. A topology discovery algorithm for sensor network using smart antennas
Meghanathan et al. Centralized and Distributed Algorithms for Stability-based Data Gathering in Mobile Sensor Networks.
Sarma et al. Energy efficient communication protocol for a mobile wireless sensor network system
Sethi et al. A mobile agent-based event driven route discovery protocol in wireless sensor network: Aerdp
Wu et al. Connected dominating sets

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2010537664

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09825857

Country of ref document: EP

Kind code of ref document: A1