CN104506274A - Network coding method for wireless Ad-hoc network - Google Patents
Network coding method for wireless Ad-hoc network Download PDFInfo
- Publication number
- CN104506274A CN104506274A CN201410682277.7A CN201410682277A CN104506274A CN 104506274 A CN104506274 A CN 104506274A CN 201410682277 A CN201410682277 A CN 201410682277A CN 104506274 A CN104506274 A CN 104506274A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- hop
- fixed channel
- coding
- 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
Abstract
The invention relates to a network coding method for a wireless Ad-hoc network. The network coding method comprises the steps that all nodes in the network select working channels of fixed interfaces or switchable interfaces randomly; in transmission of data package, the nodes of each path judge whether being nodes having a coding chance according to a coding rule, if yes, the nodes code a plurality of sent data packages, and then send the coded packages to next-hop node of one of the coded data packages, and next-hop nodes of other coded data packages monitor and acquire the coded package through the chance, if not, the nodes send the data packages separately to next-hop node, and all one-hop adjacent nodes of the node monitor and acquire the data package through the chance, if a buffer queue already has the data package, the data package is abandoned, if not, the data package is stored in the buffer queue. The network coding method can increase the network coding chance, improve the network throughput and lower average delay, and is important to improvement of network transmission efficiency.
Description
Technical field
The invention belongs to wireless communication technology field, relate to the coding method of a kind of Ad-hoc network of network.
Background technology
Along with smart mobile phone, popularizing of the electronic products such as panel computer, wireless mobile telecommunication technology highlights its wide market prospects and development potentiality, and how optimizing wireless network structure improve the emphasis of band efficiency especially in this type of technology, network coding technique is exactly the new thought of one proposed for the problem of this respect.
In the network carrying out network code, each forward node not only will forward packet, also first will encode to it when satisfying condition.Research shows, network coding technique can improve network throughput, reduces the number of transmissions, reduces mean transit delay, strengthens the robustness of network.But the research of network code still mainly rests on theory stage at present, practical application is not still popularized, and under during initial proposition, network code can only be applied in the multicast transmission mode of cable network, until 2005, the network code can applied in the wireless network is just suggested and obtains first Application.And a key issue in network code be exactly how to manufacture more code machine can to promote network throughput better.
The standard of Ad-hoc Web vector graphic both provides multiple channel, but for ensureing the reliability communicated between neighbors in legacy network, many employing single channel list interfaces, waste frequency spectrum resource greatly.As can be seen here, the communication protocol being applicable to multichannel environment is designed extremely important.Accordingly, if at each node installation and the man-to-man interface of channel, when channel is very many, installation cost and integrated chip difficulty all can increase substantially, therefore, under number of ports is less than number of channel situation, redesign network code rule, improve host-host protocol, interface according to circumstances freely can be switched at interchannel and also seem very necessary.
Summary of the invention
The present invention is directed to the above-mentioned deficiency of current techniques, proposing one can improve network coding opportunity, and can be applied in the Ad-hoc network of network coding method under multi-signal-channel and multi-interface environment.For achieving the above object, present invention employs following method:
A network coding method for Wireless Ad-hoc Network, under being applied to the environment of multi-signal-channel and multi-interface, comprises step below:
1) initial phase, the working channel of each node Stochastic choice fixed interface and changeable interface in network;
2) source node sends RREQ bag to destination node, neighbours' fixed channel table of the working channel information of the fixed interface comprising oneself and one hop neighbor node is carried in bag, in process of transmitting, RREQ bag is often through a node, this node is just replaced bag Central Plains neighbours' fixed channel table with neighbours' fixed channel table of oneself and a hop neighbor node, and then mails to next-hop node;
3) each node on path is according to information updating self the neighbours fixed channel table carried in RREQ bag and fixed channel utilization rate table, meanwhile, a hop neighbor node of each node wraps by monitoring acquisition RREQ and upgrades self neighbours' fixed channel table and fixed channel utilization rate table;
4) destination node receives RREQ and wraps backward source node response RREP bag, neighbours' fixed channel table of the working channel information of the fixed interface comprising oneself and one hop neighbor node is carried in bag, in process of transmitting, RREP bag is often through a node, this node is just replaced bag Central Plains neighbours' fixed channel table with neighbours' fixed channel table of oneself and a hop neighbor node, and then mails to next-hop node;
5) each node on path is according to information updating self the neighbours fixed channel table carried in RREP bag and fixed channel utilization rate table, meanwhile, a hop neighbor node of each node wraps by monitoring acquisition RREP and upgrades self neighbours' fixed channel use table and fixed channel utilization rate table;
6) when the fixed channel that certain node on path uses is for fixed channel that utilization rate is the highest, this node is switched on the minimum fixed channel of utilization rate with certain probability interface that is fixed;
7) node switching fixed channel sends HELLO bag to a hop neighbor node, carries oneself fixed channel information after switching in bag;
8) source node selects the changeable interface be operated on the fixed channel of next-hop node to send packet according to neighbours' fixed channel table, if there is no changeable interfaces on this channel, then make a certain changeable interface be switched on this channel, then send packet;
9) in the process sending packet, node on each path, judge whether self is the node that there is code machine meeting according to coding rule, if judge it self is the node that there is code machine meeting, then the some packets sended over are encoded, after coding, encoded packets is sent to the next-hop node of one of them packet participating in coding, other next-hop nodes participating in the packet of coding are monitored by chance and are obtained encoded packets; If judge it self is the node that there is not code machine meeting, then packet is sent to separately next-hop node place, simultaneously, all hop neighbor nodes of this node are monitored by chance and are obtained this packet, if there is this packet in buffer queue, abandoned, otherwise be stored into buffer queue; Described coding rule is: the bag 1. participating in encoding is packet; 2. the next-hop node participating in the packet of encoding is different; 3. the mode that all next-hop nodes of packet participating in coding can both be monitored by chance obtain divided by this node be next-hop node packet beyond all packets participating in coding, namely the next-hop node of a certain packet and all the other to participate in the upper hop node of the packet of encoding all adjacent; 4. coding nodes can only, as transit node, can not be the source node of the packet of any participation coding; 5. 1. the packet adding code set for first only need consider rule.
Compared with conventional art, this method has following several obvious advantages:
(1) network code rule is the key factor affecting network throughput and average delay.This method is regular by the network code that design is brand-new, substantially increases the code machine meeting of packet, namely improves the throughput of network, reduce average delay, has important function for raising network transmission efficiency.
(2) frequency spectrum resource utilization rate is also weigh the very important standard of of network system quality.The coding method adopting this method to provide, can utilize multiple channel, improve frequency spectrum resource utilization rate in network code process.
(3) in data transmission procedure, if certain channel loading is overweight, occur congestion phenomenon possibly, the channel switching part in this method well balances the load between different channels, avoids this situation.
Accompanying drawing explanation
Fig. 1 is network code flow chart.
Embodiment
Be described below in conjunction with the whole application scenarios of accompanying drawing to coding method of the present invention.
Improve network coding opportunity, the most important will improve coding rule exactly, and the application that realize under multi-signal-channel and multi-interface environment then needs to design respective protocol, and system is divided into transmitting terminal and receiving terminal two parts to design, see Fig. 1 by the present invention.
For transmitting terminal:
(1) channel switches: after node access channel, the working channel of meeting Stochastic choice fixed interface and changeable interface.First channel switching will be carried out before transmission packet, first determine whether to need to switch fixed channel, if node fixed interface is operated on the busiest current fixed channel, then be switched on the most idle current fixed channel with certain probability, otherwise fixed channel is constant, switch fixed channel mainly in order to balance network load, improve the availability of frequency spectrum, if otherwise have the fixed interface of too much node to be operated on same fixed channel to be easy to cause network congestion; Then select corresponding changeable interface to transmit according to the fixed channel of packet next-hop node, if there is no changeable interfaces on this fixed channel, then any one changeable interface is switched on this fixed channel and transmits.
(2) neighbor information obtains: if wish network throughput to maximize, coding decision-making, by which packet putting together and encode, is very important.Decision-making of better encoding then needs abundanter neighbor information.All data of one hop neighbor transmission can be listened to when node is under promiscuous mode, also just obtain its neighbor information.Before whole process starts, source node and destination node can send the routing broadcast bags such as RREQ, RREP mutually, in this process, on path, all nodes all can obtain the fixed channel information of its neighbor node, upgrade self neighbours' fixed channel table also as the foundation of coding decision-making.
Renewal process is as follows: 1. initial phase, and node adds the fixed channel information of oneself and a hop neighbor node and sends in the broadcast packets such as RREQ, RREP; 2. node is after receiving RREQ, RREP bag, according to neighbours' fixed channel table of fixed channel information updating wherein self; 3., after node switches fixed channel, in HELLO bag, add the up-to-date fixed channel information of oneself and send; 4. node is after receiving HELLO bag, according to neighbours' fixed channel table of fixed channel information updating wherein self.
(3) chance is monitored: it is the prerequisite of network code that chance is monitored, and only has the mode monitored by chance to obtain information and the transmission data of a hop neighbor node between node, just likely correctly carries out Code And Decode to packet.After packet sends, receiving terminal node monitors the transmission data obtaining its all hop neighbor by chance.But nodal cache is limited, therefore needs to follow certain rule and store the packet listened to, rule is as follows: the source data packet node 1. listened to can not be this node, otherwise illustrates in route to there is loop, data packet discarding; 2. the packet listened to, if exist in buffer memory, abandons, otherwise retains; If 3. listen to for encoded packets, and if only if, and it retains when meeting decoding rule, otherwise abandons.
For the packet listened to, if its destination node is this node, then upper strata is transferred to process; If not this node, more whether stored this packet in the buffer queue seeing this node, if not yet store, then by it stored in buffer queue, otherwise to be abandoned.For the encoded packets listened to, first judge whether this node meets decoding rule, if do not meet, is abandoned, if meet, it is decoded, if its destination address of the packet obtained after decoding is this node, then upper strata is transferred to process, if not this node is then forwarded.Simultaneously for preventing buffer queue from blocking up, every the set time, as 0.5s, node needs Automatic clearance buffer queue.
(4) network code rule: what increase code machine meeting focuses on coding rule, and transmitting terminal coding rule of the present invention is as follows: the bag 1. participating in encoding is packet, decodes being difficult to it if encoded packets participates in editor; 2. the decoding of the encoded packets information that needs each packet unique separately, therefore the next-hop node participating in the packet of encoding must be different, otherwise two packets with identical next-hop node cannot obtain complete decoding, can only obtain the encoded packets of these two packets; 3. to carry out complete decoding to encoded packets and need each information participating in the packet of coding, therefore, the mode that all next-hop nodes of packet participating in coding can both be monitored by chance obtain divided by this node be next-hop node packet beyond all packets participating in coding, namely the next-hop node of a certain packet and all the other to participate in the upper hop node of the packet of encoding all adjacent; 4. be that the packet of source node can not participate in coding with coding nodes, because such packet does not have upper hop node, do not meet rule requirement 3., namely coding nodes can only, as transit node, can not be the source node of the packet of any participation coding; 5. 1. the packet adding code set for first only need consider rule.
Raw data packets only has and meets above-mentioned five rules and just can add coding rule.
To introduce under multi-signal-channel and multi-interface environment in Ad-hoc network data packet coding and transmitting-receiving method below in conjunction with embodiment.
If total n packet participates in coding, be designated as P
1, P
2..., P
n, its upper hop node is designated as S
1, S
2..., S
n, its next-hop node is designated as R
1, R
2..., R
n, coding nodes is designated as A.
(1) initial phase, the working channel of each node Stochastic choice fixed interface and changeable interface.Then source data packet node and destination node send RREQ, RREP broadcast packet carrying fixed channel information and neighbours' fixed channel information mutually, in this process, each node in whole route all obtains the fixed channel information of a hop neighbor node and two hop neighbor nodes and the fixed channel utilization rate table of whole route.According to fixed channel utilization rate table, node judges that the fixed channel of self is the need of change, if the fixed channel of node fixed interface work at present is the fixed channel that utilization rate is the highest, then be switched to the minimum fixed channel of utilization rate with balance network load with certain probability, this node needs to send the fixed channel alteration that HELLO bag notifies a hop neighbor node oneself simultaneously.
(2) after fixed channel is determined, at transmitting terminal, S
1, S
2..., S
ndetermined the fixed channel of A by the neighbours' fixed channel table inquiring about self, and send packet P to A
1, P
2..., P
n, at node A, screen all packets according to network code rule, the packet only meeting coding rule can put into code set.
(3), after code set is determined, all packets in set are encoded, is encoded to an encoded packets P, and P is sent.
Claims (1)
1. a network coding method for Wireless Ad-hoc Network, under being applied to the environment of multi-signal-channel and multi-interface, comprises step below:
1) initial phase, the working channel of each node Stochastic choice fixed interface and changeable interface in network;
2) source node sends RREQ bag to destination node, neighbours' fixed channel table of the working channel information of the fixed interface comprising oneself and one hop neighbor node is carried in bag, in process of transmitting, RREQ bag is often through a node, this node is just replaced bag Central Plains neighbours' fixed channel table with neighbours' fixed channel table of oneself and a hop neighbor node, and then mails to next-hop node;
3) each node on path is according to information updating self the neighbours fixed channel table carried in RREQ bag and fixed channel utilization rate table, meanwhile, a hop neighbor node of each node wraps by monitoring acquisition RREQ and upgrades self neighbours' fixed channel table and fixed channel utilization rate table;
4) destination node receives RREQ and wraps backward source node response RREP bag, neighbours' fixed channel table of the working channel information of the fixed interface comprising oneself and one hop neighbor node is carried in bag, in process of transmitting, RREP bag is often through a node, this node is just replaced bag Central Plains neighbours' fixed channel table with neighbours' fixed channel table of oneself and a hop neighbor node, and then mails to next-hop node;
5) each node on path is according to information updating self the neighbours fixed channel table carried in RREP bag and fixed channel utilization rate table, meanwhile, a hop neighbor node of each node wraps by monitoring acquisition RREP and upgrades self neighbours' fixed channel use table and fixed channel utilization rate table;
6) when the fixed channel that certain node on path uses is for fixed channel that utilization rate is the highest, this node is switched on the minimum fixed channel of utilization rate with certain probability interface that is fixed;
7) node switching fixed channel sends HELLO bag to a hop neighbor node, carries oneself fixed channel information after switching in bag;
8) source node selects the changeable interface be operated on the fixed channel of next-hop node to send packet according to neighbours' fixed channel table, if there is no changeable interfaces on this channel, then make a certain changeable interface be switched on this channel, then send packet;
9) in the process sending packet, node on each path, judge whether self is the node that there is code machine meeting according to coding rule, if judge it self is the node that there is code machine meeting, then the some packets sended over are encoded, after coding, encoded packets is sent to the next-hop node of one of them packet participating in coding, other next-hop nodes participating in the packet of coding are monitored by chance and are obtained encoded packets; If judge it self is the node that there is not code machine meeting, then packet is sent to separately next-hop node place, simultaneously, all hop neighbor nodes of this node are monitored by chance and are obtained this packet, if there is this packet in buffer queue, abandoned, otherwise be stored into buffer queue; Described coding rule is: the bag 1. participating in encoding is packet; 2. the next-hop node participating in the packet of encoding is different; 3. the mode that all next-hop nodes of packet participating in coding can both be monitored by chance obtain divided by this node be next-hop node packet beyond all packets participating in coding, namely the next-hop node of a certain packet and all the other to participate in the upper hop node of the packet of encoding all adjacent; 4. coding nodes can only, as transit node, can not be the source node of the packet of any participation coding; 5. 1. the packet adding code set for first only need consider rule.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410682277.7A CN104506274A (en) | 2014-11-24 | 2014-11-24 | Network coding method for wireless Ad-hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410682277.7A CN104506274A (en) | 2014-11-24 | 2014-11-24 | Network coding method for wireless Ad-hoc network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104506274A true CN104506274A (en) | 2015-04-08 |
Family
ID=52947996
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410682277.7A Pending CN104506274A (en) | 2014-11-24 | 2014-11-24 | Network coding method for wireless Ad-hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104506274A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080232258A1 (en) * | 2005-03-08 | 2008-09-25 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and Arragement for Advanced Routing Metrics in Multihop Networks |
| CN101790199A (en) * | 2010-01-29 | 2010-07-28 | 武汉理工大学 | Multi-signal-channel and multi-interface synchronous medium access method applicable to Ad Hoc network |
| CN103916929A (en) * | 2014-03-25 | 2014-07-09 | 中国电子科技集团公司第三十研究所 | Neighbor finding method for directional Ad Hoc network |
-
2014
- 2014-11-24 CN CN201410682277.7A patent/CN104506274A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080232258A1 (en) * | 2005-03-08 | 2008-09-25 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and Arragement for Advanced Routing Metrics in Multihop Networks |
| CN101790199A (en) * | 2010-01-29 | 2010-07-28 | 武汉理工大学 | Multi-signal-channel and multi-interface synchronous medium access method applicable to Ad Hoc network |
| CN103916929A (en) * | 2014-03-25 | 2014-07-09 | 中国电子科技集团公司第三十研究所 | Neighbor finding method for directional Ad Hoc network |
Non-Patent Citations (1)
| Title |
|---|
| 邓玮: "基于多信道多接口的COPE网络编码研究与实现", 《中国优秀硕士学位论文全文数据库》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2489219B1 (en) | Coding methods and apparatus for broadcast channels | |
| US20110003545A1 (en) | Relay Node Connection Management | |
| US9509447B2 (en) | Method and apparatus for improved network coding in wireless communication system | |
| US10257718B2 (en) | Method for configuring a network comprising several nodes, a method for transmitting data in said network, and corresponding equipment and computer program | |
| KR20170056547A (en) | Route formation and message transmission in a data link group over multiple channels | |
| JP5725173B2 (en) | Radio station, routing method, radio communication system, and routing program | |
| CN103428803A (en) | Opportunistic routing method combining with opportunistic network coding | |
| CN101854202A (en) | Data transmission method, equipment and system | |
| JP5200840B2 (en) | Wireless communication system, transmission terminal, relay terminal, data transmission method, data reception method, and computer program | |
| Al-Humidi et al. | Energy-aware approach for routing protocol by using centralized control clustering algorithm in wireless sensor networks | |
| US10027572B2 (en) | Path finding in a mesh network with adaptive bitrate | |
| Shiming et al. | A simple channel assignment for opportunistic routing in multi-radio multi-channel wireless mesh networks | |
| Zytoune et al. | A fairly balanced clustering algorithm for routing in wireless sensor networks | |
| Zhao et al. | A novel dynamic spectrum access algorithm for cognitive radio networks | |
| CN104506274A (en) | Network coding method for wireless Ad-hoc network | |
| JP2015043491A (en) | Relay device, relay method and relay program | |
| CN104394560A (en) | Multi-channel multi-interface wireless Ad-hoc network data transmission method | |
| Sadat et al. | A trade-off between reliability and energy efficiency for inter-cluster communication in wireless sensor networks | |
| JP6747146B2 (en) | Wireless communication terminal and transmission power determination method | |
| Cansever | Value of information | |
| Sun et al. | A novel spectrum-aware routing protocol for multi-hop cognitive radio ad hoc networks | |
| Shi et al. | Routing and Channel Assignment for Multicast in Multi-Channel Multi-Radio Wireless Mesh Networks. | |
| CN104780152A (en) | Multi-channel multi-interface wireless network coding-decoding method based on ad hoc ondemand distance vector routing (AODV) protocol | |
| Raman et al. | A practical approach for providing qos in multichannel ad-hoc networks using spectrum width adaptation | |
| CN106231632B (en) | One kind being based on multi channel Ad-Hoc network information exchange method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150408 |