Delaunay Triangulation and st-numbering in Wireless Sensor Network topology

摘要

Significant advances have been made in Wireless Sensor Networks (WSN)s over the last decade. The advances in wireless communication and electronics have enabled the deployment of low-cost, low-power, multifunctional smart sensor nodes that are small in size and communicate in short distance. Energy-efficiency is one of the major concerns in wireless sensor networks since it impacts the network lifetime and performance. Network topology plays a very important role in determining quality of service of wireless sensor network because sensor nodes are remotely deployed in ad-hoc manner. For routing and information processing it is important to know the topological relationship of the network nodes. In this paper, we proposed a topology generation algorithm using Almost Delaunay Triangulation (ADT) which is power efficient. To obtain better performance in a wireless sensor network, it is important to have unique id of the nodes which can be achieved from the node numbering. So, we proposed st-numbering for assigning IDs to the nodes. This paper also presents the total complexity of generating the topology as well as assigning ID to them.