Beruflich Dokumente
Kultur Dokumente
Localization is a critical issue in wireless sensor networks. In most localization systems beacons are being placed as references to determine the positions of objects or events appearing in sensing field. The underlying assumption is that beacons are always reliable. Assuming that there are unnoticed changes of locations of some beacons in the system, the existing Beacon Movement Detection(BMD) problem concerns how to automatically monitor such situations and identify such unreliable beacons based on the mutual observations among beacons only. Existence of such unreliable beacons may affect the localization accuracy. After identifying such beacons, we can remove them from the localization engine. In the presence of cheating beacon nodes, the necessary and sufficient conditions to guarantee a bounded error during twodimensional distance-based location estimation are unaddressed. Under these necessary and sufficient conditions, what class of localization algorithms can provide this error bound is not known. Specifically, the proposed system first show that when the number of cheating beacon nodes is greater than or equal to a given threshold, there do not exist any two-dimensional distance-based localization algorithms that can guarantee a bounded error. Furthermore, when the number of cheating beacons is below this threshold, it identifies a class of distance-based localization algorithms that can always guarantee a bounded localization error. Finally, this outlines three novel distance-based localization algorithms that belong to this class of bounded error localization algorithms. We verify their accuracy and efficiency by means of extensive simulation experiments using both simple and practical distance estimation error models.
2 INTRODUCTION
2.2 PURPOSE
Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in wireless sensor networks. In the presence of cheating beacon nodes, what are the necessary and sufficient conditions to guarantee a bounded error during twodimensional distance-based location estimation are remain unaddressed. Under these necessary and sufficient conditions, what class of localization algorithms can provide this error bound is not known. The proposed system attempt to answer these and other related questions by following a careful analytical approach. Specifically, it first shows that when the number of cheating beacon nodes is greater than or equal to a given threshold, there do not exist any two-dimensional distance-based localization algorithms that can guarantee a bounded error. Furthermore, when the number of cheating beacons is below this threshold, it identifies a class of distance-based localization algorithms that can always guarantee a bounded localization error. Finally, it outline three novel distance-based localization algorithms that belong to this class of bounded error localization algorithms.
3 LITERATURE SURVEY
3.1 INTRODUCTION
Surveys of the various papers, which are studied for this phase, are listed below. These papers were comprehensively analyzed with their output performances for their impact over the wireless ad-hoc networks.
3.2 SURVEY
The Beacon Movement Detection Problem in Wireless Sensor Networks for Localization Applications:
Sheng-Po Kuo in (2009) states that localization is a critical issue in wireless sensor networks. He define a new Beacon Movement Detection (BMD) problem. The BMD problem involves two issues. First, we need to determine those beacons that are unexpectedly relocated. Second, the result has to be forwarded to the positioning engine to reduce the impact of movement on localization accuracy. To solve the first issue, we will allow beacons to monitor each other to identify those moved beacons automatically. Here , we show that without any assumption, it is impossible for a general BMD problem correctly identify those moved beacons because an ambiguity situation will always exist. He proposed four schemes such as , LB-Location Based Scheme: Used to calculate each beacons correct location and compares the result with its predefined location to decide if it has been moved. NB-Neighbor Based Scheme: Using this beacons will keep track of their nearby beacons and report their observations to the BMD engine to determine if some beacons have been moved. SSB-Signal Strength Binary Scheme: Here the change of signal strengths of beacons will be exploited. SSR-Signal Strength Real Scheme: Here the BMD engine will collect the sum of reported signal strength changes of each beacon to make decisions. 4
usually follow a probability distribution that can be known a priori. With this prior deployment knowledge, they showed that sensors can discover their locations by observing the group memberships of its neighbors. They modeled the location discovery problem as a statistical estimation problem, and they use the Maximum Likelihood Estimation method to estimate the location.
Sensor
Positioning
in
Wireless
Ad-hoc
Sensor
Networks
Using
Multidimensional Scaling
Xiang Ji, Hongyuan Zha in (2004) state that Sensor Positioning is a fundamental and crucial issue for sensor network operation and management. Here, they rst study some situations where most existing sensor positioning methods tend to fail to perform well, an example being when the topology of a sensor network is anisotropic. Then, they explore the idea of using dimensionality reduction techniques to estimate sensors coordinates in two (or three) dimensional space, and they propose a distributed sensor positioning method based on multidimensional scaling technique to deal with these challenging conditions. Multidimensional scaling and coordinate alignment techniques are applied to recover positions of adjacent sensors. The estimated positions of the anchors are compared with their true physical positions and corrected, The positions of other sensors are corrected accordingly. With iterative adjustment, our method can overcome adverse network and terrain conditions, and generate accurate sensor position. They also propose an on demand sensor positioning method based on the above method.
4 SYSTEM ARCHITECTURE
POSITIONING ENGINE
B 2 B 11 LOCALIZATION ALGORITHM
LOCATION DATABASE B B
corresponding arc sets (S or S) with the new splitted arcs (result of the splitting operation) Step 7: Step 8: end for Step 9: Let S=S U S Step10:end for Step 11: for each arc Cj in S do Step 12: Step 13: Step 14: Step 15: Step 16: Step 17: Step 18: Step 19: Step 20: Step 21: Step 22: Step 23: Step 24: Step 25: end if Stop the algorithm end if end for if j Kmax + 2 then if Cj is on an inner boundary circle then Output is defined on the side out of this circle else if Cj is on an outer boundary circle then Output is defined on the side inside this circle Set the corresponding counter j to 0 for i=1,,n do if R is related to Cj then j = j + 1 end if end if
10
Step 1: Count the number of rings intersecting with each ring Step 2: for each ring Ri, in the order of decreasing number of rings intersecting with it to do Step 3: for each ring Rj, Rj+1, Rj+2| Rj, Rj+1, Rj+2 Ri, in the order of decreasing number of Compute the intersection points of the boundary circles of Ri and Rj, Ri and Choose a point (x1,y1) from the intersection of the ring pair Ri, Rj at Compute = (x1+x2+x3/3, y1+y2+y3/3) Count the number of rings containing if there are atleast kmax+3 rings containing then Output Stop the algorithm end if end for rings intersecting with it do Step 4: Rj+1 and Ri and Rj+2 Step 5: random. Similarly, choose intersection points (x2,y2) and (x3,y3) from the other two pairs Step 6: Step 7: Step 8: Step 9: Step 10: Step 11: Step 12:
11
6 DESIGN IMPLEMENTATION
6.1 INTRODUCTION There are three modules to describe the project. They are as follows: Localization Finding Beacon Nodes Data Communication
6.1.1 LOCALIZATION Localization or location discovery in distributed wireless networks is the problem of determining the location, with respect to some local or global coordinate system, of a (mobile) device in the network in an efficient and accurate fashion. Other nodes first compute the distance (or angle) estimates to a set of neighboring beacons and then estimate their own location using basic trilateration. Every nodes present in a frame first find out the nearest beacons once find out the nearest beacons it use that beacon as a node for data communication.
6.1.2 FINDING BEACON NODES Beacon Nodes are boundary nodes which is used to communicate one boundary beacon to another thats its main purpose of beacon nodes Its acts either intermediates as well as node. Its always update the location to its nearest node. The node try to send the data mean through which beacon nodes it passes to the destination. Beacons can cheat by broadcasting their own locations inaccurately or by manipulating the distance estimation process, thus, adversely affecting the location computation by the other nodes called as cheating beacon nodes. 6.1.3 DATA COMMUNICATION Other nodes first compute the distance (or angle) estimates to a set of neighboring beacons and then estimate their own location using basic trilateration. A node tries to send a signal to destination. It first passes the signal through the beacon node and then it searches the nearest beacon of various other ranges of beacon and then it carry the data and check the proper destination or not if it not mean passes the data through other beacon until it reaches the destination node. 12
13
Sequence Diagram
14
15
Class Diagram
16
Collaboration Diagram
17
7 SOFTWARE SPECIFICATION
18
7.1.3 References
X. Ji and H. Zha, Sensor Positioning in Wireless Ad-Hoc Sensor Networks Using Multidimensional Scaling, Proc. IEEE INFOCOM, 2004. L. Fang, W. Du, and P. Ning, A Beacon-Less Location Discovery Scheme for Wireless Sensor Networks, Proc. IEEE INFOCOM, 2005. Z. Li, W. Trappe, Y. Zhang, and B. Nath, Robust Statistical Methods for Securing Wireless Localization in Sensor Networks, Proc. Fourth Intl Symp. Information Processing in Sensor Networks (IPSN 05), 2005. D. Moore, J. Leonard, D. Rus, and S. Teller, Robust Distributed Network Localization with Noisy Range Measurements, Proc.Second Intl Conf. Embedded Networked Sensor Systems (SenSys 04), 2004. S. Zhong, M. Jadliwala, S. Upadhyaya, and C. Qiao, Towards a Theory of Robust Localization against Malicious Beacon Nodes,Proc. IEEE INFOCOM, 2008.
20
Determination of the Involved Classes Determination of the Involved Objects Determination of the Involved Actions Determination of the Require Clauses
21
22
For example, software may simply log transactions. If a system must be of a high integrity level and if the software is shown to be of that
integrity level, then the hardware must be at least of the same integrity level. There is little point in producing 'perfect' code in some language if hardware and system
software (in widest sense) are not reliable. If a computer system is to run software of a high integrity level then that system should
not at the same time accommodate software of a lower integrity level. Systems with different requirements for safety levels must be separated. Otherwise, the highest level of integrity required must be applied to all systems in the
same environment.
23
Functionality: are the required functions available, including Interoperability and security
Usability: how easy it is to understand, learn, and operate the software system
Portability: can the software easily be transferred to another environment, Including install ability
24
8 CONCLUSION
In this work, I have addressed the problem of secure distance based localization in the presence of cheating beacon nodes. By means of a sound mathematical analysis, I have derived the conditions for secure and robust distance based localization in the presence of cheating beacons. Specifically, I have outlined the necessary and sufficient conditions for achieving a bounded localization error, and defined a nonempty class of algorithms that can achieve such a bounded error. I have also proposed three novel distance based localization algorithms, specifically a polynomial-time algorithm and two heuristic-based algorithms that belong to this class of bounded error distance-based localization algorithms. I have verified the localization accuracy and execution efficiency of these algorithms using measurements from simulation experiments. Experimental results show that all the algorithms performed consistently for different distributions of the distance measurement error. I have also extended the existing localization framework to include more practical models for the distance measurement error and have verified the performance of the algorithms under such scenarios.
25