Abstract : Force - based Geometric Routing ∗
نویسندگان
چکیده
Routing is the foremost issue in mobile ad hoc networks (MANETs) and sensor networks. To guarantee delivery and improve performance, most position-based routing protocols are based on face routing, which requires the underlying network to be a planar graph. Localized planar graph construction requires the radio model to be a unit disk graph and it is only applicable to two-dimensional networks. This paper presents an efficient force-based geometric routing algorithm, which is applicable to general networks and has a worst-case bound for arbitrary three-dimensional networks.
منابع مشابه
Generating an Indoor space routing graph using semantic-geometric method
The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...
متن کاملHybrid Routing for FPGAs by Integrating Boolean Satisfiability with Geometric Search
Boolean Satisfiability (SAT)-based routing has unique advantages over conventional one-net-at-a-time approaches such as simultaneous net embedding or routability decision. Yet SAT-based routing has been criticized for scalability issues. On the other hand, geometric search routing algorithms, even with extensive rip-up-reroute capabilities, have difficulty achieving routing solution convergence...
متن کاملM-Geocast: Robust and Energy-Efficient Geometric Routing for Mobile Sensor Networks
In this paper we investigate a practical routing solution for a new class of wireless sensor networks where any node can be mobile anytime. Assuming GPS-enabled sensor nodes we propose a new geometric routing protocol called M-Geocast that is designed to efficiently support node mobility as well as location service for such mobile sensor networks. Unlike existing geometric routing schemes, M-Ge...
متن کاملTransforming Abstract Interpretations by Abstract Interpretation New Challenges in Language-based Security
In this paper we exploit abstract interpretation for transforming abstract domains and semantics. The driving force in both transformations is making domains and semantics, i.e. abstract interpretations themselves, complete, namely precise, for some given observation. We prove that a common geometric pattern is shared by all these transformations, both at the domain and semantic level. This pat...
متن کاملNetwork Parameters Evaluation in Vehicular Ad-hoc Network (VANET) Routing Protocols for Efficient Message Delivery in City Environment
Abstract- Efficient message delivery in city environment is required to ensure driver’s safety and passenger’s comfortability. In cities of developed nations, routing of data in vehicular Ad hoc Network (VANET) faces many challenges such as radio obstacles, mobility constraints and uneven nodes distribution. These factors primarily makes communication between vehicles complex. To overcome and t...
متن کامل