CN109996308B - Mobile ad hoc network routing method and device based on energy optimization - Google Patents

Mobile ad hoc network routing method and device based on energy optimization Download PDF

Info

Publication number
CN109996308B
CN109996308B CN201910161145.2A CN201910161145A CN109996308B CN 109996308 B CN109996308 B CN 109996308B CN 201910161145 A CN201910161145 A CN 201910161145A CN 109996308 B CN109996308 B CN 109996308B
Authority
CN
China
Prior art keywords
energy level
link
energy
node
path
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
CN201910161145.2A
Other languages
Chinese (zh)
Other versions
CN109996308A (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.)
Xidian University
Original Assignee
Xidian 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 Xidian University filed Critical Xidian University
Priority to CN201910161145.2A priority Critical patent/CN109996308B/en
Publication of CN109996308A publication Critical patent/CN109996308A/en
Application granted granted Critical
Publication of CN109996308B publication Critical patent/CN109996308B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • 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

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a mobile ad hoc network routing method based on energy optimization, which comprises the following steps: acquiring the energy level E of each node; obtaining a path balance energy level RELWT according to the energy level E of the node; and selecting the path with the minimum path balance energy level as the optimal path to transmit data. The invention is based on the classic AODV protocol, uses the algorithm and the strategy of the invention to perform route discovery and route maintenance on key points, maintains some excellent performances of the AODV protocol, and simultaneously makes a compromise between route hop count and energy optimization, promotes the balanced use of network energy, avoids the chain breaking caused by the excessive use of certain node energy, reduces the times of route failure, leads the link to be more stable, simultaneously avoids the whole network paralysis problem caused by the premature exhaustion of part of node energy, and prolongs the lifetime of the network.

Description

Mobile ad hoc network routing method and device based on energy optimization
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a mobile ad hoc network routing method and device based on energy optimization.
Background
Wireless networks have become a communication field that has grown rapidly in recent years with their unique flexibility, convenience, and efficiency, and are also one of the important development directions. ad hoc network technology is a model of wireless networks that has the following advantages: without a strict control center, the communication of other nodes is not influenced under the condition that a single node or a part of nodes have faults; the independent network nodes self-form a network and do not depend on a fixed communication facility network; the multi-hop routing is completed by a common network node without special routing equipment; the method has the dynamic reconfiguration capability of the route when the topology changes, and the nodes can independently move randomly; these excellent characteristics make it an important place in civil and military communications.
The Routing protocol used by the Ad hoc network at present is mainly an Ad hoc On-Demand Distance Vector Routing protocol (AODV protocol). The protocol includes two phases of route discovery and route maintenance. In the route discovery process, a source node sends an RREQ message to a destination node, and the source node selects a path with the least hop number in a reply message as a message transmission path after receiving the RREP message of the destination node. During the following communication, the already established path needs to be maintained.
In a mobile ad hoc network, the supply of node energy is not infinite, and if the node energy is exhausted before route maintenance is carried out, the node can be out of work, and then the route discovery process needs to be restarted, which also forms a limiting factor for further improvement of the network performance. Generally, a node with heavy traffic is prone to energy shortage, for example, one or multiple hop paths simultaneously use a certain node for data forwarding, which results in that the node consumes energy quickly or even runs out. This phenomenon can shorten the effective working time of the network, cause the network link to be unstable, even cause the whole network to be paralyzed, and influence the normal operation of the network.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a mobile ad hoc network routing method and device based on energy optimization. The technical problem to be solved by the invention is realized by the following technical scheme:
a mobile ad hoc network routing method based on energy optimization comprises the following steps:
acquiring the energy level E of each node;
obtaining a path balance energy level RELWT according to the energy level E of the node;
and selecting the path with the minimum path balance energy level as the optimal path to transmit data.
In an embodiment of the present invention, the deriving the route balancing energy level RELWT according to the energy level E of the node includes:
obtaining a link energy level EL according to the energy level E of the node;
obtaining a link equalization energy level ELWT according to the link energy level EL;
and obtaining a path equalization energy level RELWT according to the link equalization energy level ELWT.
In one embodiment of the invention, the energy level E of the node is the amount of energy remaining at the node at that moment.
In one embodiment of the present invention, the deriving the link energy level EL according to the energy level E of the node comprises:
when the two nodes of the link are judged to have no intermediate node, selecting the link energy level EL as the maximum value of the threshold;
when one of the two nodes of the link is judged to be an intermediate node, selecting the link energy level EL as the energy level of the intermediate node;
and when the two nodes of the link are both the intermediate nodes, selecting the link energy level EL as the smaller value of the energy levels of the two intermediate nodes.
In one embodiment of the present invention, said deriving a link equalization energy level, eltt, from the link energy level, EL, comprises:
obtaining an equalization function F (EL) according to the link energy level EL;
the link equalization energy level ELWT is represented by a value of the equalization function f (el).
In one embodiment of the invention, the equalization function is:
Figure BDA0001984691260000031
where EL is the link energy level.
In one embodiment of the present invention, obtaining the path equalization energy level RELWT according to the link equalization energy level ELWT includes:
a path equalization energy level RELWT is calculated from the link equalization energy level ELWT.
In one embodiment of the present invention, the calculation formula of the path equalization energy level RELWT is:
Figure BDA0001984691260000032
where m is the number of hops of the path, ELWTmaxFor a link in the path to equalize the maximum of the energy level, ELminIs the minimum value of the link energy level in the path.
An energy-optimized-based mobile ad hoc network routing apparatus comprising:
the information acquisition module is used for acquiring the energy level E of each node;
the calculation module is used for obtaining a path balance energy level RELWT according to the energy level E of the node;
and the path selection module selects the path with the minimum path balance energy level as the optimal path to transmit data.
In one embodiment of the invention, the calculation module comprises:
the first calculation module is used for obtaining a link energy level EL according to the energy level E of the node;
a second calculating module, configured to obtain a link equalization energy level ELWT according to the link energy level EL;
a third calculation module, configured to obtain a path equalization energy level RELWT according to the link equalization energy level eltt.
The invention has the beneficial effects that:
the design is based on the classic AODV protocol, the algorithm and the strategy of the invention are used at key points for route discovery and route maintenance, a compromise is made between route hop count and energy optimization while some excellent performances of the AODV protocol are kept, balanced use of network energy is promoted, chain breakage caused by excessive use of energy of some nodes is avoided, the times of route failure are reduced, links are more stable, the problem of whole network paralysis caused by premature exhaustion of part of node energy is avoided, and the lifetime of the network is prolonged.
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Drawings
Fig. 1 is a schematic flow chart of a mobile ad hoc network routing method based on energy optimization according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a protocol stack model in the design of a routing algorithm according to an embodiment of the present invention;
fig. 3 is a schematic diagram of information of a RREQ message provided by an embodiment of the present invention;
fig. 4 is a schematic diagram of a mobile ad hoc network routing device based on energy optimization according to an embodiment of the present invention.
Fig. 5 is a schematic node flow chart according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to specific examples, but the embodiments of the present invention are not limited thereto.
Example one
Referring to fig. 1, fig. 1 is a flowchart illustrating a mobile ad hoc network routing method based on energy optimization according to an embodiment of the present invention.
The energy level E of the node is obtained.
The routing algorithm designed by the invention works in a network layer, and a cross-layer design idea is combined. Referring to fig. 2, fig. 2 is a schematic diagram of a protocol stack model in the design of a routing algorithm according to an embodiment of the present invention.
When the source node has a communication data request, the source node carries out route discovery, firstly, whether all entries in the self route table have an active entry containing the destination node is checked, if so, the corresponding route can be directly used, and if not, the source node has to find an available route by broadcasting the RREQ message.
In the route discovery process, the node sends out a query to the MAC layer to obtain energy information in the MAC layer. Defining E (energy) as the remaining energy value of the node at the moment, and representing the energy level of the node.
The path equalization energy level RELWT is derived from the energy level E of the node.
In this embodiment, EL (energy level) is used to represent a link energy level, and a link energy level EL is obtained according to an energy level E of a node;
when the two nodes of the link are judged to have no intermediate node, selecting the link energy level EL as the maximum value of the threshold;
when one of the two nodes of the link is judged to be an intermediate node, selecting the link energy level EL as the energy level of the intermediate node;
and when the two nodes of the link are both the intermediate nodes, selecting the link energy level EL as the smaller value of the energy levels of the two intermediate nodes.
In the present embodiment, a link between nodes a and B is taken as an example for explanation.
Definition EAAnd EBRepresenting the energy levels, EL, of node A and node B, respectivelyA，BRepresenting the link energy level between A and B, then
Link energy level EL when node a is the source node and node B is the destination node or node B is the source node and node a is the destination nodeA，BIs the maximum value of the threshold;
EL when node A (B) is the source node or the destination node, and node B (A) is the intermediate nodeA,B＝EB(EA)；
When nodes A, B are all intermediate nodes, ELA,B＝min{EA，EB}。
Defining ELWT (energy Level With Tradeoff) to represent link balance energy Level, and obtaining link balance energy Level ELWT according to link energy Level EL;
the equalization function f (EL) is derived from the link energy level EL.
In the present embodiment, an equalization function f (el) is introduced to represent the link energy level with an equalization strategy. Defining the equalization function is assigning a "1" to each link, representing the number of hops of the link, plus the inverse of the link energy level, i.e., the inverse of the link energy level
Figure BDA0001984691260000061
Taking the link between node a and node B as an example, the link equalization energy level, ELWT, is represented by the value of the equalization function f (el), then
Figure BDA0001984691260000062
In the route discovery process, a source node generates an RREQ message, and adds two fields, energy and ELWT, in the message, which are used for respectively representing energy level information of a corresponding node sending the RREQ packet and link energy level information under an equalization strategy. Referring to fig. 3, fig. 3 is a schematic diagram of information of a RREQ message according to an embodiment of the present invention. The source _ addr and the source _ sequence respectively record the IP and the serial number of the source node; RREQ _ ID is also a number to assist in determining a request packet; the dest addr and the dest _ sequence respectively record the IP and the serial number of the destination node; hop _ cnt indicates the number of hops between the node receiving and processing the RREQ packet and the source node.
After the source node generates the RREQ message, adding one to the ID field of the RREQ, and initializing relevant fields in the message, such as the IP address, the serial number, the IP address of the destination node, the serial number and the like. And setting the maximum value of the energy field, setting the ELWT to zero, and then broadcasting the initialized RREQ message to the network.
When the intermediate node receives the RREQ packet from the source node or the upstream node, the intermediate node inquires the MAC layer, reads the energy information E of the node, stores the energy information E into the energy field, calculates the link equilibrium energy level according to the rule, stores the link equilibrium energy level into the ELWT field, and then updates the RREQ message.
Obtaining a path equalization energy level RELWT according to the link equalization energy level ELWT;
in the present embodiment, the route Energy Level With the balancing policy, i.e., the path balancing Energy Level, is represented by relwt (route Energy Level With trade off). When the destination node receives the route request RREQ packet, the destination node selects the minimum value of the link energy level on the path, namely the maximum value of the link equilibrium energy level, and calculates to obtain the path equilibrium energy level rerwt, wherein the calculation formula is as follows:
Figure BDA0001984691260000071
where m denotes the number of hops of the path, ELWTmaxFor a link in the path to equalize the maximum of the energy level, ELminIs the minimum value of the link energy level in the path.
And selecting the path with the minimum balanced energy level from all paths as the optimal path to transmit data.
When the destination node receives a valid RREQ packet, it sets a Delay _ Timer Delay by a short gap for receiving more RREQ packets from different paths, and processes each RREQ packet to calculate the balanced energy level RELWT of each RREQ packet transmission path. When a destination node receives RREQ packets of k different paths, a path corresponding to the smallest RELWT is selected from the RREQ packets for response, and the path is selected as a route for data transmission, wherein the expression is as follows:
RELWTopt＝min{RELWT1,RELWT2,…,RELWTk}
the minimum RELLT value means that the hop count of the path is relatively small and the energy is sufficient, the corresponding path is the optimal path, a RREP packet is sent back along the path, and the source node can determine the available route after receiving the RREP packet.
By the route selection strategy, the protocol can select the route with higher energy level and less hop number, thereby promoting the balanced use of network energy, avoiding the chain breaking caused by the excessive use of certain node energy, reducing the times of route failure, leading the link to be more stable, simultaneously avoiding the whole network paralysis problem caused by the premature exhaustion of partial node energy, and prolonging the lifetime of the network.
The embodiment of the invention also provides a mobile ad hoc network routing device based on energy optimization, which comprises: the information acquisition module is used for acquiring the energy level E of the node; the calculation module is used for obtaining a path balance energy level RELWT according to the energy level E of the node; and the path selection module selects the path with the minimum path balance energy level as the optimal path to transmit data.
Referring to fig. 4, fig. 4 is a schematic diagram of a mobile ad hoc network routing apparatus based on energy optimization according to an embodiment of the present invention.
In one embodiment of the invention, the calculation module comprises: the first calculation module is used for obtaining a link energy level EL according to the energy level E of the node; a second calculating module, configured to obtain a link equalization energy level ELWT according to the link energy level EL; a third calculation module, configured to obtain a path equalization energy level RELWT according to the link equalization energy level eltt.
Example two
Another embodiment of the present invention provides a specific operation of different nodes in a route discovery process based on an energy-optimized mobile ad hoc network routing protocol. Referring to fig. 5, fig. 5 is a schematic node flow chart according to an embodiment of the present invention.
Route discovery is performed when there is a request for communication data in the network. Firstly, a source node checks whether all entries in a routing table of the source node have an active entry containing a destination node, if so, the source node can directly use a corresponding route to transmit data, if not, the source node generates an RREQ message, the message comprises energy level information E of the node and link energy level information ELWT under a balancing strategy, and the RREQ message is broadcasted to the whole network after being initialized. And when the RREP message of the destination node is received, selecting a corresponding path to transmit data.
When the intermediate node receives the RREQ packet from the source node or the upstream node, the intermediate node inquires the MAC layer, reads the energy information E of the node, stores the energy information E into an energy field, calculates the link balanced energy level, stores the link balanced energy level into an ELWT field, updates the RREQ message and forwards the RREQ message to the next node.
When the destination node receives the RREQ packet, it sets a Delay _ Timer Delay for a short gap to receive more RREQ packets from different paths, and processes each RREQ packet at the same time to calculate the transmission path equalization energy level RELWT of each RREQ packet. And after receiving the RREQ packets of k different paths, the destination node selects the path corresponding to the minimum RELWT from the RREQ packets to respond, sends the RREP message to the source node along the path, and updates a routing table.
The invention is based on the classic AODV protocol, uses the algorithm and the strategy of the invention to perform route discovery and route maintenance on key points, maintains some excellent performances of the AODV protocol, and simultaneously makes a compromise between route hop count and energy optimization, promotes the balanced use of network energy, avoids the chain breaking caused by the excessive use of certain node energy, reduces the times of route failure, leads the link to be more stable, simultaneously avoids the whole network paralysis problem caused by the premature exhaustion of part of node energy, and prolongs the lifetime of the network.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims (3)

1. A mobile ad hoc network routing method based on energy optimization is characterized by comprising the following steps:
acquiring the energy level E of each node; wherein the energy level E of the node is the energy value remained by the node at the moment;
obtaining a path equalization energy level RELWT according to the energy level E of the node, including:
obtaining a link energy level EL according to the energy level E of the node;
deriving a link equalization energy level, ELWT, from the link energy level, EL, comprising:
a source node generates an RREQ message; the RREQ message comprises energy and ELWT fields which respectively represent energy level information of corresponding nodes generating the RREQ message and a link balance energy level;
after data in the RREQ message is initialized, the RREQ message is broadcasted to the network;
the intermediate node receives the RREQ message, inquires the MAC layer, reads the energy information E of the node, stores the energy information E into an energy field, calculates the link balance energy level, stores the link balance energy level into an ELWT field, and updates the RREQ message; the calculation formula of the link equalization energy level is as follows:
Figure FDA0002952513470000011
wherein f (EL) represents an equalization function and the link equalization energy level ELWT is represented by the value of the equalization function f (EL), EL representing the link energy level;
obtaining a path equalization energy level RELWT according to the link equalization energy level ELWT; the method comprises the following steps:
calculating a path equalization energy level RELWT according to the link equalization energy level ELWT, wherein the calculation formula is as follows:
Figure FDA0002952513470000012
where m is the number of hops of the path, ELWTmaxFor a link in the path to equalize the maximum of the energy level, ELminIs the minimum value of the link energy level in the path;
and selecting the path with the minimum path balance energy level as the optimal path to transmit data.
2. An energy-optimized mobile ad hoc network routing method according to claim 1 wherein said deriving a link energy level EL from an energy level E of a node comprises:
when the two nodes of the link are judged to have no intermediate node, selecting the link energy level EL as the maximum value of the threshold;
when one of the two nodes of the link is judged to be an intermediate node, selecting the link energy level EL as the energy level of the intermediate node;
and when the two nodes of the link are both the intermediate nodes, selecting the link energy level EL as the smaller value of the energy levels of the two intermediate nodes.
3. An energy-based optimized mobile ad hoc network routing apparatus, comprising:
the information acquisition module is used for acquiring the energy level E of each node;
the calculation module is used for obtaining a path balance energy level RELWT according to the energy level E of the node;
the path selection module selects the path with the minimum path balance energy level as the optimal path to transmit data; wherein the calculation module comprises:
the first calculation module is used for obtaining a link energy level EL according to the energy level E of the node;
a second calculating module, configured to obtain a link equalization energy level ELWT according to the link energy level EL, and specifically configured to:
a source node generates an RREQ message; the RREQ message comprises energy and ELWT fields which respectively represent energy level information of corresponding nodes generating the RREQ message and a link balance energy level;
the intermediate node receives the RREQ message, inquires the MAC layer, reads the energy information E of the node, stores the energy information E into an energy field, calculates the link balance energy level, stores the link balance energy level into an ELWT field, and updates the RREQ message; the calculation formula of the link equalization energy level is as follows:
Figure FDA0002952513470000031
wherein f (EL) represents an equalization function and the link equalization energy level ELWT is represented by the value of the equalization function f (EL), EL representing the link energy level;
a third calculation module, configured to obtain a path equalization energy level RELWT according to the link equalization energy level eltt, where obtaining the path equalization energy level RELWT according to the link equalization energy level eltt includes:
calculating a path equalization energy level RELWT according to the link equalization energy level ELWT, wherein the calculation formula is as follows:
Figure FDA0002952513470000032
where m is the number of hops of the path, ELWTmaxFor a link in the path to equalize the maximum of the energy level, ELminIs the minimum value of the link energy level in the path.
CN201910161145.2A 2019-03-04 2019-03-04 Mobile ad hoc network routing method and device based on energy optimization Active CN109996308B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910161145.2A CN109996308B (en) 2019-03-04 2019-03-04 Mobile ad hoc network routing method and device based on energy optimization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910161145.2A CN109996308B (en) 2019-03-04 2019-03-04 Mobile ad hoc network routing method and device based on energy optimization

Publications (2)

Publication Number Publication Date
CN109996308A CN109996308A (en) 2019-07-09
CN109996308B true CN109996308B (en) 2021-05-07

Family

ID=67129569

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910161145.2A Active CN109996308B (en) 2019-03-04 2019-03-04 Mobile ad hoc network routing method and device based on energy optimization

Country Status (1)

Country Link
CN (1) CN109996308B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101951656A (en) * 2010-10-07 2011-01-19 西安电子科技大学 Method for designing wireless network routing protocol with energy efficiency and coding perception
WO2015090348A1 (en) * 2013-12-16 2015-06-25 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for data packet transmission
CN105916183A (en) * 2016-06-15 2016-08-31 上海物联网有限公司 Wireless sensor network routing method based on link quality and residual energy

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101951656A (en) * 2010-10-07 2011-01-19 西安电子科技大学 Method for designing wireless network routing protocol with energy efficiency and coding perception
WO2015090348A1 (en) * 2013-12-16 2015-06-25 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for data packet transmission
CN105916183A (en) * 2016-06-15 2016-08-31 上海物联网有限公司 Wireless sensor network routing method based on link quality and residual energy

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
A Novel Link Stability and Energy Aware Routing with Tradeoff Strategy in Mobile Ad Hoc Networks;Bingkun Xu，Yanping Li;《Journal of Communications》;20140930;正文2-3章 *
移动Ad hoc网络中具有均衡策略的稳定性路由算法;许炳昆，李艳萍;《科学技术与工程》;20141130;全文 *
移动Ad_hoc网络中基于链路稳定性和节点能量的路由算法研究;许炳昆;《中国优秀硕士论文全文数据库》;20150915;正文第3章 *

Also Published As

Publication number Publication date
CN109996308A (en) 2019-07-09

Similar Documents

Publication Publication Date Title
Zhao et al. A loose-virtual-clustering-based routing for power heterogeneous MANETs
WO2017020619A1 (en) Routing method and device
JP2005065267A (en) Method for discovering route from source node to destination node
Woungang et al. An ant-swarm inspired energy-efficient ad hoc on-demand routing protocol for mobile ad hoc networks
KR20120071953A (en) Method for transmitting routing information and routing apparatus in wireless network
CN110650511A (en) Improved AODV routing protocol based on energy consumption and load
Rajeshkanna et al. Energy Efficient Enhanced AODV Routing Protocol for maximize the lifetime of Mobile Ad hoc Networks
CN109714260B (en) Implementation method for building virtual backbone network based on UCDS algorithm in OLSR routing protocol
CN109996308B (en) Mobile ad hoc network routing method and device based on energy optimization
Periyasamy et al. Energy optimized ad hoc on-demand multipath routing protocol for mobile ad hoc networks
Abolhasan et al. LPAR: an adaptive routing strategy for MANETs
Patil et al. Extended ECDSR protocol for energy efficient MANET
Deepa et al. QoS-enabled optimized adaptive multipath AODV protocol
Barange et al. Review paper on implementation of multipath reactive routing protocol in manet
Jayakkumar et al. MIDURR: A technique to minimize the duplication of route requests in Mobile Ad-Hoc Networks
Johansson et al. An analysis of the fisheye routing technique in highly mobile ad hoc networks
KR20050023372A (en) Virtual Link Cost Routing Technology in Mobile Ad-Hoc networks
Kaur et al. Caching strategies in manet routing protocols
SreeRangaRaju et al. ZRP versus AODV and DSR: a comprehensive study on ZRP performance using QualNet simulator
Sharma et al. ORSM: an optimized routing scheme for MANETs
KR100551634B1 (en) SYSTEM AND METHOD FOR CONTROLLING HELLO MESSAGE'S TIME TO LIVE OF Mobile Ad-hoc NETWORK
Zhou et al. Smf: A novel lightweight reliable service discovery approach in manet
Avudainayagam et al. DEAR: a device and energy aware routing protocol for mobile ad hoc networks
Kute et al. A Review: MANET routing protocols and different types of attacks in MANET
Chen et al. A Game Theory Perspective on IP Routing Protocols Evaluation

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant