CN101925132A - Novel multi-channel medium access control method of wireless sensing network - Google Patents

Novel multi-channel medium access control method of wireless sensing network Download PDF

Info

Publication number
CN101925132A
CN101925132A CN201010289201XA CN201010289201A CN101925132A CN 101925132 A CN101925132 A CN 101925132A CN 201010289201X A CN201010289201X A CN 201010289201XA CN 201010289201 A CN201010289201 A CN 201010289201A CN 101925132 A CN101925132 A CN 101925132A
Authority
CN
China
Prior art keywords
node
channel
radio frequency
frequency chip
random sequence
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.)
Granted
Application number
CN201010289201XA
Other languages
Chinese (zh)
Other versions
CN101925132B (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.)
JINAN PUSAI COMMUNICATION TECHNOLOGY Co Ltd
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to CN 201010289201 priority Critical patent/CN101925132B/en
Publication of CN101925132A publication Critical patent/CN101925132A/en
Application granted granted Critical
Publication of CN101925132B publication Critical patent/CN101925132B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a novel multi-channel medium access control method of a wireless sensing network, comprising the following steps of extracting a clock, a physical address and superframe information from a received beacon; taking the extracted physical address as a seed by an arbitrary node which receives beacons of other nodes to obtain a pseudo random sequence and calculating channels located by other nodes according to the pseudo random sequence; acquiring an awakening time slice of a receiving party according to the extracted superframe information and carrying out random delay and signal strength detection by the arbitrary node when the arbitrary node sends data to the receiving party. The invention enhances the reliability of the network, efficiently avoids signal conflict by dividing a large superframe into a plurality of small time slices, simultaneously realizes a mechanism that nodes with different superframe sizes are mutually communicated and also ensures that transmission of generated data is not influenced by utilizing the withdrawn mechanism after collision so as to realize successful current data communication.

Description

A kind of novel multi-channel medium access control method of radio sensing network
Technical field
The present invention relates to a kind of novel multi-channel medium access control method of radio sensing network.
Background technology
(wireless sensor networks is by a large amount of cheap microsensor node that is deployed in the monitored area WSN) to wireless sensor network, the ad hoc network system of a kind of multi-hop that forms by communication.In the multi-channel MAC communication protocol, numerous nodes in the network are scattered in different channels, have reduced the communication competition, particularly parallel multi-channel MAC communication protocol of consulting, overcome the bottleneck problem of control channel, greatly improved the throughput of network and the anti-interference of network.The unique big slot (superframe) of whole network using in the multichannel mac mechanism in the existing radio sensing network, the signal strength detection of employing is also just realized by hardware, does not effectively avoid the mechanism of colliding on software.
At present existing multiple multi-channel MAC protocols, the multiband media access control protocol MMSN (Multi-Frequency Media Access Control for Wireless SensorNetworks) that for example is used for wireless sensor network, multi-channel medium access-control protocol MMAC (Multi-Channel Media AccessControl), multi-channel medium access-control protocol TMMAC (ATDMA basedmulti-channel MAC protocol) based on time division multiple access, tree-like multi-channel medium access-control protocol TMCP (aTree-based Multi-Channel Protocol), multi-channel medium access-control protocol TFMAC (Time-Frequency Multi-Channel Protocol) based on time and frequency, the multi-channel medium access-control protocol MC-LMAC (A Multi-Channel MAC Protocol forWireless Sensor Networks) that is used for wireless sensor network, the parallel multi-channel medium access-control protocol McMAC (AParallel Rendezvous Multi-Channel MAC Protocol) that consults is based on the grid network agreement TSMP (TIME SYNCHRONIZED MESH PROTOCOL) of time synchronized.This paper will analyze above-mentioned agreement from channel allocation mode and two aspects of channel access mode of agreement.
From the channel allocation mode, multi-channel MAC protocols mainly can be divided into fixed channel assignment, and channel stage by stage switches and parallel channel is consulted three kinds of modes.Fixed channel assignment mode, node are selected channel separately, and are fixed on the own channel when netinit.When node was wanted to communicate with other node, the channel that will switch to the other side carried out information exchange, and communication finishes and switches to the channel of oneself again, MMSN, and TMCP, TFMAC and MC-LMAC agreement all belong to this class mode.This mode realizes simply, and the numerous nodes in the network are dispersed on a plurality of channels, has reduced the degree of node communication competition.But in this class mode, because node is fixed in a concrete channel, when this channel was interfered, the node that is on this channel just can't communicate, and influences stability of network.The channel allocation of channel switching mode stage by stage is divided into consults the period and communicates by letter the period, consulting the period, there is the node of communicating requirement on control channel, to hold consultation, after consulting successfully, corresponding node switches to the channel that consults in the communication period and communicates, return control channel after communication finishes, MMAC and TMMAC agreement all belong to this class mode.Channel switching mode stage by stage can envoy's point selection communicate on different channels simultaneously, has avoided individual channel to be interfered and influences whole network, has improved stability of network.But this mode seriously relies on the existence of control channel, and all nodes all concentrate on control channel and hold consultation, and causes the saturated of control channel easily, and, if control channel is interfered, will influence whole network, therefore, control channel becomes the bottleneck of whole network.The parallel channel negotiation mode, node switches at a plurality of interchannels by the pseudo random sequence of oneself fixing, and the node that communicating requirement is arranged switches to corresponding channel and communicates then according to the pseudo random sequence of the other side's node, and communication finishes and then switches to own channel.Because the communication process of node does not rely on control channel, has eliminated the bottleneck problem of control channel, has improved the throughput and the reliability of network.But, owing to lack the exchange of control information, the default channel that breaks away from oneself when node, when the channel that switches to the other side's node communicated, other nodes in the network were not also known, if this moment, the another one node is thought to communicate by letter with it, just can not find it on its default channel according to his pseudo random sequence, disappear as this node, we are referred to as node disappearance problem.
From the channel access mode, at present the MAC agreement adopts Carrier Sense Multiple Access CSMA (Carrier Sense Multiple Access) and time division multiple access TDMA (Time Division MultipleAddress) dual mode.The CSMA mode is a kind of access mode based on competition, when number of nodes more for a long time, the communication degree of contention between the node can be very serious, reduces the throughput of network, simultaneously, node is used for the time of channel competition even can surpasses the time that packets of information sends.When the network node One's name is legion, and the length of packets of information is hour, and it is particularly outstanding that this situation seems, and this sight that often has of wireless sensor network often.MMSN, MMAC, TMCP and McMAC agreement all belong to this class mode.The TDMA mode is a kind of channel access mode based on scheduling, time-domain is divided into the timeslice of a plurality of regular lengths, and a plurality of timeslices are formed a superframe, as a cycle period, node is revived at the special time sheet of each superframe, and in the dormancy of other times sheet.The TDMA mode makes node disperse by timeslice in time-domain, has reduced the degree of communication competition.The method of salary distribution of timeslice mainly contains two kinds, static allocation mode and dynamic assignment mode.The static allocation mode is when netinit, distributes to node regular time sheet, and node is revived in the timeslice of oneself, and in the other times dormancy, MC-LMAC and TSMP agreement belong to this mode.The static allocation mode realizes simply, does not need extra control information when the network operation.But when network configuration changed because of factors such as node failure or new node addings, this mode can not be adjusted the distribution of timeslice well, causes the decline of network performance, has limited network extensibility.The dynamic time sheet method of salary distribution is when the network operation, distributes timeslice dynamically for the node that communicating requirement is arranged, and TMMAC and TFMAC agreement belong to this mode.This mode can effectively utilize timeslice, still, this mode all need be come the subscription time sheet at the control channel exchange of control information before the each communication of node, increased cost on network communication and to the dependence of control channel, be unfavorable for that network improves throughput and by interference.
Summary of the invention
For overcoming the deficiencies in the prior art, provide a kind of novel multi-channel medium access control method of radio sensing network.
For achieving the above object, the present invention adopts following technical proposals:
A kind of novel multi-channel medium access control method of radio sensing network, this method comprises following aspect:
Step1: system powers on, the radio sensing network initialization;
Step2: all nodes broadcast beacon on control channel in the radio sensing network, regularly intercepting listen for beacons on the channel simultaneously;
Step3: when arbitrary node was received the beacon of other node broadcasts, this node will extract clock, physical address and superframe information from the beacon of the respective nodes received, and these information are left in the neighbor table;
Step4: need sending the node of data, is seed with the physical address of the other side's node of extracting, obtains the pseudo random sequence of the other side's node, and calculates the residing channel of the other side's node according to pseudo random sequence, changes step5 simultaneously over to and continues to carry out; Otherwise then wait pending data, return step4 and continue to judge;
Step5: judge whether the node that needs to send data successfully takies the radio frequency chip resource, then changes step6 in this way over to, otherwise then continue to wait for the radio frequency chip resource, return step5 and continue to judge;
Step6: obtain the recovery time sheet of the next superframe of recipient, when arriving to recipient's next superframe recovery time sheet, switching channels is to the channel at recipient place, and carries out random delay;
Step7: behind the random delay, utilize the radio frequency chip resource signal strength signal intensity of current channel to be carried out the detection of preset time;
Step8: if signal strength signal intensity surpasses setting threshold, then send data, and change step9 continuation execution over to the recipient; Otherwise then abandon this time sending, and change step6 continuation execution over to;
Step9: as sending the data success, the node that then sends data switches to the default channel of oneself, discharges the radio frequency chip resource, finishes communication; Otherwise repeat to send,, then discharge the radio frequency chip resource, finish communication,, then change step6 over to and continue to carry out as sending number of times less than given number of times as sending number of times greater than given number of times.
The process of obtaining the recovery time sheet among the described step6 is as follows:
A. the length of using superframe obtains the number of given duration in the superframe divided by given duration;
B. the physical address with the other side's node is a seed, obtains the other side's pseudo random sequence, and the length of pseudo random sequence and the maximum in the pseudo random sequence are the number of given duration;
C. send the timeslice pseudo random sequence of the node of data, obtain the recovery time sheet of the other side's node according to the other side's node.
Described recovery time sheet is the timeslice at node place when reviving.
Described radio frequency chip adopts the radio frequency chip of supporting multichannel communication.
Among the described step2, the broadcast beacon process is:
A. node at first judges whether to take the radio frequency chip resource;
If b. take the radio frequency chip resource, then switch to control channel, send the beacon of setting-up time, discharge resources of chip then, wait for next time and send beacon;
If c. vacant radio frequency chip resource is then waited for the radio frequency chip resource, change step a over to and continue to carry out.
Among the described step2, the listen for beacons process is:
1) node at first judges whether to take the radio frequency chip resource;
2) if take the radio frequency chip resource then switch to control channel, open the radio frequency listen for beacons; Otherwise wait for the radio frequency chip resource, change step 1) over to and continue to carry out;
3) in preset time, if the data of listening to then upgrade neighbor table and the time synchronized table are upgraded and finished back release radio frequency chip resource; Otherwise then discharge resources of chip, wait for next listen for beacons.
Principle of the present invention: the MAC agreement adopts parallel multichannel communication mode of consulting among the present invention.Each node as seed, produces a pseudo random sequence according to fixing pseudo-random sequence generator with oneself MAC Address, and node switches at a plurality of interchannels by this pseudo random sequence, and promptly each wake-up period switches a secondary channel.
If it is can be predetermined for sequence, and can repeat to produce and duplicate, but it has the random statistical characteristic of certain random sequence again, we just claim that this sequence is a pseudo random sequence.Therefore we can say that pseudo random sequence is to have certain stochastic behaviour sequencing row really.Can't from the characteristic of a sequence that has produced, judge it is true random sequence or pseudo random sequence because have stochastic behaviour equally, can only judge according to the generation way of sequence.Pseudo random sequence series has good randomness and approaches the correlation function of white noise, and in advance confirmability and repeatability are arranged.At the beginning, each node is all selected a seed independently, and seed is in case selected just no longer variation.The seed of this seed as random sequence generator, each node produces the pseudo-random channels sequence of this node with same random sequence generator, because each node is selected different seeds, so the pseudo-random channels sequence of each node all is independently.Generally speaking, in same wireless sensor network, each node all has a unique MAC Address, can be its seed as the pseudo random sequence generation.For the not strict requirement of the selection of accidental channel sequence, so long as select different seeds that these sequences are looked to be one that random sequence is just passable independently, their statistics autonomous behavior is not very important, because it is the utilance for each channel of balance.Generally speaking, there is no need the whole cycle with random sequence, if the number of channel in the accidental channel sequence than number of available channels big many just passable.
In multi-channel MAC protocols, introduce the division of timeslice, make network node can in frequency and time two territories, disperse (this just disperses multichannel) in frequency domain, reduce the communication degree of contention.A big big slot is divided into several minor time slices, the minor time slice when selecting to revive by pseudo random sequence, the other side also will calculate minor time slice to be selected earlier when sending.This agreement is divided into a plurality of timeslices with time-domain, and node is selected the waking of different timeslices as oneself by pseudo random sequence, avoids the node waking to overlap and the generation communication collision.If not service time sheet, make node in whole super frame period, select own waking at random, also can reach and make the effect of network node, but the likelihood ratio that this mode node communication collides is bigger in the time-domain random distribution.Here the pseudo random sequence of using is that the MAC Address with node is that seed is calculated because all nodes adopt with a kind of algorithm in the network, so when other node obtains the mac address information of certain node, just also can calculate pseudo random sequence.
Before sending data each time, all carry out random delay, behind the random delay, utilize radio frequency chip that the signal strength signal intensity of current channel is continued to detect.The time of detecting is long more, and the possibility of signal of missing other node emission is more little, so can effectively avoid signal conflict more; But because the recipient is limited at time of reviving, so detection time is also unsuitable oversize, thereby otherwise the time of remaining data communication can lack very much and influence data communication.If during this period of time do not detect signal busy (promptly not detecting the signal that reaches certain intensity), then send packet at current channel; If detect signal busy (promptly reaching the signal of certain intensity) in current Channel Detection, then abandon this time sending, the waking for the treatment of recipient's next big slot reattempts transmission, before sending, random delay also to be arranged next time and carry out input (promptly no matter when, to send random delay all will be arranged before the data and the signal strength signal intensity of current channel is detected).
Each node all can take out the big slot information of transmit leg, and be kept in the neighbor table when receiving packet from packet, be used for accurately calculating the other side's recovery time during data to be sent.
Beneficial effect of the present invention:
1. the multichannel communication mode in this MAC agreement, the residing channel of node is constantly to change, and the communication between the node can be carried out on a plurality of channels simultaneously, need not carry out channel and consult on control channel, the bottleneck problem that does not have control channel has also improved the reliability of network.
2.big the selection of slot minor time slice; By a big big slot is divided into several minor time slices, thereby effectively avoided signal conflict.
3. the mechanism of backoff after collision; When detecting channel busy, abandon this time sending, promptly selected to keep out of the way, can guarantee more effectively that like this transfer of data that has produced is not affected, make ongoing data communication be able to success.
4.big the mechanism of the node mutual communication that the slot size is inequality; In consolidated network, can allow node select different big slot according to the difference of using.Give way by the smaller big slot of node selection such as allowing terminal node select bigger big slot; This situation is very suitable for the application scenario that routing node has power supply, can greatly improve the successful communication rate.Table look-up system such as ammeter, the data of ammeter may only need upload once to routing node in one day, so the big slot of terminal node can be provided with ground bigger (size as big slot was made as 1 hour), and routing node can be selected smaller big slot (as 1 minute), like this for terminal node, just can accomplish more energy-conservation, thereby under the situation that does not need externally fed, keep the longer duration of runs.
Description of drawings
Fig. 1 is that the node channel switches schematic diagram;
Fig. 2 is a communication collision situation of selecting waking differently, and a is for adopting unique big slot mechanism, and b is for adopting big slot minor time slice mechanism;
Fig. 3 is a backoff after collision mechanism schematic illustration;
Fig. 4 is the mechanism description figure of different big slot node mutual communication inequality;
Fig. 5 sends data task program flow chart;
Fig. 6 intercepts the task program flow chart;
Fig. 7 is a beacon on task program flow chart;
Fig. 8 is the listen for beacons mission flow diagram;
Fig. 9 is two nodes that superframe does not line up.
Embodiment
The invention will be further described below in conjunction with drawings and Examples:
The hardware platform of wanting required for the present invention is a radio frequency chip of supporting multichannel communication, the CC2420 that produces of TI company for example, CC2520, CC1100 etc.At the networking initial stage, all nodes broadcast beacon on control channel in the radio sensing network is regularly being intercepted listen for beacons on the channel, Fig. 5-the 8th, transmission/interception data flow chart simultaneously.
This MAC agreement adopts parallel multichannel communication mode of consulting.Each node as seed, produces a pseudo random sequence according to fixing pseudo-random sequence generator with oneself MAC Address, and node switches at a plurality of interchannels by this pseudo random sequence, and promptly each wake-up period switches a secondary channel.Like this, other nodes only need be known the other side's MAC Address, just can obtain the pseudo random sequence of the other side's node in this locality according to same pseudo-random sequence generator, and then estimate the residing channel of the other side's node.Need be with the time when node to side communication, just in the other side's waking, the channel that switches to the other side communicates, and communication finishes, and node then switches to the default channel of oneself.As shown in Figure 1, node A and B switch on 4 channels by the channel switching sequence of the acquiescence of oneself, when node A has informational needs to send, he just switches to the channel at Node B place, communicate with Node B, after communication finished, node A still carried out channel by the sequence of own original acquiescence and switches.
Introduce below and how to use the pseudo-random channels sequence.In this agreement, our employed channel can be by numeral number.Supposing to have altogether the available number of channel is 16, and we use 1 to 5 these 5 channels, and then the numerical value in the random sequence just is distributed between 1 to 5.As shown in Figure 9, the node system time is divided into the superframe of fixed size, supposes that the total channel number is 5, the pseudo-random channels sequence is 2,4,1,3,5, and node goes unit's selective channel usually in the corresponding random sequence according to the residing superframe of this node.The node channel of selecting this node to work according to local zone time like this.Such as when big slot size is 256ms, if this node reception task when 700ms is revived, 700/256 integer part is 2, at this moment the 3rd random number (first random number in the 0 corresponding random sequence) in the random sequence is exactly that random number that we will use, i.e. the channel 1 that will use of this reception task.
Like this, other nodes only need be known the other side's MAC Address, just can obtain the pseudo random sequence of the other side's node in this locality according to same pseudo-random sequence generator, and then calculate the residing channel of the other side's node.Need be with the time when node to side communication, just in the other side's waking, the channel that switches to the other side communicates, and communication finishes, and node then switches to the default channel of oneself.
In multi-channel MAC protocols, introduce the division of timeslice, make network node can in frequency and time two territories, disperse (this just disperses multichannel) in frequency domain, reduce the communication degree of contention.A big big slot is divided into several minor time slices, the minor time slice when selecting to revive by pseudo random sequence, the other side also will calculate minor time slice to be selected earlier when sending.Among Fig. 2: shown in Fig. 2 (a), when node is selected the waking of oneself at random in whole super frame period, because the edge of node waking does not line up, therefore collision fully not only can take place in node when waking overlaps fully, and when waking partially overlaps also incomplete collision can take place, this all can cause communication failure.And behind the time division sheet, the waking of node aligns, and only just complete case of collision can take place when node is selected at the same time sheet, shown in Fig. 2 (b), and incomplete case of collision can not occur.Therefore, adopt the mode of timeslice, than selecting waking can reduce the probability of node collision by random fashion.
This agreement is divided into a plurality of timeslices with time-domain, and node is selected the waking of different timeslices as oneself by pseudo random sequence, avoids the node waking to overlap and the generation communication collision.The quantity Calculation method of minor time slice (implication of minor time slice is given duration) is among big slot: with the size of the big slot length divided by minor time slice, the integer that obtains (this integer is the integer behind the fractions omitted) part is exactly the number of minor time slice among the big slot.Such as being 256ms as big slot, when the minor time slice size was 10ms, the number of minor time slice was exactly 25, because 256/10 integer part that obtains is 25.Node is revived in each reception task, and Shi Douhui calculating is next at which minor time slice revives, and it is the same calculating the algorithm of using when the pseudo random sequence that is adopted is calculated accidental channel together, is different pseudo random sequences still.Maximum in the pseudo random sequence is decided by the number of minor time slice.As the minor time slice number is 25 o'clock, and the numerical value in the pseudo random sequence just is distributed between 1 to 25.Here the pseudo random sequence of using is that the MAC Address with node is that seed is calculated, because all nodes adopt with a kind of algorithm in the network, so when other node obtains the mac address information of certain node, just also can calculate the same pseudo random sequence, so when transmit leg will send data to the recipient, transmit leg can calculate the recipient earlier and at which minor time slice revive, by the time the recipient when reviving, sends and can send data on schedule just now.
Before sending data each time, all carry out random delay (0-2.5 millisecond), behind the random delay, utilize radio frequency chip (as CC2420, CC2520) signal strength signal intensity of current channel to be continued 2 milliseconds detection.The time of detecting is long more, and the possibility of signal of missing other node emission is more little, so can effectively avoid signal conflict more; But because the recipient is limited at time of reviving, so detection time is also unsuitable oversize, thereby otherwise the time of remaining data communication can lack very much and influence data communication.If during this period of time do not detect signal busy (promptly not detecting the signal that reaches certain intensity), then send packet at current channel; If detect signal busy (promptly reaching the signal of certain intensity) in current Channel Detection, then abandon this time sending, the waking for the treatment of recipient's next big slot reattempts transmission, before sending, random delay also to be arranged next time and carry out input (promptly no matter when, to send random delay all will be arranged before the data and the signal strength signal intensity of current channel is detected).
In Fig. 3: between the waking of node A, Node B and node C will send data for simultaneously node A.Node B and node C will experience one section random delay, in Fig. 3, the random delay of this of Node B node C that compares is short, so it takes the lead in having carried out signal strength detection, at this moment owing to sending signal without any node, Node B detects the signal that does not reach threshold intensity during detection signal strength, so communicate by letter with node A.Carry out between communication period at node A and Node B, the node C that has spent random delay is carrying out signal strength detection, at this moment it has detected the signal of communication between node A and the Node B, this signal under normal circumstances signal strength signal intensity can surpass threshold value, so node C abandons this time the chance with node A communication, wait node A revives and its communication next time again.And because node C has abandoned the chance of communication this time, the communication of the product of node A and Node B just can not be subjected to the interference of node C.Otherwise, between node A and Node B communication period, node C can send data to node A, receive the data that node C sends and this moment, no matter Node B still was node A, the communication quality between Node B and the node A is damaged in the capital greatly, thereby cause the failure of communication this time between Node B and the node A, and the communication between node C itself and the node A can be affected also, thereby failure; So B and C can fight for the communication right to A once more when A revives, and can fail once more under most of situation next time, so vicious circle is gone down, and can reduce the success rate of communication greatly.So we can find out clearly that the mechanism of backoff after collision can improve the communication success rate greatly from Fig. 3.Here our random delay used is with last acquisition of getting the local clock time, thus here be absolute at random.
In Fig. 4: the size of the big slot of Node B is the twice of node A, and the size of the big slot of node C is the twice of Node B.At first they all can be on control channel broadcast beacon beacon, also can be regularly intercept beacon on the channel intercepting, when a node is received the beacon of another node broadcasts, will from the beacon bag, extract the current clock of the other side, the other side's address and the information such as size of big slot, and these information are left in the neighbor table.So each node all can have data receiver's clock information, go out by address computation after a period of time when sending data random sequence information and bigslot information, and can calculate data receiver's recovery time thus, so mutual communication total energy guarantee successfully between node.
The present invention has realized the mechanism of the node mutual communication that big slot size is inequality; In consolidated network, can allow node select different big slot according to the difference of using.Give way by the smaller big slot of node selection such as allowing terminal node select bigger big slot; This situation is very suitable for the application scenario that routing node has power supply, can greatly improve the successful communication rate.Table look-up system such as ammeter, the data of ammeter may only need upload once to routing node in one day, so the bigslot of terminal node can be provided with ground bigger (size as big slot was made as 1 hour), and routing node can be selected smaller big slot (as 1 minute), like this for terminal node, just can accomplish more energy-conservation, thereby under the situation that does not need externally fed, keep the longer duration of runs.
Fig. 5 sends data task program flow chart.The first, program sends from data and gets the data that need transmission the message queue, and these data only comprise destination address and data content, so need pack to data, comprise information such as node local mac address, network ID, packet sequence number.The second, take radio frequency resource again.Radio frequency resource has only one, the same time, it can only be a task service, in order to make this resource of each task sharing and not clash, this paper represents radio frequency resource with a binary signal amount, when any task need be used radio frequency resource, all need to take it, discharge resource after using up again.The 3rd, calculate time and institute's working channel that next superframe of neighbor node arrives, the calling task delay function, the next superframe of neighbor node begins by the time, and the switch operating channel sends data.At last, discharge radio frequency resource.Program flow diagram as shown in Figure 5.
Fig. 6 is an interception data task program flow chart.The task of intercepting is that node is periodically revived, and intercepts the data that whether have other node to mail to this node.Because node sends data priority greater than the reception data priority, so, when having data to send, node revives, and then node abandons intercepting the data that mail to this node.Program flow diagram is as shown in Figure 6: 1) node at first judges whether to take the radio frequency chip resource; 2) if take the success of radio frequency chip resource, then calculate the work at present channel, switch to control channel simultaneously, open radio frequency and intercept 10ms; Otherwise then change step 4) over to; 3) in 10ms,, upgrade and finish back release radio frequency chip resource and change step 4) over to if the data of listening to then reply confirmation and are upgraded neighbor table and time synchronized table; Otherwise then discharge resources of chip, change step 4) over to; 4) calculate next superframe, and carry out the task dormancy.
Fig. 7 beacon on task program flow chart.The beacon on task mainly contains the effect of two aspects, one, the node that newly adds network can find own around neighbours in the jumping scope.If do not have data communication between each node in two a very long times, beacon frame can make time synchronized between each node, can not cause time synchronized to go wrong because of the difference of clock crystal oscillator.When the beacon on time then, this task sends continuously beacon frame in a period of time, enter task time-delay state then, waits for next time and send beacon arriving.Program flow diagram is as shown in Figure 7: node at first judges whether to take the radio frequency chip resource; If take the success of radio frequency chip resource, then switch to control channel, send beacon 100ms, discharge resources of chip then, wait for next time and send beacon; If vacant radio frequency chip resource is then waited for the radio frequency chip resource.
Fig. 8 is the listen for beacons mission flow diagram.Neighbours around the listen for beacons task mainly be responsible for to be sought, and neighbours are joined in neighbor table and the time synchronized table, and update time synchronous meter, make neighbours and this node time synchronized, deletion has simultaneously broken away from the neighbours of network.This task the listen for beacons time then, enter control channel and open radio frequency a period of time (20ms), receive beacon after, upgrade neighbor table and time synchronized table.In the last review time synchronous meter whether the neighbours that need deletion are arranged.Program flow diagram is as shown in Figure 8: 1) node at first judges whether to take the radio frequency chip resource; 2) if take radio frequency chip resource success then switch to control channel, open the radio frequency listen for beacons; Otherwise wait for the radio frequency chip resource, change step 1) over to and continue to carry out; 3) in preset time, if the data of listening to then upgrade neighbor table and the time synchronized table are upgraded and finished back release radio frequency chip resource; Otherwise then discharge resources of chip, wait for next listen for beacons.

Claims (6)

1. the novel multi-channel medium access control method of a radio sensing network is characterized in that, the step of this communication means is as follows:
Step1: system powers on, the radio sensing network initialization;
Step2: all nodes broadcast beacon on control channel in the radio sensing network, regularly intercepting listen for beacons on the channel simultaneously;
Step3: when arbitrary node was received the beacon of other node broadcasts, this node will extract clock, physical address and superframe information from the beacon of the respective nodes received, and these information are left in the neighbor table;
Step4: need sending the node of data, is seed with the physical address of the other side's node of extracting, obtains the pseudo random sequence of the other side's node, and calculates the residing channel of the other side's node according to pseudo random sequence, changes step5 simultaneously over to and continues to carry out; Otherwise then wait pending data, return step4 and continue to judge;
Step5: judge whether the node that needs to send data successfully takies the radio frequency chip resource, then changes step6 in this way over to, otherwise then continue to wait for the radio frequency chip resource, return step5 and continue to judge;
Step6: obtain the recovery time sheet of the next superframe of recipient, when arriving to recipient's next superframe recovery time sheet, switching channels is to the channel at recipient place, and carries out random delay;
Step7: behind the random delay, utilize the radio frequency chip resource signal strength signal intensity of current channel to be carried out the detection of preset time;
Step8: if signal strength signal intensity surpasses setting threshold, then send data, and change step9 continuation execution over to the recipient; Otherwise then abandon this time sending, and change step6 continuation execution over to;
Step9: as sending the data success, the node that then sends data switches to the default channel of oneself, discharges the radio frequency chip resource, finishes communication; Otherwise repeat to send,, then discharge the radio frequency chip resource, finish communication,, then change step6 over to and continue to carry out as sending number of times less than given number of times as sending number of times greater than given number of times.
2. the novel multi-channel medium access control method of a kind of radio sensing network as claimed in claim 1 is characterized in that, the process of obtaining the recovery time sheet among the described step6 is as follows:
A. the length of using superframe obtains the number of given duration in the superframe divided by given duration;
B. the physical address with the other side's node is a seed, obtains the other side's pseudo random sequence, and the length of pseudo random sequence and the maximum in the pseudo random sequence are the number of given duration;
C. send the timeslice pseudo random sequence of the node of data, obtain the recovery time sheet of the other side's node according to the other side's node.
3. the novel multi-channel medium access control method of a kind of radio sensing network as claimed in claim 2 is characterized in that, described recovery time sheet is the timeslice at node place when reviving.
4. the novel multi-channel medium access control method of a kind of radio sensing network as claimed in claim 1 is characterized in that, described radio frequency chip adopts the radio frequency chip of supporting multichannel communication.
5. the novel multi-channel medium access control method of a kind of radio sensing network as claimed in claim 1 is characterized in that, among the described step2, the broadcast beacon process is:
A. node at first judges whether to take the radio frequency chip resource;
If b. take the radio frequency chip resource, then switch to control channel, send the beacon of setting-up time, discharge resources of chip then, wait for next time and send beacon;
If c. vacant radio frequency chip resource is then waited for the radio frequency chip resource, change step a over to and continue to carry out.
6. the novel multi-channel medium access control method of a kind of radio sensing network as claimed in claim 1 is characterized in that, among the described step2, the listen for beacons process is:
1) node at first judges whether to take the radio frequency chip resource;
2) if take the radio frequency chip resource then switch to control channel, open the radio frequency listen for beacons; Otherwise wait for the radio frequency chip resource, change step 1) over to and continue to carry out;
3) in preset time, if the data of listening to then upgrade neighbor table and the time synchronized table are upgraded and finished back release radio frequency chip resource; Otherwise then discharge resources of chip, wait for next listen for beacons.
CN 201010289201 2010-09-21 2010-09-21 Novel multi-channel medium access control method of wireless sensing network Active CN101925132B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010289201 CN101925132B (en) 2010-09-21 2010-09-21 Novel multi-channel medium access control method of wireless sensing network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010289201 CN101925132B (en) 2010-09-21 2010-09-21 Novel multi-channel medium access control method of wireless sensing network

Publications (2)

Publication Number Publication Date
CN101925132A true CN101925132A (en) 2010-12-22
CN101925132B CN101925132B (en) 2013-02-06

Family

ID=43339685

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010289201 Active CN101925132B (en) 2010-09-21 2010-09-21 Novel multi-channel medium access control method of wireless sensing network

Country Status (1)

Country Link
CN (1) CN101925132B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102083163A (en) * 2011-02-28 2011-06-01 无锡泛联物联网科技股份有限公司 Random dormancy scheduling routing method for wireless sensor network
CN102098683A (en) * 2011-03-18 2011-06-15 上海交通大学 Wireless sensor network dynamic spectrum access method adopting pseudorandom sequence retreat mechanism
CN102378285A (en) * 2011-12-02 2012-03-14 东南大学 Method for solving packet space transmission problem of multi-channel wireless sensor network
CN103533584A (en) * 2013-10-24 2014-01-22 厦门大学 Multichannel media access control method of hydroacoustic sensor network
CN103974442A (en) * 2014-04-24 2014-08-06 东南大学 Low-delay scheduling method suitable for wireless sensor network
CN105357768A (en) * 2014-08-19 2016-02-24 邵贵阳 Method for realizing wireless multi-channel MAC protocol
CN106385293A (en) * 2016-09-30 2017-02-08 广州粤讯信息科技有限公司 Intelligent node system
CN111182557A (en) * 2020-02-25 2020-05-19 广州致远电子有限公司 Tree network based detection networking system, method and storage medium
CN118019115A (en) * 2023-12-31 2024-05-10 冯凯 Internet of Things New Energy Microgrid Mutual Node Collaborative Communication Model

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6480504B1 (en) * 1998-08-31 2002-11-12 Telefonaktiebolaget Lm Ericsson (Publ) Paging channel configuration for efficient wake-up period utilization
CN101218801A (en) * 2005-07-06 2008-07-09 三星电子株式会社 Frame structure of superframe transmitted in wireless network, method for transmitting the superframe, and method for controlling devices' wakeup by using the superframe

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6480504B1 (en) * 1998-08-31 2002-11-12 Telefonaktiebolaget Lm Ericsson (Publ) Paging channel configuration for efficient wake-up period utilization
CN101218801A (en) * 2005-07-06 2008-07-09 三星电子株式会社 Frame structure of superframe transmitted in wireless network, method for transmitting the superframe, and method for controlling devices' wakeup by using the superframe

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
邢志浩等: "无线多通道MAC协议McMAC的改进方案", 《计算机工程与应用》 *
陈冬岩: "基于多信道的MAC层协议在无线传感器网络中的应用", 《山东大学学报(工学版)》 *

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102083163B (en) * 2011-02-28 2013-11-20 无锡泛联物联网科技股份有限公司 Random dormancy scheduling routing method for wireless sensor network
CN102083163A (en) * 2011-02-28 2011-06-01 无锡泛联物联网科技股份有限公司 Random dormancy scheduling routing method for wireless sensor network
CN102098683A (en) * 2011-03-18 2011-06-15 上海交通大学 Wireless sensor network dynamic spectrum access method adopting pseudorandom sequence retreat mechanism
CN102378285A (en) * 2011-12-02 2012-03-14 东南大学 Method for solving packet space transmission problem of multi-channel wireless sensor network
CN103533584A (en) * 2013-10-24 2014-01-22 厦门大学 Multichannel media access control method of hydroacoustic sensor network
CN103974442B (en) * 2014-04-24 2017-03-22 东南大学 Low-delay scheduling method suitable for wireless sensor network
CN103974442A (en) * 2014-04-24 2014-08-06 东南大学 Low-delay scheduling method suitable for wireless sensor network
CN105357768A (en) * 2014-08-19 2016-02-24 邵贵阳 Method for realizing wireless multi-channel MAC protocol
CN105357768B (en) * 2014-08-19 2018-10-26 邵贵阳 A kind of implementation method of Wireless Multi-Channel MAC protocol
CN106385293A (en) * 2016-09-30 2017-02-08 广州粤讯信息科技有限公司 Intelligent node system
CN106385293B (en) * 2016-09-30 2017-12-08 广州粤讯信息科技有限公司 A kind of intelligent node apparatus
CN111182557A (en) * 2020-02-25 2020-05-19 广州致远电子有限公司 Tree network based detection networking system, method and storage medium
CN111182557B (en) * 2020-02-25 2023-07-07 广州致远电子股份有限公司 Detection networking system, method and storage medium based on tree network
CN118019115A (en) * 2023-12-31 2024-05-10 冯凯 Internet of Things New Energy Microgrid Mutual Node Collaborative Communication Model

Also Published As

Publication number Publication date
CN101925132B (en) 2013-02-06

Similar Documents

Publication Publication Date Title
CN101925132B (en) Novel multi-channel medium access control method of wireless sensing network
Ali et al. LTE/LTE-A random access for massive machine-type communications in smart cities
US9848422B2 (en) Efficient rendezvous for distributed messages in frequency-hopping communication networks
Guo et al. Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
EP2552168B1 (en) Clustering and resource allocation in ad hoc networks
Jovanovic et al. TFMAC: Multi-channel MAC protocol for wireless sensor networks
Huang et al. RC-MAC: A receiver-centric MAC protocol for event-driven wireless sensor networks
Cao et al. L 2: Lazy forwarding in low duty cycle wireless sensor networks
CN101286932B (en) Communication method with multiple frequency point in wireless sensor network
Lim et al. MCAS-MAC: A multichannel asynchronous scheduled MAC protocol for wireless sensor networks
Bernardo et al. A wireless sensor MAC protocol for bursty data traffic
EP2560453B1 (en) Method for network organization
Tang et al. Energy Efficient Downlink Transmission in Wireless LANs by Using Low‐Power Wake‐Up Radio
Verma et al. Novel group paging scheme for improving energy efficiency of IoT devices over LTE-A pro networks with QoS considerations
KR20220065823A (en) Distributed Synchronization Solution for Wireless Communication Networks
Hossen et al. A PON-based large sensor network and its performance analysis with Sync-LS MAC protocol
Swain et al. Adv-MMAC: An advertisement based multichannel MAC protocol for wireless sensor networks
Al-Nidawi et al. Mesh-under cluster-based routing protocol for IEEE 802.15. 4 sensornetwork
EP3942888B1 (en) Optimized unicast and broadcast communication in time-slotted channel hopping primary and secondary networks
Liu et al. Sc-mac: A sender-centric asynchronous mac protocol for burst traffic in wireless sensor networks
Verma et al. Throughput enhancement of a novel hybrid-MAC protocol for M2M networks
Dong et al. Performance optimisation of multichannel MAC in large-scale wireless sensor network
Kim et al. Latency bounded and energy efficient MAC for wireless sensor networks
KR101306067B1 (en) Underwater communication method tdma based dynamic time slot assignment
Jovanović et al. Contention Resolution Mechanism for Receiver-Driven TDMA-Based Wireless Sensor Networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
ASS Succession or assignment of patent right

Owner name: JI'NAN PRECISE COMMUNICATION TECHNOLOGY CO., LTD.

Free format text: FORMER OWNER: CHEN DONGYAN

Effective date: 20121122

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; TO: 250101 JINAN, SHANDONG PROVINCE

TA01 Transfer of patent application right

Effective date of registration: 20121122

Address after: Xinluo Avenue high tech Zone of Ji'nan City, Shandong province 250101 No. 1768 A506

Applicant after: Jinan Pusai Communication Technology Co., Ltd.

Address before: louisiana

Applicant before: Chen Dongyan

C14 Grant of patent or utility model
GR01 Patent grant
CP03 Change of name, title or address
CP03 Change of name, title or address

Address after: 250101 8th floor, Huantong building, 1257 Tianchen Road, high tech Zone, Jinan City, Shandong Province

Patentee after: Shandong pusai Communication Technology Co., Ltd

Address before: Xinluo Avenue high tech Zone of Ji'nan City, Shandong province 250101 No. 1768 A506

Patentee before: JINAN PUSAI COMMUNICATIONS TECHNOLOGY Co.,Ltd.