Font Size: a A A

Sensor Network Configuration Algorithm

Posted on:2006-10-24Degree:MasterType:Thesis
Country:ChinaCandidate:Y WuFull Text:PDF
GTID:2208360155961445Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
The deployment for sensor networks can place effectively nodes of sensor networks and cover reasonably the field for sensing data.It can also prolong running lifetime for sensor networks. It can not only collect accurately data information for sensing field,but also manage adequately the resource for sensor networks.It has a wild application future.This paper introduce characteristics about deployment for sensor networks and present issues about deployment and relative algorithm for sensor networks.It expatiate on development process up to now and development tendency for the future about sensor networks.The academe research the deployment algorithm for sensor network by autonomous deployment mode and immovable deployment mode at present.The immovable deployment mode complete once the deployment of sensor node base on the state about sensor fields,without knowing the distributing for sensor node.There are not relative study fruit inland. There are some study fruit overseas[1][2][3][4]. Some relative algorithms are presented.The representative algorithm is MAX_AVG_COV[1].It deploy sensor networks with greedy strategy.It's deployable effect is better than RANDOM algorithm. Literature[4] improve on MAXAVGCOV algorithm and present MAXMINCOV algorithm and obtain obvious deployable effect. The algorithms optimize absolute sense degree by sense requirement about object field.The algorithms don't optimize opposite sense degree about sense requirement and current sense degree.The system info for deployment algorithms have not been discussed perfectly. Even though Literature[2] present uncertainty-aware sensor deployment algorithms (NDSP algorithms),it optimize absolute sense degree too. Therefore,this paper discuss the system info for immovable deployment mode algorithmsperfectly and present resolvent scheme about individuation requirement for sense field.This paper set up the detection model of sensor networks under grid showing sense field.It collects target data of sense field using imprecise probability detection method. It is researched for the coverage distribution rule of information sensing.lt is given for measurement space and target function and deployment optimization algorithm's upper condition about sensing area.A series of deployment algorithm about whole sense field and local sense field are presented.lt is explored to get the better effect about information collect using less sensor numbers in the whole sensing field.The algorithms are analyzed and proved.The effect about deployment algorithms to place sensor is discussed with obstacle and non-obstacle and analyzed theoretically.The experimental results for deployment algorithm are given in many case.The experimental results prove further the correctness for deployment algorithm about theoretic analysis.The redundancy deployment strategy is given base on sensor deployment algorithms that had been presented.There are K node redundancy numbers for every target detect point.The redundancy deployment algorithms are K independency .The algorithms have validity and don't influence coverage effectivity.Thus it can improve reliability for sensor networks and ensure sufficient lifetime for sensor networks.
Keywords/Search Tags:sensor network, deployment algorithms, sensing field, detection probability, obstacal deployment, redundancy deployment.
PDF Full Text Request
Related items