CN101123576B - A mobile self-organized network path selection method based on bandwidth restraint and minimum load - Google Patents
A mobile self-organized network path selection method based on bandwidth restraint and minimum load Download PDFInfo
- Publication number
- CN101123576B CN101123576B CN2007100532766A CN200710053276A CN101123576B CN 101123576 B CN101123576 B CN 101123576B CN 2007100532766 A CN2007100532766 A CN 2007100532766A CN 200710053276 A CN200710053276 A CN 200710053276A CN 101123576 B CN101123576 B CN 101123576B
- Authority
- CN
- China
- Prior art keywords
- node
- bandwidth
- network
- route
- route requests
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a route choice method of a mobile ad-hoc network based on bandwidth constraint and minimum load, which includes three steps. Firstly, when a node needs to transmit services to another node, the node broadcasts routing request packets; secondly, when receiving a routing request message, an intermediate node compares the addresses of the intermediate node and the destination node; thirdly, when receiving the routing request from the source node, the destination node checks whether the current time is less than the time spent in receiving the routing request within the specified time. In a mobile ad-hoc network, the bandwidth resource is hard to determine due to the dynamic change of topological structures, the energy of the heavily loaded nodes in a network is rapidly depleted due to the unbalanced load distribution, and as a result the connectivity of the network is rapidly weakened, which finally shortens the total survival time of the network; the present invention resolves the problem. The present invention is compared with the existing AODV protocol by using the NS2 simulation tool, and the simulation results show that the BLLM excels the AODV in terms of packet delivery rate, packet loss rate, throughput, etc.
Description
Technical field
The invention belongs to a kind of mobile network field, is a kind of mobile self-organized network path selection method based on bandwidth constraint and minimum load specifically.
Background technology
In recent years, along with multimedia application is popularized and the commercialization of mobile ad hoc network day by day, in mobile ad hoc network, provide service quality to become an inevitable problem, service quality guarantees also to have become the critical function that communication system must be supported, for mobile ad hoc network also is the same, service quality is meant between the user who sends and receives information, and the quality about message transmission is arranged between the integrated services network of user and transmission information, a series of service requests that need satisfy when being the Network Transmission Business Stream generally comprise: bandwidth, time delay, delay variation, grouping packet loss etc.Service quality guarantees to be exactly that network will take a series of strategies and measure to guarantee the service quality that customer service is promised to undertake.It is a global issue that service quality guarantees, the less important mutual cooperation of each protocol layer is finished jointly on each node in the network, the node.In order to guarantee service quality, GPRS is network state information accurately as far as possible, such as the available bandwidth of link, time delay etc., could select the path Data transmission that link-quality is good, have enough available resources according to the QoS requirement of business like this.
In mobile ad hoc network, because power and limited bandwidth, Routing Protocol should distribute the route task liberally between mobile node.And the result of traditional most of MANET Routing Protocols operations makes numerous routes of generation pass through the node that sub-fractions are in the network center position.Mass data must cause network to occur and bottleneck by the small number of nodes transmission, makes packet queue wait for that time delay and packet loss increase, and the connectivity of network will weaken thereupon, and the division of network finally causes call failure, has shortened the overall life span of network.Therefore, be necessary when Route Selection to consider the load and the congestion situation of each node in the network, network is carried out load balancing, make that network keeps, efficient, stable operation, it is optimum that the combination property of network reaches.
NS2 is writing a Chinese character in simplified form of network simulator (network simulator), it is a discrete event simulator, by the California, USA Berkeley LBL of university, Xerox PARC, the network simulation the integration environment of the common exploitation of UCB and USC/ISI, having the advantages that opening is good, autgmentability strong, be applicable to Windows and linux system platform, is the emulation tool of an outstanding research network topology structure, phase-split network transmission.NS2 is write by OTcl and C++ bilingual and forms.The C Plus Plus speed of service realizes complicated data type and accurate, complicated algorithm easily than very fast, therefore, is fit to the detailed simulation and the realization of concrete agreement; The OTcl language speed of service is slow, but (and mutual) modification does not easily need compiling, be not easy to make mistakes, so it is fit to be used for doing analog configuration yet.The function that NS2 can finish comprises: 1. building network topology.Network topology is to be made of node and link among the NS2, and wherein node approximately can be counted as a simulation to three-layer equipment at the bottom of the realization network, and link then can be considered to be the simulation to physical transmission link.2. realize the Agent of Real-time Transport Protocol.Among the NS2, Agent is the simulation to some procotols, and NS2 has realized the Agent of UDP Agent and TCP Agent and some network application agreements commonly used in advance.3. the load application data flow is realized by Application/Traffic.RTP Agent itself has realized producing the work of data flow; Need not load Application.
Summary of the invention
A kind of path of selecting a load minimum on the basis of transmitting needed bandwidth that provides for business in assurance is provided carries out the mobile self-organized network path selection method based on bandwidth constraint and minimum load of professional transmission, thereby guaranteed professional transmission quick, efficient and stable in network, make the combination property of network reach optimum, thereby solve in mobile ad hoc network, because the topological structure dynamic change makes bandwidth resources be difficult to determine; On the other hand, unbalanced and cause the heavy node of load in the network to sap energy resources fast for load allocating, the connectivity that makes network weakens fast and has finally shortened the problem of the life span of network in general.
To achieve these goals, the method applied in the present invention is: when making transport service in mobile ad hoc network, finish by following step:
First step: when node needs and another one node transport service, node broadcasts route requests grouping, the route requests grouping comprises following content: the bandwidth of the IP address of destination node IP address and sequence number, source node and sequence number, service needed, professional ID number, load information, jumping figure;
Second step: when intermediate node is received the route requests message, compare the address of this node and destination node;
Third step: when destination node is received from the request of source node comes road, checks that the current time is whether less than time of reception route requests in official hour.
The invention solves in the mobile ad hoc network owing to the topological structure dynamic change makes bandwidth resources be difficult to determine and causes the node of load weight in the network to sap energy resources fast owing to load allocating is unbalanced, the connectivity that makes network weakens fast and has finally shortened the difficult problem of network in general life span.And using the NS2 emulation tool that the present invention and existing AODV agreement are compared, simulation result shows that BLLM is better than AODV at aspects such as delivery of packets rate, packet loss and throughputs.
Description of drawings
Fig. 1 is the connected graph of 5 nodes.
Fig. 2 is the wireless network of being made up of 7 nodes.
Fig. 3 is a flow chart of the present invention.
Fig. 4 is delivery of packets rate figure of the present invention.
Fig. 5 is packet loss figure of the present invention.
Fig. 6 is the spirogram of handling up of the present invention.
Embodiment
The present invention is described in further detail below in conjunction with accompanying drawing.
Sharing transmission medium between the node in the mobile ad hoc network is one of distinguishing feature of wireless network, and this characteristic causes the signal meeting phase mutual interference between adjacent node, thereby influences the normal transmission of information.Really might improve the performance of network by a simple example explanation consideration bandwidth considerations.Fig. 1 is the connected graph of 5 nodes, and the point among the figure is represented the node in the network, the Radio Link between the limit representation node among the figure, and the capacity of supposing channel is C.When node 1 will be communicated by letter with node 5, traditional routing resource based on shortest path can be selected path C-D-E.As can be seen from the figure, because the interference that link C receives link A, B, D and E simultaneously, its effective bandwidth can only reach C/5.If the bandwidth that the Business Stream that is transmitted requires exceeds C/5, the quality of communication will can not get guaranteeing.If select path A-B-D-E, the effective bandwidth of C/3 will be obtained.So consider internodal phase mutual interference,, can obtain better transmission property the standard of the bandwidth resources of node as Path selection.Further consider from the angle of queueing theory, in each node, all there is packet medium to be sent in formation, if when carrying out Path selection, do not consider the number of packet in the formation, can increase the wait time delay of packet in formation greatly, thereby increased the time delay of packet from the source node to the destination node, simultaneously, cause the number of the packet in the formation to surpass the limit of buffering area and the phenomenon of packet loss takes place.
Can be expressed as a directed graph G={V to mobile ad hoc network arbitrarily, E}, V, E represent set of node and link set respectively, if P is by link 1
1, 1
2..., 1
N-1Or by node v
1, v
2..., v
nThe paths of forming from node S to node D, wherein link l1 is node v
1, v
2Between a link.The available bandwidth of path P uses L (P) to represent with B (P) expression, the load of path P.Therefore, in mobile ad hoc network, can be described as based on the Path selection problem of bandwidth constraint and minimum load: at given network G=(V, E) in, certain source host S sends Business Stream to destination host D, and the required bandwidth of Business Stream is Bq, if there be the path P of n bar S to D
1, P
2..., P
nThen satisfying path P of the present invention should meet the following conditions:
B(P)≥Bq
L(P)＝min{L(P
i)|i＝1，2，...，n}
In wireless network, during the available bandwidth of computing node,, also to consider the influence of its neighbors except node itself.The wireless network that Fig. 2 is made up of 7 nodes, wherein two nodes connecting of solid line can direct communication, and dotted line represents sending between the node Business Stream.If node A will send professional through D to E, on link AD, just may take place congested, yet this moment, this section link did not carry any business, this is because in wireless transmission, node and it is all interior nodes sharing frequency resources of certain limit on every side, when all business in the certain limit surpass the transmittability of network to the demand of bandwidth, will take place congested.Therefore, when the available bandwidth of one section link of tolerance, not only to consider the business of this node, also will consider the operating position of node business on every side resource.
The present invention define arbitrary node D's " shared frequencies collection " for I (D), the node N of I (D) condition below satisfying forms: N is in the direct communications range of node D, that is to say that data or D that N can receive the D transmission can receive the data that N sends.In Fig. 1, node A, B, C and E just are in " the shared frequencies collection " of D.
Below be the variable that in bandwidth calculation, will use:
B (D): the total bandwidth of node D.For more approaching reality, the total bandwidth of node produces at random.
B
All(D): the occupied total bandwidth of node D.
B
c(D): the current available bandwidth of node D.
B (j): the bandwidth of data flow j.
(1) B
All(D) calculating
Calculate the current letter bandwidth that takies node D and need consider following two parts:
Bs (D): the occupied bandwidth of node D itself, promptly node D is the total bandwidth of other Business Stream reservation.
Bn (D): the occupied bandwidth sum of node that the shared frequencies of node D is concentrated.
Bs (D) and Bn (D) can obtain from the information that node is preserved.Therefore, the remaining bandwidth of node D can obtain with following formula:
Ball(D)＝Bs(D)+Bn(D)
＝Bs(D)+Bs(A)+Bs(B)+Bs(C)+Bs(E)
(2) B
c(D) calculating
The available bandwidth of node D is that the total bandwidth of node D deducts the occupied total bandwidth of node D:
Bc(D)＝B(D)-Ball(D)
When a Business Stream j will be when the node D, if the available bandwidth Bc (D) of the D that calculates 〉=during B (j), then allow the access of data flow, otherwise refusal inserts.
The offered load of mobile node is not only relevant with the business through this node in the wireless ad hoc, and also relevant with the business through its neighbor node, and the latter is referred to as traffic interference.The variable of using when being load calculation below:
L (D): the business load of node D self.
LI (D): the traffic interference load of node D.
TL (D): the business load that node D is total.
(1) calculating of L (D)
Suppose that link capacity is C, professional average length is L, and the node interface queue length is q, and then the load L (D) of any one node D is:
L(D)＝μ
Dq
D/(1+q
D)
In the formula, μ
D=C
D/ L
D
(2) calculating of LI (D)
Traffic interference LI (D) can be defined as the business load sum of the node among the shared frequencies collection I (D) of node D:
(3) calculating of TL (D)
The business load TL (D) of node comprises traffic interference LI (D) sum of self traffic carrying capacity L (D) and the node among the shared frequencies collection I (D):
(4) calculating of load on the path
The load of the path P from the source node to the destination node is the summation of the business load of all intermediate node I on the path:
Concrete steps of the present invention are:
(1) when node needs and another one node transport service, the grouping of node broadcasts route requests, the route requests grouping comprises following content:
The bandwidth of the IP address of destination node IP address and sequence number, source node and sequence number, service needed, professional ID number, load information, jumping figure;
When (2) intermediate node is received the route requests message, compare the address of this node and destination node;
If 1. oneself is not a destination node, judge whether to receive this request, if received then abandon this request, otherwise turn to step 2.;
2. calculate current residual bandwidth and with the bandwidth ratio of business need, if, then abandon this request, otherwise turn to step 3. less than the bandwidth of business need;
3. calculate total business load of this node, upgrade the parameter of record in the route requests grouping: revise the load information in the route requests grouping, jumping figure adds 1.Be established to the reverse route of source node then, and ID number of record traffic in route entry.Broadcast this route requests message to neighbors at last.
(3) when destination node is received from the request of source node comes road, checks that the current time is whether less than time of reception route requests in official hour.
1. if just continue to wait for, otherwise turn to step 2.;
2. from a plurality of route requests, select a load minimum, and carry out routing reply along the reverse route that this request is set up, intermediate node carries out resource reservation after receiving routing reply, is established to the forward route of destination node, and ID number of record traffic in route entry.
Time complexity represents to carry out the step number of a required operation of protocol operation.When the present invention communicates by letter at node at every turn, need to send route requests and carry out bandwidth reservation, therefore, source node sends the route requests grouping, and destination node is returned a routing reply grouping, and passing through network is twice back and forth, time complexity is the 2d order of magnitude, i.e. 0 (2d), and wherein d is the diameter of network.Communication complexity is meant the information number of the required transmission of operation that carries on an agreement, here, the inquiry that it is route that node carries out the worst situation of route requests is to carry out simultaneously in that each node is distributed, and then communication complexity is 0 (2N), and wherein N is the number of node in the network.
RREQ represents the route requests grouping in the flow chart (Fig. 3), and RREP represents the routing reply grouping.T represents that F represents negates certainly.
In order to analyze performance of the present invention, carried out corresponding emulation experiment, experimental selection AODV agreement has compared these three indexs of delivery of packets rate, throughput and packet loss of the present invention and AODV as reference object.The simulation of agreement realizes being based on that network simulation software NS2 carries out.Select a scene that includes 30 nodes in the experiment, the scene size is the rectangular area of 800m * 1000m, and each node is selected the direction of motion and the movement velocity of oneself at random, maximum movement speed is respectively 10m/s, 20m/s, 35m/s, 60m/s, 100m/s, scene is held time and is 500s.Packet rates is 2/s, and each request needs to transmit bag and is that the packet of 1000B, each node bandwidth value employing scope are the random number generation of (1-5) Mbps.
Simulation result shows, performance of the present invention all is better than AODV, as can be seen from Figure 4, the present invention and the AODV delivery of packets rate under friction speed will be higher than the delivery of packets rate of AODV, along with the increase of translational speed, delivery of packets rate of the present invention descend slowly and the delivery of packets rate decline scope of AODV is very big.In Fig. 5, packet loss of the present invention will be lower than AODV, and along with the variation of translational speed, packet loss of the present invention is in state more stably, and AODV is fast rise then.Fig. 6 is the comparison of both throughputs, and when node motion speed was slow, throughput of the present invention was a little more than AODV, and when the translational speed of node was accelerated, it is a lot of that throughput of the present invention will exceed AODV.
The content institute and this area professional and technical personnel's known prior art that are not described in detail in this specification.
Claims (1)
1. mobile self-organized network path selection method based on bandwidth constraint and minimum load, the method that is adopted is: when making transport service in mobile ad hoc network, finish by following step:
First step: when node needs and another one node transport service, node broadcasts route requests grouping, the route requests grouping comprises following content: the bandwidth of the IP address of destination node IP address and sequence number, source node and sequence number, service needed, professional ID number, load information, jumping figure;
Second step: when intermediate node is received the route requests grouping, the address of comparing this node and destination node,
(1) if oneself is not a destination node, judge whether to receive the grouping of this route requests, if received then abandon this route requests grouping, otherwise turn to step (two);
(2), calculate current residual bandwidth and with the bandwidth ratio of business need, if, then abandon this route requests grouping, otherwise turn to step (three) less than the bandwidth of business need;
(3), calculate total business load of this node, upgrade the parameter of record in the route requests grouping: revise the load information in the route requests grouping, jumping figure adds 1; Be established to the reverse route of source node then, and ID number of record traffic in route entry, this route requests grouping broadcasted to neighbors at last;
Third step: when destination node is received from route requests grouping that source node comes, checks the current time whether less than in official hour, receiving the time that route requests is divided into groups,
(1), otherwise turns to step (2) if just continue to wait for;
(2) from a plurality of route requests, select a load minimum, and carry out routing reply along the reverse route that this request is set up, intermediate node carries out resource reservation after receiving routing reply, is established to the forward route of destination node, and ID number of record traffic in route entry.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100532766A CN101123576B (en) | 2007-09-20 | 2007-09-20 | A mobile self-organized network path selection method based on bandwidth restraint and minimum load |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100532766A CN101123576B (en) | 2007-09-20 | 2007-09-20 | A mobile self-organized network path selection method based on bandwidth restraint and minimum load |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101123576A CN101123576A (en) | 2008-02-13 |
| CN101123576B true CN101123576B (en) | 2011-02-09 |
Family
ID=39085756
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100532766A Expired - Fee Related CN101123576B (en) | 2007-09-20 | 2007-09-20 | A mobile self-organized network path selection method based on bandwidth restraint and minimum load |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101123576B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103155587B (en) * | 2010-10-28 | 2016-06-08 | 国际商业机器公司 | For transmitting the method and system of packet in a network |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5409565B2 (en) * | 2010-09-16 | 2014-02-05 | 株式会社日立製作所 | Transport control server, transport control system, and transport control method |
| CN104301256B (en) * | 2014-10-31 | 2018-10-09 | 新华三技术有限公司 | A kind of method and controller of SDN network dynamic reserved bandwidth |
| CN105516328A (en) * | 2015-12-18 | 2016-04-20 | 浪潮(北京)电子信息产业有限公司 | Dynamic load balancing method and system, and devices used for distributed storage system |
| CN106304184B (en) * | 2016-08-17 | 2020-11-06 | 上海交通大学 | Multi-metric route discovery and establishment method based on AODV (Ad hoc on-demand distance vector) |
| CN106658605B (en) * | 2016-12-19 | 2020-02-07 | 中国电子科技集团公司第二十研究所 | Routing method based on distributed network load perception |
| CN108965147B (en) * | 2017-05-18 | 2020-04-28 | 华为技术有限公司 | Network control method, device and network equipment |
| CN107241268B (en) * | 2017-07-20 | 2020-05-12 | 北京航空航天大学 | Local multipath routing method and device based on satellite-based ADS-B message satellite network |
| CN109768824A (en) * | 2019-01-17 | 2019-05-17 | 西安电子科技大学 | Low orbit satellite data transmission method, system, computer equipment and storage medium |
| CN110418168B (en) * | 2019-08-05 | 2020-11-20 | 北京神州数码云科信息技术有限公司 | Streaming media transmission method |
| CN110912820B (en) * | 2019-10-30 | 2021-08-06 | 深圳马可孛罗科技有限公司 | Distributed routing method, distributed routing apparatus, and computer-readable storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1564540A (en) * | 2004-04-19 | 2005-01-12 | 中国科学院计算技术研究所 | Internet access method based on demanded route in mobile self-organizing net |
-
2007
- 2007-09-20 CN CN2007100532766A patent/CN101123576B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1564540A (en) * | 2004-04-19 | 2005-01-12 | 中国科学院计算技术研究所 | Internet access method based on demanded route in mobile self-organizing net |
Non-Patent Citations (2)
| Title |
|---|
| 吴华怡.无线自组网中带服务质量约束的路由协议研究.中国博士学位论文全文数据库（电子期刊）.2007,I136-58. * |
| 齐卫宁.基于3G技术的移动自组网QoS路由协议研究、设计与实现.中国优秀硕士学位论文全文数据库(电子期刊).2006,I136-154. * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103155587B (en) * | 2010-10-28 | 2016-06-08 | 国际商业机器公司 | For transmitting the method and system of packet in a network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101123576A (en) | 2008-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101123576B (en) | A mobile self-organized network path selection method based on bandwidth restraint and minimum load | |
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| Li et al. | An intersection-based QoS routing in vehicular ad hoc networks | |
| Chandravanshi et al. | Design and analysis of an energy-efficient load balancing and bandwidth aware adaptive multipath N-channel routing approach in MANET | |
| Venkatasubramanian et al. | An efficient route optimization using ticket-ID based routing management system (T-ID BRM) | |
| Quy et al. | A High-Performance Routing Protocol for Multimedia Applications in MANETs. | |
| Chelliah et al. | Routing for wireless mesh networks with multiple constraints using fuzzy logic. | |
| Alghamdi | Route optimization to improve QoS in multi-hop wireless sensor networks | |
| Liu et al. | Research of QoS-aware routing protocol with load balancing for mobile ad hoc networks | |
| M Haglan | The effect of network size and density to the choice of zone radius in ZRP | |
| Prathviraj et al. | Rough set based QoS enabled multipath source routing in MANET | |
| Alfa et al. | Implementation of MANETs Routing Protocols in WLANs Environment: Issues and Prospects | |
| Senthilkumar et al. | Energy aware multiple constraints intelligent multipath qos routing protocol with dynamic mobility prediction for manet | |
| Mu'azu et al. | Enhanced Bandwidth reservation guarantees for QoS routing in vehicular network | |
| Idrissi et al. | VANET congestion control approach using empathy | |
| Mu'azu et al. | A cluster-based stable routing algorithm for vehicular ad hoc network | |
| Jamhour | A symbolic model to traffic engineering in wireless mesh networks | |
| CN103002465A (en) | Dynamic multi-access business distributing method in isomerism cooperative network | |
| Varaprasad et al. | An efficient resource allocation scheme for multimedia applications in MANET | |
| Bouhouche et al. | A QoS-based Resources Reservation Mechanism for Ad Hoc Networks | |
| Maruthamuthu et al. | QoS aware power and hop count constraints routing protocol with mobility prediction for MANET using SHORT | |
| Sundar et al. | Optimized Channel Awareness Routing For Congestion Avoidance by Dynamic Queue Space Management in MANET | |
| Agbaria et al. | A bandwidth management approach for quality of service support in mobile ad hoc networks | |
| Bai et al. | FAST: fuzzy decision-based resource admission control mechanism for MANETs | |
| Hyytiä et al. | Traffic load in a dense wireless multihop network |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110209 Termination date: 20120920 |