Localization-Oriented Network Adjustment in Wireless Ad Hoc and Sensor Networks
Localization-Oriented Network Adjustment in Wireless Ad Hoc and Sensor Networks
ABSTRACT:
Localization is an enabling technique for many sensor network applications. Real-world deployments demonstrate that, in practice; a network is not always entirely localizable, leaving a certain number of theoretically nonlocalizable nodes. Previous studies mainly focus on how to tune network settings to make a network localizable. However, the existing methods are considered to be coarse-grained, since they equally deal with localizable and nonlocalizable nodes. Ignoring localizability induces unnecessary adjustments and accompanying costs. In this study, we propose a fine-grained approach, localizability-aided localization (LAL), which basically consists of three phases: node localizability testing, structure analysis, and network adjustment. LAL triggers a single round adjustment, after which some popular localization methods can be successfully carried out. Being aware of node localizability, all network adjustments made by LAL are purposefully selected. Experiment and simulation results show that LAL effectively guides the adjustment while makes it efficient in terms of the number of added edges and affected nodes.
EXISTING SYSTEM:
There are two major categories of localization methods: range-free and range-based methods.
To locate non-localizable nodes, the existing solutions mainly focus on how to tune network settings. The first attempt is to deploy additional nodes or beacons in application fields. Such incremental deployment increases node density and creates abundant internode distance constraints, thus, enhancing localizability. However, the attempt lacks feasibility, since the additional nodes should be placed in the vicinity of nonlocalizable nodes, whose locations are just unknown. Using mobile nodes (e.g., beacons) is another choice. The controlled motion of beacons provides thorough information for localization, but also incurs adjustment delay and controlling overheads
DISADVANTAGES OF EXISTING SYSTEM:
* Localization in wireless ad hoc and sensor networks is the problem in which every node determines its own location.
* Due to hardware or deployment constraints, a network can be partially localizable given distance measurements and locations of beacons, that is to say, some nodes have unique locations while others do not.
* In practice, a wireless ad hoc or sensor network cannot be excessively dense because the mechanism of topology control is usually used to alleviate collision and interference, ignoring the localizability of the network.
PROPOSED SYSTEM:
The main contributions of this study are as follows: First, being aware of node localizability, adjustments made by LAL are purposefully selected, avoiding meaningless ranging and communication costs. Second, LAL is light weight, working properly with the existing localization methods without incompatibility. Finally, we implement LAL on a real-sensor network. The deployment data are collected from in-situ measurement in a wild application field.
ADVANTAGES OF PROPOSED SYSTEM:
ü One approach is to augment the transmitting power of nodes stage-by-stage until all nodes become localizable, which causes multiple rounds of configuration dissemination and data collection in a network.
ü LAL make adjustments according to node localizability results, other than indistinctively consider the network as a whole.
SYSTEM ARCHITECTURE:
MODULES:
1. Localizability testing
2. Structure analysis
3. Distinctive adjustment
MODULES DESCSRIPTION:
1. Localizability testing:
When a network is deployed in an application field, due to some systematic or environment factors unpredictable in the design phase, it may be not ready for localization. Hence, node localizability testing is conducted foremost in LAL, which identifies localizable and non-localizable nodes in a network for further adjustment.
2. Structure analysis:
To support fine-grained manipulation, we decompose a distance graph into two-connected components. These components are organized in a tree structure and the one containing beacons is the root. Adjustments are conducted along tree edges from the root to leaves.
3. Distinctive adjustment:
LAL treats nodes differently according to their localizability and places in the component tree. Through vertex augmentation, LAL converts all non-localizable in one round. The networks tuned by LAL are localizable and can be localized by the existing localization approaches.
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
Ø System : Pentium IV 2.4 GHz.
Ø Hard Disk : 40 GB.
Ø Floppy Drive : 1.44 Mb.
Ø Monitor : 15 VGA Colour.
Ø Mouse : Logitech.
Ø Ram : 512 Mb.
SOFTWARE REQUIREMENTS:
Ø Operating system : Windows XP/7.
Ø Coding Language : ASP.net, C#.net
Ø Tool : Visual Studio 2010
Ø Database : SQL SERVER 2008
REFERENCE:
Tao Chen, Member, IEEE, Zheng Yang, Member, IEEE, Yunhao Liu, Senior Member, IEEE, Deke Guo, Member, IEEE, and Xueshan Luo, “Localization-Oriented Network Adjustment in Wireless Ad Hoc and Sensor Networks”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 25, NO. 1, JANUARY 2014