In wireless sensor networks (WSN) data produced by one or more sources usually has to be routed through several intermediate nodes to reach the destination. Problems arise when intermediate nodes fail to forward incoming messages. We increase the reliability of the system by providing a new routing mechanism that specifically takes into consideration possible failures on the communication paths. The new algorithm computes several paths from the data source to the destination and sends, over each path, a fragment of the initial data. Only k fragments of the total n fragments (k less than n) are necessary to build the initial data packet. The path construction is based on the reputation coefficients of the nodes, computed on how the nodes acted in the past sensor networks. It addresses the convergence of distributed information processing, wireless communication and mobile computing.
[1]
Kay Römer.
Robust and Energy Efficient Temporal Order Event Delivery in Wireless Sensor Networks
,
2002
.
[2]
Mary Baker,et al.
Mitigating routing misbehavior in mobile ad hoc networks
,
2000,
MobiCom '00.
[3]
Refik Molva,et al.
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
,
2002,
Communications and Multimedia Security.
[4]
David A. Maltz,et al.
Dynamic Source Routing in Ad Hoc Wireless Networks
,
1994,
Mobidata.
[5]
Pietro Michiardi,et al.
Prevention of denial of service attacks and selfishness in mobile ad hoc networks
,
2002
.
[6]
Gregory J. Pottie,et al.
Wireless integrated network sensors
,
2000,
Commun. ACM.