ID: cs/0703094

Geographic Routing Around Obstacles in Wireless Sensor Networks

March 20, 2007

View on ArXiv

Similar papers 3

The Aligned-Coordinated Geographical Routing for Multihop Wireless Networks

August 16, 2006

86% Match
Ke Liu, Nael Abu-Ghazaleh
Networking and Internet Arch...
Distributed, Parallel, and C...

The stateless, low overhead and distributed nature of the Geographic routing protocols attract a lot of research attentions recently. Since the geographic routing would face void problems, leading to complementary routing such as perimeter routing which degrades the performance of geographic routing, most research works are focus on optimizing this complementary part of geographic routing to improve it. The greedy forwarding part of geographic routing provides an optimal rout...

Find SimilarView on arXiv

A Distributed Routing Algorithm for Internet-wide Geocast

May 4, 2018

85% Match
Bernd Meijerink, Mitra Baratchi, Geert Heijenk
Networking and Internet Arch...

Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two...

Find SimilarView on arXiv

Virtual Coordinate Backtracking for Void Traversal in Geographic Routing

November 15, 2005

85% Match
Ke Liu, Nael Abu-Ghazaleh
Networking and Internet Arch...

Geographical routing protocols have several desirable features for use in ad hoc and sensor networks but are susceptible to voids and localization errors. Virtual coordinate systems are an alternative solution to geographically based routing protocols that works by overlaying a coordinate system on the sensors relative to well chosen reference points. VC is resilient to localization errors; however, we show that it is vulnerable to different forms of the void problem and have...

Find SimilarView on arXiv

GrADyS: Exploring movement awareness for efficient routing in Ground-and-Air Dynamic Sensor Networks

December 19, 2020

85% Match
Bruno Olivieri, Marcelo Paulon, Markus Endler
Networking and Internet Arch...
Distributed, Parallel, and C...

Several situations exist where a geographic region of some size needs to be scanned or monitored through many sensors. Still, it is either absolutely impossible or prohibitively expensive to deploy and maintain wireless communication infrastructure for the distributed sensors. Either because the region is hidden behind walls, not easily accessible, hard to get through, or infected with some lethal bacteria or virus transmitter. In this case, the best is to scatter (disposable...

Find SimilarView on arXiv

Deterministic boundary recognition and topology extraction for large sensor networks

October 17, 2005

85% Match
Alexander Kroeller, Sandor P. Fekete, ... , Fischer Stefan
Distributed, Parallel, and C...
Computational Geometry

We present a new framework for the crucial challenge of self-organization of a large sensor network. The basic scenario can be described as follows: Given a large swarm of immobile sensor nodes that have been scattered in a polygonal region, such as a street network. Nodes have no knowledge of size or shape of the environment or the position of other nodes. Moreover, they have no way of measuring coordinates, geometric distances to other nodes, or their direction. Their only ...

Find SimilarView on arXiv

Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs

November 1, 2009

85% Match
Cédric Gaël LITIS Aboue-Nze, Frédéric LITIS Guinand, Yoann LITIS Pigné
Networking and Internet Arch...

What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is to define both an environment with obstacles and a mobility model for the stations in such an environment. The present paper focuses on a new way of considering the mobility within environments with obstacles, while keeping the core ideas of the well-known Random WayPoint mobility model (a.k.a RWP). B...

Find SimilarView on arXiv

Energy-Efficiency Routing algorithms in Wireless Sensor Networks: a Survey

February 18, 2020

85% Match
Ghassan Samara, Ghadeer Al Besani, ... , Khaldy Mohammad Al
Networking and Internet Arch...

A Wireless Sensor Network (WSN) is a collection of tiny nodes that have low energy levels and have become an essential component of the modern communication infrastructure and very important in industry and academia. Energy is crucial in WSN, and thus the design of WSN in the research community is based on energy efficiency, and node energy consumption is a great challenge to enhance WSN's lifetime. It may be costly or even impossible to charge or replace consumed batteries b...

Find SimilarView on arXiv

A Cross-Layer Design Based on Geographic Information for Cooperative Wireless Networks

June 5, 2012

85% Match
Teck Aguilar, Mohamed Chedly Ghedira, Syue-Ju Syue, Vincent Gauthier, ... , Wang Chin-Liang
Networking and Internet Arch...
Performance

Most of geographic routing approaches in wireless ad hoc and sensor networks do not take into consideration the medium access control (MAC) and physical layers when designing a routing protocol. In this paper, we focus on a cross-layer framework design that exploits the synergies between network, MAC, and physical layers. In the proposed CoopGeo, we use a beaconless forwarding scheme where the next hop is selected through a contention process based on the geographic position ...

Find SimilarView on arXiv

Stateless and Delivery Guaranteed Geometric Routing on Virtual Coordinate System

March 28, 2008

85% Match
Ke Liu, Nael Abu-Ghazaleh
Networking and Internet Arch...
Distributed, Parallel, and C...

Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. However, the performance of geographic routing is impacted by physical voids, and localization errors. Accordingly, virtual coordinate systems (VCS) were proposed as an alternative approach that is resilient to localization errors and that naturally routes around physical voids. However, VCS also faces virtual a...

Find SimilarView on arXiv

Simulation of Obstruction Avoidance Generously Mobility (OAGM) Model using Graph-theory Technique

April 12, 2013

85% Match
V. Vasanthi, M. Hemalatha
Networking and Internet Arch...

An Obstruction Avoidance Generously Mobility (OAGM) model has been introduced for controlling ad-hoc sensor networks and thereby operating emerging fields like military and healthcare services. According to this model, the ability to send a message to a group of users simultaneously, based solely on their geographic location, is desirable by using Mission Critical Mobility model that assumes the obstacle shapes like rectangle or square in the simulation terrain. The OAGM mode...

Find SimilarView on arXiv