CN103108374B - A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network - Google Patents

A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network Download PDF

Info

Publication number
CN103108374B
CN103108374B CN201310033955.2A CN201310033955A CN103108374B CN 103108374 B CN103108374 B CN 103108374B CN 201310033955 A CN201310033955 A CN 201310033955A CN 103108374 B CN103108374 B CN 103108374B
Authority
CN
China
Prior art keywords
mesh
node
state
terminal
mesh terminal
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.)
Active
Application number
CN201310033955.2A
Other languages
Chinese (zh)
Other versions
CN103108374A (en
Inventor
张玉
杨维
张海涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaotong University
Original Assignee
Beijing Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN201310033955.2A priority Critical patent/CN103108374B/en
Publication of CN103108374A publication Critical patent/CN103108374A/en
Application granted granted Critical
Publication of CN103108374B publication Critical patent/CN103108374B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses a kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network, comprise the following steps: step 1: node type information is set; Step 2: the communications status of Mesh wireless terminal is divided in order to three types, i.e. " inside " state, " edge " state and " reparation " state; Step 3: each Mesh terminal node safeguards the key routing node list of a Mesh; Step 4: a Mesh terminal is in " inside " state if find, then direct according to the key routing node list information of Mesh, select the key routing node of the neighbours nearest with gateway, set up the route arriving gateway.

Description

A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network
Technical field
The present invention relates to networking technology area, particularly relate to a kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network.
Background technology
Wireless mesh network, is also called wireless Mesh netword, is a kind of wireless multi-hop relay network that can realize MANET, self-configuring.Wireless mesh network expansion does not rely on non-wireless infrastructures, can quickly networking, has the application characteristics such as flexible, portable, adaptive capacity to environment is strong, is the advantage technology building underground coal mine emergency management and rescue cordless communication network.Wherein, the downhole emergency rescuing wireless mesh network based on the netted web frame of mixing is high because of its network path redundancy, has stronger transmission robustness, becomes study hotspot.Based on mixing the underground coal mine emergency management and rescue wireless mesh web frame of netted web frame as shown in Figure 1.
In the mine emergency management and rescue wireless Mesh netword based on the netted web frame of mixing, routing node is the same has route forwarding function for Wireless Mesh terminal and Mesh backbone.Due to existing wireless mesh network route agreement not diffServ network node type, therefore Wireless Mesh terminal needs the routing forwarding task outside commitment on the basis performing its application function, and this proposes high requirement to the energy reversal of Wireless Mesh terminal.And in downhole emergency rescuing scene, the energy reserve of wireless terminal device is lower, terminal energy consumption problem seriously constrains the operating time of mine emergency management and rescue communication system.
Summary of the invention
The technical problem that the present invention solves is to provide a kind of routing algorithm, under the prerequisite of router efficiency ensureing mine emergency management and rescue wireless mesh network, can reduce the relaying energy ezpenditure of the Wireless Mesh terminal in network based on this algorithm as far as possible.
The embodiment of the invention discloses a kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network, comprise the following steps:
Step 1: node type information is set, is designated as T, and specify that T=1 represents the key routing node of Mesh, T=2 represents Wireless Mesh terminal node;
Step 2: the communications status of Mesh wireless terminal is divided in order to three types, i.e. " inside " state, " edge " state and " reparation " state, has the situation of the key routing node that can reach gateway in the communication range that described " inside " state refers to Mesh terminal; The scene of the key routing node of any Me s h is not comprised in the communication range that described " edge " state refers to Mesh terminal; Comprise the key routing node of Mesh in the communication range that described " reparation " state refers to Mesh terminal, but these key routing nodes there occurs fault or the situation with gateway connection interruption;
Step 3: each Mesh terminal node safeguards the key routing node list of Mesh, the address of the key routing node within the scope of the current Mesh terminal communication of this list records, the term of validity and arrive the hop count information of gateway; If when the key routing node list of the Mesh of Mesh terminal is empty, then illustrate that present node is " edge " state; If not empty, and there is the key routing neighbor node that can reach gateway, then show that present node is " inside " state; Otherwise, the state that illustrates that present node is in " reparation ";
Step 4: a Mesh terminal is in " inside " state if find, then direct according to the key routing node list information of Mesh, select the key routing node of the neighbours nearest with gateway, set up the route arriving gateway.
Further, as preferably, further comprising the steps of after described step 4:
If find, a Mesh terminal is in " edge " state, then will start the route discovery mechanisms based on request-response mode, generates RREQ message and outwards broadcast;
The 2nd Mesh terminal receiving this RREQ information checks local state, if check result is " inside " state, the reverse route of a Mesh terminal and upper hop node is then first arrived according to RREQ information updating the 2nd Mesh terminal, then the routing iinformation of gateway is arrived according to self, produce a RREP, and send to a Mesh terminal along reverse path; If check result is " edge " state or " reparation " state, first the reverse route of a Mesh terminal and upper hop node is arrived according to RREQ information updating the 2nd Mesh terminal, then the path weight value of Linktype is set, the path weight value of the node type information in the 2nd Mesh terminal renewal RREQ message, request type message, jumping figure, Linktype and relevant address sequence information, and the RREQ message after upgrading outwards is broadcasted.
Further, as preferably, further comprising the steps of after described step 4:
If find, a Mesh terminal is in " reparation " state, then will start the route discovery mechanisms based on request-response mode, generates RREQ message and outwards broadcast;
If when receiving node is the 2nd Mesh terminal, the 2nd Mesh terminal receiving this RREQ information checks local state, if check result is " inside " state, the reverse route of a Mesh terminal and upper hop node is then first arrived according to RREQ information updating the 2nd Mesh terminal, then the routing iinformation of gateway is arrived according to self, produce a RREP, and send to a Mesh terminal along reverse path; If check result is " edge " state or " reparation " state, first the reverse route of a Mesh terminal and upper hop node is arrived according to RREQ information updating the 2nd Mesh terminal, then the path weight value of Linktype is set, the path weight value of the node type information in the 2nd Mesh terminal renewal RREQ message, request type message, jumping figure, Linktype and relevant address sequence information, and the RREQ message after upgrading outwards is broadcasted;
If when receiving node is key routing node, first the reverse route of a Mesh terminal and upper hop node is arrived according to RREQ information updating the 2nd Mesh terminal, then upgrade the information such as the node type information in RREQ message, jumping figure, the path weight value of Linktype and relevant address sequence number in the 2nd Mesh terminal, and the RREQ message after upgrading is continued outwards broadcast.
The present invention is by adopting the routing mechanism based on " state ", decrease use probability and the broadcasting area of RREQ route request information, decrease the energy expense of Mesh terminal for repeat broadcast RREQ message, reduce the request of route discovery bandwidth cost in network simultaneously, add router efficiency, improve the throughput performance of network, stability and real-time.
Accompanying drawing explanation
When considered in conjunction with the accompanying drawings, by referring to detailed description below, more completely can understand the present invention better and easily learn wherein many adjoint advantages, but accompanying drawing described herein is used to provide a further understanding of the present invention, form a part of the present invention, schematic description and description of the present invention, for explaining the present invention, does not form inappropriate limitation of the present invention, wherein:
Fig. 1 is the mine emergency management and rescue wireless network architecture figure based on the netted web frame of mixing.
Fig. 2 (a) for terminal communication state be the route discovery exemplary plot of " inside " state.
Fig. 2 (b) for terminal communication state be the route discovery exemplary plot of " edge " state.
Fig. 2 (c) for terminal communication state be the route discovery exemplary plot of " reparation " state.
Fig. 3 is the HELLO message format in RAODV agreement.
Fig. 4 is the message format of RREQ in RAODV.
Fig. 5 is network throughput performance simulation curve.
Fig. 6 is network end-to-end delay performance simulation curve.
Embodiment
Be described with reference to Fig. 1-6 pairs of embodiments of the invention.
For enabling above-mentioned purpose, feature and advantage become apparent more, and below in conjunction with the drawings and specific embodiments, the present invention is further detailed explanation.
Application characteristic with gateway communication main according to wireless terminal in mine emergency management and rescue communication scenes, the present invention designs based on following application background:
● all Mesh terminals only communicate with gateway;
● adopt proactive routing protocol between the key routing node of Mesh and gateway, any key routing node regular maintenance arrives the routing iinformation of gateway.
AODV protocol (ad hoc on demand distance vector routing, AODV) be the most widely used Routing Protocol of wireless mesh network, and it is best to there are some researches show that this agreement compares the transmission performance of the Routing Protocols such as DSR, OLSR in underground coal mine environment, accordingly, the present invention has adopted the route discovery based on request-acknowledgement mechanism in AODV Routing Protocol and route repair pattern, and for the purpose of the routing forwarding task reducing Wireless Mesh terminal, carried out concrete routing mechanism design, therefore the present invention is also called modified model
AODV Routing Protocol, is called for short RAODV Routing Protocol.The basic routing principle of this agreement is as follows:
The present invention is according to the communications status of Wireless Mesh terminal, the communications status of any wireless terminal in mine emergency management and rescue wireless mesh network is divided in order to three types, i.e. " inside " state, " edge " state and " reparation " state, respectively as Fig. 2 (a), 2(b) and 2(c) as shown in.RAODV defines the route discovery mode of Mesh terminal under different conditions on this basis.
There is in the communication range that " inside " state refers to current Mesh terminal the situation of the key routing node that can reach gateway.Now, adopt the Mesh terminal of ROADV to adopt the communication mode of similar ap mode, directly by key routing node access backbone transport network, then utilize backbone transport network to realize the information interaction with gateway.This method avoid and carry out route discovery by broadcast route request message (Route Request, RREQ), thus decrease the repeat broadcast energy consumption of Mesh terminal to RREQ message.Namely terminal node S in Fig. 2 (a) is in " inside " state, and its path adopting RAODV routing policy and gateway D to set up is as shown in solid arrow in figure, and this path does not comprise Mesh terminal node as seen.
The scene of the key routing node of any Mesh is not comprised in the communication range that " edge " state refers to Mesh terminal.Now, Mesh terminal cannot directly by Mesh key routing node access backbone transport network, the route discovery mechanisms based on request-response mode need be enabled, outwards broadcast RREQ request message, by accessing backbone transport network by adjacent Wireless Mesh terminal.As Fig. 2 (b) interior joint S is " edge " node, under RAODV strategy, it is broadcast RREQ route requests outwards, when this request arrives Mesh terminal R, because R is in " inside " state, so stopping is continued broadcast to RREQ by R, and return the transmission path via its access backbone transport network to S, the path finally set up is as shown in solid arrow in figure.
Comprise the key routing node of Mesh in the communication range that " reparation " state refers to Mesh terminal, but these key routing nodes there occurs fault or the situation with gateway connection interruption, as shown in Figure 2 (c).Now, the route repair adopting the Mesh terminal of RAODV routing policy to enable equally based on request-response mode is machine-processed, outside broadcast RREQ message, and in found path, select the path through Mesh terminal number is minimum to return source node S as final route, the final path set up is as shown in solid arrow in figure.
In order to realize the routing procedure under above-mentioned difference " state ", the Routing Protocol content of RAODV to AODV has carried out following improvement.
1. in order to enable routing procedure recognition node type, RAODV introduces node type information in former AODV routing mechanism, is designated as T, and specifies that T=1 represents the key routing node of Mesh, and T=2 represents Wireless Mesh terminal node.
2. conveniently obtain the communications status of current Mesh terminal, RAODV adds the key routing node list of Mesh on the basis of original neighbor list, and its data structure is as follows:
Each Mesh terminal node safeguards the key routing node list of Mesh, the address of the key routing node within the scope of the current Mesh terminal communication of this list records, the term of validity and arrive the information such as jumping figure of gateway.If when the key routing node list of the Mesh of current Mesh terminal is empty, then illustrate that present node is " edge " state; If not empty, and there is the key routing neighbor node that can reach gateway, be then indicated as present node for " inside " state; Otherwise, the state that illustrates that present node is in " reparation ".
3. the key routing node list of Mesh is safeguarded by HELLO message.AODV Central Plains HELLO message does not distinguish node type, and does not transmit the local hop count information arriving gateway.In order to set up the key routing node list of Mesh, RAODV has taken out 2 bits for representing node type information in the reserved field of former HELLO message, as shown in Figure 3; Meanwhile, regulation is as T=1, and " jumping figure " field in HELLO message equals the local jumping figure arriving gateway, thus achieves node type and the transmission arriving gateway hop count information when not increasing HELLO data package size.When receiving the HELLO message of T=1, Mesh terminal will carry out maintenance and the renewal of the key routing node list of local Mesh according to information.
4. for enabling the route discovery mechanisms based on request-response identify different communication " state ", take out 8 bits in " reserved field " of RAODV in the RREQ message of AODV to be used for representing request type information rq_mode, as shown in Figure 4, and the state that specifies that rq_mode=0x00 represents " inside ", state that rq_mode=0x01 represents " edge ", state that rq_mode=0x02 represents " reparation ".When RREQ arrives a Mesh terminal node, by its rq_mode value of state updating according to this Mesh terminal; When RREQ message arrives a key routing node, its rq_mode value is constant.
5. Mesh terminal is used to carry out route relaying in order to enable the route finding process based on request-response mode avoid, RAODV proposes the path weight value route criterion based on Linktype, be designated as rt_weight, specify that the rt_weight of every bar backbone transport link equals 1/3, the rt_weight of other non-key transmission links be connected with Mesh terminal equals 1.
6. in order to RREQ message is identified the Linktype of process record rt_weight value through path, RAODV adds sending node type T and rt_weight two fields in addition in the RREQ message of former AODV, as shown in Figure 4.When the T field in the type and RREQ of present node is all shown as Mesh backbone routing node, illustrate that the upper hop link of RREQ is backbone transport link, this seasonal rt_weight increases by 1/3, otherwise, make rt_weight increase by 1.By the path selecting rt_weight value minimum, effectively reduce the Mesh terminal quantity comprised in data transfer path.In Fig. 2 (c), solid arrow and dotted arrow indicate RAODV respectively and adopt rt_weight as the path selected by route criterion and AODV based on the path selected by jumping figure criterion, as shown in the figure, the path selected by RAODV farthest decreases the Mesh terminal relay node in transmission path.Thus reduce Mesh terminal routing forwarding task in the data transmission, save Mesh final energy.
Below in conjunction with Fig. 2, concrete introduction is carried out to the specific implementation process of RAODV Routing Protocol of the present invention.
Suppose in mine emergency management and rescue wireless mesh network, any Mesh terminal S wishes to communicate with gateway D, but do not exist in discovery local routing table and arrive the effective routing information of D, now node S will by checking that the key routing node list of local Mesh checks local state:
Currently " inside " state self is in if find, now direct according to the key routing node list information of Mesh, select the key routing node of the neighbours nearest with gateway, set up the route arriving gateway, then information is uploaded to backbone transport network.The transmission path set up in this case as shown in Figure 2 (a) shows.
If find, this locality is in " edge " state or " reparation " state, now will start the route discovery mechanisms based on request-response mode, generates RREQ message and outwards broadcast.
After arbitrary node in mine emergency management and rescue WMN receives this RREQ message, following operation will be performed.
1. the rq mode of RREQ message is checked.
If { rq_mode=0x01}, shows that upper hop Wireless Mesh terminal node is in " edge " state, and the node therefore receiving RREQ may be only Mesh terminal.The Mesh terminal receiving this RREQ information checks local state.If check result is " inside " state, then performs the and 2. walk; " if edge " state or " reparation " state, then perform the and 3. walk.
If { rq_mode=0x02} shows that upper hop Mesh terminal node is in " reparation " state.Now, receiving node may be Mesh terminal node, also may be key routing node.If when receiving node is Mesh terminal, its processing mode with above-mentioned processing mode during rq_mode=0x01} is identical, and namely according to local state perform step 2. or step 3.; If when receiving node is key routing node, then performs the and 4. walk.
2. first arrive the reverse route of source node S and upper hop node according to RREQ information updating this locality, then arrive the routing iinformation of gateway according to self, produce a RREP, and send to S along reverse path.
3. the reverse route of source node S and upper hop node is first arrived according to RREQ information updating this locality, the information such as T, rq_mode then in local update RREQ message, jumping figure, rt_weight and relevant address sequence number, and the RREQ message after upgrading outwards is broadcasted.
4. the reverse route of source node S and upper hop node is first arrived according to RREQ information updating this locality, the information such as the T then in local update RREQ message, jumping figure, rt_weight and relevant address sequence number, key routing node does not upgrade rq_mode information, and the RREQ message after upgrading is continued outwards broadcast.
The transmission path of RAODV and the AODV in comparison diagram 2 is known, and RAODV routing policy successfully decreases Mesh terminal pattern and to go down into a mine the relay forwarding task of Mesh terminal in emergency management and rescue WMN network, efficiently solves the Mesh terminal energy consumption problem under this pattern.And be not difficult to find, the deployment scale of mine emergency management and rescue WMN network is larger, and more Mesh terminals can avoid RREQ outside commitment and broadcast and routing forwarding task to packet, and the power savings advantages of RADOV will be more obvious.Simulation result:
Suppose the transmission capacity of the backbone transport network of mine emergency management and rescue wireless Mesh netword be C, Mesh terminal produce traffic carrying capacity be F.Network capacity based on the mine emergency management and rescue WMN of Mesh terminal pattern comprises the transmission bandwidth of Mesh terminal, so the whole volume of emergency management and rescue WMN is higher than the transmission capacity C of backbone transport network.AODV Routing Protocol does not distinguish node type, and therefore theoretically, AODV more can utilize the bandwidth resources of Mesh terminal fully than RAODV.But, in actual applications, utilize the W-URN throughput performance of RAODV lower than the throughput performance of the network of employing AODV? for this problem, the communication scenes that F>C and F<C two kinds is different is specially provided with, comparative analysis transmission performance of RAODV as F>C and F<C in emulation.For verifying the route recovery ability of RAODV, in emulation, be also provided with the scene that 30 second moment any key routing node breaks down.
Fig. 5 is the simulation result of the network throughput when adopting RAODV Routing Protocol, result shows, as F>C, RAODV can't make the throughput performance of network reduce because of avoiding using Mesh terminal to carry out route relaying, on the contrary, because RAODV decreases the broadcast bandwidth expense of RREQ, compare AODV and the throughput of mine emergency management and rescue wireless Mesh netword and transmission stability are improved;
Fig. 6 is the simulation result of the average end-to-end time delay of network when adopting RAODV Routing Protocol.As shown in the figure, as F<C, there are the two obvious difference in place in the time lag curve of RAODV and AODV, namely AODV 0 second with its time lag curve of 30 second moment occurred twice significantly on jump.Within 0 second, be respectively with 30 seconds the initial time carrying out route discovery and the laggard row route repair of accident first, therefore this jump time delay has reacted the routing convergence time of corresponding routing policy.From simulation result, the routing convergence time delay of RAODV will well below AODV.Occur that the reason of this gap is that the RREQ message of RAODV forwards primarily of the key routing node of Mesh, the complexity that the network complexity of Mesh backbone transport network compares whole mine emergency management and rescue Mesh network reduces greatly, effectively reduce RREQ message thus in broadcasting process and the transmission disturbance that runs in returning of route replies message, thus make can connect fast between source node and destination node.
Simulation curve after 30 seconds in Fig. 5 and Fig. 6 shows the throughput of the network after key routing node breaks down and the simulation result of average end-to-end time delay.Simulation result shows, when after unexpected generation, the transmission stability of RAODV is apparently higher than AODV, and especially as F<C, the recovery latency of RAODV is only 1/4 of AODV, has route recovery ability fast.
Although the foregoing describe the specific embodiment of the present invention, but those skilled in the art is to be understood that, these embodiments only illustrate, those skilled in the art, when not departing from principle of the present invention and essence, can carry out various omission, replacement and change to the details of said method and system.Such as, merge said method step, thus then belong to scope of the present invention according to the function that the method that essence is identical performs essence identical to realize the identical result of essence.Therefore, scope of the present invention is only defined by the appended claims.

Claims (1)

1. an energy-saving routing algorithm for mixed structure mine emergency management and rescue wireless mesh network, is characterized in that, comprise the following steps:
Step 1: node type information is set, is designated as T, and specify that T=1 represents the key routing node of Mesh, T=2 represents Wireless Mesh terminal node;
Step 2: the communications status of Mesh wireless terminal is divided in order to three types, i.e. " inside " state, " edge " state and " reparation " state, has the scene of the key routing node that can reach gateway in the communication range that described " inside " state refers to Mesh terminal; The scene of the key routing node of any Mesh is not comprised in the communication range that described " edge " state refers to Mesh terminal; Comprise the key routing node of Mesh in the communication range that described " reparation " state refers to Mesh terminal, but these key routing nodes there occurs fault or the situation with gateway connection interruption;
Step 3: each Mesh terminal node safeguards the key routing node list of Mesh, the address of the key routing node within the scope of the current Mesh terminal communication of this list records, the term of validity and arrive the hop count information of gateway; If when the key routing node list of the Mesh of Mesh terminal is empty, then illustrate that present node is " edge " state; If not empty, and there is the key routing neighbor node that can reach gateway, then show that present node is " inside " state; Otherwise, the state that illustrates that present node is in " reparation ";
Step 4: a Mesh terminal is in " inside " state if find, then direct according to the key routing node list information of Mesh, select the key routing node of the neighbours nearest with gateway, set up the route arriving gateway;
If find, a Mesh terminal is in " edge " state, then will start the route discovery mechanisms based on request-response mode, generates RREQ message and outwards broadcast;
The 2nd Mesh terminal receiving this RREQ information checks local state, if check result is " inside " state, the reverse route of a Mesh terminal and upper hop node is then first arrived according to RREQ information updating the 2nd Mesh terminal, then the routing iinformation of gateway is arrived according to self, produce a RREP, and send to a Mesh terminal along reverse path; If check result is " edge " state or " reparation " state, first the reverse route of a Mesh terminal and upper hop node is arrived according to RREQ information updating the 2nd Mesh terminal, then the path weight value of Linktype is set, the path weight value of the node type information in the 2nd Mesh terminal renewal RREQ message, request type message, jumping figure, Linktype and relevant address sequence information, and the RREQ message after upgrading outwards is broadcasted; If find, a Mesh terminal is in " reparation " state, then will start the route discovery mechanisms based on request-response mode, generates RREQ message and outwards broadcast;
If when receiving node is the 2nd Mesh terminal, the 2nd Mesh terminal receiving this RREQ information checks local state, if check result is " inside " state, the reverse route of a Mesh terminal and upper hop node is then first arrived according to RREQ information updating the 2nd Mesh terminal, then the routing iinformation of gateway is arrived according to self, produce a RREP, and send to a Mesh terminal along reverse path; If check result is " edge " state or " reparation " state, first the reverse route of a Mesh terminal and upper hop node is arrived according to RREQ information updating the 2nd Mesh terminal, then the path weight value of Linktype is set, the path weight value of the node type information in the 2nd Mesh terminal renewal RREQ message, request type message, jumping figure, Linktype and relevant address sequence information, and the RREQ message after upgrading outwards is broadcasted;
If when receiving node is key routing node, first the reverse route of a Mesh terminal and upper hop node is arrived according to RREQ information updating the 2nd Mesh terminal, then upgrade the information such as the node type information in RREQ message, jumping figure, the path weight value of Linktype and relevant address sequence number in the 2nd Mesh terminal, and the RREQ message after upgrading is continued outwards broadcast.
CN201310033955.2A 2013-01-29 2013-01-29 A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network Active CN103108374B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310033955.2A CN103108374B (en) 2013-01-29 2013-01-29 A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310033955.2A CN103108374B (en) 2013-01-29 2013-01-29 A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network

Publications (2)

Publication Number Publication Date
CN103108374A CN103108374A (en) 2013-05-15
CN103108374B true CN103108374B (en) 2015-10-14

Family

ID=48315870

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310033955.2A Active CN103108374B (en) 2013-01-29 2013-01-29 A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network

Country Status (1)

Country Link
CN (1) CN103108374B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103391595B (en) * 2013-08-01 2017-01-25 北京交通大学 Mine emergency rescue wireless mesh network routing method based on cross-layer link state feedback

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103269526B (en) * 2013-05-23 2016-08-24 山西煤炭运销集团有限公司 A kind of for wireless sensor network for mine laneways
CN104469882B (en) * 2014-11-19 2018-04-27 广州杰赛科技股份有限公司 The cut-in method and user terminal of wireless mesh network
CN104618945B (en) * 2015-01-06 2018-05-01 刘乃安 Routing failure restoration methods based on link-quality renewal in WLAN
CN105072571B (en) * 2015-07-01 2018-10-23 河海大学常州校区 A kind of localization method based on pulse communication in wireless nano sensor network
CN108632777A (en) * 2018-04-23 2018-10-09 天地(常州)自动化股份有限公司 Mining wireless node carries out Point-to-Point Data Transmission method in MESH network
CN111510982B (en) * 2019-01-30 2022-03-11 大唐移动通信设备有限公司 Data transmission method and device
CN113163467B (en) * 2021-04-29 2022-06-10 北京小米移动软件有限公司 Node hop count updating method, device, terminal and storage medium in Mesh network

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102026329A (en) * 2009-09-10 2011-04-20 富士通株式会社 Wireless communication network and self-adaptive route selecting communication method thereof

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101203880B1 (en) * 2012-02-22 2012-11-22 엘아이지넥스원 주식회사 System for providing communication service considering mobility in wireless mesh network and method thereof

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102026329A (en) * 2009-09-10 2011-04-20 富士通株式会社 Wireless communication network and self-adaptive route selecting communication method thereof

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
张玉,杨维.矿井带状应急救援无线Mesh网络的标称容量.《华中科技大学学报(自然科学版)》.2012,全文. *
张玉,杨维.矿井应急救援WMN修正分级信道分配策略.《煤炭学报》.2012,全文. *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103391595B (en) * 2013-08-01 2017-01-25 北京交通大学 Mine emergency rescue wireless mesh network routing method based on cross-layer link state feedback

Also Published As

Publication number Publication date
CN103108374A (en) 2013-05-15

Similar Documents

Publication Publication Date Title
CN103108374B (en) A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network
Peng et al. AHBP: An efficient broadcast protocol for mobile ad hoc networks
JP4425863B2 (en) Packet transfer system and radio base station
CN100399772C (en) Ad hot network subsequent multi-path route method based on load balance
CN100442786C (en) Tree structure based routing method
CN102984781B (en) Neighbor node judgment method for wireless ad hoc network route
CN101711048A (en) Method for choosing gateway in integrating process of mobile self-organization network and Internet
Keshtgary et al. Performance evaluation of reactive, proactive and hybrid routing protocols in MANET
Hamad et al. LSEA: Link stability and energy aware for efficient routing in mobile ad hoc network
CN103391595A (en) Mine emergency rescue wireless mesh network routing method based on cross-layer link state feedback
CN103037436B (en) Network coding perception wireless mesh routing protocol based on hybrid wireless mesh protocol (HWMP)
Gharavi et al. Multigate mesh routing for smart grid last mile communications
Ali et al. Multipath routing backbones for load balancing in Mobile Ad hoc Networks
Nurcahyani et al. Performance analysis of ad-hoc on-demand distance vector (aodv) and dynamic source routing (dsr) routing protocols during data broadcast storm problem in wireless ad hoc network
Kumar et al. A review and design study of cross layer scheme based algorithm to reduce the link break in MANETs
Li et al. Ad hoc network routing protocol based on location and neighbor sensing
Norman et al. A faster routing scheme for stationary wireless sensor networks-a hybrid approach
Singh et al. A review paper on introduction to MANET
Margaryan et al. Development of an Adaptive Routing Algorithm in MANET
Junnarkar et al. Novel quality of service (qos) improvement routing protocol for manet using ant colony optimization
Rafiq et al. Comparative analysis of energy efficient routing protocols in manet
Lakshmi et al. Energy aware multicast opportunistic routing protocol (Eamor) to optimize lifetime of MANET
Brahmbhatt et al. Study of route stability in MANET using quality of services
Soomro et al. An Energy and Priority Aware Routing Scheme for Mobile Ad Hoc Networks in Emergency Management
Pethe et al. Distributed Routing Protocol for Different Packet Size Data Transfer over Wireless Sensor Network using NS2 Simulator

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant