CN1691538A - Routing method for wireless mesh network - Google Patents
Routing method for wireless mesh network Download PDFInfo
- Publication number
- CN1691538A CN1691538A CNA2004100367483A CN200410036748A CN1691538A CN 1691538 A CN1691538 A CN 1691538A CN A2004100367483 A CNA2004100367483 A CN A2004100367483A CN 200410036748 A CN200410036748 A CN 200410036748A CN 1691538 A CN1691538 A CN 1691538A
- Authority
- CN
- China
- Prior art keywords
- path
- jumping
- minimum
- node
- hop count
- 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
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A router method in the multi-lines wireless network which comprises the steps of: making router selection of all the nodes in the network with minimum bit energy method; if the number of the selected path is less than or equal to the maximum, ending the router selection.
Description
Technical field
The present invention relates to diversity (diversity) reception, multi-hop (multi-hop) radio communication and route, the particularly method for routing in the multi-hop wireless network.
Background technology
The purpose of communication is that information is in time transmitted between receiving-transmitting sides reliably.And in wireless communication system, the accurate transmitting-receiving of digital information is often very difficult.Particularly for wireless mobile environment, be subjected to such as abominable influences such as channel quality, as shadow effect, multipath fading etc. will cause tangible receptivity to reduce.And diversity technique is to anti-fading, improves one of effective technical means of reception.
Multi-hop wireless communication is meant that communication jumping figure between origination node and destination node is more than or equal to double bounce, be communication between the two be not directly by origination node to destination node, but need by finishing to the relaying (relay) of the via node between the destination node (relay node) between origination node.Therefore for multi-hop wireless communication system, because a communication process needs repeatedly (〉=1) transmitting-receiving operation, the accurate transmission difficulty of end-to-end digital information is bigger.
In multi-hop wireless communication system, according to whether have Centroid to multi-hop relay behavior control, can be divided into two kinds of division center is arranged (with infrastructure) and no division centers (withoutinfrastructure).Involved in the present invention is the multihop system that division center is arranged.Present some broadband wireless MAN standards that occur, comprise IEEE 802.16 line of specifications, high-performance metropolitan area network (HiperMAN) line of specifications, all introduced the multi-hop wireless communication technology, for example the mesh network (mesh) in IEEE 802.16a standard and high-performance metropolitan area network (HiperMAN) standard.
For multi-hop wireless communication system, route (routing), the also i.e. selection of the information transmission path from the origination node to the destination node is a major issue that is related to communication efficiency, systematic function.Good Route Selection can improve throughput, the balance sysmte of link and load, and guarantees that system high efficiency stably moves.
In multi-hop communication system, route implementing method commonly used comprises:
1. minimum hop count method: promptly choose from origination node to the minimum path of destination node jumping figure;
2. minimum bit energy method: promptly choose from the origination node to the destination node efficiency of transmission
(, abbreviate EPB as and calculate) the highest path with every bit transfer energy needed;
More existing broadband wireless metropolitan area communication systems, in IEEE802.16a standard and high-performance metropolitan area network (HiperMAN) standard, all multihop network (calling the Mesh network in IEEE802.16a standard and high-performance metropolitan area network (HiperMAN) standard, i.e. mesh network) but obtain system gain as a selecting technology.
In multi-hop communication system, route implementing method commonly used comprises:
1. minimum hop count method: promptly choose from origination node to the minimum path of destination node jumping figure;
This method realizes simple, and major defect is the difference that does not fully take into account link-quality, and network throughput is lower;
2. minimum bit energy method: promptly choose from the origination node to the destination node the highest path of efficiency of transmission (calculating) with every bit transfer energy needed;
This method has fully taken into account the difference of link-quality, and the network throughput performance is good.But owing to do not consider what influence of jumping figure, often the path jumping figure of Xuan Zeing is too much, and repeatedly the network overhead of relaying and propagation delay time are bigger.
The multi-hop wireless communication technology can be expanded the coverage area, and increases the throughput of system.But because in the wireless communication system, the accurate transmitting-receiving of digital information is often very difficult, for multi-hop wireless communication system, because a communication process needs repeatedly (〉=1) transmitting-receiving operation, the accurate transmission difficulty of end-to-end digital information is bigger.
For multi-hop wireless communication system, route (routing), the also i.e. selection of the information transmission path from the origination node to the destination node is a major issue that is related to communication efficiency, systematic function.Good Route Selection can improve throughput, the balance sysmte of link and load, and guarantees that system high efficiency stably moves.
Summary of the invention
The present invention proposes the method for routing in a kind of multi-hop wireless network, and promptly the method for routing of " under jumping figure is limited based on energy per bit " has been taken into account these two requirements of systematic function and implementation complexity preferably.
For achieving the above object, the method for routing in a kind of multi-hop wireless network comprises step:
Use the minimum bit energy method to carry out the Route Selection between all nodes in the network;
If the jumping figure in selected path is less than or equal to maximum hop count, then Route Selection finishes.
Method for routing in the multi-hop wireless network of the present invention is through simulating, verifying, and the performance that obtains improves comparatively obvious.And implementation complexity is not high, is applicable to the multiple real system that comprises IEEE 802.16 series of canonical and high-performance metropolitan area network series of canonical.
Description of drawings
Fig. 1 is that the node in the multi-hop wireless network sub-district distributes;
Fig. 2 is the Route Selection under the minimum hop count routing method;
Fig. 3 A be jumping figure under limited based on energy per bit Route Selection-A;
Fig. 3 B be jumping figure under limited based on energy per bit Route Selection-B.
Embodiment
The present invention proposes a kind of method for routing based on energy per bit of jumping figure under limited that be applicable to.
In multi-hop communication system, route implementing method commonly used comprises:
1. minimum hop count method (representing): promptly choose from origination node to the minimum path of destination node jumping figure with HOPS_MIN;
This method realizes simple, and major defect is the difference that does not fully take into account link-quality, and network throughput is lower.
2. minimum bit energy method (representing): promptly choose from the origination node to the destination node the highest path of efficiency of transmission (calculating) with every bit transfer energy needed with EPB_MIN;
This method has fully taken into account the difference of link-quality, and the network throughput performance is good.But owing to do not consider what influence of jumping figure, often the path jumping figure of Xuan Zeing is too much, and repeatedly the network overhead of relaying and propagation delay time are bigger.
Owing in the real system, generally can limit to some extent, with the implementation complexity of constrained system and the propagation delay time of data, so pure minimum bit energy method for routing and impracticable for jumping figure.Though and the minimum hop count method realizes simply, do not make full use of the load capacity of network, can't give play to the advantage on the multi-hop communication transmission capacity, effect is also also unsatisfactory.Therefore we have proposed the method for routing of " under jumping figure is limited based on energy per bit " on the basis of the performance that has taken into full account real system and complexity requirement.
Basic thought of the present invention is: at first use " minimum bit energy method " to carry out the Route Selection between all nodes in the network, if the jumping figure in selected path is less than or equal to maximum hop count (constant, represent with MAX_HOPS), then Route Selection finishes; If the jumping figure in selected path greater than maximum hop count MAX_HOPS, then on the basis as a result that above-mentioned " minimum bit energy method " selected, is selected further, the method for selection has two kinds:
A. present path (jumping figure is greater than maximum hop count MAX_HOPS) got rid of, carries out minimum EPB again and select, the path of satisfied up to finding out " jumping figure is less than or equal to maximum hop count MAX_HOPS " constraints, with this path as selection result;
B. with present path (jumping figure is greater than maximum hop count MAX_HOPS) as goal set, under the constraints of maximum hop count MAX_HOPS, carry out combinatory analysis for its link that comprises, the path of therefrom selecting the EPB minimum is as selection result.
The jumping figure (representing) of the destination node that obtains according to EpB_Min with Node.Hops;
If (Node.Hops＜=MAX_HOPS)
The path that obtains is exactly final result path;
}
Otherwise
Further select according to the path that EpB_Min obtains, system of selection can utilize A or B;
}
A. operation (present path is got rid of, carried out minimum EPB again and select)
Up to (finding out that satisfied " jumping figure is less than or equal to maximum hop count
MAX_HOPS " path of constraints, with this path as selecting knot
Really);
B. the link to current path makes up, and carries out combinatory analysis for its link that comprises, and the path of therefrom selecting the EPB minimum is as selection result;
The advantage of method A is to select the path of satisfying constraints of EPB minimum, but amount of calculation is bigger; The advantage of method B is to select path preferably faster, but not necessarily optimum path.
Be exemplified below: for the path of node 2 to node 0, the path that the minimum bit energy method obtains is node 2 → node 5 → node 8 → node 1 → node 0, is expressed as: P
EPB_MIN(Node2)={ Node2 → Node5 → Node8 → Node1 → Node0}; Because jumping figure is 4, greater than MAX_HOPS (being made as 3), we need further to select and handle.
Method A:
0 path, reject P from all nodes 2 to node
EPB_MIN(Node2)={ Node2 → Node5 → Node8 → Node1 → Node0}; Reusing the minimum bit energy method, satisfy the requirement of " being less than or equal to maximum hop count MAX_HOPS " up to resulting path, for example is { Node2 → Node7 → Node1 → Node0}.
Method B:
We according to above-mentioned path Node2 → Node5 → Node8 → Node1 → Node0} obtains the link combinations that may select, and the jumping figure that makes up resulting path be less than or equal to maximum hop count MAX_HOPS:{Node2 → Node5 → Node8 → Node0},
{Node2→Node5→Node1→Node0}、
{Node2→Node8→Node1→Node0}、
{Node2→Node8→Node1→Node0}、{Node2→Node5→Node0}、
{Node2→Node8→Node0}、{Node2→Node1→Node0}、{Node2→Node0}；
Among above-mentioned path, select the path of EPB minimum.So selected path is exactly:
P(Node2)＝{Node2→Node8→Node1→Node0}。
The jumping figure of this paths is 3, can satisfy the requirement of maximum hop count, and its efficiency of transmission (calculating with every bit transfer energy needed) is higher simultaneously.
Embodiment
Shown in Fig. 1,2,3A and 3B, be multi-hop wireless communication sub-district (radius is 3200 a meters) schematic diagram that comprises 30 nodes.
In this sub-district each node distribution as shown in Figure 1, wherein, node 0 is represented the base station, the base station is positioned at center of housing estate, other node random distribution in the sub-district.
The minimum hop count method is applied to the resulting route in this sub-district as shown in Figure 2.There is transmission relation between the line representation node between the node.
Proposed by the invention " under jumping figure is limited based on energy per bit " is applied to this sub-district, and resulting route as shown in Figure 3.Wherein, Fig. 3 .A is the resulting routing diagram of application process A; Fig. 3 .B is the resulting routing diagram of application process B.
Claims (4)
1. the method for routing in the multi-hop wireless network comprises step:
Use the minimum bit energy method to carry out the Route Selection between all nodes in the network;
If the jumping figure in selected path is less than or equal to maximum hop count, then Route Selection finishes.
2. by the described method of claim 1, it is characterized in that also comprising:
If the jumping figure in selected path greater than maximum hop count, then on the basis as a result that above-mentioned minimum bit energy method is selected, is selected further.
3. by the described method of claim 2, it is characterized in that described further selection comprises:
Path that " minimum bit energy method " is selected is got rid of, carry out minimum EPB again and select, the path of satisfied up to finding out " jumping figure is less than or equal to maximum hop count MAX_HOPS " constraints, with this path as selection result.
4. by the described method of claim 2, it is characterized in that described further selection comprises:
The path that " minimum bit energy method " is selected is as goal set, and under the constraints of maximum hop count MAX_HOPS, the path of therefrom selecting the EPB minimum is as selection result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2004100367483A CN1691538A (en) | 2004-04-29 | 2004-04-29 | Routing method for wireless mesh network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2004100367483A CN1691538A (en) | 2004-04-29 | 2004-04-29 | Routing method for wireless mesh network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1691538A true CN1691538A (en) | 2005-11-02 |
Family
ID=35346715
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2004100367483A Pending CN1691538A (en) | 2004-04-29 | 2004-04-29 | Routing method for wireless mesh network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1691538A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008040217A1 (en) * | 2006-09-11 | 2008-04-10 | 3Dsp Corporation | Methods which avoid cluster in a wireless mesh network and systems and devices thereof |
| CN101808338A (en) * | 2010-03-01 | 2010-08-18 | 东南大学 | Quality overhead ratio hop cluster-based service discovery method and mobility model establishing method |
| EP2615776B1 (en) | 2007-08-31 | 2019-12-04 | Fisher-Rosemount Systems, Inc. | Configuring and Optimizing a Wireless Mesh Network |
-
2004
- 2004-04-29 CN CNA2004100367483A patent/CN1691538A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008040217A1 (en) * | 2006-09-11 | 2008-04-10 | 3Dsp Corporation | Methods which avoid cluster in a wireless mesh network and systems and devices thereof |
| EP2615776B1 (en) | 2007-08-31 | 2019-12-04 | Fisher-Rosemount Systems, Inc. | Configuring and Optimizing a Wireless Mesh Network |
| CN101808338A (en) * | 2010-03-01 | 2010-08-18 | 东南大学 | Quality overhead ratio hop cluster-based service discovery method and mobility model establishing method |
| CN101808338B (en) * | 2010-03-01 | 2012-12-12 | 东南大学 | Quality overhead ratio hop cluster-based service discovery method and mobility model establishing method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| He et al. | Interference-aware multisource transmission in multiradio and multichannel wireless network | |
| De et al. | Meshed multipath routing: An efficient strategy in sensor networks | |
| CN1856960A (en) | Mobile ad hoc network providing connectivity enhancement features and associated method | |
| CN101523827A (en) | IP flow-based load balancing over a plurality of wireless network links | |
| CN1856962A (en) | Mobile ad hoc network with quality-of-service protocol hierarchy and associated method | |
| JP2007515906A (en) | Cost determination in multi-hop networks | |
| CN1856959A (en) | Mobile ad-hoc network(manet) providing interference reduction features and related methods | |
| EP2962428A1 (en) | Method, apparatus, and protocol for improving performance in a wireless network | |
| KR20130122758A (en) | Handover initiation methods and systems for improvement of cellular network performance | |
| CN103428803B (en) | A kind of chance method for routing of combination machine meeting network code | |
| US9402213B2 (en) | Dynamic channel switching for wireless mesh networks | |
| Yoo et al. | Cross-layer design for video streaming over wireless ad hoc networks | |
| CN104010344B (en) | A kind of wireless sensor network virtual MIMO communication strategy based on cooperative groups | |
| Rajesh et al. | Congestion control in heterogeneous WANET using FRCC | |
| Le et al. | A new evolutionary approach for gateway placement in wireless mesh networks | |
| CN1306702A (en) | Method and appts. for collector arrays of directional antennas Co-located with zone managers in wireless communications systems | |
| CN102970235B (en) | Multicast routing method based on intra-flow and inter-flow network encoding in wireless mesh network | |
| Teo et al. | Performance analysis of enhanced genetic algorithm based network coding in wireless networks | |
| CN1691538A (en) | Routing method for wireless mesh network | |
| CN110856231A (en) | Multi-data stream transmission method based on multi-hop network | |
| Le et al. | Optimizing gateway placement in wireless mesh networks based on ACO algorithm | |
| Shiming et al. | A simple channel assignment for opportunistic routing in multi-radio multi-channel wireless mesh networks | |
| CN1377202A (en) | Base station equipment and method for adaptive control of antenna beam | |
| CN1625915A (en) | Method and network node for selecting a combining point | |
| Sánchez et al. | Beacon-less geographic routing in real wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20051102 |