Linear programming: methods and applications (5th ed.)
Linear programming: methods and applications (5th ed.)
On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
Network security: private communication in a public world
Network security: private communication in a public world
Computer security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Provably Unforgeable Signatures
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
How to construct optimal one-time signatures
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
How public key cryptography influences wireless sensor node lifetime
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
Maximizing lifetime of sensor surveillance systems
IEEE/ACM Transactions on Networking (TON)
A survey of electronic signature solutions in mobile devices
Journal of Theoretical and Applied Electronic Commerce Research
Data Gathering with Tunable Compression in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
IEEE Transactions on Mobile Computing
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
On the application of pairing based cryptography to wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
Pushing the limits of one-time signatures
Proceedings of the 2nd international conference on Security of information and networks
Optimal Wireless Network Restoration under Jamming Attack
ICCCN '09 Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks
Improved server assisted signatures
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal data compression and forwarding in wireless sensor networks
IEEE Communications Letters
Mitigation of compromising privacy by transmission range control in wireless sensor networks
IEEE Communications Letters
Maximizing lifetime of event-unobservable wireless sensor networks
Computer Standards & Interfaces
Strengthening digital signatures via randomized hashing
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Prolonging wireless sensor network lifetime in stealth mode through intelligent data compression
Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks
| Hi-index | 0.07 |
In the context of wireless sensor networks, computation/communication tradeoffs may appear in many aspects of the system design. In this paper, we present a linear programming framework to guide designers in effectively using these tradeoffs for prolonging network lifetime. To investigate the tradeoff in more concrete terms, as our representative problem we choose a security service; non-repudiation which can be supported with different types of digital signature algorithms. Since these algorithms have high computation and/or communication overheads, supporting non-repudiation of sensor data has been traditionally considered to be infeasible in wireless sensor networks. Using our framework, we compare three signature algorithms with respect to their effect on network lifetime in different topologies and operating conditions. We have shown that with proper algorithm selection the lifetime reduction due to the utilization of digital signatures can be as low as 10%; however, non-optimal algorithm selection can result in more than 90% lifetime reduction compared to a network not supporting non-repudiation.