Abstract In this paper, we study the problem of maximizing lifetime data aggregation in multi-sink wireless sensor networks with unreliable vehicle communication environment. Firstly, we analyze the communication between adjacent nodes, and present the optimal emission radius that can guarantee the minimum expected energy consumption. Secondly, we discuss the problem that how sensor nodes choose the sink node to send message. Thirdly, we propose the Tree-based topology Data Aggregation algorithm (TDA) based on the energy consumption balancing and the Directed Acyclic Graph based Data Aggregation algorithm (DAGDA) to improve the data acceptance probability. The simulation results show that our algorithms can extend network lifetime effectively.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Maximizing Lifetime Data Aggregation in Multi-sink Wireless Sensor Networks with Unreliable Vehicle Communications


    Beteiligte:
    Su, Zhihuang (Autor:in) / Chen, Yongzao (Autor:in) / Cheng, Hongju (Autor:in) / Xiong, Naixue (Autor:in)


    Erscheinungsdatum :

    01.01.2014


    Format / Umfang :

    10 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Maximizing Lifetime Data Aggregation in Multi-sink Wireless Sensor Networks with Unreliable Vehicle Communications

    Su, Z. / Chen, Y. / Cheng, H. et al. | British Library Conference Proceedings | 2014


    Distributed Cooperative Guidance of Multi-missile with Unreliable Communications

    Ye, Pengpeng / Wei, Jianing / Lu, Yu et al. | Springer Verlag | 2022


    Distributed Cooperative Guidance of Multi-missile with Unreliable Communications

    Ye, Pengpeng / Wei, Jianing / Lu, Yu et al. | British Library Conference Proceedings | 2022



    Minimum Data Aggregation Schedule in Wireless Sensor Networks

    An, M.K. / Lam, N.X. / Huynh, D.T. et al. | British Library Online Contents | 2011