نتایج جستجو برای: greedy geographical routing

تعداد نتایج: 116967  

2014
Tony Grubman Y. Ahmet Sekercioglu Nick Moore

Geographic routing protocols are well suited to wireless sensor networks because of their modest resource requirements. A major limiting factor in their implementation is the requirement of location information. The virtual localization algorithm provides the functionality of geographic routing without any knowledge of node locations by constructing a virtual coordinate system. It differs from ...

2012
Anilkumar Kothalil Gopalakrishnan

A subjectively influenced router for vehicles in a fourjunction traffic system is presented. The router is based on a 3-layer Backpropagation Neural Network (BPNN) and a greedy routing procedure. The BPNN detects priorities of vehicles based on the subjective criteria. The subjective criteria and the routing procedure depend on the routing plan towards vehicles depending on the user. The routin...

Journal: :International Journal of Advances in Applied Sciences 2018

Journal: :J. Parallel Distrib. Comput. 2006
Johnson Kuruvila Amiya Nayak Ivan Stojmenovic

Almost all existing routing and broadcasting protocols for ad hoc networks assume an ideal physical layer model. In this article, we present new greedy, localized algorithms for ad hoc wireless networks for maximizing probability of delivery, without acknowledgements, considering a realistic physical layer. Using the log normal shadowing model to represent a realistic physical layer, we use the...

Journal: :Computer Communications 2009
Li Tang Jun Li Yanda Li Scott Shenker

The Internet’s tremendous value is undoubtedly dependent on its universal connectivity among a great number of heterogeneous networks that are distributed over the world. In recent years, while the Internet’s scale has expanded exponentially, the current status of its connectivity is still in the lack of comprehensive and formal study. In this paper, we contribute to the understanding of Intern...

Journal: :MONET 2010
Pei-Chun Cheng Kevin C. Lee Mario Gerla Jérôme Härri

Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy algorithms to forward packets by selecting relays with the best progress towards the destination or use a recovery mode in case such solutions ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید