نتایج جستجو برای: greedy geographic forwarding based on geospatial division algorithm
تعداد نتایج: 9405019 فیلتر نتایج به سال:
Routing in sensor networks is a challenging issue due to inherent constraints such as energy, memory and CPU processing capabilities. The energy efficiency is one of the key concerns in sensor networks for their better performance, as sensor nodes are limited in their battery power. In this research work, different routing algorithms have been studied and the main focus was on geographic routin...
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...
A semantics-based method for density-based clustering with constraints imposed by geographical background knowledge is proposed. In this paper, we apply an ontological approach to the DBSCAN (Density-Based Geospatial Clustering of Applications with Noise) algorithm in the form of knowledge representation for constraint clustering. When used in the process of clustering geographic information, s...
Wireless Multimedia Sensor Networks (WMSNs) are generally used for surveillance applications, intrusion detection, environmental and building monitoring, etc. Routing has become an important challenge to WMSNs from the standpoint of supporting multimedia applications due to the constraints on energy and computational capabilities of sensor nodes, and acquiring of the global network knowledge fo...
Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy algorithms to forward packets by selecting relays with the best progress towards the destination or use a recovery mode in case such solutions ...
One of the most current routing families in wireless sensor networks is geographic routing. Using nodes location, they generally apply a greedy routing that makes a sensor forward data to route to one of its neighbors in the forwarding direction of the destination. If this greedy step fails, the routing protocol triggers a recovery mechanism. Such recovery mechanisms are mainly based on graph p...
Abstract One of the main goal in the mixture distributions is to determine the number of components. There are different methods for determination the number of components, for example, Greedy-EM algorithm which is based on adding a new component to the model until satisfied the best number of components. The second method is based on maximum entropy and finally the third method is based on non...
Real estate market analysis begins with the correct spatial delineation of the geographic market trade area. The less accurate the spatial delineation, the greater the error introduced into subsequent analysis such as calculation of competitive supply, demand and absorption. Advancements in geospatial technology provide for greater ease of execution of traditional methods of calculation of mark...
Typical communication patterns within a sensor network are data delivery from sensor nodes to one of selected information sinks, and information sinks requesting a certain physical phenomenon or requesting sensor nodes lying within a sensed area. In general, addressing is achieved by utilizing sensor locations. Geographic routing algorithms allow routers to be nearly stateless since packet forw...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید