CN114520960A - 一种多子网无线网络的mpr集合选择方法 - Google Patents
一种多子网无线网络的mpr集合选择方法 Download PDFInfo
- Publication number
- CN114520960A CN114520960A CN202210083159.9A CN202210083159A CN114520960A CN 114520960 A CN114520960 A CN 114520960A CN 202210083159 A CN202210083159 A CN 202210083159A CN 114520960 A CN114520960 A CN 114520960A
- Authority
- CN
- China
- Prior art keywords
- node
- subnet
- sub
- network
- link
- 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
- 238000010187 selection method Methods 0.000 title abstract description 10
- 238000000034 method Methods 0.000 claims description 4
- 238000005259 measurement Methods 0.000 claims description 3
- 230000000717 retained effect Effects 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 abstract description 11
- 238000004891 communication Methods 0.000 abstract description 9
- 238000009792 diffusion process Methods 0.000 abstract description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000013442 quality metrics Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- 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/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- 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/248—Connectivity information update
-
- 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)
- Multimedia (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明公开了一种多子网无线网络的MPR集合选择方法,尤其适用于无线MESH网络和多子网通信系统进行广播路由领域。本发明采用链路可用带宽、链路状态信息及链路质量一起作为依据选择最优路径,包括:子网间通过本子网内其他节点收到其他子网的消息报的可用带宽,链路状态信息及链路质量等携带的信息共同推举最优子网间中继节点,通过中继节点定向广播扩散拓扑信息,从而能够实现多子网间消息的快速有效传播。这种MPR选择方法可以根据节点态势的变化,动态实时的选举子网间中继节点,可以减少网络传输开销,减小网络消息泛滥,也可以提高网络的整体性能。
Description
技术领域
本发明涉及无线子网组网领域,尤其涉无线MESH网络和多子网通信系统进行广播路由领 域。
背景技术
多个子网之间相互连接通信需要有中继节点来桥接两个子网,因此多个子网之间选取中 继节点对于多子网间。标准的OLSR协议中MPR选择算法应用于子网间,则会产生多个中继节 点,特别是在密度大的网络环境中,过多的中继节点会产生消息泛洪,会存在计算量大、网 络传输开销大等缺点。若中继节点通信链路质量差,会造成子网间通信效果差;若中继节点 可以用带宽较少,却需要承载较大的数据量会导致链路信息传输不完整;若中继节点连接的 邻居节点数量较少,会导致扩散整个网络的效率低下。因此子网间中继节点合理的选择对网 络的性能非常重要。在现有技术中,没有对子网间最优MPR集的选择作出相关研究。
发明内容
在无线多子网组网领域内子网与子网间网络的扩散取决于中继节点的选择,中继节点选 取过多的话,会存在计算量大、重复传输、网络传输开销大、传输效率低下等缺点,因此子 网间中继节点合理的选择尤为重要。本发明提出了一种多子网无线网络的MPR集合选择方法, 保证每次选择出的MPR节点是子网间中继节点的最优解。
为了解决上述技术问题,本发明是通过以下技术方案实现的:
步骤一:各节点广播消息报,消息报包含本子网号、链路可用带宽、链路状态信息及链 路质量等信息;
步骤二:各节点收到消息报判断是否为本子网节点,若为本子网节点,则按照标准的OLSR 协议选取MPR集合;若非本节点,则按子网号更新子网间连接信息库,并在子网内部信息共 享;
步骤三:根据子网内部存储的消息报,判断子网内该节点在该方向上可利用带宽减去子 网间需求带宽后的剩余可用带宽是否大于0;若大于0,则存储该信息报,并记录该节点直连 的邻居个数及该链路质量的量度;若小于0,则丢弃该节点在该方向上的消息报,直到遍历 结束;
步骤四:根据留存下来的消息报,给出直连邻居个数和链路质量的权重,推举得分最高 的节点为子网间中继节点。
得分=((邻居个数)*0.3+(链路质量的量度)*0.7)*可利用带宽
本发明提出的一种多子网无线网络的MPR集合选择方法,子网间通过中继节点定向广播 扩散拓扑信息,从而能够实现多子网间消息的快速有效传播。这种MPR选择方法可以根据节 点态势的变化,动态实时的选举子网间中继节点,可以减少中继节点个数从而减少网络传输 开销,减少子网间节点信息交互个数,避免重复传输,达到提高传输效率的效果,可以减小 网络消息泛滥,网络收敛速度快,也可以提高网络的整体性能。
附图说明
图1多子网无线网络的MPR集合选择方法流程图。
图2多子网无线网络节点实施例示意图。
具体实施方式
下面结合附图对本发明做进一步说明。
本发明公开的一种多子网无线网络的MPR集合选择方法,尤其适用于无线MESH网络和多 子网通信系统进行广播路由领域。本发明根据各个节点发送的消息报,根据子网之间接收到 的其他节点携带的链路可用带宽、链路状态信息及链路质量等信息,在确保本节点在某方位 上的可利用带宽能够满足该子网间节点通信带宽的前提下,根据链路的状态信息及链路质量 信息综合的评估该节点是否能够胜任子网间中继节点,子网内部节点综合评判推举最优子网 间中继节点。由子网间中继节点完成子网之间拓扑信息的交互,进而使得本发明完成子网与 子网间MPR集合的选择。
图2中以A、B、C三个节点组成的无线子网1,1-10十个节点组成的无线子网2及节点a、b、d三个节点组成的无线子网3为例,假设其邻居关系如图2所示,子网2的节点3和 节点5能够收到子网1的节点A、C消息报,子网2的节点2、5、7能够收到子网3的节点a、 b的消息报。子网间的MPR集合选择根据多子网无线网络的MPR集合选择方法具体实现过 程如下:
(1)第一步,各节点广播消息报,消息报包含本子网号、链路可用带宽、链路状态信息 及链路质量等信息。
(2)第二步,各节点收到消息报判断是否为本子网节点,若为本子网节点,则按照标准 的OLSR协议选取MPR集合;若非本节点,则按子网号更新子网间连接信息库,并在子网内部信息共享。
(7)第三步,子网2内部的节点3和节点5共享子网1节点A和C的信息,共同选举 与子网间相连的中继节点。
(8)第四步,子网2内部的节点2、5、7共享子网3节点a和b的信息,共同选举与子 网间相连的中继节点。
其中,第三、四步的动态选举子网间MPR集合流程举例如下:
(1)第一步,根据图1的流程图,判断出各个节点在该方向上可利用带宽是否满足收到 节点的通信需求带宽,计算出各个节点子网内直连的邻居节点个数。此处假设可利用带宽均 满足通信带宽需求,存储该信息报,并记录节点3子网内直连的邻居个数为1;同理,节点5 子网内直连的邻居个数为2,节点2子网内直连的邻居个数为2,节点7子网内直连的邻居个 数为1,节点A子网内直连的邻居个数为1,节点C子网内直连的邻居个数为2,节点a子网 内直连的邻居个数为1,节点b子网内直连的邻居个数为1。
(2)第二步,根据留存下来的消息报,给出直连邻居个数和链路质量的权重计算得分, 得分=((邻居个数)*0.3+(链路质量的量度)*0.7)*可利用带宽。假设节点3和节点5与节点C 的链路质量的量度相同,节点2与节点a的链路质量量度高于节点5与节点a的质量量度。 依据公式得出推举节点5和节点C为子网间中继节点,推举节点2和节点a为子网间中继节 点。
Claims (1)
1.一种多子网无线网络的MPR集合选择方法,其特征在于:
步骤一:各节点广播消息报,消息报包含本子网号、链路可用带宽、链路状态信息及链路质量信息;
步骤二:各节点收到消息报判断是否为本子网节点,若为本子网节点,则按照标准的OLSR协议选取MPR集合;若非本节点,则按子网号更新子网间连接信息库,并在子网内部信息共享;
步骤三:根据子网内部存储的消息报,判断子网内该节点在该方向上可利用带宽减去子网间需求带宽后的剩余可用带宽是否大于0;若大于0,则存储该信息报,并记录该节点直连的邻居个数及该链路质量的量度;若小于0,则丢弃该节点在该方向上的消息报,直到遍历结束;
步骤四:根据留存下来的消息报,给出直连邻居个数和链路质量的权重,推举得分最高的节点为子网间中继节点:
得分=((邻居个数)*0.3+(链路质量的量度)*0.7)*可利用带宽。
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210083159.9A CN114520960B (zh) | 2022-01-25 | 2022-01-25 | 一种多子网无线网络的mpr集合选择方法 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210083159.9A CN114520960B (zh) | 2022-01-25 | 2022-01-25 | 一种多子网无线网络的mpr集合选择方法 |
Publications (2)
Publication Number | Publication Date |
---|---|
CN114520960A true CN114520960A (zh) | 2022-05-20 |
CN114520960B CN114520960B (zh) | 2024-03-19 |
Family
ID=81597409
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210083159.9A Active CN114520960B (zh) | 2022-01-25 | 2022-01-25 | 一种多子网无线网络的mpr集合选择方法 |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114520960B (zh) |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100020721A1 (en) * | 2006-10-05 | 2010-01-28 | Daryl Parker | Arrangement and Method Relating to Routing of IP Traffic in Mobile Wireless Newtorks |
WO2017020619A1 (zh) * | 2015-08-04 | 2017-02-09 | 中兴通讯股份有限公司 | 一种路由的方法及装置 |
US20170339045A1 (en) * | 2016-05-20 | 2017-11-23 | Thales | System and method for transmitting data |
CN107567067A (zh) * | 2017-07-20 | 2018-01-09 | 华南理工大学 | 一种mpr算法的改进方法 |
CN109639588A (zh) * | 2019-01-22 | 2019-04-16 | 中国人民解放军空军工程大学 | 一种面向航空集群的网络拥塞控制路由方法 |
CN111669798A (zh) * | 2020-05-28 | 2020-09-15 | 华南理工大学 | 一种olsr路由协议控制信息动态生成方法 |
-
2022
- 2022-01-25 CN CN202210083159.9A patent/CN114520960B/zh active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100020721A1 (en) * | 2006-10-05 | 2010-01-28 | Daryl Parker | Arrangement and Method Relating to Routing of IP Traffic in Mobile Wireless Newtorks |
WO2017020619A1 (zh) * | 2015-08-04 | 2017-02-09 | 中兴通讯股份有限公司 | 一种路由的方法及装置 |
US20170339045A1 (en) * | 2016-05-20 | 2017-11-23 | Thales | System and method for transmitting data |
CN107567067A (zh) * | 2017-07-20 | 2018-01-09 | 华南理工大学 | 一种mpr算法的改进方法 |
CN109639588A (zh) * | 2019-01-22 | 2019-04-16 | 中国人民解放军空军工程大学 | 一种面向航空集群的网络拥塞控制路由方法 |
CN111669798A (zh) * | 2020-05-28 | 2020-09-15 | 华南理工大学 | 一种olsr路由协议控制信息动态生成方法 |
Non-Patent Citations (3)
Title |
---|
FADILA KHADAR ET AL: ""Towards an Efficient QoS Based Selection of Neighbors in QOLSR"", 《2010 IEEE 30TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS》, 11 November 2010 (2010-11-11) * |
HADI OTROK ET AL: ""A cluster-based model for QoS-OLSR protocol"", 《2011 7TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE》, 11 August 2011 (2011-08-11) * |
郑贵文;唐峥钊;: "基于OLSR协议的无线MESH网络系统设计", 现代导航, no. 04, 15 August 2020 (2020-08-15) * |
Also Published As
Publication number | Publication date |
---|---|
CN114520960B (zh) | 2024-03-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Chen et al. | Connectivity based k-hop clustering in wireless networks | |
So et al. | A routing protocol for utilizing multiple channels in multi-hop wireless networks with a single transceiver | |
Nocetti et al. | Connectivity based k-hop clustering in wireless networks | |
US8270302B2 (en) | System and method for providing an adaptive value of TTL (time to live) for broadcast/multicast messages in a mesh network using a hybrid wireless mesh protocol | |
US7580382B1 (en) | System and method for distributed channelized group formation in a mobile wireless communication network | |
Gui et al. | Scalable multicasting in mobile ad hoc networks | |
EP2030373B1 (en) | Method and apparatus for scale-free topology generation in relay based wireless networks | |
CN110943920B (zh) | 一种基于无线自组织网络的分布式簇头选举方法 | |
CN106454984B (zh) | 一种路由的方法及装置 | |
Bednarczyk et al. | An enhanced algorithm for MANET clustering based on weighted parameters | |
CN112333092A (zh) | 一种用于多跳自组网路由寻址的方法与系统 | |
CN101686188A (zh) | 层次化有序地址分组网络中建立路由表的方法、路由的方法及路由器 | |
Wu et al. | A distributed formation of a virtual backbone in manets using adjustable transmission ranges | |
CN111757414B (zh) | 一种基于多模电台的sdmanet网络组网方法 | |
CN111371572B (zh) | 一种网络节点的选举方法及节点设备 | |
CN111050375A (zh) | 一种无线自组织网络高实时数据广播分发方法 | |
CN114520960A (zh) | 一种多子网无线网络的mpr集合选择方法 | |
CN110971514B (zh) | 一种异频网关设备及异频网络的数据交互方法 | |
WO2014185768A1 (en) | A method of spectrum aware routing in a mesh network and a system derived thereof | |
Lou et al. | Efficient broadcast with forward node set in clustered mobile ad hoc networks | |
CN112689275A (zh) | 一种用于ble网格网络的新型非均匀功率形成方法 | |
Lafta et al. | Efficient routing protocol in the mobile ad-hoc network (MANET) by using genetic algorithm (GA) | |
So et al. | Load-balancing routing in multichannel hybrid wireless networks with single network interface | |
CN113747539B (zh) | 基于智能天线的tdma移动自组织网络拓扑控制方法 | |
Wang et al. | Improvement and optimization of a mobile multi-agent AODV routing protocol |
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 | ||
CB02 | Change of applicant information |
Address after: 210003 No. 346, Zhongshan North Road, Jiangsu, Nanjing Applicant after: 724 Research Institute of China Shipbuilding Corp. Address before: 210003 No. 346, Zhongshan North Road, Jiangsu, Nanjing Applicant before: 724TH RESEARCH INSTITUTE OF CHINA SHIPBUILDING INDUSTRY Corp. |
|
CB02 | Change of applicant information | ||
GR01 | Patent grant | ||
GR01 | Patent grant |