CN103747498B - Direction angle-based wireless sensor network routing void optimization method - Google Patents
Direction angle-based wireless sensor network routing void optimization method Download PDFInfo
- Publication number
- CN103747498B CN103747498B CN201410023896.5A CN201410023896A CN103747498B CN 103747498 B CN103747498 B CN 103747498B CN 201410023896 A CN201410023896 A CN 201410023896A CN 103747498 B CN103747498 B CN 103747498B
- Authority
- CN
- China
- Prior art keywords
- node
- void
- hop
- path
- neighbor
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention puts forward a direction angle-based wireless sensor network routing void optimization method which belongs to the technical field of wireless sensor networks (WSNs). The method judges a routing void node by using the distance between any two nodes which is less than a communication radius R; with the void node as a center, a direction angle-based directional neighboring node set of the void node is constructed; the next-hop cost function of the neighboring nodes is calculated; according to the next-hop cost function, the priority levels of next-hop nodes of the routing void are divided; by adopting random choice, a node is chosen from the high-priority node set to serve as the next hop of the void node; finally, the paths near the void are reduced and optimized, the number of the nodes on the paths is reduced, and thereby the direction angle-based wireless sensor network routing void optimization method is fulfilled. The direction angle-based wireless sensor network routing void optimization method not only can handle the problem of void routing, but also meets the QoS (Quality of Service) requirement of WSNs; the direction angle-based wireless sensor network routing void optimization method is simple and feasible and has a remarkable effect in solving the problem of voids.
Description
Technical field
The present invention relates to a kind of radio sensing network based on orientation angle route void optimization method, belong to wireless sensing
Device network（WSNs）Technical field.
Background technology
Wireless sensor network（WSNs）The calculating of node, storage, communication capacity are limited, traditional fixed network and movement
The Routing Protocol of self-organizing network can not be effectively applied to WSNs, and the Routing Protocol for studying WSNs is significant, route
Agreement can be divided into plurality of classes by different sorting techniques, and geographic routing therein is used widely, in geographical position
In route, node knows the positional information of oneself by GPS or location algorithm, and when data need forwarding, node is slapped according to it
The partial network information held, using the greedy pass-through mode of distance, selects position to be more nearly the neighbor node conduct of destination node
Next-hop forward node, along shorter path transmission data.Because it is using the greedy pass-through mode forwarding data of distance, can not
What is avoided occurs the problem of greedy retransmission failure, and the node of retransmission failure then becomes void node, route void node
Definition：To destination node using set up path apart from greedy algorithm when, node can select position to be more nearly destination node
Neighbor node as next-hop forward node, but when do not exist in neighbor node distance objective node closer to node when, this section
Point is void node.Therefore the settlement mechanism of empty problem indicates the effectiveness of Routing Protocol.
The empty treatment mechanism of efficient route for geographic routing agreement it is critical that, at design route cavity
Should as far as possible accomplish that the sensor node for processing cavity should lack as much as possible during reason mechanism, best void node itself just can be complete
The process in cavity in pairs；The extra energy expense that the empty treatment mechanism of route is brought should be lacked as much as possible, improve energy utilization
Rate；The process to cavity is completed using a small amount of partial network information, impact is not produced on the extensibility of Routing Protocol；As far as possible
The close shortest path in ground.
The content of the invention
For the route cavity problem of WSNs, it is an object of the invention to provide a kind of wireless sensing based on orientation angle
Network route void optimization method.
The technical scheme is that,
A kind of radio sensing network based on orientation angle route void optimization method, and the method step is：
Step 1：Judge route void node;
The distance between each two node is calculated first, and the neighbor node of each node is generally determined using communication radius,
Distance between i.e. two nodes has the neighbor node collection of itself less than certain numerical value i.e. neighbor node each other, each node
Close；The distance of each nodal distance destination node is calculated, destination node is generally, it is known that set up in path process, selection
If do not exist in neighbor node during next-hop node compared with this node distance objective node closer to node when, this node is
For void node；
Step 2：Direction neighbor node set is built centered on void node;
Centered on void node, with positive and negative 120 degree of void node and destination node line void node is rebuild
Direction neighbor node set { Nodei, element number is n in set, and n node in set is used as calculation cost letter afterwards
Several alternate nodes；When the angle of neighbor node and void node line, void node and destination node line is less than 120 degree
When, the neighbor node of void node according to determined by communication radius R belongs to direction neighbor node set { Node in step 1i}；
That is,
WhenWhen, Ni+1∈{Nodei}；
Wherein, NiFor void node, Ni+1Void node N determined by communication radius R in step 1iNeighbor node,For neighbor node and the angle of void node line, void node and destination node line；
Step 3：The next-hop cost function of calculated direction neighbor node；
To each the node calculation cost function in set, the cost function is：
Wherein, L (Ni, D) and represent void node apart from destination node distance, L (Ni+1, D) and represent set { NodeiIn section
, to the distance of destination node, the value of cost function is always greater than 1 for point.To the C for calculatingiAscending sequence, builds set
{Ci, calculate { CiIntermediate value：
Cmid=mid { Ci,
By CmidAs the standard for subsequently judging priority level；
Step 4：The empty next-hop node priority level of route is divided according to next-hop cost function；
According to the C that previous step is calculatedmidThe preferential selection grade of the direction neighbor node of void node is divided, will be preferential
2 grades of grade classification of level, if the C of nodeiValue is less than Cmid, then node belong to high priority { leveli=1 }；Otherwise, node category
In low priority { leveli=0 }；
Step 5：Determine next-hop node from priority node set random selection；
According to priority level { leveliThe next-hop node of void node is randomly selected, the height established from step 4
Priority node set { leveli=1 } next-hop node of void node is randomly selected in;
Step 6：Simplify optimization and reduce node number on path in path；
During path is set up, the numbering by 1 is carried out to all nodes on path, the numbering of source node is
1, the next-hop node of source node numbering is 2, and back to back next-hop node numbering is 3, by that analogy, the not section on path
Point numbering is 0, carries out simplifying optimization after path success is set up, and optimization principles are to start to select to be compiled in neighbor node from source node
The node of number maximum simplifies backward optimization from next-hop node according to same principle afterwards directly as next-hop node, until
Destination node, establishes final path, and the node simplified is because not on final path, numbering sets to 0 again；
So, that is, the radio sensing network route void optimization method based on orientation angle is obtained, sky is this method solved
Hole problem simultaneously meets the path of wireless sensor network QoS demand.
Step 1 of the present invention calculates the distance between node and node to determine neighbor node.Each node is calculated again
The distance of distance objective node, judges void node, and each node need to only safeguard a small amount of topology information.The step 2 is with sky
Centered on the node of hole, incoming direction angle limits have rebuild the set { Node of direction neighbor nodei}.The step 3 is determined
Justice calculates the cost function C of the direction neighbor node of void nodei, to gathering { CiCarried out sorting and having obtained intermediate value
Cmid, as the division threshold value of next step.Step 4 { the NodeiIn each cost function by with CmidRelatively, it is divided into
0 and 1 two priority, 0 is low priority, and 1 is high priority.The step 5 randomly selects one in the node of high priority
Next-hop node of the individual node as void node.The step 6 simplifies path node number, and path optimizing finally gives pin
Optimization solution to the empty problem of route of WSNs --- the radio sensing network route cavity optimization based on orientation angle
Method.
The invention has the beneficial effects as follows：Simple possible of the present invention, can effectively solving cavity routing issue, also meet
The QoS demand of WSNs.
Description of the drawings
Fig. 1 is the flow chart of the present invention.
Fig. 2 is that the present invention selects to introduce the principle schematic of cost function during void node next-hop.
Fig. 3 simplifies the principle schematic of optimization for path.
Selected path topology figure when Fig. 4 runs into void node for the present invention.
Fig. 5 is to simplify the final topological diagram of optimization rear path.
Fig. 6 is that the present invention processes the node number contrast schematic diagram after empty problem with TPGF methods.
Fig. 7 is that the present invention processes the capacity usage ratio contrast schematic diagram after empty problem with TPGF methods.
Specific embodiment
With reference to the accompanying drawings and examples, the present invention is elaborated.
Fig. 1 is the flow chart of the present invention.As shown in figure 1, a kind of radio sensing network route cavity based on orientation angle
Optimization method, the method step is to comprise the following steps：
Step 1：Differentiate route void node, first with communication radius the neighbor node of each node is determined.We take
Communication radius R=60, unit：Rice (m), then the distance between any two node is less than 60m i.e. neighbor node each other, then calculates every
The distance of individual nodal distance destination node, destination node is generally, it is known that set up in path process, selection next-hop node
Do not exist in Shi Ruguo neighbor nodes compared with this node distance objective node closer to node when, this node is cavity section
Point；
Step 2：Centered on void node, with positive and negative 120 degree of void node and destination node line sky is rebuild
The direction neighbor node set of hole node, whenWhen, Ni+1∈{Nodei, wherein, NiFor void node, Ni+1For
Void node N determined by communication radius R in step 1iNeighbor node,For neighbor node and void node line, sky
The angle of hole node and destination node line；Element number n in this set is calculated less than or equal in step 1 by communication radius
The neighbor node number of the void node for going out.The next-hop node of void node is chosen in these nodes.
Step 3：Introduce cost functionFig. 2 introduces generation when selecting void node next-hop for the present invention
The principle schematic of valency function, as shown in Fig. 2 Ni is void node in figure, must select next in angle is positive and negative 120 degree
Jump, then calculate Ni+1A, Ni+1B, Ni+1C and Ni+1The cost function value of d, by set of computations { NodeiCost function after, then
Obtain intermediate value Cmid, the threshold value as subsequent divided priority.
Step 4：With CmidIt is threshold value by { NodeiThe priority of interior joint is divided into 2 grades, { leveli=1 } and { leveli
=0 }, it is computed N in rear Fig. 2i+1A, Ni+1B belongs to high priority { leveli=1 }, Ni+1C and Ni+1D belongs to low priority
{leveli=0 }.
Step 5：Randomly select { NodeiIn a certain node as void node next-hop.Then in high priority section
Point Ni+1A, Ni+1Randomly select between b.
Step 6：Simplify path node number, path optimizing；
As shown in figure 3, Fig. 3 simplifies the principle schematic of optimization for path, path is set up from source node S to destination node D,
Path is S → a → b → c, the numbering of S be 1, a be 2, b be 3, c be 4.A, b, c are the neighbor node of S, therefore directly choose
The largest number of c starts to simplify optimization up to destination node according to identity principle afterwards as the next-hop of S from c.
[embodiment]
Using MATLAB as emulation tool, simulation parameter setting is as follows：
Topological scope is 600 × 400, and destination node is located at（0,0）Place, source node is located at distance objective node farthest,
The primary power of node is set to erg-ten, and node does not have mobility.
As shown in figure 4, selected path topology figure when Fig. 4 runs into void node for the present invention（It is n=for node number
The topological diagram in path is set up in the case of 150）.Afterwards according to the present invention, a kind of radio sensing network road based on orientation angle
By void optimization method, the method step is：
1）Judge void node, select next-hop node to set up path with greedy algorithm, until node Ni；Node NiDistance
Destination node is 316.51m, respectively less than node NiNeighbor node A, B, C, D, E apart from destination node distance, its value difference
For 346.25m, 370.8m, 370.59m, 347.92m, 381.98, node NiBecome route void node；
2）Direction neighbor node set is built, according to void node Ni120 degree are less than with the angle of destination node line, meter
Void node N for calculatingiThe set of direction neighbor node include node A, B, C, D；
3）The cost function set of calculated direction neighbor node, and sort from small to large.The cost letter that A, B, C, D are calculated
Numerical value CiRespectively 1.09,1.17,1.172,1.1, the set { C of structureiBe：
{1.06,1.1,1.17,1.172}；Calculate intermediate value CmidFor 1.123；
4）According to threshold value C for calculatingmid, by A, B, C, it is two priority that D is divided to, due to A, the C of DiValue is less than Cmid, because
This A, D ∈ { level=1 }；B, C ∈ { level=0 }.
5）The next-hop node of random selection void node, have selected D points as void node in the middle of A, two points of D
Next-hop node.
6）Final path afterwards according to path optimization's principle of parsimony determination is as shown in Figure 5.（Fig. 5 is to simplify the optimization way of escape
The final topological diagram in footpath）.From Fig. 5 this it appears that the path after calculating according to the inventive method has bypassed void node Ni。
Path had both solved empty problem, while meeting the QoS demand of wireless sensor network.
Fig. 6 is that the present invention processes the node number contrast schematic diagram after empty problem with TPGF methods.This is demonstrated by Fig. 6
The final path node of invention calculates the curve chart that path node changes with node number, the concrete data such as institute of table 1 with TPGF
Show：
Table 1
| Node number | 150 | 160 | 170 | 180 | 190 | 200 |
| TPGF | 21 | 19 | 21 | 20 | 21 | 20 |
| The inventive method | 19 | 18 | 19 | 19 | 20 | 19 |
Node number is proportional with the path delay of time on path, and Statistical Principles are shown below：
DIt is end-to-end=DTransmission delay+DOther factorses,
Wherein, DTransmission delayRefer mainly to send the time delay of data between node, and DOther factorsesIt is main to represent MAC layer time delay and other
Time delay, unification is counted by 20ms, then the inventive method reduces respectively 9.5%, 5.3%, 4.5%, 5% compared with TPGF time delays,
4.8%, 5%.
Fig. 7 is that the present invention processes the capacity usage ratio contrast schematic diagram after empty problem with TPGF methods.Statistics energy
Method has a lot, now to terminate during first node death, with dump energy divided by gross energy, i.e. capacity usage ratio.Energy mould
Type adopts the energy that transmitting and receiver circuit 1 bit data of process are consumed for 50J-9, free space model transmitting and receive
The energy that 1 bit data of electromechanical road direction unit area transmitting is consumed is 100J-12, the bit of data packet length 1600.Final energy
Utilization rate is as shown in table 2：
Table 2
| Node number | 150 | 160 | 170 | 180 | 190 | 200 |
| TPGF | 0.2832 | 0.25 | 0.2414 | 0.2364 | 0.2387 | 0.2723 |
| The inventive method | 0.3069 | 0.2725 | 0.2488 | 0.262 | 0.2492 | 0.2893 |
In sum, the present invention both met cavity process rear path node number it is few, energy expense is few, and utilization rate is high
Require, and it is simple.
The present invention can process empty routing issue, also meet the QoS demand of WSNs；Simple possible, is solving cavity
Effect is significant in problem.
The above, the only present invention preferably specific embodiment, but protection scope of the present invention is not limited thereto,
Any those familiar with the art the invention discloses technical scope in, the change or replacement that can be readily occurred in,
All should be included within the scope of the present invention.Therefore, protection scope of the present invention should be with scope of the claims
It is defined.
Claims (2)
1. a kind of radio sensing network based on orientation angle route void optimization method, it is characterised in that the method include with
Lower step：
Step 1：Using the path that destination node is established to apart from greedy algorithm, route void node is judged；
Setting communication radius R, the such as distance between any two node are less than communication radius R, then two nodes neighbor node each other,
Each node has the neighbor node set of itself；The distance of all nodal distance destination node D is calculated again；Set up path mistake
Cheng Zhong, if do not exist in neighbor node when choosing next-hop node compared with this node distance objective node D closer to node
When, this node is void node；
Step 2：Direction neighbor node set is built centered on void node；
Centered on void node, the side for rebuilding void node with positive and negative 120 degree of void node and destination node line
To neighbor node set { Nodei, wherein, when neighbor node and void node line, void node and destination node line
When angle is less than 120 degree, the neighbor node of void node according to determined by communication radius R belongs to direction neighbours section in step 1
Point set { Nodei, i.e.
WhenWhen, Ni+1∈{Nodei},
Wherein, Ni+1Void node N determined by communication radius R in step 1iNeighbor node,For neighbor node and sky
The angle of hole node line, void node and destination node line；
Set { NodeiIn element number n less than or equal to the void node calculated by communication radius R in step 1 neighbours' section
Point number；
Step 3：The next-hop cost function C of calculated direction neighbor nodei；
The cost functionL(Ni, D) and represent void node to the distance of destination node, L (Ni+1, D) represent
Set { the Node established again in step 2iIn direction neighbor node to destination node distance；
By set of computations { NodeiCost function Ci, and to CiAfter ascending sequence, set { C is builti, then calculate
Intermediate value Cmid, the threshold value as subsequent divided priority；
Step 4：According to next-hop cost function CiDivide route next jump node priority level；
With CmidIt is threshold value by { NodeiThe priority of interior joint is divided into 2 ranks：{leveli=1 } with { leveli=0 },
If cost function value CiLess than intermediate value Cmid, then node belongs to high priority { leveli=1 }；Otherwise, node belongs to low
Priority { leveli=0 }；
Step 5：Using random selection mode from priority node set { leveli=1 } next-hop node is determined in；
According to priority level { leveliThe next-hop node of void node is randomly selected, the high priority established from step 4
Node set { leveli=1 } next-hop node of void node is randomly selected in；
Step 6：Optimization is simplified in path, reduces node number on path；
During path is set up, all nodes on path are carried out with the numbering by 1, the numbering of source node is 1, source
The next-hop node numbering of node is 2, and back to back next-hop node numbering is 3, and by that analogy, the node on path is not compiled
Number it is 0, carries out simplifying optimization after path success is set up, optimization principles is to start to be numbered most in selection neighbor node from source node
Big node simplifies backward optimization from next-hop node according to same principle afterwards directly as next-hop node, until purpose
Node, establishes final path, and the node simplified is because not on final path, numbering sets to 0 again；
So, that is, a path for solving empty problem and meeting wireless sensor network QoS demand has been obtained.
2. a kind of radio sensing network based on orientation angle according to claim 1 route void optimization method, and it is special
Levy and be, the communication radius R=60, unit：Rice.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410023896.5A CN103747498B (en) | 2014-01-17 | 2014-01-17 | Direction angle-based wireless sensor network routing void optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410023896.5A CN103747498B (en) | 2014-01-17 | 2014-01-17 | Direction angle-based wireless sensor network routing void optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103747498A CN103747498A (en) | 2014-04-23 |
| CN103747498B true CN103747498B (en) | 2017-04-12 |
Family
ID=50504475
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410023896.5A Expired - Fee Related CN103747498B (en) | 2014-01-17 | 2014-01-17 | Direction angle-based wireless sensor network routing void optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103747498B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106211257B (en) * | 2016-07-08 | 2019-11-12 | 广州大学 | A kind of energy acquisition routing algorithm for wireless sensor based on geographical location |
| CN106774310B (en) * | 2016-12-01 | 2019-11-19 | 中科金睛视觉科技（北京）有限公司 | A kind of robot navigation method |
| CN107454648A (en) * | 2017-06-15 | 2017-12-08 | 中富通股份有限公司 | Based on the single domain Ad Hoc that forward direction is approached by finding that algorithm designs in real time |
| CN108650680B (en) * | 2018-03-07 | 2020-03-31 | 东南大学 | Wireless sensor network cavity repairing method based on wave arrival angle |
| CN113469813A (en) * | 2021-07-20 | 2021-10-01 | 华北电力大学 | Regional carbon quota transaction system and method for power enterprise based on block chain |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102088753A (en) * | 2011-03-28 | 2011-06-08 | 中国科学院上海微系统与信息技术研究所 | Alternate hole routing method of Internet of Things (IOT) for guaranteeing service quality |
| CN102665252A (en) * | 2012-06-05 | 2012-09-12 | 重庆大学 | Routing void processing method for wireless sensing network geographical position |
-
2014
- 2014-01-17 CN CN201410023896.5A patent/CN103747498B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102088753A (en) * | 2011-03-28 | 2011-06-08 | 中国科学院上海微系统与信息技术研究所 | Alternate hole routing method of Internet of Things (IOT) for guaranteeing service quality |
| CN102665252A (en) * | 2012-06-05 | 2012-09-12 | 重庆大学 | Routing void processing method for wireless sensing network geographical position |
Non-Patent Citations (4)
| Title |
|---|
| A Hole Avoiding Routing Protocol with Relative Neighborhood Graph for Wireless Sensor Network;Ying-Hong Wang, Kuo-Feng Huang, Liang-Yi Lee, Kai-Guan Quek;《IEEE》;20091231;全文 * |
| 一种基于PSO 的有效能量空洞避免的无线传感器路由算法;刘安丰 吴贤佑 陈志刚;《计算机研究与发展》;20091231;全文 * |
| 无线传感器网络位置辅助路由算法研究;刘琴, 王福豹, 马峻岩, 史龙;《计算机应用研究》;20070331;全文 * |
| 无线传感器网络贪婪转发策略中的路由空洞问题;田乐 谢东亮 任彪 张雷 程时端;《电子与信息学报》;20071231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103747498A (en) | 2014-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103747498B (en) | Direction angle-based wireless sensor network routing void optimization method | |
| CN101119303B (en) | Dynamic cluster based multi-objective programming wireless sensing network routing algorithm | |
| CN104618997A (en) | Data aggregation method based on non-uniform grids | |
| CN1299478C (en) | Route searching of detgredd of node based on radio self-organizing network and maitenance method thereof | |
| CN107920368A (en) | RPL routing optimization methods based on life cycle in a kind of wireless sense network | |
| CN106304243A (en) | A kind of wireless sensor network topology control method based on gesture game | |
| CN107360612A (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
| CN106209618A (en) | A kind of communication mixed networking method and system improving intelligence adapted electric energy effect | |
| CN105848238A (en) | IPv6 routing method of wireless sensor networks based on multiple parameters | |
| KR101560523B1 (en) | Operating method of wireless sensor networks considering energy efficiency | |
| CN108770003A (en) | A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing | |
| CN105050149A (en) | Routing method for overcoming congestion of tree type Zigbee network | |
| CN110798841A (en) | Multi-hop wireless network deployment method, network capacity determination method and device | |
| CN113411766B (en) | Intelligent Internet of things comprehensive sensing system and method | |
| CN103826282B (en) | Set based on dump energy divides multi-hop routing method | |
| CN106851596A (en) | A kind of dynamic ad hoc network method of agricultural environment wireless sense network | |
| CN104618852A (en) | Hierarchical clustering-based data aggregating method and system | |
| CN104901885B (en) | A kind of Security routing system of selection of geographical location information auxiliary | |
| CN106685819A (en) | AOMDV protocol energy saving method based on node energy division | |
| CN106507431B (en) | Wireless sensor network routing method | |
| CN104270308A (en) | On-radio-frequency-piece network application mapping method facing unbalanced communication feature | |
| CN115134928A (en) | Frequency band route optimized wireless Mesh network congestion control method | |
| CN104618945B (en) | Routing failure restoration methods based on link-quality renewal in WLAN | |
| Redhu et al. | Joint Data Latency and Packet Loss Optimization for Relay-Node Selection in Time-Varying IoT Networks | |
| CN103532667A (en) | Reliable wireless sensor network data transmission method based on Chinese remainder theorem |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170412 Termination date: 20200117 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |