نتایج جستجو برای: greedy geographic forwarding based

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

2009
Zhen Jiang Zhigang Li Nong Xiao Jie Wu

In this paper, we extend our early work on safety information in wireless ad hoc sensor networks to the realistic communication model in which each node has the opportunity to receive the signal from any node in the entire network. The safety information is a value ∈ [0, 1] at each node which is calculated in a fully distributed manner based on 1-hop neighborhood information. It indicates the m...

2006
Juan A. Sánchez Pedro M. Ruiz

Geographic routing is one of the most widely-accepted techniques to route information in large-scale wireless sensor networks. It is based on a greedy forwarding strategy by which a sensor node selects as next hop relay the most promising neighbor (according to some metric) among those being closer to the destination than itself. This decision is based solely on the position of its neighbors an...

Journal: :Ad Hoc Networks 2007
Karim Seada Ahmed Helmy Ramesh Govindan

Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geographic routing – using a combination of greedy forwarding and face routing – has been shown to work correctly and efficiently. In this work we model and analyze the correctness of geographic routing under non-ideal realist...

2012
V. Subbaramaiah

Multicasting is the transmission of packets to a group of zero or more hosts identified by a single destination address Multicasting is intended for group oriented computing. Typically the members of a host group are dynamic that is hosts may join and leave groups at any time T. In Mobile Ad hoc Networks communication among the groups is more important. To implement group communication we use e...

2001
Douglas S. J. De Couto Robert Morris

Two main problems prevent the deployment of geographic forwarding in real systems: geographic forwarding requires that all nodes know their locations, and it has trouble routing around local dead ends. This paper presents practical solutions to each problem. The location proxy technique allows a node that does not know its location to find a nearby location aware node to use as a proxy for geog...

2016
V. Raji N. Mohan Kumar N. M. Kumar

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...

Journal: :JNW 2011
Dang Tu Nguyen Wook Choi Minh Thiep Ha Hyunseung Choo

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the network may be intermittently-connected. In such networks, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwardin...

2013
Eric Rozner Jayesh Seshadri Yogita Ashok Mehta Lili Qiu Jing Deng Pramod K. Varshney

Data delivery of packets in broad cast using wireless medium is the main intention of this paper, this will be done through a MANETS and should achieve reliable delivery. To do this various protocols are available in the networks world with in that efficient protocol called Position based opportunistic routing protocol which holds stateless property of geographic routing. When a data packet is ...

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

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