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

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

2006
Karla A. V. Borges

Queries that include at least one geographic-related term, such as place names and natural features, are currently a significant subset of the queries that are submitted to search engines. Interest on local information on the Web (local search) is increasing daily, and for this kind of search, the Web is a vast repository of local geographic information. However, traditional search engines have...

Journal: :Information Technology and Control 2022

In mobile ad-hoc networks (MANET), nodes are randomly distributed and move freely, hence the network may face rapid unexpected topological changes. this paper, an improved greedy perimeter stateless routing protocol, called “LDAB-GPSR”, is proposed. LDAB-GPSR mainly focuses on maximizing packet delivery ratio while minimizing control overhead. order to accomplish this, two techniques introduced...

Journal: :نشریه دانشکده فنی 0
پرهام پهلوانی محمودرضا دلاور فرهاد صمدزادگان

multi-criteria shortest path problems (mspp) are called as np-hard. for mspps, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. this paper describes the development ...

2018
Baban A. Mahmood D. Manivannan

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

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

Journal: :Annals of GIS 2005
Liping Di

1082-4006/05/1101-24$5.00 ©2005 The International Association of Chinese Professionals in Geographic Information Science (CPGIS) Abstract This paper discusses an interoperable system framework for developing web-service-based intelligent geospatial knowledge systems. This type of systems facilitates personalized, on-demand geospatial information or knowledge discovery and dissemination. The sys...

2014
Ralph Grove James Wilson Dave Kolas Nancy Wiegand

As geospatial data are becoming more widely used through mobile devices and location sensitive applications, the potential value of linked open geospatial data in particular has grown, and a foundation is being developed for the Semantic Geospatial Web. Protocols such as GeoSPARQL and stSPARQL extend SPARQL in order to take advantage of spatial relationships inherent in geospatial data. This pa...

Journal: :Computers & Geosciences 2009
Chia-Hsin Huang Tyng-Ruey Chuang Dong-Po Deng Hahn-Ming Lee

Disaster response systems are designed to facilitate decision-making based on large amounts of heterogeneous geographic information. Most geographic information systems (GISs) use relational databases to manipulate information efficiently. However, they suffer from interoperability issues because they need to expend significant effort mapping heterogeneous geographic information, which may have...

1997
Ioannis Caragiannis Christos Kaklamanis

In this paper, we address the issue of efficiently allocating wavelengths to communication requests in wavelength division multiplexing (WDM) optical networks. We present a simple greedy algorithm and study its performance on directed binary fiber trees. We prove that our algorithm guarrantees a 5=3-approximationfor wavelengths assignment in binary tree shaped WDM optical networks. We also prov...

Journal: :J. Inf. Sci. Eng. 2004
Lan Luan Wen-Jing Hsu Rui Zhang

We present a location-aware routing protocol called MGPSR (Modified Greedy Perimeter Stateless Routing) for Mobile Ad Hoc Networks. MGPSR offers the crucial correctness guarantee of the well known Greedy Perimeter Stateless Routing (GPSR) protocol; moreover, it possesses two additional attractive properties: (1) the modified Greedy forwarding scheme balances between the transmission power consu...

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

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