M ² RC -- multiplicative-increase/additive-decrease multipath routing control for wireless sensor networks

Abstract

Routing protocols in wireless sensor networks (WSN) face two main challenges: first, the challenging environments in which WSN's are deployed negatively affect the quality of the routing process. Therefore, routing protocols for WSN's should recognize and react to node failures and packet losses. Second, sensor nodes are battery-powered, which makes power a scarce resource. Routing protocols should optimize power consumption to prolong the lifetime of the WSN. In this paper, we present a new adaptive routing protocol for WSN's, we call it M 2 RC. M 2 RC has two phases: mesh establishment phase and data forwarding phase. In the first phase, M 2 RC establishes the routing state to enable multipath data forwarding. In the second phase, M 2 RC forwards data packets from the source to the sink. Targeting hop-by-hop reliability, an M 2 RC forwarding node waits for an acknowledgement (ACK) that its packets were correctly received at the next neighbor. Based on this feedback, an M 2 RC node applies multiplicative-increase/additive-decrease (MIAD) to control the number of neighbors targeted by its packet broadcast. We simulated M 2 RC in the ns-2 simulator [4] and compared it to GRAB [1], Max-power, and Min-power routing schemes. Our simulations show that M 2 RC achieves the highest throughput with at least 10-30% less consumed power per delivered report in scenarios where a certain number of nodes unexpectedly fail.

Routing Security Issues in Wireless Sensor Networks: Attacks and Defenses

“…As the packet is routed along a path towards the sink, the above steps of NMS algorithm except the neighbor list checking are executed at each hop so that reliable packet delivery can happen through a single path. This is in contrast to the previous schemes proposed in Morcos et al, 2005;Yang et al, 2005). In these schemes, a node broadcasts a packet without specifying a designated next-hop, and all neighboring nodes with smaller costs (the cost at a node is the minimum energy required to forward a packet from the node to the base station) or within a specific geographic region continue forwarding the packet to the base station.…”