2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing 2010
DOI: 10.1109/nswctc.2010.178
|View full text |Cite
|
Sign up to set email alerts
|

A Node-Grade Based AODV Routing Protocol for Wireless Sensor Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(10 citation statements)
references
References 7 publications
0
10
0
Order By: Relevance
“…Each node in PRI-MAC only maintains a grade [8] and a schedule with two state attributes, which improves the adaptability to the network topology changes (e.g., some nodes dying over time, some new nodes being added later, and some nodes moving to different locations). The grade and schedule in a node are established during the initialization process and are adjusted when necessary based on the gossip messages overheard from its neighbors-no precise synchronization required.…”
Section: A Contributions Of Our Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Each node in PRI-MAC only maintains a grade [8] and a schedule with two state attributes, which improves the adaptability to the network topology changes (e.g., some nodes dying over time, some new nodes being added later, and some nodes moving to different locations). The grade and schedule in a node are established during the initialization process and are adjusted when necessary based on the gossip messages overheard from its neighbors-no precise synchronization required.…”
Section: A Contributions Of Our Workmentioning
confidence: 99%
“…Therefore, a node's grade can be viewed as the hop distance from the node to the sink. The node grade is used to guide data transmission, as data packet can be forwarded from the higher grade nodes to the lower-grade nodes, and finally to the sink [8]. This grade division process is initiated from the sink.…”
Section: A Pri-mac Overviewmentioning
confidence: 99%
“…Then the efficiency depends on the kind of knowledge base that is possessed by the node. Many researchers have defined grade as hop distance (Tong et al, 2010) and have obtained better results by considering the value of the grade. As there is a lot of external influence on the node in the autonomic network, the network topology is dynamic in nature.…”
Section: Necessity Of Gradingmentioning
confidence: 99%
“…The proposal [13] makes an improvement to AODV for WSN, called Grade-AODV (G-AODV) which includes a nodegrade metric. This metric evaluates the distance between the nodes to the base-station.…”
Section: Related Workmentioning
confidence: 99%
“…The cost of each path can be computed with the aid of one or more cross-layer metrics, such as quality of links, energy-efficiency, network size, distance of nodes and other features [2]. Several routing protocols have been outlined in the literature, such as AODV (Ad-hoc On demand Distance Vector) [9], G-AODV [13], EBRM [10], and LABILE [3]. However, they are lacking in energy-efficiency, fairness and the provision of route selection with quality level support.…”
Section: Introductionmentioning
confidence: 99%