2012 3rd IEEE International Conference on the Internet of Things 2012
DOI: 10.1109/iot.2012.6402319
|View full text |Cite
|
Sign up to set email alerts
|

The stateless point to point routing protocol based on shortcut tree routing algorithm for IP-WSN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 9 publications
0
6
0
Order By: Relevance
“…[14] has worked on the implementation of a New Replacement Method for WMNs. 2014 Delaney, D., Russell Higgs, and G. O'Hare [1] have worked on a stable routing framework for tree-based routing structures in WSNs. The central concept introduces neighborhood heuristics (NHs), a method of combining a sensor's routing metric with those of its neighbors to highlight both the quality of the current route and the quality of the routing options available to the sensor should its current route become unavailable.…”
Section: Literature Reviewmentioning
confidence: 99%
“…[14] has worked on the implementation of a New Replacement Method for WMNs. 2014 Delaney, D., Russell Higgs, and G. O'Hare [1] have worked on a stable routing framework for tree-based routing structures in WSNs. The central concept introduces neighborhood heuristics (NHs), a method of combining a sensor's routing metric with those of its neighbors to highlight both the quality of the current route and the quality of the routing options available to the sensor should its current route become unavailable.…”
Section: Literature Reviewmentioning
confidence: 99%
“…al. [5] has worked upon the stateless point to point routing protocol based on shortcut tree routing algorithm for IP-WSN. To address the routing challenges, the authors have proposed the Stateless P2P Routing protocol (SPR) based on shortcut tree routing algorithm which is our previous study.…”
Section: Literatre Reviewmentioning
confidence: 99%
“…[5]proposed a stateless point to point routing protocol that depends on the shortcut tree routing algo which transfer packet to node with minimal remaining hop-count between the neighboring nodes without any extra control overhead.…”
Section: Related Workmentioning
confidence: 99%
“…[9] proposed two different routing protocols that are Control Data Disemmination Protocol(CDDP) which arranges tree that links all the nodes in the network which will transmit control data to base station. The second is centralized weighted clustering protocol that uses CDDP for transmission of control data to base station and will prefer the leading cluster heads in network according to weighted criteria function.…”
Section: Related Workmentioning
confidence: 99%