For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

Goldsmiths' College

Return to search Previous output Next output
Output 0 of 0 in the submission
Article title

Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks

Type
D - Journal article
Title of journal
Journal of Discrete Algorithms
Article number
-
Volume number
n/a
Issue number
n/a
First page of article
n/a
ISSN of journal
15708667
Year of publication
2013
Number of additional authors
2
Additional information

<04> Published in the 6th highest rated journal in Discrete Mathematics and Combinatorics (SCImago) this builds on Pu’s 2010 paper in this submission, introducing new algorithms, simulations and analysis that advance the active research area of reactive routing efficiency. The technique leads to a better understanding of efficient searching techniques in general and inspires new efficient protocol development. Part of the work was presented in the prestigious IEEE international conference WoWMoM2011 (acceptance rate: 18% with a double blind selection process of 3 referees per paper).

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-