Algorithm for fairness in schedule lengths of sink-rooted trees in multi-sink heterogeneous wireless sensor networks
- PDF / 1,773,687 Bytes
- 16 Pages / 595.276 x 790.866 pts Page_size
- 90 Downloads / 146 Views
ORIGINAL RESEARCH
Algorithm for fairness in schedule lengths of sink-rooted trees in multi-sink heterogeneous wireless sensor networks Tejas Vasavada1 • Sanjay Srivastava2
Received: 15 July 2019 / Accepted: 30 May 2020 Bharati Vidyapeeth’s Institute of Computer Applications and Management 2020
Abstract Sensor networks are used for observing some region of interest. Sensors sense different physical quantities and send to base station or sink. The tree based networks with TDMA as MAC protocol are preferable because of simplicity of tree and guaranteed data access in TDMA. Often sensor networks are multi-sink and multiattribute networks. Multi-sink network means more than one sinks are present and so multiple sink-rooted trees are formed. When more than one types of nodes are deployed in the network, the network is known as heterogeneous network or multi-attribute network. Sometimes node density or heterogeneity is not uniform across entire network. As a result of non-uniform node distribution or non-uniform heterogeneity distribution, schedule lengths of sinkrooted trees are very different. Nodes part of trees with small schedule length will get more frequent transmission turns compared to those which belong to trees with large schedule length. To ensure fairness in terms of transmission opportunities, it is desired that schedule lengths should be balanced. In this work, an algorithm named as Schedule Length Balancing for Multi-sink HeTerogeneous networks (SLBMHT) is presented to balance schedule lengths. The SLBMHT algorithm is evaluated through simulations. It is found that the SLBMHT algorithm results in 8–56% reduction in schedule length difference of trees. It also results in 2–17% energy savings during data transmission & Tejas Vasavada [email protected] Sanjay Srivastava [email protected] 1
Lukhdhirji Engineering College, Morbi, India
2
Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar, India
phase. Only demerit is increase in control overhead. But as resulting increase in energy consumption is not much, it is overcome by savings in data energy consumption. Thus network lifetime is likely to increase. Keywords Sensor networks TDMA scheduling Multiple sinks Heterogeneous networks Schedule balancing
1 Introduction TDMA scheduling of tree-based sensor networks is a wellinvestigated research domain. In typical applications, large number of sensors are deployed in the area to be observed. The sensors organize themselves in a tree so that convergecast operation [1] can take place. The tree is sinkrooted. That is, sink is the root of the tree. Many times multiple quantities need to be sensed from the same area. For e.g., sensors are deployed in a region to sense temperature,pressure,humidity,solar radiation and many other quantities. One sensor node may not be capable to sense all the quantities. Thus different types of sensors are required. The network in which different types of sensors are deployed is known as heterogeneous network. As mentio
Data Loading...
