Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics
An efficient multilevel coverage scheme in mobile sensor networks
ISWPC'09 Proceedings of the 4th international conference on Wireless pervasive computing
Energy efficient layered sensor networks with multihop polling
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Modeling and transceiver design for asymmetric UWB links with heterogeneous nodes
IEEE Transactions on Communications
A New Polling Protocol with Efficient Cluster Creation for WSN
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Review: From wireless sensor networks towards cyber physical systems
Pervasive and Mobile Computing
Arranging cluster sizes and transmission ranges for wireless sensor networks
Information Sciences: an International Journal
COCA: Constructing optimal clustering architecture to maximize sensor network lifetime
Computer Communications
Geographic convergecast using mobile sink in wireless sensor networks
Computer Communications
Energy-efficient clustering in lossy wireless sensor networks
Journal of Parallel and Distributed Computing
| Hi-index | 14.98 |
In this paper we study two-layered heterogeneous sensor networks where two types of nodes are deployed: basic sensor nodes and cluster head nodes. The basic sensor nodes are simple and have limited power supplies, while the cluster head nodes are much more powerful and have much more power supplies, which organize sensors around them into clusters. Such two-layered heterogeneous sensor networks have better scalability and lower overall cost than homogeneous sensor networks. We propose to use polling to collect data from sensors to the cluster head since polling can prolong network life by avoiding collisions and reducing idle listening time of sensors. We will focus on finding energy efficient and collision-free polling schedules in a multi-hop cluster. To reduce energy consumption in idle listening, a schedule is optimal if it uses minimum time. We show that the problem of finding an optimal schedule is NP-hard, and then give a fast on-line algorithm to solve it approximately. We also consider dividing a cluster into sectors and using multiple non-overlapping frequency channels to further reduce the idle listening time of sensors. We conducted simulations on the NS-2 simulator, and the results show that our polling scheme can reduce the active time of sensors by a significant amount while sustaining 100% throughput.