Journal of Communications and Networks

  • 제17권2호
  • /
  • Pages.184-197
  • /
  • 2015
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지
DOI QR코드

DOI QR Code

Energy Efficient Wireless Sensor Networks Using Linear-Programming Optimization of the Communication Schedule

  • Tabus, Vlad (Department of Signal Processing, Tampere University of Technology) ;
  • Moltchanov, Dmitri (Department of Electronics and Communications Engineering, Tampere University of Technology) ;
  • Koucheryavy, Yevgeni (Department of Electronics and Communications Engineering, Tampere University of Technology) ;
  • Tabus, Ioan (Department of Signal Processing, Tampere University of Technology) ;
  • Astola, Jaakko (Department of Signal Processing, Tampere University of Technology)
  • 투고 : 2013.08.21
  • 심사 : 2014.06.16
  • 발행 : 2015.04.30
⟨ 이전 논문 다음 논문 ⟩

초록

This paper builds on a recent method, chain routing with even energy consumption (CREEC), for designing a wireless sensor network with chain topology and for scheduling the communication to ensure even average energy consumption in the network. In here a new suboptimal design is proposed and compared with the CREEC design. The chain topology in CREEC is reconfigured after each group of n converge-casts with the goal of making the energy consumption along the new paths between the nodes in the chain as even as possible. The new method described in this paper designs a single near-optimal Hamiltonian circuit, used to obtain multiple chains having only the terminal nodes different at different converge-casts. The advantage of the new scheme is that for the whole life of the network most of the communication takes place between same pairs of nodes, therefore keeping topology reconfigurations at a minimum. The optimal scheduling of the communication between the network and base station in order to maximize network lifetime, given the chosen minimum length circuit, becomes a simple linear programming problem which needs to be solved only once, at the initialization stage. The maximum lifetime obtained when using any combination of chains is shown to be upper bounded by the solution of a suitable linear programming problem. The upper bounds show that the proposed method provides near-optimal solutions for several wireless sensor network parameter sets.

키워드

참고문헌

  1. J. Shin and C. Sun, "CREEC: Chain routing with even energy consumption," IEEE J. Commun. Netw., vol. 13, no. 1, pp. 17-25, Feb. 2011. https://doi.org/10.1109/JCN.2011.6157247
  2. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in Proc. HICSS, 2000, pp. 3005-3014.
  3. W. B. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "An application-specific protocol architecture for wireless microsensor networks," IEEE Trans. Wireless Commun., vol. 1, no. 4, pp. 660-670, Oct. 2002. https://doi.org/10.1109/TWC.2002.804190
  4. N. Tabassum, Q. E.K.M.Mamun, and Y. Urano, "Cosen: A chain oriented sensor network for efficient data collection," in Proc. ITNG, Apr. 2006, pp. 262-267.
  5. C.-K. Liang, Y.-J. Huang, and J.-D. Lin, "An energy efficient routing scheme in wireless sensor networks," in Proc. AINA, Mar. 2008, pp. 916-921.
  6. S. Lindsey, C. Raghavendra, and K. Sivalingam, "Data gathering algorithms in sensor networks using energy metric," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 9, pp. 924-935, Sept. 2002. https://doi.org/10.1109/TPDS.2002.1036066
  7. H. O. Tan and I. Korpeoglu, "Power efficient data gathering and aggregation in wireless sensor networks," ACM SIGMOD Record, no. 4, pp. 66-71, Dec. 2003.
  8. N. Pantazis, S. Nikolidakis, and D. Vergados, "Energy-efficient routing protocols in wireless sensor networks: A survey," IEEE Commun. Surveys Tuts., vol. 15, pp. 551-591, 2013. https://doi.org/10.1109/SURV.2012.062612.00084
  9. A. Aziz et al., "A survey on distributed topology control techniques for extending the lifetime of battery powered wireless sensor networks," IEEE Commun. Surveys Tuts., vol. 15, pp. 12-144, 2013.
  10. S. Ganesh and R. Amutha, "Efficient and secure routing protocol for wireless sensor networks through snr based dynamic clustering mechanisms," IEEE J. Commun. Netw., vol. 15, pp. 422-429, 2013. https://doi.org/10.1109/JCN.2013.000073
  11. Asaduzzaman and H. Y. Kong, "Energy efficient cooperative leach protocol for wireless sensor networks," IEEE J. Commun. Netw., vol. 12, pp. 358-365, 2010. https://doi.org/10.1109/JCN.2010.6388472
  12. Q. Mamun, "A tessellation-based localized chain construction scheme for chain-oriented sensor networks," IEEE Sensors J., vol. 13, pp. 2648-2658, 2013. https://doi.org/10.1109/JSEN.2013.2252162
  13. R. Rout and S. Ghosh, "Enhancement of lifetime using duty cycle and network coding in wireless sensor networks," IEEE Trans. Wireless Commun., vol. 12, pp. 656-667, 2013. https://doi.org/10.1109/TWC.2012.111412.112124
  14. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups. Springer-Verlag, 1998.
  15. M. Johnson et al., "More is more: The benefits of denser sensor deployment," in Proc. IEEE INFOCOM, Apr. 2009, pp. 379-387.
  16. J.-W. Lee and J.-J. Lee, "Ant-colony-based scheduling algorithm for energy-efficient coverage of WSN," IEEE Sensors J., vol. 12, pp. 3036-3046, 2012. https://doi.org/10.1109/JSEN.2012.2208742
  17. G. A. Croes, "A method for solving traveling salesman problems," Operations Research, vol. 6, pp. 791-812, 1958. https://doi.org/10.1287/opre.6.6.791
  18. C. Rasmussen and C. Williams, Gaussian Processes for Machine Learning. MIT Press, 2006.
  19. A. Krause, A. Singh, and C. Guestrin, "Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies," J. Mach. Learn. Res., vol. 9, pp. 235-284, 2008.
  20. W. Kongkaew and J. Pichitlamken, "A gaussian process regression model for the traveling salesman problem," J. Comput. Sci., vol. 8, no. 10, pp. 1749-1758, 2012. https://doi.org/10.3844/jcssp.2012.1749.1758