It is desirable to allow packets with the same source and destination to take more than one possible path. This facility can be used to ease congestion and overcome node failures. In this paper, we design and implement a k-multipath routing algorithm that allows a given source node send samples of data to a given sink node in a large scale sensor networks. Multipath routing can increase endto-end throughput and provide load balancing. However, its advantage is not obvious in wireless sensor networks because the traffic along the multiple paths will interfere with each other. Our multipath routing algorithm tries to keep multipath as node disjoint routes. In order to achieve a minimum mean delay for the whole network, we study the two different policies with which we distribute traffic over different paths. The simulation results reveal that our multipath routing approach does not surprisingly perform better than the shortest path routing (single path routing SPR) in terms of load balancing and quality of data (QoD).
[1]
Sylvie Perreau,et al.
Increasing the network performance using multi-path routing mechanism with load balance
,
2004,
Ad Hoc Networks.
[2]
On the impact of alternate path routing for load balancing in mobile ad hoc networks
,
2000,
MobiHoc.
[3]
David B. Johnson,et al.
The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
,
2003
.
[4]
Charles E. Perkins,et al.
Ad-hoc on-demand distance vector routing
,
1999,
Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.
[5]
Peter Scheuermann,et al.
SIDnet-SWANS: a simulator and integrated development platform for sensor networks applications
,
2008,
SenSys '08.
[6]
Nelson L. S. da Fonseca,et al.
QoS-Constrained Multi-Path Routing for High-End Network Applications
,
2009,
IEEE INFOCOM Workshops 2009.