A historical beacon-aided localization algorithm for mobile sensor networks

•Download as DOCX, PDF•

0 likes•49 views

NS2 Projects for M. Tech, NS2 Projects in Vijayanagar, NS2 Projects in Bangalore, M. Tech Projects in Vijayanagar, M. Tech Projects in Bangalore, NS2 IEEE projects in Bangalore, IEEE 2015 NS2 Projects, WSN and MANET Projects, WSN and MANET Projects in Bangalore, WSN and MANET Projects in Vijayangar

Engineering

Logic Mind Technologies
Vijayangar (Near Maruthi Medicals), Bangalore-40
Ph: 8123668124 // 8123668066
A Historical-Beacon-Aided Localization
Algorithm for Mobile Sensor Networks
Abstract
Range-free localization approaches are cost-effective for mobile sensor networks (because no
additional hardware support is required). However, existing range-free localization approaches
for mobile sensor networks suffer from either sparse anchor node problem or high
communication cost. Due to economic considerations, mobile sensor networks typically have
sparse anchor nodes which makes most range-free localization algorithms inaccurate. On the
other hand, due to the power limitation of mobile sensor nodes (i.e., they are battery-operated)
and high power consumption by communication, high communication cost will significantly
reduce the network life time. For solving these two problems, in this paper, we use historical
beacons (i.e., anchor nodes’ announcements delivered in previous time slots) and received signal
strength (RSS) to derive three constraints. By the aid of the three constraints, we introduce a low-
communication-cost range-free localization algorithm (only one-hop beacon broadcasting is
required). According to the theoretical analysis and simulation results, our three constraints can
indeed improve the accuracy. Simulation results also show that our algorithm outperforms even
in irregular-radio-signal environments. In addition, a hardware implementation running on sensor
nodes, Octopus Xs, confirms theoretical analysis and simulation results.

SYSTEM SPECIFICATION
Software Specification
Operating system : Linux (Ubuntu)
Software : Network Simulator 2.35
Programming languages : Tool Command Language, AWK, C++
Hardware Specification
Main processor : Dual Core
Hard disk capacity : 80GB
Cache memory : 2 GB
PROJECT FLOW:
First Review:
Literature Survey
Paper Explanation
Design of Project
Project Enhancement explanation
Second Review:
Implementing 40% of Base Paper
Third Review
Implementing Remaining 60% of Base Paper with Future Enhancement (Modification)
For More Details please contact
Logic Mind Technologies
Vijayangar (NearMaruthi Medicals), Bangalore-40
Ph: 8123668124 // 8123668066
Mail: logicmindtech@gmail.com

What's hot

Java capacity of hybrid wireless mesh networks with random a ps

Ecway Technologies

Wireless Sensor Networks (WSNs) have been emerged in many important aspects in the real world, such as industry, agriculture, and military applications. As the main challenge that WSNs facing is the energy consumption, it is necessary to investigate the suitability of using mobile sinks for data collection in these networks. In this paper, therefore, a new data gathering technique with mobile elements referred to as Intersection Point of Communication Ranges (IPCR) is proposed. The IPCR algorithm endeavours to compute the optimal trajectory of the mobile sink for which the data collection latency is reduced. Simulation results presented in this study showed that the IPCR algorithm has achieved the optimal Travel Sales-Man Problem algorithm. In addition, the IPCR algorithm outperformed the Connectivity Based Data Collection (CBDC) algorithm in terms of data gathering latency and network throughput.

Range-Based Data Gathering Algorithm With a Mobile Sink in Wireless Sensor Ne...

ijwmn

An optimal distance-based transmission strategy for lifetime maximization of ...

LogicMindtech Nologies

Energy efficient cooperative transmission for simultaneous wireless informati...

LogicMindtech Nologies

In recent years there has been an increased focus on the use of sensor networks to sense and measure the environment. This leads to a wide variety of theoretical and practical issues on appropriate protocols for data sensing and transfer. Recent work shows sink mobility can improve the energy efficiency in wireless sensor networks (WSNs). However, data delivery latency often increases due to the speed limit of mobile sink. Most of them exploit mobility to address the problem of data collection in WSNs. The WSNs with MS (mobile Sink) and provide a comprehensive taxonomy of their architectures, based on the role of the MS. An overview of the data collection process in such a scenario, and identify the corresponding issues and challenges. A protocol named weighted rendezvous planning (WRP) which is a heuristic method that finds a near-optimal traveling tour that minimizes the energy consumption of sensor nodes. Focus on the path selection problem in delay-guaranteed sensor networks with a path-constrained mobile sink. Concentrate an efficient data collection scheme, which simultaneously improves the total amount of data and reduces the energy consumption. The optimal path is chosen to meet the requirement on delay as well as minimize the energy consumption of entire network. Predictable sink mobility is exploited to improve energy efficiency of sensor networks.

ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...

Editor IJMTER

Prediction of wireless communication systems in the context of modeling 2-3-4

IAEME Publication

This paper proposes a centralized algorithm for cluster-head-selection in a mobile wireless sensor network. Before execution of algorithm in each round, Base station runs centralized localization algorithm whereby sensors update their locations to base station and accordingly Base station performs dynamic clustering. Afterwards Base station runs CA-MWSN for cluster-head-selection. The proposed algorithm uses three fuzzy inputs Residual energy, Expected Residual Energy and Mobility to find Chance of nodes to be elected as Cluster-head. The node with highest Chance is declared as a Cluster-head for that particular cluster. Dynamic clustering provides uniform and significant distribution of energy in a non-uniform distribution of sensors. CA-MWSN guarantees completion of the round.

Ca mwsn clustering algorithm for mobile wireless senor network [

graphhoc

IEEE 2014 NS2 NETWORKING PROJECTS Distributed detection in mobile access wir...

IEEEBEBTECHSTUDENTPROJECTS

Aco is a well –known metahuristic in which a colony of artificial ants cooperates in explain Good solution to a combinational optimization problem. Wireless sensor consisting of nodes with limited power is deployed to gather useful information From the field. In wireless sensor network it is critical to collect the information in an energy efficient Manner.ant colony optimization, a swarm intelligence based optimization technique, is widely used In network routing. A novel routing approach using an ant colony optimization algorithm is proposed for wireless sensor Network consisting of stable nodes illustrative example details description and cooperative performance test result the proposed approach are included. The approach is also implementing to a small sized hardware component as a router chip simulation result show that proposed algorithm Provides promising solution allowing node designers to efficiency operate routing tasks.

An Ant colony optimization algorithm to solve the broken link problem in wire...

IJERA Editor

IMPULSE_TECHNOLOGY

Dotnet distributed processing of probabilistic top-k queries in wireless sen...

Ecway Technologies

What's hot (11)