CN100558062C - The distribution type structuring method of virtual backbone network in the wireless sensor network - Google Patents
The distribution type structuring method of virtual backbone network in the wireless sensor network Download PDFInfo
- Publication number
- CN100558062C CN100558062C CNB2006100309063A CN200610030906A CN100558062C CN 100558062 C CN100558062 C CN 100558062C CN B2006100309063 A CNB2006100309063 A CN B2006100309063A CN 200610030906 A CN200610030906 A CN 200610030906A CN 100558062 C CN100558062 C CN 100558062C
- Authority
- CN
- China
- Prior art keywords
- node
- message
- bunch
- head
- network
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to the distribution type structuring method of virtual backbone network in a kind of wireless sensor network, for effectively reducing the scale of backbone network, simplify the complexity of Routing Protocol, improve the operating efficiency of system, divide two stages to realize distributed virtual backbone network based on minimum connected dominating set.In first stage, make up maximum independent set by the sub-clustering algorithm, the whole node set is divided into bunch head and two set of ordinary node; Second stage, seek gateway node a bunch head is coupled together, form a connected dominating set, by removing all triangle loops in the backbone network, effectively reduce the number of node in the backbone network.Method of the present invention has linear time complexity, message complexity and the characteristics that are simple and easy to realize, the virtual backbone network that is generated is made up of through the select node of construction algorithm minority, routing function not only can be born, and the flow control and the connectivity management of network can be realized.
Description
Technical field
The present invention relates to the distribution type structuring method of virtual backbone network in a kind of wireless sensor network, be applicable to the structure of self-organizing, layering routing management and the network topology of wireless sensor network.
Background technology
Along with the develop rapidly of the communication technology, embedded computing technique and sensor technology and increasingly mature, the microsensor with perception, computing capability and communication capacity begins worldwide to occur.The sensor network that is made of these microsensors has caused people's very big concern.This sensor network combines sensor technology, embedded computing technique, distributed information processing and the communication technology, the various environment in monitoring in real time collaboratively, perception and the collection network distributed areas or the information of monitoring target, and these information are handled, obtain detailed and information accurately, be sent to the user who needs these information.Sensor network can make people obtain a large amount of accurate and reliable information at any time and place with under any environmental condition.Therefore, this network system can be widely used in national defense and military, national security, environmental monitoring, traffic administration, health care, manufacturing industry, anti-terrorism and the field such as combat a natural disaster.Sensor network is a revolution of information perception and collection.Sensor network has proposed a large amount of challenge research topic in basic theory and two aspects of engineering to the scientific worker as a brand-new research field.
Wireless sensor network is just because of its great application prospect becomes a focus of research field.Different with traditional cable network and cellular network, this network does not rely on fixing physical infrastructure or control centre, and each node in the network all is the relation of equity.In this case, using traditional routing mechanism will cause each node in the network all will participate in the maintenance of Route Selection and route messages, in a large-scale network, this will greatly increase the Operating Complexity of system, the energy consumption efficiency of reduction network.Recently, a kind of thought of virtual backbone network is suggested the routing issue that solves in Ad hoc and the wireless sensor network.Virtual backbone network is made up of by the select node of construction algorithm minority, not only can bear routing function, and can realize flow control, functions such as network connectivity management.Only have small number of nodes to participate in routing function, this will reduce the expense of network greatly, improves resource utilization ratio.
Wireless sensor network can come modeling by the unit circle diagram on the two dimensional surface, promptly for a non-directed graph G=(V, E), v ∈ V represents a sensor node, node u, v ∈ V, when. the two is apart from d
Uv≤ 1 o'clock, then u had the limit to link to each other with v, i.e. (u, v) ∈ E.Connected dominating set (Connected Dominating Sets) is meant (V, E) set of a connection of existence at figure G=
Right
Make that (i, j) ∈ E claim that then S is figure G=(V, connected dominating set E).The method of connected dominating set (CDS) is because it simply efficiently becomes the main path that makes up virtual backbone network in Ad Hoc and wireless sensor network.In most application, in order to reduce communication overhead, save energy consumption and simplify connectivity management, require CDS to form by the node of minimal amount, promptly seek minimum connected dominating set (MCDS).This problem can only be tried to achieve suboptimal solution by approximate data within polynomial time, the quality of separating is weighed by approximate rate, i.e. the ratio of the node number of the CDS that approximate data produced and MCDS node number.
The distributed algorithm of MCDS is divided into two classes substantially at present: based on the method for sub-clustering and the method that directly generates.The former is divided into network bunch, and each bunch elects a bunch head by specific algorithm, and bunch first maximum independent set (MIS) that forms links to each other by gateway node between bunch head, and bunch head and gateway node are formed backbone network.The latter directly produces virtual backbone and does not need sub-clustering.
1) direct method:
A typical direct algorithm is list of references " Routing in ad hoc networks using minimumconnected dominating set " (Bharghavan V, Das B.Proceedings of InternationalConference on Communications ' 97, Montreal, Canada, June 1997.) proposed.This algorithm is divided into two stages: (1) searches an approximate minimum dominant set (MDS), and this is actually finding the solution of a set covering problem; (2) node that uses minimum spanning tree (MST) algorithm that dominant set is concentrated couples together, and the internal node that generates tree constitutes backbone network.
The another one direct algorithm is at document " On calculating connected dominating set forefficient routing in ad hoc wireless network. " (Wu J, Li HL.Proceedings of 3rdACM International Workshop on Discrete Algorithms and Methods for MobileComputing and Communications, 1999; 7-14.) middle elaboration.This method has proposed a kind of opposite thinking, and also be divided into 2 stages: (1) directly makes up CDS in UDG figure; (2) according to given rule the redundant node among the CDS is removed, thereby obtained approximate minimum CDS set.
More than two kinds of algorithms all can not guarantee the approximate rate of constant, that promptly separates is of low quality, time complexity and message complexity are all very high simultaneously.
2) based on the method for sub-clustering
Document " Distributed construction of connected dominating set in wireless ad hocnetwork. " (Wan PJ, Alzoubi KM, Frieder O.Proceedings of IEEE INFOCOM, 2002; 1597-1604.) proposed a kind of virtual backbone network based on sub-clustering and form algorithm.Elect a bunch head by relevant sub-clustering algorithm, bunch first maximum independent set (MIS) that forms calculates minimum spanning tree by the method for dark search earlier again, and the nonleaf node that generates at last in the tree constitutes virtual backbone network.This method has the approximate rate of constant and time complexity and O (nlogn) the message complexity of O (n).This method is because needing to calculate generates tree, and promptly topology information of the whole network and message synchronization have higher realization complexity and communication overhead, and this is unpractical for resource-constrained wireless sensor network.
Document " Message-optimal connected dominating set construction for routing inmobile ad hoc networks. " (Alzoubi KM, Li XY, Wang Y, Wan PJ, Frieder O.Proceedings of Third ACM International Symposium on Mobile Ad Hoc Networksand Computing (MobiHoc ' 02), 2002) in, the author has proposed a kind of virtual backbone network construction method of linear message complexity.This method does not need calculate to generate tree, realizes comparatively simply, and has the approximate rate of constant.However, the virtual backbone network that this method generates is because there is the loop, still causes the virtual backbone network that produces larger, increased the complexity of route implementing.
Summary of the invention
The objective of the invention is at the deficiencies in the prior art, propose the distribution type structuring method of virtual backbone network in a kind of wireless sensor network, can effectively reduce the scale of backbone network, thereby simplify the complexity of Routing Protocol, improve the operating efficiency of system.
In order to realize this purpose, the present invention proposes a kind of distributed virtual backbone network formation method based on minimum connected dominating set.This method implementation procedure is divided into two stages: in first stage, make up maximum independent set by the sub-clustering algorithm, the whole node set is divided into bunch head and two set of ordinary node; Second stage, seek gateway node a bunch head is coupled together, form a connected dominating set, by removing all triangle loops in the backbone network, effectively reduce the number of node in the backbone network.
Method of the present invention comprises following concrete steps:
1) initial condition of each node all is a both candidate nodes in the network, finds to compare with all neighbor nodes when a both candidate nodes, and the sign minimum of oneself then changes state into a bunch head, and broadcasting bunch its adjacent node of indictment attitude message informing;
2) receive a bunch indictment attitude message when a both candidate nodes, expression has had neighbours to become a bunch head, according in network, guaranteeing the equally distributed principle of bunch head, this node becomes forfeiture the possibility of " bunch head ", the state that then changes oneself is an ordinary node, and broadcasting ordinary node status message notice adjacent node;
3) after all both candidate nodes in the network are determined the state of oneself, the whole node set just is divided into bunch head and two set of ordinary node; Each bunch head and ordinary node generate the list structure of the first information of storage adjacent cluster, and the chain table record comprises the sign of all adjacent cluster head, and arrive these adjacent cluster first the middle ordinary node of process;
4) when a bunch of head by searching chained list, know own and all adjacent cluster prime minister ratios when having minimum sign, all adjacent cluster head are made as target bunch head, and initiate connection request, comprise all entries of this node list structure in this request message;
5) receive connection request message when an ordinary node, at first check oneself whether to appear in the entry of request message, if not abandon this message, if, the state of oneself is become gateway node, and, upgrade the pairing middle ordinary node of target bunch head in this request message entry according to the information in the own list structure; After finishing, renewal process transmits this message;
6) receive forwarding message when an ordinary node, check whether oneself appears in the entry of this message as middle ordinary node, if not abandon this message; If, change node state into gateway node, and continue to transmit this message;
7) receive the message of forwarding as a bunch of head, check that at first whether oneself is as target bunch head, if not then abandoning this message, if, then the message that receives and the information in self chained list are contrasted, remove all records of target bunch prime minister pass therewith, promptly the corresponding bunch of head that is removed no longer initiated connection request; When all after little adjacent cluster capital finishes connection request than oneself sign, the first list structure of checking oneself of this bunch, in the chained list content, still there be the entry first relevant, then these adjacent cluster head be made as target bunch head, and initiate connection request with adjacent cluster; In the chained list content, there be not the entry first relevant, then no longer initiate connection request with adjacent cluster;
8) when the first node of all bunches is no longer initiated connection request, first node of all bunches and gateway node form virtual backbone network, finish route and management function.
Method of the present invention has linear time complexity, message complexity and the characteristics that are simple and easy to realize, the virtual backbone network that is generated is made up of through the select node of construction algorithm minority, routing function not only can be born, and the flow control and the connectivity management of network can be realized.These good performances have increased the range of application of this method greatly.Theory analysis and simulation result show that all method of the present invention is better than classic algorithm.
Description of drawings
Fig. 1 is the embodiment that virtual backbone network forms in the wireless sensor network.
Fig. 2 is a virtual backbone network of employing the inventive method generation and other algorithm simulating result's contrast.
Fig. 3 is another virtual backbone network of employing the inventive method generation and other algorithm simulating result's contrast.
Embodiment
Below in conjunction with drawings and Examples technical scheme of the present invention is further described.
Method specific implementation process of the present invention:
● make up maximum independent set
The initial condition of each node all is a both candidate nodes.When both candidate nodes v finds to compare with all neighbours, the sign ID minimum of oneself then changes state into bunch head and broadcasts IamDominator (v) its adjacent node of message informing.When a both candidate nodes u receives IamDominator message, expression has had neighbours to become a bunch head, according to should guaranteeing the equally distributed principle of bunch head in network, this node becomes the possibility of bunch head with forfeiture, and the state that changes oneself is ordinary node and broadcasts IamDominatee (u) message.After all nodes in the network were determined the state of oneself, a bunch first node had just been formed maximum independent set.
Ordinary node u generates a list structure OneHopDominatorList after knowing all neighbours' state, note the information of all adjacent cluster head, and broadcast MyOneHopDominatorList (u) then comprises the content of this chained list.
Adjacent cluster head receives MyOneHopDominatorList (u) afterwards, by the searching record item, know and bunch first information that two hop distances are arranged oneself, its information is preserved, join among the chained list TwoHopDominatorList of oneself, and the middle ordinary node of its correspondence is made as node u.
Ordinary node w receives MyOneHopDominatorList (u) afterwards, generates second list structure TwoHopDominatorList, notes bunch head of the own double bounce of all distances, and the middle ordinary node of its correspondence is made as node u.After receiving the MyOneHopDominatorList message of all adjacent ordinary nodes, node w broadcast MyTwoHopDominatorList (w) comprises all and the own information of bunch head of double bounce apart.The content of TwoHopDominatorList chained list.
Bunch first v receives MyTwoHopDominatorList (w) afterwards, the searching record item, by generating chained list ThreeHopDominatorList, storage apart from oneself three jump the information of bunch head, and record corresponding in the middle of ordinary node be w.For convenience, define the variable of usage count simultaneously Number_CH record bunch first number here.
● seek gateway node, make up virtual backbone network
Seek the gateway node process by bunch first launch.Bunch first u, at first search the first information of storage adjacent cluster list structure, when finding the own bunch prime minister ratio adjacent, when having minimum ID, initiate connection request with all, broadcasting TryConnect (u) message comprises the information of all " adjacent cluster head ".
When receiving TryConnect (u) message, an ordinary node v checks at first whether the ID of oneself appears in the entry.If have, oneself state is become gateway node.For the entry that comprises v, the branch situation is handled: if target bunch head and own adjacent (appearing at chained list OneHopDominatorList), the item of holding the record is constant; Otherwise continue to search TwoHopDominatorList, the middle ordinary node that changes linking objective bunch head is the middle ordinary node in this chained list.(v, u) message comprise amended entry to broadcasting ForwardingConnection.
(v, u) message check at first whether oneself appears in this message as intermediate node when an ordinary node receives ForwardingConnection.If then node state is changed into gateway node and transmits this message.
(v, u) message check that at first whether oneself is as target bunch head when a bunch of head receives a ForwardingConnection.If, variable Number_CH then successively decreases, and in these two chained lists of TwoHopDominatorList and ThreeHopDominatorList, remove the record (no longer a bunch first launch is connected to this target, has promptly eliminated the triangle loop) that all targets therewith bunch prime minister is closed.If variable Number_CH is non-vanishing, this bunch first launch connection request.If variable Number_CH is zero, then no longer initiate connection request.
Finally, when connection request is no longer initiated in all bunches capital, elect bunch head and the gateway node that come and form virtual backbone network, finish route and other management functions.
In an embodiment shown in Figure 1, white circle is represented both candidate nodes, black circles representative bunch head, and gray circles is represented ordinary node, and ring-like circle is represented gateway node.The implementation of this method is as follows:
(1) all nodes all are both candidate nodes under the initial situation, shown in Fig. 1 (a).
(2) at Fig. 1 (b), node 1 and 8 is chosen as a bunch head, and this is because compare their sign minimum with its neighbours.Though node 3 is not the minimum node (node 2 is its neighbours) of sign because node 2 added node 1 bunch and lost the right that becomes bunch head, so node 3 also becomes a bunch head.Other nodes become ordinary node.
(3) in Fig. 1 (c), have minimum sign among the adjacent cluster head because be informed in, node 1 is at first initiated connection request.
(4) in Fig. 1 (d), behind the connection request that receives node 1, node 2 finds it oneself is the tie point that leads to target bunch head 3 by the Query Information chained list, is gateway node and broadcasting forwarding information so change the state of oneself.Similarly, node 6 discoveries oneself are the tie points on the path (1,8), are gateway node so change the state of oneself, and selection node 10 is as second intermediate node on this path and transmit this message.
(5) in Fig. 1 (e), when receiving forwarding message from node 6, node 10 knows it oneself is tie point on the path (1,8), and the state that changes oneself is gateway node and continues to transmit this message.When receiving forwarding message from node 2, bunch head 3 learns that bunch head 1 has set up a path of leading to bunch head 8, so it will abandon the connection request to node 8, thereby has eliminated leg-of-mutton loop.
(6) final, shown in Fig. 1 (f), bunch first node 1,3,8 and gateway node 2,6,10 have formed virtual backbone network.
Performance evaluation
The present invention has following characteristic:
Characteristic 1: the scale of the virtual backbone network that the present invention makes up is the minimum constant times that is communicated with independent sets.By description of the invention as can be known, the number of bunch head and gateway node all is the minimum constant times that is communicated with independent sets, so the scale of the virtual backbone network that the two addition is formed also is the minimum constant times that is communicated with independent sets.
Characteristic 2: the present invention has the time complexity of O (n), and n represents the number of node in the network.In first stage of the present invention, each ordinary node waits for that the neighbours of other low sign make decision.The time complexity ascending order or the descending of algorithm be in alignment under the worst case, and algorithm complexity is O (n).Similarly, second stage, each bunch be first waits for the connection request of bunch running initially out of other low signs.Bunch first quantity mostly is n most, so the time complexity under the worst case also is O (n), this characteristic must be demonstrate,proved.
Characteristic 3: the present invention has the message complexity of O (n).In first stage of the present invention, a node is broadcasted a message at most.Second stage, each bunch head is connection request message of broadcasting at most.A gateway node receives and transmits 25 message at most, so message complexity of the present invention is O (n) under the worst case.
Simulation result
Come the performance of method more of the present invention and other two kinds of classical ways below by emulation experiment.Experimental model is made up of 100,200,400,600 and 800 nodes, and they are evenly distributed at random, and (x=0 is y=0) to (x=200, in this square area y=200), the wireless coverage radius R is respectively 30 and 50 long measures.
By emulation experiment repeatedly, we have compared the scale of three kinds of virtual backbone networks that algorithm produced.When Fig. 2 is illustrated in the fixed wireless covering radius and is 50 unit lengths, the scale of virtual backbone network and the relation of number of network node.Clearly, compare with other two kinds of classical ways, our method has obviously reduced the scale of wireless sensor network virtual backbone network.When fixedly R wireless coverage radius is 30 unit lengths, simulation shows similar result, as shown in Figure 3.
Claims (1)
1, the distribution type structuring method of virtual backbone network in a kind of wireless sensor network is characterized in that comprising following concrete steps:
1) initial condition of each node all is a both candidate nodes in the network, finds to compare with all neighbor nodes when a both candidate nodes, and the sign minimum of oneself then changes state into a bunch head, and broadcasting bunch its adjacent node of indictment attitude message informing;
2) receive a bunch indictment attitude message when a both candidate nodes, expression has had neighbours to become a bunch head, and the state that then changes oneself is an ordinary node, and broadcasting ordinary node status message notice adjacent node;
3) after all both candidate nodes in the network are determined the state of oneself, the whole node set just is divided into bunch head and two set of ordinary node; Each bunch head and ordinary node generate the list structure of the first information of storage adjacent cluster, and the chain table record comprises the sign of all adjacent cluster head, and arrive these adjacent cluster first the middle ordinary node of process;
4) when a bunch of head by searching chained list, know own and all adjacent cluster prime minister ratios when having minimum sign, all adjacent cluster head are made as target bunch head, and initiate connection request, comprise all entries of this node list structure in this request message;
5) receive connection request message when an ordinary node, at first check oneself whether to appear in the entry of request message, if not abandon this message, if, the state of oneself is become gateway node, and, upgrade the pairing middle ordinary node of target bunch head in this request message entry according to the information in the own list structure; After finishing, renewal process transmits this message;
6) receive forwarding message when an ordinary node, check whether oneself appears in the entry of this message as middle ordinary node, if not abandon this message; If, change node state into gateway node, and continue to transmit this message;
7) receive the message of forwarding as a bunch of head, check that at first whether oneself is as target bunch head, if not then abandoning this message, if, then the message that receives and the information in self chained list are contrasted, remove all records of target bunch prime minister pass therewith, promptly the corresponding bunch of head that is removed no longer initiated connection request; When all after little adjacent cluster capital finishes connection request than oneself sign, the first list structure of checking oneself of this bunch, in the chained list content, still there be the entry first relevant, then these adjacent cluster head be made as target bunch head, and initiate connection request with adjacent cluster; In the chained list content, there be not the entry first relevant, then no longer initiate connection request with adjacent cluster;
8) when the first node of all bunches is no longer initiated connection request, first node of all bunches and gateway node form virtual backbone network, finish route and management function.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100309063A CN100558062C (en) | 2006-09-07 | 2006-09-07 | The distribution type structuring method of virtual backbone network in the wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100309063A CN100558062C (en) | 2006-09-07 | 2006-09-07 | The distribution type structuring method of virtual backbone network in the wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1917460A CN1917460A (en) | 2007-02-21 |
| CN100558062C true CN100558062C (en) | 2009-11-04 |
Family
ID=37738358
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100309063A Expired - Fee Related CN100558062C (en) | 2006-09-07 | 2006-09-07 | The distribution type structuring method of virtual backbone network in the wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100558062C (en) |
Families Citing this family (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101652959B (en) * | 2007-03-12 | 2013-01-30 | Lm爱立信电话有限公司 | Arrangement and method relating to network management |
| CN101374083B (en) * | 2007-08-21 | 2011-04-13 | 中国科学院计算技术研究所 | Wireless sensor network simulator and node event processing method thereof |
| CN101119303B (en) * | 2007-08-30 | 2010-08-11 | 浙江工业大学 | Dynamic cluster based multi-objective programming wireless sensing network routing algorithm |
| CN101452642B (en) * | 2007-12-06 | 2011-12-28 | 武汉大学 | Combined infrared displacement sensor network node for monitoring mountain massif coast |
| CN101286933B (en) * | 2008-03-05 | 2011-03-30 | 中国科学院嘉兴无线传感网工程中心 | Self-adapting cluster regulating method for wireless sensor network based on flow rate |
| CN101286910B (en) * | 2008-03-05 | 2011-05-18 | 中国科学院嘉兴无线传感网工程中心 | Task oriented wireless sensing network topology constructing method |
| CN101562780B (en) * | 2009-02-20 | 2011-07-20 | 西部矿业股份有限公司 | MCDS approximation algorithm-based multicast route method with minimized resource consumption |
| CN101711062B (en) * | 2009-11-27 | 2012-11-07 | 上海交通大学 | Distributed wireless sensor network node positioning method |
| CN101835170B (en) * | 2010-04-20 | 2012-09-26 | 南京邮电大学 | Coverage enhancement method of wireless multi-media sensor network based on intellectual evolution |
| CN101917750B (en) * | 2010-07-30 | 2012-12-05 | 南京工业大学 | Least effort delivering zone-spanned virtual cluster multi-hop routing method |
| CN101982994B (en) * | 2010-11-09 | 2013-05-01 | 上海交通大学 | Method for optimizing transmission path based on multi-hop clustering coding forward pass relay network |
| CN102075864A (en) * | 2010-12-30 | 2011-05-25 | 青海西部矿业科技有限公司 | MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure |
| CN102845036B (en) * | 2012-02-06 | 2016-01-27 | 华为技术有限公司 | A kind of method and system propagating node status information in distributed cluster system |
| CN102612083B (en) * | 2012-03-27 | 2014-06-04 | 南京工业大学 | Method for constructing connected dominating set based on exclusive region in wireless sensor network |
| CN102625403B (en) * | 2012-05-04 | 2014-06-18 | 北京邮电大学 | Method for generating and maintaining virtual backbone network in mobile adhoe networking |
| CN102685861B (en) * | 2012-05-11 | 2014-08-27 | 北京邮电大学 | Method and device for collecting data by sink nodes of wireless sensor network |
| CN102740312A (en) * | 2012-07-12 | 2012-10-17 | 北京邮电大学 | Coverage control method of wireless sensor network |
| CN106921948B (en) * | 2015-12-24 | 2019-07-05 | 中国电信股份有限公司 | Method, network node and the system for dividing group are realized based on mark extreme value |
| CN109714260B (en) * | 2019-01-04 | 2020-09-04 | 浙江大学 | Implementation method for building virtual backbone network based on UCDS algorithm in OLSR routing protocol |
| CN111491324B (en) * | 2019-01-29 | 2022-04-01 | 大唐移动通信设备有限公司 | Method, device and storage medium for maintaining virtual backbone network |
| CN112566210B (en) * | 2020-12-08 | 2022-12-27 | 三维通信股份有限公司 | Data transmission method and device, storage medium and electronic device |
| WO2023184213A1 (en) * | 2022-03-30 | 2023-10-05 | 江苏杰泽罗通信科技有限公司 | Clustered optimized link state routing method based on virtual backbone network |
| CN115955680B (en) * | 2023-03-14 | 2023-05-16 | 南京邮电大学 | Virtual backbone network establishment and routing method based on clustering communication |
-
2006
- 2006-09-07 CN CNB2006100309063A patent/CN100558062C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1917460A (en) | 2007-02-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100558062C (en) | The distribution type structuring method of virtual backbone network in the wireless sensor network | |
| Butenko et al. | On the construction of virtual backbone for ad hoc wireless network | |
| CN103647714B (en) | A kind of mobile social Delay Tolerant Network method for routing based on social energy | |
| Das et al. | Fuzzy based energy efficient multicast routing for ad-hoc network | |
| Pachlor et al. | VCH‐ECCR: A Centralized Routing Protocol for Wireless Sensor Networks | |
| CN104378229A (en) | Link prediction method for opportunity network | |
| KR101387248B1 (en) | Generating method for balanced chain topology in wireless sensor networks | |
| Mozumdar et al. | An Efficient Data Aggregation Algorithm for Cluster-based Sensor Network. | |
| Ruan et al. | A distance clustering routing algorithm considering energy for wireless sensor networks | |
| Mahlknecht et al. | Energy aware distance vector routing scheme for data centric low power wireless sensor networks | |
| Tahmassebpour | Methods and algorithms of capacity calculation and increase throughput in wireless sensor networks base of ZigBee: A survey | |
| CN102083167A (en) | Query-based routing method for multi-sink-node wireless sensor network | |
| Barati et al. | A distributed energy aware clustering approach for large scale wireless sensor network | |
| Kamgueu et al. | Fuzzy-based routing metrics combination for RPL | |
| Li et al. | A tree based data collection scheme for wireless sensor network | |
| Chaudhary et al. | Performance optimization of WSN using deterministic energy efficient clustering protocol: A review | |
| CN103002536A (en) | Energy efficient wireless multi-hop network routing mechanism based on random walks | |
| Shi et al. | A clustering algorithm of ad-hoc network based on honeycomb division | |
| Zhang et al. | A lifetime optimization mobile data gathering strategy with adaptive compressive sensing in WSN | |
| Li et al. | Efficient load balance data aggregation methods for WSN based on compressive network coding | |
| Ananth et al. | Dual cluster head algorithm for proficient routing in wireless sensor networks | |
| Chiu et al. | The adaptive routing algorithm for linked-list wireless network with wormhole mechanism | |
| Xuebin et al. | A community-based routing algorithm for opportunistic networks | |
| Reebha | Fuzzy Logic Based Clustering With Firefly Optimized Routing Protocol For Qos Aware Wireless Sensor Networks | |
| Hilal et al. | Echo Location Based Bat Algorithm for Energy Efficient WSN Routing. |
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: 20091104 Termination date: 20120907 |