نتایج جستجو برای: greedy geographic forwarding based on geospatial division algorithm

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

2009
WEISHENG SI ALBERT Y. ZOMAYA SELVAKENNEDY SELVADURAI Weisheng Si Albert Y. Zomaya Selvadurai Selvakennedy

This paper first envisions the advent of the directional wireless mesh networks with multiple radios and directional antennas in the coming years. Then, based on the observation that simplicity induces efficiency and scalability, the paper proposes a combined geometric deployment and routing strategy for such mesh networks, and also gives a concrete approach under this strategy. The main idea o...

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

Ebadi, Hamid, Ghorbani, Fariborz, Sedaghat, Amin,

Nowadays, due to quality development of satellite images, automatic target detection on these images has been attracted many researchers' attention. Remote-sensing images follow various geospatial targets; these targets are generally man-made and have a distinctive structure from their surrounding areas. Different methods have been developed for automatic target detection.  In most of these met...

2013
S. Geetha Priya A. R. Arunachalam

The wireless link can be unreliable in realistic wireless sensor networks (WSNs). Energy efficient and reliable data forwarding is important because each node has limited resources. Therefore, we must suggest an optimal solution that considers using the information of the node’s characteristic A wireless sensor network is composed of a large number of low-cost devices distributed over a geograp...

Journal: :Wireless Networks 2008
Michele Rossi Michele Zorzi Ramesh R. Rao

The main goal of this paper is to provide routing– table-free online algorithms for wireless sensor networks (WSNs) to select cost (e.g., node residual energies) and delay efficient paths. As basic information to drive the routing process, both node costs and hop count distances are considered. Particular emphasis is given to greedy routing schemes, due to their suitability for resource constra...

2004
Hannes Stratil

A wireless sensor network needs a suitable multihop routing protocol to facilitate the communication between arbitrary sensor nodes. Position-based routing protocols are attractive for large-scale sensor networks due to their location awareness and scalability. A large number of position-based routing protocols use the greedy forwarding strategy. This paper presents an efficient implementation ...

2009
Sidney R. de Sousa Claudia B. Medeiros

Geographic information systems (GIS) are increasingly using geospatial data from the Web to produce geographic information. One big challenge is to find the relevant data, which often is based on keywords or even file names. However, these approaches lack semantics. Thus, it is necessary to provide mechanisms to prepare data to help retrieval of semantically relevant data. This work proposes an...

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

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