Communication/Computation Trade-offs in Wireless Sensor Networks: Comparing Network-Level and Node-Level Strategies

Yıldız H. U., Bıçakcı K., Tavli B.

IEEE Topical Conference on Wireless Sensors and Sensor Networks (WiSNet), California, United States Of America, 19 - 23 January 2014, pp.49-51 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1109/wisnet.2014.6825515
  • City: California
  • Country: United States Of America
  • Page Numbers: pp.49-51
  • Keywords: wireless sensor networks, mixed integer programming, network lifetime, communication/computation, trade-off analysis, LIFETIME
  • TED University Affiliated: No


In wireless sensor networks, nodes having limited battery resources convey data to an energy-unconstrained base station. The amount of data transmitted by a node usually depends on how much local processing is performed. In other words, more computation on a node means less communication with the base station and vice versa. Hence improving energy efficiency and prolonging the network lifetime requires a careful trade-off analysis. This analysis may be performed at a network-level or at a node-level. The latter is more fine-grained allowing different nodes to implement different solutions. In our work, we propose a novel mixed integer programming framework to model and optimize node-level strategies. Using this framework, we show that hybrid use of digital signature algorithms in a network could extend the lifetime up to 21.25% as compared to a network-level optimal strategy where all nodes use a single algorithm.