Topic
Geographic routing
About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.
Papers published on a yearly basis
Papers
More filters
•
30 Jul 2012TL;DR: In this article, a border node between a reactive routing network and a proactive routing network may receive an inter-domain route request (RREQ) from a requestor for a destination, and determine whether it knows the destination.
Abstract: In one embodiment, a border node between a reactive routing network and a proactive routing network may receive an inter-domain route request (RREQ) from a requestor for a destination, and determines whether it knows the destination In response to knowing the destination, the border node responds to the requestor However, in response to not knowing the destination at the border node, when the border node is ingressing the inter-domain RREQ into the proactive routing network, it sends the inter-domain RREQ to each other border node of the proactive routing network Alternatively, when the border node is ingressing the inter-domain RREQ into the reactive routing network, it sends the inter-domain RREQ into the reactive routing network
81 citations
••
17 May 1988TL;DR: The method presented in this paper realizes a kind of interconnection network, called a hyperswitch network, that is achieved using a mixture of static and dynamic topologies that is consistently more efficient than fixed path routing for large message traffic conditions.
Abstract: The performance of a parallel algorithm depends in a large part on the interconnection topology of the multicomputer system. The method presented in this paper realizes a kind of interconnection network, called a hyperswitch network, that is achieved using a mixture of static and dynamic topologies. Here, available or fault free paths need not be specified by a source because the routing header can be modified in response to congestion or faults encountered as a path is established. This method can be accomplished in a static topology such as the hypercube network if the nodes have switching elements which are capable of performing the necessary routing header revisions dynamically. Detailed simulation results show that the hyperswitch network is consistently more efficient than fixed path routing for large message traffic conditions. The simulation results also show that the hyperswitch network has equivalent latency overhead for messages with localized and antilocal destinations (i.e., less then a 25% difference between diameter 1 and 5).
81 citations
••
17 Nov 2009TL;DR: This protocol is the first that makes use of the diversity in the data traffic while considering latency, reliability residual energy in the sensor nodes, and transmission power between sensor nodes as QoS metrics of the multi-objective problem.
Abstract: In this paper we deal with biomedical applications of wireless sensor networks, and propose a new quality of service (QoS) routing protocol. The protocol design relies on traffic diversity of these applications and ensures a differentiation routing using QoS metrics. It is based on modular and scalable approach, where the protocol operates in a distributed, localized, computation and memory efficient way. The data traffic is classified into several categories according to the required QoS metrics, where different routing metrics and techniques are accordingly suggested for each category. The protocol attempts for each packet to fulfill the required QoS metrics in a power-aware way, by locally selecting the best candidate. It employs memory and computation efficient estimators, and uses a multi-sink single-path approach to increase reliability. The main contribution of this paper is data traffic based QoS with regard to all the considered QoS metrics. To our best knowledge, this protocol is the first that makes use of the diversity in the data traffic while considering latency, reliability residual energy in the sensor nodes, and transmission power between sensor nodes as QoS metrics of the multi-objective problem. The proposed algorithm can operate with any MAC protocol, provided that it employs an ACK mechanism. Performance evaluation through a simulation study, comparing the new protocol with state-of-the QoS and localized protocols, show that it outperforms all the compared protocols.
81 citations
•
09 Nov 2004
TL;DR: In this article, a method for interfacing scanned product information with a source for the product over a global network is presented, where a product code associated with the product is scanned with a scanner at a user location on the global communication network to extract the information contained in the unique product code therefrom.
Abstract: A method for interfacing scanned product information with a source for the product over a global network. A method is provided for obtaining information regarding the source of a product from a remote information source location on a global communication network utilizing a product code associated with the product and unique thereto. The product code associated with the product is scanned with a scanner at a user location on the global communication network to extract the information contained in the unique product code therefrom. A unique scan ID code is associated with the scanning operation and a packet of information assembled that is comprised of the extracted product code and the unique scan ID code to provide a routing packet. The user location is then connected to the remote information source location utilizing the routing packet and in response to the step of scanning, wherein the routing packet is representative of the location of the remote information source location on the global communication network through an association with a routing table.
81 citations
••
28 Oct 2015
TL;DR: This study puts Internet topologies and models under the microscope, and finds that between 14-35% of routing decisions are not explained by existing models, and investigates root causes such as selective prefix announcement, misclassification of undersea cables, and geographic constraints.
Abstract: Models of Internet routing are critical for studies of Internet security, reliability and evolution, which often rely on simulations of the Internet's routing system. Accurate models are difficult to build and suffer from a dearth of ground truth data, as ISPs often treat their connectivity and routing policies as trade secrets. In this environment, researchers rely on a number of simplifying assumptions and models proposed over a decade ago, which are widely criticized for their inability to capture routing policies employed in practice.In this study we put Internet topologies and models under the microscope to understand where they fail to capture real routing behavior. We measure data plane paths from thousands of vantage points, located in eyeball networks around the globe, and find that between 14-35% of routing decisions are not explained by existing models. We then investigate these cases, and identify root causes such as selective prefix announcement, misclassification of undersea cables, and geographic constraints. Our work highlights the need for models that address such cases, and motivates the need for further investigation of evolving Internet connectivity.
81 citations