Geographic routing

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

Ant Colony Optimization-Based Location-Aware Routing for Wireless Sensor Networks

Abstract: The routing for Wireless Sensor Networks (WSNs) is a key and hard problem, and it is a research topic in the field of WSN applications. Based on Ant Colony Optimization (ACO), this paper proposes a novel adaptive intelligent routing scheme for WSNs. Following the proposed scheme, a high performance routing algorithm for WSNs is designed. The proposed routing scheme is very different from the existing ACO based routing schema for WSNs. On one hand, in the proposed scheme, the search range for an ant to select its next-hop node is limited to a subset of the set of the neighbors of the current node. On the other hand, by fusing the residual energy and the global and local location information of nodes, the new probability transition rules for an ant to select its next-hop node are defined. Compared with other ACO based routing algorithms for WSNs, the proposed routing algorithm has a better network performance on aspects of energy consumption, energy efficiency, and packet delivery latency.

An anonymous on-demand position-based routing in mobile ad hoc networks

Abstract: Due to the infrastructure-less, dynamic and broadcast nature of radio transmissions, communications in mobile ad hoc networks (MANETs) are susceptible to malicious traffic analysis. After traffic analysis, an attacker determines a target node and conducts an intensive attack against it, called target-oriented attack. The traffic analysis and the target-oriented attacks are known as quite severe problems in MANETs, including position-based routing protocols, with respect to the degradation of both throughput and security of the routing. Also position information of routing nodes is very sensitive data in MANETs where even nodes not knowing either other establish a network temporarily. Therefore we propose a new position-based routing protocol which keeps routing nodes anonymous, thereby preventing possible traffic analysis. To this end, a time variant temporary identifier temp ID is computed from time and position of a node and used for keeping the node anonymous. Only the position of a destination node is required for the route discovery, and temp ID is used for establishing the route for sending data: a receiver hand shake scheme is designed for determining the next hop on-demand with use of the temp ID. We evaluate the level of anonymity and performance of our scheme. The analysis shows that the proposed scheme ensures the anonymity of both route and nodes and the robustness against the target-oriented attack and several others. Also our scheme is applicable to networks with any density of nodes.

Dynamic source routing for ad hoc networks using the global positioning system

Abstract: This paper proposes a new routing protocol for ad hoc networks built around the source routing technique combined with the location (e.g., GPS coordinates) of nodes obtained by an energy and distance smart dissemination mechanism. The key new observation used is that the location information provides each node with a snapshot of the topology of the complete network from which a source route may be computed locally rather than through route discovery. The resulting protocol has reduced delay, and is more bandwidth and energy efficient, than both traditional (proactive and reactive) ad hoc routing protocols, as well as location based routing protocols.

An adaptive routing algorithm for wavelength-routed optical networks with a distributed control scheme

Abstract: For a wavelength-routed network in which connection requests are arriving and departing at high rates, an appropriate control scheme must be implemented to set up light paths for each request in a fast and efficient manner. The control scheme, which includes routing and wavelength assignment algorithms, must also be scalable, and should attempt to minimize the number of blocked connections. In this paper, we consider a distributed control scheme which utilizes a new adaptive routing approach called alternate-link routing. In the proposed approach, routing decisions for a light path are made adaptively on a hop-by-hop basis by individual nodes in a distributed manner. The scheme does not require the maintenance of any global information. A simulation is developed to analyze blocking performance, and it is shown that the proposed approach outperforms fixed routing and, under certain conditions, also outperforms fixed alternate-path routing.

Route-over vs mesh-under routing in 6LoWPAN

Abstract: Transmission of IPv6 packets over Low-power Wireless Personal Area Networks (6LoWPAN) was considered nearly impractical once. The size of IPv6 packets is much larger than the packet size of the IEEE 802.15.4 data link layer. 6LoWPAN implements an adaptation layer between network and data link layers. Main purpose of the adaptation layer is to fragment and reassemble IPv6 packets. Implementation of the adaptation layer enhances the routing/forwarding decision of packets both network and adaptation layers. We can divide the routing scheme in 6LoWPAN into two categories: the mesh-under and the route-over, based on the routing decision taken on adaptation layer or network layer respectively. In this paper we perform an analytical comparison between these two schemes in terms of the packet/fragment arrival probability, the total number of transmissions and the total delay between source and destination. We also compare the selective fragment retransmission mechanism between mesh-under and route-over schemes.