The document describes the Efficient Doubletree algorithm, which aims to efficiently discover large-scale Internet topologies in a network-friendly manner through cooperation between monitors. It does this by reducing both intra-monitor and inter-monitor redundancy in topology discovery approaches. The algorithm works in two phases - forward probing from an initial hop count to discover new interfaces, and backward probing to reduce redundancy seen by individual monitors. It uses two trees and stopping rules to avoid duplicating work within and across monitors during probing. Evaluation shows the approach can significantly reduce measurement load while maintaining high interface and link coverage.
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.
Modified Coverage Hole Detection Algorithm for Distributed WSNsidescitation
Wireless sensor networks (WSNs) are spatially
distributed sensors that find wide applications in various fields
such as environmental control, Medicine and Health care,
Military surveillance etc. The sensing and communication
within the network should be effective for such applications.
Holes are the voids created in the network when accidental
death of nodes is caused due to technical
or improper
coverage. The detection of the holes becomes essential after
the random deployment. The main objective of the work is to
detect the coverage holes using computational geometry
approach which uses co-ordinates of the sensors and to
implement it in the hardware. The communication range of a
node is considered to be equal to its sensing range. The protocol
is designed for irregular domain which is a real time scenario
and takes the help of two-hop neighbors’ of a node to detect
the hole around it. The proposed system also allows only few
nodes to initiate the detection algorithm so that the energy
and time is conserved.
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.
Security based Clock Synchronization technique in Wireless Sensor Network for...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.
Energy Efficient Power Failure Diagonisis For Wireless Network Using Random G...idescitation
This paper deals with the discussion of an innovative and a design for the
efficient power management and power failure diagnosis in the area of wireless sensors
networks. A Wireless Network consists of a web of networks where hundreds of pairs are
connected to each other wirelessly. A critical issue in the wireless sensor networks in the
present scenario is the limited availability of energy within network nodes. Therefore,
making good use of energy is necessary in modeling a sensor network. In this paper we have
tried to propose a new model of wireless sensors networks on a three-dimensional plane
using the percolation model, a kind of random graph in which edges are formed between the
neighboring nodes. An algorithm has been described in which the power failure diagnosis is
made and solved. This paper also involves proper selection of the ideal networks by the
concepts of Random Graph theory. The paper involves the mathematics of complete fault
diagnosis including solving the problem and continuing the process flow.
Information Extraction from Wireless Sensor Networks: System and ApproachesM 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 hybridization and adaptation of IE mechanisms.
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.
Modified Coverage Hole Detection Algorithm for Distributed WSNsidescitation
Wireless sensor networks (WSNs) are spatially
distributed sensors that find wide applications in various fields
such as environmental control, Medicine and Health care,
Military surveillance etc. The sensing and communication
within the network should be effective for such applications.
Holes are the voids created in the network when accidental
death of nodes is caused due to technical
or improper
coverage. The detection of the holes becomes essential after
the random deployment. The main objective of the work is to
detect the coverage holes using computational geometry
approach which uses co-ordinates of the sensors and to
implement it in the hardware. The communication range of a
node is considered to be equal to its sensing range. The protocol
is designed for irregular domain which is a real time scenario
and takes the help of two-hop neighbors’ of a node to detect
the hole around it. The proposed system also allows only few
nodes to initiate the detection algorithm so that the energy
and time is conserved.
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.
Security based Clock Synchronization technique in Wireless Sensor Network for...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.
Energy Efficient Power Failure Diagonisis For Wireless Network Using Random G...idescitation
This paper deals with the discussion of an innovative and a design for the
efficient power management and power failure diagnosis in the area of wireless sensors
networks. A Wireless Network consists of a web of networks where hundreds of pairs are
connected to each other wirelessly. A critical issue in the wireless sensor networks in the
present scenario is the limited availability of energy within network nodes. Therefore,
making good use of energy is necessary in modeling a sensor network. In this paper we have
tried to propose a new model of wireless sensors networks on a three-dimensional plane
using the percolation model, a kind of random graph in which edges are formed between the
neighboring nodes. An algorithm has been described in which the power failure diagnosis is
made and solved. This paper also involves proper selection of the ideal networks by the
concepts of Random Graph theory. The paper involves the mathematics of complete fault
diagnosis including solving the problem and continuing the process flow.
Information Extraction from Wireless Sensor Networks: System and ApproachesM 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 hybridization and adaptation of IE mechanisms.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
Target localization and tracking problems in WSNs have received considerable attention recently, driven
by the requirement to achieve high localization accuracy, with the minimum cost possible. In WSN based
tracking applications, it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of communication
between nodes whenever the localization information is transmitted to a sink node. Tracking through
WSNs can be categorized into centralized and decentralized systems. Decentralized systems offer low
power consumption when deployed to track a small number of mobile targets compared to the centralized
tracking systems. However, in several applications, it is essential to position a large number of mobile
targets. In such applications, decentralized systems offer high power consumption, since the location of
each mobile target is required to be transmitted to a sink node, and this increases the power consumption
for the whole WSN. In this paper, we propose a power efficient decentralized approach for tracking a
large number of mobile targets while offering reasonable localization accuracy through ZigBee network
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.
Simulation Issues in Wireless Sensor Networks: A SurveyM H
This paper presents a survey of simulation tools and systems for wireless sensor networks. Wireless sensor network modelling and simulation methodologies are presented for each system alongside judgments concerning their relative ease of use and accuracy. Finally, we propose a mixed-mode simulation methodology that integrates a simulated environment with real wireless sensor network testbed hardware in order to improve both the accuracy and scalability of results when evaluating different prototype designs and systems.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
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
Investigations on real time RSSI based outdoor target tracking using kalman f...IJECEIAES
Target tracking is essential for localization and many other applications in Wireless Sensor Networks (WSNs). Kalman filter is used to reduce measurement noise in target tracking. In this research TelosB motes are used to measure Received Signal Strength Indication (RSSI). RSSI measurement doesn‟t require any external hardware compare to other distance estimation methods such as Time of Arrival (TOA), Time Difference of Arrival (TDoA) and Angle of Arrival (AoA). Distances between beacon and non-anchor nodes are estimated using the measured RSSI values. Position of the nonanchor node is estimated after finding the distance between beacon and nonanchor nodes. A new algorithm is proposed with Kalman filter for location estimation and target tracking in order to improve localization accuracy called as MoteTrack InOut system. This system is implemented in real time for indoor and outdoor tracking. Localization error reduction obtained in an outdoor environment is 75%.
Interpolation Techniques for Building a Continuous Map from Discrete Wireless...M H
Wireless sensor networks (WSNs) typically gather data at a discrete number of locations. However, it is desirable to be able to design applications and reason about the data in more abstract forms than in points of data. By bestowing the ability to predict inter-node values upon the network, it is proposed that it will become possible to build applications that are unaware of the concrete reality of sparse data. This interpolation capability is realised as a service of the network. In this paper, the ‘map’ style of presentation has been identified as a suitable sense data visualisation format. Although map generation is essentially a problem of interpolation between points, a new WSN service, called the map generation service, which is based on a Shepard interpolation method, is presented. A modified Shepard method that aims to deal with the special characteristics of WSNs is proposed. It requires small storage, can be localised and integrates the information about the application domain to further reduce the map generation cost and improve the mapping accuracy. Flood management application is considered to demonstrate how MGS-generated maps can be used in various applications. Empirical analysis has shown that the map generation service is an accurate, a flexible and an efficient method.
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.
Guide to iBeacons: How they work and how they can be used Phill Hunt
iBeacons 101 gude on how they work and how they can be used. Especially how iBeacons can be used by retailers to create more engaging experience for customers through the deployment of personalised specifically located offers and innovative location based loyalty. iBeacons allow retailers to market to customers, while they are actually browsing goods in store.
The deck also looks at iBeacons other uses such as in museums, industry and medical applications. If you want to learn about iBeacons, go the Mobikats website and give us a call.
Information extraction from sensor networks using the Watershed transform alg...M H
Wireless sensor networks are an effective tool to provide fine resolution monitoring of the physical environment. Sensors generate continuous streams of data, which leads to several computational challenges. As sensor nodes become increasingly active devices, with more processing and communication resources, various methods of distributed data processing and sharing become feasible. The challenge is to extract information from the gathered sensory data with a specified level of accuracy in a timely and power-efficient approach. This paper presents a new solution to distributed information extraction that makes use of the morphological Watershed algorithm. The Watershed algorithm dynamically groups sensor nodes into homogeneous network segments with respect to their topological relationships and their sensing-states. This setting allows network programmers to manipulate groups of spatially distributed data streams instead of individual nodes. This is achieved by using network segments as programming abstractions on which various query processes can be executed. Aiming at this purpose, we present a reformulation of the global Watershed algorithm. The modified Watershed algorithm is fully asynchronous, where sensor nodes can autonomously process their local data in parallel and in collaboration with neighbouring nodes. Experimental evaluation shows that the presented solution is able to considerably reduce query resolution cost without scarifying the quality of the returned results. When compared to similar purpose schemes, such as “Logical Neighborhood”, the proposed approach reduces the total query resolution overhead by up to 57.5%, reduces the number of nodes involved in query resolution by up to 59%, and reduces the setup convergence time by up to 65.1%.
Adaptive Routing in Wireless Sensor Networks: QoS Optimisation for Enhanced A...M H
One of the key challenges for research in wireless sensor networks is the development of routing protocols that provide application-specific service guarantees. This paper presents a new cluster-based Route Optimisation and Load-balancing protocol, called ROL, that uses various quality of service (QoS) metrics to meet application requirements. ROL combines several application requirements, specifically it attempts to provide an inclusive solution to prolong network life, provide timely message delivery and improve network robustness. It uses a combination of routing metrics that can be configured according to the priorities of user-level applications to improve overall network performance. To this end, an optimisation tool for balancing the communication resources for the constraints and priorities of user applications has been developed and Nutrient-flow-based Distributed Clustering (NDC), an algorithm for load balancing is proposed. NDC works seamlessly with any clustering algorithm to equalise, as far as possible, the diameter and the membership of clusters. This paper presents simulation results to show that ROL/NDC gives a higher network lifetime than other similar schemes, such Mires++. In simulation, ROL/NDC maintains a maximum of 7\% variation from the optimal cluster population, reduces the total number of set-up messages by up to 60%, reduces the end-to-end delay by up to 56%, and enhances the data delivery ratio by up to 0.98% compared to Mires++.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
AN IMPROVED DECENTRALIZED APPROACH FOR TRACKING MULTIPLE MOBILE TARGETS THROU...ijwmn
Target localization and tracking problems in WSNs have received considerable attention recently, driven
by the requirement to achieve high localization accuracy, with the minimum cost possible. In WSN based
tracking applications, it is critical to know the current location of any sensor node with the minimum
energy consumed. This paper focuses on the energy consumption issue in terms of communication
between nodes whenever the localization information is transmitted to a sink node. Tracking through
WSNs can be categorized into centralized and decentralized systems. Decentralized systems offer low
power consumption when deployed to track a small number of mobile targets compared to the centralized
tracking systems. However, in several applications, it is essential to position a large number of mobile
targets. In such applications, decentralized systems offer high power consumption, since the location of
each mobile target is required to be transmitted to a sink node, and this increases the power consumption
for the whole WSN. In this paper, we propose a power efficient decentralized approach for tracking a
large number of mobile targets while offering reasonable localization accuracy through ZigBee network
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.
Simulation Issues in Wireless Sensor Networks: A SurveyM H
This paper presents a survey of simulation tools and systems for wireless sensor networks. Wireless sensor network modelling and simulation methodologies are presented for each system alongside judgments concerning their relative ease of use and accuracy. Finally, we propose a mixed-mode simulation methodology that integrates a simulated environment with real wireless sensor network testbed hardware in order to improve both the accuracy and scalability of results when evaluating different prototype designs and systems.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
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
Investigations on real time RSSI based outdoor target tracking using kalman f...IJECEIAES
Target tracking is essential for localization and many other applications in Wireless Sensor Networks (WSNs). Kalman filter is used to reduce measurement noise in target tracking. In this research TelosB motes are used to measure Received Signal Strength Indication (RSSI). RSSI measurement doesn‟t require any external hardware compare to other distance estimation methods such as Time of Arrival (TOA), Time Difference of Arrival (TDoA) and Angle of Arrival (AoA). Distances between beacon and non-anchor nodes are estimated using the measured RSSI values. Position of the nonanchor node is estimated after finding the distance between beacon and nonanchor nodes. A new algorithm is proposed with Kalman filter for location estimation and target tracking in order to improve localization accuracy called as MoteTrack InOut system. This system is implemented in real time for indoor and outdoor tracking. Localization error reduction obtained in an outdoor environment is 75%.
Interpolation Techniques for Building a Continuous Map from Discrete Wireless...M H
Wireless sensor networks (WSNs) typically gather data at a discrete number of locations. However, it is desirable to be able to design applications and reason about the data in more abstract forms than in points of data. By bestowing the ability to predict inter-node values upon the network, it is proposed that it will become possible to build applications that are unaware of the concrete reality of sparse data. This interpolation capability is realised as a service of the network. In this paper, the ‘map’ style of presentation has been identified as a suitable sense data visualisation format. Although map generation is essentially a problem of interpolation between points, a new WSN service, called the map generation service, which is based on a Shepard interpolation method, is presented. A modified Shepard method that aims to deal with the special characteristics of WSNs is proposed. It requires small storage, can be localised and integrates the information about the application domain to further reduce the map generation cost and improve the mapping accuracy. Flood management application is considered to demonstrate how MGS-generated maps can be used in various applications. Empirical analysis has shown that the map generation service is an accurate, a flexible and an efficient method.
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.
Guide to iBeacons: How they work and how they can be used Phill Hunt
iBeacons 101 gude on how they work and how they can be used. Especially how iBeacons can be used by retailers to create more engaging experience for customers through the deployment of personalised specifically located offers and innovative location based loyalty. iBeacons allow retailers to market to customers, while they are actually browsing goods in store.
The deck also looks at iBeacons other uses such as in museums, industry and medical applications. If you want to learn about iBeacons, go the Mobikats website and give us a call.
IOSR Journal of Pharmacy and Biological Sciences(IOSR-JPBS) is an open access international journal that provides rapid publication (within a month) of articles in all areas of Pharmacy and Biological Science. The journal welcomes publications of high quality papers on theoretical developments and practical applications in Pharmacy and Biological Science. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
IOSR Journal of Pharmacy and Biological Sciences(IOSR-JPBS) is an open access international journal that provides rapid publication (within a month) of articles in all areas of Pharmacy and Biological Science. The journal welcomes publications of high quality papers on theoretical developments and practical applications in Pharmacy and Biological Science. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Online stream mining approach for clustering network trafficeSAT Journals
Abstract A large number of research have been proposed on intrusion detection system, which leads to the implementation of agent based intelligent IDS (IIDS), Non – intelligent IDS (NIDS), signature based IDS etc. While building such IDS models, learning algorithms from flow of network traffic plays crucial role in accuracy of IDS systems. The proposed work focuses on implementing the novel method to cluster network traffic which eliminates the limitations in existing online clustering algorithms and prove the robustness and accuracy over large stream of network traffic arriving at extremely high rate. We compare the existing algorithm with novel methods to analyse the accuracy and complexity. Keywords— NIDS, Data Stream Mining, Online Clustering, RAH algorithm, Online Efficient Incremental Clustering algorithm
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Novel Methodology of Data Management in Ad Hoc Network Formulated using Nanos...Drjabez
In Ad hoc Network of Nanosensors for Wastage detection, clustering assist in nodal communication and in organization of the data fetched by the nanosensors in the network. The attempt of traditional cluster formation techniques degraded the formation of cluster in a precise manner. The data from the nanosensors which act as the nodes of the network have to be distinctively added into the clusters. The dynamic path selection cluster would achieve this distinct addition by dynamically creating a path to the data as an initial process and then redirecting the data to their appropriate cluster based to the readied scheme.
A Secure Payment Scheme with Low Communication and Processing Overhead for Mu...Editor IJMTER
In this proposed work a trust-based routing protocol is developed to route messages through the
highly trusted nodes to minimize the probability of dropping the messages. Thus improve the network
performance in terms of throughput and packet delivery ratio. The proposed design contains a novel secure
reactive routing protocol for Mobile ad hoc networks (MANETs), called TRIUMF (Trust-Based Routing
Protocol with controlled degree of Selfishness for Securing MANET against Packet Dropping Attack). In the
proposed protocol trust among nodes is represented by trust value, which consists of cooperation score, direct
trust and indirect trust. The proposed trust routing allows controlled degree of selfishness to give an incentive to
the selfish nodes to declare its selfishness behavior to its neighbor nodes, which reduce the searching time of
misbehaving nodes to search for the malicious nodes only. In the proposed routing protocol two node-disjoint
routes between the source and destination nodes are selected based on their path trust values, one marked as
primary and the other as secondary. In this work both DLL-ACK and end- to-end TCP-ACK as monitoring
tools to monitor the behavior of routing path nodes: if the data packet successfully transmitted, then the path
nodes trust value are updated positively; otherwise, if a malicious behavior is detected then the path searching
tool starts to identify the malicious nodes and isolate them from the routing path and the network. Finally this
scheme reduces the searching time of malicious nodes, and the routing protocol avoids the isolated misbehaving
node from sharing in all future routes, which improves the overall network throughput.
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.
An intrusion detection algorithm for amiIJCI JOURNAL
Nowadays, using the smart metering devices for energy users to manage a wide variety of subscribers,
reading devices for measuring, billing, disconnection and connection of subscribers’ connection
management is an important issue. The performance of these intelligent systems is based on information
transfer in the context of information technology, so reported data from network should be managed to
avoid the malicious activities that including the issues that could affect the quality of service the system. In
this paper for control of the reported data and to ensure the veracity of the obtained information, using
intrusion detection system is proposed based on the support vector machine and principle component
analysis (PCA) to recognize and identify the intrusions and attacks in the smart grid. Here, the operation of
intrusion detection systems for different kernel of SVM when using support vector machine (SVM) and PCA
simultaneously is studied. To evaluate the algorithm, based on data KDD99, numerical simulation is done
on five different kernels for an intrusion detection system using support vector machine with PCA
simultaneously. Also comparison analysis is investigated for presented intrusion detection algorithm in
terms of time - response, rate of increase network efficiency and increase system error and differences in
the use or lack of use PCA. The results indicate that correct detection rate and the rate of attack error
detection have best value when PCA is used, and when the core of algorithm is radial type, in SVM
algorithm reduces the time for data analysis and enhances performance of intrusion detection.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
An approach for ids by combining svm and ant colony algorithmeSAT Journals
Abstract This piece of work researches the intrusion detection problem of the network sanctuary; the primary task is to classify network behavior as normal or abnormal while reducing misclassification. In this paper, two efficient data mining algorithms are combined together to detect the network intrusion. Combining SVM and Ant colony (CSVAC) used for well-organized data classification, this technique takes the advantage of both the algorithm while avoiding their weaknesses. This algorithm is implemented and evaluated using standard benchmark KDDCUP99 data set. Experimental results drastically well produce superior results than the other algorithm in terms of accuracy rate and run time efficiency, and this algorithm able to detect the new types of attacks Keywords: Intrusion Detection; Support Vector Machine; Ant colony; Combined Support vector with ant colony
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
6th International Conference on Machine Learning & Applications (CMLA 2024)ClaraZara1
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
HEAP SORT ILLUSTRATED WITH HEAPIFY, BUILD HEAP FOR DYNAMIC ARRAYS.
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and place the minimum element at the beginning. Repeat the same process for the remaining elements.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Water billing management system project report.pdfKamal Acharya
Our project entitled “Water Billing Management System” aims is to generate Water bill with all the charges and penalty. Manual system that is employed is extremely laborious and quite inadequate. It only makes the process more difficult and hard.
The aim of our project is to develop a system that is meant to partially computerize the work performed in the Water Board like generating monthly Water bill, record of consuming unit of water, store record of the customer and previous unpaid record.
We used HTML/PHP as front end and MYSQL as back end for developing our project. HTML is primarily a visual design environment. We can create a android application by designing the form and that make up the user interface. Adding android application code to the form and the objects such as buttons and text boxes on them and adding any required support code in additional modular.
MySQL is free open source database that facilitates the effective management of the databases by connecting them to the software. It is a stable ,reliable and the powerful solution with the advanced features and advantages which are as follows: Data Security.MySQL is free open source database that facilitates the effective management of the databases by connecting them to the software.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
Online aptitude test management system project report.pdfKamal Acharya
The purpose of on-line aptitude test system is to take online test in an efficient manner and no time wasting for checking the paper. The main objective of on-line aptitude test system is to efficiently evaluate the candidate thoroughly through a fully automated system that not only saves lot of time but also gives fast results. For students they give papers according to their convenience and time and there is no need of using extra thing like paper, pen etc. This can be used in educational institutions as well as in corporate world. Can be used anywhere any time as it is a web based application (user Location doesn’t matter). No restriction that examiner has to be present when the candidate takes the test.
Every time when lecturers/professors need to conduct examinations they have to sit down think about the questions and then create a whole new set of questions for each and every exam. In some cases the professor may want to give an open book online exam that is the student can take the exam any time anywhere, but the student might have to answer the questions in a limited time period. The professor may want to change the sequence of questions for every student. The problem that a student has is whenever a date for the exam is declared the student has to take it and there is no way he can take it at some other time. This project will create an interface for the examiner to create and store questions in a repository. It will also create an interface for the student to take examinations at his convenience and the questions and/or exams may be timed. Thereby creating an application which can be used by examiners and examinee’s simultaneously.
Examination System is very useful for Teachers/Professors. As in the teaching profession, you are responsible for writing question papers. In the conventional method, you write the question paper on paper, keep question papers separate from answers and all this information you have to keep in a locker to avoid unauthorized access. Using the Examination System you can create a question paper and everything will be written to a single exam file in encrypted format. You can set the General and Administrator password to avoid unauthorized access to your question paper. Every time you start the examination, the program shuffles all the questions and selects them randomly from the database, which reduces the chances of memorizing the questions.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Efficient Doubletree: An Algorithm for Large-Scale Topology Discovery
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 13, Issue 3 (Jul. - Aug. 2013), PP 05-12
www.iosrjournals.org
www.iosrjournals.org 5 | Page
Efficient Doubletree: An Algorithm for Large-Scale Topology
Discovery
Ranjit Kumar Nukathati
(Department of Computer Science, JNTU College of Engineering, Anantapur, India)
Abstract: Monitoring Internet topology was a tractable problem. Topology discovery systems are starting to be
introduced in the form of easily and widely deployed software. Unfortunately, they have a problem of how to
perform such measurements efficiently and in a network-friendly manner. When scaled up, such methods will
generate so much traffic that they will begin to resemble distributed denial-of-service attacks.
The existing Doubletree algorithm faces the problem of redundancy. To solve this, the Efficient
Doubletree algorithm is proposed which reduces redundancy while maintaining nearly the same level of nodes
and link coverage. Algorithm quantifies the amount of redundancy in classic Internet topology discovery
approaches by taking into account the perspective of a single monitor (intramonitor) and that of an entire
system (intermonitor). Efficient Doubletree simultaneously meets the conflicting demands of reducing
intramonitor and intermonitor redundancy. In both the above cases a hop in the middle that is between monitor
and destination will be selected by Hop Selection to increase efficiency.
Keywords: Distributed denial-of-service(DDoS) attack, Efficient Doubletree, forward probing, backward
probing, stopping rule.
I. Introduction
Systems for active measurements in the Internet are undergoing a dramatic change. Whereas the
present generation of systems operates on largely dedicated hosts, that numbering between 20 to 200, a new
generation of easily downloadable measurement software means that infrastructures based on thousands of hosts
could spring up overnight. Unless we carefully controlled these new systems have the potential to impose a
heavy load on parts of the network that are being measured. They also have the capable to raise alarms as their
traffic can easily resemble a distributed denial-of-service (DDoS) attack. This paper examines the problem and
proposes and evaluates, through simulations and prototype deployment, an algorithm for Controlling one of the
most common forms of active measurement: traceroute.
There are a number of systems active today that aim to elicit the Internet topology at the Internet
protocol (IP) interface level. The most extensive tracing system is CAIDA’s skitter. It uses 24 monitors, each
monitor targeting on the order of one million destinations. In the fashion of skitter, scamper uses several
monitors to traceroute IPv6 addresses. Some other well-known systems such as the RIPE NCC’s TTM service
and the NLANR AMP have larger numbers of monitors (between 100 and 200) and conduct traces in a full mesh
but avoid tracing to outside destinations. Scriptroute is a system that allows an ordinary Internet user to perform
network measurements from several distributed points. It proposes remote measurement execution on nodes of
PlanetLab, through a daemon that implements ping, traceroute, hop-by-hop bandwidth measurement, and other
number of utilities.Removing spatial bias is not the only reason to employ measurement systems that use a
larger number of monitors. Using with more monitors to probe the same space, each one can take a small
portion and probe it more frequently. In network dynamics, that might be missed by smaller systems and can
more readily be captured by the larger ones, while keeping constant as the workload per monitor. The idea of
releasing easily deployable measurement software is not new. To the best of our knowledge, the idea of
incorporating a traceroute monitor into a screen saver was first discussed in a paper by Cheswick in 2000. Since
that time, a number of measurement tools have been released to the public in the form of screen savers or
daemons, such as Grenouille or NETI@home. In the summer of 2004, the first tracerouting tool of this type was
made available: DIMES conducts traceroutes and pings from, at the time of writing this paper, 8700 agents
distributed over five continents. Given that large-scale network mapping is emerging, contemplating such a
measurement system demands attention to effi-ciency, in order to avoid generating undesirable network
load.Save for our work, described here, and first presented at ACM SIGMETRICS 2005, this issue has not been
systematically tackled by the research community.
Our first contribution is to measure the extent to which classic topology discovery systems involve
duplicated effort. By classic topology discovery, such as skitter, tracing from a small number of monitors to a
large set of common destinations. We define two metrics to estimate duplicated effort in such systems: the
quantity of measurements made by an individual monitor that replicate its own work (intramonitor redunancy)
2. Efficient Doubletree: An Algorithm For Large-Scale Topology Discovery
www.iosrjournals.org 6 | Page
and, the quantity of measurements made by multiple monitors that replicate each other’s work (intermonitor
redundancy).
Using skitter data from August 2004, we quantify both kinds of redundancy. We show that
intramonitor redundancy is high close to each monitor. This fact is not surprising given the treelike structure of
routes emanating from a single monitor. Further, with respect to intermonitor redundancy, we find that most
interfaces are visited by all monitors, especially when those interfaces are close to destinations. This latter form
of redundancy is also potentially quite large, since it would be expected to grow linearly with the number of
monitors in future large-scale measurement systems. Our analysis of the nature of redundant probing suggests
more efficient algorithms for topology discovery. In particular, our second contribution is to propose and
evaluate an algorithm called Efficient Doubletree. Efficient Doubletree takes advantage of the tree-like structure
of routes, either emanating from a single source towards multiple destinations or converging from multiple
sources towards a single destination, to avoid duplication of the effort. Unfortunately, the general strategies for
reducing these two kinds of redundancy are in conflict. On the one hand, intramonitor redundancy is reduced by
starting probing far from the monitor, and working backwards along the tree-like structure that is rooted at that
monitor. Once an interface is encountered and that has already been discovered by the monitor, then probing
stops. On the other hand, intermonitor redundancy is reduced by probing forwards towards a destination until
encountering a previously seen interface. The intermonitor redundancy reduction implies that monitors share
information about what they have already discovered. We show, balancing these conflicting strategies in
Efficient Doubletree. In Efficient Doubletree, probing starts at a distance that is intermediate between monitor
and destination. We demonstrate methods for choosing this distance, and we then evaluate the resulting
performance of Efficient Doubletree. Despite the challenge inherent in reducing both forms of redundancy
simultaneously we show in simulations that probing via Efficient Doubletree can reduce measurement load by
approximately 76%, while maintaining interface and link coverage above 90%.
II. Metrics To Evaluate Topology Discovery Tools
This section introduces two metrics that allow one to evaluate a distributed tracerouting system. We
evaluate such a system by considering the redundancy (i.e., the duplication of effort) at two levels. One is the
individual level of a single monitor, considered in isolation from Fig. 2. Skitter intramonitor redundancy for the
champagne monitor. This intramonitor redundancy is measured by the number
Fig 1. Quantiles Key
of times the same monitor visits an interface. This intermonitor redundancy is measured by the number of
monitors that visit a given interface counting only once
Fig 2. Skitter intramonitor redundancy for the Fig 3. Skitter intermonitor redundancy
champagne monitor
3. Efficient Doubletree: An Algorithm For Large-Scale Topology Discovery
www.iosrjournals.org 7 | Page
each that has nonzero intramonitor redundancy for that interface. By separating the two levels, we separate the
problem of redundancy into two problems that can be treated somewhat separately. Each monitor can act on its
own to reduce its intramonitor redundancy, but cooperation between monitors is required to reduce intermonitor
redundancy. Fig. 1 provides a key to reading the quantile plots found in Figs. 2 and 3 and figures found later in
this paper. A dot marks the median (the 2nd quartile or 50th percentile). The vertical line below the dot
delineates the range from the minimum to the 1st
quartile, and leaves a space from the 1st to the 2nd quartile.
The space above the dot runs from the 2nd to the 3rd quartile, and the line above that extends from the 3rd
quartile to the maximum. Small tick bars to either side of the lines mark some additional percentiles: bars to the
left for the 10th and 90th, and bars to the right for the 5th and 95th.
In the figures, each quantile plot sits directly above an accompanying bar chart that indicates the
quantity of data upon which the quantiles were based. And for each hop count, the bar chart displays the number
of interfaces at that distance. For these bar Fig. 3. Skitter intermonitor redundancy. charts, a log scale is used on
the vertical axis. This allows us to identify quantiles that are based upon very few interfaces (fewer than 20, for
instance), and so for which the values risk being somewhat arbitrary. In addition, each plot has a separate bar to
the right, labeled “all,” that shows the quantiles for all interfaces taken together (upper part of the plot) and the
number of discovered interfaces (lower part of the plot).
A. Intramonitor Redundacy
Intramonitor redundancy occurs in the context of the tree-like graph that is generated when all
traceroutes originate at a single point. Since there are fewer number of interfaces closer to the monitor and those
interfaces will tend to be visited more frequently. In extreme cases, if there is a single gateway router between
the monitor and the rest of the Internet, the single IP address of the outgoing interface belonging to that router
should show up in every one of the traceroutes. We measure intramonitor redundancy by considering all
traceroutes from the monitor to the shared destinations, whether there may be problems with a traceroute such as
illegal addresses, or not. Having calculated the intramonitor redundancy for each interface, we organizes results
by the distance of the interfaces from the monitor. We measure distance exactly by hop count. Since the same
interface can appear at a number of different hop counts from a monitor, for instance, if routes change between
the traceroutes, we arbitrarily attribute to each interface the hop count at which it was first visited. This process
yields, for each hop count, a set of interfaces that we sort by number of visits. The we plot, hop-by-hop, the
redundancy distribution for interfaces at each hop count. Fig. 2 shows the intramonitor redundancy metric
applied to the champagne monitor.
B. Intermonitor Redundancy
Intermonitor redundancy occurs when multiple monitors visit the same interface. The degree of such
redundancy is of keen interest to us when we envisage increasing the number of monitors by several orders of
magnitude. We calculate the intermonitor redundancy for each interface by counting the number of monitors
that have visited it. And a monitor can be counted at most once towards an interface’s intermonitor redundancy,
even if it has visited that interface multiple number of times. For a given interface, the redundancy is calculated
just once with respect to the entirety of the monitors: it does not vary from monitor to monitor as does
intramonitor redundancy. However, what does vary depending upon the monitor is whether the particular
interface is seen, and at what distance.In order to attribute a single distance to an interface, a distance that does
not depend upon the perspective of a single monitor but that nonetheless has meaning when examining the
effects of distance on redundancy, we attribute the minimum distance at which an interface has been seen
among all the monitors. Fig. 3 shows the intermonitor redundancy metric applied to the 24 skitter monitors.
III. Discovering Process Using Efficient Doubletree
The Efficient Doubletree algorithm, which is part of the Traceroute project, is the first attempt to
efficiently perform large-scale topology discovery in a network-friendly manner through co-operation between
monitors. A tree can be used by a probing algorithm to keep track of its discovery progress. The rule is that
probing is carried out from the leaves to the root, i.e. decreasing probe packet TTLs, as long as it is probing a
previously unknown part of the tree. It then stops when a previously discovered node is encountered. The
assumption is made that the remaining path to the root is known, leading to potential coverage loss. Note that, in
the context of Internet topology, discovering a new node would correspond to a router’s interface responding to
a probe packet within the constraints. Efficient Doubletree tackles both types of redundancy (i.e. Intra-monitor
redundancy and inter-monitor redundancy) and is based on the treelike structure of routes emanating from a
single source or converging on a same destination. For this reason, Doubletree uses two trees, one monitor-
rooted and one destination-rooted trees as illustrated by Figure 3.1(a) and 3.1(b) The monitor-rooted tree is
composed of outgoing routes from a single monitor to multiple destinations. The destination-rooted tree is
composed of routes from multiple monitors converging to a common destination. The stopping rule based on the
4. Efficient Doubletree: An Algorithm For Large-Scale Topology Discovery
www.iosrjournals.org 8 | Page
former aims at reducing intra-monitor redundancy, and the latter which requires inter-monitor communication in
order to reduce their shared redundancy.
3.1 Two-Phase Probing
Efficient Doubletree acts in two phases:
1. Forward probing proceeds from an initial hop count h to h+1, h+2, and so forth, applying a stopping rule
based on the destination-rooted tree.
2. Backward probing then follows by taking the hop count back to h-1, h-2, etc., applying a stopping
rule based on the monitor-rooted tree.
Fig. 3.1(a): Monitor-rooted tree
During the backward probing phase, once the root or stopping rule is reached, the algorithm moves on to the
next destination and restarts probing at initial distance h. In the special case where there is no response at a
certain distance, this distance is halved, and halved again until there is a reply. Probing then continues forward
and backward from that point.
Fig. 3.1(b): Destinated-rooted tree
3.2 Stop Sets and Simple Stopping Rule
Rather than maintaining information about the tree structure, it is sufficient for the stopping rules to
store sets of (interface, root) pairs, the root being the root of the tree in question, i.e. the monitor- or destination-
based tree. These sets are called stop sets. A single monitor uses two distinct stop sets:
The first stop set is used when probing forwards and is called the global stop set.
The second stop set is used when probing backwards and is called the local stop set. This set can be reduced
to a list of interfaces since the root item never changes as it is the monitor itself.
The stopping rule for each phase is simple: it is to stop when the encountered pair is already a member of the
relevant set, otherwise it is added.
Algorithm: Efficient Doubletree
Algorithm 1 is the formal definition of Efficient Doubletree and assumes the existence of two functions:
5. Efficient Doubletree: An Algorithm For Large-Scale Topology Discovery
www.iosrjournals.org 9 | Page
response() returns true if an interface replies to at least one probe sent to it.
halt() returns true if probing must be stopped for various reasons. These reasons include the detection of a
loop or the observation of a gap in the case of a non-responding interface.
Algorithm:
1. Procedure Doubletree(h,D)
2. B ← φ
3. for all d є D do
4. h ← AdapthValue (h)
5. TraceForward (h,d)
6. TraceBackwards (h-1,d)
7. end for
8. end Procedure
9. Procedure AdapthValue(h)
10. while ¬ response(vh) ^ h ≠ 1 do
11. h ← h/2
12. end while
13. return h
14. end procedure
15. Procedure TraceForward(i,d)
16. while vi ≠ d ^ (vi,d) ¢ F ^ ¬halt() do
17. F ← F U (vi,d)
18. i ++
19. end while
20. end procedure
21. Procedure TraceBackwards(i,d)
22. while i ≥ 1 vi ¢ B ^ ¬ halt() do
23. B ← B U vi
24. F ← F U (vi,d)
25. i –
26. end while
27. end procedure
3.3 Choice of Initial Distance
In order for a monitor to avoid excess intra-monitor redundancy by probing too close and excess inter-
monitor redundancy by probing too far, Efficient Doubletree starts off at what is hoped to be an intermediate
point h between the monitor and the given destination. Each monitor having a different location in the network,
a reasonable value for h is to be determined for each one.
A choice for h is typically based on the distribution of path lengths as seen individually from the
perspective of each monitor. One easily estimated parameter by a monitor is its probability p of hitting a
responding destination on the first probe. By fixing p, the individually obtained values of h correspond to a
similar level of incursion of each monitor in the network.
IV. Result Analysis
This section describes the simulated version of Efficient Doubletree. The Java code for this prototype is freely
available online. This section also describes the results of initial runs of Efficient Doubletree in a real
environment.
6. Efficient Doubletree: An Algorithm For Large-Scale Topology Discovery
www.iosrjournals.org 10 | Page
4.1. Instance of Adhoc Network
Fig. 4.1. Adhoc Network
As an Adhoc network is dynamic and changes time to time, one instance of Adhoc network is given, in the
above figure 4.1.
4.2 Path Tracing Information
(a) Forward Probing:: Global StopSet: Towards the Destination1
Fig. 4.2 Forward Probing from Monitor1 towards the Destination1
Monitor1 begins probing from the hop11 and the next hop traced is 16 towards the Destination1. Lines
connecting all these nodes can be seen in the network shown in figure 4.1.
Fig. 4.3 Forward Probing from Monitor2 towards the Destination1
Monitor2 begins probing from the hop14 and the next hop traced is 18 towards the Destination1. Lines
connecting all these nodes can be seen in the network shown in figure 4.1.
Fig. 4.4 Forward Probing from Monitor3 towards the Destination1
7. Efficient Doubletree: An Algorithm For Large-Scale Topology Discovery
www.iosrjournals.org 11 | Page
Monitor3 begins probing from the hop9 and the next hops traced in sequence are 0,13 and 4 towards the
Destination1. Lines connecting all these nodes can be seen in the network shown in figure 4.1.
Fig. 4.5 Forward Probing from Monitor4 towards the Destination1
Monitor4 begins probing from the hop10 and the next hops traced in sequence are 2,7 and 15 towards the
Destination1. Lines connecting all these nodes can be seen in the network shown in figure 4.1.
(b)Backward Probing:: Local StopSet: Towards the respective Monitors
Fig. 4.6 Backward Probing towards Monitor1 and Monitor2 at Two HOP Distance
Backward probing for Monitor1 begins at two-hop distance that is from hop11 towards hop6 and Monitor1 in
sequence. Similarly backward probing for Monitor2 begins at two-hop distance that is from hop14 towards
hop19 and Monitor2 in sequence.
Fig. 4.7 Backward Probing towards Monitor3 and Monitor4 at Two HOP Distance
Backward probing for Monitor3 begins at two-hop distance that is from hop9 towards hop8 and Monitor3 in
sequence. Similarly backward probing for Monitor4 begins at two-hop distance that is from hop10 towards
hop18 and Monitor4 in sequence.
V. Conclusion
In this paper, we quantify the amount of redundancy in classic Internet topology discovery approaches
by taking into account the perspective of a single monitor (intramonitor) and that of an entire system
(intermonitor). In the intramonitor case, we find that interfaces close to the monitor suffer from a high number
of repeat visits. Concerning intermonitor redundancy, we see that a large portion of interfaces are visited by all
monitors. In order to scale up classic approaches such as skitter, we have proposed Efficient Doubletree, an
algorithm that significantly reduces the duplication of effort, while discovering nearly the same set of nodes and
links. Efficient Doubletree simultaneously meets the conflicting demands of reducing intramonitor and
intermonitor redundancy. We describe how to tune a single parameter for Efficient Doubletree in order to obtain
an a tradeoff between redundancy and coverage, and we find operating points at which it is possible to strongly
reduce one while maintaining the other. For a range of values, Efficient Doubletree is able to reduce
measurement load by approximately 76%, while maintaining interface and link coverage above 90%. We also
8. Efficient Doubletree: An Algorithm For Large-Scale Topology Discovery
www.iosrjournals.org 12 | Page
describe a prototype Efficient Doubletree implementation and present preliminary in simulation. These initial
results are consistent with the performance expectations formed by the simulation results. Further experiments
are necessary, though difficult to carry out. This paper represents the first step towards a highly distributed
tracerouting system. Elsewhere, we have proposed extensions to this work: reducing the communication cost of
sharing the global stop set through the use of Bloom filters, and reducing the load on destinations via techniques
we call capping and clustering. In other work, we evaluate and address prefix based stopping rule.We show in
this paper that Efficient Doubletree can save time by avoiding duplication of effort between monitors.
Therefore, Efficient Doubletree should be able to probe the network more frequently. We believe that this could
make it possible to better capture the network dynamics that result from routing changes and load balancing.
Future work might reveal the extent to which Efficient Doubletree is helpful in capturing such network changes.
We are also working on a BGP-guided topology discovery tool. We think that a topology discovery algorithm at
the IP level may fruitfully make use of information from higher levels, such as the AS-level.
Finally, we plan to work on an overlay or peer-to-peer system for managing the interaction between Efficient
Doubletree monitors.
References
[1] V. Jacobsen “Traceroute UNIX,” 1989. [Online]. Available: ftp://ftp.ee.lbl.gov/traceroute.tar.gz, man page.
[2] R. Braden, “Requirements for internet hosts. communication layers,” Internet Engineering Task Force, RFC 1122, Oct. 1989. [3]
E.C. Rosen, “Vulnerabilities of network control protocols: An examples”, RFC 789, July 1981.
[4] Y. Rekhter, “BGP Protocol Analysis”, RFC 1265, October 1991.
[5] D. Atkins and R. Austein. “Threat Analysis of the Domain Name System (DNS)”. RFC 3833 (Informational), August 2004.
[6] S. Murphy. “BGP Security Vulnerable Analysis”, RFC 4272 (Informational), January 2006.
[7] A. Retana, R. White, V. Fuller, and D. McPherson. “Using 31-Bit Prefixes on IPv4 Point-to- Point Links”, RFC 3021 (Proposed
Standard), December 2000.
[8] Y. Rekhter and T. Li, “A Border Gateway Protocol 4 (BGP-4)”, RFC 1771 (Draft Standard), March 1995. Obsoleted by RFC
4271.