Download Ad Hoc Networks: 5th International ICST Conference, by Zayneb Trabelsi Ayoub, Sofiane Ouni (auth.), Mostafa Hashem PDF

By Zayneb Trabelsi Ayoub, Sofiane Ouni (auth.), Mostafa Hashem Sherif, Abdelhamid Mellouk, Jun Li, Paolo Bellavista (eds.)

ISBN-10: 3319041045

ISBN-13: 9783319041049

This publication constitutes the completely refereed complaints of the fifth overseas convention on advert Hoc Networks, ADHOCNETS 2013, held in Barcelona, Spain, in October 2013. The 14 revised complete papers offered have been conscientiously chosen and reviewed from various submissions and canopy quite a lot of purposes, advertisement and armed forces resembling cellular advert hoc networks, sensor networks, vehicular networks, underwater networks, underground networks, own sector networks, domestic networks and large-scale metropolitan networks for clever towns. they're equipped in topical sections on instant sensor networks, routing, functions and security.

Show description

Read Online or Download Ad Hoc Networks: 5th International ICST Conference, ADHOCNETS 2013, Barcelona, Spain, October 2013, Revised Selected Papers PDF

Similar international_1 books

Advances in Cryptology - CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings

Crypto 2003, the twenty third Annual Crypto convention, was once subsidized by means of the Int- nationwide organization for Cryptologic study (IACR) in cooperation with the IEEE machine Society Technical Committee on safeguard and privateness and the pc technological know-how division of the collage of California at Santa Barbara.

Computational Logistics: 5th International Conference, ICCL 2014, Valparaiso, Chile, September 24-26, 2014. Proceedings

This e-book constitutes the refereed court cases of the fifth foreign convention on Computational Logistics, ICCL 2014, held in Valparaiso, Chile, in September 2014. The eleven papers awarded during this quantity have been conscientiously reviewed and chosen for inclusion within the ebook. they're equipped in topical sections entitled: optimization of delivery difficulties; box terminal purposes; simulation and environmental sustainability purposes.

Machine Learning, Optimization, and Big Data: Second International Workshop, MOD 2016, Volterra, Italy, August 26-29, 2016, Revised Selected Papers

This publication constitutes revised chosen papers from the second one foreign Workshop on computing device studying, Optimization, and massive facts, MOD 2016, held in Volterra, Italy, in August 2016. The forty papers offered during this quantity have been rigorously reviewed and chosen from ninety seven submissions. those complaints include papers within the fields of desktop studying, Computational Optimization and DataScience featuring a considerable array of rules, applied sciences, algorithms, equipment and functions.

Extra info for Ad Hoc Networks: 5th International ICST Conference, ADHOCNETS 2013, Barcelona, Spain, October 2013, Revised Selected Papers

Sample text

F) Overhead (packets) with data send rate Figures 2(a), (b) and (c) represents the average delay, average jitter and data delivery ratio respectively with variation in network area. It can be observed from the figures that by increasing the network area, performance of all the three algorithms deteriorate. By increasing the area under observation, node density becomes low which in turns affects the network performance because of poor connectivity. It also increases the average path length between two nodes that are communicating with each other.

In: IEEE Conference on Local Computer Networks (LCN 2012), Clearwater, FL (to appear) 6. : Optimized interconnection of disjoint wireless sensor network segments using k mobile data collectors. In: IEEE International Conference on Communications (ICC’12), Ottawa, Canada, June 2012 7. : Connectivity restoration in disjoint wireless sensor networks using limited number of mobile relays. In: 2013 IEEE International Conference on Communications (ICC) (to appear) 8. : Solving the p-center problem with tabu search and variable neighborhood search.

The evaluation of the proposed approaches revealed that rendezvous scheduling reduces the waiting delay significantly and thus our approach outperforms the existing approaches where rendezvous waiting is not considered. The experimentation with multiple sinks has also shown the significant impact of eliminating rendezvous waiting and minimizing the total delay. Acknowledgment. This work is supported by US National Science Foundation under the grant number CNS 1018404. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.

Download PDF sample

Rated 4.03 of 5 – based on 49 votes