Geographic routing

About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.

Power and delay sensitive ad-hoc communication networks

Abstract: An ad-hoc wireless communication network includes multiple nodes. Each node maintains a routing table. The routing table is constructed by broadcasting route request packets from a source node. The request packet includes an address of a destination node. Intermediate nodes in the network receiving the request packet, determine power and delay cost associated with the intermediate node participating in the route. If the cost is less than a threshold value, then the intermediate node participates in the routing of packets for other nodes. The intermediate node then sends a reply packet back to the source node. The reply packet includes the intermediate node addresses, as well as the power and delay costs. The source can thus construct the routing table. The source node can select a particular node for transferring application data packets based on either the power cost, the delay cost or both costs.

Multihop clustering algorithm for load balancing in wireless sensor networks

Abstract: The paper presents a new cluster based routing algorithm that exploits the redundancy properties of the sensor networks in order to address the traditional problem of load balancing and energy efficiency in the WSNs.The algorithm makes use of the nodes in a sensor network of which area coverage is covered by the neighbours of the nodes and mark them as temporary cluster heads. The algorithm then forms two layers of multi hop communication. The bottom layer which involves intra cluster communication and the top layer which involves inter cluster communication involving the temporary cluster heads. Performance studies indicate that the proposed algorithm solves effectively the problem of load balancing and is also more efficient in terms of energy consumption from Leach and the enhanced version of Leach.

Some help on the way: opportunistic routing under uncertainty

Abstract: We investigate opportunistic routing, centering on the recommendation of ideal diversions on trips to a primary destination when an unplanned waypoint, such as a rest stop or a refueling station, is desired. In the general case, an automated routing assistant may not know the driver's final destination and may need to consider probabilities over destinations in identifying the ideal waypoint along with the revised route that includes the waypoint. We consider general principles of opportunistic routing and present the results of several studies with a corpus of real-world trips. Then, we describe how we can compute the expected value of asking a user about the primary destination so as to remove uncertainly about the goal and show how this measure can guide an automated system's engagements with users when making recommendations for navigation and analogous settings in ubiquitous computing.

Dynamical routing for text messaging

Abstract: Routing text messages. A mobile message (MM) is received from an application program or other message source, and includes a destination identifier, such as a phone number. Based on the destination identifier, a routing server determines whether the MM is to be locally routed to a destination carrier, or forwarded to a remote server that provides access to the destination carrier. For local routing, the routing server determines a channel to the carrier based on predefined carrier information, the destination user information, and the carrier gateway dynamic information. The predefined carrier information indicates predicted availability or reliability of each of a plurality of channels to the carrier. The destination user information indicates availability of the destination user to receive messages, and includes a destination user criterion for determining one of the channels. The carrier gateway dynamic information indicates current and statistical traffic information for each of the channels.

A novel void node recovery paradigm for long-term underwater sensor networks

Abstract: Aquatic environment corresponds to more than 70% of the Earth's surface mostly still unknown and unexplored. Underwater wireless sensor networks have recently been proposed as a way to observe and explore these environments. However, the efficient data delivery is still a challenging issue in these networks because of the impairments of the acoustic transmission. To cope with this problem, we present a novel geographic forwarding protocol and two topology control mechanisms for long-term non-time-critical underwater sensor networks. The proposed routing protocol considers the anycast network architecture in the data forwarding process. The proposed centralized topology control (CTC) and the distributed topology control (DTC) mechanisms organize the network via depth adjustment of some nodes. Simulation results show that with these mechanisms, the data packet delivery ratio achieves more than 90% even in hard and difficult scenarios of very sparse or very dense networks, and the end-to-end delay and energy consumption per delivered packet are reduced.