CN103929824A - Wireless network node neutral access dynamic configuration method - Google Patents
Wireless network node neutral access dynamic configuration method Download PDFInfo
- Publication number
- CN103929824A CN103929824A CN201410115081.XA CN201410115081A CN103929824A CN 103929824 A CN103929824 A CN 103929824A CN 201410115081 A CN201410115081 A CN 201410115081A CN 103929824 A CN103929824 A CN 103929824A
- Authority
- CN
- China
- Prior art keywords
- node
- time slot
- rent
- network
- priority
- 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.)
- Pending
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a wireless network node neutral access dynamic configuration method. The method comprises the following steps of conducting network synchronization of master and slave nodes, conducting preprocessing, reserving the application and reply, dynamically completing time slots, and conducting channel renewing and multiplexing based on priority decisions, and conducting data transmission. According to the wireless network node neutral access dynamic configuration method, the time slot utilization rate is high, the topology adaptation is good, the control overhead is small, the network opening time is short, and the network restructuring ability is strong.
Description
Technical field
The invention belongs to wireless communication technology field, the wireless network node that particularly high, the topological adaptability of a kind of slot efficiency is good, control overhead is little is with meeting access Dynamic Configuration.
Background technology
Wireless multi-hop self-assembly device network parameter is many, complexity is set, offer duration, the ability of can recombinating, artificial setting operation link is too much, cannot adapt to the dynamic network topology structure of mobile wireless network node according to task retinue variation, be difficult to improve retinue with meeting access and opening fast deployment ability.Wireless self-networking is how dynamic coordinate and allocate communications subnet resources use right with meeting one of heavy difficulties of access research.
TDMA(Time Division Multiple Address, time division multiple access) time division multiple access access encodes without complexity, burst rate is high, a N time-derived channel can share a carrier wave, and system complexity is low, antijamming capability is strong, is therefore applicable to wireless communication system channel and connects.On time division multiple access access basis, design efficient channel booking mechanism and time slot address Dynamic Assignment and can greatly reduce node networking time delay, reduce collision probability and retransmission rate, improving networking efficiency, is to realize wireless multi-hop MANET equipment fast with the prerequisite of meeting access.
Current distribute for wireless self-networking tdma slot in the world and the research of dispatching algorithm according to the degree of dependence of topologies change being divided into topology have nothing to do class and topological associated class time slot address collocation method.
1. the irrelevant class collocation method of topology.Traditional static S-TDMA (Static-TDMA) distributes class networking access way to adopt centralised allocation, is the irrelevant collocation method of a kind of typical topology.Network access node time slot and address adopt and hardware cluster fixed allocation, the renewal of time slot address allocation table does not rely on change in topology, in one frame, number of timeslots is directly proportional to network node scale, be easy to realize from group Access Algorithm, shortcoming be time slot and address multiplex rate low, networking inefficiency, lacks dynamic expansion ability.
P-TDMA(Improvement TDMA) agreement is the improvement to the fixing static S-TDMA method of salary distribution.By being each node mode that correspondence is distributed a main time slot one by one by number, realize between node and can conflict freely send control information and data message.When node will send at main time slot, in statement subframe, corresponding time slot sends RTS grouping, and node is taken turns statement subframe by monitoring one, can know in a jumping around, which node is the live-vertex being ready for sending.And reply in subframe, oneself is listened to around live-vertex information package send, take turns and reply subframe by monitoring one, can obtain around all 2 jump in live-vertex information.By this information interaction, make the node outside double bounce can multiplexing time slot, realize the space division multiplexing of wireless channel.
2. topological associated class distribution method.In these class methods, the variation of topological structure, by the variation that causes time slot and address allocation plan to reduce conflict, improves reusability.
(1) the relevant distribution method of the topology based on future mechanism.The dynamic distributed FPRP agreement realizing on to the improvement basis of fixed allocation TDMA time division multiple access protocol, adopts five step future mechanisms to carry out distributed channel reservation, and each network access node reservation procedure is only relevant to himself double bounce neighbors.By the full distributed current available resource thinking of obtaining of FPRP, time slot and address are reserved does not rely on any host node completely, does not need to predict the whole network parameter, has improved network reconfiguration adaptive capacity.
Shortcoming is that the reliability of this complete distributed allocation agreement and multiplexing capacity are to reach by the control overhead between increase neighbors, is applicable to network larger and that node mobility is lower.If node motion speed is higher, for example UAV system, In-vehicle networking, topologies change speed is fast, reserved application node in movement possibly cannot be received the CR conflict grouping in last neighborhood and become TN sending node, increase the probability clashing with the interior TN node of a rear neighborhood, while causing, slot reservation convergence time is longer, and control overhead increases.
(2) the relevant distribution method of the topology based on competition.Although competition class access typical method CSMA can meet with meeting access requirement, whether time slot and address assignment all can become current real sending node and Dynamic Acquisition by competition node, node and neighbors competitive way busy channel, can adapt to wireless ad hoc topological structure dynamic change situation, but first must detect channel busy, existing radio channel state condition cannot avoid conflict and collides and solve hidden terminal problem, causes the method service efficiency lower.MACA, DCF agreement is all in the spread foundation of CSMA/CA contention access, increase transmission control packet part and solved hidden terminal and exposed terminal problem, adopt avoidance mechanism solving collision problem, the former has adopted binary exponential backoff algorithm BEB(Binary Exponential Backlog), the latter has used a kind of dynamic avoidance mechanism, node all can select an integer as backoff counter initial value at random between 0 to current competition window CW at every turn before attempting to send data, node is first intercepted channel busy before transmission message, as a DIFS time period of channel continuous idle, node enters backoff procedure.Every continuous idle one time slot of channel, node subtracts one by the backoff counter of oneself, is decremented to 0 expression and completes and keep out of the way, and sends immediately message.As channel in backoff procedure becomes busy, node stop is kept out of the way counting, after the DIFS time period, has continued backoff procedure when channel again becomes not busy and continues.
But these agreements based on CSMA/CA thought can not adapt to the variation of the true congestion state of wireless communication network completely, especially the complicated various external interference of battlefield surroundings, node is from the existence of disturbing, local area network congestion state can not take a turn for the better at short notice fast, but may be within the scope of certain hour Persistent Congestion, the access way of therefore competing current free timeslot adopts avoidance mechanism, wait for that possibly quite long free time is with solving collision problem, thereby waste available time slot, make networking inefficiency, competition class cut-in method taking CSMA as representative is not also suitable for and has multiple outside electromagnetic interference and the higher network environment of node density.
Open fast and deployment issue for solving wireless ad hoc network node, increase slot efficiency, Chinese invention patent " a kind of dynamic time slot allocation access method of networking of frequency-hopping radio station " (notification number CN102118832B, at on 09 18th, 2013 day for announcing) a kind of dynamic time slot allocating method disclosed, the method basic thought, according to P-TDMA agreement, is divided into statement, replys and counts biography subframe by a whole frame.Each subframe is divided into N small time slot according to online node number N, adopts the fixed allocation mode corresponding main time slot of determining each node one by one according to node serial number order.In the time that node no longer needs to use own main time slot, can also be by the mutual control information of transmission, this time slot is sold to double bounce interior nodes around and carried out data transmission.
The problem of the method is:
1. the main time slot of network access node and node serial number cluster fixed allocation, the timeslot number of each subframe is directly proportional to node scale, time slot list update does not rely on change in topology, if node increases, P-TDMA will produce larger protocol overhead in statement stage and acknowledgment phase, protocol capabilities is declined, and network size is limited;
2. each node is held the priority list of N × N, has specified in advance the priority of each node for each time slot, and this is a kind of priority method of salary distribution being completely fixed, and cannot dynamically adjust the priority to time slot according to node traffic situation.
Therefore, existing wireless multi-hop mobile network channel booking and time slot address distribution method, improving slot efficiency and topological adaptability simultaneously, often be increased to cost with control overhead, cause agreement too complicated, be difficult to adapt to the dynamic changeable condition of wireless communication network complex electromagnetic environment and network topology structure, cannot be many in current wireless signal equipment parameter, arrange under complicated prerequisite, meet that network is opened fast, disposed in real time, the efficiently requirement of recombinating.
Summary of the invention
The object of this invention is to provide a kind of wireless network node with meeting access Dynamic Configuration, high, the topological adaptability of slot efficiency is good, control overhead is little, to shorten the network opening time, improves network reconfiguration ability.
The technical solution that realizes the object of the invention is: a kind of wireless network node, with meeting access Dynamic Configuration, comprises the steps:
10) main and subordinate node networks synchronous: host node hop-by-hop sends networking synchronizing information in self time slot on multiple frequencies, waits to network from the long search of node, receives host node networking synchronizing information, upgrades from node system information, keeps synchronizeing with host node;
20) preliminary treatment: host node enters after net state, in self time slot transmission synchronization frame, waits to network and from synchrodata frame, extracts obligate information from node, sends to host node the request of networking;
30) reserve application and reply: host node sends preassignment time slot and address to the networking for the treatment of that proposes reserved application from node, wait to network and send from node the reservation confirmation grouping of agreeing to take this address and time slot, its neighbors will no longer be competed this time slot after receiving this confirmation grouping, wait to network and wait for that from node host node is verified, send after reservation responses grouping, waiting to network formally becomes new networking from node from node;
40) dynamic competition time slot: host node is dynamically adjusted the reserved time slot section of distribution according to network size, treat that network access node selects to compete reserved time slot at random, networked can be according to its data business demand, to distribute and to compete the mode of mixing and re-rent each self-corresponding alternative time slot from node simultaneously;
50) channel based on priority decisions is re-rented multiplexing: according to nodal community priority and class of service priority, dynamic mapping is to node access priority, actively in the double bounce of competition conflict re-rent node and be assigned to according to priority sequential queue in data buffer zone occurring, participate in channel access allotment;
60) transfer of data: reserve time slot and re-rent alternative time slot result according to application, each node uses the reserved main time slot of oneself and re-rents the alternative time slot taking and sends data, in other time slot reception data.
The present invention compared with prior art, its remarkable advantage:
1, high, the topological adaptability of slot efficiency is good: on time division multiple access access basis, design efficient channel booking mechanism and time slot address Dynamic Assignment, proposition is with pretreated host node control mode to carry out the dynamic controlled configuration of time slot address, can reduce collision probability and packet retransmissions present rate, effectively reduce networking time delay
2, control overhead is little: for improving resource multiplex rate, node can repeatedly be re-rented alternative time slot, adopts priority decisions to solve the competition occupation problem of alternative time slot, has improved wireless channel utilance, has strengthened networking usefulness.
In a word, method of the present invention, can shorten the network opening time, improves Wireless Telecom Equipment retinue and accesses, opens fast and deployment ability, to adapt to the efficient networking of Wireless Telecom Equipment under the dynamic changeable condition of network topology structure with meeting.
Below in conjunction with the drawings and specific embodiments, the present invention is described in further detail.
Brief description of the drawings
Fig. 1 is dynamic slot distribution principle figure.
Fig. 2 is that wireless network node of the present invention is with meeting access Dynamic Configuration main flow chart.
Fig. 3 is reserved application and response steps flow chart in Fig. 2.
Fig. 4 is the workflow schematic diagram of dynamic competition process in whole transmission cycle in Fig. 2.
Fig. 5 is the alternative time slot flow chart of steps of dynamic competition in Fig. 2.
Fig. 6 is that in Fig. 5, in dynamic competition process, certain transmits the time division multiple access access sending time slots arrangement schematic diagram of period.
Fig. 7 is multi-hop mobile wireless node group network topological structure exemplary plot.
Fig. 8 is that in Fig. 6, the interior active node of re-renting of double bounce is competed alternative multiplexing time slot conflict exemplary plot.
Fig. 9 is that Local-distributed channel multiplexing is selected flow chart of steps
Figure 10 is node priority level and channel occupancy power mapping relations table in Fig. 9.
Embodiment
Be illustrated in figure 1 dynamic slot distribution principle figure.
As shown in Figure 2, wireless network node of the present invention, with meeting access Dynamic Configuration, comprises the steps:
10) main and subordinate node networks synchronous: host node hop-by-hop sends networking synchronizing information in self time slot on multiple frequencies, waits to network from the long search of node, receives host node networking synchronizing information, upgrades from node system information, keeps synchronizeing with host node;
Described main and subordinate node networks in synchronous (10) step, and the networking synchronizing information that host node sends comprises this main website mark, host node MAC Address, current frame length, main timeslot number, main time slot duration, time slot duration, reserved competition slot section.
According to dynamically controlled rule, set and change rule by host node from node networking synchronizing process.Host node is according to the network size of configuration, open ended total nodes N, network access node is counted n, cycle length and the node traffic demand of each frame, the time span t that each time slot occupies is set, competition slot duration k, calculates the number f=(N-n)/2 that reserves competition slot, and all nodes take duration F=(n+1) t+kf.
20) preliminary treatment: host node enters after net state, (doubles time slot duration and t) sends synchronization frame, wait to network and from synchrodata frame, extract obligate information from node, send to host node the request of networking in self time slot;
In the time that new application network access node is received by host node sends or via node forwards synchrodata frame, from bag, parse the reserved time slot section T of corresponding competition
r=[T
n+1..., T
i, T
n+f] parameter such as (n is network access node number, and f is reserved competition slot number), obtain request time slot T according to random algorithm
i.
30) reserve application and reply: host node sends preassignment time slot and address to the networking for the treatment of that proposes reserved application from node, wait to network and send from node the reservation confirmation grouping of agreeing to take this address and time slot, its neighbors will no longer be competed this time slot after receiving this confirmation grouping, wait to network and wait for that from node host node is verified, send after reservation responses grouping, waiting to network formally becomes new networking from node from node;
As shown in Figure 3, described reserved application and reply (30) key step and comprise:
31) reserved application: wait to network from node according to preprocessing process from T
rthe reserved time slot T of middle extraction
i, send reservation request and check code to host node.
32) preassignment: host node (if via node, request bag need be transmitted to host node) receive after networking reservation request bag, report and treat network access node name of station, MAC Address, packet affairs ID and check code, wait for and networking after license, send pre-distribution scheme packet to the application network access node that not yet distributes address, list the time slot T of node request
iiP associated with time slot address, first host node attempts using 31) in treat that network access node hardware address communicates by letter with it, if communication failure, host node is broadcasted away this preassignment packet.
33) receive and reply: receive from node wait networking the networking response preassignment packet of host node, be confirmed to be according to packet affairs ID after the request of oneself initiating, parse relevant parameter and report upper layer software (applications), in preallocated time slot, send and receive reply data bag, its neighbors is no longer competed this time slot and address, and prepares to receive data at this time slot.
In a reservation period, do not receive the reception reply data bag that networks from node waited of initiating reserved application after preassignment packet as host node sends, and thought and change off-grid or because other reason stops the request of networking of node, no longer processed this request.This step be for prevent host node by time slot and address assignment to unnecessary node, cause the waste of channel resource.
34) distribute and confirm: host node is received wait networking from the reception reply data bag of node, host node is checked time slot and the address table of oneself again, whether the address of this request and time slot be current occupied, if vacant, report upper layer software (applications) information and check code, this time slot and address assignment are given from node, record time slot address distribution list content. send and confirm that packet networks from node to waiting reserved distribution, and report upper layer software (applications), if n<N, n=n+1.Now initiate receiving from node and distribute confirmation bag wait networking of these reservation request affairs ID, confirming own current is not isolated node, just can use time slot T
iiP associated with time slot address, in online communication.
35) if as new node network unsuccessful, need to repeat above-mentioned enter network process 31) to 34).
40) dynamic competition time slot: host node is dynamically adjusted the reserved time slot section of distribution according to network size, treat that network access node selects to compete reserved time slot at random, networked can be according to its data business demand, to distribute and to compete the mode of mixing and re-rent each self-corresponding alternative time slot from node simultaneously;
Shown in Fig. 4, for dynamic competition process constantly runs through the reserved time slot of whole transmission cycle and re-rents the workflow of time slot.As shown in Figure 5, the alternative time slot of described dynamic competition (40) step comprises:
41) distribute reserved time slot section: main controlled node is according to the reserved time slot section of network size dynamic assignment;
42) the reserved time slot of competition: wait to network and select at random to compete reserved time slot from node, access fast;
As shown in Figure 6, be 42) the middle time division multiple access access sending time slots arrangement signal of competing certain period in reserved time slot process.
43) time slot is re-rented in competition: networked from node according to data traffic requirement, continued the competing time slot of re-renting.
As shown in Figure 7, Figure 8, a multi-hop mobile wireless node network, in double bounce, live-vertex is competed alternative time slot collision, carrying out 50) channel based on priority decisions re-rents multiplexing: according to nodal community priority and class of service priority, dynamic mapping is to node access priority, actively in the double bounce of competition conflict re-rent node and be assigned to according to priority sequential queue in data buffer zone occurring, participate in channel access allotment;
The described channel based on priority decisions is re-rented multiplexing (50) step and is comprised:
51) Local-distributed space division multiplexing is selected: network and send demand from node according to data, within the scope of the double bounce of active channel competition node that has data transmission demand, calculate the alternative time slot of reusable;
As shown in Figure 9, described Local-distributed space division multiplexing selects (51) step to comprise:
511) re-rent preparation: network access node, according to data traffic requirement competition slot as required, is first broadcasted the grouping that a business category is " re-renting bulletin ", starts one to re-rent the cycle, and node formally becomes re-rents node;
512) distributed monitoring: each jumping neighbors of re-renting node dispersion zone receives that business category is the grouping of " re-renting bulletin ", time slot at oneself is sent a jumping neighbors address, the Time Slot Occupancy information package heard, re-rent node again through one take turns frame monitor, can know two-hop neighbor node gap information collection T
u;
513) re-rent request: respectively re-rent node and distributed and taken set Τ according to host node system current time slots in the continuous synchrodata frame sending of main time slot
h, and double bounce neighbors takies time slot set T
u, calculate the alternative time slot set of reusable
from T
sin random select alternative time slot to send " request of re-renting " packet to host node, and the two-hop neighbor node information incidentally listening in the scaling option of request data package;
514) re-rent and reply: host node extracts the time slot address of " re-renting confirmation " packet of network access node transmission and re-rents solicited message, and double bounce node data in scaling option, wait for a time interval SIFS, as do not received in its double bounce, other actively re-rent node and compete this time slot request, re-rent node to application and send " re-rent and reply " grouping;
515) re-rent authority judgement: if host node is in gap periods SIFS, receive and actively in other double bounce re-rent node and compete this time slot request, apply for re-renting active competition node priority judgement in node and double bounce, re-rent node to the low application of priority and send " hanging up request " packet;
516) re-rent confirmation: application is re-rented node and received after " re-rent and reply " packet, wait for a gap periods DIFS, if do not receive " hanging up request " packet within this cycle, show to re-rent this time slot, send " re-renting confirmation " packet to host node, otherwise send " hang up and confirm " packet, stop competing this time slot, entering buffering area queue according to priority queues up, if the high node of priority is due to emergency situations such as off-grids, do not send " re-renting confirmation " grouping to host node, in the queue of buffering area, node can obtain according to the order of sequence and re-rent chance, if application is re-rented node and is re-rented end cycle at one and all do not receive " re-rent and reply ", repeat 511) to 516), until re-renting node, application successfully receives that host node " re-rents and reply ".
517) re-rent response: host node reports this node name of station and time slot to re-rent information, re-rent node send " re-renting response " to application, application is re-rented node and can be carried out data service transmission at this time slot of re-renting subsequently, realizes channel and re-rents multiplexing.
52) priority judgement competition node is re-rented authority: request re-rents in node and double bounce that other is active when re-renting node alternative time slot competition conflict occurring, and computing node priority P determines who can take this time slot, sets the priority of node for each time slot
P=λ
1[P
id]×λ
2[P
0]，
Wherein, P
idfor the attribute priority of node, P
0for current data service priority, wherein λ
1, λ
2be respectively nodal community priority and service priority weight, determine through testing dynamically within the resident cycle of system according to this agreement.
As shown in figure 10, providing 52) channel re-rents and takies priority decision-making foundation.According to each node traffic situation, each have the live-vertex that sends service request that the live-vertex that sends service request that has within the scope of 2 jumpings of this node is defined as competing node.According to the attribute priority P of node
idwith current words data service priority P
0set the priority of node for each time slot.Wherein P
0the data service priority continuity having been sent at last data time slot by competition node determines the data service priority of current application, and what send as last data frame is Data_Urgent emergency data business, current application P
0priority is 3, is voicedata service, current application P Data_Routine as what send
0priority is 1, if never there is business to send, gives tacit consent to current front application P
0priority is 1; Set P
idfor the machine implicit precedence level of competition nodal community decision.In the network of just setting before node networks, attribute role category is as host node, backbone node, ordinary node.
For each time slot, compare respectively the priority of competition node in live-vertex itself and its double bounce.If the live-vertex at a time priority of gap is high, this time slot is the alternative time slot that this live-vertex can take.Otherwise can be by other real competition node application.As identical in the priority calculating, set by device id number large node and take.
60) transfer of data: reserve time slot and re-rent alternative time slot result according to application, each node uses the reserved main time slot of oneself and re-rents the alternative time slot taking and sends data, in other time slot reception data.
The hybrid time slot address resource allocation method of a kind of dynamic controlled distribution based on future mechanism and the competition of the node asynchronous based on priority:
(1) networking synchronizing process is accepted dynamically controlled rule.Main and subordinate node networking synchronizing process is the basis of networking configuration effort.Host node utilizes channel synchronization data frame transfer network parameter, has realized the efficient collaborative of channel access and network insertion, has reduced the complexity of network configuration.
(2) the relevant time slot address reservation schemes of topology.According to the dynamic change of topological structure scale, the reserved time slot of self adaptation adjustment and address, dynamically provide channel occupancy chance.Time slot reservation convergence time short, control overhead is little, is applicable to the network of topological structure dynamic change.
(3) reserve fast application and reply based on pretreated.The dynamic assignment thought of having utilized network layer DHCP service, adopts the networking application of processing the node of MAC layer based on pretreated controlled configuration service mode.Obtain after network parameters and rule by synchrodata frame, can determine channel occupancy power by " discovery ", " preassignment ", " request ", " confirmation " four steps immediately from node, realize without conflict and sending, can improve initial network entry efficiency.
(4) Local-distributed space division multiplexing mechanism: on the basis of aggregators controlled distribution and full distributed future mechanism, adopt the distributed space division multiplexing of regional area, only within the scope of the double bounce of live-vertex that has data transmission demand, calculate available alternative time slot, improve as required local space division multiplexing ability.
(5) the network access node asynchronous dynamical based on priority is competed alternative time slot as required.Live-vertex can independently send the how alternative time slot of demand competition according to data separately, and decision-making foundation is that network access node attribute priority and data send the associated weight in priority and each comfortable network system.
On time division multiple access access basis, design efficient channel booking mechanism and time slot address Dynamic Assignment, proposition is with the dynamic controlled configuration mode of pretreated host node to carry out time slot address distribution, node can repeatedly be filed a request and be re-rented alternative time slot, and adopts priority decisions to solve the competition occupation problem of alternative time slot.Reduce collision probability and packet retransmissions present rate by pretreated host node configuration, effectively reduce networking time delay, shortened the network opening time, by adopting the channel booking of priority judgement, improve wireless channel utilance, strengthened networking usefulness.
Claims (6)
1. wireless network node, with meeting an access Dynamic Configuration, is characterized in that, comprises the steps:
10) main and subordinate node networks synchronous: host node hop-by-hop sends networking synchronizing information in self time slot on multiple frequencies, waits to network from the long search of node, receives host node networking synchronizing information, upgrades from node system information, keeps synchronizeing with host node;
20) preliminary treatment: host node enters after net state, in self time slot transmission synchronization frame, waits to network and from synchrodata frame, extracts obligate information from node, sends to host node the request of networking;
30) reserve application and reply: host node sends preassignment time slot and address to the networking for the treatment of that proposes reserved application from node, wait to network and send from node the reservation confirmation grouping of agreeing to take this address and time slot, its neighbors will no longer be competed this time slot after receiving this confirmation grouping, wait to network and wait for that from node host node is verified, send after reservation responses grouping, waiting to network formally becomes new networking from node from node;
40) dynamic competition time slot: host node is dynamically adjusted the reserved time slot section of distribution according to network size, treat that network access node selects to compete reserved time slot at random, networked can be according to its data business demand, to distribute and to compete the mode of mixing and re-rent each self-corresponding alternative time slot from node simultaneously;
50) channel based on priority decisions is re-rented multiplexing: according to nodal community priority and class of service priority, dynamic mapping is to node access priority, actively in the double bounce of competition conflict re-rent node and be assigned to according to priority sequential queue in data buffer zone occurring, participate in channel access allotment;
60) transfer of data: reserve time slot and re-rent alternative time slot result according to application, each node uses the reserved main time slot of oneself and re-rents the alternative time slot taking and sends data, in other time slot reception data.
2. wireless network node according to claim 1 is with meeting access Dynamic Configuration, it is characterized in that: described main and subordinate node networks in synchronous (10) step, the networking synchronizing information that host node sends comprises this main website mark, host node MAC Address, current frame length, main timeslot number, main time slot duration, time slot duration, reserved competition slot section.
3. wireless network node according to claim 1, with meeting access Dynamic Configuration, is characterized in that, described reserved application and reply (30) step and comprise:
31) reserved application: wait to network from the reserved time slot section T of Node extraction
r=[T
n+1..., T
i, T
n+f], wherein n is network access node number, f is reserved competition slot number, selects reserved time slot T therefrom at random
i, send reservation request and check code to host node;
32) preassignment: host node reports application network access node name of station, MAC Address, packet affairs ID and check code, wait for and networking after license, sends pre-distribution scheme packet to the application network access node that not yet distributes address, lists the time slot T of node request
iiP associated with time slot address, first host node attempts using 31) in application node hardware address communicate by letter with it, if communication failure, host node is broadcasted away this preassignment packet;
33) receive and reply: receive from node the preassignment packet of host node wait networking, be confirmed to be according to packet affairs ID after the request of oneself initiating, send and receive reply data bag, its neighbors is no longer competed this time slot and address, and prepares to receive data at this time slot;
34) distribute and confirm: host node receives 33) network after preallocated reception reply data bag, send to distribute and confirm packet, comprise asked address and time slot, and report upper layer software (applications).The networking for the treatment of of now initiating these reservation request affairs ID will have this time slot T from node
iiP associated with time slot address, node networks successfully, can send at this time slot.
4. wireless network node according to claim 1, with meeting access Dynamic Configuration, is characterized in that, the alternative time slot of described dynamic competition (40) step comprises:
41) distribute reserved time slot section: main controlled node is according to the reserved time slot section of network size dynamic assignment;
42) the reserved time slot of competition: wait to network and select at random to compete reserved time slot from node, access fast;
43) time slot is re-rented in competition: networked from node according to data traffic requirement, continued competition and re-rent time slot.
5. wireless network node according to claim 1, with meeting access Dynamic Configuration, is characterized in that, the described channel based on priority decisions is re-rented multiplexing (50) step and comprised:
51) Local-distributed space division multiplexing is selected: network and send demand from node according to data, within the scope of the double bounce of active channel competition node that has data transmission demand, calculate the alternative time slot of reusable;
52) priority judgement competition node is re-rented authority: request re-rents in node and double bounce that other is active when re-renting node alternative time slot competition conflict occurring, and computing node priority P determines who can take this time slot, sets the priority of node for each time slot
P=λ
1[P
id]×λ
2[P
0]
Wherein, P
idfor the attribute priority of node, P
0for current data service priority, λ
1, λ
2be respectively nodal community priority and the service priority weight in current resident system.
6. wireless network node according to claim 5, with meeting access Dynamic Configuration, is characterized in that, described Local-distributed space division multiplexing selects (51) step to comprise:
511) re-rent preparation: network access node, according to data traffic requirement competition slot as required, is first broadcasted the grouping that a business category is " re-renting bulletin ", starts one to re-rent the cycle, and node formally becomes re-rents node;
512) distributed monitoring: each jumping neighbors of re-renting node dispersion zone receives that business category is the grouping of " re-renting bulletin ", time slot at oneself is sent a jumping neighbors address, the Time Slot Occupancy information package heard, re-rent node again through one take turns frame monitor, can know two-hop neighbor node gap information collection T
u;
513) re-rent request: respectively re-rent node and distributed and taken set Τ according to host node system current time slots in the continuous synchrodata frame sending of main time slot
h, and double bounce neighbors takies time slot set T
u, calculate the alternative time slot set of reusable
from T
sin random select alternative time slot to send " request of re-renting " packet to host node, and the two-hop neighbor node information incidentally listening in the scaling option of request data package;
514) re-rent and reply: host node extracts the time slot address of " re-renting confirmation " packet of network access node transmission and re-rents solicited message, and double bounce node data in scaling option, wait for a time interval SIFS, as do not received in its double bounce, other actively re-rent node and compete this time slot request, re-rent node to application and send " re-rent and reply " grouping;
515) re-rent authority judgement: if host node is in gap periods SIFS, receive and actively in other double bounce re-rent node and compete this time slot request, apply for re-renting active competition node priority judgement in node and double bounce, re-rent node to the low application of priority and send " hanging up request " packet;
516) re-rent confirmation: application is re-rented node and received after " re-rent and reply " packet, wait for a gap periods DIFS, if do not receive " hanging up request " packet within this cycle, show to re-rent this time slot, send " re-renting confirmation " packet to host node, otherwise send " hang up and confirm " packet, stop competing this time slot, entering buffering area queue according to priority queues up, if the high node of priority is due to emergency situations such as off-grids, do not send " re-renting confirmation " grouping to host node, in the queue of buffering area, node can obtain according to the order of sequence and re-rent chance, if application is re-rented node and is re-rented end cycle at one and all do not receive " re-rent and reply ", repeat 511) to 516), until re-renting node, application successfully receives that host node " re-rents and reply ",
517) re-rent response: host node reports this node name of station and time slot to re-rent information, re-rent node send " re-renting response " to application, application is re-rented node and can be carried out data service transmission at this time slot of re-renting subsequently, realizes channel and re-rents multiplexing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410115081.XA CN103929824A (en) | 2014-03-26 | 2014-03-26 | Wireless network node neutral access dynamic configuration method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410115081.XA CN103929824A (en) | 2014-03-26 | 2014-03-26 | Wireless network node neutral access dynamic configuration method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103929824A true CN103929824A (en) | 2014-07-16 |
Family
ID=51147857
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410115081.XA Pending CN103929824A (en) | 2014-03-26 | 2014-03-26 | Wireless network node neutral access dynamic configuration method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103929824A (en) |
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301933A (en) * | 2014-10-17 | 2015-01-21 | 中国人民解放军理工大学 | Method for calculating bandwidth and distributing bandwidth in wireless ad hoc network |
| WO2016070390A1 (en) * | 2014-11-06 | 2016-05-12 | 华为技术有限公司 | Data transmission method and device |
| CN105636148A (en) * | 2016-01-06 | 2016-06-01 | 中国人民解放军总参谋部第六十三研究所 | Wireless multi-hop network data transmission method |
| CN105721257A (en) * | 2015-10-09 | 2016-06-29 | 武汉中元通信股份有限公司 | MAC layer access method and platform based on single-input multiple-output channel |
| CN106160788A (en) * | 2015-04-02 | 2016-11-23 | 北京化工大学 | A kind of networking implementation method of Fast synchronization frequency hopping radio set |
| CN106413123A (en) * | 2015-07-31 | 2017-02-15 | 腾讯科技（深圳）有限公司 | Data transmission method and device |
| CN106921987A (en) * | 2017-03-07 | 2017-07-04 | 北京三更科技有限公司 | A kind of wireless communications method and device |
| CN107483140A (en) * | 2016-06-07 | 2017-12-15 | 航天恒星科技有限公司 | Network-building method based on TDMA |
| CN108093469A (en) * | 2016-11-22 | 2018-05-29 | 上海交通大学 | The distributed cut-in method of elastic long range wireless transmitting system based on TDMA |
| CN108282502A (en) * | 2017-01-05 | 2018-07-13 | 上海竺程信息科技有限公司 | Vehicle network message optimisation broadcasting method based on dynamic priority |
| CN108449796A (en) * | 2018-02-11 | 2018-08-24 | 北京盛安同力科技开发有限公司 | Self-adapting time slot distribution method with high slot efficiency in satellite network |
| CN108551684A (en) * | 2018-03-20 | 2018-09-18 | 深圳友讯达科技股份有限公司 | Node method of network entry and device |
| CN108667487A (en) * | 2018-05-19 | 2018-10-16 | 杭州海兴电力科技股份有限公司 | G3 carrier network dynamic adjustment based on priority of registration list and network-building method |
| CN108882374A (en) * | 2018-05-25 | 2018-11-23 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Ka frequency range multiple access TT&C Resources dispatching method |
| CN109151951A (en) * | 2018-08-09 | 2019-01-04 | 中软电科智能技术有限公司 | A kind of data interactive method of multifrequency centralized network networking |
| CN109360335A (en) * | 2018-10-31 | 2019-02-19 | 湖南金码智能设备制造有限公司 | A kind of group cabinet method and self-help shopping system automatically |
| CN109495976A (en) * | 2018-12-05 | 2019-03-19 | 浙江大学 | A kind of boat-carrying UAV Communication Channel cut-in method |
| CN109525997A (en) * | 2018-11-05 | 2019-03-26 | 郑州煤机液压电控有限公司 | Underground coal mine fully-mechanized mining working wireless communication coverage method |
| CN109561513A (en) * | 2019-01-29 | 2019-04-02 | 四川九洲电器集团有限责任公司 | A kind of distribution Lothrus apterus ad hoc network multiple access protocol |
| CN111050290A (en) * | 2019-12-20 | 2020-04-21 | 上海有个机器人有限公司 | Multi-device communication method, medium, terminal and device based on time division multiple access |
| CN111093249A (en) * | 2019-12-05 | 2020-05-01 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
| CN111918305A (en) * | 2020-07-24 | 2020-11-10 | 湖南遥昇通信技术有限公司 | Same-frequency self-organizing self-healing network method and device |
| CN111937359A (en) * | 2019-05-14 | 2020-11-13 | 深圳市大疆创新科技有限公司 | Communication address setting method of detection equipment, unmanned aerial vehicle and storage medium |
| CN112653694A (en) * | 2020-12-21 | 2021-04-13 | 北京特立信电子技术股份有限公司 | Access method, system and computer readable storage medium |
| CN113543082A (en) * | 2020-04-22 | 2021-10-22 | 北京猎户星空科技有限公司 | Communication method, device, electronic equipment, system and medium |
| CN113923751A (en) * | 2021-11-12 | 2022-01-11 | 哈尔滨海能达科技有限公司 | Method, device and equipment for accessing network by node and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360028A (en) * | 2008-07-24 | 2009-02-04 | 华中科技大学 | Real-time scheduling method suitable for industrial sensor network |
| CN101848550A (en) * | 2010-05-07 | 2010-09-29 | 中国科学院计算技术研究所 | Conflict avoidance-based dispatching method for wireless MESH network |
| US20110176520A1 (en) * | 2008-08-11 | 2011-07-21 | Koninklijke Philips Electronics, N.V. | Techniques for efficient data transfers in a body area network |
| CN103248463A (en) * | 2012-02-06 | 2013-08-14 | 电信科学技术研究院 | Frame information transmitting method and equipment |
-
2014
- 2014-03-26 CN CN201410115081.XA patent/CN103929824A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360028A (en) * | 2008-07-24 | 2009-02-04 | 华中科技大学 | Real-time scheduling method suitable for industrial sensor network |
| US20110176520A1 (en) * | 2008-08-11 | 2011-07-21 | Koninklijke Philips Electronics, N.V. | Techniques for efficient data transfers in a body area network |
| CN101848550A (en) * | 2010-05-07 | 2010-09-29 | 中国科学院计算技术研究所 | Conflict avoidance-based dispatching method for wireless MESH network |
| CN103248463A (en) * | 2012-02-06 | 2013-08-14 | 电信科学技术研究院 | Frame information transmitting method and equipment |
Cited By (43)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301933A (en) * | 2014-10-17 | 2015-01-21 | 中国人民解放军理工大学 | Method for calculating bandwidth and distributing bandwidth in wireless ad hoc network |
| CN104301933B (en) * | 2014-10-17 | 2017-09-05 | 中国人民解放军理工大学 | A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking |
| US10117183B2 (en) | 2014-11-06 | 2018-10-30 | Huawei Technologies Co., Ltd. | Data transmission method and device |
| WO2016070390A1 (en) * | 2014-11-06 | 2016-05-12 | 华为技术有限公司 | Data transmission method and device |
| US10405276B2 (en) | 2014-11-06 | 2019-09-03 | Huawei Technologies Co., Ltd. | Data transmission method and device |
| JP2017537571A (en) * | 2014-11-06 | 2017-12-14 | 華為技術有限公司Ｈｕａｗｅｉ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｃｏ．，Ｌｔｄ． | Data transmission method and device |
| CN106160788A (en) * | 2015-04-02 | 2016-11-23 | 北京化工大学 | A kind of networking implementation method of Fast synchronization frequency hopping radio set |
| CN106413123B (en) * | 2015-07-31 | 2019-11-22 | 腾讯科技（深圳）有限公司 | Data transmission method and device |
| CN106413123A (en) * | 2015-07-31 | 2017-02-15 | 腾讯科技（深圳）有限公司 | Data transmission method and device |
| CN105721257B (en) * | 2015-10-09 | 2019-03-29 | 武汉中元通信股份有限公司 | MAC layer cut-in method and platform based on collection of letters road more than single-shot |
| CN105721257A (en) * | 2015-10-09 | 2016-06-29 | 武汉中元通信股份有限公司 | MAC layer access method and platform based on single-input multiple-output channel |
| CN105636148A (en) * | 2016-01-06 | 2016-06-01 | 中国人民解放军总参谋部第六十三研究所 | Wireless multi-hop network data transmission method |
| CN107483140A (en) * | 2016-06-07 | 2017-12-15 | 航天恒星科技有限公司 | Network-building method based on TDMA |
| CN108093469A (en) * | 2016-11-22 | 2018-05-29 | 上海交通大学 | The distributed cut-in method of elastic long range wireless transmitting system based on TDMA |
| CN108093469B (en) * | 2016-11-22 | 2020-11-06 | 上海交通大学 | Distributed access method of wireless transmission system based on TDMA |
| CN108282502A (en) * | 2017-01-05 | 2018-07-13 | 上海竺程信息科技有限公司 | Vehicle network message optimisation broadcasting method based on dynamic priority |
| CN108282502B (en) * | 2017-01-05 | 2020-07-10 | 上海竺程信息科技有限公司 | Vehicle network message optimization broadcasting method based on dynamic priority |
| CN106921987B (en) * | 2017-03-07 | 2020-12-15 | 北京三更科技有限公司 | Wireless communication method and device |
| CN106921987A (en) * | 2017-03-07 | 2017-07-04 | 北京三更科技有限公司 | A kind of wireless communications method and device |
| CN108449796A (en) * | 2018-02-11 | 2018-08-24 | 北京盛安同力科技开发有限公司 | Self-adapting time slot distribution method with high slot efficiency in satellite network |
| CN108551684A (en) * | 2018-03-20 | 2018-09-18 | 深圳友讯达科技股份有限公司 | Node method of network entry and device |
| CN108551684B (en) * | 2018-03-20 | 2021-01-01 | 深圳友讯达科技股份有限公司 | Node network access method and device |
| CN108667487B (en) * | 2018-05-19 | 2021-11-30 | 杭州海兴电力科技股份有限公司 | G3 carrier network dynamic regulation and networking method based on priority registration list |
| CN108667487A (en) * | 2018-05-19 | 2018-10-16 | 杭州海兴电力科技股份有限公司 | G3 carrier network dynamic adjustment based on priority of registration list and network-building method |
| CN108882374A (en) * | 2018-05-25 | 2018-11-23 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Ka frequency range multiple access TT&C Resources dispatching method |
| CN109151951B (en) * | 2018-08-09 | 2021-01-19 | 中软电科智能技术有限公司 | Data interaction method for multi-frequency centralized network networking |
| CN109151951A (en) * | 2018-08-09 | 2019-01-04 | 中软电科智能技术有限公司 | A kind of data interactive method of multifrequency centralized network networking |
| CN109360335A (en) * | 2018-10-31 | 2019-02-19 | 湖南金码智能设备制造有限公司 | A kind of group cabinet method and self-help shopping system automatically |
| CN109525997A (en) * | 2018-11-05 | 2019-03-26 | 郑州煤机液压电控有限公司 | Underground coal mine fully-mechanized mining working wireless communication coverage method |
| CN109495976A (en) * | 2018-12-05 | 2019-03-19 | 浙江大学 | A kind of boat-carrying UAV Communication Channel cut-in method |
| CN109561513A (en) * | 2019-01-29 | 2019-04-02 | 四川九洲电器集团有限责任公司 | A kind of distribution Lothrus apterus ad hoc network multiple access protocol |
| CN109561513B (en) * | 2019-01-29 | 2022-03-08 | 四川九洲电器集团有限责任公司 | Distributed conflict-free ad hoc network multiple access protocol |
| CN111937359A (en) * | 2019-05-14 | 2020-11-13 | 深圳市大疆创新科技有限公司 | Communication address setting method of detection equipment, unmanned aerial vehicle and storage medium |
| CN111093249A (en) * | 2019-12-05 | 2020-05-01 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
| CN111093249B (en) * | 2019-12-05 | 2022-06-21 | 合肥中感微电子有限公司 | Wireless local area network communication method, system and wireless transceiving equipment |
| CN111050290A (en) * | 2019-12-20 | 2020-04-21 | 上海有个机器人有限公司 | Multi-device communication method, medium, terminal and device based on time division multiple access |
| CN113543082A (en) * | 2020-04-22 | 2021-10-22 | 北京猎户星空科技有限公司 | Communication method, device, electronic equipment, system and medium |
| CN113543082B (en) * | 2020-04-22 | 2023-12-08 | 北京猎户星空科技有限公司 | Communication method, device, electronic equipment, system and medium |
| CN111918305A (en) * | 2020-07-24 | 2020-11-10 | 湖南遥昇通信技术有限公司 | Same-frequency self-organizing self-healing network method and device |
| CN111918305B (en) * | 2020-07-24 | 2023-10-03 | 湖南遥昇通信技术有限公司 | Same-frequency self-organizing self-healing network method and device |
| CN112653694A (en) * | 2020-12-21 | 2021-04-13 | 北京特立信电子技术股份有限公司 | Access method, system and computer readable storage medium |
| CN112653694B (en) * | 2020-12-21 | 2023-06-02 | 北京特立信电子技术股份有限公司 | Access method, system and computer readable storage medium |
| CN113923751A (en) * | 2021-11-12 | 2022-01-11 | 哈尔滨海能达科技有限公司 | Method, device and equipment for accessing network by node and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103929824A (en) | Wireless network node neutral access dynamic configuration method | |
| US7447180B2 (en) | Wireless media access method | |
| Xiao et al. | Local data control and admission control for QoS support in wireless ad hoc networks | |
| Garces et al. | Collision avoidance and resolution multiple access for multichannel wireless networks | |
| CN108430111B (en) | Mixed type time slot reservation method in distributed TDMA protocol | |
| CN108093469B (en) | Distributed access method of wireless transmission system based on TDMA | |
| CN109561513B (en) | Distributed conflict-free ad hoc network multiple access protocol | |
| Shao et al. | A multi-priority supported medium access control in vehicular ad hoc networks | |
| KR101866421B1 (en) | System and Method for Managing DSME Network Fluctuation at Industrial Wireless Sensor Network | |
| CN104994583A (en) | Multi-channel MAC protocol method based on cluster mechanism in vehicular Ad hoc network | |
| JP2011517142A (en) | Method for communicating in a network comprising a set of coordinator nodes and leaf nodes | |
| CN101651969A (en) | Implement method of power control cognition MAC protocol based on time division multiple access (TDMA) | |
| CN102130705B (en) | WLAN (Wireless Local Area Network) MESH communication method and device based on fast frequency hopping | |
| CN111836399B (en) | Channel access protocol design method and time slot allocation method for broadband carrier communication network | |
| WO2007008174A1 (en) | Method and system of wireless communication between devices | |
| Jayaraj et al. | A survey on hybrid MAC protocols for vehicular ad-hoc networks | |
| CN112492669A (en) | Wireless communication method and system for node equipment of power transmission and transformation equipment internet of things | |
| CN106572489B (en) | One kind being based on the associated access of more BSS and transmission method | |
| Yang et al. | A multi-channel cooperative clustering-based MAC protocol for VANETs | |
| CN108200652B (en) | Communication method and device applied to unmanned aerial vehicle cluster | |
| Zhang et al. | A black-burst based time slot acquisition scheme for the hybrid TDMA/CSMA multichannel MAC in VANETs | |
| CN106793114B (en) | Dynamic time slot allocation method, applicable medium access control system and node | |
| Chakraborty et al. | IEEE 802.11 s mesh backbone for vehicular communication: Fairness and throughput | |
| Yuan et al. | Design and analysis of random access for standalone LTE-U systems | |
| CN101395857A (en) | Method for multi-hop data transmission in an ad-hoc network comprising concealed nodes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: Baixia District of Nanjing city in Jiangsu province 210007 houbiaoying No. 18 Applicant after: The 36th Institute of Central Military Commission Equipment Development Department Address before: Baixia District of Nanjing city in Jiangsu province 210007 houbiaoying No. 18 Applicant before: No. 63 Inst. of the Headquarters of the Genearal Staff of C.P. L. A. |
|
| COR | Change of bibliographic data | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140716 |