Đang chuẩn bị liên kết để tải về tài liệu:
Báo cáo hóa học: " Research Article Lower Bound of Energy-Latency Tradeoff of Opportunistic Routing in Multihop Networks"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: IResearch Article Lower Bound of Energy-Latency Tradeoff of Opportunistic Routing in Multihop Networks | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2011 Article ID 265083 17 pages doi 10.1155 2011 265083 Research Article Lower Bound of Energy-Latency Tradeoff of Opportunistic Routing in Multihop Networks Ruifeng Zhang 1 2 Jean-Marie Gorce 3 Olivier Berder 1 and Olivier Sentieys1 1 Universite de Rennes 1 IRISA INRIA 22300 Lannion France 2 School of Communication and Information Engineering Shanghai University Shanghai 200072 China 3 Universite de Lyon INRIA INSA-Lyon CITI 69621 France Correspondence should be addressed to Ruifeng Zhang ruifeng.zhang@irisa.fr Received 1 May 2010 Revised 9 September 2010 Accepted 13 October 2010 Academic Editor Sergio Palazzo Copyright 2011 Ruifeng Zhang et al. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. Opportunistic networking aims at exploiting sporadic radio links to improve the connectivity of multihop networks and to foster data transmissions. The broadcast nature of wireless channels is an important feature that can be exploited to improve transmissions by using several potential receivers. Opportunistic relaying is thus the first brick for opportunistic networking. However the advantage of opportunistic relaying may be degraded due to energy increase related to having multiple active receivers. This paper proposes a thorough analysis of opportunistic relaying efficiency under different realistic radio channel conditions. The study is intended to find the best tradeoff between two objectives energy and latency minimizations with a hard reliability constraint. We derive an optimal bound namely the Pareto front of the related optimization problem which offers a good insight into the benefits of opportunistic routings compared with classical multihop routing schemes. Meanwhile the lower bound provides a framework to .