CN110139304A - MPR set option method based on isolated degree and non-MPR node - Google Patents
MPR set option method based on isolated degree and non-MPR node Download PDFInfo
- Publication number
- CN110139304A CN110139304A CN201910391162.5A CN201910391162A CN110139304A CN 110139304 A CN110139304 A CN 110139304A CN 201910391162 A CN201910391162 A CN 201910391162A CN 110139304 A CN110139304 A CN 110139304A
- Authority
- CN
- China
- Prior art keywords
- node
- mpr
- degree
- neighbor
- added
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- 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/023—Limited or focused flooding to selected areas of a network
-
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention proposes the MPR set option method based on isolated degree and non-MPR node, belongs to wireless Mesh netword area of agreement.For MPR selection algorithm in standard OLSR agreement, global optimum's MPR Set problem can not be acquired, a large amount of TC grouping will be generated in the environment of great deal of nodes access simultaneously, so as to cause network congestion and load imbalance, the present invention is on OLSR protocol basis, the storing data of neighbor node is expanded into three hop neighbor nodes, propose the selection algorithm based on isolated degree and based on non-MPR node, the independent angle value of comparison node or non-MPR nodal value determine optimal MPR node, the case where avoiding random selection MPR node, and it carries out improvement to underlying protocol code and has repaired with optimization to pass through, never the generation of TC message in whole network is reduced, to improve the total handling capacity of network, Packet delivery fractions.
Description
Technical field
The present invention relates to the wireless Mesh netword communications fields, more particularly to the MPR collection based on isolated degree and non-MPR node
Close selection method.
Background technique
With internet (Internet), Internet of Things (Internet of Things, IoT), car networking (vehichlar
Ad-hoc networks, VANETS) and other self-organizing networks fast development, drive various wireless-transmission network technologies
Development, people are also higher and higher for the demand of network and expectation, are not intended merely to connect upper internet whenever and wherever possible and steadily,
And it is hoped that there will be diversified network services.WLAN (Wireless Local Area, WLAN), wireless broadband Internet access
Net (Wireless Broadband ACCHess Network, WBAN) and Worldwide Interoperability for Microwave access (Worldwide
Interoperability for Microwave ACCHess, WiMAX) etc. various network Developments, can meet people major part
Demand, but the occasions such as social event great for city, large-scale activity guarantee, disaster disaster assistance, the communication of standard
System cannot fully meet practical emergency and deploy to ensure effective monitoring and control of illegal activities demand, and it is very crucial to ensure that these activities operate normally society, therefore
It designs and optimizes extremely important suitable for these movable networks.
In OLSR agreement, broadcast message in network can be effectively reduced by selection MPR node and flooded, network operation is overcome
The big disadvantage of expense, and be widely used in the big network environment of density.Since the TC message number and MPR that generate in network save
Point is proportional, therefore many researchers study MPR selection algorithm these years, and the MPR selection algorithm in standard OLSR agreement is to make
Look for MPR collection with greedy algorithm, belong to np hard problem, the result obtained in this way generally can be close to globally optimal solution rather than
Global optimum, it is applied in MPR selection although there is some heuritic approaches to be studied, they are all very complicated, such as
Fruit MPR selection algorithm is inherently very complicated, then providing an approximation MPR collection optimal solution will be highly difficult.The selection of MPR set
It is extremely important, great influence is caused to network performance.
It is added to MPR set in order to reduce to obtain locally optimal solution probability and unnecessary MPR node, Li et al. people proposes
A kind of algorithm of NFA (Necessity First of selecting Algorithm) removes selection MPR node, and core is ought not
When in the presence of the two-hop neighbor node that can only could be connected by a hop neighbor node, covering minimum number two-hop neighbor node is deleted
A hop neighbor node, i.e. these nodes can not obtain the chance as MPR node, reduce the selected hop neighbor of covering at this time
The quantity of node, and increase necessity of remaining hop neighbor node as connection two-hop neighbor node.
For the algorithm compared with standard OLSR agreement, maximum difference is the hop neighbor section for deleting minimum covering quantity
Point, main improve are unlike selecting MPR node according to overlay node ability sequence in canonical algorithm, it is possible to reduce between node
The case where intersecting improves canonical algorithm to a certain extent.
Although NFA algorithm has above advantages, as the MPR that two both candidate nodes have identical chance to be added to host node
When collection, a node can be randomly choosed and be added, the node selected in such cases not necessarily has Global Optimality.Therefore this hair
It is bright to propose a kind of MPR selection algorithm based on isolated degree and non-MPR node, guarantee that it must be complete for selecting MPR node every time
Office's optimal solution.
Summary of the invention
In order to solve in OLSR agreement, broadcast message in network can be effectively reduced by selection MPR node and flooded, overcome
The big disadvantage of network operation expense, and be widely used in the big network environment of density.Due to the TC message count generated in network
Amount is proportional to MPR node, therefore many researchers study MPR selection algorithms these years, the MPR selection in standard OLSR agreement
Algorithm is that MPR collection is looked for using greedy algorithm, belongs to np hard problem, and the result obtained in this way generally can be close to global optimum
Solution rather than global optimum, are applied in MPR selection, they are all very although there is some heuritic approaches to be studied
Complexity, if MPR selection algorithm is inherently very complicated, providing an approximation MPR collection optimal solution will be highly difficult, the present invention
MPR set option method based on isolated degree and non-MPR node is provided, guarantee to select every time MPR node must be it is global most
Excellent solution reduces the conflict of WMN link to reduce the generation of middle TC message in whole network, for this purpose, the present invention provides base
In the MPR set option method of isolated degree and non-MPR node, the method includes the following steps:
(1) the hop neighbor set N (u) and two-hop neighbors set N2 (u) for detecting host node, calculate each node in N (u)
Connection number；
(2) by N_willingness highest and be non-zero accessibility node be added to MPR set in；
(3) node that will connect greater number node in N2 (u) is added in MPR set；
(4) the bigger node of D (y) is added to MPR set；
(5) the bigger node of isolated degree or non-MPR degree is added to MPR set.
Be further improved as structure of the invention, in the step (1) a hop neighbor set N (u) of detection host node and
Two-hop neighbors set N2 (u), specific steps are as follows:
Step 2.1: the relationship between detection N (u) and N2 (u) node, if some node is in connection N2 (u) in N (u)
This node is added in the MPR set of host node by the exclusive node of some node.
It is further improved as structure of the invention, by N_willingness highest and be that non-zero is reachable in the step (2)
Property node be added to MPR set in, specific steps are as follows:
Step 3.1: not being N (u) node of uniquely coupled N2 (u) after step 2.1 is executed, select in neighbor information table
The maximum node of N_willingness, and whether be STATUS_SYM according to the N_status of this node in neighbor information table,
If it is this node is added in MPR set, and deletes the node in the N2 (u) of the coverage.
It is further improved as structure of the invention, the node of greater number node in N2 (u) will be connected in the step (3)
It is added in MPR set, specific steps are as follows:
Step 4.1: if all neighbor node N_willingness are identical, MPR node can not be selected, compare N
(u) node of most quantity N2 (u) nodes of connection is added to MPR set in.
It is further improved as structure of the invention, the bigger node of D (y) is added to MPR set in the step (4),
Specific steps are as follows:
Step 5.1: if all nodes all connect N2 (u) node of identical quantity in N (u), MPR node can not be selected,
The bigger node of D (y) value is added in MPR set, wherein D (y) refers to that host node can only be connected to N2 (u) by this node
Node number.
It is further improved as structure of the invention, the bigger node of isolated degree or non-MPR degree is added in the step (5)
Gather to MPR, specific steps are as follows:
Step 6.1: if there is multiple identical highest D (y) values in step (5), MPR node can not be selected, due to mark
HELLO message does not provide source node three hop neighbor nodal informations in quasi- OLSR agreement, modifies to HELLO message format,
Reserved field is divided into two, each section is a byte, and first part is still Reserved field, and second part is
Newly added Degree field, for indicating isolated degree or non-MPR degree；
Reversed field is necessarily arranged to " 0000000000000 " in table, meets compiling specification；Degree field is used to
Indicate isolated degree or non-MPR degree；Htime field is the publication interval of HELLO message, i.e., distance next time transmit by HELLO message
Time；Willingness refers to that node carries and be sent to the wish of other nodes, if this field of a point is
WILL_NEVER can not be selected as MPR by other points, if this field of a point is that WILL_ALWAYS can be always chosen as
MPR, this field of general default node are WILL_DEFAULT；Link Code field refers to all neighbours for sending end interface and he
The information for occupying link between interface, also indicates that the information of neighbor state, general Linktype include asymmetric link, symmetric links,
Failed link and default situations, Neighbor Types have MPR node, symmetrical neighbor node and asymmetric neighbor node；LinkMessage
This field of Size refers to the size of link information, is counted as unit of byte, is started by the domain Link Code to next
The distance that the domain Link Code terminates measures link information size, if expression is message end without other Linktypes；
Neighbor Interface Address represents the interface IP address of neighbor node；
Step 6.2: while needing to add a new field N_degree in neighbor information table to save neighbor node
Isolated degree and non-MPR degree information, when a node receives HELLO message from its neighbor node, it will be updated storage
The N_degree field of neighbor node in neighbor information table can select a jump when a node has to select its MPR
N_degree value is higher in neighbor node is used as MPR, can reach all symmetrical two-hop neighbor nodes by this；
N_neighbor_main_addr indicates the main address of neighbor node in table；The shape of N_status expression neighbor node
State, whether instruction inter-node link is symmetrical, and symmetric formulation is STATUS_SYM in agreement, and asymmetry is STATUS_NOT_SYM；
N_willingness indicates that neighbor node is the meaning that other nodes forward TC grouping in network with the integer representation between 0 to 7
Hope degree, agreement regulation in OLSR_WILL_NEVER be 0, OLSR_WILL_DEFAULT 3, OLSR_WILL_ALWAYS 7；N_
Degree is come the isolated degree of neighbor node in saving and non-MPR degree information.
It is further improved as structure of the invention, NS3 network simulator, using random in 1500*1500 square region
Distribution network router, emulation begin with 50 routers, as the time increases, are continuously increased router number, Zhi Daoda
To 100 routers, data package size 512bytes, discharge model uses CBR and udp protocol.
The application's has the beneficial effect that:
The present invention carries out emulation testing on NS3 network simulator, uses the random scatter in 1500*1500 square region
Network router, emulation begin with 50 routers, as the time increases, router number are continuously increased, until reaching 100
A router, the specific parameter that is arranged are shown in that working as 100 router nodes is all added in network, compares standard using independent degree algorithm
Algorithm TC data packet number reduces about 12.5%, and the algorithm TC data packet number using non-MPR degree algorithm than standard is reduced about
13.7%, on the other hand, using the algorithm comparison with standard MPR selection algorithm total throughout point based on isolated degree and non-MPR node
16.5% and 14.6% are not improved, and comparison with standard OLSR agreement MPR selection algorithm data packet is delivered success rate and improved about
6%.
Detailed description of the invention
Overall flow of the Fig. 1 based on isolated degree and non-MPR node algorithm；
Fig. 2 is based on isolated degree algorithm exemplary diagram；
Fig. 3 is based on non-MPR node algorithm exemplary diagram.
Specific embodiment
Present invention is further described in detail with specific embodiment with reference to the accompanying drawing:
The present invention provides the MPR set option method based on isolated degree and non-MPR node, guarantees to select MPR section every time
Point must be globally optimal solution, to reduce the generation of TC message in whole network, reduce the conflict of WMN link.
As the specific embodiment of the invention, for a kind of MPR set option method based on isolated degree and non-MPR node,
Shown in overall flow Figure of description 1, include the following steps:
Step 1: detecting the hop neighbor set N (u) and two-hop neighbors set N2 (u) of host node, calculate each in N (u)
The connection number of node.
The relationship between N (u) and N2 (u) node is detected, if some node is some node in connection N2 (u) in N (u)
Exclusive node, by this node be added to host node MPR set in.
Step 2: step 1 is executed in posterior nodal point, the maximum node of N_willingness in neighbor information table is selected,
And whether it is STATUS_SYM according to the N_status of this node in neighbor information table, is if it is added to this node
In MPR set, and delete the node in the N2 (u) of the coverage.
Step 3: if all neighbor node N_willingness of step 2 are identical, MPR node can not be selected, needed
Continue the node of most quantity N2 (u) nodes of connection in N (u) being added to MPR set.
Step 4: if all N (u) nodes all connect N2 (u) node of identical quantity in step 3, MPR can not be selected
The bigger node of D (y) value is added in MPR set by node, and wherein D (y) refers to that host node can only be connected to by this node
N2 (u) node number.
Step 5: if there is multiple identical highest D (y) values in step 4, MPR node can not be selected, due to standard
HELLO message does not provide source node three hop neighbor nodal informations in OLSR agreement, modifies to HELLO message format, will
Reserved field is divided into two, and each section is a byte, and first part is still Reserved field, and second part is new
The Degree field of addition, for indicating isolated degree or non-MPR degree.HELLO message format after extension is shown in Table 1.
HELLO message format after the extension of table 1
Step 6: needing to add a new field N_degree in neighbor information table on the basis of step 5 to save neighbour
Occupy node isolated degree and non-MPR degree information, when a node receives HELLO message from its neighbor node, it can more
The N_degree field for being newly stored in neighbor node in neighbor information table can be selected when a node has to select its MPR
It is higher as MPR to select N_degree value in a hop neighbor node, degree algorithm is as shown in Fig. 2 based on isolating, and is based on non-MPR degree
Algorithm is as shown in Fig. 3, can reach all symmetrical two-hop neighbor nodes by this.Neighbor information table after extension is shown in Table 2
It is shown.
Neighbor information table after the extension of table 2
| N_neighbor_main_addr | N_status | N_willingness | N_degree |
Parametric environmental setting such as table 3 shows.
3 simulated environment parameter setting of table
Simulation result such as table 4 shows.
So far the training and reasoning process of the MPR set option method based on isolated degree and non-MPR node are just completed.
The above described is only a preferred embodiment of the present invention, being not the limit for making any other form to the present invention
System, and made any modification or equivalent variations according to the technical essence of the invention, still fall within present invention model claimed
It encloses.
Claims (7)
1. the MPR set option method based on isolated degree and non-MPR node, it is characterised in that: the method includes following step
It is rapid:
(1) the hop neighbor set N (u) and two-hop neighbors set N2 (u) for detecting host node, calculate the company of each node in N (u)
Connect number；
(2) by N_willingness highest and be non-zero accessibility node be added to MPR set in；
(3) node that will connect greater number node in N2 (u) is added in MPR set；
(4) the bigger node of D (y) is added to MPR set；
(5) the bigger node of isolated degree or non-MPR degree is added to MPR set.
2. the MPR set option method according to claim 1 based on isolated degree and non-MPR node, it is characterised in that: institute
State the hop neighbor set N (u) and two-hop neighbors set N2 (u) of detection host node in step (1), specific steps are as follows:
Step 2.1: the relationship between detection N (u) and N2 (u) node, if some node is some in connection N2 (u) in N (u)
This node is added in the MPR set of host node by the exclusive node of node.
3. the MPR set option method according to claim 1 based on isolated degree and non-MPR node, it is characterised in that: institute
State in step (2) by N_willingness highest and be non-zero accessibility node be added to MPR set in, specific steps are as follows:
Step 3.1: not being N (u) node of uniquely coupled N2 (u) after step 2.1 is executed, select the N_ in neighbor information table
The maximum node of willingness, and whether be STATUS_SYM according to the N_status of this node in neighbor information table, such as
Fruit is, this node is added in MPR set, and deletes the node in the N2 (u) of the coverage.
4. the MPR set option method according to claim 1 based on isolated degree and non-MPR node, it is characterised in that: institute
It states in the node addition MPR set that will connect greater number node in N2 (u) in step (3), specific steps are as follows:
Step 4.1: if all neighbor node N_willingness are identical, MPR node can not be selected, compared in N (u)
The node for connecting most quantity N2 (u) nodes is added to MPR set.
5. the MPR set option method according to claim 1 based on isolated degree and non-MPR node, it is characterised in that: institute
It states in step (4) and the bigger node of D (y) is added to MPR set, specific steps are as follows:
Step 5.1: if all nodes all connect N2 (u) node of identical quantity in N (u), MPR node can not be selected, by D
(y) the bigger node of value is added in MPR set, and wherein D (y) refers to that host node can only be connected to N2 (u) section by this node
Point number.
6. the MPR set option method according to claim 1 based on isolated degree and non-MPR node, it is characterised in that: institute
It states in step (5) and the bigger node of isolated degree or non-MPR degree is added to MPR set, specific steps are as follows:
Step 6.1: if there is multiple identical highest D (y) values in step (5), MPR node can not be selected, due to standard
HELLO message does not provide source node three hop neighbor nodal informations in OLSR agreement, modifies to HELLO message format, will
Reserved field is divided into two, and each section is a byte, and first part is still Reserved field, and second part is new
The Degree field of addition, for indicating isolated degree or non-MPR degree；
Reversed field is necessarily arranged to " 0000000000000 " in table, meets compiling specification；Degree field is used to indicate
Isolated degree or non-MPR degree；Htime field is the publication interval of HELLO message, i.e., distance next time HELLO message transmission when
Between；Willingness refers to that node carries and be sent to the wish of other nodes, if this field of a point is WILL_
NEVER can not be selected as MPR by other points, if this field of a point is that WILL_ALWAYS can always be chosen as MPR, one
As this field of default node be WILL_DEFAULT；Link Code field refers to all neighbours' interfaces for sending end interface and he
Between link information, also indicate that the information of neighbor state, general Linktype includes asymmetric link, symmetric links, stale link
Road and default situations, Neighbor Types have MPR node, symmetrical neighbor node and asymmetric neighbor node；Link Message Size
This field refers to the size of link information, is counted as unit of byte, is started by the domain Link Code to next Link
The distance that the domain Code terminates measures link information size, if expression is message end without other Linktypes；
Neighbor Interface Address represents the interface IP address of neighbor node；
Step 6.2: while needing to add a new field N_degree in neighbor information table to save the orphan of neighbor node
Vertical degree and non-MPR degree information, when a node receives HELLO message from its neighbor node, it, which will be updated, is stored in neighbour
The N_degree field for occupying neighbor node in information table can select a hop neighbor when a node has to select its MPR
N_degree value is higher in node is used as MPR, can reach all symmetrical two-hop neighbor nodes by this；
N_neighbor_main_addr indicates the main address of neighbor node in table；N_status indicates the state of neighbor node,
Indicate whether inter-node link is symmetrical, symmetric formulation is STATUS_SYM in agreement, and asymmetry is STATUS_NOT_SYM；N_
Willingness indicates that neighbor node is the wish that other nodes forward TC grouping in network with the integer representation between 0 to 7
It spends, OLSR_WILL_NEVER is 0, OLSR_WILL_DEFAULT 3, OLSR_WILL_ALWAYS 7 in agreement regulation；N_
Degree is come the isolated degree of neighbor node in saving and non-MPR degree information.
7. the MPR set option method according to claim 1 based on isolated degree and non-MPR node, it is characterised in that: base
As follows in the experiment porch of isolated degree and the established model of MPR set option method of non-MPR node: NS3 network simulator makes
The random scatter network router in 1500*1500 square region, emulation begins with 50 routers, as the time increases
It is long, it is continuously increased router number, until reaching 100 routers, data package size 512bytes, discharge model is used
CBR and udp protocol.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910391162.5A CN110139304B (en) | 2019-05-11 | 2019-05-11 | MPR set selection method based on isolation degree and non-MPR nodes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910391162.5A CN110139304B (en) | 2019-05-11 | 2019-05-11 | MPR set selection method based on isolation degree and non-MPR nodes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110139304A true CN110139304A (en) | 2019-08-16 |
| CN110139304B CN110139304B (en) | 2022-06-10 |
Family
ID=67573448
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910391162.5A Active CN110139304B (en) | 2019-05-11 | 2019-05-11 | MPR set selection method based on isolation degree and non-MPR nodes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110139304B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114727354A (en) * | 2022-03-30 | 2022-07-08 | 江苏杰泽罗通信科技有限公司 | Clustering optimal link state routing method based on virtual backbone network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101547491A (en) * | 2009-04-15 | 2009-09-30 | 电子科技大学 | Routing method for mobile ad hoc network system |
| CN107645711A (en) * | 2016-07-21 | 2018-01-30 | 北京信威通信技术股份有限公司 | A kind of method and device of network route |
| CN109104366A (en) * | 2018-08-29 | 2018-12-28 | 重庆大学 | A kind of link duration calculation method, MPR node selecting method and Routing Protocol |
| CN109586834A (en) * | 2018-12-26 | 2019-04-05 | 中国电子科技集团公司第二十研究所 | A kind of method that non-cutting time benchmark automatically selects |
-
2019
- 2019-05-11 CN CN201910391162.5A patent/CN110139304B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101547491A (en) * | 2009-04-15 | 2009-09-30 | 电子科技大学 | Routing method for mobile ad hoc network system |
| CN107645711A (en) * | 2016-07-21 | 2018-01-30 | 北京信威通信技术股份有限公司 | A kind of method and device of network route |
| CN109104366A (en) * | 2018-08-29 | 2018-12-28 | 重庆大学 | A kind of link duration calculation method, MPR node selecting method and Routing Protocol |
| CN109586834A (en) * | 2018-12-26 | 2019-04-05 | 中国电子科技集团公司第二十研究所 | A kind of method that non-cutting time benchmark automatically selects |
Non-Patent Citations (1)
| Title |
|---|
| 张洪等: "一种新型MPR集选择算法", 《成都大学学报（自然科学版）》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114727354A (en) * | 2022-03-30 | 2022-07-08 | 江苏杰泽罗通信科技有限公司 | Clustering optimal link state routing method based on virtual backbone network |
| CN114727354B (en) * | 2022-03-30 | 2023-12-01 | 江苏杰泽罗通信科技有限公司 | Clustering optimal link state routing method based on virtual backbone network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110139304B (en) | 2022-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wu et al. | A generic distributed broadcast scheme in ad hoc wireless networks | |
| WO2020125454A1 (en) | Information processing method, system and apparatus | |
| Ishibashi et al. | Topology and mobility considerations in mobile ad hoc networks | |
| Rajput et al. | Comparison of ad-hoc reactive routing protocols using opnet modeler | |
| Jardosh et al. | A survey: Topology control for wireless sensor networks | |
| Shang et al. | An energy efficient localized topology control algorithm for wireless multihop networks | |
| Mu et al. | Performance analysis of the ZigBee networks in 5G environment and the nearest access routing for improvement | |
| CN110139304A (en) | MPR set option method based on isolated degree and non-MPR node | |
| Tseng et al. | Power efficient topology control in wireless ad hoc networks | |
| Al-Harbawi et al. | Utilizing neighbours-table to improve tree routing protocol in ZigBee network | |
| Liu et al. | A novel tree-based routing protocol in ZigBee wireless networks | |
| Huang et al. | A backbone-aware topology formation (BATF) scheme for ZigBee wireless sensor networks | |
| Lin et al. | Minimum cost wireless broadband overlay network planning | |
| Chen et al. | Autonomic self‐organization architecture for wireless sensor communications | |
| Quy et al. | An adaptive on-demand routing protocol with QoS support for urban-MANETs | |
| Selvi et al. | Minimum Degree Connected Dominant Set Unequal Clustering For Wireless Sensor Networks (Mind-CDS). | |
| CN104968019B (en) | Based on the wireless sense network tree topology generation method for improving breadth first search | |
| Adekiigbe et al. | Issues and challenges in clustering techniques for wireless mesh networks | |
| Bentaleb et al. | A k-hop scalable management scheme for large scale mobile ad hoc networks | |
| Wang et al. | Improvement and optimization of a mobile multi-agent AODV routing protocol | |
| Tuan et al. | Coverage and connectivity-aware clustering within k hops in wireless sensor and actuator networks | |
| Pillai et al. | DBSCAN-R: A Machine Learning Approach for Routing in Opportunistic Networks | |
| Bhende et al. | Extending Lifetime of Wireless Sensor Network Using Connected Dominating Set and Energy Harvester | |
| Lavric et al. | Performance evaluation of WSN topology control algorithms that can be used in the Smart City concept | |
| Chakraborty et al. | Load and energy aware topology control in wireless ad-hoc networks |
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 |