CN101483935B - Topology drawing algorithm for wireless Ad-Hoc network - Google Patents
Topology drawing algorithm for wireless Ad-Hoc network Download PDFInfo
- Publication number
- CN101483935B CN101483935B CN2008102403868A CN200810240386A CN101483935B CN 101483935 B CN101483935 B CN 101483935B CN 2008102403868 A CN2008102403868 A CN 2008102403868A CN 200810240386 A CN200810240386 A CN 200810240386A CN 101483935 B CN101483935 B CN 101483935B
- Authority
- CN
- China
- Prior art keywords
- node
- angle
- network
- neighbor
- centroid
- 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 invention provides a distributing type network topological diagram rendering algorithm adequate for wireless self-organize network. The algorithm renders topological diagram of a whole network according with neighbour information of various nodes in network. A node with most neighbour amount (or an appointed point) is used as a center node which locates in the diagram center, other nodes locate in a concentric circle which uses the center node position as a circle center, the circle radius increases along with increasing of jumping figure to the center node. The algorithm reappears network topological connection state simply and accurately, and provides foundation for realizing network basic function with high efficiency, such as routing, network management.
Description
Technical field
The invention belongs to communication technical field, relate to wireless self-organization network, be i.e. Ad hoc network.A kind of topological diagram rendering algorithm of wireless self-organization network specifically can dynamically reflect the topological connection state of the Ad hoc network that network topology is changeable and position relation accurately roughly intuitively.
Background technology
Ad hoc network is a kind of by provisional autonomous wireless system static or that mobile node is formed.It does not rely on existing network infrastructure, relies on internodal mutual cooperation to finish the node network interconnection to each other.Ad hoc network is mainly used in the military and promptly happens suddenly the interim occasion of occasion and difficult wiring.At present, Ad hoc network is just progressively to the business environment development, as sensor network, Virtual Class and home network etc.
The characteristics of Ad hoc network are mainly reflected in the following aspects: the network topology structure of (1) dynamic change: do not have fixing communications facility and central management equipment in the Ad hoc network, network node can move towards any direction with any speed randomly, causes the dynamic change of network topology.(2) Limited resources: the work capacity that offers mobile host in the Ad hoc network is limited; On the other hand, network itself provides conflict and the interference between limited bandwidth and the signal, makes the available limited transmission bandwidth of mobile host will be far smaller than theoretic maximum bandwidth.(3) distributed nature of network: do not have center control nodes in the Ad hoc network, main frame is interconnected by distributed protocol, and certain node has fault, but all the other nodes operate as normal still, and survivability is strong.(4) lower fail safe: between the Ad hoc network node communication by wireless channel, various attacks such as information transmitted is very easy to be subjected to monitor, retransmits, distorts, forgery.(5) multi-hop communication: two network nodes can not be in the same overlay network owing to be subjected to the restriction of available resources, can adopt Adhoc network multi-hop communication, realize communicating by letter of source host and destination host between the different overlay networks.
At present for Ad hoc network research maximum be Routing Protocol, and still few to the research of the network management of Ad hoc and topological drafting aspect.Along with rapid development of network technique, the continuous expansion of network size, network configuration is complicated more, network function is more powerful, network management will become the key of network system operation quality, and to the perception of network topological diagram with to draw be the basis of other network managements such as configuration, performance, fault management, therefore draw network topological diagram for monitoring whole network, guarantee that the stable operation of network-efficient is very important.Existing Ad hoc network topological diagram is drawn and is mostly depended on certain location technology, as GPS or UWB technology, needs extras and introduces a fixed response time.Because the polytropy of Ad hoc network topology does not in most cases need to know the concrete physical location of network node, and only need know it in network the cardinal principle relative position and get final product with the syntople of other nodes.Therefore need a kind of effectively simple and do not rely on the topological rendering algorithm that can reflect the network topology connection state of other technologies.
Summary of the invention
The purpose of this invention is to provide a kind of topological rendering algorithm that reflects network topology connection state and approximate location relation simply and effectively that is applicable to wireless self-organization network.According to the neighbor information of each node in the network of collecting, adopt this algorithm to draw out the topological diagram of reflection node adjacency relation and relative position, with convenient wireless self-organization network is carried out network management.
To achieve these goals, concrete steps of the present invention are as follows:
First step: validity and the integrality of judging neighbor information;
Determine that at first collected neighbor information is a complete and effective, otherwise the algorithm of back can't go on correctly.This mainly comprises two parts content: the node that lost efficacy is rejected from neighbor list and the situation of one way link is carried out special marking.
Second step: the neighbor node in each node neighbor list is sorted, make it according to the descending descending of neighbours' number;
Because node neighbours number is many more, its reference value is just big more, so determine the many nodes of neighbours' number earlier when determining in the drawings position of node, therefore need carry out descending to the neighbor node in the node neighbor list.
Third step: determine the position of Centroid, and determine the position of Centroid one hop neighbor node successively;
Centroid is positioned at the center of whole topological diagram, and it is on the concentric circles in the center of circle that all the other nodes are positioned at the Centroid.At first determine the position of Centroid, determine the position of a hop neighbor node then according to the syntople between the one hop neighbor node.The position of all hop neighbor nodes is being the center of circle with the Centroid all, and R is on the circle of radius, and divides equally whole circumference.
The 4th step: the position of determining Centroid multi-hop neighbor node according to syntople;
The syntople of the previous dive node of having determined according to multi-hop node and position is determined its position.According to its jumping figure, determine that its place radius of a circle is jumping figure * R.
Description of drawings
Fig. 1 is topological rendering algorithm general flow chart.
Fig. 2 is for seeking the neighbor algorithm flow chart.
The topological diagram example of Fig. 3 for using topological rendering algorithm to draw.
Embodiment
The invention will be further described below in conjunction with the implementation process of algorithm, but this implementation process should not be construed as limitation of the present invention.
The purpose of this algorithm is only to draw out the topological diagram that can reflect network annexation and relative position according to the neighbor information of knowing, with convenient network is managed.The structure of topological diagram designs by following thought: Centroid is positioned at the center, and it is on the concentric circles in the center of circle that all the other nodes all are positioned at the Centroid, and radius multiply by R for its jumping figure.The node that distance center node one is jumped is positioned on the first lap circumference, and all hop nodes are divided whole circumference equally.At first determine the position of the node that neighbours' number is many, the particular location of all the other nodes uses seeks neighbor algorithm (specifically seeing Fig. 2), according to and the position determined that the syntople between the node determines.Then determine apart from the neighbours of Centroid multi-hop according to the syntople of the less inner ring node of itself and jumping figure.Determine after the coordinate of all nodes, finish the drafting of whole topological diagram again according to neighbor list information line.The algorithm general flow chart is seen Fig. 1.
After the neighbor information that obtains each node of network, at first check the validity and the integrality of these information, prevent the operation of the content influence back algorithm that some are invalid.The problem that occurs through regular meeting has: node failure problem and unidirectional link problem.Because the terminal of wireless self-organization network often is equipment such as notebook, PDA, easily because electric weight exhausts or breaks down and cause node failure.In this case, other nodes may not have enough time to upgrade the neighbor list of oneself, therefore still failure node are considered as neighbours.This situation can cause can't normally judging owing to can not find the information of failure node when the inquiry neighbor information.Therefore at first to detect and from the neighbor list of other nodes, reject this failure node.Because the polytropy and the unsteadiness of wireless channel, in motion or block etc. under the situation, through regular meeting one way link appears, need carry out special marking to it.This algorithm detects and record one way link.When determining node location,,, it calculates so being considered as two-way link because this one way link information is still valuable; And when drawing, one way link is represented with the line of special color or specific type.
Because it is on the concentric circles at center that all nodes all are distributed in the Centroid.So the selection of Centroid has a significant impact the structure of topological diagram.In general, selecting the maximum node of neighbours' number is Centroid, perhaps specifies one to be positioned at the network center position and to move more stable node as Centroid in advance.According to the annexation between other nodes and the Centroid, determine the jumping figure of each nodal point separation Centroid, determine promptly which circumference it should be positioned on.Neighbours' number of node is many more, and its reference value is big more, so need to calculate earlier the coordinate of the many nodes of neighbours' number, therefore with the neighbor node in the neighbor list of node according to the descending from more to less of neighbours' number, determine the coordinate position of node successively.The concrete implementation of algorithm is as follows:
1, determines the coordinate of Centroid, and determine that successively the neighbours of Centroid promptly are positioned at the coordinate of the hop node on first circumference.
Centroid O is positioned at initial point (0,0).It is the center of circle that the hop neighbor of Centroid O (for for simplicity, descriptions such as " n hop neighbors " afterwards all is meant with respect to Centroid O to be that n jumps) is positioned at the Centroid, and radius is on the circumference of R, and divides this circumference equally.The first step calculates the total n of Centroid one hop neighbor, and then the hop neighbor angle of circumference number of degrees of dividing circumference equally are (2 π/n).The angle [alpha] of general that first is drawn node is made as 0, as start node.Can (α=m * (2 π/n), m≤n) calculate the coordinate of all hop nodes, and coordinate is (R * cos α, R * sin α) according to the angle [alpha] of radius R and each node.In second step, use " searching neighbor algorithm " to determine the concrete putting position of a hop neighbor.Two primary variables: cur_angle_u and cur_angle_d at first are described.Cur_angle_u and cur_angle_d represent the angle value of position of the node filled up of counterclockwise and clockwise both direction respectively, span be respectively (0, π] and (0 ,-π], initial value be respectively β and-β (β=2 π/n).Promptly with angle [alpha] be 0 start node for according to point, whenever drawing a node in the counterclockwise direction, then the value of cur_angle_u adds that (2 π/n), cur_angle_d is constant; In like manner, whenever drawing a node in the clockwise direction, then the value of cur_angle_d subtracts that (2 π/n), cur_angle_u is constant.The algorithm concrete steps are as follows: the node in the neighbor list of Centroid O is all hop nodes, and it is in proper order according to the descending arrangement of neighbours' number.The neighbor list of Help Center's node O successively, obtain node tmp1 to be determined, and seek out in the neighbor list of O once more that the position that neighborhood is arranged with tmp1 is determined and the neighbor node tmp2 of self neighbours' number maximum, according to the neighbouring relations of these two nodes, determine its angle [alpha] respectively then with a hop node of having determined.If tmp1 does not have the undetermined hop neighbor in position, then calculate the coordinate of tmp1 in accordance with the following methods.At first, calculate the mean value comp_angle0 that determines the angle of node that syntople is arranged with tmp1.The absolute value of the difference of comp_angle0 and cur_angle_u and two variablees of cur_angle_d relatively, and the angle [alpha] of tmp1 node is made as the variate-value less with the absolute value of comp_angle0 difference (cur_angle_u or cur_angle_d).Value with cur_angle_u or cur_angle_d increases or minimizing β simultaneously, makes the position that can fill up node move on to the next node place, for getting ready the position of determining next node.So far, because R is known, the coordinate of tmp1 is determined.If find one of tmp1 to jump neighbours tmp2 to be determined, the position of then at first comparing two nodes has been determined the neighborhood number of a hop node, to determine to determine the sequencing of two node locations.The coordinate of the node that the neighborhood number is bigger will at first be calculated, then the less node coordinate (noticing that the definite neighborhood number in position that closes the less node of coefficient this moment should add) of calculated relationship number.The coordinate Calculation method is identical with the method for above calculating tmp1 node coordinate.According to the method described above, determine the angle value and the coordinate figure of each node successively according to the order of neighbor list.Detailed searching neighbor algorithm is seen Fig. 2.
2, determine Centroid multi-hop neighbours' position according to syntople;
The coordinate of multi-hop neighbor node is to determine according to the syntople of itself and a last hop node basically.So need to determine earlier n circle node location when drawing the multi-hop neighbor node, could determine n+1 circle node location then.It is the center of circle that the n hop neighbor of Centroid O is positioned at Centroid O, and radius is on the circumference of n*R.Can calculate the coordinate of all n hop nodes according to the angle θ of radius n*R and each node, coordinate is (n*R * cos θ, n*R * sin θ).At first determine apart from the Centroid jumping figure to be the position of 2 node C according to the position of first lap node.If a C node A with first lap has syntople, then the angle θ of C is exactly the angle value of A, if a plurality of nodes of C and first lap all have syntople, then its angle θ is the average of these neighbor node angles.If a plurality of jumping figures are 2 node identical syntople is arranged, then according to the sequencing of drawing less angle of skew on the basis of original result of calculation
(for example
Prevent that node overlapping together.
Distance center node jumping figure also calculates angle value and determines coordinate figure according to identical method greater than 2 node.Use the line of band arrow to couple together each node according to syntople at last and form final topological diagram.One way link is wherein represented with the line of special color or specific type.
Set forth the algorithm that the present invention proposes below by specific embodiment:
What provide in the table 1 is the neighbor list of node in the network of collecting.After it was sorted according to neighbours' number is descending, the neighbor list that obtains was provided by table 2.Use this topology rendering algorithm, at first determine the first lap node coordinate: the first step calculates and divides the central angle number of degrees equally and be (2 π/7).In second step, use " searching neighbor algorithm " to determine the concrete putting position of a hop neighbor.From 4 adjacency tabulation, take out the maximum node of neighbours' number 5 in regular turn, and once more from 4 find 5 one jump and to determine neighbor node 3 in abutting connection with the tabulation in regular turn, relatively determined neighborhood number (being 0) at 2, select at first to determine that 5 position is the start node that angle equals 0, and it is placed on the circumference relevant position.Calculate 3 position then, this moment 3 determine that the neighborhood number is 1, comp_angle0 is 0, cur_angle_u and cur_angle_d are respectively (2 π/7) and (2 π/7).The absolute value of the difference of comp_angle0 and cur_angle_u and cur_angle_d is (2 π/7), determines that then 3 angle is (2 π/7), and the value of while cur_angle_u adds (2 π/7) and becomes (4 π/7).Determine 6,1,9,8,2 position afterwards successively, finish the coordinate of first lap node and determine.Then determine the coordinate of the second circle node 7: because 7 and one hop node 2,8 has syntople, then 7 angle is the mean value of 2 and 8 angles.Determine the coordinate of the 3rd circle node 10 then: because 10 and two hop nodes 7 have syntople, then 10 angle is 7 angle.The topological diagram of drawing out is eventually seen Fig. 3.
| 1 | 4 5 3 6 9 |
| 2 | 4 5 8 7 |
| 3 | 4 5 1 6 9 |
| 4 | 5 3 6 1 9 8 2 |
| 5 | 4 1 6 3 8 2 |
| 6 | 4 5 1 3 9 |
| 7 | 8 2 10 |
| 8 | 4 5 2 7 |
| 9 | 4 1 6 3 |
| 10 | 7 |
Table 1 neighbor list
| 4 | 5?3?6?1?9?8?2 |
| 5 | 4?1?6?3?8?2 |
| 1 | 4?5?3?6?9 |
| 3 | 4?5?1?6?9 |
| 6 | 4?5?1?3?9 |
| 2 | 4?5?8?7 |
| 8 | 4?5?2?7 |
| 9 | 4?1?6?3 |
| 7 | 8?2?10 |
| 10 | 7 |
Neighbor list after table 2 ordering
Above disclosed only is preferred embodiment of the present invention, can not limit the present invention's interest field certainly with this, and therefore the equivalent variations of being done according to the present patent application claim still belongs to the scope that the present invention is contained.
By topological rendering algorithm of the present invention, can draw out the topological diagram of reflection network annexation and relative position simply and effectively, conveniently network is managed.
The content that is not described in detail in this specification belongs to this area professional and technical personnel's known prior art.
The above only is preferable enforcement of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (5)
1. topological diagram rendering algorithm that is used for wireless self-organization network, its step is as follows:
A) obtain the neighbor information of each node in the network and judge its validity and integrality;
B) neighbor node in each node neighbor list is sorted, make it according to the descending descending of neighbours' number;
C) determine the position of Centroid, and determine the position of Centroid one hop neighbor node successively: Centroid is positioned at initial point (0,0), and it is the center of circle that a hop neighbor of Centroid is positioned at the Centroid, and radius is on the circumference of R, and divides this circumference equally; (α=m * (2 π/n), n is the sum of a hop neighbor, and m≤n), the coordinate that calculates a hop node is (R * cos α, R * sin α) according to the angle [alpha] of radius R and each node; Node in the neighbor list of Centroid is all hop nodes, what adopt when determining the position of a hop node is to seek neighbours' methods: inquire about node A to be determined, and seek out neighbours' number maximum and the undetermined neighbor node B in position in its neighbor list, according to the neighbouring relations of these two nodes, determine its angle [alpha] respectively with a hop node of having determined; Two variablees of cur_angle_u and cur_angle_d are represented the angle value of position of the node filled up of counterclockwise and clockwise both direction respectively, its initial value be respectively β and-β (β=2 π/n); If node A to be determined does not have the undetermined hop neighbor in position, then calculate the coordinate of A in accordance with the following methods: at first, the A node is converted into angle value comp_angle0 with the syntople of determining node, the mean value of determining the angle of node that syntople is promptly arranged with node A to be determined, the absolute difference that compares comp_angle0 and cur_angle_u and two variablees of cur_angle_d, and the angle [alpha] of A node is made as the variate-value less with the comp_angle0 absolute difference (cur_angle_u or cur_angle_d), value with cur_angle_u or cur_angle_d increases or reduces β simultaneously, make the position that to fill up node move on to the next node place, for getting ready the position of determining next node; If find the hop neighbor B of node A to be determined, the neighborhood number that then at first compares two fixed hop nodes of node and position, the coordinate of the node that the neighborhood number is bigger will at first be calculated, the fixed neighbours' number in position that to close the little node of coefficient then adds one, and calculate its coordinate figure, computational methods are identical with the method for above calculating A node coordinate; Generally the angle [alpha] with first node in the neighbor list of Centroid is made as 0, as start node; According to the method described above, determine the angle value and the coordinate figure of each node successively according to the order of neighbor list;
D) determine the position of Centroid multi-hop neighbor node according to syntople: the coordinate of multi-hop neighbor node is to determine according to the syntople of itself and a last hop node: at first determine apart from the Centroid jumping figure to be the position of 2 node according to the position of first lap node, if syntople is all arranged with a plurality of nodes of first lap, then its angle θ is the average of these neighbor node angles, if a plurality of jumping figures are 2 node identical syntople is arranged, then less angle of skew on the basis of original result of calculation
Prevent that node overlapping together; Distance center node jumping figure also calculates angle value and determines coordinate figure according to identical method greater than 2 node; Using the line of band arrow to couple together each node according to syntople at last forms final topological diagram, one way link is wherein represented with the line of special color or specific type.
2. method according to claim 1 is characterized in that, in the frequent wireless self-organization network of topologies change, draws the topological diagram of network dynamically.
3. method according to claim 1 is characterized in that, the drafting of topological diagram does not rely on any other location technology, only obtains the topological diagram of network according to internodal neighbor information in the network.
4. method according to claim 1, it is characterized in that, to be distributed in the Centroid be on the concentric circles in the center of circle to each node in the network, and radius of a circle increases along with the increase of distance center node jumping figure, can reflect the jumping figure of each node to Centroid intuitively.
5. method according to claim 1 is characterized in that, topological rendering algorithm can be tested to the information of collecting, and rejects invalid node, and can judge and show one way link.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102403868A CN101483935B (en) | 2008-12-19 | 2008-12-19 | Topology drawing algorithm for wireless Ad-Hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102403868A CN101483935B (en) | 2008-12-19 | 2008-12-19 | Topology drawing algorithm for wireless Ad-Hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101483935A CN101483935A (en) | 2009-07-15 |
| CN101483935B true CN101483935B (en) | 2011-11-16 |
Family
ID=40880815
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008102403868A Expired - Fee Related CN101483935B (en) | 2008-12-19 | 2008-12-19 | Topology drawing algorithm for wireless Ad-Hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101483935B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210297338A1 (en) * | 2018-12-27 | 2021-09-23 | Huawei Technologies Co., Ltd. | Network topology determining method and apparatus, and system |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101882179B (en) * | 2010-06-18 | 2013-08-21 | 中兴通讯股份有限公司 | Method and device for drawing topological graph |
| US8886785B2 (en) * | 2012-07-17 | 2014-11-11 | The Procter & Gamble Company | Home network of connected consumer devices |
| CN102929684A (en) * | 2012-09-08 | 2013-02-13 | 佳都新太科技股份有限公司 | Implementation method for topology drawing of virtual machines |
| CN102970772B (en) * | 2012-11-28 | 2015-10-28 | 重庆邮电大学 | A kind of method building industry wireless network topological diagram based on improved adaptive GA-IAGA |
| CN108243477B (en) * | 2016-12-27 | 2020-09-25 | 辰芯科技有限公司 | Central node dynamic selection method, node and wireless self-organizing network |
| CN109639583A (en) * | 2018-12-19 | 2019-04-16 | 迈普通信技术股份有限公司 | Topological drawing drawing method, device and electronic equipment |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
-
2008
- 2008-12-19 CN CN2008102403868A patent/CN101483935B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
Non-Patent Citations (1)
| Title |
|---|
| 邹任洪,程时端.一种多速率移动自组网中的拓扑控制算法.《软件学报》.2004,15(12),全文. * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210297338A1 (en) * | 2018-12-27 | 2021-09-23 | Huawei Technologies Co., Ltd. | Network topology determining method and apparatus, and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101483935A (en) | 2009-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang | Wang | |
| CN101483935B (en) | Topology drawing algorithm for wireless Ad-Hoc network | |
| Fazio et al. | A proximity-based indoor navigation system tackling the COVID-19 social distancing measures | |
| Yau et al. | Clustering algorithms for cognitive radio networks: A survey | |
| Kuo et al. | An intelligent positioning approach: RSSI-based indoor and outdoor localization scheme in Zigbee networks | |
| CN102083204A (en) | Positioning and tracking system method of active nodes in linear environment | |
| WO2009075431A1 (en) | System and method for tracking position of moving object | |
| KR101000193B1 (en) | Routing Path Selection Method For Improving the Detection Power of Statistical Filtering And a Sensor Node for Implementing the Same | |
| Won et al. | Towards robustness and energy efficiency of cut detection in wireless sensor networks | |
| Dagdeviren et al. | An energy-efficient distributed cut vertex detection algorithm for wireless sensor networks | |
| Li et al. | ERN: Emergence rescue navigation with wireless sensor networks | |
| Das et al. | Computational geometry based coverage hole-detection and hole-area estimation in wireless sensor network | |
| CN101589641A (en) | Building communities of interest and selecting borders between them based on relative motion | |
| Chen et al. | A distributed area-based guiding navigation protocol for wireless sensor networks | |
| Zhong et al. | Oodt: obstacle aware opportunistic data transmission for cognitive radio ad hoc networks | |
| Meghanathan | Link selection strategies based on network analysis to determine stable and energy-efficient data gathering trees for mobile sensor networks | |
| Moustafa et al. | Self-Identification of Boundary's nodes in wireless sensor networks | |
| Wang et al. | Robust collaborative mesh networking with large-scale distributed wireless heterogeneous terminals in industrial cyber-physical systems | |
| Karim et al. | An integrated framework for wireless sensor network management | |
| Xu et al. | A low energy adaptive clustering multi-hop routing protocol based on fuzzy decision | |
| Liu et al. | Topology-based multi-jammer localization in wireless networks | |
| Marian et al. | Sensing clouds: A distributed cooperative target tracking with tiny binary noisy sensors | |
| Ranjan et al. | Stealthy attacks in MANET to detect and counter measure by ant colony optimization | |
| Netalkar et al. | Zigbee Based Wireless Sensor Networks for Smart Campus | |
| Dagdeviren et al. | KEIP: a distributed k-connectivity estimation algorithm based on independent paths for 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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20111116 Termination date: 20121219 |