Skip to main content
Log in

Multi-objective Node Placement Considering Non-uniform Event Pattern

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Ease of use, high flexibility and variety of applications have made wireless sensor networks very popular. Node placement in a sensor network is very critical since it affects important network attributes such as coverage, lifetime, and reliability. Therefore, controlled node placement is necessary for achieving specific network features with minimum number of nodes. Since node placement is an NP-hard problem, many placement algorithms have been proposed based on heuristic and meta-heuristic methods. Most of those algorithms assume a uniform event pattern (UEP) throughout the area under investigation. However, in practice some networks deal with non-uniform event pattern (NEP). Optimization of one attribute of the network usually results in degradation of other attributes. That is why in recent studies multi-objective optimization methods have been used which usually provide a set of best answers while the final answer is selected by a decision maker applying a trade-off between all attributes. In this paper a method for controlled node placement is proposed based on multi-objective optimization (MOO) algorithms considering a non-uniform event pattern for the network (NPNEP). In that sense this method is an extension of the previous methods that use uniform event pattern. Because of the good performance of multi-objective optimization evolutionary algorithm based on decomposition (MOEA/D), it is utilized as the optimization tool in node placement. In order to use MOEA/D, a few objective functions are defined which can optimize important attributes like coverage, power consumption, delay, reliability and lifetime. In order to achieve optimal node utilization, load balance, and increased lifetime, a cost function for routing is proposed as well as a data gathering and reporting method which both help increase the lifetime of a network. The proposed method can be used for wireless sensor networks with heterogeneous nodes. This algorithm can be used in initial deployment phase as well as operation phase or when problems like fragmentation or loss of coverage occurs. The result of NPNEP algorithm is the initial position of nodes or position of the new nodes which provide the best answers in MOO algorithm. Performance of the proposed algorithm and the effect of NEP as opposed to UEP have been verified by simulations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22

Similar content being viewed by others

References

  1. Yick, J., Mukherjee, B., & Ghosal, D. (2008). Wireless sensor network survey. Computer Networks, 52, 2292–2330.

    Article  Google Scholar 

  2. Pottie, G. J., & Kaiser, W. J. (2000). Wireless integrated network sensors. Communications of the ACM, 43, 51–58.

    Article  Google Scholar 

  3. Younis, M., & Akkaya, K. (2008). Strategies and techniques for node placement in wireless sensor networks: A survey. Ad Hoc Networks, 6, 621–655.

    Article  Google Scholar 

  4. Yang, L., Liang, J., & Liu, W. (2013). Graphical deployment strategies in radar sensor networks (RSN) for target detection. EURASIP Journal on Wireless Communications and Networking, 2013, 1–9.

    Article  Google Scholar 

  5. Halder, S., Ghosal, A., & Bit, S. D. (2011). A pre-determined node deployment strategy to prolong network lifetime in wireless sensor network. Computer Communications, 34, 1294–1306.

    Article  Google Scholar 

  6. Misra, S., Seung Don, H., Guoliang, X., & Jian, T. (2010). Constrained relay node placement in wireless sensor networks: Formulation and approximations. IEEE/ACM Transactions on Networking, 18, 434–447.

    Article  Google Scholar 

  7. Zhipeng, G., Kan, C., Weijing, C., Yuwen, H., & Xiaoxue, L. (2014). K-extended constrain independent relay node placement with base stations in two-tiered wireless sensor network. In 2014 tenth international conference on intelligent information hiding and multimedia signal processing (IIH-MSP) (pp. 823–826).

  8. Chakrabarty, K., Iyengar, S. S., Hairong, Q., & Eungchun, C. (2002). Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers, 51, 1448–1453.

    Article  MathSciNet  Google Scholar 

  9. Akkaya, K., Younis, M., & Bangad, M. (2005). Sink repositioning for enhanced performance in wireless sensor networks. Computer Networks, 49, 512–534.

    Article  Google Scholar 

  10. Yuan, X.-X., & Zhang, R.-H. (2011). An energy-efficient mobile sink routing algorithm for wireless sensor networks. In 2011 7th international conference on wireless communications, networking and mobile computing (WiCOM) (pp. 1–4).

  11. Flathagen, J., Kure, Ø., & Engelstad, P. E. (2011). Constrained-based multiple sink placement for wireless sensor networks. In 2011 IEEE 8th international conference on mobile adhoc and sensor systems (MASS) (pp. 783–788).

  12. Konstantinidis, A., Yang, K., Zhang, Q., & Zeinalipour-Yazti, D. (2010). A multi-objective evolutionary algorithm for the deployment and power assignment problem in wireless sensor networks. Computer Networks, 54, 960–976.

    Article  MATH  Google Scholar 

  13. Konstantinidis, A., & Yang, K. (2011). Multi-objective energy-efficient dense deployment in wireless sensor networks using a hybrid problem-specific MOEA/D. Applied Soft Computing, 11, 4117–4134.

    Article  Google Scholar 

  14. Sengupta, S., Das, S., Nasir, M. D., & Panigrahi, B. K. (2013). Multi-objective node deployment in WSNs: In search of an optimal trade-off among coverage, lifetime, energy consumption, and connectivity. Engineering Applications of Artificial Intelligence, 26, 405–416.

    Article  Google Scholar 

  15. Banimelhem, O., Mowafi, M., & Aljoby, W. (2013). Genetic algorithm based node deployment in hybrid wireless sensor networks. Communications and Network, 05, 273–279.

    Article  Google Scholar 

  16. Ghosh, A., & Das, S. K. (2008). Coverage and connectivity issues in wireless sensor networks: A survey. Pervasive and Mobile Computing, 4, 303–334.

    Article  Google Scholar 

  17. Özdemir, S., Attea, B. A. A., & Khalil, Ö. A. (2012). Multi-objective evolutionary algorithm based on decomposition for energy efficient coverage in wireless sensor networks. Wireless Personal Communications, 71, 195–215.

    Article  Google Scholar 

  18. Li, H., & Zhang, Q. (2009). Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE Transactions on Evolutionary Computation, 13, 284–302.

    Article  Google Scholar 

  19. Stojmenovic, I., Nayak, A., & Kuruvila, J. (2005). Design guidelines for routing protocols in ad hoc and sensor networks with a realistic physical layer. IEEE Communications Magazine, 43, 101–106.

    Article  Google Scholar 

  20. Bettstetter, C., & Hartmann, C. (2005). Connectivity of wireless multihop networks in a shadow fading environment. Wireless Networks, 11, 571–579.

    Article  Google Scholar 

  21. Damaso, A., Rosa, N., & Maciel, P. (2014). Reliability of wireless sensor networks. Sensors (Basel), 14, 15760–15785.

    Article  Google Scholar 

  22. Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications, 1, 660–670.

    Article  Google Scholar 

  23. Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011). Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm and Evolutionary Computation, 1, 32–49.

    Article  Google Scholar 

  24. Qingfu, Z., Wudong, L., & Hui, L. (2009). The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances. In IEEE congress on evolutionary computation, 2009. CEC ‘09 (pp. 203–208).

  25. Storn, R., & Price, K. (1997). Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11, 341–359.

    Article  MathSciNet  MATH  Google Scholar 

  26. Kim, Y. H., Case, K. E., & Ghare, P. M. (1972). A method for computing complex system reliability. IEEE Transactions on Reliability, 21, 215–219.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ali Movaghar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mohtashami, H., Movaghar, A. & Teshnehlab, M. Multi-objective Node Placement Considering Non-uniform Event Pattern. Wireless Pers Commun 97, 6189–6220 (2017). https://doi.org/10.1007/s11277-017-4834-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4834-7

Keywords

Navigation