Social-aware routing for wireless mesh networks

Shadi Basurra; Y. Ji; M. De Vos; J. Padget; T. Lewis; S. Armour

doi:10.1109/VTCFall.2012.6399244

Social-aware routing for wireless mesh networks

Shadi Basurra, Y. Ji, M. De Vos, J. Padget, T. Lewis, S. Armour

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

1 Citation (SciVal)

253 Downloads (Pure)

Abstract

In wireless mesh networks (WMN), most routing algorithms apply broadcasting at some stage of the path discovery process. They thereby consume large chunks of the network throughput. Intelligent rebroadcast algorithms aim to reduce this overhead by calculating the usefulness of a rebroadcast and the likelihood of collisions. Unfortunately, this introduces latency and breaks the rebroadcast chain, resulting in reduced reachability. In this paper we present our Social-aware Routing Protocol with Parallel Collision Guidance Broadcasting for WMN (SCG). It reduces rebroadcasting without a loss in reachability and without a significant increase in latency. Our claims are validated through simulations comparing our algorithm with existing protocols.

Original language	English
Title of host publication	76th IEEE Vehicular Technology Conference
Pages	1 - 5
Number of pages	5
DOIs	https://doi.org/10.1109/VTCFall.2012.6399244
Publication status	Published - Sept 2012
Event	76th IEEE Vehicular Technology Conference - Quebec City, QC, Canada Duration: 3 Sept 2012 → 6 Sept 2012

Conference

Conference	76th IEEE Vehicular Technology Conference
Country/Territory	Canada
City	Quebec City, QC
Period	3/09/12 → 6/09/12

Access to Document

10.1109/VTCFall.2012.6399244

submittedVTC2012
(c) 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Published version available via: http://dx.doi.org/10.1109/VTCFall.2012.6399244
Accepted author manuscript, 972 KB

Cite this

@inproceedings{70c374598b15468d9645b40ec080e0e1,

title = "Social-aware routing for wireless mesh networks",

abstract = "In wireless mesh networks (WMN), most routing algorithms apply broadcasting at some stage of the path discovery process. They thereby consume large chunks of the network throughput. Intelligent rebroadcast algorithms aim to reduce this overhead by calculating the usefulness of a rebroadcast and the likelihood of collisions. Unfortunately, this introduces latency and breaks the rebroadcast chain, resulting in reduced reachability. In this paper we present our Social-aware Routing Protocol with Parallel Collision Guidance Broadcasting for WMN (SCG). It reduces rebroadcasting without a loss in reachability and without a significant increase in latency. Our claims are validated through simulations comparing our algorithm with existing protocols. ",

author = "Shadi Basurra and Y. Ji and {De Vos}, M. and J. Padget and T. Lewis and S. Armour",

year = "2012",

month = sep,

doi = "10.1109/VTCFall.2012.6399244",

language = "English",

pages = "1 -- 5",

booktitle = "76th IEEE Vehicular Technology Conference",

note = "76th IEEE Vehicular Technology Conference ; Conference date: 03-09-2012 Through 06-09-2012",

}

TY - GEN

T1 - Social-aware routing for wireless mesh networks

AU - Basurra, Shadi

AU - Ji, Y.

AU - De Vos, M.

AU - Padget, J.

AU - Lewis, T.

AU - Armour, S.

PY - 2012/9

Y1 - 2012/9

N2 - In wireless mesh networks (WMN), most routing algorithms apply broadcasting at some stage of the path discovery process. They thereby consume large chunks of the network throughput. Intelligent rebroadcast algorithms aim to reduce this overhead by calculating the usefulness of a rebroadcast and the likelihood of collisions. Unfortunately, this introduces latency and breaks the rebroadcast chain, resulting in reduced reachability. In this paper we present our Social-aware Routing Protocol with Parallel Collision Guidance Broadcasting for WMN (SCG). It reduces rebroadcasting without a loss in reachability and without a significant increase in latency. Our claims are validated through simulations comparing our algorithm with existing protocols.

AB - In wireless mesh networks (WMN), most routing algorithms apply broadcasting at some stage of the path discovery process. They thereby consume large chunks of the network throughput. Intelligent rebroadcast algorithms aim to reduce this overhead by calculating the usefulness of a rebroadcast and the likelihood of collisions. Unfortunately, this introduces latency and breaks the rebroadcast chain, resulting in reduced reachability. In this paper we present our Social-aware Routing Protocol with Parallel Collision Guidance Broadcasting for WMN (SCG). It reduces rebroadcasting without a loss in reachability and without a significant increase in latency. Our claims are validated through simulations comparing our algorithm with existing protocols.

UR - http://www.scopus.com/inward/record.url?scp=84878915064&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1109/VTCFall.2012.6399244

U2 - 10.1109/VTCFall.2012.6399244

DO - 10.1109/VTCFall.2012.6399244

M3 - Chapter in a published conference proceeding

AN - SCOPUS:84878915064

SP - 1

EP - 5

BT - 76th IEEE Vehicular Technology Conference

T2 - 76th IEEE Vehicular Technology Conference

Y2 - 3 September 2012 through 6 September 2012

ER -

Social-aware routing for wireless mesh networks

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this