CN102131268A - Improved globe entrepreneurship monitor (GEM) routing method - Google Patents
Improved globe entrepreneurship monitor (GEM) routing method Download PDFInfo
- Publication number
- CN102131268A CN102131268A CN2011101040479A CN201110104047A CN102131268A CN 102131268 A CN102131268 A CN 102131268A CN 2011101040479 A CN2011101040479 A CN 2011101040479A CN 201110104047 A CN201110104047 A CN 201110104047A CN 102131268 A CN102131268 A CN 102131268A
- Authority
- CN
- China
- Prior art keywords
- node
- gem
- base station
- network
- father
- 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
Images
Classifications
-
- 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
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an improved globe entrepreneurship monitor (GEM) routing method, which is characterized in that: virtual polar coordinates in a GEM routing method are converted into actual polar coordinates, and the method comprises the following steps of: A, drawing a network connectivity diagram, wherein a node data structure has a nested structure, a first 8-bit Id is a node identification code, a followed integer Number is a child node number, and by parity of reasoning, the second Id is an identification code of a first child node, and the followed Number is the number of the child node; and gathering nodes and processing the data of each node, and expressing the connecting relationship between nodes in an adjacency list form; and B, performing ring removal processing, namely performing ring removal processing on the adjacency list generated in the step A through a breadth-first traversal algorithm of the diagram. Compared with the prior art, the invention has the advantages that: the routing method has lower energy overhead, and the adjusting process is simple when a network topology is changed.
Description
Technical field:
The present invention relates to wireless method of routing, relate in particular to improving one's methods of the wireless Route Selection of a kind of GEM.
Background technology:
The GEM route is a kind of geographical route that is applicable to data center's storage mode.The basic thought of GEM route: set up the virtual coordinates system, be used for representing actual network topology structure, it is the band tree of root with the aggregation node that node in the network has formed one, each node is used the jumping figure distance and the angle of tree root and is represented that the data between nodes route realizes by this band tree.The of paramount importance feature of wireless sensor network is exactly an energy constraint, and each node only carries power supply limited, that can't change usually in the network, and calculating, communication, the storage capacity of node are also quite limited simultaneously.In wireless sensor network, because the network node resource-constrained, the transmission of packet need arrive the destination by the multi-hop communication mode, so route selection algorithm is a main task of network layer design.Because finite energy, and environmental interference and other unfavorable factors, sensor node can often be damaged, and adds the variation of wireless launcher transmitted power and the interference between signal, and network topology structure can frequent variations.
In the GEM route selection method, the process of setting up of virtual polar coordinate system mainly comprises three steps: the first, generate tree.The jumping figure distance that aggregation node is provided with oneself is 0, and broadcasts route and set up message, and this message comprises a territory to the aggregation node jumping figure.The second, feedback subtree size.The subtree size is meant the interstitial content that comprises in the subtree.The 3rd, determine virtual angular range.Aggregation node at first determines the angular range of whole virtual polar coordinate system, and this angle is a logical perspective, does not represent the true bearing of node.Through above-mentioned three steps, each node is all known oneself to the jumping figure of aggregation node and the logical perspective scope of oneself, like this with regard to available jumping figure, and each node of the unique expression of angular range.Node is when sending message, if the angle of destination locations just transmits the message to father node not in the angular range of oneself, father node arrives angular range up to this message and comprises purpose according to same rule process
Above-mentioned algorithm needs upper layer node to transmit message, and expense is bigger.An improvement algorithm is: node checked at first before upwards transmitting message whether monitor node comprises the angle of target location.If comprise, then directly send this neighbor node to and no longer upwards transmission.Further improving algorithm is to utilize loop configuration, nearer from the target location if node is checked through adjacent node, just message is sent to this neighbor node, transmits otherwise just ring the upper strata.
But also all there is certain limitation in present improving one's methods, do not give full play to the effect of node geographical location information, makes sensor network can not get demonstrating fully to the sensitiveness of position.
Summary of the invention:
It is smaller that the technical problem to be solved in the present invention provides a kind of energy expense, when network topology structure changes, and the route selection method that adjustment process is fairly simple.
For solving the problems of the technologies described above, the invention provides following technical scheme: the improving one's methods of a kind of GEM Route Selection, it is converted to actual polar coordinates with the virtual polar coordinates in the GEM route selection method, may further comprise the steps:
A. draw network-in-dialing figure, the node data structure is a nested structure, and first 8 Id are the node identification sign indicating number, the Integer N umber that closelys follow thereafter is this node son number, and by that analogy, second Id is the identification code of first son's node, thereafter Number is its child number
Aggregation node is handled the data of each node, and internodal annexation is represented with the form of adjacency list;
B. carry out decyclization and handle, the breadth First ergodic algorithm by figure on the adjacency list that steps A generates carries out the decyclization processing.
A kind of preferred version of improving one's methods as GEM Route Selection of the present invention, wherein: also comprise route conflict controlled step, conflict control base station is divided into different zones with the node in the network by the level annexation, adjacent area is guaranteed not at one time in the sheet, be the different different time slots of node division again in the sheet at this moment, during base station distribution time slot information, the time slot segment information of child node issued its father node, father node remains on and intercepts accepting state in the section at this moment.
As a kind of preferred version of improving one's methods of GEM Route Selection of the present invention, it also comprises the route maintenance step:
When C. failure node is routing node, send the report of cancelling its routing node function to the base station, send a signal of cancelling link to own all childs simultaneously, then as general leaf node, the base station is after receiving that the report of routing function is cancelled in the node requirement, according to network diagram, for the subtree of application node is sought father node;
When D. failure node is leaf node, initiatively be about to break away from link to his father's node report oneself; Or father node can not receive the information of certain child node in a period of time, judges that then it is damaged, and report to the immediate supervisor is to the base station;
E. add fashionable as new node, newly added node sends Location Request, after week, mid-side node was received this request, to physical coordinates of its loopback oneself and routing iinformation separately, after receiving the coordinate information of other nodes, new node starts the physical location that calculates oneself based on the positioning flow of not finding range, select then one apart from the base station nearest node adds its subtree as father node.
The present invention compared with prior art has the following advantages: this route selection method has less energy expense, and adjustment process was fairly simple when network topology structure changed.
Description of drawings:
The present invention will be further described below in conjunction with accompanying drawing.
Fig. 1: topological structure schematic diagram.
Fig. 2: in abutting connection with chart.
Fig. 3: adjacency list decyclization flow process.
Fig. 4: loop free adjacency list.
Fig. 5: one-level route schematic diagram.
Fig. 6: second grade highway is by schematic diagram.
Fig. 7: tertiary road is by schematic diagram.
Fig. 8: level Four route schematic diagram.
Fig. 9: the staggered scheduling of timeslice schematic diagram.
Figure 10: node data flow graph.
Figure 11: timeslice is divided schematic diagram.
Figure 12: time slot is divided flow chart.
Figure 13: the tree-shaped level routing diagram of emulation.
Figure 14: energy consumption comparison diagram.
Embodiment:
Among the present invention virtual polar coordinates are converted to actual polar coordinates, specifically comprise the steps:
1. route generative process
Different with the GEM route is that in improved routing algorithm, the generation of route is based upon aggregation node and has known on the physical location basis of global network node.Each node all to aggregation node reported oneself the position and with the annexation of other nodes, aggregation node is at first drawn network-in-dialing figure according to node location and their connected relation, in the network-in-dialing figure operation of contributing, its detailed process is as follows then;
The first step is drawn network-in-dialing figure.
Drawing network-in-dialing figure needs the position and the annexation of each node, and aggregation node is described the form of nodal information with adjacency list.Node is uploaded information to be handled: it is as shown in table 1 that node is uploaded the packet structure of information.
Table 1 node data pack arrangement
This data structure is a nested structure, and first 8 Id are the node identification sign indicating number, and the Integer N umber that closelys follow thereafter is this node son number, and by that analogy, second Id is the identification code of first son's node, and Number thereafter is its child number.
Aggregation node is handled the data of each node, and internodal annexation is represented with the form of adjacency list.The node adjacency chart as shown in Figure 2 among Fig. 1.
Node in the sensor network may have the relation of leading to a plurality of nodes, therefore, showing as certain child node in adjacency list may repeatedly appear in the adjacency list of a plurality of nodes, this also shows simultaneously have communication loop in network, as then should avoid the loop to produce to the wireless sensor network of energy-sensitive as far as possible.
Second step, carry out decyclization and handle, make up the routing table that does not have loop.This process is to finish by the breadth First ergodic algorithm that carries out figure on the adjacency list that generates in the first step.Arthmetic statement as shown in Figure 3.Through said process, the loop among the figure is removed, and node route list is made up of the adjacency list of reducing the number of, as shown in Figure 4.
Suppose Figure 1 shows that certain part of the network topological diagram that forms in the node locating process, the line between point is represented can reach between the two.Fig. 5 to 8 has shown the route generative process.Figure 5 shows that base station and four direct child nodes set up communication path, Figure 6 shows that first order child node and second level child node set up communication path, all be included into a certain in the path of base station until last all nodes.Before issuing the routing table of generation, also need routing table is done further perfect, need to add timeslice and control information is avoided in conflict.
2. route conflict control
It is high that extensive, the highdensity characteristics of wireless sensor network make that neighbors sends the possibility of packet simultaneously, if a plurality of packets send simultaneously, signal can be overlapped, causes receive mode to be difficult to identification, needs to retransmit and could correctly send to the destination to information.The re-transmission that conflict causes can cause very big energy consumption, therefore reduces effectively conserve energy of conflict.At this, what this paper adopted is that time division multiplexing avoids conflict with the mode of intercepting/receiving.
Some characteristics of time division multiplexing mechanism are fit to the demand that sensor network is saved energy very much: TDMA mechanism does not have the collision retransmit issue of competition mechanism; Do not need too much control information during transfer of data; Node groove at one's leisure can in time enter sleep state.TDMA mechanism needs time synchronized relatively stricter between the node.In should using, owing in the hypothesis base station signal projector that can cover whole nodes is arranged, it is fairly simple that the whole network time synchronized just seems.Periodically broadcast the current time base station, after each node is received the time value of base station, compares the clock of oneself, adjusts then.On the basis of the whole network time synchronized, introduce below and how to utilize time-multiplexed method to avoid or reduce conflict.
A, DMAC protocol overview
From Routing Protocol mentioned above as can be seen the communication pattern of network to be a plurality of sensor nodes send data to an aggregation node.All intermediate nodes are transmitted the data of receiving, forming one is the tree network structure of root with the aggregation node.The DMAC agreement proposes at this network configuration, and target is the transmission delay that reduces the energy consumption of network and reduce data.
The core concept of DMAC agreement is to adopt staggered scheduling mechanism.As shown in Figure 9, the node cycle is divided into time of reception, transmitting time and the length of one's sleep.Wherein time of reception and transmitting time equate, are the time that sends a data grouping.The scheduling of each node has different skews, and the transmitting time of lower level node is corresponding to the time of reception of upper layer node.Like this, data can be sent to aggregation node from data source nodes continuously, reduce the transmission delay in network, Figure 10 shows that the node data flow graph.
The DMAC agreement adopts the ACK acknowledgement mechanism, if sending node does not receive that ACK replys, can retransmit in next transmitting time section.After node is correctly received data, send ACK message to sending node at once.
On the data acquisition tree, suppose that a plurality of child nodes all have data to send to father node.When certain child node win send opportunity and finish send out after because the flag bit that the grouping that father node is received not have setting also will send, father node enters sleep state, will cause the transmission lag of other son node number certificates like this.In order to solve the problem that father node is early slept, the DMAC design of protocol data prediction mechanism, after father node is received the packet of certain child node, predict that other child nodes may also have data to send, then after a set time T postpones, wake up and be in accepting state, if prediction of failure then directly change sleep state over to.The node of competition failure hears that in the phase is kept out of the way in transmission the ack signal of father node then can send data to father node behind time-delay T.
B, based on the time-multiplexed DMAC of overall situation conflict control
In the DMAC agreement, still have the problem of competitive channel between the brotgher of node, and the time slot of each node and distribution is one-to-one relationship, if number of nodes is very big, slotted vane will be very short in the time of then, a time slot interior nodes even can not finish once communication.For this reason, proposed the multiplexing time slot division methods of burst liquidate advance by leaps and bounds the row control.
For sake of convenience, utilizing pie chart that the network node timeslice is divided is described.As shown in figure 11, the base station is divided into different zones with the node in the network by the level annexation, and adjacent area must guarantee not at one time in the sheet, is the different different time slots of node division again in the sheet between at this moment, can enlarge network node quantity thus, prolong the node sleep time.During base station distribution time slot information, simultaneously the time slot segment information of child node is issued its father node, intercept/accepting state so that father node remains in the section at this moment.
The program description of time slot partition process is as follows:
Be used for the data structure that time slot is divided
The flow process that time slot is divided as shown in figure 12.
The DMAC agreement adopts the staggered scheduling mechanism of the activity/sleep between the different depth node, and data can be propagated continuously along multihop path, reducing sleeps bring communication delay.This agreement is by self adaptation duty ratio mechanism, adjust the activity time of node on the whole piece path according to the network traffics change dynamics, solve the mutual interference problem between the different child nodes of identical father node by data prediction mechanism, by the MTS MECHANISM SOLUTION never with disturbing the sleep delay problem of bringing between the neighbor node of father node.These measures can effectively reduce transmission delay and the reduction network energy consumption of data in network.
3. route maintenance
After wireless sensor networking work a period of time, because the routing node consumed energy is faster than other nodes, cause the network hole easily, when the network hole is too much, whole network is with ineffective, for prolonging network lifetime, need adjust the network route according to the node energy situation.Because this routing algorithm is on the polar coordinate system that is based upon based on node location, so when the real network topology changes, still it is carried out the Route Selection work of a new round in the base station.
The variation of network topology comprises that mainly node failure and new node add two kinds of situations.The processing of node failure is divided into two kinds of situations again: the one, when failure node is routing node, this node is not suitable for taking on the work of routing node again, its energy will send the report of cancelling its routing node function to the base station during near the minimum energy threshold values of routing node.Send a signal of cancelling link to own all childs simultaneously, then as general leaf node.The base station is after receiving that the report of routing function is cancelled in the node requirement, according to network diagram, for the subtree of application node is sought father node, under possible situation, also to decompose, be respectively each branch's subtree then and seek father node, after specifying father node subtree, again the node for change distributes time slot, issues new routing table.The 2nd, then fairly simple when failure node is leaf node, when the node energy will exhaust, then initiatively be about to break away from link to his father's node report oneself; Or father node can not receive the information of certain child node in a period of time, judges that then it is damaged, and report to the immediate supervisor is to the base station.
Add fashionable as new node, at first be node locating: newly added node sends Location Request, after week, mid-side node was received this request, to physical coordinates of its loopback oneself and routing iinformation separately, after receiving the coordinate information of other nodes, new node calculates the physical location of oneself, select then one apart from the base station nearest node adds its subtree as father node.If the interstitial content of disposable adding is bigger, can calculate the physical location of new node by the base station, for the consideration of saving energy, only the locating information of other nodes is transmitted in this process for the node of location aware, do not restart self node locating program.
4. test data:
In the routing simulation process, 100 sensor nodes are set, be randomly dispersed in the rectangular area of 200*200.The communication distance of supposing each node is 30.Through after the Route Selection, generate tree-shaped level route as shown in figure 13.
The whole energy resource consumption analysis of network: it is E that emission moves required energy with receiving circuit
Elec=50nJ/bit uses E
Tx(k) expression sends k the energy that bit information is consumed, and uses E
Rx(k) expression receives k the energy that bit information is consumed.Suppose that wireless channel is symmetrical, promptly under given signal to noise ratio, send a message and equate then have following equation to set up from node i to node j energy needed with the required energy of message of reception from node j to node i.
E
Tx(k)＝E
elec*k＝E
Rx(k)
The present invention selects direct inundation method, directed diffusion method and improved GEM routing algorithm to carry out the energy consumption contrast.Suppose that node in the direct inundation method does not receive the repeatedly forwarding message of same node, suppose that the interest query messages length of directed diffusion is 200bit, and node does not repeat to receive same interest query messages.
Figure 14 is the information that each node all will send 2000 bit in the network, and the energy of whole network consumption relatively.
As can be seen, improved GEM algorithm is average more energy-conservation about 10% than directed diffusion method from comparison diagram, and this part energy is saved mainly owing in improved GEM algorithm, does not have the interest message broadcasting of base station.If take into account intercepting energy loss in energy loss, their energy consumption all can correspondingly increase again, but gap can further enlarge.
It should be noted that, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, although the present invention is had been described in detail with reference to preferred embodiment, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not breaking away from the spirit and scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (3)
1. improving one's methods of a GEM Route Selection is characterized in that the virtual polar coordinates in the GEM route selection method are converted to actual polar coordinates, may further comprise the steps:
A. draw network-in-dialing figure, the node data structure is a nested structure, and first 8 Id are the node identification sign indicating number, the Integer N umber that closelys follow thereafter is this node son number, and by that analogy, second Id is the identification code of first son's node, thereafter Number is its child number
Aggregation node is handled the data of each node, and internodal annexation is represented with the form of adjacency list;
B. carry out decyclization and handle, the breadth First ergodic algorithm by figure on the adjacency list that steps A generates carries out the decyclization processing.
2. improving one's methods of GEM Route Selection according to claim 1, it is characterized in that: also comprise route conflict controlled step, conflict control base station is divided into different zones with the node in the network by the level annexation, adjacent area is guaranteed not at one time in the sheet, be the different different time slots of node division again in the sheet at this moment, during base station distribution time slot information, the time slot segment information of child node issued its father node, father node remains on and intercepts accepting state in the section at this moment.
3. improving one's methods of GEM Route Selection according to claim 1 is characterized in that also comprising the route maintenance step:
When C. failure node is routing node, send the report of cancelling its routing node function to the base station, send a signal of cancelling link to own all childs simultaneously, then as general leaf node, the base station is after receiving that the report of routing function is cancelled in the node requirement, according to network diagram, for the subtree of application node is sought father node;
When D. failure node is leaf node, initiatively be about to break away from link to his father's node report oneself; Or father node can not receive the information of certain child node in a period of time, judges that then it is damaged, and report to the immediate supervisor is to the base station;
E. add fashionable as new node, newly added node sends Location Request, after week, mid-side node was received this request, to physical coordinates of its loopback oneself and routing iinformation separately, after receiving the coordinate information of other nodes, new node starts the physical location that calculates oneself based on the positioning flow of not finding range, select then one apart from the base station nearest node adds its subtree as father node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101040479A CN102131268A (en) | 2011-04-26 | 2011-04-26 | Improved globe entrepreneurship monitor (GEM) routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011101040479A CN102131268A (en) | 2011-04-26 | 2011-04-26 | Improved globe entrepreneurship monitor (GEM) routing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102131268A true CN102131268A (en) | 2011-07-20 |
Family
ID=44269133
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011101040479A Pending CN102131268A (en) | 2011-04-26 | 2011-04-26 | Improved globe entrepreneurship monitor (GEM) routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102131268A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104469906A (en) * | 2014-11-18 | 2015-03-25 | 无锡悟莘科技有限公司 | Low-power-consumption wireless networking method |
| CN108989222A (en) * | 2017-06-05 | 2018-12-11 | 中兴通讯股份有限公司 | A kind of method and device of network routing publication |
| CN109618416A (en) * | 2019-01-28 | 2019-04-12 | 博频云彩（北京）科技有限公司 | Reliable wireless broadcasting method for large-scale low-flow data access |
| CN110324074A (en) * | 2018-03-30 | 2019-10-11 | 波音公司 | Mobile routing is carried out to non-geostationary orbit system using virtual flow-line area |
| CN111182557A (en) * | 2020-02-25 | 2020-05-19 | 广州致远电子有限公司 | Tree network based detection networking system, method and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110041923A (en) * | 2009-10-16 | 2011-04-22 | 국방과학연구소 | Method for calculating location of censor nodes in mobile censor network |
-
2011
- 2011-04-26 CN CN2011101040479A patent/CN102131268A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110041923A (en) * | 2009-10-16 | 2011-04-22 | 국방과학연구소 | Method for calculating location of censor nodes in mobile censor network |
Non-Patent Citations (1)
| Title |
|---|
| 唐渝川等: "基于复合定位的无线传感器网络层次路由协议设计与实现", 《南京航空航天大学硕士学位论文》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104469906A (en) * | 2014-11-18 | 2015-03-25 | 无锡悟莘科技有限公司 | Low-power-consumption wireless networking method |
| CN108989222A (en) * | 2017-06-05 | 2018-12-11 | 中兴通讯股份有限公司 | A kind of method and device of network routing publication |
| CN108989222B (en) * | 2017-06-05 | 2022-02-25 | 中兴通讯股份有限公司 | Method and device for releasing network route |
| CN110324074A (en) * | 2018-03-30 | 2019-10-11 | 波音公司 | Mobile routing is carried out to non-geostationary orbit system using virtual flow-line area |
| CN110324074B (en) * | 2018-03-30 | 2023-05-23 | 波音公司 | Satellite system and method for routing a satellite system |
| CN109618416A (en) * | 2019-01-28 | 2019-04-12 | 博频云彩（北京）科技有限公司 | Reliable wireless broadcasting method for large-scale low-flow data access |
| CN111182557A (en) * | 2020-02-25 | 2020-05-19 | 广州致远电子有限公司 | Tree network based detection networking system, method and storage medium |
| CN111182557B (en) * | 2020-02-25 | 2023-07-07 | 广州致远电子股份有限公司 | Detection networking system, method and storage medium based on tree network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sahota et al. | A wireless sensor network for precision agriculture and its performance | |
| US9226253B2 (en) | Passive synchronization in wireless networks | |
| Cao et al. | Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks | |
| Cheng et al. | A comparison of MANET routing protocols on airborne tactical networks | |
| US9826493B2 (en) | Synchronized multi-sink routing for wireless networks | |
| Vázquez-Rodas et al. | A centrality-based topology control protocol for wireless mesh networks | |
| CN102131268A (en) | Improved globe entrepreneurship monitor (GEM) routing method | |
| CN104202772A (en) | Mobile Sink data collection method applied to wireless sensor network and used for node internal-memory resource sharing | |
| CN103260211A (en) | Improved AOMDV routing method | |
| CN101247339B (en) | Method for centralized resource reservation management in mobile wireless sensor network | |
| Terraneo et al. | TDMH-MAC: Real-time and multi-hop in the same wireless MAC | |
| Nagamalar et al. | Energy efficient cluster based approach for data collection in wireless sensor networks with multiple mobile sink | |
| Kurtoglu et al. | Energy consumption in long-range linear wireless sensor networks using LoRaWan and ZigBee | |
| CN103476081A (en) | Method for routing in wireless sensor network | |
| JPWO2014057709A1 (en) | Data distribution system, distribution device, terminal device, and data distribution method | |
| Zirak et al. | Swarm of drones using LoRa flying Ad-Hoc network | |
| Sadio et al. | SDN architecture for intelligent vehicular sensors networks | |
| Gajjar et al. | LEFT: A latency and energy efficient flexible TDMA protocol for wireless sensor networks | |
| CN103929789A (en) | Automatic selection method for MANET network master control node based on active routing algorithm | |
| Liu et al. | Advanced Fast Recovery OLSR Protocol for UAV Swarms in the Presence of Topological Change | |
| CN103179655A (en) | Distributed node power control method in mobile ad hoc network | |
| Xiong et al. | Is hop-by-hop always better than store-carry-forward for UAV network? | |
| CN104244423A (en) | Wireless sensor network based multi-path transmission time slot scheduling algorithm | |
| Qin et al. | Mobility weakens the distinction between multicast and unicast | |
| Shanti et al. | Treefp: A tdma-based reliable and energy efficient flooding protocol for wsns |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110720 |