2015
DOI: 10.1016/j.comnet.2015.07.018
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of mesh routing protocols for wireless community networks

Abstract: In recent years, we have witnessed the exponential growth of wireless community networks as a response to the clear necessity of Internet access for participation in society. For wireless mesh networks that can scale to up to thousands of nodes, which are owned and managed in a decentralized way, it is imperative for their survival to provide the network with self-management mechanisms that reduce the requirements of human intervention and technological knowledge in the operation of a community network. In thi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
18
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
2
1

Relationship

4
3

Authors

Journals

citations
Cited by 20 publications
(19 citation statements)
references
References 20 publications
1
18
0
Order By: Relevance
“…These routing protocols have been further characterized by studying their control overheads, convergence delay, CPU and memory consumption, and stability. Our experimental evaluation results show the relative merits, costs, and limitations of the three protocols [7]. The results show a very lightweight Babel protocol but too expensive in large, dense and changing networks.…”
Section: Routing Protocolsmentioning
confidence: 92%
“…These routing protocols have been further characterized by studying their control overheads, convergence delay, CPU and memory consumption, and stability. Our experimental evaluation results show the relative merits, costs, and limitations of the three protocols [7]. The results show a very lightweight Babel protocol but too expensive in large, dense and changing networks.…”
Section: Routing Protocolsmentioning
confidence: 92%
“…The network-aware strategy does not necessarily add the fastest new end if 25: end for 26: return(nodes below threshold, min(bottleneck)) link. It rather evaluates all the candidate neighbor nodes as to how a link to them impacts the performance of the whole network (through the checkStopCondition at line 6 in Algorithm 3 that returns R min ) and then selecting n maximizing this value (lines [11][12][13][14][15]. The fastest link is used as a fallback node selection criterion only if there is a tie.…”
Section: Network Aware Strategymentioning
confidence: 99%
“…One might argue that as the CN grows, the overhead of the routing protocol may be a potential third metric. However, scalability studies for typical mesh routing protocols [13], such as OLSR, Babel, and BMX, show the negligible CPU (less than 10% load in a 10 e router [14]) and memory costs even for large mesh networks with 50-100 or more nodes. Network overhead is small for distance vector protocols and it grows roughly linearly with the nubmer of nodes (less than 200 bit/s for a 25 node network, and still less than 0.5-1 kbit/s for a 100 node network for a typical topology) while Link State protocols (like OLSRv2) generate a higher overhead.…”
Section: Graph Metricsmentioning
confidence: 99%
“…CNs have characteristic properties, such as, varied latencies between nodes [5], dynamic routing changes and low-capacity devices used for node interconnection. Also, node connectivity is based on mesh routing protocols [6].…”
Section: Background a Wireless Mesh Networkmentioning
confidence: 99%