Download Advances in Ad Hoc Networking: Proceedings of the Seventh by Pedro Cuenca, Carlos Guerrero, Ramon Puigjaner, Bartomeu PDF

By Pedro Cuenca, Carlos Guerrero, Ramon Puigjaner, Bartomeu Serra

This ebook constitutes the refereed lawsuits of the seventh Annual Mediterranean advert Hoc Networking Workshop held in Spain on June 25-27, 2008. The IFIP sequence publishes state of the art ends up in the sciences and applied sciences of knowledge and conversation. The scope of the sequence contains: foundations of laptop technology; software program idea and perform; schooling; laptop functions in know-how; communique platforms; structures modeling and optimization; info platforms; desktops and society; desktops expertise; safety and safety in details processing platforms; man made intelligence; and human-computer interplay. lawsuits and post-proceedings of refereed foreign meetings in machine technology and interdisciplinary fields are featured. those effects usually precede magazine ebook and symbolize the most up-tp-date study. The important objective of the IFIP sequence is to motivate schooling and the dissemination and alternate of knowledge approximately all elements of computing.

Show description

Read or Download Advances in Ad Hoc Networking: Proceedings of the Seventh Annual Mediterranean Ad Hoc Networking Workshop, Palma de Mallorca, Spain, June 25-27, 2008 (IFIP ... in Information and Communication Technology) PDF

Similar science (general) books

Extra info for Advances in Ad Hoc Networking: Proceedings of the Seventh Annual Mediterranean Ad Hoc Networking Workshop, Palma de Mallorca, Spain, June 25-27, 2008 (IFIP ... in Information and Communication Technology)

Sample text

8 100 100 Completion Time 500 1 0 0 0 2000 3 0 0 0 7 4 . 5 kept constant, but the time and the coverage are kept constant instead. In more details, the first column (labelled: SRW ct) corresponds to the completion time of the single random walker. The coverage under the TI-Policy and the TD-Policy for the same completion time is shown in the next two columns. The fourth column (labelled: SRW C(L)%) corresponds to the coverage under the single random walker for the completion time of the same row and the first column.

5 9 5 . 4 9 9 . 4 Completion Time 1000 2000 3000 4000 100 3 100 5 800 500 [1000 [2000 13000 14000 111000400 138000420200 Another conclusion is that the completion time under a single random walker is fairly high (in fact it coincides with H). The main conclusion drawn from the results shown in Table 2 (where results under TI-policy are presented) is that the introduction of replicas in the random walk helps reduce the completion time significantly at a generally very small loss (or occasionally no loss or even gain) in coverage.

There are some interesting properties about the L-property and coverage C(L). For example, if for a node the LL-property is satisfied for some L1, then the L2property is also satisfied for any 0 < L1 < L2. If the 0-property is satisfied for some node u, then node u belongs also to the advertising network (u EVa). If the L-property is satisfied for all network nodes, then C(L) = 100%, and vice versa. Furthermore, for any two values of L, 0 < / I 2 < L1, C(L1) > C(L2). , [10], [11], [12], the focus in this paper is mainly on L > 0.

Download PDF sample

Rated 4.52 of 5 – based on 17 votes