CN103313286B - Body area network network system node data transmission conflict estimation & disposing method - Google Patents

Abstract

The present invention relates to body area network network system node data transmission conflict estimation & disposing method, belong to wireless sensor network application layer field of network management.It is divided into terminal node conflict judgement and terminal node clash handle two parts, mainly utilize the attack time of each terminal node and operation range equal time related data to complete precomputation to each terminal node attack time, by with known terminal node attack time compared the judgement whether conflicted.If institute's calculated data shows to clash with the communication of aggregation node between terminal node, utilize and again the mode that individual terminal node operation range and number of times distribute is dealt with problems within system cycle.The conflict occurred when this mechanism is mainly used in judging that in body area network network, terminal node communicates with aggregation node, and the row relax of advancing by leaps and bounds that liquidates.

Description

Body area network network system node data transmission conflict estimation & disposing method

Technical field

The invention belongs to the transmission of data between body area network network system node, for the conflict that occurs during transfer of data between decision node and the row relax of advancing by leaps and bounds that liquidates.

Background technology

Body area network network comprises each layers such as setting up physical layer, data link layer, routing layer, and mechanism mainly acts on the application layer of network and coordinates the communication between aggregation node and terminal node by calling other each layer functions.

Designed node data transmission collision judgement and settlement mechanism are mainly used in body area network network system and carry out coordinating communication between each terminal node and aggregation node.

Carrying out universal time coordinated at application system to the communication between aggregation node and terminal node needs aggregation node and terminal node to have timing and sleep function, and can be controlled attack time of node, sleep and system clock by coding.

Body area network is as a kind of novel wireless sensor network, and concept proposes more late, and do not have specialized designs at present for the node administration mechanism of body area network, its network layer is to the related mechanism of the networks such as the existing local area network (LAN) of coordination Primary Reference of each node and a territory net.The node working mode being applied to body area network network system is at present applicable to send to terminal node the situation that data time interval does not require or each terminal node data send continuously more.And when data that terminal node sends to transmission between be separated with require time, if still adopt current mechanism, data after work specific period between terminal node send and can overlap attack time, cause aggregation node to receive the conflict of data, the correctness that impact receives data even can not receive data.

Summary of the invention

The invention provides a kind of body area network network system node data transmission conflict estimation & disposing method, send with the data solved after work specific period between terminal node and can overlap attack time, cause aggregation node to receive the conflict of data, the correctness of impact reception data even can not receive the problem of data.

The technical scheme that the present invention takes is: comprise the following steps:

(1) conflict of each terminal node operating time in certainty annuity

Determine each terminal node work period, the maximum in all terminal node cycles, as system cycle, is designated as T here ₀;

If the operating time that there are two or more in system does not meet:

T _smP≠T _snQ

Wherein $P=\mathrm{1,2,3},...,\frac{T_0}{T_{\mathrm{sm}}},$ $Q=\mathrm{1,2,3},...,\frac{T_0}{T_{\mathrm{sn}}},$ T _smand T _snfor the operating interval of arbitrfary point M and some N, now terminal node M clashed with the operating time of some N, and system needs to redistribute the system works time started;

(2) change the terminal node work period, increase terminal node frequency

After determining to clash by step (1), the span of the operation range of each terminal node is widened into:

$0<N_k^{\&prime;}\&le;\frac{T_0}{T_{\mathrm{sk}}}$

Wherein N ' _kfor the frequency of a kth node, T _skfor the operating interval of this node, after doing as above expansion to work times, its work period is recalculated as:

$T_{\mathrm{sk}}^{\&prime;}=\frac{T_0}{N_k^{\&prime;}}$

Wherein T ' _skfor change frequency N ' _kafter the node work period.

When clashing the attack time of two nodes, suppose to be respectively node m and n, P time and Q time occur when clashing respectively, then:

T _smP=T _snQ

Wherein T _smand T _snfor the operating interval of terminal node M and N, the strategy now taked clashes node m and n at system cycle T by increasing ₀the number of times of middle generation is to avoid conflict, and the number of times of increase is respectively R _m, R _n, its value should meet:

T _s′ _m(N _m+R _m)=T ₀

T _s′ _n(N _n+R _n)=T ₀

Here N ' is supposed _m=N _m+ R _m, N ' _n=N _n+ R _n, its value should meet:

$0<N_m^{\&prime;}\&le;\frac{T_0}{T_{\mathrm{sm}}^{\&prime;}}$

$0<N_n^{\&prime;}\&le;\frac{T_0}{T_{\mathrm{sn}}^{\&prime;}}$

And:

T' _smP ₁≠T _kQ ₁

T' _snP ₂≠T _kQ ₂

Wherein T' _smand T' _snfor increasing the terminal node origination interval in system cycle after terminal node frequency, T _kfor any node cycle, P ₁, P ₂, Q ₁and Q ₂for node frequency:

$\begin{array}{c}{P}_1,P_2=\mathrm{1,2,3},...,\frac{T_0}{T_{\mathrm{sm}}^{\&prime;}},\\ Q_1,Q_2=\mathrm{1,2,3},...,\frac{T_0}{T_{\mathrm{sn}}^{\&prime;}}.\end{array}$

(3) collision problem between node is solved according to energy ezpenditure minimum principle

For R _mand R _nvalue △ E should be made minimum simultaneously:

△E=E′-E

=E _m(N _m+R _m)+E _n(N _n+R _n)-E _mN _m-E _nN _n

=E _mR _m+E _nR _n

Wherein △ E is the energy recruitment in increase system one-period after terminal node frequency, R _mand R _nfor the frequency that node M and N increase, the energy of two nodes is defined as E respectively here _nand E _m, suppose E _n<E _mby increasing the cycle of the frequency concept transfer of node in one-period when clashing, to reach concept transfer time of origin, thus reach the object avoided conflict, the conflict that operating time occurs multiple terminal node if exist in system, then should sort to node according to consumed energy E, and the row relax of advancing by leaps and bounds that liquidates successively from small to large, if the increase number of times of two nodes is respectively R _mand R _n, then R _mand R _nvalue in accordance with following order, result of calculation should be redistributed, with make energy consumption increase minimum:

R _m=i

R _n=k-i-1

Wherein: k=2,3,4 ..., i=0,1,2 ..., k-1, carries out traversal value for each k value reply i here.

Advantage of the present invention utilizes the data such as node acquisition interval and acquisition time, completes the judgement of the conflict to terminal node each in body area network network system, utilizes collision avoidance mechanism to effectively prevent the conflict caused due to coincidence attack time of different node.This method is minimum as basic norm using system energy consumption when redistributing each terminal node frequency, make system reduce system energy consumption while avoiding conflict as far as possible, can repeat to judge after method completes once circulation, if still have conflict, again method is circulated, to adapt to the needs of body area network network system low-power consumption.

Embodiment

Comprise the following steps:

(1) conflict of each terminal node operating time in certainty annuity

Determine each terminal node work period, the maximum in all terminal node cycles, as system cycle, is designated as T here ₀;

If the operating time that there are two or more in system does not meet:

T _smP≠T _snQ

Wherein $P=\mathrm{1,2,3},...,\frac{T_0}{T_{\mathrm{sm}}},$ $Q=\mathrm{1,2,3},...,\frac{T_0}{T_{\mathrm{sn}}},$ T _smand T _snfor the operating interval of arbitrfary point M and some N, now terminal node M clashed with the operating time of some N, and system needs to redistribute the system works time started;

(2) change the terminal node work period, increase terminal node frequency

After determining to clash by step (1), the span of the operation range of each terminal node is widened into:

$0<N_k^{\&prime;}\&le;\frac{T_0}{T_{\mathrm{sk}}}$

Wherein N ' _kfor the frequency of a kth node, T _skfor the operating interval of this node, after doing as above expansion to work times, its work period is recalculated as:

$T_{\mathrm{sk}}^{\&prime;}=\frac{T_0}{N_k^{\&prime;}}$

Wherein T ' _skfor change frequency N ' _kafter the node work period.

When clashing the attack time of two nodes, suppose to be respectively node m and n, P time and Q time occur when clashing respectively, then:

T _smP=T _snQ

Wherein T _smand T _snfor the operating interval of terminal node M and N, the strategy now taked clashes node m and n at system cycle T by increasing ₀the number of times of middle generation is to avoid conflict, and the number of times of increase is respectively R _m, R _n, its value should meet:

T′ _sm(N _m+R _m)=T ₀

T′ _sn(N _n+R _n)=T ₀

Here N ' is supposed _m=N _m+ R _m, N ' _n=N _n+ R _n, its value should meet:

$0<N_m^{\&prime;}\&le;\frac{T_0}{T_{\mathrm{sm}}^{\&prime;}}$

$0<N_n^{\&prime;}\&le;\frac{T_0}{T_{\mathrm{sn}}^{\&prime;}}$

And:

T' _smP ₁≠T _kQ ₁

T' _snP ₂≠T _kQ ₂

Wherein T' _smand T' _snfor increasing the terminal node origination interval in system cycle after terminal node frequency, T _kfor any node cycle, P ₁, P ₂, Q ₁and Q ₂for node frequency:

$\begin{array}{c}{P}_1,P_2=\mathrm{1,2,3},...,\frac{T_0}{T_{\mathrm{sm}}^{\&prime;}},\\ Q_1,Q_2=\mathrm{1,2,3},...,\frac{T_0}{T_{\mathrm{sn}}^{\&prime;}}.\end{array}$

(3) collision problem between node is solved according to energy ezpenditure minimum principle

For R _mand R _nvalue △ E should be made minimum simultaneously:

△E=E′-E

=E _m(N _m+R _m)+E _n(N _n+R _n)-E _mN _m-E _nN _n

=E _mR _m+E _nR _n

Wherein △ E is the energy recruitment in increase system one-period after terminal node frequency, R _mand R _nfor the frequency that node M and N increase, the energy of two nodes is defined as E respectively here _nand E _m, suppose E _n<E _mby increasing the cycle of the frequency concept transfer of node in one-period when clashing, to reach concept transfer time of origin, thus reach the object avoided conflict, the conflict that operating time occurs multiple terminal node if exist in system, then should sort to node according to consumed energy E, and the row relax of advancing by leaps and bounds that liquidates successively from small to large, if the increase number of times of two nodes is respectively R _mand R _n, then R _mand R _nvalue in accordance with following order, result of calculation should be redistributed, with make energy consumption increase minimum:

R _m=i

R _n=k-i-1

Wherein: k=2,3,4 ..., i=0,1,2 ..., k-1, carries out traversal value for each k value reply i here.

Usually running into two kinds of situations when realizing by designed conflict estimation & disposing method below, being exemplified below respectively to further illustrate the present invention.

1. two terminal nodes clash

Suppose have node A, B and C, its operating interval is respectively 35min, 10min and 10min, and energy ezpenditure meets:

E _a>E _b>E _c

Utilize conflict estimation & disposing method to process terminal node each in system, step is as follows:

Can find out that when system does not add the coordination system Node B is equal with the operating time of node C after system works during 10min and 20min, clashes.Utilize the operating time of Mechanism of Conflict Among to Node B and node C to redistribute, using the maximum in the terminal node cycle as system cycle, in this example, be 35min.Because Node B and node C clash, and E _b>E _c, according to treaty rule:

R _m=i

R _n=k-i-1

Wherein: k=2,3,4 ..., i=0,1,2 ..., k-1, first increases the frequency of node C in a system cycle once, again judges each terminal node of system, do not conflict after increase.Now the work period of node A, Node B and each node of node C is: 35min, 10min and 8.525min, visible conflict is removed.

2. two or more terminal node clashes

Suppose have node A, B and C, its operating interval is respectively 10min, 10min and 10min, and energy ezpenditure meets:

E _a>E _b>E _c

Utilize conflict estimation & disposing method to process terminal node each in system, step is as follows:

Can see that when system does not add the coordination system egress A, Node B and node C 10min after system works clash.Utilize the operating time of Mechanism of Conflict Among to node A, Node B and node C to redistribute, using the maximum in the terminal node cycle as system cycle, in this example, be 10min.First to the order that energy is ascending, then energy ezpenditure comparatively minor node is solved, the conflict occurred between Node B and node C, when increase by minor node C is after system cycle frequency, Node B occurs 1 time and node C occurs 2 times, now again whether Node B and node C are clashed and judge, can find out and still have conflict to occur.According to step (2) treaty rule:

R _m=i

R _n=k-i-1

Wherein: k=2,3,4 ..., i=0,1,2 ..., k-1, carries out value to Node B and node C.Increase the frequency of Node B and node C successively and judge whether clashing, can find out when Conflict solving when 1 C occurs 3 times occurs B.Now again the conflict between terminal node each in system is judged, can find to clash between node A and Node B, identical with the process of conflicting during node C with solution Node B, when A occurs 1 time, Conflict solving when B occurs 3 times between A and B.Now again judge whether there being terminal node to clash in system, can find that Node B and node C clash again, increase according to the frequency solving process on node B and the node C conflicted between Node B and node C first, no longer conflict when C occurs 7 times.Now the work period of node A, Node B and node C is: 10min, 3.3min and 0.14min.

Claims (1)

1. a body area network network system node data transmission conflict estimation & disposing method, is characterized in that comprising the following steps:

(1) conflict of each terminal node operating time in certainty annuity

Determine each terminal node work period, the maximum of all terminal node work periods, as system cycle, is designated as T here ₀;

If the operating time that there are more than two terminal nodes or two terminal nodes in system does not meet:

T _smP≠T _snQ

Wherein t _smand T _snfor the operating interval of any terminal node M and terminal node N, now the operating time of terminal node M and terminal node N clashes, and system needs to redistribute the system works time started;

(2) change the terminal node work period, increase terminal node frequency

After determining to clash by step (1), the span of the operation range of each terminal node is widened into:

$0<{N_k}^{\&prime;}\&le;\frac{T_0}{T_{sk}}$

Wherein N ' _kfor the frequency of a kth terminal node, T _skfor the operating interval of this terminal node, after doing as above expansion to work times, its work period is recalculated as:

$T_{sk}^{\&prime;}=\frac{T_0}{N_k^{\&prime;}}$

Wherein T ' _skfor change frequency N ' _kafter the terminal node work period;

When clashing the attack time of two terminal nodes, suppose to be respectively terminal node M and terminal node N, P time and Q time occur when clashing respectively, then:

T _smP＝T _snQ

Wherein T _smand T _snfor the operating interval of terminal node M and terminal node N, the strategy now taked clashes terminal node M and terminal node N at system cycle T by increasing ₀the number of times of middle generation is to avoid conflict, and the number of times of increase is respectively R _m, R _n, its value should meet:

T′ _sm(N _m+R _m)＝T ₀

T′ _sn(N _n+R _n)＝T ₀

Here N ' is supposed _m=N _m+ R _m, N ' _n=N _n+ R _n, its value should meet:

$0<{N_m}^{\&prime;}\&le;\frac{T_0}{{T_{sm}}^{\&prime;}}$

$0<{N_n}^{\&prime;}\&le;\frac{T_0}{{T_{sn}}^{\&prime;}}$

And:

T' _smP ₁≠T _kQ ₁

T' _snP ₂≠T _kQ ₂

Wherein T' _smand T' _snfor increasing the terminal node origination interval in system cycle after terminal node frequency, T _kfor any terminal node work period, P ₁, P ₂, Q ₁and Q ₂for terminal node frequency:

$P_1,P_2=1,2,3,...,\frac{T_0}{T_{sm}^{\&prime;}},$

$Q_1,Q_2=1,2,...,\frac{T_0}{T_{sn}^{\&prime;}};$

(3) collision problem between terminal node is solved according to energy ezpenditure minimum principle

For R _mand R _nvalue △ E should be made minimum simultaneously:

△E＝E′-E

＝E _m(N _m+R _m)+E _n(N _n+R _n)-E _mN _m-E _nN _n

＝E _mR _m+E _nR _n

Wherein △ E is the energy recruitment in increase system system cycle after terminal node frequency, R _mand R _nfor the frequency that terminal node M and terminal node N increases, the energy of two terminal nodes is defined as E respectively here _nand E _m, suppose E _n<E _mchange the work period of terminal node by increasing the frequency of terminal node in a system cycle when clashing, terminal node time of origin is changed to reach, thus reach the object avoided conflict, the conflict that operating time occurs multiple terminal node if exist in system, then should sort to terminal node according to consumed energy E, and the row relax of advancing by leaps and bounds that liquidates successively from small to large, if the increase number of times of two terminal nodes is respectively R _mand R _n, then R _mand R _nvalue in accordance with following order, result of calculation should be redistributed, with make energy consumption increase minimum:

R _m＝i

R _n＝k-i-1

Wherein: k=2,3,4 ..., i=0,1,2 ..., k-1, carries out traversal value for each k value reply i here.