Analysis on life model of large sensor networks
Tóm tắt
A large sensor network needs multiple base stations (BSs) to collect data efficiently. The design effort often aims at maximizing the network lifetime. The lifetime of a network depends on, besides battery capacity, factors such as node density, sampling period and the partitioning of the network for the multiple base stations. In this paper, we propose a stochastic approach to finding the lifetime of large sensor networks with multiple BSs and randomly scattered nodes. We begin by partitioning the network into regions by the Voronoi diagram method, one for each base station. We then propose a method to find the minimum transmission range needed for guaranteeing network connectivity. With nodes connected, we derive the traffic rate of nodes at specific distance from the base station. Based on the traffic rate and energy consumption model, the lifetime distribution of a region is calculated. Combining the results of individual regions, the network lifetime distribution is obtained. Case studies are presented and verified by computer simulation.
Tài liệu tham khảo
Zhu X R, Shen L F, Yum T P. Hausdorff clustering and minimum energy routing for wireless sensor networks. IEEE Trans Veh Technol, 2009, 58: 990–997
Kim H, Seok Y, Choi Y, et al. Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks. LNCS, 2005, 3391: 264–274
Kalpakis K, Dasgupta K, Namjoshi P. Maximum lifetime data gathering and aggregation in wireless sensor networks. In: Proceedings of the Joint International Conference on Wireless LANs and Home Networks and Networking. Atlanta, 2002. 685–696
Bhardwaj M, Chandrakasan A P. Bounding the lifetime of sensor network via optimal role assignments. In: Proceedings of Conference on Computer Communications. New York, 2002. 1587–1596
Bhardwaj M, Chandrakasan A P. Upper bounds on the lifetime of wireless sensor networks. In: Proceedings of IEEE International Conference on Communications. Helsinki, 2001. 1–37
Zhang H, Hou J. On deriving the upper bound of -lifetime for large sensor networks. In: MobiHoc’ 04: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing. New York: ACM Press, 2004. 121–132
Azad A P, Chockalingam A. WLC12-2: bounds on the lifetime of wireless sensor networks employing multiple data sinks. In: Proceedings of IEEE Global Telecommunications Conference. San Francisco, 2006. 1–5
Rai V, Mahapatra R N. Lifetime modeling of a sensor network. In: Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’ 05). Washington: IEEE Computer Society, 2005. 202–203
Moslem N, Masoud A. A probability model for lifetime of event-driven wireless sensor networks. In: Proceedings of the 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. San Francisco, 2008. 269–277
Gavrilova M. Generalized voronoi diagram: a geometry-based approach to computational intelligence. Springer, 2008. 54–62
Aktumen M, Kacar A. Maplets for the area of the unit Circle. J Online Math Appl, 2007, 7: 1–4
Liu H Y. Analysis on polygon approximation. J GuiLin Coll Aerosp Tec, 2007, 2: 30–32
Heinzelman W, Chandrakasan A, Balakrishnan H. An application-specific protocol architecture for wireless sensor networks. IEEE Trans Wirel Commun, 2002, 58: 660–670