(Make sure you follow all the 3 steps involved in submission. This is only Step 2 of 3. For details, visit http://bit.ly/16iNfUL)
Contact Information
Name of the College : ANNAMACHARYA INSTITUTE OF TECHNOLGY & SCIENCES
Name of the Team Members along with their respective current semester :
Mr. Y. Nikhil Babu,
Ms. K. Divya
E-Mail Address & Phone Number of the Team Leader : E-mail Id: nikhil.yellaturu23@gmail.com,
Phone no: +91-9966571499
Name of the Faculty Guide: Mr. G. Gopichand, M.Tech
E-Mail Address & Phone Number of the Faculty Guide :
Phone no: +91-9849442462
Project Information
Project Title: Understanding Node Localizability of Wireless Ad Hoc and Sensor Networks
Hardware & Software Used:
Hard Ware Requirements:
Processor : Pentium-III (or) Higher
Ram : 64MB (or) Higher
Cache : 512MB
Hard disk : 10GB
Soft Ware Requirements:
Operating System : Windows 2000 server Family.
Techniques : JDK 1.5
Data Bases : My SQL
User Interface (GUI) : Java Swing.
What challenge/problem are you trying to solve through your application:
In recent years, several approaches have been proposed for in-network localization, in which some special nodes (called beacons or seeds) know their global locations and the rest determine their locations by measuring the Euclidean distances to their neighbors. Based on distance ranging techniques,the ground truth of a wireless ad hoc network can be modeled by a distance graph G ¼ ðV ;EÞ, where V denotes the set of wireless communication devices (e.g., laptop, RFID, or sensor node) and there is an unweighted edge ði; jÞ 2 E if the distance between a pair of vertices i and j, denoted by dði; jÞ, can be measured or both of them are in known locations, e.g., beacon nodes. For localization, an essential question occurs as to whether or not a network is localizable given its distance graph. This is called the network localizability problem.
How does your application solves the above mentioned challenge/problem:
We launched a working sensor network consisting of a hundred of nodes continuously collecting scientific data. Due to tide and wind under natural conditions, the network topology is highly dynamic. Checking the collected network trace, to our surprise and disappointment, we find that almost always the network fails to be localizable. Hence, localizability test only gives the “fail” answer. The situation recurs for static sensor networks: theoretical analyses [8] indicate that, unless networks are highly dense and regular, in most cases, it is unlikely that all nodes in a network are localizable, but a (large) portion of nodes can be uniquely located. Thus, the network localizability testing is less meaningful in practice, considering the fact that many applications can function properly as long as a sufficient number of nodes are aware of their locations.
Description of Project:
Location awareness is highly critical for wireless ad-hoc and sensor networks. Many efforts have been made to solve the problem of whether or not a network can be localized. Nevertheless, based on the data collected from a working sensor network, it is observed that the network is not always entirely localizable. Theoretical analyses also suggest that, in most cases, it is unlikely that all nodes in a network are localizable, although a (large) portion of the nodes can be uniquely located. Existing studies merely examine whether or not a network is localizable as a whole; yet two fundamental questions remain unaddressed: First, given a network configuration, whether or not a specific node is localizable? Second, how many nodes in a network can be located and which are them? In this study, we analyze the limitation of previous works and propose a novel concept of node localizability. By deriving the necessary and sufficient conditions for node localizability, for the first time, it is possible to analyze how many nodes one can expect to locate in sparsely or moderately connected networks. To validate this design, we implement our solution on a real-world system and the experimental results show that node localizability provides useful guidelines for network deployment and other location-based services.
Insert Images Here:
YouTube Link of Video:
http://youtu.be/O8WOGJ5tkBg
Insert the Video here:
