We consider the problem of routing a data packet through the visibility graph of a polygonal domain P with n vertices and h holes. We may preprocess P to obtain a label and a routing table for each vertex. Then, we must be able to route a data packet between any two vertices p and q of P , where each step must use only the label of the target node q and the routing table of the current node. Fo...

We consider combinatorial problems motivated by sensor networks for beacon-based point-to-point routing and covering. A beacon b is a point that can be activated to effect a ‘magnetic pull’ toward itself everywhere in a polygonal domain P . The routing problem asks how many beacons are required to route between any pair of points in a polygonal domain P . In simple polygons with n vertices we s...

This paper presents ALBA-R, a protocol for convergecasting in wireless sensor networks. ALBA-R features the cross-layer integration of geographic routing with contention-based MAC for relay selection and load balancing (ALBA) as well as a mechanism to detect and route around connectivity holes (Rainbow). ALBA and Rainbow (ALBA-R) together solve the problem of routing around a dead end without o...

Various possible security threats that may be experienced by a wireless sensor network (WSN).Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this we study routing mechanisms that circumvent (bypass) black holes formed by these attacks. We argue that existing multi-path routing approaches are vulnerable to such attacks, mainly due to their determ...

Traditional topology-based MANET routing protocols use stateful routing which increases the processing, communication and memory overheads. The high mobility of nodes in MANETs makes it difficult to maintain a deterministic route. To overcome this, stateless geographic routing protocols which ensure reliable data delivery have been proposed. It is found that link instability can be a major fact...

Survivable routing protocols are able to provide service in the presence of attacks and failures. The strongest attacks that protocols can experience are attacks where adversaries have full control of a number of authenticated nodes that behave arbitrarily to disrupt the network, also referred to as Byzantine attacks. This work examines the survivability of ad hoc wireless routing protocols in ...

Geographic routing is an attractive routing strategy in wireless sensor networks. It works well in dense networks, but it may suffer from the void problem. For this purpose, a recovery step is required to guarantee packet delivery. Face routing has widely been used as a recovery strategy since proved to guarantee delivery. However, it relies on a planar graph not always achievable in realistic ...

Underwater robots, also known as autonomous underwater vehicles (AUVs), are amazing machines that becoming increasingly important in a variety of disciplines, including sea environment exploration, data collection (for climate change), industry, and the military. Wireless nodes relay randomly distributed incorrectly selected, leading to void holes. Autonomous Vehicles (AUVs) for UWSN were explo...