Advertisement
Published in:
2012 | OriginalPaper | Chapter
Base on Orthogonal Coordinate Coding of Sensor Networks the Nearest Minimal Connection and Coverage Set Algorithm
Authors : Zou Sai, Nie Qiang, Liu Chang-ming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
As a new type of wireless ad hoc network, sensor network has broad applied prospects in many fields, such as military monitoring, earthquake and weather forecasting. Based on the function of Sensor Networks’ density control, an algorithm for constructing the Minimal Connected Cover Set is presented, in which, Sink constructs square coordinate coding, and then broadcasts the partition information to all the sensors in the whole network. According to those received partition information of the area of interest, each sensor node will construct the Minimal Connected Cover Set of G through information exchanges among its neighbors only. Algorithm analysis and simulation results show that, the newly given algorithm outperforms the traditional similar algorithms in the size of constructed connected cover set.