CN102792737B - Communications system, slave node, route building method, and program - Google Patents

Communications system, slave node, route building method, and program Download PDF

Info

Publication number
CN102792737B
CN102792737B CN201180010501.2A CN201180010501A CN102792737B CN 102792737 B CN102792737 B CN 102792737B CN 201180010501 A CN201180010501 A CN 201180010501A CN 102792737 B CN102792737 B CN 102792737B
Authority
CN
China
Prior art keywords
node
estimate
evaluation
package
received power
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201180010501.2A
Other languages
Chinese (zh)
Other versions
CN102792737A (en
Inventor
古川浩
金光日
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Kyushu University NUC
Original Assignee
Kyushu University NUC
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 Kyushu University NUC filed Critical Kyushu University NUC
Publication of CN102792737A publication Critical patent/CN102792737A/en
Application granted granted Critical
Publication of CN102792737B publication Critical patent/CN102792737B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/08Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on transmission power
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The present invention offers a communications system, etc., capable of building a stable relay path even if a propagation path fluctuates due to RSSI fluctuation. In a wireless backhaul system, when building a communications path of a tree structure with a core node for a root, in each respective slave node, successive averages of RSSI of n routing packets received after the reset routing packet received most recently from the same transmission source node are used to determine whether to treat the transmission source node as a parent in the tree structure. It is possible to acquire an asymptotically stable relay path from the RSSI following a generally logarithmic normal distribution, and in particular, by using successive averages.

Description

Communication system, from node, route constructing method and program
Technical field
The present invention relates to communication system, from node, route constructing method and program, particularly relate to and comprise the core node that is connected to underlying network and directly or be connected to multiple communication systems etc. from node of core node via other node by radio communication.
Background technology
As a kind of mode realizing new generation broadband and move (broadband mobile), studied with the wireless cellular system by radius being the narrow and small cell base station group of tens of meters carries out multi-hop relay connection.Within the system, be called among group of base stations that several base stations of core node are to be wiredly connected to underlying network, other node is by carrying out the communication with underlying network via the wireless multi-hop relay of core node.
This wireless relay network is commonly referred to as wireless revolution network (wireless backhaul).Its stable utilization and high capacity reach the realization of the wireless multi-hop relay agreement of high-quality.The Routing Protocol of wireless revolution network is endowed feature by tolerance and algorithm, and according to the definition of tolerance, corresponding algorithm is also different.Tolerance proposed so far such as has the quality etc. of jumping figure and/or internodal wireless link.ETX (Expected Transmission Count: expect transmission number) tolerance, RTT (Per-hopRound Trip Time: often jump two-way time) tolerance, WCETT (Weighted CumulativeExpected Transmission: weighted accumulation expects the transmission time) tolerance etc.And the algorithm of existing frequent use has bellman-ford algorithm and/or dijkstra's algorithm etc.
And it is the method for routing (hereinafter referred to as " existing minimum transfer loss route ") (with reference to patent documentation 1 ~ 3, non-patent literature 1) measured that invention there has been proposed with loss.Existing minimum transfer loss route is by internodal received power (RSSI, Received Signal StrengthIndicator: received signal strength indicator) ask for loss, using it as tolerance, become minimum relay route according to the loss that bellman-ford algorithm builds from each node to core node.With reference to Fig. 8, be described particularly about existing minimum propagation loss route.Fig. 8 is the flow chart of the work from node represented in existing minimum propagation loss route.Core node broadcasts the route package (routing packet) of 1 tolerance 0, if receive route package (step STSP1) from node, then calculate loss according to RSSI when receiving, by this loss be contained in the cumulative metric (representing the loss sum from the node to core node that have sent this reception package) received in package and be added and calculate new tolerance (step STSP2).If the cumulative metric little (step STSP3) that this new tolerance is preserved than this node, then upgrade route, the route package comprising new tolerance is broadcast to around (step STSP4).If the cumulative metric that this new tolerance is preserved unlike this node in step STSP3 is little, then do not carry out the update process of route.Route is formed by above process repeatedly.In addition, not receiving route package after predetermined time (step STSP5), sending node registration package (step STSP6), and end process.The path of the tree-shaped of final structure centered by core node.Because minimum transfer loss route is using internodal loss as tolerance, so all patience to interference of relay route is high, high-quality, high efficiency transmission characteristic can be expected.
In addition, about the Routing Protocol in wireless multi-hop relay, multiple method has been proposed, in the wireless revolution network of self-organizing type, also carry out standardization by MANET (Mobile Ad-Hoc Networks: the mobile ad-hoc network) WG of IETF (Internet Engineering Task Force: internet engineering task promotes group).
Summary of the invention
But when using jumping figure as tolerance, the internodal link of distance can be used in route, obtains disagree with the stability of route.
In addition, in existing minimum propagation loss route, have and make routing variable obtain unstable problem because of the variation of transmission path.That is, in non-patent literature 1 about minimum transfer loss route, do not consider the variation of transmission path impact and by simulation evaluation its validity.But, in actual environment, although each node is arranged regularly, can make because of the contact of people etc. RSSI change (with reference to Fig. 2 line a).In existing minimum transfer loss route, because tolerance only calculates according to the RSSI of received route package, if so RSSI variation, then the tolerance used in path construction also changes, constructed route also changes according to performing the moment, that is becomes unstable.
Routing Protocol in the wireless multi-hop relay proposed, also there is no the mechanism in the path stable relative to the variation of transmission path.Therefore, the route built accordingly is only the route in particular moment the best, in order to deal with the variation of transmission path, needing path frequently to build again, can improve the load of network.
If study particularly, then these Routing Protocols can be categorized as demand (on-demand) type and static type.
In the Routing Protocol of demand type, each communication request that produces just carries out route processing, the life span (TTL) that constructed route sustainable existence is certain.If sign off, then this route is deleted.Although the load of the Routing Protocol route processing of demand type is large, due to the change of topology network can be tackled rapidly, so be applicable to the large mobile ad-hoc network of mobility.
On the other hand, in static type Routing Protocol, building route when building network with the startup of system simultaneously, then keeping this route and starting to serve.In wireless revolution network, because each base station is fixed setting, so the Routing Protocol of static type is applicable to.
Although each base station is fixed setting in wireless revolution network, transmission path can be subject to the impact of the decline (fading) caused by the movement of people etc. and change.But, in existing static type Routing Protocol, same with existing minimum propagation loss route, do not carry out the algorithm design of the variation considering transmission path.Owing to ignoring the variation in time of transmission path completely, even so identical Joint Enterprise, different relay route also can be built according to the execution moment of route.In addition, the phenomenon using testboard inspection alone because of the variation of the transmission path in wireless revolution network, constructed route to be changed in time, also reports out the throughput change of system accordingly.
In static type route, transmission path situation when system starts if only see and carry out route, if then after this transmission path variation, then cannot ensure the performance of the system provided by this route, in the worst case, also relay route is broken off sometimes.
Therefore, even if the object of the invention is to propose to make transmission path change because of the variation of RSSI, the communication system etc. of stable relay route can also be built.
A first aspect of the present invention is a kind of communication system, comprise the core node that is connected to underlying network and be connected to described core node multiple from node from node by radio communication directly or via other, described core node sends instruction from described core node to this from the initialized reset route package of the communication path of node to described from node, thereafter send multiple instruction from described core node to this usual route package from the structure of the communication path of node, describedly respectively to comprise from node: own path evaluation of estimate memory cell, it stores from described core node to this from the evaluation of estimate of the communication path of node and own path evaluation of estimate, uplink relay destination memory cell, it stores uplink relay destination information, and described uplink relay destination information represents from this from node to the initial relaying destination node the communication path of described core node and uplink relay destination node, and route construction processing unit, its when from receive receive n (n is natural number) described usual route package from identical transmission source node described reset route package, judge whether described transmission source node is set to new described uplink relay destination node and determines from described core node to this from the communication path of node, described route construction processing unit has: received power evaluation of estimate computing unit, it, based on the received power of the n-th described usual route package received, calculates this evaluation of estimate from the received power between node and described transmission source node and received power evaluation of estimate, new cumulative path evaluation of estimate computing unit, it is based on from described core node to the evaluation of estimate of the relay route of described transmission source node and described received power evaluation of estimate, calculate the n-th described usual route package received via the evaluation of estimate of communication path and new cumulative path evaluation of estimate, and routing update unit, it is when described new cumulative path evaluation of estimate is less than described own path evaluation of estimate, the package transmission source making described uplink relay destination storage part store the described usual route package received is used as new described uplink relay destination nodal information, makes cumulative path evaluation of estimate described in described own path evaluation of estimate cell stores be used as new described own path evaluation of estimate and carry out update process, wherein, described received power evaluation unit, when n is more than 2, not only based on the received power of the n-th described usual route package received, also based on received power and/or the received power of part or all of described usual route package that receives in addition of described reset route package, calculate this evaluation of estimate from the received power between node and described transmission source node and received power evaluation of estimate.
A second aspect of the present invention is the communication system of first aspect, wherein: described received power evaluation of estimate computing unit with the received power of constant or described reset route package for initial value, for α nand β n, according to formula (eq1), calculate the received power R of the described usual route package of the n-th reception nevaluation of estimate and received power evaluation of estimate A n, α nand β nfor the function of n, α nfor nonidentical in the function of zero.
A third aspect of the present invention is the communication system of second aspect, wherein: in formula (eq1), and A 1=R 1, when n is more than 2, α n=(n-1)/n and β n=1/n.
A fourth aspect of the present invention is the communication system of second aspect, wherein: in formula (eq1), and α nand/or β nfor constant.
A fifth aspect of the present invention is a kind of from node, its direct or via other node is connected to core node by radio communication, described core node is connected to underlying network, describedly to comprise from node: own path evaluation of estimate memory cell, it stores from described core node to this from the evaluation of estimate of the communication path of node and own path evaluation of estimate; Uplink relay destination memory cell, it stores uplink relay destination information, and described uplink relay destination information represents from this from node to the initial relaying destination node the communication path of described core node and uplink relay destination node; And route construction processing unit, its when after receiving reset route package from described core node from identical transmission source node receive n (n is natural number) usually route package, judge whether described transmission source node is set to new described uplink relay destination node and determines from described core node to this from the communication path of node, described reset route package instruction initialization from the communication path of node from described core node to this, described usual route package instruction is structure from the communication path of node from described core node to this; Described route construction processing unit has: received power evaluation of estimate computing unit, the successively average computation received power evaluation of estimate A of the individual described usual route package of n that is successively average or that receive of its received power by described reset route package and the individual described usual route package of the n received n, described received power evaluation of estimate A nevaluate the received power R of the described usual route package that n-th receives n; New cumulative path evaluation of estimate computing unit, it is based on from described core node to the evaluation of estimate of the relay route of described transmission source node and described received power evaluation of estimate, calculate the n-th described usual route package received via the evaluation of estimate of communication path and new cumulative path evaluation of estimate; And routing update unit, it is when described new cumulative path evaluation of estimate is less than described own path evaluation of estimate, the package transmission source making described uplink relay destination storage part store the described usual route package received is used as new described uplink relay destination nodal information, makes cumulative path evaluation of estimate described in described own path evaluation of estimate cell stores be used as new described own path evaluation of estimate and carry out update process.
A sixth aspect of the present invention is a kind of route constructing method, it comprises the core node that is connected to underlying network and is connected to described core node multiple from the route constructing method communication system of node from node by radio communication directly or via other, describedly respectively to comprise from node: own path evaluation of estimate memory cell, it stores from described core node to this from the evaluation of estimate of the communication path of node and own path evaluation of estimate, uplink relay destination memory cell, it stores uplink relay destination information, and described uplink relay destination information represents from this from node to the initial relaying destination node the communication path of described core node and uplink relay destination node, and all mid-side node memory cell, its storage can the node of transmission and reception package and package transmission and reception with this node time the evaluation of estimate of received power and the combination of received power evaluation of estimate, described route constructing method comprises: initialization step, described core node sends instruction from described core node to this from the initialized reset route package of the communication path of node to described from node, receive described reset route package judge whether to receive this reset route package for the first time from the initialization unit of node, when receiving for the first time, identical described reset route package is sent to the node being stored in described all mid-side node memory cell, and delete the information being stored in described all mid-side node memory cell, described own path evaluation of estimate is set as maximum, and route construction step, described core node to described from node determine send order and send multiple instruction from described core node to this usual route package from the structure of the communication path of node, receiving described in described usual route package from node, received power evaluation of estimate computing unit, when the transmission source node of received usual route package is not stored in described all mid-side node memory cell, received power based on described usual route package calculates this evaluation of estimate from the received power between node and described transmission source node and received power evaluation of estimate, to described all mid-side node memory cell, it is made to store the combination of described transmission source node and described received power evaluation of estimate, when the transmission source node of received usual route package is stored in described all mid-side node memory cell, not only based on the received power of described usual route package, also calculate new received power evaluation of estimate based on the described received power evaluation of estimate being stored in described all mid-side node memory cell, to described all mid-side node memory cell, it is made to store the combination of described transmission source node and new described received power evaluation of estimate, based on the order of described transmission, new circular treatment unit judges whether the described usual route package received is the described usual route package do not received in the past, if the described usual route package do not received, then described new own path evaluation of estimate is set to maximum, new cumulative path evaluation of estimate computing unit is based on from described core node to the evaluation of estimate of the relay route of described transmission source node and described received power evaluation of estimate, calculate the described usual route package that receives via the evaluation of estimate of communication path and new cumulative path evaluation of estimate, routing update unit is when described new cumulative path evaluation of estimate is less than described own path evaluation of estimate, the package transmission source making described uplink relay destination storage part store the described usual route package received is used as new described uplink relay destination nodal information, cumulative path evaluation of estimate described in described own path evaluation of estimate cell stores is made to be used as new described own path evaluation of estimate and to carry out update process, new described own path evaluation of estimate is sent to the node being stored in described all mid-side node memory cell, determine thus from described core node to this from the communication path of node.
A seventh aspect of the present invention is a kind of program, and it is for making computer playing a role from node as the 5th aspect.
In addition, received power evaluation of estimate computing unit also can in formula (eq1), by A 0as the received power R of reset route package 0, to natural number n, be set to α n=n/ (n+1) and β n=1/ (n+1) and calculate received power evaluation of estimate.Particularly, in a sixth aspect of the present invention, the initialization unit from node receiving reset route package also can after deletion be stored in the information of described all mid-side node memory cell, to described all mid-side node memory cell, the received power of reset route package is set to the initial value of received power evaluation of estimate, makes it combine and store the transmission source node of reset route package and the initial value of received power evaluation of estimate.In addition, also can record the computer-readable recording medium of the program of a seventh aspect of the present invention as (stably) and grasp.
[numerical expression 1]
A n=α n×A n-1n×R n. (eq1)
In addition, function alpha nand β nalso can be such as α n+ β n≤ 1 (particularly α n+ β n=1) function.And then, by being set as n → ∞, α n→ 1 and β nthe function of → 0, can by received power evaluation of estimate A nbe set to more stable value and calculate.
The effect of invention
According to the present invention, different from existing minimum transfer loss route, by not only considering the RSSI becoming the usual route package of the opportunity of the beginning of each route construction process, also consider the RSSI of other the usual route package received after the reception of nearest reset route package and carry out route construction process, even if after the reception of reset route package, each node is fixed setting, under the state of the variation without setting position when RSSI variation, also can build stable relay route.
And then, by such as of the present invention second and the 5th aspect, to the received power evaluation of estimate A of the usual route package that n-th (n is the natural number of more than 2) the reception from reset route package receives n, except the received power R of this usual route package nalso utilize received power evaluation of estimate A outward n-1ask for, can limit and be stored in respectively from the variable of node, and then computing also alleviates, and can make to become easy from the realization of node.Particularly, in the transmission path of wireless revolution network, known RSSI, generally in accordance with logarithm normal distribution, by such as a third aspect of the present invention, utilizes and successively on average asks for A n, progressively stable relay route can be obtained.In addition, by such as a fourth aspect of the present invention, by function alpha nand/or β nbe set to constant, the variation of RSSI can be relaxed.
Accompanying drawing explanation
Fig. 1 is the figure of the summary of the communication system 1 represented as embodiments of the invention.
Fig. 2 represents the variation of RSSI (line a) and the curve chart of successively average change (line b).
Fig. 3 is the block diagram of an example of the structure of the core node 5 representing Fig. 1.
Fig. 4 is the flow chart of an example of the work of the core node 5 representing Fig. 3.
Fig. 5 be represent Fig. 1 from node 7 ithe block diagram of an example of structure.
Fig. 6 be represent Fig. 5 from node 7 ithe flow chart of an example of work.
Fig. 7 is the figure of the stable routing of the experimental construction represented by the present embodiment.
Fig. 8 is the flow chart of the work from node represented in existing minimum propagation loss route.
Symbol description
1: communication system, 3: underlying network, 5: core node, 7 i: from node, 51 i: own path evaluation of estimate storage part, 53 i: node storage part, 75 i: initialization section, 81 i: node registration process portion, 83 i: received power evaluation of estimate calculating part, 87 i: cumulative path evaluation of estimate calculating part, 91 i: routing update portion.
Embodiment
Below, be described about embodiments of the invention with reference to accompanying drawing.In addition, the present invention is not limited to this embodiment.
Embodiment
Fig. 1 is the figure of the summary of the communication system 1 represented as embodiments of the invention.Communication system 1 is wireless rotary system, and each base station is fixed setting.The base station of communication system 1 has two kinds, for being wiredly connected to the core node 5 (example of " core node " of the application's claim) of underlying network 3 and multiple from node 7 1..., 7 10(example of " from the node " of the application's claim).Can carry out radio communication (be " trunk " hereinafter referred to as the wireless communication line between base station) between base station, trunk as shown in Figure 1, builds the path of the tree-shaped centered by core node 5.In addition, the region (cluster cell: community of trooping) can carrying out radio communication is had in each base station.If such as can move as portable phone and the portable terminal device 9 that can carry out radio communication with base station be present in certain base station troop in community, between this base station, then carry out radio communication (following, to claim the wireless communication line between base station and portable terminal device etc. to be " line attachment ").Portable terminal device 9 can be connected to underlying network 3 by line attachment and trunk.
Then, about the Routing Protocol in the present embodiment, the situation of the evaluation of estimate of the successively average computation RSSI by RSSI is described (hereinafter referred to as " this agreement ").This agreement is consisted of repeatedly circulate (round), and in each circulation, the node of each via node and periphery carries out the transmission and reception of route package repeatedly, and what calculate RSSI successively on average builds a complete route.
In the transmission path of wireless revolution network, known RSSI generally defers to logarithm normal distribution (with reference to non-patent literature 2).That is, the distribution that the RSSI represented with decibel is amplitude is in accordance with the probabilistic process of normal distribution.
Sequence { the R of the value that through type (1) definition is carried out uniform sampling with certain hour interval to internodal RSSI and obtained n, n=1,2 ... successively mean value { A n, n=1,2 ....Successively average sequence { A nbecome large along with n and converge on the mean value (with reference to non-patent literature 3) of this probabilistic process.Therefore, if the number of times owing to increasing circulation, then the successively convergence in mean of each internodal RSSI is in certain value, so the route built by each circulation is asymptotic to stable routing convergence.
[numerical expression 2]
A n = R 1 . n = 1 A n - 1 × ( n - 1 ) + R n n . n = 2,3 , . . . - - - ( 1 )
In the trunk of Fig. 1, transmission path can be subject to the impact of the decline caused by the movement of people etc. and change.In the curve chart of Fig. 2, the line a described with leg-of-mutton symbol, represents the situation changed in time of the RSSI of the actual observation when IEEE802.11a being set to wave point.RSSI changed tempestuously along with the time.Therefore, if existing minimum propagation loss route etc. will be used to follow the variation of this RSSI all the time, then the path of trunk can become unstable.
In contrast, in the curve chart of Fig. 2, the line b described with vatu (vatu) symbol, represents the successively average change obtained according to formula (1).The line b of Fig. 2 is stable at this value after changing to-55dBm from-52dBm.Like this, known: by sampling to internodal RSSI at certain intervals and getting successively average, the variation of RSSI after certain hour, can be suppressed.
Then, with reference to Fig. 3 to Fig. 6, about the core node 5 of the Fig. 1 in this agreement and from node 7 ithe structure of (i is from the natural number below the number of node) and an example of work are described.
First, define about the route variable preserved with the route package of this protocol processes, each node and parameter etc.
" own node tolerance " (example of " the own path evaluation of estimate " of the application's claim) in each node, for from this node to the loss sum in the relay route of core node.Each node preserves this own node tolerance, carries out initialization when plant-grid connection with maximum.
" route package " is core node 5 to each from node 7 ithe package sent.Route package has two kinds, at core node 5 to each from node 7 ithe reset route package (example of " the reset route package " of the application's claim) used when sending the removing request of depositing routing iinformation and the usual route package (example of " the usual route package " of the application's claim) used when building route.Route package comprises the information of cumulative metric (example of " the cumulative path evaluation of estimate " of the application's claim) and package ID.Herein, the cumulative metric being contained in route package is the own node tolerance that the node that have sent this route package is preserved when sending.
" periphery node table " is the table of transmission times of successively average and route package recording periphery address of node, RSSI.Herein, all mid-side nodes are in the node that can to carry out with own node in the scope of the transmission and reception of package.
" uplink relay destination " is from node 7 each imiddle address of node, uplink relay destination (example of " the uplink relay destination nodal information " of the application's claim) of preserving as routing iinformation.Bellman-ford algorithm is adopted in this agreement.Therefore, constructed relay route is the such tree structure of Fig. 1, respectively from node 7 ionly there is unique uplink relay destination.Therefore, respectively from node 7 ipreserve address of node, uplink relay destination as routing iinformation.Owing to can review and validate the transmission source address of the package to up direction relaying when relaying works, so downlink relay destination is uncertain when route, and check after path is determined.
" own node TimeID " is delivery time in order to identify each route package and the time stamp had.
In addition, necessary in this agreement parameter is: the interval T c between the stand-by period Tw respectively removed from the routing history of node, the execution times N r of circulation, circulation, respectively circulate the stand-by period Tr of core node and the stand-by period Ts from node.
First, with reference to Fig. 3, about an example of core node 5 description architecture of Fig. 1.
Core node 5 comprises: the node storage part 13 storing periphery node table; Store the parameter storage part 15 of various parameter; Be provided with the input part 17 of mains switch 19 and reset button 21; With from node 7 icarry out the wireless communication part 23 of radio communication; The control part 25 of the work of control core node 5; The more node registration process portion 27 of the periphery node table of new node storage part 13.Wireless communication part 23 comprises: antenna 29; Control the communication control unit 31 of the communication utilizing antenna 29 to carry out.Mains switch 19 is operated when the plant-grid connection of core node 5.Reset button 21, such as, such as changing core node 5 and from node 7 ithe configuration of part or all situation and/or delete from node 7 from communication system 1 ia part, newly increased when having change from such the configured node of the situation of node, indicate to rebuild relay route and to be operated to carry out from outside.
Secondly, with reference to an example of the work of the core node 5 of Fig. 4 key diagram 1.This process of Fig. 4, when needs initialization, carries out Nr time with the Tc time interval from initialization.In the diagram, as the initialized situation of needs, be described by situation about operating for mains switch 19 or reset button 21.
Control part 25 judges whether that energising or reset button 21 are pressed (step STC1).When being operated, in core node 5, the package ID of reset route package and the own node TimeID of core node 5 is set as the moment sending route package by control part 25, controls the communication control unit 31 of wireless communication part 23 and passes through antenna part 29 to each from node 7 isend reset route package (step STC2), wait for the Tw time (such as 7 seconds) (step STC3), with Tc interval to each from node 7 isend usual route package (step STC4).Now, the cumulative metric of route package is 0, and package ID is set as that core node sends the moment of broadcasting packages.On the other hand, in step STC1, when not both being energized and reset button 21 is not pressed yet, carry out the process of step STC4.This is for once to circulate, if core node 5 have passed through the Tr time from circulation starts, and end loop, thus communication system 1 completes a route.In addition, if receiving node registration package, then node registration process portion 27 is using the package transmission source node of this package as all mid-side nodes, is registered in the periphery node table (step STC5) of node storage part 13.
In addition, time interval Tc owing to being not only certain intervals, and stablizes progressively in this agreement, so also can change the time interval according to number of times.In addition, control part 25 also can carry out the broadcast of reset route package with the predetermined moment in step STC1, so as such as weekend and/or in one day also according to night and daytime equal time section change relay route.
Then, with reference to Fig. 5 and Fig. 6, about Fig. 1 from node 7 ibe described.
With reference to Fig. 5 key diagram 1 from node 7 istructure one example.From node 7 icomprise: the own path evaluation of estimate storage part 51 storing own node tolerance i(example of " the own path evaluation of estimate memory cell " of the application's claim); Store the uplink relay destination memory cell 53 of address of node, uplink relay destination i(example of " the uplink relay destination memory cell " of the application's claim); Store the TimeID storage part 55 of own node TimeID i; Store the node storage part 57 of periphery node table i(example of " the node memory cell " of the application's claim); Store the parameter storage part 59 of various parameter i; The wireless communication part 65 of radio communication is carried out with other node i; Control from node 7 ithe control part 71 of work i.Wireless communication part 65 icomprise: for carrying out the antenna 61 of radio communication with other node i; Control utilizes antenna 61 ithe communication control unit 63 of the communication carried out i.
Control part 71 icomprise: the judging part 73 judging the kind of the package received i; When receiving reset route package, initialized initialization section 75 is carried out to periphery node table etc. i(example of " initialization unit " of the application's claim); Carry out from core node 5 to this from node 7 when receiving usual route package ithe route construction handling part 77 of structure process of relay route i(example of " the route construction processing unit " of the application's claim).
Route construction handling part 77 ihave: when the package transmission source of received usual route package unregistered in periphery node table register the node registration process portion 81 of package transmission source i(example of " the node registration process unit " of the application's claim); The received power R of the usual route package that n-th (n is natural number) receives from the reception of reset route package is calculated according to formula (1) nsuccessively average A nthe received power evaluation of estimate calculating part 83 of (example of " the received power evaluation of estimate " of the application's claim) i(example of " the received power evaluation of estimate computing unit " of the application's claim); Relatively receive package ID and the own node TimeID of package, judge whether the new circular treatment portion 85 starting new circulation i; Use successively average A ncalculate loss from transmission source node to own node, and be contained in the cumulative metric receiving package and be added and calculate the cumulative path evaluation of estimate calculating part 87 of new tolerance (hereinafter referred to as " newly measuring ") i(example of " the cumulative path evaluation of estimate computing unit " of the application's claim); The comparing section 89 that relatively newer tolerance is measured with own node i; When new tolerance is measured little than own node, using package transmission source as new uplink relay destination, carrying out update process using newly measuring as new own node tolerance, each node being stored in periphery node table being sent to the routing update portion 91 of the tolerance of the own node after upgrading i(example of " the routing update unit " of the application's claim).
Herein, cumulative path evaluation of estimate calculating part 87 iloss is calculated according to formula (2).TX_POWER represents transmitted power, and unit is dBm.
[numerical expression 3]
PassLoss = 10 TX _ POWER - RSSI 10 . - - - ( 2 )
Secondly, with reference to Fig. 6, about Fig. 5 from node 7 iwork be described.
From node 7 iwait for the reception (step STS1) of route package, if receive route package, then judging part 73 ijudge the kind (step STS2) of the route package received.When reset route package, initialization section inspection receives the package ID of package, if newer than the TimeID of self, then identical reset route package is broadcast to all mid-side nodes, remove periphery node table, own node tolerance is set as maximum, own node TimeID is set as the package ID (step STS3) receiving package.
When receiving usual route package, node registration process portion 81 iconfirm transmission source node, check the registration (step STS4) of whether not this transmission source node in periphery node table.When not registered, be registered in periphery node table.Now, RSSI when receiving is set to successively average initial value, receives number of times and be set as 1 (step STS5).
When for from when being registered in the route package of node of table, received power evaluation of estimate calculating part 83 iaccording to the current successively average A to this transmission source node n-1with received power R nformula (1) is utilized to ask for new successively average A n, successively average with this node of calculated value updating form, increases reception number of times 1 time (step STS6).
Then, new circular treatment portion 85 icheck the package ID receiving package, than under own node TimeID news, be judged as that new circulation starts (step STS7), own node tolerance is set as maximum, and own node TimeID is set as the package ID (step STS8) receiving package.If be former circulation, then proceed to the process of step STS9.
Then, cumulative path evaluation of estimate calculating part 87 iuse and calculated loss from transmission source node to own node by successively average RSSI, and be contained in the cumulative metric receiving package and be added and newly measured (step STS9).
Then, comparing section 87 irelatively newer tolerance is measured (step STS10) with own node.When new tolerance is measured little than own node, upgrade own node tolerance with this value, uplink relay destination is updated to the transmission source address of node receiving package.Then, broadcast newly to measure the new route package (step STS11) as cumulative metric.When new tolerance is measured little unlike own node, turn back to the process of step STS1.
From node 7 iif have passed through the Ts time from new circulation starts, end loop.
Then, by using the successively average method for routing of RSSI between node to be installed on testboard, evaluating characteristics is carried out in practical field (field).The Japanese Culture Ministry of Education science using the present inventors to advance to testboard is economized knowledge and to be trooped cause of creating into II phase outcome matter of exploration project of (MEXT know Network ラ ス タ Chong become the cause II phase) " MIMO-MESH point " and Picomesh LunchBox (hereinafter referred to as " LB ").
LB is equipped with the wireless universal LAN module of the 802.11b/g/a of 3 systems, distributes 2 systems to trunk use, distributes 1 system and uses to line attachment.Distribute different channels to each wireless module, avoid the interference between line attachment and trunk.
As shown in Figure 7, core node C and 5 is built from node S 1~ S 5communication system.During experiment, the parameter of agreement is, in each circulation, the stand-by period Tr of core node is 2 seconds, and be 2 seconds from the stand-by period Ts of node in each circulation, be 5 seconds from the reset stand-by period Tw of node, the interval T c of each circulation is 3 minutes, and cycle-index Nr is 100 times.
The experimental result of the pattern of the relay route that table 1 represents when applying the Routing Protocol in existing minimum transfer loss route, the pattern of relay route occurred every performing the route of total 100 times in 3 minutes and application the present embodiment, the same route performing total 100 times occurs.
When applying existing method for routing, build the relay route of 8 different patterns according to the time period.The situation of transmission path when depending on route, system is unstable.In contrast, when applying the agreement that the application proposes, confirm to be fixed on the route 1 shown in Fig. 7 from the circulation of the 2nd, 3 time.Therefore, known: according to the present embodiment, in the actual environment that transmission path changes in time, also can build stable relay route.
[table 1]
Appearance pattern Existing method The present embodiment
Route1 35% 100%
Route2 20% 0%
Route3 10% 0%
Route4 5% 0%
Route5 15% 0%
Route6 5% 0%
Route7 5% 0%
Route8 5% 0%
In addition, the present embodiment is premised on the system that core node is, but also can easily expand to the system that there is multiple core node.When there is multiple core node, route package sends from each core node.Therefore, such as own node TimeID is set as 0 when initialization by core node 5.If core node 5 receives reset route package, then check package ID, if newer than own node TimeID, then broadcast identical reset route package, upgrade own node TimeID with the package ID receiving package.Then, after the Tw time with Tc interval to the usual route package of surrounding broadcast, if transmission times reaches Nr, terminate.By being set to this system, also can realize when there is multiple core node.
In addition, received power evaluation of estimate calculating part 83 of the present invention ithe calculating of received power evaluation of estimate be also not limited to the present embodiment.Such as also can such as formula (3), by the received power R of reset route package 0as the initial value A of received power evaluation of estimate 0, about the received power evaluation of estimate A of the usual route package that n-th (n is natural number) receives n, according to successively on average calculating of the received power of route package.In the case, as long as in the step STS3 of Fig. 6, in initialization section 75 ito all mid-side node storage parts 57 iunder carrying out initialized situation, to all mid-side node storage parts 57 imake it combine and store the transmission source node of reset route package and the initial value of received power evaluation of estimate, then calculate successively on average.Like this, the received power of reset route package also can be used to calculate received power evaluation of estimate.Generally, received power evaluation of estimate calculating part 83 inot only use the received power of the usual route package received, the received power of part or all of the received power of reset route package and/or other usual route package can also be used to calculate received power evaluation of estimate.Particularly, also can to α nand β nnand β nfor the function of n, for nonidentical in the function of zero) calculate according to formula (4) the received power R of usual route package that n-th (n is the natural number of more than 2) receive nevaluation of estimate and received power evaluation of estimate A n.In the case, when n is 1, such as, also A can be set to 1=R 1.And then, also can by A 0as the received power R of reset route package 0and A is calculated by the addition of constant times in the same manner as formula (4) 1.
And then, in formula (4), also can α nand β nat least one party be constant.By being set to this constant, the variation of RSSI can be relaxed.
In addition, in figure 6, the process of step STS9 also can be carried out before the process of step STS7 and STS8.
[numerical expression 4]
A n = n × A n - 1 + R n n + 1 . Wherein, A 0=R 0. (3)
A n=α n×A n-1n×R n. (4)
[patent documentation]
Patent documentation 1: Japan Patent No. 3928636 publication
Patent documentation 2: Japan Patent No. 4227737 publication
Patent documentation 3: Japan Patent No. 4389929 publication
[non-patent literature]
Non-patent literature 1: river long narrow flag, Gu Chuanzhu, " research relevant with required frequency band with the relaying oriented antenna number in wireless base station junction network ", skill and technique learned by letter, RCS2001-94, July calendar year 2001.
Non-patent literature 2:Andrea Goldsmith, " Wireless Communications ".
Non-patent literature 3:B.P.Lathi, " Modern Digital and AnalogCommunication system ".

Claims (6)

1. a communication system, comprises the core node that is connected to underlying network and is connected to described core node multiple from node from node by radio communication directly or via other,
Described core node sends instruction from described core node to this from the initialized reset route package of the communication path of node to described from node, thereafter send multiple instruction from described core node to this usual route package from the structure of the communication path of node
Describedly respectively to comprise from node:
Own path evaluation of estimate memory cell, it stores from described core node to this from the evaluation of estimate of the communication path of node and own path evaluation of estimate;
Uplink relay destination memory cell, it stores uplink relay destination information, and described uplink relay destination information represents from this from node to the initial relaying destination node the communication path of described core node and uplink relay destination node; And
Route construction processing unit, its when from receive receive n described usual route package from identical transmission source node described reset route package, judge whether described transmission source node is set to new described uplink relay destination node and determines from described core node to this from the communication path of node, wherein, n is natural number;
Described route construction processing unit has:
Received power evaluation of estimate computing unit, it, based on the received power of the n-th described usual route package received, calculates this evaluation of estimate from the received power between node and described transmission source node and received power evaluation of estimate;
New cumulative path evaluation of estimate computing unit, it is based on from described core node to the evaluation of estimate of the relay route of described transmission source node and described received power evaluation of estimate, calculate the n-th described usual route package received via the evaluation of estimate of communication path and new cumulative path evaluation of estimate; And
Routing update unit, it is when described new cumulative path evaluation of estimate is less than described own path evaluation of estimate, the package transmission source making described uplink relay destination storage part store the described usual route package received is used as new described uplink relay destination nodal information, makes cumulative path evaluation of estimate described in described own path evaluation of estimate cell stores be used as new described own path evaluation of estimate and carry out update process;
Wherein, described received power evaluation unit, when n is more than 2, not only based on the received power of the n-th described usual route package received, also based on received power and/or the received power of part or all of described usual route package that receives in addition of described reset route package, calculate this evaluation of estimate from the received power between node and described transmission source node and received power evaluation of estimate.
2. communication system as claimed in claim 1, wherein:
Described received power evaluation of estimate computing unit with the received power of constant or described reset route package for initial value, for α nand β n, according to formula (eq1), calculate the received power R of the described usual route package of the n-th reception nevaluation of estimate and received power evaluation of estimate A n, α nand β nfor the function of n, α nfor nonidentical in the function of zero:
A n=α n×A n-1n×R n. (eq1)。
3. communication system as claimed in claim 2, wherein:
In formula (eq1), A 1=R 1, when n is more than 2, α n=(n-1)/n and β n=1/n.
4. communication system as claimed in claim 2, wherein:
In formula (eq1), α nand/or β nfor constant.
5. from a node, its node directly or via other is connected to core node by radio communication, and described core node is connected to underlying network, describedly comprises from node:
Own path evaluation of estimate memory cell, it stores from described core node to this from the evaluation of estimate of the communication path of node and own path evaluation of estimate;
Uplink relay destination memory cell, it stores uplink relay destination information, and described uplink relay destination information represents from this from node to the initial relaying destination node the communication path of described core node and uplink relay destination node; And
Route construction processing unit, it is when receiving n usual route package from identical transmission source node after receiving reset route package from described core node, judge whether described transmission source node is set to new described uplink relay destination node and determines from described core node to this from the communication path of node, described reset route package instruction initialization from the communication path of node from described core node to this, described usual route package instruction is structure from the communication path of node from described core node to this, wherein, n is natural number;
Described route construction processing unit has:
Received power evaluation of estimate computing unit, the successively average computation received power evaluation of estimate A of the individual described usual route package of n that is successively average or that receive of its received power by described reset route package and the individual described usual route package of the n received n, described received power evaluation of estimate A nevaluate the received power R of the described usual route package that n-th receives n;
New cumulative path evaluation of estimate computing unit, it is based on from described core node to the evaluation of estimate of the relay route of described transmission source node and described received power evaluation of estimate, calculate the n-th described usual route package received via the evaluation of estimate of communication path and new cumulative path evaluation of estimate; And
Routing update unit, it is when described new cumulative path evaluation of estimate is less than described own path evaluation of estimate, the package transmission source making described uplink relay destination storage part store the described usual route package received is used as new described uplink relay destination nodal information, makes cumulative path evaluation of estimate described in described own path evaluation of estimate cell stores be used as new described own path evaluation of estimate and carry out update process.
6. a route constructing method, it comprises the core node that is connected to underlying network and is connected to described core node multiple from the route constructing method communication system of node from node by radio communication directly or via other,
Describedly respectively to comprise from node:
Own path evaluation of estimate memory cell, it stores from described core node to this from the evaluation of estimate of the communication path of node and own path evaluation of estimate;
Uplink relay destination memory cell, it stores uplink relay destination information, and described uplink relay destination information represents from this from node to the initial relaying destination node the communication path of described core node and uplink relay destination node; And
Week mid-side node memory cell, its storage can the node of transmission and reception package and package transmission and reception with this node time the evaluation of estimate of received power and the combination of received power evaluation of estimate;
Described route constructing method comprises:
Initialization step, described core node sends instruction from described core node to this from the initialized reset route package of the communication path of node to described from node, receive described reset route package judge whether to receive this reset route package for the first time from the initialization unit of node, when receiving for the first time, identical described reset route package is sent to the node being stored in described all mid-side node memory cell, and delete the information being stored in described all mid-side node memory cell, described own path evaluation of estimate is set as maximum; And
Route construction step, described core node to described from node determine send order and send multiple instruction from described core node to this usual route package from the structure of the communication path of node, receiving from node described in described usual route package,
Received power evaluation of estimate computing unit,
When the transmission source node of received usual route package is not stored in described all mid-side node memory cell, received power based on described usual route package calculates this evaluation of estimate from the received power between node and described transmission source node and received power evaluation of estimate, make the combination of transmission source node and described received power evaluation of estimate described in described all mid-side node cell stores
When the transmission source node of received usual route package is stored in described all mid-side node memory cell, not only based on the received power of described usual route package, also calculate new received power evaluation of estimate based on the described received power evaluation of estimate being stored in described all mid-side node memory cell, to described all mid-side node memory cell, it is made to store the combination of described transmission source node and new described received power evaluation of estimate
Based on the order of described transmission, new circular treatment unit judges whether the described usual route package received is the described usual route package do not received in the past, if the described usual route package do not received, then described own path evaluation of estimate is set to maximum
New cumulative path evaluation of estimate computing unit is based on from described core node to the evaluation of estimate of the relay route of described transmission source node and described received power evaluation of estimate, calculate the described usual route package that receives via the evaluation of estimate of communication path and new cumulative path evaluation of estimate
Routing update unit is when described new cumulative path evaluation of estimate is less than described own path evaluation of estimate, the package transmission source making described uplink relay destination storage part store the described usual route package received is used as new described uplink relay destination nodal information, cumulative path evaluation of estimate described in described own path evaluation of estimate cell stores is made to be used as new described own path evaluation of estimate and to carry out update process, new described own path evaluation of estimate is sent to the node being stored in described all mid-side node memory cell, determine thus from described core node to this from the communication path of node.
CN201180010501.2A 2010-02-23 2011-02-22 Communications system, slave node, route building method, and program Active CN102792737B (en)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
JP2010-037141 2010-02-23
JP2010037141 2010-02-23
JP2010-040271 2010-02-25
JP2010040271 2010-02-25
PCT/JP2011/053845 WO2011105371A1 (en) 2010-02-23 2011-02-22 Communications system, slave node, route building method, and program

Publications (2)

Publication Number Publication Date
CN102792737A CN102792737A (en) 2012-11-21
CN102792737B true CN102792737B (en) 2015-03-25

Family

ID=44506777

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201180010501.2A Active CN102792737B (en) 2010-02-23 2011-02-22 Communications system, slave node, route building method, and program

Country Status (7)

Country Link
US (1) US8693366B2 (en)
EP (1) EP2541989B1 (en)
JP (1) JP5777112B2 (en)
CN (1) CN102792737B (en)
AU (1) AU2011218961B2 (en)
TW (1) TWI472245B (en)
WO (1) WO2011105371A1 (en)

Families Citing this family (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104205940B (en) 2012-03-02 2018-04-13 富士通株式会社 Ad hoc network system and routing resource
WO2013142733A1 (en) 2012-03-21 2013-09-26 Greene Charles E Wireless sensor system, method and apparatus with switch and outlet control
GB2504739B (en) * 2012-08-08 2015-01-07 Vodafone Ip Licensing Ltd CQI adjustment
GB2512285B (en) * 2013-03-22 2015-09-30 Cambridge Comm Systems Ltd Node partitioning
CN103391142A (en) * 2013-07-24 2013-11-13 福建星网锐捷网络有限公司 Method and device for determining RSSI value of channel, and access point equipment
EP3061325B1 (en) 2013-10-23 2021-06-23 Powercast Corporation Method for automated lighting control
JP6373071B2 (en) * 2014-06-03 2018-08-15 三菱電機株式会社 Network controller
WO2016179253A1 (en) 2015-05-04 2016-11-10 Greene Charles E Automated system for lighting control
JP6580462B2 (en) * 2015-11-02 2019-09-25 PicoCELA株式会社 Network system, node, frame communication method and program
CN105681189B (en) * 2016-01-21 2019-05-17 上海芃矽半导体技术有限公司 Data forwarding method and node device for grid network
CN105792477A (en) * 2016-02-23 2016-07-20 毛琦 Two-way networking method and device for 2.4G wireless dimming lamp
CN109644386B (en) * 2016-09-05 2022-12-09 三菱电机株式会社 Wireless communication terminal, wireless communication system, and recording medium
CA3037754A1 (en) 2016-10-07 2018-04-12 Powercast Corporation Automated system for lighting control
US11197225B2 (en) 2018-01-25 2021-12-07 Aitrax Co., Ltd. Communication device, communication method, and program
JP7218852B2 (en) 2018-05-02 2023-02-07 PicoCELA株式会社 Wireless path control method, wireless communication system, wireless node, and wireless path control program
US11483757B2 (en) 2018-05-02 2022-10-25 Picocela Inc. Wireless route control method, wireless communication system, and wireless node
EP3831021A1 (en) 2018-07-27 2021-06-09 Gotenna Inc. VINEtm ZERO-CONTROL ROUTING USING DATA PACKET INSPECTION FOR WIRELESS MESH NETWORKS
JP7295709B2 (en) 2019-06-05 2023-06-21 日本無線株式会社 Wireless communication unit and wireless network system using it
WO2020255250A1 (en) * 2019-06-18 2020-12-24 株式会社AiTrax Communication device, communication method, and program

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1717108A (en) * 2004-07-01 2006-01-04 日本电气株式会社 Service area is determined method

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2024988A1 (en) 1990-04-30 1991-10-31 Fredrick L. Magnus Method of processing, storing and utilizing sheets of elastomeric coated cords
EP1142227A2 (en) * 1998-12-23 2001-10-10 Nokia Wireless Routers, Inc. A unified routing scheme for ad-hoc internetworking
JP4227737B2 (en) 2000-08-30 2009-02-18 日本電気株式会社 Wireless network, relay node, relay transmission method used therefor, and program thereof
JP4389929B2 (en) 2000-08-30 2009-12-24 日本電気株式会社 Wireless network, relay node, core node, and relay method
JP3928636B2 (en) 2000-08-30 2007-06-13 日本電気株式会社 Wireless network, relay node, core node, relay transmission method used therefor, and program thereof
US7058018B1 (en) * 2002-03-06 2006-06-06 Meshnetworks, Inc. System and method for using per-packet receive signal strength indication and transmit power levels to compute path loss for a link for use in layer II routing in a wireless communication network
JP4378192B2 (en) 2004-03-05 2009-12-02 富士通株式会社 COMMUNICATION TERMINAL, COMMUNICATION PROGRAM, AND COMPUTER-READABLE RECORDING MEDIUM CONTAINING COMMUNICATION PROGRAM
JP4526886B2 (en) * 2004-07-05 2010-08-18 株式会社日立製作所 Radio apparatus, radio communication system control method, and radio communication system
US7941537B2 (en) * 2005-10-03 2011-05-10 Genband Us Llc System, method, and computer-readable medium for resource migration in a distributed telecommunication system
US8098658B1 (en) * 2006-08-01 2012-01-17 Hewett-Packard Development Company, L.P. Power-based networking resource allocation
JP2009088750A (en) * 2007-09-28 2009-04-23 Mitsubishi Electric Corp Management device, radio terminal, ad hoc network system, setting changing program of management device, setting changing method of management device, setting changing program of radio terminal, and setting changing method of radio terminal
US7948966B2 (en) * 2007-10-01 2011-05-24 Powerwave Cognition, Inc. Multi-metric routing calculations
JP4874939B2 (en) * 2007-11-21 2012-02-15 日本電気通信システム株式会社 Wireless device and wireless network provided with the same
US8194591B2 (en) * 2007-12-13 2012-06-05 Thomson Licensing Communication methods in a network
CA2721911C (en) * 2008-04-25 2015-11-24 Fujitsu Limited Node device and program
US7978632B2 (en) * 2008-05-13 2011-07-12 Nortel Networks Limited Wireless mesh network transit link topology optimization method and system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1717108A (en) * 2004-07-01 2006-01-04 日本电气株式会社 Service area is determined method

Also Published As

Publication number Publication date
JP5777112B2 (en) 2015-09-09
US8693366B2 (en) 2014-04-08
AU2011218961B2 (en) 2015-07-09
WO2011105371A1 (en) 2011-09-01
AU2011218961A1 (en) 2012-10-04
US20120320781A1 (en) 2012-12-20
EP2541989A4 (en) 2017-01-11
EP2541989B1 (en) 2018-04-11
CN102792737A (en) 2012-11-21
JPWO2011105371A1 (en) 2013-06-20
TWI472245B (en) 2015-02-01
EP2541989A1 (en) 2013-01-02
TW201210370A (en) 2012-03-01

Similar Documents

Publication Publication Date Title
CN102792737B (en) Communications system, slave node, route building method, and program
Förster et al. Froms: A failure tolerant and mobility enabled multicast routing paradigm with reinforcement learning for WSNs
Liu et al. Relay node placement for wireless sensor networks deployed in tunnels
Tan et al. Energy harvesting aware topology control with power adaptation in wireless sensor networks
Mardini et al. Comprehensive performance analysis of RPL objective functions in IoT networks
CN103945534A (en) Second-order lag information based wireless sensor network consistency method
Zaidi et al. Wireless multihop backhauls for rural areas: A preliminary study
Zhao et al. Exploiting link correlation for core-based dissemination in wireless sensor networks
JV et al. Exploring data collection on Bluetooth Mesh networks
He et al. Minimum time length link scheduling under blockage and interference in 60GHz networks
US20240064604A1 (en) Wireless route control method, wireless communication system, and wireless node
Tummula et al. Flexicast: A structure-adaptive protocol for efficient data-sharing in iot
US20090310490A1 (en) Radio communication system
Foubert et al. RODENT: a flexible TOPSIS based routing protocol for multi-technology devices in wireless sensor networks
Rodenas-Herraiz et al. On the improvement of wireless mesh sensor network performance under hidden terminal problems
Tolba et al. A stable clustering algorithm for highly mobile ad hoc networks
Maia et al. A multicast reprogramming protocol for wireless sensor networks based on small world concepts
Park et al. Mobility state based routing method in vehicular ad-hoc network
Meera et al. An efficient mobile sink routing in wireless sensor network using dynamic steiner tree
Yu et al. Link availability modeling for routing algorithms to reduce the link break time in MANETs
Joe A path selection algorithm with energy efficiency for wireless sensor networks
Naveen et al. Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks
Arom-oon et al. The fuzzy path selection for OLSR routing protocol on MANET (based on IPV 6 Over IEEE 802.15. 4)
Zhao et al. A trustworthy neighbor discovery algorithm for pure directional transmission and reception in MANET
Barboza et al. A localized algorithm based on minimum cost arborescences for the MECBS problem with asymmetric edge costs

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant