Lookup NU author(s): David Cooper,
Dr Paul Ezhilchelvan,
Emeritus Professor Isi Mitrani
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
A family of message propagation protocols for highly mobile ad-hoc networks is defined, and is studied analytically and by simulation. The coverage of a message (the fraction of nodes that receive it), can be made arbitrarily close to 1, at a moderate cost of extra message traffic. Under certain simplifying assumptions, it is shown that a high coverage is achieved by making a total of O(nln n) broadcasts, where n is the number of nodes, and the time to propagate a message is O(ln n). The effect of various parameters on the protocol performance is examined. Keywords: Ad-hoc networks, mobility patterns, message propagation, broadcasting. © IFIP International Federation for Information Processing 2004.
Author(s): Cooper DE, Ezhilchelvan P, Mitrani I
Editor(s): Mitrou, N; Kontovasilis, K; Rouskas, GN; Iliadis, I; Merakos, L
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: NETWORKING 2004: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications: 3rd International IFIP-TC6 Networking Conference
Year of Conference: 2004
URL: http://dx.doi.org/ 10.1007/978-3-540-24693-0_9
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science