49 results about "Geographic routing" patented technology

A routing method and system. The method includes receiving by a global positioning satellite (GPS) transceiver, a user profile comprising user preference data and destination location data. The GPS transceiver retrieves first geospatial coordinate values for a current location of the user and a destination location. The GPS transceiver processes the user profile and the first geospatial coordinate values to identify a geographical route for traveling from the current location to the destination location. The GPS transceiver retrieves current traffic speed / traffic density data and historical traffic speed / traffic density data associated with second geospatial coordinate values for various locations located along the first geographical route. The GPS transceiver processes the current traffic speed / traffic density data and the historical traffic speed / traffic density data to determine if the first geographical route comprises an efficient geographical route for the user.

A computer-based system manages and communicates the identity, attributes, and current state of a geographic point of interest. The system includes a beacon device and a distributed data network. The beacon device includes a housing supporting control electronics, a display, and communication electronics. The beacon is placed at a visible location at the geographic point of interest and receives information concerning the geographical point of interest. The display visibly communicates the information while the communication electronics communicates the same information to the distributed data network. A user can query a location-based service and receive the same information from the distributed data network that is being communicated by the display, assuring communication of accurate and consistent information concerning the geographic point of interest.

The invention discloses a prediction-based routing method at an intersection in a vehicle self-organizing network, and mainly solves the problem that when a packet is routed at the intersection, a link is unstable in the prior art. The scheme for implementing the method is that: when the packet arrives at a previous hop node of the intersection, the node predicts the next intersection to which the packet is transmitted; a weight of each adjacent intersection is calculated according to the density of adjacent road sections and a distance from the next intersection to a destination, and the intersection with the largest weight is selected as the next temporary destination for transmitting the packet; and when the packet is forwarded in a greedy mode in the road section, if the selected nodeis positioned in the boundary of the transmission range and is opposite to a driving direction of the transmitting node, a node secondarily nearest to the destination is selected, otherwise the packet is directly forwarded to the selected node. Compared with the geographic routing in city scenarios (GPCR) protocol and the greedy perimeter stateless routing for wireless networks in urban vehicularscenarios (GpsrJ+ protocol), the method has the advantages that: the transmission rate of the packet is increased, the transmission time delay of the packet is reduced, and the method can be applicable to the vehicle self-organizing network.

A system for providing alert notifications to multiple persons or to a plurality of related geographic locations. The system stores a database of information including a plurality of communications identifiers and additional information for subscribers having those identifiers, including geographic locations and / or school / organization membership information. The system responds to commands identifying alerts to be delivered to affected geographic areas or schools / organizations, by retrieving communications identifiers in the threatened geographic location or associated with the named school / organization, establishing a communications connection using each retrieved communication identifier, and delivering the alert. Alerts may be initiated by authorized personnel via telephone or Internet interaction with the system, or may be generated automatically from data feeds such as the EMWIN system of the National Weather Service. Alerts may be delivered via telephone, pager (voice or text), e-mail, Internet, or other media.

An interactive wide area computer network system and method for accessing and transmitting data using a printed page optical code. The code includes a system configuration mode identifier which configures the system to perform specified functions and allow the user certain interactive options. Based on the configuration mode and the user's selected option, the system generates and executes the necessary queries, commands, and responses to be routed upon the network. In an embodiment, a two dimensional optical code (“2DOC” or “barcode”) is printed on a magazine page advertisement containing information such as internet web addresses, product identity, advertisement identity, location, page number, magazine issue number, and geographic routing numbers. The system extracts this information using an optical code reader and combines it with user input parameters to generate network commands which access web pages, and / or transmit and receive relevant data via a user's computer connected to the internet and running an internet browser. The user may select an option wherein the system performs unique tasks depending on the advertisement.

The invention discloses a distance-based energy balance dynamic geographic routing method in an underwater sensor network, and the method comprises the steps: establishing and maintaining a neighbor node table; selecting neighbor nodes that forward a data packet according to the neighbor node table to form a data packet forwarding area; calculating a forwarding factor; and setting the time for theadjacent sensor nodes in waiting for the forwarding of the data packet according to the forwarding factor. The method performs routing selection through the coordinate position information of the nodes, effectively compensates for some defects of a topology information routing method, dynamically adjusts the size of the forwarding area, reduces excessive redundant nodes for sending data, and enables a routing protocol to have dynamic adaptability. The greater the remaining energy of a node is, the easier it is to forward data, and vice versa. Finally, energy balance can be achieved.

The invention discloses a connection and distance balancing VANET geographical routing protocol. According to road characteristics, for the first time, the optimal next hop is selected by calculating a CDP (Product of Connection and Distance), and a disconnected route is timely recovered in a local recovery method. The routing protocol divides the routing process into two stages including that 1) in a route establishing stage, a vehicle determines whether the position thereof belongs to an intersection or road area, wherein if a node is placed in the road area, a neighbor node with the maximal CDP value is selected as the next hop for the node; if the node is in the intersection area, a next road is first selected for the node, the CDP of a neighbor node in the road is calculated, and the optimal next hop is selected; and according to the CDP values, the optimal next hops are successively selected, and a high-efficiency route is finally established; and 2) in a route recovery stage, a local recovery strategy is employed for the nodes, and a carrying-forwarding strategy is employed when local recovery failure or routing void occurs.

A telecommunication system establishes location information concurrently with the set-up of a landline as a network address for delivering wireless-based subscription services. A location register in the wireless system defines a current network location where a respective subscriber is connected and a current geographic location where said respective subscriber is located. An access device is provided for coupling with a landline within the public switched telephone network, wherein the landline has a landline ID, and wherein a user terminal connected to the landline is associated with a fixed geographic location. A control channel transmits an electronic identification number of a subscriber and a location coordinate corresponding to the fixed geographic location from the access device to the location register during registration of the landline as the current network address of the user terminal. The subscriber receives location-based wireless services via the landline.

The invention provides a cavity bypassing type geographical routing method based on Delauney triangulation. The cavity bypassing type geographical routing method based on Delauney triangulation is mainly used for solving the problem that a cavity appears during greedy transmission of existing routing and improving cavity bypassing routing efficiency. The cavity bypassing type geographical routing method based on Delauney triangulation comprises the basic steps that 1, each node maintains a neighbor table and broadcasts a hop of Hello protocol package with the delta t as the cycle, and the default data transmitting mode of the node is set to be the greedy mode; 2, the nodes process received data, a data packet is transmitted in the greedy mode, and transmission in the greedy mode fails, and step 4 is executed; 3, whether the data packet reaches a target node or not is judged, transmission is complete is yes, and the step 2 is executed again and data are continued to be transmitted if not; 4, if a local extreme value appears during transmission of the current node due to the existence of a cavity, and the next hop of Hello protocol package is transmitted in the peripheral transmission mode till the data packet reaches the target node.

The invention discloses a multipath geographic routing optimization method for on-demand movement of a sink node in a wireless sensor network. The method adopts hierarchical logical structure design and is respectively divided into three stages of establishing a neighbor table, establishing a path table and establishing a routing table. The movement of the sink node is constrained by parameters, such as residual energy, time and a target function, in order to avoid frequent updating of the neighbor table due to frequent movement of the sink node, so that the neighbor table can be selectively updated by the node. The neighbor table and the path table adopt a separate establishment process, so that the updating amount caused by sink movement is reduced; during a route search stage, a global optimum path set is searched by adopting an improved taboo search algorithm; routing is conducted in the optimum path set, and the health index of a path link is measured by a short slab principle in order to avoid invalid routes; when the health index is lower than a computing threshold, the link is a critical path, the sink node moves towards the short slab path, so that the on-demand movement of the sink node is realized, the network energy consumption is effectively balanced, and the network lifetime is prolonged.

Systems and methods for locating server nodes in close proximity to edge devices using georouting. Microservers automatically form a global peer-to-peer network to serve edge functions and content to edge devices. Edge devices use HyperText Transfer Protocol (HTTP) to execute serverless functions or otherwise retrieve data from edge nodes located in close proximity to the HTTP client. Serverless functions are implemented in secure, isolated environment utilizing a blockchain.

The invention discloses a prediction-based routing method at an intersection in a vehicle self-organizing network, and mainly solves the problem that when a packet is routed at the intersection, a link is unstable in the prior art. The scheme for implementing the method is that: when the packet arrives at a previous hop node of the intersection, the node predicts the next intersection to which the packet is transmitted; a weight of each adjacent intersection is calculated according to the density of adjacent road sections and a distance from the next intersection to a destination, and the intersection with the largest weight is selected as the next temporary destination for transmitting the packet; and when the packet is forwarded in a greedy mode in the road section, if the selected nodeis positioned in the boundary of the transmission range and is opposite to a driving direction of the transmitting node, a node secondarily nearest to the destination is selected, otherwise the packet is directly forwarded to the selected node. Compared with the geographic routing in city scenarios (GPCR) protocol and the greedy perimeter stateless routing for wireless networks in urban vehicularscenarios (GpsrJ+ protocol), the method has the advantages that: the transmission rate of the packet is increased, the transmission time delay of the packet is reduced, and the method can be applicable to the vehicle self-organizing network.

A method of providing access to telecommunication services involves receiving a routing information request for terminating a communication with a mobile station located within a visited geographic region, the routing information request including a directory number local to the visited geographic region. A subscriber identity associated with the received directory number is then dynamically selecting from an evaluation of a decision tree, the decision tree associating a reference directory number with a plurality of reference subscriber identities. Each reference subscriber identity is associated with a telecommunications service user, each user being registered to receive telecommunication services within a respective home geographic region, the home geographic region being different from the visited geographic region. The mobile station receives access to the telecommunication services within the visited geographic region via the selected subscriber identity.