CN103415045A - Design method for efficient wireless information interaction network protocol - Google Patents

Design method for efficient wireless information interaction network protocol Download PDF

Info

Publication number
CN103415045A
CN103415045A CN2013103928351A CN201310392835A CN103415045A CN 103415045 A CN103415045 A CN 103415045A CN 2013103928351 A CN2013103928351 A CN 2013103928351A CN 201310392835 A CN201310392835 A CN 201310392835A CN 103415045 A CN103415045 A CN 103415045A
Authority
CN
China
Prior art keywords
node
network
data
information interaction
channel
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
CN2013103928351A
Other languages
Chinese (zh)
Other versions
CN103415045B (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.)
Central South University
Original Assignee
Central South University
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 Central South University filed Critical Central South University
Priority to CN201310392835.1A priority Critical patent/CN103415045B/en
Publication of CN103415045A publication Critical patent/CN103415045A/en
Application granted granted Critical
Publication of CN103415045B publication Critical patent/CN103415045B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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 invention discloses a design method for an efficient wireless information interaction network protocol. In particular, a wireless channel access protocol is designed by using an information interaction technology on the basis of the physical layer of a wireless self-organizing network. The method comprises self-organizing networking, a channel access control method and a back-off algorithm of a signal access protocol; meanwhile a network transmission rate dynamic control protocol based on automatic priority adjustment is provided, the network bandwidth is distributed reasonably by performing dynamic adjustment of different priorities on in-network nodes, and distributed detection of data information is realized by controlling the rates of different nodes as required, so that high adaptability and universality are achieved. According to the efficient wireless information interaction network protocol, efficient information interaction among nodes is realized, good service quality is ensured, and a complete framework structure is built for the wireless information interaction technology.

Description

A kind of method for designing of efficient wireless information interaction procotol
Technical field
The present invention relates to a kind of general frame and method for designing of efficient wireless information interaction procotol, concrete, by design wireless channel access protocol and the dynamic control protocol of network transmission speed, realization has good real-time, is applicable to processing the ad-hoc wireless information interaction network of real time interaction information and burst information, belongs to the wireless information interaction field.
Background technology
Along with the development of Modern wireless communication, each field development and Design personnel have had more and more higher requirement to wireless network, and the wireless self-organization network of take has obtained studying widely and applying as the new wireless communication mode of representative.At present, wireless self-organization network is existing a lot of achievements in research at aspects such as Routing Protocol, network topology control, energy distribution, but wireless messages real-time, interactive technology does not also cause the concern that people are enough.Existing information interaction theoretical models is all for all nodes, to have the situation of identical data request rate, in such network, node is required to send real time information with identical frequency, and all nodes all require to participate in, but in actual applications, different pieces of information often has different requirement of real-times, causes it at industrial circle, to apply seldom always, does not also have so far to occur for the wireless Ad Hoc communication protocol of industrial time controlling.The research center of gravity of conventional wireless data transmission technology is collection and the distribution of data, and the target of information interaction be for allow each node in network obtain around the information of other all nodes, between node, form the self organizing radio network network, under the environment without base station, move, have very big practical value.Different communication systems and network environment, can adopt different data-transmission modes according to demand separately, thereby realize efficient information interaction.To wireless network demand more and more widely, the wireless information interaction technology will become the basis of future communications, will be developed faster along with work compound.
Summary of the invention
For the problems referred to above and deficiency, the present invention has announced a kind of method for designing of efficient wireless information interaction procotol.Concrete, be to take the physical layer of wireless self-organization network as basis, designed the wireless channel access protocol that is applied to the information interaction field, make the wireless information interaction network have better real-time, be more suitable for processing real time interaction information and burst information; Simultaneously, the dynamic control protocol of network transmission speed of adjusting based on automatic priority has been proposed, by the net interior nodes being carried out to the dynamic adjustment of different priorities, the reasonable distribution network bandwidth, by demand, control the speed of different nodes, have adaptability and versatility widely.Described efficient wireless information interaction procotol, realized internodal efficient information interaction and guaranteed good service quality, for the wireless information interaction technology has been set up complete frame structure.
Described efficient wireless information interaction procotol specifically comprises following two aspects:
I, wireless information interaction network channel access protocol
Described wireless information interaction network, is characterized in that, the information interaction network of setting up has good MANET ability, and when network configuration changed, self-healing rapidly, to guarantee the connectedness of network; Higher wireless signal-path band width utilance is arranged, to guarantee data stabilization, transmission exactly, realize the mutual shared of information; Detect when conflict occurs corresponding back off algorithm is arranged, to avoid the conflict between message; Network transfer delay is low, and real-time is good, has good service quality guarantee and effective security mechanism.
Described wireless information interaction network channel access protocol specifically comprises the steps:
Steps A, ad hoc networking
The networking mode of wireless information interaction network using self-organizing, the foundation fully from the node power-up initializing to whole network comprises following steps:
Network detection: after network node powers on, initialization completes, start to carry out network detection, it is characterized in that, from channel of low frequency toward the high-frequency channel, scan successively the situation of taking, according to different channel occupancy situations, make corresponding decision-making, obtain all addresss of node and real time data information in channel, use respective logic algorithm coordinator node to add and the node departure process.
Node adds: described node adition process, it is characterized in that, after node has been surveyed, obtain channel occupancy information, there is the channel of network in selection, whether fullly monitor this channel interior nodes, select different nodes to add strategy, after adding successfully, by the address number of oneself, and upgrade online node listing, the re-synchronization sequential, start to carry out the data transmission.
Node leaves: described node leaves and is divided into normal off-line and unexpected off-line, it is characterized in that, normal off-line is arranged to different strategies from unexpected off-line, guarantee that the off-line node does not affect the normal operation of other line node in network, does not affect structure and the network performance of network.
Step B, channel access control method
In order to make described channel access protocol stablize, work reliably, the behavior of node is clearly defined, make node under different conditions, while receiving different message data, make correct response.Network node specifically comprises following 5 kinds of states:
Protocol initializing: this state is the node rear state automatically entered that powers on, and node carries out Channel Detection at this moment, and the interim host node of random competition.In case channel busy detected, competition becomes interim host node, competes the event that unsuccessfully waits, and exits this state.
Interim host node: node is won in competition become interim host node, the automatic generating network address, and this address is added in to the line node listing, periodically send local data information; Simultaneously, interim host node sends corresponding command information according to different situations after receiving the request of reaching the standard grade of the node of newly reaching the standard grade, and maintains the cyclomatic number order.Interim host node can change, and any node can become interim host node.
Etc. to be added: a plurality of if the node of reaching the standard grade simultaneously has, in an information interaction periodicity, can not all add network so, add the node of failure the state to be added such as to forward to by init state, node in this state, according to the instruction message of interim host node, enters online member condition subsequently.
Online member: after node confirmed to have added network, the state of node changed to online member automatically; Online member node sends data message successively according to scheduled timing, and can in data message, add instruction, so that flexible conversion is to other state.
Dormancy: node, after sending the dormancy instruction, enters resting state, and this state is mainly again add online member and save power consumption for convenient, saves unnecessary function.
Described channel access control method need to carry out the time slot of network node to be divided and clock synchronous, guarantees that on the one hand the information of nodes can carry out alternately in strict accordance with predefined logic, and the while is also determining real-time performance and the service quality of network.Also need to be for described channel access control method, the design data frame format, for network coordination control and data information transfer.
The back off algorithm of step C, channel access protocol
Described wireless information interaction network, carried out strictly synchronously sequential, 2 reserved time slot stages, has the situation of a plurality of node contention channels, and this just needs to adopt the back off algorithm of channel access protocol to coordinate.Described channel access protocol back off algorithm, is characterized by, according to back off time, the interval value of setting backoff counter, the added value F of backoff counter McAnd minimizing value F decReally set pattern is as follows:
F mc=Min(α×counter,MAX)
F dec = Max ( counter , MIN )
When conflict occurred, counter increased progressively, and the left margin of avoidance sector moves to left avoidance sector is increased, and made simultaneously on average to keep out of the way duration and reduced, and this just allows node probability of success when next time sending of keeping out of the way larger.Continuation increase along with backoff counter, can be the network relatively blocked up the larger space of keeping out of the way be provided; After data sent successfully, the numerical value of backoff counter adopted negative exponent idempotent mode to reduce with fast speed, to alleviate rapidly network pressure.
II, the dynamic control protocol design of network transmission speed
The dynamic control protocol of described network transmission speed, realized the dynamic adjustment of each node different rates, it is characterized in that, at first, by respective algorithms, determines that node sends the dynamic requests speed of data, and it is identified; Then, data transmission procedure is controlled in real time, allowed the node data transmission adjust according to the real-time information interaction requirement; Again, the efficiency of the setting of priority and the whole transmission control protocol of adjustment strategy decision, this just need to have complete logic to coordinate the node of different priorities; Finally, dynamic rate shaping is the high efficiency in order to realize that nodal information is mutual, the real time information that inessential node collects is compressed to fusion, remove redundancy, without the high accuracy data of practicality, for important node data, reserve the more network bandwidth simultaneously, guarantee that the high speed information between important node is mutual.
In order to improve network node, there are differences the information interaction efficiency in situation in request of data speed, each node must be safeguarded a node priority tabulation, and dynamically generate on this basis one group of node listing for distribute data information interaction time slot, thereby allow the node of different priorities have the chance that repeatedly sends data in an information interaction periodicity, allow the information interaction frequency be promoted by a relatively large margin; After collecting data, each node need carry out Distributed Detection to data message, and carries out the data compression fusion by the relation of current priority and node real-time data acquisition rate, for the data of the mutual required transmission of nodal information provide more efficient information.
The dynamic control protocol of described network transmission speed, be: each node of participating in information interaction has independently dynamic transmission speed and independently request of data speed, realized the requirement of real-time of different pieces of information, for independence and the customization of network node behavior provides necessary basic framework.
The accompanying drawing explanation
Fig. 1 is the relation of channel access protocol and standard network hierarchy protocol stack
Fig. 2 is network Establishing process figure
Fig. 3 is the node state transformational relation
Fig. 4 is the complete cycle time slot map
Fig. 5 is the avoidance sector schematic diagram
Embodiment
Below in conjunction with accompanying drawing and embodiment, the present invention is described in further detail:
Channel access protocol is the basis of wireless information interaction procotol, be positioned at the bottom of wireless network protocol stack architecture, next-door neighbour's physical layer, as shown in Figure 1, it directly controls time and the transport behavior of various message on channel of node access wireless channel, stipulate the whole process of radio node access wireless channel, determined the overall performance of cordless communication network.Described efficient wireless information interaction procotol, concrete, be to take the physical layer of wireless self-organization network to be basis, application message interaction technique design wireless channel access protocol, propose the dynamic control protocol of network transmission speed of adjusting based on automatic priority simultaneously.Described efficient wireless information interaction procotol specifically comprises following two aspects:
I, the design of wireless information interaction network channel access protocol
Described wireless information interaction network channel access protocol specifically comprises the steps:
Steps A, ad hoc networking
The networking mode of wireless information interaction network using self-organizing, the foundation fully from the node power-up initializing to whole network comprises following steps:
Network detection: after node initializing completed, main program jumped to the netinit part of procotol, and started to carry out network detection.By network detection, from channel of low frequency toward the high-frequency channel, scan successively the situation of taking, when scanning channel when occupied, illustrate that there is the network of having set up in this channel.This channel is carried out to the monitoring of a complete cycle, obtain all addresss of node and real time data information in channel, enter node and add step; If it is unoccupied this channel to be detected, random back becomes the host node in this channel after a period of time, and periodically sends self node real-time data information, waits for that other node adds.
Node adds: after node has been surveyed, obtain channel occupancy information, select to exist the channel of network, whether fullly monitor this channel interior nodes, if full, survey next channel; If it is not full, the reserved time slot that carries out data interaction at all line nodes sends the information of reaching the standard grade, and be untapped minimum node numbering in current line node by the address automatic numbering of oneself, other line node upgrades online node listing after receiving the information of reaching the standard grade of this node, the re-synchronization sequential, start to carry out the data transmission by the lowest number node.
Node leaves: node leaves and is divided into normal off-line and unexpected off-line.During normal off-line, node sends the off-line notification message at its data sending time slots, other node after receiving the off-line notification message, by this node from the line node list, deleting separately; During unexpected off-line, node has little time to send the off-line notification message, and at the data sending time slots of this node, other node detects it and do not send data, judges that it is unexpected off-line, and by it from the line node list, deleting.
Node serial number obtains by calculating automatically, by two parts, formed, and be respectively channel number and the network address, 16 bits by 1 double byte mean, and most-significant byte is channel number, and least-significant byte is the network address.Fig. 2 is that network is set up process.
Step B, channel access control method
In order to make described channel access protocol stablize, work reliably, need the behavior of clear and definite defined node, to control node under different states, while receiving different message data, make different reactions.Network node specifically comprises following 5 kinds of states:
Protocol initializing: this state is the node rear state automatically entered that powers on, and node carries out channel detection at this moment, and the interim host node of random competition.In case detect channel busy, competition becomes interim host node, competes the event that unsuccessfully waits, and exits this state.
Interim host node: when node, win in competition while becoming interim host node, automatic generating network address 0x00, and this address is added in to the line node listing, by the cycle, send local data information simultaneously; After interim host node is received the request of reaching the standard grade of the node of newly reaching the standard grade, this node address is added to online node listing, at reserved time slot, send network node and upgrade instruction, newly added node confirms to have added network after receiving this message, otherwise continue to wait for an information interaction periodicity, again send the request of reaching the standard grade.Interim host node can change, and any node can become interim host node, guarantees that it is numbered minimum getting final product in net.
Etc. to be added: a plurality of if the node of reaching the standard grade simultaneously has, in an information interaction periodicity, can not all add network so, add the failed node of competition the state to be added such as to forward to by init state; Node in this state can send the request of reaching the standard grade at the reserved time slot of the next one, after receiving the confirmation message of interim host node, enters online member condition.
Online member: after node confirmed to have added network, the state of node changed to online member automatically; Online member node sends data message successively according to scheduled timing, and in data message, adds instruction, so that flexible conversion is to other state.
Dormancy: node, after sending the dormancy instruction, enters resting state, retains its node address, and not from the line node list, deleting, only other node data of passive reception; The process of waking up is identical with the process that node adds, but message instruction difference, and do not need to regenerate the network address.
The control of channel access relates to each above-mentioned state, utilizes the reasonable conversion of these states, and the logic coordinating in the time of can realizing channel contention reaches higher network efficiency and good stability, and the transformational relation between state as shown in Figure 3.
Described channel access control method need to carry out the time slot of network node and divide and clock synchronous.Described time slot is divided with the hardware performance parameter and is had corresponding relation, and it is 0.6835ms that existing 250kb/s wireless module sends a required real time of 16byte Frame.Described time slot is divided, and it is characterized in that, the fundamental length unit of time slot is 1ms.When on the network node number, being limited to 8, more than information interaction speed can reach 100Hz, reserved 2 time slots added as node and the control of host node to network temporarily, and used to channel of low frequency transmission data.When having N node, the information interaction that completes one-period needs altogether (N+2) ms.Fig. 4 is the time slot map of a complete cycle.
Described clock synchronous starts from after random competition produces interim host node, it is characterized in that, not have node to add fashionable, and the transmission its data information of interim host node cycle.The node added enters synchronous regime after receiving this data message, carries out random competition in reserved time slot, sends reaching the standard grade request, completes reach the standard grade node and synchronizeing of host node time temporarily.After new node adds network, when next information interaction periodicity starts, carry out new length of a game synchronous.Interim host node sends a network updating message immediately after receiving the request of reaching the standard grade, to confirm adding of requesting node, and synchronous all line nodes of while, and upgrade online node listing.
In normal information interaction periodicity, for avoiding fine difference, constantly superpose, design two groups of timers, for the unit time slot, calibrate for one group, one group for cycle synchronisation.After each node sent data message, all the other nodes carried out the zero clearing of a time slot timer, guarantee the accuracy of each node sending time slots, were simultaneously the whole cycle to save portion of time.Cycle synchronisation mainly depends on the line node list, and the node of maximum numbering sends data message in this network being detected, enters reserved time slot, and length is 2ms.In order to obtain better network efficiency, and allow interim host node have enough time to the subordinate channel, to send the data message of present networks, reserved time slot can dynamically extend to a complete cycle, maximum time length can arrive the upper limit 10ms of cycle timer.Interim host node, after the transmission task of reserved time slot completes, namely starts to enter new round information interaction periodicity.
Described channel access control method, need two kinds of data frame formats, a kind of for network coordination control, a kind of for data information transfer.The network control frame data structure is as shown in table 1, and wherein numerical value all means with 16 system numbers, and length is 8byte.Data 1byte is frame head, and its fixed value is 0xC0, as origin identification; 2byte is the source node channel number, and 3byte is the source node network address, 2,3byte forms the unique address of source node in whole network jointly; 4th, 5byte forms the unique address of destination node in network; 6th, 7byte is control command, and wherein 6byte is that channel access control command, 7byte are the route control command; 8byte is the postamble sign, and fixed value is 0xE0.The network control frame is sent by interim host node, for node add and exit, mutual cycle of synchronizing information, data send and control, the multichannel data transmission is controlled, multichannel overall situation route.
Table 1 network control frame data structure
Figure BSA0000094648660000061
In table, zhetou means frame head, yjdxdbh means the source node channel number, yjdwldz means the source node network address, mbjdxdbh means the destination node channel number, and mbjdwldz means the destination node network address, and xdjrkzzl means the channel access control command, lykzzl means the route control command, and zhewei means postamble.
Frame is for the transmission of data message, and frame head is 0XD0, and also the order of subsidiary 2 byte is for transmitting control simultaneously, and before its data structure, 7byte is identical with the network control frame, and 8byte starts, and is data message.The general data frame length is 16byte, namely the 8th to 15byte is data message, 6byte is postamble sign 0xE0, for the ease of the later stage expansion with than the transmission of long data, Frame can automatically be adjusted it and send length, maximum can reach 32byte, sends like this duration and can be controlled in 2 reserved time slots.The data structure of Frame is in Table 2.
Table 2 Frame data structure
Figure BSA0000094648660000062
In table, cskzzllb means to transmit the control command classification, and cskzzlsz means to transmit control command numerical value, and sjxx means data message.
The back off algorithm of step C, channel access protocol
Described wireless information interaction network, sequential has been carried out strictly synchronously, 2 reserved time slot stages, had the situation of a plurality of node contention channels: interim host node need to send network control and send with network lastest imformation, node reach the standard grade, roll off the production line request, communicating by letter across channel.The conflict of these class data is paroxysmal, and quantity little.The back off algorithm of described channel access protocol, is characterized by, the value of the backoff counter set and back off time, interval relevant, rather than simple back off time length; Secondly, maximum avoidance sector length is 1 time slot; The F of back off algorithm McAnd F decFunction is as follows:
F mc=Min(α×counter,MAX)
F dec = Max ( counter , MIN )
F incFor increasing the value of backoff counter, F decFor reducing the value of backoff counter.
Setting the acquiescence avoidance sector is [0.5ms~1.0ms], when conflict occurs, counter increases progressively, the left margin of avoidance sector moves to left avoidance sector is increased, making simultaneously on average to keep out of the way duration reduces, this just allows node probability of success when next time sending of keeping out of the way larger, and the continuation increase along with backoff counter, also provide the larger space of keeping out of the way for the network relatively blocked up; After data send successfully, adopt the numerical value of the fast quick depletion backoff counter of negative exponent idempotent mode, to alleviate rapidly network pressure.The avoidance sector schematic diagram as shown in Figure 5.
II, the dynamic control protocol design of network transmission speed
The dynamic control protocol of described network transmission speed, adjust strategy and the realization of dynamic rate control strategy by priority.Concrete, be after node adds network, by the information of reaching the standard grade and the real-time information interaction of each node, automatically generate a line node list that all data sending request speed is identical.In order to realize that different nodes can have different data sending request speed, the data transmission state of node is set to 0~7 and has 8 priority altogether.In the situation that all node datas send request speed is identical, each node is in minimum data and sends priority, namely 0 grade, carries out information interaction according to described channel access protocol; When the needs of node according to current application, while needing to change its transmission request of data speed, Data Transmission Controlling instruction in the change Frame, and be broadcast to whole channel, after this cycle, information interaction completed, generate new data transmitting node list, and by new list, carry out the information interaction in next cycle.
The generation strategy of data transmitting node list: suppose that the channel internal segment counts as N, the unit slot length is Δ t, and (0~N-1), it is p (i) that the data of each node send priority to the i that is numbered of each node.Data transmitting node list first paragraph is all line node lists, second segment is that priority is all node listings more than 1, the p section is that priority is the above node listing of p-1, it is the list of a data sending node that all lists are in turn connected into, add 2 reserved time slots, form a complete information interaction periodicity.The sending time slots quantity that the data transmitting node list generated comprises altogether is N t, the length in a mutual cycle of data is N t+ 2x Δ t, wherein:
N t = Σ i = 0 N - 1 ( p i + 1 )
Its priority of node that is numbered i=n is p n, within a complete data interaction cycle, send altogether p n+ 1 time, the transmission frequency of node n is f n:
f n = p n + 1 ( 2 + Σ i = 0 N - 1 ( p i + 1 ) ) × Δt
This has just directly set up mapping relations for the request of data speed of node and priority, node is according to the required request of data speed of application, in conjunction with the current channel interior nodes sum N obtained, the data of other each node, send priority, just can obtain the priority level initializing value p of this node under this request of data speed n, p nRound up.
According to above-mentioned designed priority level adjustment method, other node also can carry out the priority adjustment by this mode, thereby realizes the dynamic control of node data request rate.
The dynamic control protocol of described network transmission speed, each node of participating in information interaction has independently dynamic transmission speed, request of data speed independently, realized the requirement of real-time of different pieces of information, for independence and the customization of network node behavior provides necessary basic framework, this exploitation for actual information Internet system has great importance.
According to described channel access protocol with based on the network dynamic rate transmission control protocol of automatic priority, realize that the main process of wireless efficient information interaction network is expressed as follows:
Described wireless efficient information interaction procotol runs in the wireless radio frequency modules such as CC2530, and sensing data is transferred in wireless radio frequency modules with the serial bus form.
Module has powered on after hardware initialization, and protocol procedure brings into operation.According to Protocol Design, at first node carries out scan channel, owing in the radio-frequency module transmission range, there not being before other network, therefore select No. 0 channel, carry out the random back competition and be interim host node, generating network address 0x00, and the frame of timed sending network control chronologically, sending target is all nodes in channel, now sets up a network that only has interim host node.Successfully competition does not become the node of interim host node and the node newly powered on, and after the channel of network being detected, selects this channel, and enters wait and add state.After interim host node sent network control frame one-period, the execution cycle was synchronous, simultaneously the address of interim host node is added to online node listing, automatic generating network address 0x01.Etc. node to be added at reserved time slot according to the reach the standard grade transmission of request data frame of back off algorithm, the node that success sends will be caught by interim host node.Interim host node can be replied a network control frame immediately, and the prompting network node upgrades, as the confirmation to newly added node.After this network control frame sent, network entered first information interaction periodicity, and interim host node and newly added node start to send data message according to the line node list.Other need to add the node of network to utilize the reserved time slot at each cycle end, back, adds network according to same way as, until the channel interior nodes upper limit.The node that exceeds the node upper limit, be converted to another available frequency, starts the random back competition of interim host node.
During at 2 above nodes, information interaction starts to carry out at network internal storage, starts to act on data transmission procedure based on the network dynamic rate transmission control protocol of automatic priority.Application program, by wireless information interaction agreement spare interface parameter, proposes to promote the requirement of the mutual request rate of data message to node, after agreement receives this parameter, utilize the monitoring to network in channel, and the real time data of obtaining other node sends priority.According to protocol theory, calculate the data that need to arrange and send priority, in current period, send the time slot of its data, will send with the Frame of the Data Transmission Controlling instruction of priority adjustment.Next data interaction, during the cycle, will be carried out data interaction according to newly-generated data transmission nodal list, realizes the dynamic adjustment of the mutual and data information request speed of the high speed information of node.
In actual applications, different pieces of information often has different requirement of real-times to wireless messages real-time, interactive technology, and key is that each node in network obtains the information of other all nodes on every side by information interaction.The present invention has announced a kind of method for designing of efficient wireless information interaction procotol, has designed the wireless channel access protocol for exchange technology, makes the wireless information interaction network have better real-time, is more suitable for processing real time interaction information and burst information; Simultaneously, proposed the dynamic control protocol of network transmission speed of adjusting based on automatic priority, this agreement is by carrying out the dynamic adjustment of different priorities, the reasonable distribution network bandwidth to the net interior nodes, by demand, control the speed of different nodes, have adaptability and versatility widely.Described efficient wireless information interaction procotol, realized internodal efficient information interaction and guaranteed good service quality, for the wireless information interaction technology has been set up complete frame structure.
As mentioned above, the scheme content given with explanation, can derive similar technical scheme by reference to the accompanying drawings.In every case be any simple modification, equivalent variations and the modification of doing according to technical spirit of the present invention, all still belong in the scope of technical solution of the present invention.

Claims (3)

1. the method for designing of an efficient wireless information interaction procotol, it is characterized in that the method comprises wireless information interaction network channel access protocol and network dynamic rate transmission control protocol, described wireless information interaction network channel access protocol, its key step comprises:
(1) ad hoc networking.It is characterized in that, at network node, power on, after initialization completes, start to carry out network detection, from channel of low frequency toward the high-frequency channel, scan successively the situation of taking, according to different channel occupancy situations, make corresponding decision, use respective logic algorithm coordinator node adition process and node departure process.Described node adition process, is characterized in that, after node has been surveyed, obtains channel occupancy information, selects to exist the channel of network, reaches suitable node and add strategy, guarantees that node successfully adds network.Described node leaves and is divided into normal off-line and unexpected off-line, it is characterized in that, normal off-line is arranged to different strategies from unexpected off-line, guarantees that the off-line node does not affect the normal operation of other line node in network, does not affect structure and the network performance of network.
(2) channel access control method.It is characterized in that, the behavior of node is defined as to five kinds of states, set node under different conditions, the reaction of making while receiving different message data makes described channel access protocol stablize, work reliably:
Protocol initializing: this state is the node rear state automatically entered that powers on, and node carries out the interim host node of channel detection and random competition at this moment.
Interim host node: node is won in competition become interim host node, and the automatic generating network address sends local data information by the cycle; Simultaneously, interim host node is received after reaching the standard grade of the node of newly reaching the standard grade asked and is sent command adapted thereto, maintains network order.
Etc. to be added: a plurality of if the node of reaching the standard grade simultaneously has, the node of the interim master node failure of competition will the state to be added such as forward to by init state, and the node in this state, according to the instruction message of interim host node, enters online member condition subsequently.
Online member: after node added network, the state of node changed to online member, and online member node sends data message successively according to scheduled timing, and can in data message, add instruction.
Dormancy: node, after sending the dormancy instruction, enters resting state, and this state is mainly again add online member and save power consumption for convenient, and saves unnecessary function.
(3) back off algorithm of channel access protocol.It is characterized in that, according to back off time, the interval value of setting backoff counter.When conflict occurs, counter increases progressively, the left margin of avoidance sector moves to left avoidance sector is increased, making simultaneously on average to keep out of the way duration reduces, thereby increase, keep out of the way the probability of success of node when next time sending, continuation increase along with backoff counter, also provide the larger space of keeping out of the way for the network relatively blocked up; After data send successfully, adopt negative exponent idempotent form with fast speed, to delete the value of backoff counter, thereby alleviate rapidly network pressure.
2. according to claim 1, described network dynamic rate transmission control protocol, is characterized in that, realized the dynamic adjustment of each node different rates.At first, by corresponding algorithm, determine that node sends the dynamic requests speed of data, and it is identified; Then, data transmission procedure is controlled in real time, allowed the transfer of data of node adjust according to the real-time information interaction demand; Again, the node that complete adjustment strategy is coordinated different priorities is set; Finally, the real time information that unessential node collects is compressed to fusion, remove redundancy, without the high accuracy data of practicality, for the data of important node reserve the more network bandwidth, the high speed information that guarantees to have between the interdependent node of important information is mutual.In the situation that request of data speed there are differences, in order to improve the information interaction efficiency of network node, each node must be safeguarded a node priority tabulation, and dynamically generates on this basis one group of node listing for distribute data information interaction time slot.
3. according to claim 1, described channel access control method is carried out to the time slot of network node and divide and clock synchronous, guarantee that the information of nodes is carried out alternately according to predefined logic, improve real-time performance and the service quality of network.Simultaneously, for described channel access control method, the design data frame format, for network coordination control and data information transfer.
CN201310392835.1A 2013-09-03 2013-09-03 A kind of method for designing of efficient wireless information interaction procotol Expired - Fee Related CN103415045B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310392835.1A CN103415045B (en) 2013-09-03 2013-09-03 A kind of method for designing of efficient wireless information interaction procotol

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310392835.1A CN103415045B (en) 2013-09-03 2013-09-03 A kind of method for designing of efficient wireless information interaction procotol

Publications (2)

Publication Number Publication Date
CN103415045A true CN103415045A (en) 2013-11-27
CN103415045B CN103415045B (en) 2016-03-02

Family

ID=49608021

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310392835.1A Expired - Fee Related CN103415045B (en) 2013-09-03 2013-09-03 A kind of method for designing of efficient wireless information interaction procotol

Country Status (1)

Country Link
CN (1) CN103415045B (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105227349A (en) * 2015-08-27 2016-01-06 北京泰乐德信息技术有限公司 Nomadic MANET dispatching patcher and dispatching method thereof
CN106255137A (en) * 2016-09-18 2016-12-21 南方电网科学研究院有限责任公司 Promote the method and system of LoRa network service speed
CN106444640A (en) * 2016-11-30 2017-02-22 南京阿凡达机器人科技有限公司 System and method for wireless networking of module inside robot
CN107040284A (en) * 2017-03-27 2017-08-11 西安电子科技大学 A kind of multiple access method for the reliability and stability for improving data transfer
CN108667487A (en) * 2018-05-19 2018-10-16 杭州海兴电力科技股份有限公司 G3 carrier network dynamic adjustment based on priority of registration list and network-building method
CN109218126A (en) * 2017-06-30 2019-01-15 中兴通讯股份有限公司 The method, apparatus and system of monitoring node existing state
CN109561459A (en) * 2018-11-28 2019-04-02 中国运载火箭技术研究院 A kind of sea VHF frequency range self-organizing network data transmission system and method
CN113364838A (en) * 2021-05-26 2021-09-07 中建三局智能技术有限公司 MQTT-based equipment ad hoc network method and system
CN113515543A (en) * 2021-03-23 2021-10-19 广东便捷神科技股份有限公司 Automatic goods picking method and system for unmanned vending machine
CN115002930A (en) * 2022-05-23 2022-09-02 天津市智慧物联信息技术研究院 IEEE802.11ah wireless networking system and communication method for edge intelligent cooperation
CN116665888A (en) * 2023-07-26 2023-08-29 大安健康科技(北京)有限公司 Traditional Chinese medicine syndrome fine granularity quantitative evaluation method and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101986728A (en) * 2010-12-15 2011-03-16 山东大学 Cross-layer multicast communication method with high delivery ratio and low time delay
CN102547584A (en) * 2010-12-13 2012-07-04 浙江海洋学院 Channel access method for ship-mounted wireless mobile Ad-hoc network based on self-organization time division multiple access

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102547584A (en) * 2010-12-13 2012-07-04 浙江海洋学院 Channel access method for ship-mounted wireless mobile Ad-hoc network based on self-organization time division multiple access
CN101986728A (en) * 2010-12-15 2011-03-16 山东大学 Cross-layer multicast communication method with high delivery ratio and low time delay

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
YUNNAN WU ET AL: "Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast", 《2005 CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS》 *
夏海轮 等: "Ad hoc网络中一种新的退避算法", 《电子科技大学学报》 *
翟建华: "AdHoc网络接入机制与路由协议研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *
赵志峰 等: "Ad hoc网络信道接入技术研究", 《解放军理工大学学报(自然科学版)》 *

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105227349B (en) * 2015-08-27 2018-04-17 北京泰乐德信息技术有限公司 Nomadic ad hoc network dispatches system and its dispatching method
CN105227349A (en) * 2015-08-27 2016-01-06 北京泰乐德信息技术有限公司 Nomadic MANET dispatching patcher and dispatching method thereof
CN106255137B (en) * 2016-09-18 2019-08-27 南方电网科学研究院有限责任公司 Promote the method and system of LoRa network communication rate
CN106255137A (en) * 2016-09-18 2016-12-21 南方电网科学研究院有限责任公司 Promote the method and system of LoRa network service speed
CN106444640A (en) * 2016-11-30 2017-02-22 南京阿凡达机器人科技有限公司 System and method for wireless networking of module inside robot
CN107040284B (en) * 2017-03-27 2020-10-02 西安电子科技大学 Multi-address access method for improving reliability and stability of data transmission
CN107040284A (en) * 2017-03-27 2017-08-11 西安电子科技大学 A kind of multiple access method for the reliability and stability for improving data transfer
CN109218126A (en) * 2017-06-30 2019-01-15 中兴通讯股份有限公司 The method, apparatus and system of monitoring node existing state
CN109218126B (en) * 2017-06-30 2023-10-17 中兴通讯股份有限公司 Method, device and system for monitoring node survival state
CN108667487A (en) * 2018-05-19 2018-10-16 杭州海兴电力科技股份有限公司 G3 carrier network dynamic adjustment based on priority of registration list and network-building method
CN109561459B (en) * 2018-11-28 2021-11-16 中国运载火箭技术研究院 Offshore VHF frequency band self-organizing network data transmission system and method
CN109561459A (en) * 2018-11-28 2019-04-02 中国运载火箭技术研究院 A kind of sea VHF frequency range self-organizing network data transmission system and method
CN113515543A (en) * 2021-03-23 2021-10-19 广东便捷神科技股份有限公司 Automatic goods picking method and system for unmanned vending machine
CN113515543B (en) * 2021-03-23 2024-02-13 广东便捷神科技股份有限公司 Automatic goods picking method and system for vending machine
CN113364838B (en) * 2021-05-26 2022-08-26 中建三局智能技术有限公司 Equipment ad hoc network method and system based on MQTT
CN113364838A (en) * 2021-05-26 2021-09-07 中建三局智能技术有限公司 MQTT-based equipment ad hoc network method and system
CN115002930A (en) * 2022-05-23 2022-09-02 天津市智慧物联信息技术研究院 IEEE802.11ah wireless networking system and communication method for edge intelligent cooperation
CN115002930B (en) * 2022-05-23 2022-12-09 天津市智慧物联信息技术研究院 IEEE802.11ah wireless networking system and communication method for edge intelligent cooperation
CN116665888A (en) * 2023-07-26 2023-08-29 大安健康科技(北京)有限公司 Traditional Chinese medicine syndrome fine granularity quantitative evaluation method and system

Also Published As

Publication number Publication date
CN103415045B (en) 2016-03-02

Similar Documents

Publication Publication Date Title
CN103415045B (en) A kind of method for designing of efficient wireless information interaction procotol
CN101409660B (en) Channel access control method for wireless sensor network
CN108235437B (en) Wireless mobile self-organizing network channel time slot scheduling and distributing method
CN103873485B (en) Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network
CN101466161B (en) Data collection method suitable for multi-hop wireless sensor network
CN107040878B (en) Non-layered communication method of multi-chain wireless sensor network
CN108093469B (en) Distributed access method of wireless transmission system based on TDMA
CN104378812B (en) Farmland self-organizing network regenerative resource node difference topology control method
CN107835527A (en) A kind of wireless sensor network communication method based on timesharing dormancy
CN109673045A (en) Wireless sensor network time slot allocation multi-hop synchronous transmission system and method
WO2008071762A1 (en) Low-power wireless multi-hop networks
CN107071811A (en) A kind of fault-tolerant Uneven Cluster algorithms of WSN based on fuzzy control
CN102122973A (en) Clustering-wireless-sensor-network-orientated two-stage adaptive frequency-hopping method
CN113098674B (en) Time synchronization method and system for data link terminal of high-speed carrier self-organizing network
CN104012147A (en) Method for routing data in a wireless sensor network
CN103415018A (en) Communication resource allocation method of wireless sensor network
CN103987100A (en) Sensor network energy-saving low energy adaptive clustering hierarchy improved method based on region division
CN103929818A (en) Time slot allocation protocol of aircraft autonomous formation supporting network
CN102843758A (en) Method for data energy conservation transmission between nodes in wireless sensor network
CN101801113A (en) Network topology cluster processing method and processing system
CN109413706B (en) Method for realizing synchronous RM-MAC protocol of reserved multi-hop node
CN103596284A (en) Energy-efficient wireless sensor network distribution type link scheduling controller
Zidi et al. MC-UWMAC: A multi-channel MAC protocol for underwater sensor networks
US20100061395A1 (en) Self-organizing resource access apparatus and method in local area network communication environment
CN114449629A (en) Wireless multi-hop network channel resource optimization method driven by edge intelligence

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
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160302

Termination date: 20200903