CN103929815A - Channel allocation method based on minimum spanning tree - Google Patents
Channel allocation method based on minimum spanning tree Download PDFInfo
- Publication number
- CN103929815A CN103929815A CN201410133541.1A CN201410133541A CN103929815A CN 103929815 A CN103929815 A CN 103929815A CN 201410133541 A CN201410133541 A CN 201410133541A CN 103929815 A CN103929815 A CN 103929815A
- Authority
- CN
- China
- Prior art keywords
- node
- channel
- spanning tree
- minimum spanning
- information
- 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 channel allocation method based on a minimum spanning tree. The method comprises the step of acquiring node information including node identification information and node position information, the step of establishing the minimum spanning tree according to the acquired node identification information and the acquired node position information, and the step of allocating channels for links in a minimum spinning tree set according to a preset channel set. According to the channel allocation method, nodes and sets are designed, the utilization ratio of the channels is improved on the premise that the connectedness of the network is guaranteed, the network resources are utilized more fully, and therefore the wireless network resources are saved.
Description
Technical field
The present invention relates to wireless communication field, relate in particular to a kind of method for channel allocation based on minimum spanning tree.
Background technology
Along with the fast development of the service based on frequency spectrum and equipment, on the one hand, there is not much left to can be used for the frequency spectrum of following wireless service, causes current cellular service operator to have to spend the 3G frequency spectrum that multi-million dollar is applied for 20-30MHz; On the other hand, the current fixed frequency spectrum method of salary distribution causes obvious frequency spectrum clear area (White Space), also at some time periods obsolete frequency spectrum at all, the spectrum regions of much having distributed are only just used in specific geographic area and (or) time period seldom.For example, by the measurement of carrying out in New York, find at least to exist 87% clear area.Therefore, can cause a large amount of valuable frequency spectrums (lower than 5GHz) idle, and they are just applicable to radio communication, are thering is the value of multi-million dollar.
Yet for the problem of frequency spectrum resource shortage, some researchers have successively proposed some solutions.For example, the Carrier Sense Multiple Access proposing on the basis at IEEE802.11 about an amendment of multi-hop wireless network (Carrier-Sense Multiple Access, CSMA) agreement, a kind of method that it uses multichannel and dynamic channel to select.Its main thought is, available bandwidth is divided into N channel, and transmitting station, according to the interference power on all available channels, selects suitable channel to transmit packet.
Along with development and the improvement of technology, there is afterwards a kind of above-mentioned method that need to revise IEEE802.11 that is different from, be called the link layer protocol of (Slotted Seeded Channel Hopping, SSCH).SSCH, by realizing frequency partition, has increased the ability of IEEE802.11 network.Between the wireless network node of use SSCH, reduce interference, therefore improved the ability of wireless network.Also occurred that two are mixed integer linear programming model, by fixed channel assignment strategy, the quantity of two-way link has been maximized, with this, solved multifrequency fixed channel assignment problem.
And in recent years, some scholars have proposed by allow radio node improve the throughput of network by polylith card operation on different channels simultaneously.For example, by requiring each node and its neighbor node to have the network interface card of as much, also needing has abundant available channel.Or based on there being hypothesis a kind of priori, to the identical channel allocation of network interface card of each node.That is, for all-network node, channel allocation is the same: channel 1 binding is to No. 1 network interface card, and channel 2 bindings are to No. 2 network interface cards, by that analogy.
In sum, yet, for above-mentioned the whole bag of tricks, although in the distribution that has realized in varying degrees channel resource,, those single channel resource allocation modes cannot realize better the saving for Internet resources on the basis that guarantees network link.
Summary of the invention
The object of the embodiment of the present invention is to provide a kind of method for channel allocation based on minimum spanning tree, by each node UNICOM One Design Inc., realized under the prerequisite that guarantees network link Internet resources are utilized more fully, thereby saved wireless network resource.
In order to achieve the above object, the embodiment of the present invention provides a kind of method for channel allocation based on minimum spanning tree, it is characterized in that, said method comprising the steps of:
Obtain nodal information, in described nodal information, include identification information and the positional information of node;
According to the identification information of the node obtaining and positional information, set up minimum spanning tree, and form minimum spanning tree set by the minimum spanning tree of setting up;
According to preset channel set, it is the link assignment channel in described minimum spanning tree set.
Preferably, the identification information of the node that described basis is obtained and positional information comprise before setting up minimum spanning tree:
According to the identification information of the node obtaining, determine rule node, and construct rule node set;
The neighbor node of determining rule node is by rule node;
By being added to by rule node in described rule node set, any two nodes in the rule node set after adding are communicated with.
Preferably, identification information and the positional information of the node that described basis is obtained are set up minimum spanning tree, comprising:
Rule node in rule node set after determine adding and corresponding by rule node, be node cluster;
According to the positional information of node in described node cluster, set up minimum spanning tree, between each node in described minimum spanning tree, by link, transmit.
Preferably, described in also include available channel information and network interface card information in the nodal information that obtains, each the internodal link in described minimum spanning tree is specifically determined in the following way:
According to described network interface card information, determine between each node in described minimum spanning tree, whether to there is shared communication distance scope, when determining while having, according to described available channel information, determine each internodal link.
Preferably, described is the link assignment channel in described minimum spanning tree set according to preset channel set, specifically comprises:
Channel in preset channel set is distributed to the link in described minimum spanning tree set according to channel utilization, until all links in described minimum spanning tree set are all assigned with at least one channel.
Preferably, after the described link assignment channel that set is served as reasons in described minimum spanning tree set according to preset channel, also comprise:
By the described channel allocation of distributing to the link in described minimum spanning tree set, give two end nodes corresponding to described link.
Prior art is compared, and the technical scheme that the embodiment of the present invention proposes has the following advantages:
The above embodiment of the present invention, by each node UNICOM One Design Inc., has realized guaranteeing, under the prerequisite of network link, to have increased the utilance of channel, Internet resources is utilized more fully, thereby saved wireless network resource.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the channel allocation based on minimum spanning tree that provides of the embodiment of the present invention;
Fig. 2 is UNICOM's schematic diagram of 4 meshed networks providing of the embodiment of the present invention;
Fig. 3 is the schematic flow sheet of the channel allocation based on minimum spanning tree that provides of the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the present invention, the technical scheme in the present invention is clearly and completely described, obviously, described embodiment is only a part of embodiment of the present invention, rather than whole embodiment.Embodiment based in the present invention, those of ordinary skills, not making all other embodiment that obtain under creative work prerequisite, belong to the scope of protection of the invention.
Referring to Fig. 1, the schematic flow sheet of the channel allocation based on minimum spanning tree providing for the embodiment of the present invention, this flow process can comprise:
Step 101, obtains nodal information, includes identification information and the positional information of node in described nodal information.
After this step, also comprise:
According to the identification information of the node obtaining, determine rule node, and construct rule node set;
The neighbor node of determining rule node is by rule node;
By being added to by rule node in described rule node set, any two nodes in the rule node set after adding are communicated with.
Step 102, sets up minimum spanning tree according to the identification information of the node obtaining and positional information, and forms minimum spanning tree set by the minimum spanning tree of setting up.
Concrete, identification information and the positional information of the node that described basis is obtained are set up minimum spanning tree, specifically comprise:
Rule node in rule node set after determine adding and corresponding by rule node, be node cluster;
According to the positional information of node in described node cluster, set up minimum spanning tree, between each node in described minimum spanning tree, by link, transmit.
Wherein, described in also include available channel information and network interface card information in the nodal information that obtains, each the internodal link in described minimum spanning tree is specifically determined in the following way:
According to described network interface card information, determine between each node in described minimum spanning tree, whether to there is shared communication distance scope, when determining while having, according to described available channel information, determine each internodal link.
Step 103 is the link assignment channel in described minimum spanning tree set according to preset channel set.
Particularly, described is the link assignment channel in described minimum spanning tree set according to preset channel set, specifically comprises:
Channel in preset channel set is distributed to the link in described minimum spanning tree set according to channel utilization, until all links in described minimum spanning tree set are all assigned with at least one channel.
After the complete channel to link assignment, also can be by the described channel allocation of distributing to the link in described minimum spanning tree set to two end nodes corresponding to described link.
In the present embodiment, by each node UNICOM One Design Inc., realized guaranteeing, under the prerequisite of network link, to have increased the utilance of channel, Internet resources have been utilized more fully, thereby saved wireless network resource.
For the clearer channel allocation based on minimum spanning tree that the embodiment of the present invention is provided is described, with a specific embodiment, be described in detail below.
As shown in Figure 2, in this specific embodiment, to have 4 nodes in current wireless network, describe, these 4 nodes are respectively node A, Node B, node C and node D, concrete, referring to Fig. 3, are this embodiment.
Step 301, the base station in wireless network obtains each nodal information in this network.
In this step, the nodal information of 4 nodes that get comprises that node ID is (if the sequence number of node A is 1, the sequence number of node 2 is 2, the sequence number of node C is 3, the sequence number of node D is 4), wireless network card information, the node available channel information relevant to the region of node deployment, this available channel information specifically comprises that available channel number and concrete channel information are (if node A available channel number is 2, be specially channel 1, channel, Node B available channel number is 2, node C available channel number is 2, node D available channel number is 2) and node physical location information.
Step 302, the transmission link between each node is determined according to the nodal information getting in base station.
In this step, base station is when determining between node transmission link, by the following method available:
According to the available channel information of node and can determine link by network interface card information.
Concrete, known according to the available channel information of node, the available channel of each node.Concrete, if the available channel information of node A is channel 1, channel 2, the available channel information of Node B is channel 2, channel 3, therefore, can determine accordingly, the available link between node A and Node B is channel 2;
After having determined available channel, according to the wireless network card information of each node, determine link.
Concrete, after having determined available channel, according to the transmission range of wireless network card, determine available link.While supposing within node A and the Node B communication distance scope in network interface card each other, in conjunction with the available channel of node A and Node B, known, node A and Node B can be with their total channel 2 as transmission links used.
Step 303, UNICOM's rule node set is set up according to the node ID size of node and positional information in base station.
In this step, when setting up UNICOM's rule node set, first define rule node.
Concrete, when definition rule node, be to choose the node of node ID minimum as rule node.
Concrete, in 4 nodes that get, choose the node of node ID minimum, now the node of selected node ID minimum is node A, defined node A is rule node, and the neighbor node of this node A is defined as by rule node, be that defined node B, node C are that also this Node B and node C are subordinated to node A by rule node.
For the mode of definition rule node, node that can also be by choosing node ID maximum is as modes such as rule nodes, yet, to those skilled in the art, so long as the mode of definition rule node, all within protection scope of the present invention.
Secondly, in the node not determining one's identity, continue definition rule node, concrete definite mode is with the above-mentioned mode of determining first rule node.
Owing to only having chosen in the present embodiment 4 nodes, describe, so now, the node not determining one's identity is remaining node D only, therefore determine that this node D is rule node.
When all nodes have all been determined after identity, build rule node set and by rule node set.
Concrete, in constructed rule node set, include node A and node D, in rule node set, included Node B and node C.
Built rule node and by after rule node set, guaranteed that all nodes in rule node set, in UNICOM's state, are also to have available link between any two nodes.
Concrete, for the node by rule node set, if can connect the rule node of maximum numbers, it is added in rule node set, this node is called junction nodes, repeats this process, until all nodes UNICOM in rule node set.
Step 304, determines node cluster.
In this step, choose definite rule node and subordinate thereof by rule node or junction nodes, by its configuration node bunch.Wherein, bunch head that rule node is node cluster, bunch interior nodes that other nodes are node cluster.
Concrete, node A, Node B and node C configuration node bunch, node A is a bunch head.
Step 305, sets up minimum spanning tree (Minimum Spanning Tree) according to node cluster.
In this step, according to the positional information of the node comprising in node cluster, set up minimum spanning tree, the point of this minimum spanning tree be bunch in all nodes, and the limit of this minimum spanning tree is that transmission definite in abovementioned steps 302 connects road.
Further, regard the minimum spanning tree of all foundation as a whole figure, because the rule node set of setting up is UNICOM, so this integral body Shi Yige UNICOM figure in step 303.
Step 306 is the limit allocation of channel resources in the integral body of minimum spanning tree formation.
Before according to preset channel set allocation of channel resources, for preset channel set wherein, it is the set of the operable all channels of all nodes in this network.
Concrete, suppose that the spendable channel of node A is channel 1, channel 2, channel 3, the spendable channel of Node B is channel 1, channel 2, channel 4, channel 5, the spendable channel of node C is channel 1, channel 3, the spendable channel of node D is channel 2, channel 3, channel 5, and this channel set is comprised of channel 1, channel 2, channel 3, channel 4 and channel 5 these five channels so.
When channel resource allocation, can distribute according to channel utilization.
Concrete, suppose that the most a plurality of limits in integral body that certain channel in channel set can form by minimum spanning tree are used simultaneously, by this channel allocation to the plurality of limit.
After by this channel allocation, can repeat above-mentioned steps, proceed to distribute, until each limit in the integral body that minimum spanning tree forms has been assigned with a channel.
Step 307, gives corresponding node by the channel allocation of distributing to limit.
Concrete, after a channel has been distributed on each limit in the integral body forming for minimum spanning tree, the channel of distributing to each limit can be distributed to simultaneously to two end nodes corresponding to this limit (being also link).
In the present embodiment, by each node UNICOM One Design Inc., realized guaranteeing, under the prerequisite of network link, to have increased the utilance of channel, Internet resources have been utilized more fully, thereby saved wireless network resource.
Through the above description of the embodiments, those skilled in the art can be well understood to the mode that the present invention can add essential general hardware platform by software and realize, and can certainly pass through hardware, but in a lot of situation, the former is better execution mode.Understanding based on such, the part that technical scheme of the present invention contributes to prior art in essence in other words can embody with the form of software product, this computer software product is stored in a storage medium, comprise that some instructions are with so that a computer equipment (can be personal computer, server, or the network equipment etc.) carry out the method described in each embodiment of the present invention.
It will be appreciated by those skilled in the art that accompanying drawing is the schematic diagram of a preferred embodiment, the module in accompanying drawing or flow process might not be that enforcement the present invention is necessary.
It will be appreciated by those skilled in the art that the module in the device in embodiment can be distributed in the device of embodiment according to embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from the present embodiment.The module of above-described embodiment can be merged into a module, also can further split into a plurality of submodules.
The invention described above embodiment sequence number, just to describing, does not represent the quality of embodiment.
Disclosed is above only several specific embodiment of the present invention, and still, the present invention is not limited thereto, and the changes that any person skilled in the art can think of all should fall into protection scope of the present invention.
Claims (6)
1. the method for channel allocation based on minimum spanning tree, is characterized in that, said method comprising the steps of:
Obtain nodal information, in described nodal information, include identification information and the positional information of node;
According to the identification information of the node obtaining and positional information, set up minimum spanning tree, and form minimum spanning tree set by the minimum spanning tree of setting up;
According to preset channel set, it is the link assignment channel in described minimum spanning tree set.
2. the method for claim 1, is characterized in that, the identification information of the node that described basis is obtained and positional information comprise before setting up minimum spanning tree:
According to the identification information of the node obtaining, determine rule node, and construct rule node set;
The neighbor node of determining rule node is by rule node;
By being added to by rule node in described rule node set, any two nodes in the rule node set after adding are communicated with.
3. method as claimed in claim 2, is characterized in that, identification information and the positional information of the node that described basis is obtained are set up minimum spanning tree, specifically comprise:
Rule node in rule node set after determine adding and corresponding by rule node, be node cluster;
According to the positional information of node in described node cluster, set up minimum spanning tree, between each node in described minimum spanning tree, by link, transmit.
4. method as claimed in claim 3, is characterized in that, described in also include available channel information and network interface card information in the nodal information that obtains, each the internodal link in described minimum spanning tree is specifically determined in the following way:
According to described network interface card information, determine between each node in described minimum spanning tree, whether to there is shared communication distance scope, when determining while having, according to described available channel information, determine each internodal link.
5. the method for claim 1, is characterized in that, described is the link assignment channel in described minimum spanning tree set according to preset channel set, specifically comprises:
Channel in preset channel set is distributed to the link in described minimum spanning tree set according to channel utilization, until all links in described minimum spanning tree set are all assigned with at least one channel.
6. the method as described in claim 1 or 5, is characterized in that, described is after the link assignment channel in described minimum spanning tree set according to preset channel set, also comprises:
By the described channel allocation of distributing to the link in described minimum spanning tree set, give two end nodes corresponding to described link.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410133541.1A CN103929815A (en) | 2014-04-03 | 2014-04-03 | Channel allocation method based on minimum spanning tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410133541.1A CN103929815A (en) | 2014-04-03 | 2014-04-03 | Channel allocation method based on minimum spanning tree |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103929815A true CN103929815A (en) | 2014-07-16 |
Family
ID=51147849
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410133541.1A Pending CN103929815A (en) | 2014-04-03 | 2014-04-03 | Channel allocation method based on minimum spanning tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103929815A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2252125A1 (en) * | 2009-05-14 | 2010-11-17 | Selex Communications S.p.A. | Method for forming a multichannel broadband wireless network with a hierarchical tree structure |
| CN103546895A (en) * | 2013-10-24 | 2014-01-29 | 哈尔滨工业大学 | Channel allocation method based on mobility predication in cognitive radio network |
-
2014
- 2014-04-03 CN CN201410133541.1A patent/CN103929815A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2252125A1 (en) * | 2009-05-14 | 2010-11-17 | Selex Communications S.p.A. | Method for forming a multichannel broadband wireless network with a hierarchical tree structure |
| CN103546895A (en) * | 2013-10-24 | 2014-01-29 | 哈尔滨工业大学 | Channel allocation method based on mobility predication in cognitive radio network |
Non-Patent Citations (1)
| Title |
|---|
| 李鑫: "多射频多信道无线Mesh网络的拓扑控制和信道分配联合算法研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104105217B (en) | For multiple equipment to equipment allocation of communications resource allocation method and device | |
| CN102547871B (en) | Resource negotiation method and apparatus in a kind of D2D communication | |
| CN103067985B (en) | The binding of ultrahigh speed wireless lan channel and distribution method based on channel quality | |
| US20150055633A1 (en) | Access point and communication system for resource allocation | |
| Mach et al. | Resource allocation for D2D communication with multiple D2D pairs reusing multiple channels | |
| Das et al. | WLC30-4: static channel assignment in multi-radio multi-channel 802.11 wireless mesh networks: issues, metrics and algorithms | |
| CN101568124A (en) | Channel allocation method in wireless mesh network | |
| JP2005504492A5 (en) | ||
| CN104254130B (en) | D2D user's link and distribution method, the apparatus and system of phone user's shared resource | |
| EP3404976B1 (en) | Procedure for managing radioelectric resources in 5g cellular networks aiming at the reuse of resources for vehicle-to-vehicle, v2v, communications | |
| CN107770869A (en) | The collocation method and device of information of radio resource allocation | |
| Zhao et al. | A coloring-based cluster resource allocation for ultra dense network | |
| CN104902431A (en) | Cross-cell D2D communication spectrum distributing method in LTE network | |
| CN106068667A (en) | A kind of LTE group system identical networking resource regulating method and device | |
| CN111194088B (en) | Dynamic time slot allocation method for mobile network based on subnet division | |
| KR101234900B1 (en) | Non-agile channelelization method for multi-channel medium access control | |
| CN104170309B (en) | A kind of method for managing resource and device | |
| CN103379630B (en) | A kind of Physical Downlink Shared Channel resource allocation methods and system | |
| Ren et al. | A two-step resource allocation algorithm for D2D communication in full duplex cellular network | |
| CN111885612B (en) | Working frequency band selection method for wireless ad hoc network during subnet splitting | |
| CN103929815A (en) | Channel allocation method based on minimum spanning tree | |
| CN107911854A (en) | A kind of mixing resource allocation methods based on D2D pattern technologies | |
| Najla et al. | Sequential bargaining game for reuse of radio resources in D2D communication in dedicated mode | |
| CN102781045B (en) | Space division multiplexing method and device | |
| Passiatore et al. | A centralized inter-network resource sharing (CIRS) scheme in IEEE 802.22 cognitive networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140716 |
|
| RJ01 | Rejection of invention patent application after publication |