Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A distributed routing algorithm for mobile wireless networks
Wireless Networks
Multicluster, mobile, multimedia radio network
Wireless Networks
Security-aware ad hoc routing for wireless networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
An on-demand secure routing protocol resilient to byzantine failures
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Secure data transmission in mobile ad hoc networks
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
A quantitative trust establishment framework for reliable data packet delivery in MANETs
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
IEEE Network: The Magazine of Global Internetworking
Dependable Services for Mobile Health Monitoring Systems
International Journal of Ambient Computing and Intelligence
Hi-index | 0.00 |
The event-condition-action (ECA) paradigm holds enormous potential in pervasive computing environments. However, the problem of reliable delivery of event data, generated by low capability sensor devices, to more capable processing points and vice versa, needs to be addressed for the success of the ECA paradigm in this environment. The problem becomes interesting because strong cryptographic techniques for achieving integrity impose unacceptable overhead in many pervasive computing environments. We address this problem by sending the data over the path from the sensor node to the processing point that provides the best opportunity of reliable delivery among competing paths. This allows using much weaker cryptographic techniques for achieving security. The problem is modeled as a problem of determining the most reliable path - similar to routing problems in networks. We propose a trust-based metric for measuring reliability of paths. The higher the trust value of a path the more reliable it is considered. We propose techniques for estimating the trust levels of paths and propose a new algorithm for identifying the desired path.