LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...ijasuc
Localization of sensor nodes is important in many aspects in wireless sensor networks. The known
location of sensor node helps in determining the event of interest. A mobile sink is introduced to track the
event driven sensor nodes in the path of the event, thus conserving energy and time. We present a novel
range based localization algorithm which helps the mobile sink to compute the location of the sensor
nodes efficiently. The data transfer from the mobile sink and the sensor nodes is used to estimate the
sensor location. The sensor nodes do not need to spend energy on neighbouring interaction for
localization. The localization mechanism has been implemented in TOSSIM. The simulation results show
that our scheme performed better than other range-based schemes.
Localization in wireless sensor networks (WSNs) is one of the most important fundamental requisite that needs to be resolved efficiently as it plays a significant role in many applications namely environmental monitoring, routing and target tracking which is all location dependent. The main idea of localization is that some deployed nodes with known coordinates termed as anchor nodes transmit beacons with their coordinates in order to help the other nodes in the sensing field to localize themselves. Broadly there are two types of localization methods used for calculating positions namely the range-based and range-free methods. Initially, a range-free localization algorithm namely, Mobile Anchor Positioning - Mobile Anchor & Neighbor (MAP-M&N) is applied. In this algorithm, the sensor nodes use the location information of beacon packets of mobile anchor nodes as well as the location packets of neighboring nodes to improve the accuracy in localization of the sensor nodes. In this paper, the proposed optimization approach is Artificial Bee Colony (ABC) algorithm which is incorporated with MAP-M&N to further improve the accuracy in positioning the sensor nodes. The objective of this work is to compare the performance of MAP-ABC approach with regard to MAP-M&N algorithm. Root Mean Square Error (RMSE) is the performance metric to compare between the two approaches namely, MAP-M&N and MAP-ABC algorithms. A study on average localization error and comparison between the two approaches namely, MAP-M&N and MAP-ABC has been done. Simulation results reveal that Artificial Bee Colony approach used along with MAP-M&N outperforms by minimizing error in when compared to using only MAP-M&N approach for localization.
Determining location information of sensor node is an essential issue to capture the sensed data and to
update the necessary information in many wireless sensor network applications, such as healthcare services,
military applications, warning systems, environmental monitoring etc. Mobile Anchor Node is used to achieve
Localization in a wireless sensor networks. Hence the main challenge is to design and develop a Path Planning
Algorithm for a Mobile Anchor Node to broadcast three consecutive non-collinear messages for location
estimation which in turn increases localization accuracy and coverage and also reduces time required to
determine location information. In this paper, I propose a Path Planning Algorithm called Z-curve to perform
trilateration calculation to estimate sensor nodes location. Proposed trajectory can successfully localize all
deployed sensor nodes in a network region of interest with more accuracy and consumes less time for
localization. Furthermore, to handle obstacles, Z-curve obstacle-handling trajectory is proposed.
Keywords— Wireless sensor networks, mobile anchor node, path planning, non-collinear, localization
An Overview of Localization Methods for Multi-Agent SystemsIJERA Editor
Localization of multi-agent systems is a fundamental requirement for multi-agent systems to operate and cooperate properly. The problem of localization can be divided into two categories; one in which a-priori information is available and the second where the global position is to be ascertained without a-priori information. This paper gives a comprehensive survey of localization techniques that exist in the literature for both the categories with the objectives of knowing the current state-of-the-art, helping in selecting the proper approach in a given scenario and promoting research in this area. A detailed description of methods that exist in the literature are provided in considerable detail. Then these methods are compared, and their weaknesses and strengths are discussed. Finally, some future research recommendations are drawn out of this survey
A Study of Mobile User Movements Prediction Methods IJECEIAES
For a decade and more, the Number of smart phone users count increasing day by day. With the drastic improvements in Communication technologies, the prediction of future movements of mobile users needs also have important role. Various sectors can gain from this prediction. Communication management, City Development planning, and locationbased services are some of the fields that can be made more valuable with movement prediction. In this paper, we propose a study of several Location Prediction Techniques in the following areas.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
www.impulse.net.in
Email: ieeeprojects@yahoo.com/ imbpulse@gmail.com
An Overview and Classification of Approaches to Information Extraction in Wir...M H
Recent advances in wireless communication have made it possible to develop low-cost, and low power Wireless Sensor Networks (WSN). The WSN can be used for several application areas (e.g., habitat monitoring, forest fire detection, and health care). WSN Information Extraction (IE) techniques can be classified into four categories depending on the factors that drive data acquisition: event-driven, time-driven, query-based, and hybrid. This paper presents a survey of the state-of-the-art IE techniques in WSNs. The benefits and shortcomings of different IE approaches are presented as motivation for future work into automatic hybridisation and adaptation of IE mechanisms.
LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...ijasuc
Localization of sensor nodes is important in many aspects in wireless sensor networks. The known
location of sensor node helps in determining the event of interest. A mobile sink is introduced to track the
event driven sensor nodes in the path of the event, thus conserving energy and time. We present a novel
range based localization algorithm which helps the mobile sink to compute the location of the sensor
nodes efficiently. The data transfer from the mobile sink and the sensor nodes is used to estimate the
sensor location. The sensor nodes do not need to spend energy on neighbouring interaction for
localization. The localization mechanism has been implemented in TOSSIM. The simulation results show
that our scheme performed better than other range-based schemes.
Localization in wireless sensor networks (WSNs) is one of the most important fundamental requisite that needs to be resolved efficiently as it plays a significant role in many applications namely environmental monitoring, routing and target tracking which is all location dependent. The main idea of localization is that some deployed nodes with known coordinates termed as anchor nodes transmit beacons with their coordinates in order to help the other nodes in the sensing field to localize themselves. Broadly there are two types of localization methods used for calculating positions namely the range-based and range-free methods. Initially, a range-free localization algorithm namely, Mobile Anchor Positioning - Mobile Anchor & Neighbor (MAP-M&N) is applied. In this algorithm, the sensor nodes use the location information of beacon packets of mobile anchor nodes as well as the location packets of neighboring nodes to improve the accuracy in localization of the sensor nodes. In this paper, the proposed optimization approach is Artificial Bee Colony (ABC) algorithm which is incorporated with MAP-M&N to further improve the accuracy in positioning the sensor nodes. The objective of this work is to compare the performance of MAP-ABC approach with regard to MAP-M&N algorithm. Root Mean Square Error (RMSE) is the performance metric to compare between the two approaches namely, MAP-M&N and MAP-ABC algorithms. A study on average localization error and comparison between the two approaches namely, MAP-M&N and MAP-ABC has been done. Simulation results reveal that Artificial Bee Colony approach used along with MAP-M&N outperforms by minimizing error in when compared to using only MAP-M&N approach for localization.
Determining location information of sensor node is an essential issue to capture the sensed data and to
update the necessary information in many wireless sensor network applications, such as healthcare services,
military applications, warning systems, environmental monitoring etc. Mobile Anchor Node is used to achieve
Localization in a wireless sensor networks. Hence the main challenge is to design and develop a Path Planning
Algorithm for a Mobile Anchor Node to broadcast three consecutive non-collinear messages for location
estimation which in turn increases localization accuracy and coverage and also reduces time required to
determine location information. In this paper, I propose a Path Planning Algorithm called Z-curve to perform
trilateration calculation to estimate sensor nodes location. Proposed trajectory can successfully localize all
deployed sensor nodes in a network region of interest with more accuracy and consumes less time for
localization. Furthermore, to handle obstacles, Z-curve obstacle-handling trajectory is proposed.
Keywords— Wireless sensor networks, mobile anchor node, path planning, non-collinear, localization
An Overview of Localization Methods for Multi-Agent SystemsIJERA Editor
Localization of multi-agent systems is a fundamental requirement for multi-agent systems to operate and cooperate properly. The problem of localization can be divided into two categories; one in which a-priori information is available and the second where the global position is to be ascertained without a-priori information. This paper gives a comprehensive survey of localization techniques that exist in the literature for both the categories with the objectives of knowing the current state-of-the-art, helping in selecting the proper approach in a given scenario and promoting research in this area. A detailed description of methods that exist in the literature are provided in considerable detail. Then these methods are compared, and their weaknesses and strengths are discussed. Finally, some future research recommendations are drawn out of this survey
A Study of Mobile User Movements Prediction Methods IJECEIAES
For a decade and more, the Number of smart phone users count increasing day by day. With the drastic improvements in Communication technologies, the prediction of future movements of mobile users needs also have important role. Various sectors can gain from this prediction. Communication management, City Development planning, and locationbased services are some of the fields that can be made more valuable with movement prediction. In this paper, we propose a study of several Location Prediction Techniques in the following areas.
For further details contact:
N.RAJASEKARAN B.E M.S 9841091117,9840103301.
IMPULSE TECHNOLOGIES,
Old No 251, New No 304,
2nd Floor,
Arcot road ,
Vadapalani ,
Chennai-26.
www.impulse.net.in
Email: ieeeprojects@yahoo.com/ imbpulse@gmail.com
An Overview and Classification of Approaches to Information Extraction in Wir...M H
Recent advances in wireless communication have made it possible to develop low-cost, and low power Wireless Sensor Networks (WSN). The WSN can be used for several application areas (e.g., habitat monitoring, forest fire detection, and health care). WSN Information Extraction (IE) techniques can be classified into four categories depending on the factors that drive data acquisition: event-driven, time-driven, query-based, and hybrid. This paper presents a survey of the state-of-the-art IE techniques in WSNs. The benefits and shortcomings of different IE approaches are presented as motivation for future work into automatic hybridisation and adaptation of IE mechanisms.
Map as a Service: A Framework for Visualising and Maximising Information Retu...M H
This paper presents a distributed information extraction and visualisation service, called the mapping service, for maximising information return from large-scale wireless sensor networks. Such a service would greatly simplify the production of higher-level, information-rich, representations suitable for informing other network services and the delivery of field information visualisations. The mapping service utilises a blend of inductive and deductive models to map sense data accurately using externally available knowledge. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of sense modality. Furthermore, the mapping service responds dynamically to changes in the environmental conditions, which may affect the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a distributed self-adaptation function is proposed with the goal of saving more power and generating more accurate data visualisation. We conduct comprehensive experimentation to evaluate the performance of our mapping service and show that it achieves low communication overhead, produces maps of high fidelity, and further minimises the mapping predictive error dynamically through integrating the application domain model in the mapping service.
Effects of mobility models and nodes distribution on wireless sensors networksijasuc
Wireless sensor networks (WSN) is an important future technology, in several applications in military,
health, environment and industries. Currently the integration of social and sensor is very important by
considering the characteristics of social networks in designing wireless sensor networks WSN for
improvement such as (number of messages from source to destination, radius of coverage, connectivity, and
spreading). This area has not received much attention and few researches focus on the performance
evaluation. In this paper we have studied the impact of different mobility and distribution models which is a
variable one should define which model is best for the infrastructure given their differences, also study
include the exact effect of nodes distribution and analyzed by calculation the number of messages of 12
cases to get a real performance evaluation under different conditions and same routing techniques. This
work provides us a greater understanding and clear an idea of the effect of mobility plus distribution.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Geographical routing protocols for mobile ad hoc networks a survey on their ...eSAT Journals
Abstract Mobile Ad Hoc network is an autonomous system of mobile nodes connected by wireless links forming a temporary network without the aid of any centralized administration or infrastructure. Each node operates not only as an end system but also as a router to forward packets. The nodes are free to move themselves into a network. These networks have no fixed topology due to the high degree of node mobility. To accommodate the changing topology, special routing protocols are needed. The goal of the routing protocol is to have an efficient route establishment between a pair of nodes, so that messages can be delivered in a timely manner. Mobile Ad Hoc routing protocols are divided into Flat routing, Hierarchical routing, Geographical routing, Power aware routing and Multicast routing. It is difficult to determine which protocols may perform well under a number of different network scenarios. This paper provides an overview of geographical routing protocols proposed in the literature and performance comparison of geographical routing protocols. Index Terms: Mobile Ad Hoc Network, Geographical Routing protocols.
27 9134 direction finding scheme for multi edit septianIAESIJEECS
In GPS denied conditions Unpretentious course structures that work especially with an excessive number of philosophies required after a colossal test that in the imaginative work gathering. The paper proposed an idea to overcome a occurring due to GPS denied condition in view of 3D inertial course system. The system would track the location for further improvement of an officer continuously in a multi-floor building of a particular area. In the midst of an urban fight situation an operation of lobbyist or putting out flames is really essential. The considerable number of fighters would be known about the area and development among themselves and to the military troop outside the building. This framework is valuable to lead the group appropriately in urban to protect the harmed individuals and it will demonstrate the change of overview.
Optimization of Average Distance Based Self-Relocation Algorithm Using Augmen...csandit
Mobile robots with sensors installed on them are used in wireless sensor networks to generate information about the area. These mobile robotic sensors have to relocate themselves after initial location in the field to gain maximum coverage The average distance based algorithm for relocation process of mobile sensors does not require any GPS system for tracking the robotic sensors, thus avoiding cost, but increasing energy consumption. Augmented Lagrangian method is introduced in average distance based algorithm to reduce the extra energy
consumption by sensors in average distance based relocation process. This modified average distance relocation scheme also improves the coverage area and the time taken by mobile
robotic sensors to come to their final positions.
Approximate shortest distance computing
The factors that affect the accuracy of distance estimation in landmark embedding is analyzed. It is found that a globally selected, query independent landmark set may introduce a large relative error, especially for nearby query nodes.
Intelligent GIS-Based Road Accident Analysis and Real-Time Monitoring Automat...CSCJournals
It has been a big concern for many people and government to reduce the amount of road accident specially in Malaysia since it could be a big threat to this country. Malaysian government has spent millions of money in order to reduce the number of accident occurrence through several modes of campaign. Unfortunately, from years to years the number keeps increasing. The lack of a comprehensive accident recording and analysis system in Malaysia can be effective in these kinds of problems. By making use of IRAS (Intelligent Road Accident System), the police would be control and manage whole accident events as a real-time monitoring system. This system exploits WiMAX and GPRS communications to connect to the server for transfer the specific data to the data center. This system can be used for a comprehensive intelligent GIS-based solution for accident analysis and management. The system is developed based on object and aspect oriented software design such as .NET technology.
Map as a Service: A Framework for Visualising and Maximising Information Retu...M H
This paper presents a distributed information extraction and visualisation service, called the mapping service, for maximising information return from large-scale wireless sensor networks. Such a service would greatly simplify the production of higher-level, information-rich, representations suitable for informing other network services and the delivery of field information visualisations. The mapping service utilises a blend of inductive and deductive models to map sense data accurately using externally available knowledge. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of sense modality. Furthermore, the mapping service responds dynamically to changes in the environmental conditions, which may affect the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a distributed self-adaptation function is proposed with the goal of saving more power and generating more accurate data visualisation. We conduct comprehensive experimentation to evaluate the performance of our mapping service and show that it achieves low communication overhead, produces maps of high fidelity, and further minimises the mapping predictive error dynamically through integrating the application domain model in the mapping service.
Effects of mobility models and nodes distribution on wireless sensors networksijasuc
Wireless sensor networks (WSN) is an important future technology, in several applications in military,
health, environment and industries. Currently the integration of social and sensor is very important by
considering the characteristics of social networks in designing wireless sensor networks WSN for
improvement such as (number of messages from source to destination, radius of coverage, connectivity, and
spreading). This area has not received much attention and few researches focus on the performance
evaluation. In this paper we have studied the impact of different mobility and distribution models which is a
variable one should define which model is best for the infrastructure given their differences, also study
include the exact effect of nodes distribution and analyzed by calculation the number of messages of 12
cases to get a real performance evaluation under different conditions and same routing techniques. This
work provides us a greater understanding and clear an idea of the effect of mobility plus distribution.
Novel Position Estimation using Differential Timing Information for Asynchron...IJCNCJournal
Positioning techniques have been a common objective since the early development of wireless networks. However, current positioning methods in cellular networks, for instance, are still primarily focused on the use of the Global Navigation Satellite System (GNSS), which has several limitations, like high power drainage and failure in indoor scenarios. This study introduces a novel approach employing standard LTE signaling in order to provide high accuracy positioning estimation. The proposed technique is designed in analogy to the human sound localization system, eliminating the need of having information from three spatially diverse Base Stations (BSs). This is inspired by the perfect human 3D sound localization with two ears. A field study is carried out in a dense urban city to verify the accuracy of the proposed technique, with more than 20 thousand measurement samples collected. The achieved positioning accuracy is meeting the latest Federal Communications Commission (FCC) requirements in the planner dimension.
Geographical routing protocols for mobile ad hoc networks a survey on their ...eSAT Journals
Abstract Mobile Ad Hoc network is an autonomous system of mobile nodes connected by wireless links forming a temporary network without the aid of any centralized administration or infrastructure. Each node operates not only as an end system but also as a router to forward packets. The nodes are free to move themselves into a network. These networks have no fixed topology due to the high degree of node mobility. To accommodate the changing topology, special routing protocols are needed. The goal of the routing protocol is to have an efficient route establishment between a pair of nodes, so that messages can be delivered in a timely manner. Mobile Ad Hoc routing protocols are divided into Flat routing, Hierarchical routing, Geographical routing, Power aware routing and Multicast routing. It is difficult to determine which protocols may perform well under a number of different network scenarios. This paper provides an overview of geographical routing protocols proposed in the literature and performance comparison of geographical routing protocols. Index Terms: Mobile Ad Hoc Network, Geographical Routing protocols.
27 9134 direction finding scheme for multi edit septianIAESIJEECS
In GPS denied conditions Unpretentious course structures that work especially with an excessive number of philosophies required after a colossal test that in the imaginative work gathering. The paper proposed an idea to overcome a occurring due to GPS denied condition in view of 3D inertial course system. The system would track the location for further improvement of an officer continuously in a multi-floor building of a particular area. In the midst of an urban fight situation an operation of lobbyist or putting out flames is really essential. The considerable number of fighters would be known about the area and development among themselves and to the military troop outside the building. This framework is valuable to lead the group appropriately in urban to protect the harmed individuals and it will demonstrate the change of overview.
Optimization of Average Distance Based Self-Relocation Algorithm Using Augmen...csandit
Mobile robots with sensors installed on them are used in wireless sensor networks to generate information about the area. These mobile robotic sensors have to relocate themselves after initial location in the field to gain maximum coverage The average distance based algorithm for relocation process of mobile sensors does not require any GPS system for tracking the robotic sensors, thus avoiding cost, but increasing energy consumption. Augmented Lagrangian method is introduced in average distance based algorithm to reduce the extra energy
consumption by sensors in average distance based relocation process. This modified average distance relocation scheme also improves the coverage area and the time taken by mobile
robotic sensors to come to their final positions.
Approximate shortest distance computing
The factors that affect the accuracy of distance estimation in landmark embedding is analyzed. It is found that a globally selected, query independent landmark set may introduce a large relative error, especially for nearby query nodes.
Intelligent GIS-Based Road Accident Analysis and Real-Time Monitoring Automat...CSCJournals
It has been a big concern for many people and government to reduce the amount of road accident specially in Malaysia since it could be a big threat to this country. Malaysian government has spent millions of money in order to reduce the number of accident occurrence through several modes of campaign. Unfortunately, from years to years the number keeps increasing. The lack of a comprehensive accident recording and analysis system in Malaysia can be effective in these kinds of problems. By making use of IRAS (Intelligent Road Accident System), the police would be control and manage whole accident events as a real-time monitoring system. This system exploits WiMAX and GPRS communications to connect to the server for transfer the specific data to the data center. This system can be used for a comprehensive intelligent GIS-based solution for accident analysis and management. The system is developed based on object and aspect oriented software design such as .NET technology.
A Scalable Two-Phase Top-Down Specialization Approach for Data Anonymization ...JPINFOTECH JAYAPRAKASH
A Scalable Two-Phase Top-Down Specialization Approach for Data Anonymization Using MapReduce on Cloud
To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.
Landmark: Next to Kotak Mahendra Bank.
Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9.
Landmark: Next to VVP Nagar Arch.
Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org
Blog: www.jpinfotech.blogspot.com
A Novel Three-Dimensional Adaptive Localization (T-Dial) Algorithm for Wirele...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
LACBER: New Location Aided Routing Protocol For GPS Scarce Manetijwmn
Completely GPS-free positioning systems for wireless, mobile, ad-hoc networks typically stress on building a network-wide coordinate system. Such systems suffer from lack of mobility and high computational overhead. On the other hand, specialized hardware in GPS-enabled nodes tends to increase the solution cost. A number of GPS free position based routing algorithms have been studied by the authors before proposing a new positioning framework in this paper. The proposed positioning framework is characterized by using only a handful of GPS enabled nodes. Lower dependence on specialized GPS hardware reduces the total cost of implementing the framework. A new location aided routing protocol called Location Aided Cluster Based Energy-efficient Routing (LACBER) has been proposed in the paper. Simulation results show that using the proposed positioning framework, LACBER turns out to be efficient in lowering mean hop and hence in utilizing the limited energy of mobile nodes.
Effective range free localization scheme for wireless sensor networkijmnct
Location aware sensors can be used in many areas such as military and civilian applications. Wireless
Sensor Networks help to identify the accurate location of the event. In this paper a cost effective schema for
localization has been proposed. It uses two beacon nodes to identify the location of unknown nodes. It
also uses flooding and estimating method to accurately identify the location of other nodes. Available area
is divided into zones and beacons are provided for each zone. Beacon nodes are placed in appropriate
locations normally two in a zone to provide location information. Using the two nodes location of unknown
nodes can be calculated accurately.
FINGERPRINT LOCATION METHODS USING RAY-TRACINGmarcelonog29
Mobile location methods that employ signal fingerprints are becoming increas- ingly popular in a number of wireless positioning solutions. A fingerprint is a spatial database, created either by recorded measurement or simulation, of the radio envi- ronment. It is used to assign signal characteristics such as received signal strength or power delay profiles to an actual location. Measurements made by either the handset or the network, are then matched to those in the fingerprint in order to determine a location. Creation of the fingerprint by an a priori measurement stage is costly and time consuming. Virtual fingerprints, those created by a ray-tracing radio propagation prediction tool, normally require a lengthy o↵-line simulation mode that needs to be repeated each time changes are made to the network or built environment. An open research question exists of whether a virtual fingerprint could be created dynamically via a ray-trace model embedded on a mobile handset for positioning purposes.
The key aim of this thesis is to investigate the trade-o↵ between complexity of the physics required for ray-tracing models and the accuracy of the virtual fingerprints they produce. The most demanding computational phase of a ray-trace simulation is the ray-path finding stage, whereby a distribution of rays cast from a source point, interacting with walls and edges by reflection and di↵raction phenomena are traced to a set of receive points. Due to this, we specifically develop a new technique that decreases the computation of the ray-path finding stage. The new technique utilises a modified method of images rather than brute-force ray casting. It leads to the creation of virtual fingerprints requiring significantly less computation e↵ort relative to ray casting techniques, with only small decreases in accuracy.
Our new technique for virtual fingerprint creation was then applied to the devel- opment of a signal strength fingerprint for a 3G UMTS network covering the Sydney central business district. Our main goal was to determine whether on current mo- bile handsets, a sub-50m location accuracy could be achieved within a few seconds timescale using our system. The results show that this was in fact achievable. We also show how virtual fingerprinting can lead to more accurate solutions. Based on these results we claim user embedded fingerprinting is now a viable alternative to a priori measurement schemes.
A Dual Attention-Based Recurrent Neural Network for Short-Term Bike Sharing U...OKOKPROJECTS
https://okokprojects.com/
IEEE PROJECTS 2023-2024 TITLE LIST
WhatsApp : +91-8144199666
From Our Title List the Cost will be,
Mail Us: okokprojects@gmail.com
Website: : https://www.okokprojects.com
: http://www.ieeeproject.net
Support Including Packages
=======================
* Complete Source Code
* Complete Documentation
* Complete Presentation Slides
* Flow Diagram
* Database File
* Screenshots
* Execution Procedure
* Video Tutorials
* Supporting Softwares
Support Specialization
=======================
* 24/7 Support
* Ticketing System
* Voice Conference
* Video On Demand
* Remote Connectivity
* Document Customization
* Live Chat Support
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
The increasing need for traffic detection system has become a vital area in both developing and developed
countries. However, it is more important to get the accurate and valuable data to give the better result
about traffic condition. For this reason, this paper proposes an approach of tracking traffic data as cheap
as possible in terms of communication, computation and energy efficient ways by using mobile phone
network. This system gives the information of which vehicles are running on which location and how much
speed for the Traffic Detection System. The GPS sensor of mobile device will be mainly utilized to guess a
user’s transportation mode, then it integrates cloud environment to enhance the limitation of mobile device,
such as storage, energy and computing power. This system includes three main components: Client
Interface, Server process and Cloud Storage. Some tasks are carried out on the Client. Therefore, it greatly
reduces the bottleneck situation on Server side in efficient way. Most of tasks are executed on the Server
and history data are stored on the Cloud Storage. Moreover, the paper mainly uses the distance based
clustering algorithm in grouping mobile devices on the same bus to get the accurate data.
The Key Metric forEvaluation Localizationin Wireless Sensor Networks via Dist...CSEIJJournal
Wireless sensor network localization is an importantarea that attracted significant research interest..
Hence, localization schemes for wireless sensorAlthough mobility would appear to make localization more
difficult, in this paper We present a new method bywhich a sensor node can determine its location by
listening to wireless transmissions from three or more fixed beacon nodes and argue that it can exploit
mobility to improve the accuracy and precision of localization. Our approach does not require additional
hardware on the nodes and works even when the movement of seeds and nodes is uncontrollable. The
proposed method is based on aDistance/ Angle- Estimation technique that does not increase the complexity
or cost of construction of the localization sensor nodes. It determines how the available information will be
manipulated to enable all of the nodes of the WSN to estimate their positions. It is a distributed and usually
multi-hop algorithm
In this project, we describe a unique architecture for indoor navigation that integrates behavior recognition, multisensory indoor localization, and path-planning in order to pro-actively provide directions without direct input from users. To our knowledge, this is the first architecture that attempts to integrate the core navigation components of path planning and localization with intent prediction towards a more refined navigation solution. The system comprises of three core components: augmented reality, map representation and route planning, and plan recognition.
To achieve effective localization, we provide pre-built maps using QR code scanning distributed at various places of the indoor location. We are using Augmented Reality to make an intuitive and user friendly interface which uses QR codes for identification of various maps that are pre uploaded in the QR codes for the ease of users.
Back-Bone Assisted HOP Greedy Routing for VANETijsrd.com
Using advanced wireless local area network technologies, vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as road safety, multimedia content sharing, commerce on wheels, etc., currently, geographic routing protocols are widely adopted for VANETs as they do not require route construction and route maintenance phases. Again, with connectivity awareness, they perform well in terms of reliable delivery. Further, in the case of sparse and void regions, frequent use of the recovery strategy elevates hop count. Some geographic routing protocols adopt the minimum weighted algorithm based on distance or connectivity to select intermediate intersections. However, the shortest path or the path with higher connectivity may include numerous intermediate intersections. As a result, these protocols yield routing paths with higher hop count. In this paper, we propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, we introduce back-bone nodes that play a key role in providing connectivity status around an intersection. Apart from this, by tracking the movement of source as well as destination, the back-bone nodes enable a packet to be forwarded in the changed direction. Simulation results signify the benefits of the proposed routing strategy in terms of high packet delivery ratio and shorter end-to-end delay.
IRJET - A Review on Pedestrian Behavior Prediction for Intelligent Transport ...
Cooperative positioning and tracking in disruption tolerant networks
1. Cooperative Positioning and Tracking in Disruption
Tolerant Networks
ABSTRACT:
With the increasing number of location-dependent applications, positioning and
tracking a mobile device becomes more and more important to enable pervasive
and context-aware service. While extensive research has been performed in
physical localization and logical localization for satellite, GSM and WiFi
communication networks where fixed reference points are densely-deployed,
positioning and tracking techniques in a sparse disruption tolerant network (DTN)
have not been well addressed. In this paper, we propose a decentralized
cooperative method called PulseCounting for DTN localization and a probabilistic
tracking method called ProbTracking to confront this challenge. PulseCounting
evaluates the user walking steps and movement orientations using accelerometer
and electronic compass equipped in cellphones. It estimates user location by
accumulating the walking segments, and improves the estimation accuracy by
exploiting the encounters of mobile nodes. Several methods to refine the location
estimation are discussed, which include the adjustment of trajectory based on
reference points and the mutual refinement of location estimation for encountering
2. nodes based on maximum-likelihood. To track user movement, the proposed
ProbTracking method uses Markov chain to describe movement patterns and
determines the most possible user walking trajectories without full record of user
locations. We implemented the positioning and tracking system in Android phones
and deployed a testbed in the campus of Nanjing University. Extensive
experiments are conducted to evaluate the effectiveness and accuracy of the
proposed methods, which show an average deviation of 9m in our system
compared to GPS.
EXISTING SYSTEM:
Several recent research focuses on GPS-free localization in wireless networks by
incorporating fixed landmarks and surrounding characteristics. Surround Sense
identifies logical location using the surrounding information like sounds, lights and
colors. CompAcc adopts a distance estimation method using accelerometer and
compass and determines location by matching to possible path signatures
generated from an electronic map. Escort provides a logical navigation system to
help a person navigate to another person in a public place with the aid of context
features.
3. DISADVANTAGES OF EXISTING SYSTEM:
Escort provides a logical navigation system for social localization. Its goal is
not to identify the physical location, but to help a person navigate to another
person in a public place such as a hotel. By periodically learning the walking
trails of different individuals, as well as how they encounter each other in
space-time, a route is computed between any pair of persons. However, it
needs global information of users’ movements and their encounters to
construct the navigation graph, which does not apply for DTNs.
These methods need continuous communication with a centralized server to
process a large amount of surrounding data, which are not suitable for the
decentralized structure and the opportunistic communication nature of
DTNs.
PROPOSED SYSTEM:
In this paper, we propose a decentralized cooperative method called PulseCounting
for DTN localization and a probabilistic method called ProbTracking to track the
movement of mobile nodes. PulseCounting evaluates the number of user walking
steps using the accelerometer data, and decides the orientation of each step using
the electronic compass measurements. By accumulating the segments of walking
4. steps, it is able to form an estimation of current location. PulseCounting further
takes advantage of the opportunity of encounters in DTNs to refine the location
estimation: on the one hand, the encountering APs and phones equipped with GPS
could be regarded as reference points; on the other hand, the encounters of two
mobile nodes enable the possibility of mutual adjustment to reduce estimation
error. ProbTracking detects the movement trajectory based on the partial location
information reported by the other mobile nodes. It constructs a Markov chain using
the movement his tory data and uses it to determine the most probable user
walking route without the need for global location information in DTNs
ADVANTAGES OF PROPOSED SYSTEM:
It constructs a Markov chain using the movement history data and uses it to
determine the most probable user walking route without the need for global
location information in DTNs.
Accuracy of direction mapping
5. SYSTEM ARCHITECTURE:
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.
MOBILE : ANDROID
6. SOFTWARE REQUIREMENTS:
Operating system : Windows XP/7.
Coding Language : Java 1.7
Tool Kit : Android 2.3 ABOVE
IDE : Eclipse
REFERENCE:
Wenzhong Li, Member, IEEE, Yuefei Hu, Student Member, IEEE, Xiaoming Fu,
Senior Member, IEEE, Sanglu Lu, Member, IEEE, and Daoxu Chen, Member,
IEEE, “Cooperative Positioning and Tracking in Disruption Tolerant Networks,”.
IEEE Transactions on Parallel and Distributed Systems, 2014.