نتایج جستجو برای: greedy forwarding
تعداد نتایج: 19989 فیلتر نتایج به سال:
In this paper, we propose to apply Contention-Based Forwarding (CBF) to Vehicular Ad Hoc Networks (VANETs). CBF is a greedy positionbased forwarding algorithm that does not require proactive transmission of beacon messages. CBF performance is analyzed using realistic movement patterns of vehicles on a highway. We show by means of simulation that CBF as well as traditional position-based routing...
VANET (Vehicular Ad-hoc Network) is a special kind of MANET (Mobile Ad-hoc network) that operates based on a network of many highly mobile, wirelessly connected vehicles using multi-hop communication without access to some fixed infrastructure. VANET have unique characteristics, including high node mobility and rapidly changing network topology which differentiates it from MANET. Therefore, VAN...
Vehicular Ad Hoc Networks (VANET) has emerged to establish communication between intelligent vehicles. The high mobility of vehicles and existing of obstacles in urban area make the communication link between vehicles to be unreliable. In this environment, most geographical routing protocols does not consider stable and reliable link during packet forwarding towards destination. Thus, the netwo...
Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. Due to mobility, the information that a node receives about its neighb...
This material is based upon work supported by the U. S. Army Research Office under grant number W911NF-05-1-0573. Abstract—Node mobility is generally regarded as a hazard for geographic routing, causing a degradation of performance or even persistent routing failures. In this paper we pursue an opposite view where it is possible to take advantage of mobility to enhance greedy forwarding in geog...
Location privacy protection in VANETs considers preserving two types of information: the locations and identifications of users. However, existing solutions which either replace identifications by pseudonyms or hide locations in areas cannot be directly applied to geographic routing protocols since they degrade network performance. To address this issue, we proposed a location-preserved content...
Minimizing Energy consumption is considered as one of the most important principles in the development of routing protocols for Wireless Sensor Networks (WSN). In this study, we propose a Location based Energy-Aware Reliable routing protocol (LEAR) for WSN based on sensor position and clustering. Geographical routing protocols are efficient and convenient for optimum energy consumption and band...
Delay–tolerant networks (DTNs) are sparse and/or highly mobile wireless ad hoc networks which assure no continuous connectivity. One central problem in DTNs is is the routing of packets from a source towards the desired destinations. The literature provides a number of results for very restrictive scenarios in which mobile nodes have the same mobility characteristics and in which only forwardin...
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge Node Based Greedy Routing
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique cha...
Delay Tolerant Networks (DTNs) is a promising current research field that have captured a lot of attention. In DTN, an end-to-end path is not assured and packets are transmitted from a source node to a destination node by the use of store-carry-forward based routing. In case of DTN, a source node or an intermediary node accumulates the packets in its buffer and holds them at the time of moving ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید