CN107580352A - A kind of wireless Ad Hoc network interior joint Poewr control method - Google Patents
A kind of wireless Ad Hoc network interior joint Poewr control method Download PDFInfo
- Publication number
- CN107580352A CN107580352A CN201610532211.9A CN201610532211A CN107580352A CN 107580352 A CN107580352 A CN 107580352A CN 201610532211 A CN201610532211 A CN 201610532211A CN 107580352 A CN107580352 A CN 107580352A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- local
- nodes
- distance
- 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.)
- Pending
Links
Abstract
The present invention relates to wireless communication field, relate more specifically to the control method of the radio-frequency emission power of each node in Wireless Ad Hoc network (also referred to as mobile peer-to-peer network, wireless ad hoc network etc.), describe each node in network in detail and how to calculate in real time and determine oneself current maximum communication distance, and adjustment each current transmission power of taking this as a foundation.In the process, it is related to the decision method of fringe node in network, and fringe node needs the decision method of the extra exception for increasing transmission power specially treated, has all done and has illustrated one by one.
Description
Technical field
The present invention relates to wireless communication field, relate more specifically to Wireless Ad Hoc network (also referred to as mobile peer-to-peer network,
Wireless ad hoc network etc.) in each node radio-frequency emission power control method.
Background technology
Wireless Ad Hoc network is made up of one group of movement or static straps the terminal node of radio transmission-receiving function, they
Between communication usually and the support of network infrastructure (such as base station or focus) that need not fix, each terminal node can
With with other node direct communications in the range of less radio-frequency, and can by between node information forwarding (jump) realize it is farther away from
From communication.In general, the route between Ad Hoc networks interior joint includes multi-hop (repeatedly forwarding), therefore this network is also referred to as more
Wireless Ad Hoc network is jumped, the node in Wireless Ad Hoc network has the function of main frame and router concurrently simultaneously.
Wireless Ad Hoc network is mainly used in the occasion that can not provide fixation means, and energy utilization problem is in network service
In it is especially prominent.The energy expenditure of network can not only be reduced using effective Power Control, and can be reduced mutual between node
Interference, improve whole network capacity.The Poewr control method of current wireless Ad Hoc network is mainly the mathematics by means of graph theory
Model, the thought of control algolithm also come from the rudimentary algorithm in graph theory mostly, to node on the basis of network connectivty is ensured
Between transimission power optimize, reach extend the whole network life-span effect.Whether the power used according to nodes
Identical, power control techniques can be divided into the control method using same transmission power and the control method using different transimission powers
Two major classes.In the control method using different transimission powers, the difference of control information type is used according to node, again can be substantially
It is divided into three types：
1) controlling mechanism based on node location information, each node needs to obtain the accurate geography of surroundings nodes in network
Positional information, generally requires the support of the location technologies such as GPS (Global Position System), and typical control algolithm has
R＆M (is proposed) algorithm, LMST (Local Minimum Spanning Tree) algorithm etc. by Rodoplu and the people of Meng two.
2) controlling mechanism based on node direction information, each node needs that the relative of adjacent node can be estimated in network
Direction, this reception antenna to node propose higher requirement, and typical control algolithm has CBTC algorithms.CBTC(Cone
Based Topology Control) algorithm is a kind of control algolithm based on sector, the thought of the algorithm and Yao figures described later
More close, difference is：In Yao figures, present node centered on it by residing plane be divided into it is fixed, etc. between
Every sector region, node nearest apart from oneself in each region is then defined as logic neighbors；And CBTC algorithms are
In the transmission radius (being determined by node transmitting power power and receiving sensitivity) of a determination, using present node in
The heart, the sector region of any one determination size is interior to comprise at least a logic neighbors.
3) controlling mechanism based on neighborhood information, the information of neighbors include neighbors quantity, neighbors ID
(Identity), received signal strength or euclidean distance between node pair etc., very easily obtain.Typical control algolithm has XTC (X
Topology Control) algorithm, XTC algorithms include three steps：First, interacted by neighborhood information, each node structure
Neighborhood information table is built, and neighbors is sorted according to certain criterion；Secondly, network node passes through the respective neighborhood information of interaction
Table, obtain double bounce neighborhood information；Finally, each node is only according to the neighborhood information and double bounce neighborhood information of local record
The vertical network topology calculated in subrange, select suitable local transmission power.
In the control method using different transimission powers, usually constructed using the method for the neighborhood graph in computational geometry
Network topology with good energy response, conventional several topological construction methods are simply enumerated here：
1)RNG(Relative Neighborhood Graph)：As shown in Fig. 1 (a), and if only if using node u and v as
The center of circle, with side (u, v) be radius two round public domains in do not include any other node w when, side (u, v) belongs to RNG
Figure.
2)GG(Gabriel Graph)：As shown in Fig. 1 (b), and if only if between node u and v side is in the circle of diameter
During not comprising any other node w, side (u, v) belongs to GG figures.
3)RDT(Restricted Delaunary Triangulation)：As shown in Fig. 1 (c), to network vertex set V
Triangulation is carried out, if not including any other node in V in the circumscribed circle of each triangle, just this triangulation is referred to as
Delaunary triangulations.In view of the limitation of Wireless Ad Hoc network interior joint transmission power, generally in Delaunary tri-
RDT figures only retain the side that those length are less than node-node transmission radius after the subdivision of angle.
4)YG(Yao Graph)：As shown in Fig. 1 (d), node centered on its own by residing plane be divided into c (c >=
6) individual fixation, equally spaced sector region, and the node that chosen distance oneself is nearest in each sector region saves as adjacent
Point, retain the side between node and neighbors.
By above-mentioned classification, the invention belongs to the control method using different transimission powers, neighborhood information is also based on
Controlling mechanism, and the range information between node is simply obtained, it is only according to the range information of near its circumference node to local node
The vertical network topology calculated in subrange, selects logic neighbors, by adjusting local node proper emission power, and these
The logic neighbors chosen establishes connection.
The content of the invention
The quantity of the whole wireless channel of system is M in Ad Hoc networks described in the invention, and is assumed every in network
Individual node uses omnidirectional antenna, and when maximum communication distance is all Rmax, all nodes are connections.The module of nodes
As shown in Fig. 2 possessing a sendaisle and N number of receiving channel, node can be established theory diagram with K neighbors of surrounding simultaneously
It is bi-directionally connected, the quantity N of receiving channel is more than K, no more than M, and it is complete that remaining channel ((N-K) is individual) continues on for monitoring system in turn
The state of the M wireless channel in portion.Same channel resource can be controlled in different locus by node transmitting power
It is multiplexed by different nodes, the node of generally higher than 3 jump space lengths can take same channel, will not interfere with each other each other,
Such as Fig. 3 signals, the numeral of figure interior joint position represents the channel number that the node takes, so can be with structure with limited channel resource
Build bigger network.Node timing in network is to a range of node broadcasts control information around, including the node
The signal delay etc. of transmission power, the channel number of neighbors, neighbors, can using the signal delayed data of both sides between neighbors
To accurately calculate the distance between two nodes.
New node not transmission signal before joining the network, surroundings nodes are searched on M whole wireless channel of system,
Surroundings nodes signal is received, and network slightly synchronously, collect the control information of surroundings nodes, analyzes a hop node and two and jumps section
The wireless channel occupancy situation of point, the launch channel number of oneself is determined, local routing table is initialized, until forwarding can be competent at
Sendaisle is just opened during the message of surroundings nodes., can't because new node does not have information exchange with surroundings nodes at the beginning
The distance of accurate measurement surroundings nodes, so the node can only be first according to surrounding node transmitting power on each channel and each self-test
The ratio size of the receiving power measured estimates the distance of surroundings nodes, and new node (adds with the transmission power estimated
On the tolerance value that is reliably connected) and surrounding's nearest node for searching first establish and be bi-directionally connected, add network, start accurate measurement
Surroundings nodes distance, the network topology in subrange is independently calculated using these accurate range informations, select the adjacent section of logic
Point, local node proper emission power is adjusted, incorporate network.The process for adjusting local node transmission power is as follows：
1) according to distance of the surroundings nodes from local node, find out the minimum node of distance, more other nodes to this two
The distance of individual node, retain the node closer to the distance from local node.
2) in the surroundings nodes retained, continue to find out the node closest from local node, then more other sections
Point continues to retain the node closer to the distance from local node to the distance of the two nodes.
3) repetitive process 2), until surrounding node not closer to the distance from local node can retain.This last time
The distance of the node found out to local node is the current maximum communication distance of local node.Local node is with the communication distance
Transmission power is adjusted, plus the tolerance value being reliably connected, is communicatively coupled with surroundings nodes.
From plane geometry knowledge, the node of Arbitrary distribution in one plane, local node is sought in said process
Look for closest degree of node to be not more than 6, number number can react the margin location whether local node is in network
Put.Because the node location in network changes at any time, so the process of above-mentioned adjustment local node transmission power is one real-time
Dynamic process, each node calculates the network topology in subrange using said process in real time in network, and adjustment is each
From transmission power.There are two kinds of exceptions to need specially treated during the respective transmission power of knot adjustment：
1) presence of other nodes is not searched around local node, is temporarily one in a network such as Fig. 4 interior joint q
Isolated node, in this case, the node should be stepped up node transmitting power, until with peak power on the channel chosen
Transmitting, it do one's best and sends connection signal to the node of maximum magnitude around.
2) typically in Wireless Ad Hoc network, there is a big chunk node, they are distributed on the border of network, are claimed
For fringe node (Boundary Node), node m, node n, node o and node p in such as Fig. 4 belong to fringe node,
Other nodes in network internal are referred to as internal node.Fringe node is in a network except keeping the company with internal nodes of network
Connect outer, it is also necessary to often increase transmission power attempt and network outside node establish new connection, and increase transmission power will
The scope of other inter-node communications is disturbed in increase, if not increasing node transmitting power additionally easily causes network segmentation again,
Such as fringe node m, n in Fig. 4, the distance between they are less than the maximum communication distance between node, due to Power Control, caused
Network segmentation, send connection signal if actively increasing node transmitting power without a side or move close to a bit, have can
Energy both sides can not have found mutually, cause network to be constantly in cutting state.The isolated node of the first above-mentioned exception
Fringe node can also be attributed to, such two kinds of exceptions can be uniformly processed.
In fact, new node may be not present near most of fringe node in a network needs to connect, hair is increased
Penetrating power not only influences node communication, but also may consume the energy in vain nearby.So the first step first judges fringe node；
Second step determines when fringe node needs additionally to increase transmission power.In above-mentioned power control process, local section
Point find closest degree of node can judge as the node in network oneself whether be fringe node method.Judge
Method is as follows：
1) 0, it is an isolated node to represent this, can be attributed to fringe node.
2) 1,2, it is determined as fringe node.
3) 3, it may be possible to fringe node, it is also possible to internal node, can further it be judged by other householder methods,
Or it directly can simply be determined as internal node.
4) 4,5,6, it is determined as internal node.
Because the movement of nodes causes the change of network structure, the fringe node in network is also to change at any time
's.When it is internal node that the node in network, which judges oneself, the node is normally carried out Power Control adjustment.When the section in network
Point can select one kind in following two methods to continue to judge, if the node meets bar when to judge oneself be fringe node
Part, the same node need to only be normally carried out Power Control adjustment, it is not necessary to additionally increase node transmitting power, remove trial and network
Outer node establishes new connection.
1) in the local routing table of the node, the route record of at least one common node.Common node in network
It can be gateway node or other important nodes, be that all nodes in network must be connected by single-hop or multi-hop mode
Node.
2) in the local routing table of the node, the quantity of routing node is more than a determination value H.H values can be whole net
The half or other values of network number of nodes (or group nodes quantity), if the number of the local routing table routing nodes of the node
Amount is more than H, represents the divided possibility very little of network of node connection, even if network is divided, what the node was connected
Network is also to split the major part in network, it is not necessary to actively increases the fraction that transmission power is gone in connection segmentation network.Should
Function can specify that to be undertaken by the fringe node of the fraction network in segmentation network.
When node selects above two determination methods, it is desirable to which all nodes must all select equally in whole network system
Determination methods, not so can produce contradiction.The first determination methods is typically chosen, fairly simple, common node can also select
The node of a key person in group.
The control method of the Wireless Ad Hoc network interior joint transmission power of the present invention program introduction, and existing method ratio
Compared with there is operability, simply.Particularly local node determines oneself by the method for closest node around finding
Transmission power, it can be compared favourably with existing CBTC algorithms, RDT and YG methods, but the complexity calculated substantially reduces.Using
During the solution of the present invention control Wireless Ad Hoc network node transmitting power, the knowledge that each node needs is smaller, only
Each node status information in the range of double bounce is needed to be grasped, control information communication burden is low between node, and supporting node moves freely, net
Network scalability is strong.
Brief description of the drawings：
Wireless Ad Hoc network node neighborhood graph common Fig. 1；
The functional module theory diagram of network node described in the invention Fig. 2；
Nodes channel multiplexing schematic diagram described in the invention Fig. 3；
The explanation schematic diagram of fringe node in network described in the invention Fig. 4；
Local node s finds current maximum communication distance schematic diagram in Fig. 5 examples；
The Wireless Ad Hoc network schematic diagram of Fig. 6 actual uses；
Specific embodiment：
The nodes power control introduced of the present invention is illustrated with a specific Wireless Ad Hoc network system below
The process of method processed, whole wireless channel sum is 31 in the system, and the module of node as shown in Figure 2 has a sendaisle
With 13 receiving channels, using omnidirectional antenna.System specialization arbitrary node can only simultaneously most and 6 neighbors foundation pair of surrounding
To connection, at least remaining 7 passages are used for the state of 31 wireless channels that monitoring system is whole in turn.
As shown in figure 5, new node s is before joining the network, according to surrounding node transmitting power on each channel and each
The node a that the ratio magnitude estimation of the receiving power detected goes out in surroundings nodes is nearest apart from this node, according to the distance just
The transmission power (plus the tolerance value being reliably connected) of this good node of beginningization, establishes with node a connect first.Immediately begin to utilize
Message delay information accurately measures surroundings nodes distance, and with surroundings nodes exchange of control information, adjust this node proper emission
Power.Detailed power adjustment procedure is as follows：
1) measuring node s can receive the distance of the surroundings nodes of signal, find out the minimum node a of distance (due to using
Measuring method is different and time change, the distance that node s adds network fore-and-aft survey surroundings nodes may be inconsistent, to add
Measured value after network is defined).Compare surroundings nodes and arrive node a and the distance to node s respectively, retain from local node s
Node closer to the distance.As shown in figure 5, node b and c, are deleted apart from node s farther out.In fact node s and node a is retained
The perpendicular bisector of line leans on the node of node s sides.It should be noted that due to the node around node s, node a may be examined
Do not detect, so in judging distance size, these nodes should judge nearer apart from node s.Such as node f, g, h in Fig. 5
Deng node a may can't detect, it should judge that these nodal distance nodes s is nearer, give and retain.
2) continue to find out in the surroundings nodes (retain as shown in Figure 5 node d, e, f, g, h, i, j) retained from
Node e closest local node s, then more other nodes arrive node s and node e distance respectively, continue to retain from
Node (retaining node h, i, j as shown in Figure 5) closer to the distance local node s.
3) repetitive process 2), until surrounding node not closer to the distance from local node can retain.Such as the section in Fig. 5
Point i is exactly the node nearest to node s that last time is found out, and node i to local node s distance is that local node s works as
Preceding maximum communication distance.Local node s adjusts transmission power with the communication distance, plus the tolerance value being reliably connected, with week
Node is enclosed to be communicatively coupled.
A counter FindCounter is defined, initial value 0, during above-mentioned searching minimum distance node, is often sought
Look for once, FindCounter adds 1.After process terminates, judge whether present node is edge according to FindCounter value sizes
Node.Determination methods are：When FindCounter is more than 2 (being equal to 3,4,5,6), present node is internal node；Other situations
Lower judgement present node is fringe node.Fig. 5 interior joints s FindCounter values are 3, and predicate node s is internal node.
In the present embodiment, when it is fringe node that node, which judges oneself, if need the extra transmission power that increases to go to attempt
New connection is established with the node outside network, determination methods are whether to contain at least one public affairs in the local routing table for see the node
The route record of conode.Common node in the present embodiment is gateway node, as Fig. 6 illustrate one actual use it is wireless
Ad Hoc networks, A0, B0, C0 node in figure are referred to as gateway node, and passing through more express network between them interconnects, gateway node
Position can fix.It can easily be proven that：As long as all upper common nodes of node connection in network, whole network is connection.
The fringe node section that just the extra increasing transmission power of needs is gone outside trial and network for common node of connecting to the Net is not only connected
Point establishes connection.
In summary, it is not multiple in the Wireless Ad Hoc network interior joint Poewr control method of the present invention program introduction
Miscellaneous computational methods, most of algorithm are that numerical value is bigger small, in a network in the case of node motion speed also not
Need just be competent at using high performance processor.
Claims (9)
1. a kind of Wireless Ad Hoc network interior joint Poewr control method, including how each node in network calculates really in real time
Oneself fixed current maximum communication distance, and the respective current transmission power of adjustment of taking this as a foundation；Fringe node in network
Decision method；And fringe node needs the determination methods of the extra exception for increasing transmission power specially treated.
2. the node in network as claimed in claim 1 calculates the method for determining oneself current maximum communication distance in real time,
It is characterized in that：Local node continuously finds the node closest from local node in the surroundings nodes retained, until
Surrounding node not nearer from local node can retain, and the distance of this node found out for the last time to local node is
The current maximum communication distance of local node.
3. the surroundings nodes that local node as claimed in claim 2 retains, it is characterised in that：Local node is retaining every time
Under surroundings nodes in search out the node closest from local node after, relatively around other nodes arrive respectively the two save
The distance of point, retains the node closer to the distance from local node, deletes the node closer to the distance from nearest node.
4. other nodes of relatively surrounding as claimed in claim 3 arrive the distance of the two nodes respectively, it is characterised in that：This two
Individual node, one is still local node, and another is apart from local node in the surroundings nodes that local node retains every time
Closest node.
5. the decision method of fringe node in network as claimed in claim 1, it is characterised in that：Local node calculates really every
During fixed once oneself current maximum communication distance, continuously found in the surroundings nodes retained from a distance from local node
The size of nearest degree of node, as the node in network judge oneself whether be fringe node method, when the number
When value is less than certain determination value, you can it is currently the fringe node of network to judge the node, because the movement of nodes causes
The change of network structure, the fringe node in network is also to change at any time.
6. local node as claimed in claim 5 is continuously found closest from local node in the surroundings nodes retained
Degree of node, it is characterised in that：The number initial value is 0, if not finding that other nodes are deposited around the local node
That is, the local node finds minimum distance degree of node as 0 in the surroundings nodes retained, then the local node is orphan
Vertical node；Isolated node belongs to the feature that fringe node is this programme.
7. fringe node as claimed in claim 1 needs the judgement side of the extra exception for increasing transmission power specially treated
Method, it is characterised in that：The common node in network is not contained in the local routing table of the node.
8. the common node in network as claimed in claim 7, it is characterised in that：All nodes must in Wireless Ad Hoc network
The node that must be connected by single-hop or multi-hop mode.
9. fringe node as claimed in claim 1 needs the judgement side of the extra exception for increasing transmission power specially treated
Method, it is characterised in that：In the local routing table of the node, the quantity of routing node is less than the numerical value of a determination, and the numerical value can
To be the half or other values of whole network number of nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610532211.9A CN107580352A (en) | 2016-07-04 | 2016-07-04 | A kind of wireless Ad Hoc network interior joint Poewr control method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610532211.9A CN107580352A (en) | 2016-07-04 | 2016-07-04 | A kind of wireless Ad Hoc network interior joint Poewr control method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107580352A true CN107580352A (en) | 2018-01-12 |
Family
ID=61048867
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610532211.9A Pending CN107580352A (en) | 2016-07-04 | 2016-07-04 | A kind of wireless Ad Hoc network interior joint Poewr control method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107580352A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267401A (en) * | 2008-04-25 | 2008-09-17 | 北京交通大学 | A mixed topology control method based on AODV protocol |
| US20100061299A1 (en) * | 2008-07-11 | 2010-03-11 | Adapt4, Llc | Dynamic networking spectrum reuse transceiver |
| CN102238717A (en) * | 2010-05-07 | 2011-11-09 | 富士通株式会社 | Method and device for adjusting transmitting power in mobile wireless self-organized network |
| CN104486725A (en) * | 2014-12-16 | 2015-04-01 | 湖南安全技术职业学院 | Wireless sensor network for coal mine tunnel, and distributive power control method thereof |
| CN104507168A (en) * | 2014-12-27 | 2015-04-08 | 西安电子科技大学 | Distributed topology control method for cognitive Ad Hoc network |
| US20150264626A1 (en) * | 2014-03-14 | 2015-09-17 | goTenna Inc. | System and method for digital communication between computing devices |
| CN105072676A (en) * | 2015-08-10 | 2015-11-18 | 重庆大学 | Time division multiple address (TDMA) protocol based aeronautical Ad Hoc network power control method |
| CN105517093A (en) * | 2015-11-30 | 2016-04-20 | 浙江工业大学 | Energy-saving routing method based on network balance for use in wireless sensor network |
-
2016
- 2016-07-04 CN CN201610532211.9A patent/CN107580352A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267401A (en) * | 2008-04-25 | 2008-09-17 | 北京交通大学 | A mixed topology control method based on AODV protocol |
| US20100061299A1 (en) * | 2008-07-11 | 2010-03-11 | Adapt4, Llc | Dynamic networking spectrum reuse transceiver |
| CN102238717A (en) * | 2010-05-07 | 2011-11-09 | 富士通株式会社 | Method and device for adjusting transmitting power in mobile wireless self-organized network |
| US20150264626A1 (en) * | 2014-03-14 | 2015-09-17 | goTenna Inc. | System and method for digital communication between computing devices |
| CN104486725A (en) * | 2014-12-16 | 2015-04-01 | 湖南安全技术职业学院 | Wireless sensor network for coal mine tunnel, and distributive power control method thereof |
| CN104507168A (en) * | 2014-12-27 | 2015-04-08 | 西安电子科技大学 | Distributed topology control method for cognitive Ad Hoc network |
| CN105072676A (en) * | 2015-08-10 | 2015-11-18 | 重庆大学 | Time division multiple address (TDMA) protocol based aeronautical Ad Hoc network power control method |
| CN105517093A (en) * | 2015-11-30 | 2016-04-20 | 浙江工业大学 | Energy-saving routing method based on network balance for use in wireless sensor network |
Non-Patent Citations (3)
| Title |
|---|
| 徐鹏飞: ""传感器网络中基于邻近图的拓扑控制研究"", 《信息科技辑》 * |
| 杨鹏: ""移动Ad hoc网络中基于拓扑控制的节能算法"", 《计算机工程与应用》 * |
| 田野: "无线Ad Hoc网络拓扑控制技术研究"", 《信息科技辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11368822B2 (en) | Changing topology in a wireless network | |
| US7574223B2 (en) | Method and associated apparatus for distributed dynamic paging area clustering under heterogeneous access networks | |
| Pearlman et al. | Determining the optimal configuration for the zone routing protocol | |
| US7937096B2 (en) | Method and associated apparatus for distributed dynamic paging area clustering under heterogeneous access networks | |
| KR100689305B1 (en) | Mobile Ad Hoc Network and Method for Detecting Variable Beacon Signals in Mobile Ad Hoc Network | |
| CN109547351B (en) | Routing method based on Q learning and trust model in Ad Hoc network | |
| CN104053175B (en) | A kind of thing network sensing layer topology control method | |
| CN111865446B (en) | Intelligent beam registration method and device realized by using context information of network environment | |
| US7054646B2 (en) | Transmission method in a communication system | |
| EP1411679B1 (en) | Data transmitting method for opportunity driven multiple access (ODMA) system | |
| Aldabbas et al. | Unmanned ground vehicle for data collection in wireless sensor networks: mobility-aware sink selection | |
| Blazevic et al. | Self-organizing wide-area routing | |
| US10687274B2 (en) | Selecting radio access for mobile terminals | |
| CN107580352A (en) | A kind of wireless Ad Hoc network interior joint Poewr control method | |
| Ashraf et al. | Succulent link selection strategy for underwater sensor network | |
| Shah et al. | Water rippling shaped clustering strategy for efficient performance of software define wireless sensor networks | |
| CN110677893B (en) | Networking control method based on wireless sensor network | |
| Ahmad et al. | RACE-SM: Reliability and adaptive cooperation for efficient UWSNs using sink mobility | |
| EP1534031B1 (en) | Method and associated apparatus for distributed dynamic paging area clustering in heterogeneous access networks | |
| Fan et al. | A geography-based void-bypassing routing protocol for wireless sensor network | |
| KR101019257B1 (en) | sensor node of wireless sensor network and method for processing mobility thereof | |
| Wang et al. | DBLAR: A distance-based location-aided routing for MANET | |
| Kumar et al. | Segment Based Distributed Routing Protocol With QoS in Cognitive Radio Ad hoc Networks | |
| Suganthi et al. | Direction Oriented Forwarding with Power Adaption (DOF-PA) Protocol for MANETs | |
| Geetha et al. | Energy-Aware Routing in Mobile Wireless Sensor 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180112 |