Well-known ‘routing hole’ problem of geographic routing is hardly avoided in wireless sensor networks because of various actual geographical environments. Existing geographic routing protocols use perimeter routing strategies to find a detour path around the boundary of holes when they encounter the localminimum during greedy forwarding. However, this solution may lead to uneven energy consumpt...

A Wireless Sensor Network consists of several tiny devices which have the capability to sense and compute the environmental phenomenon. These sensor nodes are deployed in remote areas without any physical protections. A Wireless Sensor Network can have various types of anomalies due to some random deployment of nodes, obstruction and physical destructions. These anomalies can diminish the sensi...

In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we call holes. In this paper, we show that holes are important topological features that need to be studied. In routing, holes are communication voids that cause greedy forwarding to fail. Holes can also be defined to den...

Geographic routing is well suited for large scale sensor networks, because its per node state is independent of the network size. However, due to the local minimum caused by holes/obstacles, the path stretch of geographic routing may degrade up to O(c2), where c is the path length of the optimal route. Recently, a geographic routing protocol based on the visibility graph (VIGOR) showed that a c...

Sending a message through an unknown network is a difficult problem. In this paper, we consider the case in which, during a preprocessing phase, we assign a label and a routing table to each node. The routing strategy must then decide where to send the package using only the label of the target node and the routing table of the node the message is currently at. In this paper, we present the fir...

1 ALBA-R: LoadBalancing Geographic Routing Around Connectivity Holes in Wireless Sensor Networks 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 (Rain...

Attacks in wireless sensor networks are Compromised-node and denial-of-service (DOS). In the Compromised-node attack (CN attack); an adversary physically compromises a subset of nodes to eavesdrop information, whereas in the denial-of-service attack, the adversary interferes with the normal operation of the network by actively disrupting, changing, or even paralyzing the functionality of a subs...

Sensor random locations and sensor failures can cause coverage holes, routing voids and disconnections and thus degrade sensor network performance. In this paper, we present a self-healing approach that utilises a few mobile sensors to deal with the problems. A mobile sensor can move to an area with a coverage hole or routing void and significantly improve network performance. We design distrib...

This paper presents ALBA-R, a protocol for converge casting in wireless sensor networks. ALBA-R features the crosslayer 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 ...

Wireless Sensor Networks (WSNs) find extensive utilisation in diverse domains, including but not limited to environmental monitoring, industrial control, and healthcare. have a crucial function gathering relaying information from sensor nodes central node or sink various applications. encounter obstacles that can significant impact on their performance lifespan. These challenges include are bat...