نتایج جستجو برای: greedy forwarding
تعداد نتایج: 19989 فیلتر نتایج به سال:
One of the most critical tasks in Vehicular Ad-hoc Networks (VANETs) is broadcasting Emergency Messages (EMs) at considerable data delivery rates (DDRs). The enhanced spider-web-like Transmission Mechanism for Data (TMED) based on request spiders and authenticated to create shortest route path between source vehicle target vehicles. However, adjacent allocation DDR only it not clear whether eac...
The unique anywhere, anytime wireless communication support offers, tremendous potential for the next generation of applications in a Mobile Ad-hoc Network (MANET). The Quality of Service (QoS) has been the ever demanding task of wireless communication to satisfy the application requirements. Geographical routing employs a greedy forwarding technique to deliver the packets to the destination an...
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the network coordinates with every other node in forwarding their packets to reach the destination. Since these nodes operate in a physically insecure environment; they are vulnerable to different types of attacks such as s...
The recent availability of small, inexpensive low power GPS receivers and techniques for finding relative coordinates based on signal strengths, and the need for the design of power efficient and scalable networks, provided justification for applying position based routing methods in ad hoc networks. A number of such algorithms were developed recently. They are all based on three greedy schemes...
Routing protocols for Mobile Ad Hoc Networks (MANETs) have been extensively studied for more than fifteen years. Position-based routing protocols route packets towards the destination using greedy forwarding (i.e., an intermediate node forwards packets to a neighbor that is closer to the destination than itself). Different position-based protocols use different strategies to pick the neighbor t...
Routing is a challenge to Wireless Multimedia Sensor Networks (WMSNs) for supporting multimedia applications due to nodes’ energy constraints and computational capabilities, and the ways sensor nodes obtain forwarding information. In this paper, we propose an online multipath routing protocol that uses nodes’ positions to make forwarding decisions at each hop. Real-time decisions are made witho...
1 — Because sensor nodes operate on power limited batteries, sensor functionalities have to be designed carefully. In particular, designing energy-efficient packet forwarding is important to maximize the lifetime of the network and to minimize the power usage at each node. This paper presents a Geographic Energy-Aware Multipath Stream-based (GEAMS) routing protocol for WMSNs. GEAMS routing deci...
This paper presents a new prediction-based forwarding protocol for the complex and dynamic Delay Tolerant Networks (DTN). The proposed protocol is called GrAnt (Greedy Ant) as it uses a greedy transition rule for the Ant Colony Optimization (ACO) metaheuristic to select the most promising forwarder nodes or to provide the exploitation of good paths previously found. The main motivation for the ...
In this paper, we analyze energy-aware geographical routing protocols with different parameters in wireless sensor networks. Geographic routing is a forwarding protocol that relies on geographic-position information. It is an on-demand type of routing that uses a “greedy” forwarding approach, in which a sensor node forwards a packet to a neighbor closest to the destination node. We study, throu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید