CN102395182B - Three-dimensional wireless sensor network topology control method with two-dimensional bounded property - Google Patents

Three-dimensional wireless sensor network topology control method with two-dimensional bounded property Download PDF

Info

Publication number
CN102395182B
CN102395182B CN201110421001.XA CN201110421001A CN102395182B CN 102395182 B CN102395182 B CN 102395182B CN 201110421001 A CN201110421001 A CN 201110421001A CN 102395182 B CN102395182 B CN 102395182B
Authority
CN
China
Prior art keywords
node
3dyao
neighbor node
neighbor
collection
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
Application number
CN201110421001.XA
Other languages
Chinese (zh)
Other versions
CN102395182A (en
Inventor
李凡
王昱
陈泽明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Institute of Technology BIT
Original Assignee
Beijing Institute of Technology BIT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Institute of Technology BIT filed Critical Beijing Institute of Technology BIT
Priority to CN201110421001.XA priority Critical patent/CN102395182B/en
Publication of CN102395182A publication Critical patent/CN102395182A/en
Application granted granted Critical
Publication of CN102395182B publication Critical patent/CN102395182B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

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)

Abstract

The invention relates to a three-dimensional wireless sensor network topology control method with a two-dimensional bounded property. The method comprises the following steps that: step one, with regard to a random node u, a neighboring node set NUBG (u) of the random node u is calculated; step two, a 3DYAO algorithm is utilized to carry out processing on the NUBG (u) to obtain an NYG (u); step three, the NYG (u) is broadcasted for the NUBG (u); step four, an introverted neighboring set of the node u is calculated; step five, the same 3DYAO algorithm used in the step two is used to carry out processing on the introverted neighboring set to obtain a processed neighboring node set of the node u; step six, the processed neighboring node set is broadcasted for all neighbors in the NUBG (u); step seven, for all nodes v in the NYG (u), if the u is also in the processed neighboring node set, the v is added into an NYYG (u); and step eight, a two-dimensional bounded three-dimensional wireless sensor network topology NYYG (u) of the node u is output and a transmitting power is adjusted as being capable of reaching a farthest neighboring position in the NYYG (u). According to the invention, the method has two-dimensional bounded and high efficient energy saving characteristics; an objective of locally distributed realization can be achieved; network life cycle can be extended; a network interference can be reduced; and an objective of improvement of a network throughput rate can also be achieved.

Description

The 3-D wireless sensor network topology control method of two-way degree bounded
Technical field
The present invention relates to a kind of 3-D wireless sensor network topology control method, be specifically related to a kind of two-way degree bounded, energy-efficient, distributed topology control method that 3-D wireless sensor network is proposed, belong to 3-D wireless network topology control field, be suitable for extensive, self-organizing, random placement, circumstance complication and the limited wireless sensor network of node energy.
Background technology
Wireless sensor network is the ad hoc network system that the mode by multi-hop forms by the miniature low-power consumption sensor node in a large number with data sampling and processing and wireless communication ability, its objective is the information of perceptive object in the geographic area of perception collaboratively, the acquisition and processing network coverage.The feature that wireless sensor network generally has on a large scale, self-organizing, random placement, circumstance complication, sensor node resource-constrained, network topology often change.Transducer, perceptron and observer have formed three key elements of wireless sensor network.To sensor network research, almost concentrate entirely on desirable two dimensional surface in early days, its basic assumption is that node distributes at two dimensional surface.Yet network is under water supposed and be not suitable for to this two dimension, because being distributed in the waters of different depth, most of underwater sensor network system requirements node carries out perception task.
3-D wireless sensor network is by being deployed in three physical dimensions, has a Radio Network System that the sensor node of certain perception task forms.Now there is the application of a large amount of 3-D wireless networks, as the wireless network of each layer of building etc. is predicted, is deployed in underwater static sensor network, mobile underwater installation network, Space environment monitor, forest fire.The rise of underwater sensor network research especially in recent years, has promoted the development of three-dimension sensor network system.
The node volume that forms 3-D wireless sensor network is small, and computing capability and communication capacity are quite limited, and the energy of node relies on battery to provide and can not obtain follow-up supplementing.So sensor node energy consumption in the course of the work is just directly connected to the life span of whole network.If each node carries out communication with maximum power, not only node energy consumption is very fast, and will inevitably aggravate the interference of signal between node, reduces communication efficiency.
Topology control method is that a kind of each node transmitting power that arranges is the method for transmission range, and its target is by controlling the transmission range of node, is reducing under the prerequisite of system capacity consumption, guarantees connectedness and the spreadability of whole network topology.Topology is controlled in wireless sensor network research significant: first, it is a kind of important power-saving technology that topology is controlled; Secondly, topology is controlled ensuring coverage quality and is communicated with quality; Again, topological control can reduce the efficiency that Communication Jamming improves MAC agreement and Routing Protocol, for data fusion provides topology basis; In addition, topological control can improve other performances such as reliability, extensibility of network.
Topology is controlled at a large amount of results of study on two dimensional surface, but it is very few at present three-dimensional topology to be controlled to research both at home and abroad.Compare with two dimensional wireless sensor network, 3-D wireless sensor network has proposed many new problems and challenge, as his problem difficulty increases; Computation complexity rises at double; Reality physical structure is complicated.And the research of 3-D wireless sensor network at present mainly concentrates on its covering quality, is communicated with in the problems such as quality and route.Through the literature search of prior art is found, the topology control method that is applicable at present 3-D wireless sensor network has following agreement:
1) LMST (Local Minimum Spanning Tree) agreement.The LMST agreement that document < < Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks > > carries can expand to three-dimensional network, can guarantee the network after processing be communicated with, but it likely has very large energy consumption, its energy spread factor does not have boundary.
2) CBTC (Cone-Based Distributed Topology Control) agreement.CBTC is a distributed algorithm based on direction that can guarantee network connectivty, is originally that one for the agreement of two dimensional wireless sensor network.The people such as Bahramgiri of Massachusetts Polytechnics are generalized to three dimensions in document < < Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks > >, have proposed fault-tolerant CBTC agreement.Its core is to check in each three-dimensional circular cone that the angle take centered by u is α whether have the neighbor node that can communicate by letter.They have proved when α≤2 π/(3k), and three-dimensional CBTC keeps the k-of network diagram connective.But this method does not provide the proof of energy bounded and degree bounded, and the reliable directional information of the needs of the algorithm based on direction, node need to be equipped with a plurality of oriented antennas, thereby sensor node has been proposed to higher requirement.
3) XTC agreement.The people such as Wattenhofer propose a Topology Control Algorithm based on neighbours---XTC agreement in document < < XTC:A practical topology control algorithm for ad-hoc networks > >.The calculating of agreement only depends on local message, and each node only needs to exchange information twice with neighbor node.But they not to XTC the topological structure in three-dimensional do any theory and experimental analysis.
4) 3DRNG, 3DGG and 3DYAO.RNG, GG, YAO are the Topology Control Algorithms of three kinds of two dimensional wireless sensor networks.The people such as Yu Wang are generalized to three dimensions at document < < Energy-efficient topology control for three-dimensional sensor networks > >, and have proved the topological property of 3DRNG, 3DGG and 3DYAO.As 3DRNG has connectedness, but do not there is energy supportive; 3DGG has connectedness, and its energy t-Spanner coefficient is 1; 3DYAO has connectedness, energy supportive and export-oriented degree boundedness.
In sum, current all propositions does not all have two-way (introversive and export-oriented) to spend the character of bounded for 3-D wireless sensor topology of networks.Node number of degrees bounded refers to that neighbours' number of node in the topological structure generating is less than a constant k, the number of degrees that reduce node can reduce the quantity of node forwarding messages and the complexity that route is calculated, and this is significant for conserve energy and reduction network interferences.
Summary of the invention
The object of the invention is the defect for prior art, a kind of topology control method of 3-D wireless sensor network is provided, guarantee that the topological structure of its generation has two-way degree bounded and energy-efficient characteristic.
The object of the invention is to be achieved through the following technical solutions:
A 3-D wireless sensor network topology control method for two-way degree bounded, comprises following steps:
One,, for the arbitrary node u in given 3-D wireless sensor network, calculate its neighbor node collection N uBG(u) set of node that, the maximum communication distance of u can cover;
Two, with the neighbor node collection N of node u uBG(u) be input, use 3DYAO algorithm to process it, obtain the 3DYAO neighbor node collection N after u node processing yG(u);
Three, 3DYAO neighbor node collection N yG(u) to the neighbor node collection N of u uBG(u) broadcast;
Four, the interior of computing node u collects to neighbours if u ∈ is N yG(v), so v being added to the interior of ingress u collects to neighbours
Figure BDA0000120310350000032
in,
Figure BDA0000120310350000033
Five, with the interior of node u, to neighbours, collect
Figure BDA0000120310350000034
for input, use and with 3DYAO algorithm identical in step 2, it is processed, obtain the neighbor node collection after u node processing
Figure BDA0000120310350000035
Six, set of node
Figure BDA0000120310350000036
neighbor node collection N to u uBG(u) all neighbours' broadcast in;
Seven, for N yG(u) all node v in, if u also exists in, so just v is added to N yYG(u) in;
Eight, the 3-D wireless sensor network topology N of the two-way degree bounded of output node u yYG(u), adjust transmitting power for can reach N yYG(u) neighbor location farthest in.
Beneficial effect
The method that the present invention proposes is the three-dimensional topology control method based on 3DYAO, has two-way degree bounded and energy-efficient characteristic, can reach prolongation network lifecycle at local distributed implementation, reduces network interferences, improves the object of network throughput.
Three-dimensional topology is controlled to research both at home and abroad at present very few, and do not have a kind of topological structure can there is the character of two-way degree bounded.The number of degrees that reduce node can reduce the quantity of node forwarding messages and the complexity that route is calculated, to reach the object that reduces network interferences and conserve energy.
The method that the present invention proposes also has the characteristic that energy supports factor bounded.It has concentrated number of degrees bounded and energy to control the advantage of two kinds of solutions of topology control at present, the life cycle that has extended more network.
The method that the present invention proposes is considered computing capability and the ability to communicate that sensor node is limited, method complexity and communication number of times are all fewer, and be distributed control, only the paddle one's own canoe information of constant hop neighbor of node in network, does not need the topological structure that global information just can local structure oneself.
Accompanying drawing explanation
Fig. 1 is the specific implementation flow process of the 3-D wireless sensor network topology control method of two-way degree bounded.
Fig. 2 is the 3DYAO structure of using fixed partition method.
Fig. 3 is the 3DYAO structure of using flexible partitioning.
Embodiment
Below in conjunction with accompanying drawing, embodiments of the invention are elaborated: the present embodiment is implemented take technical solution of the present invention under prerequisite, provided detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to subordinate's embodiment.
Fig. 1 has provided the detailed flow process of three-dimension sensor network topology control method of the two-way degree bounded based on 3DYAO of the present invention, and concrete implementer's case is as follows:
Step 1: for the arbitrary node u in given wireless sensor network, calculate its neighbor node collection N uBG(u).Concrete computational methods are as follows:
Take node u as the centre of sphere, and the maximum communication distance R that the wireless sensor node transmitting power of take can reach is radius, forms a spheroid.In given 3-D wireless sensor network, if node v drops in spheroid, v is exactly the neighbor node of u so.All node v form the neighbor node collection N of u uBG(u).
Step 2: use the neighbor node collection N of 3DYAO algorithm to node u uBG(u) process, obtain the neighbor node collection N after u node processing yG(u).
As the preferred embodiment of the present invention, 3DYAO algorithm adopts fixed partition method or flexible partitioning.Specifically describe the 3DYAO topological structure of these two kinds of partitionings below.
1) fixed partition method:
In fixed partition method, for arbitrary node, the division methods of cone is all identical, and the cone of dividing mutually disjoints.Specifically can there be two kinds of division methods:
The first: to arbitrary node u, first use three orthogonal planes (xy plane, yz plane and xz plane) that the transmission range UBG of u is divided into 8 regions, each region is 1/8 spheroid; Secondly, re-use three each regions of bundle of planes and be divided into 4 cones, as shown in Fig. 2 (a), the c1 shown in figure, c2 and c3 are respectively the mid points of place circular arc.Like this transmission range of u has been divided into 32 cones that mutually disjoint.Finally, in any centrum, for the neighbor node collection N of u uBG(u), node u only selects the shortest limit uv of length in cone to retain, and these directed edges uv has formed 3DYAO topological structure N yG(u).The number of degrees of the 3DYAO structure that this partitioning forms are 32 to the maximum.
The second: to arbitrary node u, first use three orthogonal planes (xy plane, yz plane and xz plane) that the transmission range UBG of u is divided into 8 regions, each region is 1/8 spheroid; Secondly, use 6 each regions of bundle of planes to be divided into 7 cones, as shown in Fig. 2 (b), wherein, ci and ci ' (i=1,2,3) are respectively the trisection points of place circular arc.Like this transmission range of u has been divided into 56 cones.Finally, in any centrum, for the neighbor node collection N of u uBG(u), node u only selects the shortest limit uv of length in cone to retain, and these directed edges uv has formed 3DYAO topological structure N yG(u).The number of degrees of the 3DYAO structure that this partitioning forms are 56 to the maximum.
2) flexible partitioning:
In this partitioning, for different nodes, the division methods of cone is different, and the cone of division can intersect each other.Specifically there are two kinds of division methods:
The first:
1a) to arbitrary node u, first calculate its neighbor node collection;
Arbitrary neighbor node v 1b) neighbor node of node u being concentrated, establishes PROCESSED (v)=0;
1c) to arbitrary neighbor node v, and there is PROCESSED (v)=0, carry out following steps:
1. take uv as axle, the angle θ who is less than π/3 of take is drift angle, builds a cone;
2. node u selects limit uw the shortest in cone to retain, and to all neighbor node x in cone, establishes PROCESSED (x)=1;
1d) these directed edges uw has formed 3DYAO topological structure N yG(u).
As shown in Fig. 3 (a).
The second:
2a) to arbitrary node u, first calculate its neighbor node collection;
2b) according to node u to neighbor node v ilength ascending to u v isort, || u v i||≤|| uv i+1|| (i is by 1 to m, and m is neighbor node number));
2c) to all neighbor node v i(i by 1 to m), establishes PROCESSED (v i)=0;
2d) to neighbor node v i(i by 1 to m), if PROCESSED (v i)=0, carry out following steps:
1. with u v ifor axle, the angle θ who is less than 2 π/3 of take is drift angle, builds a cone;
2. node u selects limit u v iretain, and to all neighbor node w in cone, establish PROCESSED (w)=1;
2e) these directed edges u v iformed 3DYAO topological structure N yG(u).
As shown in Fig. 3 (b).
After step 2 is processed, can guarantee that the outer U Degree U of network after processing is a constant.
Step 3: 3DYAO neighbor node collection N yG(u) to the neighbor node collection N of u uBG(u) all neighbours' broadcast in.
Step 4: the interior of computing node u collects to neighbours
Figure BDA0000120310350000061
if u ∈ is N yG(v), so v being added to the interior of ingress u collects to neighbours
Figure BDA0000120310350000062
in,
Figure BDA0000120310350000063
Step 5: collect to neighbours with the interior of node u
Figure BDA0000120310350000064
for input, choose with step 2 in identical 3DYAO algorithm it is processed, obtain the neighbor node collection after u node processing
Figure BDA0000120310350000065
After step 5 is processed, can guarantee that in the network after processing, U Degree U is a constant.
Step 6: set of node
Figure BDA0000120310350000066
neighbor node collection N to u uBG(u) all neighbours' broadcast in.
Step 7: for N yG(u) all node v in, if u also exists
Figure BDA0000120310350000067
in, so just v is added to N yYG(u) in.
Step 8: the 3-D wireless sensor network topology N of the two-way degree bounded of output node u yYG(u), adjust transmitting power for can reach N yYG(u) neighbor location farthest in.
The present invention is for neighbor node collection and interiorly to neighbours collection, adopt respectively 3DYAO algorithm to process.Because 3DYAO algorithm has connectedness, energy supportive and export-oriented degree boundedness, so the 3-D wireless sensor network topology structure of the present invention's structure has the characteristic of two-way degree bounded.The number of degrees that reduce node can reduce the quantity of node forwarding messages and the complexity that route is calculated, to reach the object that reduces network interferences and conserve energy.
The above is only the preferred embodiment of the present invention, should be understood that, the present invention proposes the 3-D wireless sensor network topology control method of this two-way degree bounded can be by carrying out twice operation and reach conserve energy meeting arbitrarily the algorithms of different of 3DYAO structure, two-way degree bounded, extend the life span of network, reduce the object of network interferences.For those skilled in the art, under the premise without departing from the principles of the invention, can also make some improvement, or part technical characterictic is wherein equal to replacement, these improvement and replace and also should be considered as protection scope of the present invention.

Claims (7)

1. a 3-D wireless sensor network topology control method for two-way degree bounded, comprises following steps:
One,, for the arbitrary node u in given 3-D wireless sensor network, calculate its neighbor node collection N uBG(u) set of node that, the maximum communication distance of u can cover;
Two, with the neighbor node collection N of node u uBG(u) be input, use 3DYAO algorithm to process it, obtain the 3DYAO neighbor node collection N after u node processing yG(u);
Three, 3DYAO neighbor node collection N yG(u) to the neighbor node collection N of u uBG(u) broadcast;
Four, the interior of computing node u collects to neighbours
Figure FDA0000409838710000011
if u ∈ is N yG(v), so v being added to the interior of ingress u collects to neighbours in,
Figure FDA0000409838710000013
n wherein yG(v) refer to the 3DYAO neighbor node collection after v node processing;
Five, with the interior of node u, to neighbours, collect
Figure FDA0000409838710000014
for input, use and with 3DYAO algorithm identical in step 2, it is processed, obtain the neighbor node collection after u node processing
Figure FDA0000409838710000015
Six, set of node
Figure FDA0000409838710000016
neighbor node collection N to u uBG(u) all neighbours' broadcast in;
Seven, for N yG(u) all node v in, if u also exists
Figure FDA0000409838710000017
in, so just v is added to N yYG(u) in; Wherein
Figure FDA0000409838710000018
refer to the neighbor node collection after v node processing;
Eight, the 3-D wireless sensor network topology N of the two-way degree bounded of output node u yYG(u), adjust transmitting power for can reach N yYG(u) neighbor location farthest in.
2. a kind of network topology control method according to claim 1, is characterized in that, the 3DYAO algorithm adopting in step 2 is fixed partition method.
3. a kind of network topology control method according to claim 2, is characterized in that, described fixed partition method is: to arbitrary node u, first use three orthogonal planes that the transmission range UBG of u is divided into 8 regions, each region is 1/8 spheroid; Secondly, re-use three each regions of bundle of planes and be divided into 4 cones, like this transmission range of u has been divided into 32 cones that mutually disjoint; Finally, in any centrum, for the neighbor node collection N of u uBG(u), node u only selects the shortest limit uv of length in cone to retain; These directed edges uv has formed 3DYAO topological structure N yG(u) number of degrees of the 3DYAO structure that, this partitioning forms are 32 to the maximum.
4. a kind of network topology control method according to claim 2, is characterized in that, described fixed partition method is: to arbitrary node u, first use three orthogonal planes that the transmission range UBG of u is divided into 8 regions, each region is 1/8 spheroid; Secondly, use 6 each regions of bundle of planes to be divided into 7 cones, like this transmission range of u has been divided into 56 cones; Finally, in any centrum, for the neighbor node collection N of u uBG(u), node u only selects the shortest limit uv of length in cone to retain, and these directed edges uv has formed 3DYAO topological structure N yG(u) number of degrees of the 3DYAO structure that, this partitioning forms are 56 to the maximum.
5. a kind of network topology control method according to claim 1, is characterized in that, the 3DYAO algorithm adopting in step 2 is flexible partitioning.
6. a kind of network topology control method according to claim 5, is characterized in that, described flexible partitioning is:
1a) to arbitrary node u, first calculate its neighbor node collection;
Arbitrary neighbor node v 1b) neighbor node of node u being concentrated, establishes PROCESSED (v)=0;
1c) to arbitrary neighbor node v, and there is PROCESSED (v)=0, carry out following steps:
1. take uv as axle, the angle θ who is less than π/3 of take is drift angle, builds a cone;
2. node u selects limit uw the shortest in cone to retain, and to all neighbor node x in cone, establishes PROCESSED (x)=1;
1d) these directed edges uw has formed 3DYAO topological structure N yG(u).
7. a kind of network topology control method according to claim 5, is characterized in that, described flexible partitioning is:
2a) to arbitrary node u, first calculate its neighbor node collection;
2b) according to node u to neighbor node v ilength ascending to u v isort, || uv i||≤|| uv i+1||, i is by 1 to m, and m is neighbor node number;
2c) to all neighbor node v i, i to m, establishes PROCESSED (v by 1 i)=0;
2d) to neighbor node v i, i by 1 to m, if PROCESSED (v i)=0, carry out following steps:
1. with uv ifor axle, the angle θ who is less than 2 π/3 of take is drift angle, builds a cone;
2. node u selects limit uv iretain, and to all neighbor node w in cone, establish PROCESSED (w)=1;
2e) these directed edges u v iformed 3DYAO topological structure N yG(u).
CN201110421001.XA 2011-12-15 2011-12-15 Three-dimensional wireless sensor network topology control method with two-dimensional bounded property Expired - Fee Related CN102395182B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110421001.XA CN102395182B (en) 2011-12-15 2011-12-15 Three-dimensional wireless sensor network topology control method with two-dimensional bounded property

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110421001.XA CN102395182B (en) 2011-12-15 2011-12-15 Three-dimensional wireless sensor network topology control method with two-dimensional bounded property

Publications (2)

Publication Number Publication Date
CN102395182A CN102395182A (en) 2012-03-28
CN102395182B true CN102395182B (en) 2014-04-09

Family

ID=45862365

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110421001.XA Expired - Fee Related CN102395182B (en) 2011-12-15 2011-12-15 Three-dimensional wireless sensor network topology control method with two-dimensional bounded property

Country Status (1)

Country Link
CN (1) CN102395182B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103916262B (en) * 2013-12-17 2017-09-01 哈尔滨安天科技股份有限公司 A kind of network topology layout method and system based on three dimensions
CN113630837B (en) * 2021-09-01 2023-10-13 哈尔滨工程大学 Mountain forest fire prevention oriented three-dimensional wireless sensor network data route fusion method
CN114039683A (en) * 2021-09-07 2022-02-11 西安理工大学 Anti-interference fault-tolerant method for wireless ultraviolet communication network of unmanned aerial vehicle cluster

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101286910A (en) * 2008-03-05 2008-10-15 中科院嘉兴中心微系统所分中心 Task oriented wireless sensing network topology constructing method
CN102256327A (en) * 2011-07-04 2011-11-23 南京邮电大学 Self-adaptive topology control method for wireless sensor network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9031571B2 (en) * 2008-04-11 2015-05-12 Alcatel Lucent Methods and apparatus for coverage verification in a wireless sensor network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101286910A (en) * 2008-03-05 2008-10-15 中科院嘉兴中心微系统所分中心 Task oriented wireless sensing network topology constructing method
CN102256327A (en) * 2011-07-04 2011-11-23 南京邮电大学 Self-adaptive topology control method for wireless sensor network

Also Published As

Publication number Publication date
CN102395182A (en) 2012-03-28

Similar Documents

Publication Publication Date Title
Zhou et al. Efficient localization for large-scale underwater sensor networks
Mohapatra et al. AD HOC NETWORKS: technologies and protocols
Bahramgiri et al. Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks
Rani et al. Multi-hop routing in wireless sensor networks: an overview, taxonomy, and research challenges
Wang et al. A novel node sinking algorithm for 3D coverage and connectivity in underwater sensor networks
CN101241177A (en) Wireless sensor network positioning system facing to three dimensional space
Lee et al. Time-critical underwater sensor diffusion with no proactive exchanges and negligible reactive floods
Wang et al. Energy-efficient topology control for three-dimensional sensor networks
Kumar et al. Position-based beaconless routing in wireless sensor networks
CN103298055A (en) Space grid region division based greedy routing method in underwater sensor network
Hosen et al. An energy efficient cluster formation and maintenance scheme for wireless sensor networks
CN102395182B (en) Three-dimensional wireless sensor network topology control method with two-dimensional bounded property
Yuvaraj et al. EESCA: Energy efficient structured clustering algorithm for wireless sensor networks
Banerjee et al. A modified mathematical model for life-time enhancement in wireless sensor network
Kai et al. Location-based routing algorithms for wireless sensor network
Vahabi et al. CBDS 2 R: A Cluster-Based Depth Source Selection Routing for Underwater Wireless Sensor Network
Mohiddin et al. Routing path estimation based on RWS method for competent energy dissipation employing X-layer network
Pachouri et al. UWSN with Technological Intervention: Benefits and Challenges
CN106211197A (en) A kind of construction method of air-sea orientation self-organizing network space division multiplexing time division multiple acess access model
Wang et al. Self-organizing fault-tolerant topology control in large-scale three-dimensional wireless networks
Wang Three-dimensional wireless sensor networks: geometric approaches for topology and routing design
Tchendji et al. Virtual architecture and energy-efficient routing protocols for 3D wireless sensor networks
Ammari 3D-k Cov-ComFor: An Energy-Efficient Framework for Composite Forwarding in Three-Dimensional Duty-Cycled k-Covered Wireless Sensor Networks
Durresi et al. Clustering protocol for sensor networks
Amgoth et al. Energy-aware multi-level routing algorithm for two-tier wireless sensor networks

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20140409

Termination date: 20141215

EXPY Termination of patent right or utility model