Dynamic connectivity analysis of ABF-based ad-hoc networks

F. Liu; Geert Heijenk

doi:10.1007/978-0-387-84839-6_32

Dynamic connectivity analysis of ABF-based ad-hoc networks

F. Liu, Geert Heijenk

Faculty of Engineering Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

35 Downloads (Pure)

Abstract

This paper evaluates the performance of a context discovery protocol using attenuated Bloom filters while nodes appear, disappear, and are temporary unreachable in ad-hoc networks through analytical analysis. Further we verified obtained results with simulation analysis. The analytical results are most accurate when node density is high. Further, we discover that adding a node generates less traffic than removing a node in our protocol. Some proposals are given to reduce the traffic generated by propagating updates due to removing a node.

Original language	Undefined
Title of host publication	Proceedings of the 1st IFIP Wireless and Mobile Networking Conference
Place of Publication	Berlin
Publisher	Springer
Pages	407-420
Number of pages	14
ISBN (Print)	978-0-387-84838-9
DOIs	https://doi.org/10.1007/978-0-387-84839-6_32 https://doi.org/10.1007/978-0-387-84839-6
Publication status	Published - 2008
Event	1st IFIP Wireless and Mobile Networking Conference, WMNC 2008 - Toulouse, France Duration: 30 Sept 2008 → 2 Oct 2008 Conference number: 1 https://www.irit.fr/WMNC2008/

Publication series

Name
Publisher	Springer Verlag
Number	Supplement

Conference

Conference	1st IFIP Wireless and Mobile Networking Conference, WMNC 2008
Abbreviated title	WMNC
Country/Territory	France
City	Toulouse
Period	30/09/08 → 2/10/08
Internet address	https://www.irit.fr/WMNC2008/

Keywords

IR-62453
METIS-251167
EWI-13405

Access to Document

Fei_Liu

Cite this

@inproceedings{0992d3ed904c4b2caa4da1197217f3fc,

title = "Dynamic connectivity analysis of ABF-based ad-hoc networks",

abstract = "This paper evaluates the performance of a context discovery protocol using attenuated Bloom filters while nodes appear, disappear, and are temporary unreachable in ad-hoc networks through analytical analysis. Further we verified obtained results with simulation analysis. The analytical results are most accurate when node density is high. Further, we discover that adding a node generates less traffic than removing a node in our protocol. Some proposals are given to reduce the traffic generated by propagating updates due to removing a node.",

keywords = "IR-62453, METIS-251167, EWI-13405",

author = "F. Liu and Geert Heijenk",

year = "2008",

doi = "10.1007/978-0-387-84839-6_32",

language = "Undefined",

isbn = "978-0-387-84838-9",

publisher = "Springer",

number = "Supplement",

pages = "407--420",

booktitle = "Proceedings of the 1st IFIP Wireless and Mobile Networking Conference",

address = "Germany",

note = "1st IFIP Wireless and Mobile Networking Conference, WMNC 2008 ; Conference date: 30-09-2008 Through 02-10-2008",

url = "https://www.irit.fr/WMNC2008/",

}

Liu, F & Heijenk, G 2008, Dynamic connectivity analysis of ABF-based ad-hoc networks. in Proceedings of the 1st IFIP Wireless and Mobile Networking Conference., 10.1007/978-0-387-84839-6, Springer, Berlin, pp. 407-420, 1st IFIP Wireless and Mobile Networking Conference, WMNC 2008, Toulouse, France, 30/09/08. https://doi.org/10.1007/978-0-387-84839-6_32, https://doi.org/10.1007/978-0-387-84839-6

TY - GEN

T1 - Dynamic connectivity analysis of ABF-based ad-hoc networks

AU - Liu, F.

AU - Heijenk, Geert

N1 - Conference code: 1

PY - 2008

Y1 - 2008

N2 - This paper evaluates the performance of a context discovery protocol using attenuated Bloom filters while nodes appear, disappear, and are temporary unreachable in ad-hoc networks through analytical analysis. Further we verified obtained results with simulation analysis. The analytical results are most accurate when node density is high. Further, we discover that adding a node generates less traffic than removing a node in our protocol. Some proposals are given to reduce the traffic generated by propagating updates due to removing a node.

AB - This paper evaluates the performance of a context discovery protocol using attenuated Bloom filters while nodes appear, disappear, and are temporary unreachable in ad-hoc networks through analytical analysis. Further we verified obtained results with simulation analysis. The analytical results are most accurate when node density is high. Further, we discover that adding a node generates less traffic than removing a node in our protocol. Some proposals are given to reduce the traffic generated by propagating updates due to removing a node.

KW - IR-62453

KW - METIS-251167

KW - EWI-13405

U2 - 10.1007/978-0-387-84839-6_32

DO - 10.1007/978-0-387-84839-6_32

M3 - Conference contribution

SN - 978-0-387-84838-9

SP - 407

EP - 420

BT - Proceedings of the 1st IFIP Wireless and Mobile Networking Conference

PB - Springer

CY - Berlin

T2 - 1st IFIP Wireless and Mobile Networking Conference, WMNC 2008

Y2 - 30 September 2008 through 2 October 2008

ER -