2013 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE) 2013
DOI: 10.1109/ccece.2013.6567748
|View full text |Cite
|
Sign up to set email alerts
|

Stable connections using multi-paths and conservative neighborhood ranges in mobile ad hoc networks

Abstract: As the demand for mobile ad hoc wireless network applications grows, so does their use for many important services where reliability and stability of the communication paths are of great importance. Therefore, a mobile ad hoc network (MANET) must be able to establish reliable communication channels which are protected by failure recovery protocols. One approach for existing failure recovery protocols is based on using backup paths, or multi-paths. This technique provides for more stable communication channels … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…Due to this there is no more signal or message transmitted. A. Zadin et al [23] proposed a Greedy-based Backup Routing Protocol with Conservative Neighborhood Range (GBR-CNR) algorithm by modifying the GBR algorithm. Authors introduced a Conservative Neighborhood Range (CNR) and suggested that sending node will choose the next hop node that will not go outside the range of sender node before receiving the hello message and it is the closest node to the destination Node.…”
Section: B Position-based Routing For Manetmentioning
confidence: 99%
See 1 more Smart Citation
“…Due to this there is no more signal or message transmitted. A. Zadin et al [23] proposed a Greedy-based Backup Routing Protocol with Conservative Neighborhood Range (GBR-CNR) algorithm by modifying the GBR algorithm. Authors introduced a Conservative Neighborhood Range (CNR) and suggested that sending node will choose the next hop node that will not go outside the range of sender node before receiving the hello message and it is the closest node to the destination Node.…”
Section: B Position-based Routing For Manetmentioning
confidence: 99%
“…Authors introduced a Conservative Neighborhood Range (CNR) and suggested that sending node will choose the next hop node that will not go outside the range of sender node before receiving the hello message and it is the closest node to the destination Node. [23,24] The CNR is identified by the conservative neighborhood transmission range Rc which depends on the node's velocity, the time interval between the HELLO message transmitted, and the actual transmission range value. Rc is calculated as -Rc = R − (Vmax)*t where R is the real transmission range, Vmax the maximum velocity of the device, and t is the time gap between two consecutive HELLO message transmitted.…”
Section: B Position-based Routing For Manetmentioning
confidence: 99%
“…home, office or campus) to expand distributed service capability [1][2][3]. The user can have access to high quality service at any time with multi-devices cooperation [4][5][6]. Ubiquitous network changes network edges and forms ubiquitous stub environment in which people access directly through various heterogeneous devices.…”
Section: Introductionmentioning
confidence: 99%