With advances in wireless networks and hand-held computing devices equipped with location sensing
capability (e.g., PDAs, laptops, and smart phones), a large number of location based services (LBSs) have
been successfully deployed. In LBSs, wireless broadcast is an efficient method to support the large number
of users. In wireless broadcast environment, existing research proposed to support range queries search,
may tune into unnecessary indexes or data object. This paper addresses the problem of processing range
queries on wireless broadcast streams. In order to support range queries efficiently, we propose a novel
indexing scheme called Distributed Space-Partitioning Index (DSPI). DSPI consists of hierarchical grids
that provide mobile clients with the global view as well as the local view of the broadcast data. The
algorithm for processing range queries based on DSPI is also proposed. Simulation experiments
demonstrate DSPI is superior to the existing index schemes.
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
An efficient routing approach for aggregated data transmission along with per...eSAT Publishing House
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.
Minimum distance based routing protocol for lifetime improvement in wireless ...eSAT Journals
Abstract Balanced utilization of energy of wireless sensor nodes is a challenge while designing wireless sensor network (WSN). This energy of sensor node is a limited resource and measure for the lifespan of WSN. Communication process consumes most of the energy of sensor node hence; energy of sensor node becomes a major design issue for WSN. Clustering is preferred while designing routing protocols for WSN for its many to one traffic pattern. In our minimum distance based routing protocol for lifetime improvement in WSN (MDBRP) clusters are formed once in a lifetime and their heads are selected rotationally based on minimum communication distance between nodes and their next hop. MDBRP considers minimum energy consumption which aims to increase the overall lifespan of WSN. Keywords— clustering, dynamic clustering, routing protocol, static clustering, wireless sensor network.
Enchancing the Data Collection in Tree based Wireless Sensor Networksijsrd.com
Number of techniques used in Wireless Sensor Network to improve data collection from sensor nodes. It achieve by minimize the schedule length and dynamic channel assignment. Schedule length minimized by BFS algorithm without interfering links. Interfering links can be eliminated by transmission power control and multi frequency. The power can be save by using beacon signal. Collection of data can also be limited by topology of network. So the nodes are arranged in form. The capacitated minimal spanning trees and degree- constrained spanning trees give significant improvement in scheduling. Finally the data collection is enhancing in terms of security by using T-Hash Chain algorithm.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...ijwmn
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
Energy-Efficient Compressive Data Gathering Utilizing Virtual Multi-Input Mul...TELKOMNIKA JOURNAL
Data gathering is an attractive operation for obtaining information in wireless sensor networks (WSNs). But one of important challenges is to minimize energy consumption of networks. In this paper, an integration of distributed compressive sensing (CS) and virtual multi-input multi-output (vMIMO) in WSNs is proposed to significantly decrease the data gathering cost. The scheme first constructs a distributed data compression model based on low density parity check-like (LDPC-like) codes. Then a cluster-based dynamic virtual MIMO transmission protocol is proposed. The number of clusters, number of cooperative nodes and the constellation size are determined by a new established optimization model under the restrictions of compression model. Finally, simulation results show that the scheme can reduce the data gathering cost and prolong the sensor network’s lifetime in a reliable guarantee of sensory data recovery quality.
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
An efficient routing approach for aggregated data transmission along with per...eSAT Publishing House
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.
Minimum distance based routing protocol for lifetime improvement in wireless ...eSAT Journals
Abstract Balanced utilization of energy of wireless sensor nodes is a challenge while designing wireless sensor network (WSN). This energy of sensor node is a limited resource and measure for the lifespan of WSN. Communication process consumes most of the energy of sensor node hence; energy of sensor node becomes a major design issue for WSN. Clustering is preferred while designing routing protocols for WSN for its many to one traffic pattern. In our minimum distance based routing protocol for lifetime improvement in WSN (MDBRP) clusters are formed once in a lifetime and their heads are selected rotationally based on minimum communication distance between nodes and their next hop. MDBRP considers minimum energy consumption which aims to increase the overall lifespan of WSN. Keywords— clustering, dynamic clustering, routing protocol, static clustering, wireless sensor network.
Enchancing the Data Collection in Tree based Wireless Sensor Networksijsrd.com
Number of techniques used in Wireless Sensor Network to improve data collection from sensor nodes. It achieve by minimize the schedule length and dynamic channel assignment. Schedule length minimized by BFS algorithm without interfering links. Interfering links can be eliminated by transmission power control and multi frequency. The power can be save by using beacon signal. Collection of data can also be limited by topology of network. So the nodes are arranged in form. The capacitated minimal spanning trees and degree- constrained spanning trees give significant improvement in scheduling. Finally the data collection is enhancing in terms of security by using T-Hash Chain algorithm.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...ijwmn
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
Energy-Efficient Compressive Data Gathering Utilizing Virtual Multi-Input Mul...TELKOMNIKA JOURNAL
Data gathering is an attractive operation for obtaining information in wireless sensor networks (WSNs). But one of important challenges is to minimize energy consumption of networks. In this paper, an integration of distributed compressive sensing (CS) and virtual multi-input multi-output (vMIMO) in WSNs is proposed to significantly decrease the data gathering cost. The scheme first constructs a distributed data compression model based on low density parity check-like (LDPC-like) codes. Then a cluster-based dynamic virtual MIMO transmission protocol is proposed. The number of clusters, number of cooperative nodes and the constellation size are determined by a new established optimization model under the restrictions of compression model. Finally, simulation results show that the scheme can reduce the data gathering cost and prolong the sensor network’s lifetime in a reliable guarantee of sensory data recovery quality.
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
A PROPOSAL FOR IMPROVE THE LIFETIME OF WIRELESS SENSOR NETWORKIJCNCJournal
In the Wireless Sensor Network (WSN), sensor nodes are connected together through radio frequency (RF).Routing protocol is used to transmit data among sensor nodes. In the paper, we proposed a new routing protocol based on LEACH protocol. This is energy-efficient clustering algorithm. The proposed protocol enlarges WSN life-time by considering remaining energy and distance from nodes to BS in the election of cluster head. Comparing the result simulation between LEACH and proposed protocol showed that proposed protocol will prolong the network life-time.
Comparison of energy efficient data transmission approaches for flat wireless...ijassn
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless
sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks,
its precise usage is highly desirable both for the faithful performance of network and to increase the
network life time. For this work, we have considered a flat network topology where every node has the
same responsibility and capability. We have compared two energy efficient algorithms and analyzed their
performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with
increase in number of nodes, time rounds and node failures.
Design And Evaluation of Time Slot Assignment Algorithm For IEEE 802.16j Rela...CSCJournals
In IEEE 802.16j relay networks, wireless communications are carried out based on TDMA where the wireless network resources are divided into multiple time slots and they are assigned to wireless links between relay nodes as transmission opportunities. The network performance is improved by decreasing the total number of different time slots assigned to all links in a single scheduling cycle, because it brings the increase in the transmission opportunities of the links per unit time. Although it can be achieved when multiple links utilize the same time slot, the capacity of such links is degraded due to the radio interference. On the other hand, since all links in the network need to have enough time slots to accommodate their traffic load, degrading the link capacity may increase the total number of different time slots in the scheduling cycle. Therefore, we should determine the time slot assignment by considering the above-mentioned tradeoff relationship. In this paper, we propose heuristic algorithms for time slot assignment problem in IEEE 802.16j relay networks, and evaluate them through extensive simulation experiments. Two algorithms based on different heuristic are introduced. One algorithm assigns a set of time slots to links by a greedy approach. The other algorithm determines a set of links that use a time slot by a brute-force search for maximizing the total link capacity. Performance evaluation results exhibit that the proposed algorithms reduces around 34% and 39% of the total time slots compared with the case where no link utilizes the same time slot, respectively. Meanwhile, they also show that calculation time of the latter algorithm is longer than that of the former algorithm to reduce the total time slots. Thus, we show that there is a tradeoff between performance and calculation time.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
ENERGY-EFFICIENT DATA COLLECTION IN CLUSTERED WIRELESS SENSOR NETWORKS EMPLOY...ijwmn
In this paper, a energy-efficient data collection method is proposed in which an integration between
Discrete Cosine Transform (DCT) matrix and clustering in wireless sensor networks (WSNs) is
exploited.Based on the fact that sensory data in WSNs is often highly correlated and is suitable to be
transformed in DCT domain, we propose that each cluster from the networks only sends a small number of
large DCT transformed coefficients to the base-station (BS) for data collection in two common ways, either
directly or in multi-hop routing. All sensory data from the sensor network can be recovered based on the
large coefficients received at the BS. We further analyze and formulate the communication cost as the
power consumption for transmitting data in such networks based on stochastic problems. Some common
clustering algorithms are applied and compared to verify the analysis and simulation results. Both noise
and noiseless environments for the proposed method are considered.
Energy efficient neighbour selection for flat wireless sensor networkscsandit
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in
wireless sensor networks. Since energy saving or consumption is an important aspect of
wireless sensor networks, its precise usage is highly desirable both for the faithful performance
of network and to increase the network life time. For this work, we have considered a flat
network topology where every node has the same responsibility and capability. We have
compared two energy efficient algorithms and analyzed their performances with increase in
number of nodes, time rounds and node failures.
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
Location updation for energy efficient geographic routing in maneteSAT Journals
Abstract Routing in mobile ad-hoc networks with a large number of nodes or with high mobility is a very difficult task and energy conservation is very important for mobile devices. In geographic routing each node require information about neighbors to forward data packets. Earlier periodic updations are used for location updation but it consumes much amount of node energy and bandwidth utilized for unnecessary updation where there is no changes in the location information. In this paper adaptive position update used with less energy consumption and utilize the bandwidth for location updation only when there is a change in the network. The GPSR protocol used for packet forwarding in both greedy forwarding and perimeter forwarding. This adaptive updation utilize only less amount of node energy than other beaconing scheme. Index Terms:Routing protocols, Beacon updation scheme, Wireless communication, Greedy forwarding, Adaptive position updation.
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...IJCERT
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
http://www.ijcert.org offers Discount for Indian research Scholars
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
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
Comparative study between metaheuristic algorithms for internet of things wir...IJECEIAES
Wireless networks are currently used in a wide range of healthcare, military, or environmental applications. Wireless networks contain many nodes and sensors that have many limitations, including limited power, limited processing, and narrow range. Therefore, determining the coordinates of the location of a node of the unknown location at a low cost and a limited treatment is one of the most important challenges facing this field. There are many meta-heuristic algorithms that help in identifying unknown nodes for some known nodes. In this manuscript, hybrid metaheuristic optimization algorithms such as grey wolf optimization and salp swarm algorithm are used to solve localization problem of internet of things (IoT) sensors. Several experiments are conducted on every meta-heuristic optimization algorithm to compare them with the proposed method. The proposed algorithm achieved high accuracy with low error rate (0.001) and low power consumption.
Optimal Converge cast Methods for Tree- Based WSNsIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
С 26 сентября по 15 октября Бизнес-инкубатор НИУ ВШЭ совместно с Moscow Seed Fund проводит инвестиционный курс HSE{Invest} для начинающих предпринимателей и руководителей стартап-проектов.
В программу занятий включены лекции и мастер-классы, которые проводят эксперты, аналитики и руководители венчурных фондов. Участники курса смогут также потренировать свои навыки переговоров с потенциальными инвесторами, узнать, как правильно составить контракт и узнать о принципах работы бизнес-ангелов. Все творческие задания для слушателей носят исключительно практический характер.
Что дает участие в курсе:
Встречи с ведущими экспертами в отрасли венчурного инвестирования
Профессиональную экспертизу и подробный разбор презентационных материалов стартапа.
Возможность узнать о структуре фондов, “smart”-программах и инвестиционном этикете.
Темы лекций:
Карта инвестиционного рынка. Понимание структуры и отраслей фондов.
Smart money – умный инвестор.
Инвестиционный этикет. Правило первого свидания.
Стартап на посеве.
Бизнес-ангелы: кто это и зачем нужны?
Тюнинг стартапа. «Упаковка» (понимание ключевых точек. презентация).
Защити себя. Инвестиционный контракт.
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
A PROPOSAL FOR IMPROVE THE LIFETIME OF WIRELESS SENSOR NETWORKIJCNCJournal
In the Wireless Sensor Network (WSN), sensor nodes are connected together through radio frequency (RF).Routing protocol is used to transmit data among sensor nodes. In the paper, we proposed a new routing protocol based on LEACH protocol. This is energy-efficient clustering algorithm. The proposed protocol enlarges WSN life-time by considering remaining energy and distance from nodes to BS in the election of cluster head. Comparing the result simulation between LEACH and proposed protocol showed that proposed protocol will prolong the network life-time.
Comparison of energy efficient data transmission approaches for flat wireless...ijassn
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless
sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks,
its precise usage is highly desirable both for the faithful performance of network and to increase the
network life time. For this work, we have considered a flat network topology where every node has the
same responsibility and capability. We have compared two energy efficient algorithms and analyzed their
performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with
increase in number of nodes, time rounds and node failures.
Design And Evaluation of Time Slot Assignment Algorithm For IEEE 802.16j Rela...CSCJournals
In IEEE 802.16j relay networks, wireless communications are carried out based on TDMA where the wireless network resources are divided into multiple time slots and they are assigned to wireless links between relay nodes as transmission opportunities. The network performance is improved by decreasing the total number of different time slots assigned to all links in a single scheduling cycle, because it brings the increase in the transmission opportunities of the links per unit time. Although it can be achieved when multiple links utilize the same time slot, the capacity of such links is degraded due to the radio interference. On the other hand, since all links in the network need to have enough time slots to accommodate their traffic load, degrading the link capacity may increase the total number of different time slots in the scheduling cycle. Therefore, we should determine the time slot assignment by considering the above-mentioned tradeoff relationship. In this paper, we propose heuristic algorithms for time slot assignment problem in IEEE 802.16j relay networks, and evaluate them through extensive simulation experiments. Two algorithms based on different heuristic are introduced. One algorithm assigns a set of time slots to links by a greedy approach. The other algorithm determines a set of links that use a time slot by a brute-force search for maximizing the total link capacity. Performance evaluation results exhibit that the proposed algorithms reduces around 34% and 39% of the total time slots compared with the case where no link utilizes the same time slot, respectively. Meanwhile, they also show that calculation time of the latter algorithm is longer than that of the former algorithm to reduce the total time slots. Thus, we show that there is a tradeoff between performance and calculation time.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
ENERGY-EFFICIENT DATA COLLECTION IN CLUSTERED WIRELESS SENSOR NETWORKS EMPLOY...ijwmn
In this paper, a energy-efficient data collection method is proposed in which an integration between
Discrete Cosine Transform (DCT) matrix and clustering in wireless sensor networks (WSNs) is
exploited.Based on the fact that sensory data in WSNs is often highly correlated and is suitable to be
transformed in DCT domain, we propose that each cluster from the networks only sends a small number of
large DCT transformed coefficients to the base-station (BS) for data collection in two common ways, either
directly or in multi-hop routing. All sensory data from the sensor network can be recovered based on the
large coefficients received at the BS. We further analyze and formulate the communication cost as the
power consumption for transmitting data in such networks based on stochastic problems. Some common
clustering algorithms are applied and compared to verify the analysis and simulation results. Both noise
and noiseless environments for the proposed method are considered.
Energy efficient neighbour selection for flat wireless sensor networkscsandit
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in
wireless sensor networks. Since energy saving or consumption is an important aspect of
wireless sensor networks, its precise usage is highly desirable both for the faithful performance
of network and to increase the network life time. For this work, we have considered a flat
network topology where every node has the same responsibility and capability. We have
compared two energy efficient algorithms and analyzed their performances with increase in
number of nodes, time rounds and node failures.
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
Location updation for energy efficient geographic routing in maneteSAT Journals
Abstract Routing in mobile ad-hoc networks with a large number of nodes or with high mobility is a very difficult task and energy conservation is very important for mobile devices. In geographic routing each node require information about neighbors to forward data packets. Earlier periodic updations are used for location updation but it consumes much amount of node energy and bandwidth utilized for unnecessary updation where there is no changes in the location information. In this paper adaptive position update used with less energy consumption and utilize the bandwidth for location updation only when there is a change in the network. The GPSR protocol used for packet forwarding in both greedy forwarding and perimeter forwarding. This adaptive updation utilize only less amount of node energy than other beaconing scheme. Index Terms:Routing protocols, Beacon updation scheme, Wireless communication, Greedy forwarding, Adaptive position updation.
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...IJCERT
IJCERT Standard on-line Journal
ISSN(Online):2349-7084,(An ISO 9001:2008 Certified Journal)
iso nicir csir
http://www.ijcert.org offers Discount for Indian research Scholars
IJCERT (ISSN 2349–7084 (Online)) is approved by National Science Library (NSL), National Institute of Science Communication And Information Resources (NISCAIR), Council of Scientific and Industrial Research, New Delhi, India.
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
Comparative study between metaheuristic algorithms for internet of things wir...IJECEIAES
Wireless networks are currently used in a wide range of healthcare, military, or environmental applications. Wireless networks contain many nodes and sensors that have many limitations, including limited power, limited processing, and narrow range. Therefore, determining the coordinates of the location of a node of the unknown location at a low cost and a limited treatment is one of the most important challenges facing this field. There are many meta-heuristic algorithms that help in identifying unknown nodes for some known nodes. In this manuscript, hybrid metaheuristic optimization algorithms such as grey wolf optimization and salp swarm algorithm are used to solve localization problem of internet of things (IoT) sensors. Several experiments are conducted on every meta-heuristic optimization algorithm to compare them with the proposed method. The proposed algorithm achieved high accuracy with low error rate (0.001) and low power consumption.
Optimal Converge cast Methods for Tree- Based WSNsIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
С 26 сентября по 15 октября Бизнес-инкубатор НИУ ВШЭ совместно с Moscow Seed Fund проводит инвестиционный курс HSE{Invest} для начинающих предпринимателей и руководителей стартап-проектов.
В программу занятий включены лекции и мастер-классы, которые проводят эксперты, аналитики и руководители венчурных фондов. Участники курса смогут также потренировать свои навыки переговоров с потенциальными инвесторами, узнать, как правильно составить контракт и узнать о принципах работы бизнес-ангелов. Все творческие задания для слушателей носят исключительно практический характер.
Что дает участие в курсе:
Встречи с ведущими экспертами в отрасли венчурного инвестирования
Профессиональную экспертизу и подробный разбор презентационных материалов стартапа.
Возможность узнать о структуре фондов, “smart”-программах и инвестиционном этикете.
Темы лекций:
Карта инвестиционного рынка. Понимание структуры и отраслей фондов.
Smart money – умный инвестор.
Инвестиционный этикет. Правило первого свидания.
Стартап на посеве.
Бизнес-ангелы: кто это и зачем нужны?
Тюнинг стартапа. «Упаковка» (понимание ключевых точек. презентация).
Защити себя. Инвестиционный контракт.
Семинар от компании Custis "Расстройство клиентоориентированности: симптомы и...Business incubator HSE
Презентация с семинара руководителя стратегических IT-проектов компании Custis Михаила Заборова "Расстройство клиентоориентированности: симптомы и лечение".
На занятии обсуждалось, как эффективно выстроить систему взаимоотношений бизнеса с заказчиком и избежать основных ошибок при общении с клиентами.
Занятие прошло 10 декабря в НИУ ВШЭ на Шаболовке.
Организатор мастер-класса - Бизнес-инкубатор ВШЭ.
Больше событий - http://inc.hse.ru
CONTENT BASED DATA TRANSFER MECHANISM FOR EFFICIENT BULK DATA TRANSFER IN GRI...ijgca
A new class of Data Grid infrastructure is needed to support management, transport, distributed access, and analysis of terabyte and peta byte of data collections by thousands of users. Even though some of the existing data management systems (DMS) of Grid computing infrastructures provides methodologies to handle bulk data transfer. These technologies are not usable in addressing some kind of simultaneous data
access requirements. Often, in most of the scientific computing environments, a common data will be needed to access from different locations. Further, most of such computing entities will wait for a common scientific data (such as a data belonging to an astronomical phenomenon) which will be published only
when it is available. These kinds of data access needs were not yet addressed in the design of data component Grid Access to Secondary Storage (GASS) or GridFTP. In this paper, we address an application layer content based data transfer scheme for grid computing environments. By using the
proposed scheme in a grid computing environment, we can simultaneously move bulk data in an efficient way using simple subscribe and publish mechanism.
MULTIDIMENSIONAL ANALYSIS FOR QOS IN WIRELESS SENSOR NETWORKSijcses
Nodes in Mobile Ad-hoc network are connected wirelessly and the network is auto configuring [1]. This paper introduces the usefulness of data warehouse as an alternative to manage data collected by WSN.Wireless Sensor Network produces huge quantity of data that need to be proceeded and homogenised, so as to help researchers and other people interested in the information. Collected data is managed and compared with other coming from datasources and systems could participate in technical report and decision making. This paper proposes a model to design, extract, transform and normalize data collected by Wireless Sensor Networks by implementing a multidimensional warehouse for comparing many aspects in WSN such as (routing protocol[4], sensor, sensor mobility, cluster ….). Hence, data warehouse defined and applied to the context above is presented as a useful approach that gives specialists row data and information for decision processes and navigate from one aspect to another.
Performance evaluation of diff routing protocols in wsn using difft network p...Dr Sandeep Kumar Poonia
In the recent past, wireless sensor networks have been introduced to use in many applications. To design the networks, the factors needed to be considered are the coverage area, mobility, power consumption, communication capabilities etc. The challenging goal of our project is to create a simulator to support the wireless sensor network simulation. The network simulator (NS-2) which supports both wire and wireless networks is implemented to be used with the wireless sensor network.
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...ijtsrd
We propose clusters based cooperatives based verbal architecture coop on the cellular ad hoc wireless sensor network Mawsn with the environment fading Rayleigh. The main ability and contributions of this paper are as follows. First, the proposed cage uses a cluster as a underlying system to help stable transmission services. 2D, the proposed enclosure uses a cluster based verbal cooperative exchange to effectively guide the package delivery ratio with multi hop power saving transmission. 0.33, we do not forget reasonable methods mainly based on cellular ad hoc nodes with sensing features and constant sensor nodes in the sensor field along with conventional research for the introduction of constant network sensors. Fourth, we have theoretical analysis with blackouts opportunities for proposed cooperative transmissions. Overall performance evaluation is run through simulation and evaluation. Sweeti Kumari | Dr. Ranjan Kumar Singh "Wireless Sensor Network Based Clustering Architecture for Cooperative Communication" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd43670.pdf Paper URL: https://www.ijtsrd.comengineering/electronics-and-communication-engineering/43670/wireless-sensor-network-based-clustering-architecture-for-cooperative-communication/sweeti-kumari
Optimized Energy Management Model on Data Distributing Framework of Wireless ...Venu Madhav
Data Dissemination is an essential transmitting method for a sensor network to the endusers
across any set of interconnected frameworks. WSN is often used within an IoT system,
in other words. As in a mesh network, a wide collection of sensors can collect data
individually and send data to the web via an IoT system through a router. The conventional
defined solution for data dissemination in Wireless Sensor Networks (WSN) does not
include the wide range of new applications built on the Internet of Things (IoT)systems.
Hence, it is observed that searching for an appropriate transmission link while distributing
data with optimized utilization of energy is a significant challenge in the IoT communication
infrastructure. Therefore, in this paper, an Optimized Energy Management Model for
Data Dissemination (OEM-DD) framework has been proposed to optimize energy during
data transmission efficiently across all sensor network nodes in the IoT system. The efficiency
of the data dissemination across an interconnected network has been achieved by
introducing a Non-adaptive routing approach in which data is distributed effectively from
a single source to various points. Besides, Non-adaptive routing involves the dispersed collaboration
system and the priority task planning principle combined with an integer framework
for the efficient energy processing and grouping of data in the sensor’s network. Optimization
of the energy management model through Non-adaptive routing allows low power
consumption and minimal energy usage for each sensor node in the IoT system to improve
the transfer and handling of data in severe interruption. The experimental results show that
the suggested model enhances the data transmission rate of 96.33%
Evaluating feasibility of using wireless sensor networks in a coffee crop thr...IJCNCJournal
A Wireless Sensor Networks is a network formed with sensors that have characteristics to sensor an area to
extract a specific metric, depending of the application.
We would like to analyse the feasibility to use sensors in a coffee crop.In this work we are evaluating routing protocolsusing real dimensions and characteristics of a coffee crop. We evaluate, through simulation, AODV, DSDV and AOMDV and two variants known in this work as AODVMOD and AOMDVMOD with 802.15.4 MAC Protocol
.For this comparison, we defined three performance metrics: Packet Delivery Ratio (PDR), End-to-End Delay
and Average Energy Consumption. Simulation results show that AOMDVMOD overall, outperforms others
routing protocols evaluated, showing that is possible to use WSN in a real coffee crop environment.
A COST EFFECTIVE COMPRESSIVE DATA AGGREGATION TECHNIQUE FOR WIRELESS SENSOR N...ijasuc
In wireless sensor network (WSN) there are two main problems in employing conventional compression
techniques. The compression performance depends on the organization of the routes for a larger extent.
The efficiency of an in-network data compression scheme is not solely determined by the compression
ratio, but also depends on the computational and communication overheads. In Compressive Data
Aggregation technique, data is gathered at some intermediate node where its size is reduced by applying
compression technique without losing any information of complete data. In our previous work, we have
developed an adaptive traffic aware aggregation technique in which the aggregation technique can be
changed into structured and structure-free adaptively, depending on the load status of the traffic. In this
paper, as an extension to our previous work, we provide a cost effective compressive data gathering
technique to enhance the traffic load, by using structured data aggregation scheme. We also design a
technique that effectively reduces the computation and communication costs involved in the compressive
data gathering process. The use of compressive data gathering process provides a compressed sensor
reading to reduce global data traffic and distributes energy consumption evenly to prolong the network
lifetime. By simulation results, we show that our proposed technique improves the delivery ratio while
reducing the energy and delay
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
Similar to Efficient processing of spatial range queries on wireless broadcast streams (20)
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfPeter Spielvogel
Building better applications for business users with SAP Fiori.
• What is SAP Fiori and why it matters to you
• How a better user experience drives measurable business benefits
• How to get started with SAP Fiori today
• How SAP Fiori elements accelerates application development
• How SAP Build Code includes SAP Fiori tools and other generative artificial intelligence capabilities
• How SAP Fiori paves the way for using AI in SAP apps
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
Efficient processing of spatial range queries on wireless broadcast streams
1. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
DOI : 10.5121/ijdms.2014.6103 29
EFFICIENT PROCESSING OF SPATIAL RANGE
QUERIES ON WIRELESS BROADCAST STREAMS
KwanHo In, HaRim Jung, Hee Yong Youn and Ung-Mo Kim
School of Information and Communication Engineering,
Sungkyunkwan University, Suwon, Korea
ABSTRACT
With advances in wireless networks and hand-held computing devices equipped with location sensing
capability (e.g., PDAs, laptops, and smart phones), a large number of location based services (LBSs) have
been successfully deployed. In LBSs, wireless broadcast is an efficient method to support the large number
of users. In wireless broadcast environment, existing research proposed to support range queries search,
may tune into unnecessary indexes or data object. This paper addresses the problem of processing range
queries on wireless broadcast streams. In order to support range queries efficiently, we propose a novel
indexing scheme called Distributed Space-Partitioning Index (DSPI). DSPI consists of hierarchical grids
that provide mobile clients with the global view as well as the local view of the broadcast data. The
algorithm for processing range queries based on DSPI is also proposed. Simulation experiments
demonstrate DSPI is superior to the existing index schemes.
KEYWORDS
Location dependent information services, continuous range queries, moving objects, index structures,
broadcast systems
1. INTRODUCTION
With advances in wireless technologies and the wide spread of mobile devices, the trend toward
pervasive computing has gained momentum. Since location (e.g., 2-dimensional coordinates) is
one of the most important properties in a pervasive computing environment, various location
dependent information services (LDISs) have emerged as one of the promising applications [3-4,
10-11]. In order to support LDISs, efficient processing of location dependent queries (LDQs),
which retrieve information based on the current location of mobile clients (MCs), is critical. One
of the essential classes of LDQs is the range query which finds out all data objects within a given
rectangular (or circular) region.
Wireless data broadcast is considered to be an effective way for disseminating location dependant
data (LDD) and supporting LDQs since it leverages computational capability of MCs, and thus
accommodates a huge number of MCs simultaneously. In this paper, we address the problem of
processing range queries (One of the essential classes of LDQs) in wireless data broadcast
environments.
Preliminaries. In wireless data broadcast, data (e.g., LDD) are periodically broadcasted. The
server periodically broadcasts data through public wireless channels. MCs then retrieve the data
to evaluate their queries on the broadcast stream, without sending any request to the server. An
important characteristic of wireless data broadcast is that data objects are sequentially delivered
on the air and available to MCs only when they are currently being broadcasted. In order to
retrieve the data necessary for query processing, MCs have to continuously listen to the broadcast
2. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
30
channel until the data arrive. This leads to vast energy consumption on MCs. Current mobile
devices usually support two operation modes: full operational mode called active mode and
energy conserving mode referred to as doze mode. MCs can conserve their energy if they can stay
in doze mode most of the time and switch to active mode only when the desired data object
arrives on the air.
Air indexing is commonly used to help MCs predict the arrival time of the desired data. The basic
idea is to interleave index information (e.g., arrival times of data) with data on the broadcast
stream. By first accessing the index information, MCs can selectively retrieve only the desired
data. However, the average waiting time of the MCs is increased because the insertion of index
information extends the broadcast cycle (e.g., the length of the wireless broadcast stream). In
wireless data broadcast, the following measures are commonly used as performance criteria [1]:
● Access Latency: The time elapsed from the moment an MC requests data to the moment all the
required data are retrieved by the MC. This corresponds to the waiting time of the MC.
●Tuning Time: The total amount of time spent by the MC in the active mode for actually listening
to the broadcast channel. The Tuning Time is commonly used for measuring the energy-
efficiency of wireless broadcast data access.
(a) Broadcast stream without an index.
(b) Broadcast stream with an index
Figure 1. Data retrieval without and with an index
Both Access Latency and Tuning Time are evaluated in terms of the number of buckets, where a
bucket is the smallest logical unit of wireless data broadcast. The broadcast stream consists of
index buckets and data buckets. Index buckets hold the index information, while data buckets
3. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
31
hold the data. A set of contiguous index buckets is referred to as an index segment and a set of
contiguous data buckets broadcasted between successive index segments is called a data segment.
Let us consider a server that periodically broadcasts dataset D, where D = {d1, d2, d3,…, d8},
where di(1 ≤ i ≤ 8) is a data object. Suppose that an MC wants to retrieve d8. Fig. 1(a) and Fig.
1(b) illustrate the process of data retrieval on the wireless broadcast stream without and with an
index, respectively. Let us assume that the MC tunes into the broadcast channel as depicted in the
figures.
Without an index, the MC has to continually listen to the broadcast channel until it retrieves d8 as
shown in Fig. 1(a). On the contrary, as illustrated in Fig. 1(b), the MC can stay in doze mode and
only wake up when d8 arrives after accessing index (e.g., i3 and i4). Note that each bucket
contains a temporal offset to the beginning of the next index segment to facilitate the access of
index. Although the MC reduces the Tuning Time with the help of index, it suffers from the
Access Latency due to the lengthened broadcast cycle. In order to support efficient query
processing in wireless data broadcast, the air index scheme has to minimize Tuning Time while
minimizing Access Latency by keeping the increase of the broadcast cycle minimal.
Contributions. In this paper, we propose a novel air index structure, called Distributed Space
Partitioning Index (DSPI), for supporting range queries in wireless data broadcast environments.
DSPI consists of a hierarchy of grids, each of which uniformly partitions the data space with
different granularity. Additionally, DSPI has a linear, and yet distributed structure suitable for
wireless data broadcast. The technical contributions of the DSPI are summarized as follows:
● Providing efficient guidance for MCs to selectively retrieve only the required data objects by
letting the MCs traverse a hierarchy of grids.
● Enabling MCs to quickly process range queries by reducing the size of index.
● Having a linear, and yet distributed structure suitable for sequential data delivery in wireless
data broadcast while preserving the spatial locality of data objects.
Organization. The rest of the paper is organized as follows. In Section 2, related work to our
study is presented. Section 3 presents the proposed index scheme, namely DSPI. In Section 4,
experiments are conducted to show the efficiency of DSPI. Finally, we conclude this paper in
Section 5.
2. RELATED WORKS
In mobile computing environments, wireless broadcasting has been widely adopted for delivering
information to a large number of users due to its scalability benefit [12-15]. In a wireless
broadcasting system, the server periodically broadcasts data objects through the wireless
broadcasting channel in a pre-scheduled sequential order. When each mobile device receives a
query from a user, it tunes into the channel and processes the query on the broadcast stream.
Air index interleaving [16] is commonly used for reducing the tuning time at the expense of the
increased access time. The basic idea is to interleave an index information with data objects on
the broadcast stream. By first examining the index information, the mobile client can get the
arrival times of the relevant data objects for the given query. A wireless data broadcast, the
concept of air indexing has received much attention and was first discussed in [1]. In [1], the
authors proposed the (1, m) indexing and the distributed indexing schemes. Both schemes apply
an index tree (e.g., B+
-tree), where each node stores the ids and arrival times of its children. In
order to start query processing, an MC should wait until the root node of the index tree arrives.
4. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
32
Fig. 2 shows an example of the index tree for a broadcast stream. Circles represent index nodes
and the rectangles in the bottom represent data objects.
Figure 2. Example of the index tree
In the (1, m) indexing, the entire index is replicated m times and inserted into every 1/m fraction
of the broadcast stream (See Fig. 3). By replicating the entire index for m times, the waiting time
for reaching the root node can be reduced. This, however, incurs a huge amount of Access
Latency since the duplication of the entire index lengthens the broadcast cycle.
Figure 3. Example of (1, m) indexing
In the distributed indexing, an index is partially replicated and only the relevant portion of the
index is inserted in front of the data segment which immediately follows it. Since the distributed
indexing scheme replicates only the upper level of the index tree (Replicated Part in Fig. 2), the
size of broadcast stream is small compared with the that of (1, m) indexing. As a result,
distributed indexing shows better performance than the (1, m) indexing in terms of Access
Latency. Both (1, m) indexing and distributed indexing focus only on the id-based data retrieval.
That is, data objects are retrieved based on their identifiers. To process LDQs on the wireless data
broadcast stream, an indexing scheme should support location-based data retrieval. Recently,
several index structures for supporting LDQs in wireless data broadcast have been proposed [4, 5,
7, 8]. Among them, we give a brief overview of the latest air indexing schemes, namely Hilbert
Curve Index (HCI ) [7] and Distributed Spatial Index (DSI) [8].
To fit the sequential nature of wireless data broadcast, HCI and DSI utilize the Hilbert curve
(HC), one of the well-known space-filling curves. The Hilbert curve is a continuous path which
visits all cells in a multi-dimensional grid exactly once without crossing itself. Fig. 4(a) and 4(b)
5. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
33
show an example of Hilbert curves of order 1 and 2, for 21×21 grid and 22×22 grid respectively.
Numerical values in the figures represent the visiting order of the curves.
(a) Order 1 (b) Order 2
Figure 4. Hilbert curves of order 1 and 2.
Since the Hilbert curve can efficiently map 2-dimensional space to 1-dimensional space without
losing the locality of the underlying data, it facilitates the linear scan of the 2-dimensional data
delivered through the wireless broadcast channel. Specifically, the location (e.g., coordinates) of
each data object is approximated by a unique integer called HC value. This is done by partitioning
the data space into 2λ
×2λ
grid cells, so that each cell contains only one data object. Here, λ is the
order of Hilbert curve. Then each cell is assigned a HC value according to the visiting order of
Hilbert curve. Finally, the location of the data object inside each cell is approximated by the
corresponding HC value. Fig. 5(a) and 5(b) illustrate a sample dataset containing 32 data objects
and their approximated locations respectively. For example, the locations of data objects d1 and
d2 are approximated by 2 and 5.
In HCI and DSI, data objects are broadcast in the increasing order of their HC values. HCI
constructs a B+
-tree, where leaf nodes contain the HC values of all the data objects together with
corresponding pointers. Each data object is indexed and identified by its HC value (e.g.,
approximated location), and the associated pointer indicates the arrival time of the data object. To
reduce the waiting time for reaching the root node of the index, HCI utilizes the (1, m) indexing
scheme.
DSI, a table-based indexing scheme, organizes the index structure in a fully distributed fashion.
The basic idea of DSI is to split the broadcast stream into equal-sized frames, each of which
contains (i) a number of data objects and (ii) index table. An index table consists of logrNF entries,
where r is the exponential base and NF is the number of frames in a broadcast cycle. The ith entry
of any index table is represented as a < HCi, ptri > tuple. Here, HCi is the smallest HC value of
the data objects within the frame pointed by ptri, and ptri is the pointer which indicates the arrival
time of the next ri
th frame. In this manner, DSI enables each frame to maintain the indexing
information of the data objects to be broadcast.
6. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
34
(a)Dataset (b)HC approximation (λ=3)
Figure 5. Dataset and Hilbert curve approximation
With both HCI and DSI, an MC has to retrieve data objects more than necessary to process a
range query, because the locations of data objects are approximated by the HC values. For
example, consider the processing of the range query RQ (shaded rectangle) in Fig. 5 (b). With the
HCI, the MC should retrieve all data objects, whose HC value ∈{17, 23, 24, 28, 30, 32, 33, 36,
39, 40, 46}. However, only the data objects, whose HC value ∈ {28, 33}, can be the result of
RQ. Although DSI reduces the number of data objects being retrieved, it cannot completely
eliminate the unnecessary retrieval of data objects. This increases Tuning Time of the MC.
Furthermore, not only the distribution of LDD in the original space but also the number of LDD
may greatly deviate the performance of both HCI and DSI in terms of Access Latency as well as
Tuning Time.
The bucket is the basic unit of wireless broadcasting, and the broadcast stream consists of index
buckets and data buckets. Index buckets hold index information, whereas data buckets hold data.
We assume that each bucket has the same capacity, irrespective of its type (i.e., index bucket or
data bucket). In order to make all buckets self-identifying, each bucket contains the following
header information: bucket id, bucket type, upcoming appearance time of the next index bucket in
the broadcast stream, and start time of the next broadcast stream. Note that the bucket id is
determined by the offset of the corresponding bucket from the start time of the current broadcast
stream [17]. In the remainder of this paper, we use the number of buckets to measure access time
and tuning time. The number of buckets can be translated into time values without loss of
generality because all buckets are assumed to have the same capacity and the bandwidth of the
broadcasting channel is fixed.
3. DISTRIBUTED SPACE-PARTITIONING INDEX (DSPI)
In this section, we propose Distributed Space-Partitioning Index (DSPI) that enables MCs to
selectively retrieve only the required data objects (e.g., LDD). The proposed indexing scheme
significantly reduces Tuning Time and Access Latency compared to the previous indexing
schemes in [3, 4].
7. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
35
3.1. Index Structure
DSPI consists of nG hierarchical levels of grids, where nG is the number of grids. Each level of
grids partitions the data space with different granularity into grid cells of the same size. Fig. 6
shows the basic idea of DSPI, when nG = 2. For simplicity, we assume that nG = 2 in the rest of
the paper. However, extension to nG > 2 is straight forward.
Figure 6. Hierarchical grids
The lowest level of the grids, referred to as the leaf grid, indexes the underlying dataset, whereas
the upper level of the grids, called the directory grid, indexes the leaf grid. For the linear
placement of the grid cells as well as data objects on the air, we use the Hilbert curve since it
preserves the spatial locality better than other curves. Let DS be a two-dimensional data space.
For simplicity, we assume that DS is the unit square (0, 1)2
in our discussion.
Definition 1: (Leaf grid). The leaf grid is a grid that uniformly partitions the DS into 2γL
×2γL
grid
cells, where γL (≥ 1) is the granularity factor of the leaf grid. We call a grid cell in the leaf grid a
leaf cell.
Figure 7. Leaf grid (γL=2)
The leaf grid has the finest granularity among the grids in DSPI. It provides MCs with local
view of the underlying dataset D. The extent of a leaf cell on every dimension is 1/2γL
, so that the
leaf cell lc(i,j) at column i and row j (starting from the low-left corner of the leaf grid) maintains
the detailed information of all data objects with x-coordinate in the range (i×1/2γL
, (i+1)×1/2γL
)
and y-coordinate in the range (j×1/2γL
, (j+1)×1/2γL
). Specifically, each leaf cell maintains the
following information:
●Identifier: A leaf cell is assigned a HC value as an identifier according to the occurring order
on the Hilbert curve of order λ = γL. The identifier determines the broadcast order of the leaf cell.
8. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
36
●Object index table: An object index table stores identifiers, locations and arrival times of all
data objects which belong to the leaf cell. It consists of a set of tuples in the form of <id, (x, y),
ptr>.
●Directory cell pointer dc_ptr: dc_ptr indicates the arrival time of the next directory cell.
The leaf grid enables MCs to retrieve only the required data objects for range query processing by
using the 2-dimensional coordinates, instead of approximated coordinates, of data objects. Figure
7 illustrates the structure of the leaf grid based on the sample dataset in Fig. 5(a). In the broadcast
stream, all the leaf cells are sorted according to their identifiers (e.g., HC values), and each leaf
cell is placed in front of the relevant data segment containing data objects belonging to the leaf
cell.
Definition 2: (Directory grid). The directory grid is a grid that uniformly partitions the DS into
2γD
×2γD
grid cells, where γD (1 ≤ γD < γL) is the granularity factor of the directory grid. We call a
grid cell in a directory grid a directory cell. In particular, the directory grid which has the coarsest
granularity is called the root grid.
Figure 8. Directory grid (γD =1)
Since we assume nG = 2, hereafter we use directory grid and root grid interchangeably. Directory
grid maintains information of the lower level grid, namely, the leaf grid (Note that we assume nG
= 2) as well as the global view of D. The extent of each directory cell on every dimension is 1/2γD
.
The directory cell dc(i,j) maintains the information of its child cells, i.e., all leaf cells inclosed by
the range (i×1/2γD
, (i+1)×1/2γD
)× (j× 1/2γD
, (j+1) × 1/2γD
). For example, the directory cell dc(0,0) in
Fig. 8 contains the information of the child cells lc(0,0), lc(1,0), lc(0,1) and lc(1,1) in Fig. 7. Each
directory cell includes the following information:
●Identifier: A directory cell is assigned an HC value as an identifier according to the
occurring order on the Hilbert curve of order λ = γD. The identifier determines the broadcast
order of the directory cell.
●Child index table: A child index table stores the identifier, the minimum bounding rectangle
(MBR) and the arrival time of each child cell. The child index table consists of a number of
tuples in the form of <id, MBR, ptr>. The MBR is a rectangle of minimum area that fully
encloses all the data objects belonging to the corresponding child cell.
●Directory cell pointer dc_ptr: dc_ptr indicates the arrival time of the next directory cell.
The directory grid enables MCs to selectively read only the necessary portion of the leaf grid, by
examining the MBRs of its child cells. Fig. 8 illustrates the structure of the directory grid based
9. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
37
on the leaf grid in Fig. 7. All the directory cells are sorted according to their identifiers and each
of them is placed in front of its child cells on the broadcast stream. Fig. 9 illustrates the wireless
broadcast stream generated from the hierarchical grids shown in Fig. 7 and 8.
Figure 9. Broadcast stream generated from the hierarchical grids
3.2. Range Query Processing
A range query retrieves all data objects within a given rectangular (or circular) region. More
formally, given a set of 2-dimensional dataset D= {d1, d2, …, d|D|}and a query region q, the result
of range query is R(q)= {d∈D | d is within q}. In our discussion, the query region q is
represented by a rectangle.
To process a range query using DSPI, an MC first detects a collection of directory cells which
overlap with the query region q, and thereafter it retrieves the qualified data objects by traversing
the directory cells and their child cells on the broadcast stream.
In particular, given a set of overlapped directory cells, an MC maintains a list L of their identifiers
(ids). Note that given the mapping function of the Hilbert curve, it is easy for an MC to determine
the ids (HC values) of the overlapped directory cells. Then, the MC performs initial probe, i.e.,
tuning into the broadcast channel to find out when the next directory cell arrives on the broadcast
stream. After the initial probe, the MC continues to perform the following steps until L is empty:
1. The MC sequentially accesses a number of directory cells until it reaches the closest
directory cell dc on the broadcast stream whose id∈L. This is done by following dc_ptr in
each accessed directory cell. Then, the MC removes the id of dc from L.
2. Using the child index table in dc, the MC determines (i) the child cells whose MBRs
intersect with the query region q and (ii) when to tune into the broadcast channel in order to
access them.
3. The MC selectively accesses each qualified child cell. For each qualified child cell lc, the
MC determines (i) the data objects which are within the query region q and (ii) the arrival
times of them by using the object index table in lc. Then, the MC selectively retrieves the
qualified data objects.
10. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
38
Example. Consider the range query with its query region q (shaded rectangle) either in Fig. 7 or 8.
As the first step, the MC determines a set of overlapped directory cells, namely dc(0,1) and dc(1,1),
from the directory grid in Fig. 8 and inserts their ids (dc1 and dc2) into the list L. Then, the MC
tunes into the broadcast channel to find out when the next directory cell will arrive on the
broadcast stream.
Without loss of generality, we assume that the MC first tunes into the broadcast channel at the
time (or position) of dc1, which contains the information of its child cells (lc4, … , lc7) as well as
their MBRs. Since dc1∈L, the MC removes dc1 from L and determines the child cells whose
MBRs intersect with the query region q. Because only the MBR of lc7 overlaps with the q as
shown in Fig. 8, the MC accesses only lc7 and selectively retrieves the qualified data object,
namely d14, by utilizing the object index table in lc7. The MC then accesses to the next closest
directory cell on the broadcast stream whose id∈L, namely dc2, by using the dc_ptr in dc1. Then,
the MC removes dc2 from L. Since MBRs of lc8 and lc11 overlap with the query region q (See Fig.
8), the MC accesses both lc8 and lc11, and then retrieves d17. In this way, the MC completes the
processing of range query. Algorithm 1 presents the detailed algorithm for processing range
queries based on DSPI.
4. PERFORMANCE EVALUATION
We evaluated the performance of DSPI by comparing its Access Latency and Tuning Time with
those of HCI and DSI. For the implementation of the HCI, the (1, m) indexing scheme was
utilized. We used the optimal m (=√(DATAsize/INDEXsize)) to minimize Access Latency, where
DATAsize and INDEXsize are the sizes of whole data objects and the global index in terms of the
number of buckets [1]. On the other hand, for the DSI, the exponential base r was set to 2 and the
number of data objects within each frame was determined so that the index table associated with a
frame could fit into one bucket [8]. For the configuration of DSPI, we set nG = 2. In addition, the
granularity factor γL of the Leaf Grid was set to 4, and the granularity factor γD of Directory Grid
was set to 3. The system model, which consists of a broadcast server, MCs and a broadcast
channel, was implemented in the Java language.
11. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
39
We conducted performance analysis on two datasets (See Fig. 10): UNIFORM dataset and REAL
dataset. In the UNIFORM dataset, 6,000 data objects are uniformly generated in a square
Euclidian space. The REAL dataset contains 5,848 actual cities and villages of Greece, which is
extracted from the dataset available form [9]. In the experiment, 10,000 queries were issued. We
defined the ratio of average side length of a query rectangle to that of the whole data space,
referred to as RectSideRatio. We used the number of bytes instead of the number of buckets to
evaluate Access Latency and Tuning Time because the bucket size is varied in the experiment [8].
The number of bytes can be translated into the time values without loss of generality, since the
bandwidth of wireless channel is fixed. The size of a data object is 1024 bytes, and 16 bytes are
used for representing the 2-dimensional coordinates of a data object (8 bytes for each coordinate).
16 bytes are also used for representing the HC value. We set the pointer size to 2 bytes. Table 1
illustrates parameter settings used in the experiments. Since the number of MCs does not affect
the system performance [7], we considered only one MC in the performance evaluation.
(a)UNIFORM (b)REAL
Figure 10. Datasets for performance evaluation
Table 1. Parameter Settings
4.1. Evaluation of Access Latency
Fig. 11 shows the Access Latency performance when we fixed RectSideRatio to 0.1 and varied
bucket capacity from 26
to 29
bytes. For both datasets, namely UNIFORM (Fig. 11
(a)) and REAL (Fig. 11(b)), DSPI is superior to the other two indexing schemes (HCI, DSI).
This is due to the fact that the overall length of the broadcast cycle in DSPI is shorter than those
in the other two indices. Bucket capacity of UNIFORM dataset, DSPI decrease 51.7% and 30.6%
in terms of the Access Latency over HCI and DSI. Bucket capacity of REAL dataset, DSPI
decrease 51.1% and 16.6% in terms of the Access Latency over HCI and DSI. In other words, the
index size of HCI and DSI is much larger than that of DSPI. In HCI, the whole index is
interleaved m times with data objects, while in DSI, every frame has to maintain lots of
information (e.g., HC values of logrnF frames and pointers to those frames) when a large number
of data objects are concerned. Furthermore, in DSI, redundant information increases as the
12. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
40
number of data objects increases. Note that the Access Latency of DSPI, for the bucket size = 29
,
increases more rapidly than that of the others. This happens because the size of index segment,
i.e., a number of contiguous index buckets, is much larger than the size of the directory (or leaf)
cell. The Access Latency performance of DSPI tends to be affected by the bucket capacity due to
its small index size.
(a)UNIFORM dataset (b) REAL dataset
Figure 11. Access Latency versus bucket capacity
(a)UNIFORM dataset (b) REAL dataset
Figure 12. Access Latency versus RectSideRatio
For a more comprehensive evaluation, we fixed bucket capacity to 27
bytes and obtained the
simulation results by varying RectSideRatio. Obviously, as depicted in Fig. 12, Access Latency of
all the indices for both datasets gradually increases as the RectSideRatio increases. RectSideRatio
of UNIFORM dataset, DSPI decrease 56.3% and 31.3% in terms of the Access Latency over HCI
and DSI. RectSideRatio of REAL dataset, DSPI decrease 55.6% and 30.4% in terms of the Access
Latency over HCI and DSI. However, DSPI shows better performance than the other indices.
13. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
41
4.1. Evaluations of Tuning Time
Note that the Tuning Time affects the energy consumption on MCs. Here, we evaluated the
Tuning Time performance. By fixing the RectSideRatio to 0.1 and varying bucket capacity from
26
to 29
bytes, Fig. 13 shows the Tuning Time performance of the three indexing schemes. Fig. 14
plots the Tuning Time performance under a fixed bucket capacity and varied RectSideRatio.
(a)UNIFORM dataset (b) REAL dataset
Figure 13. Tuning Time versus bucket capacity
(a)UNIFORM dataset (b) REAL dataset
Figure 14. Tuning Time versus RecsideRatio
As shown in both figures, DSPI outperforms HCI and DSI. Bucket capacity of UNIFORM dataset,
DSPI decrease 55.3% and 17.1% in terms of the Tuning time over HCI and DSI. Bucket capacity
of REAL dataset, DSPI decrease 57.4% and 24.1% in terms of the Tuning time over HCI and DSI.
RectSideRatio of UNIFORM dataset, DSPI decrease 65.1% and 16.5% in terms of the Tuning
time over HCI and DSI. RectSideRatio of REAL dataset, DSPI decrease 65.1% and 29.9% in
terms of the Tuning time over HCI and DSI. This is because DSPI allows MCs to avoid reading
14. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
42
unnecessary data objects by offering the global view (MBRs) as well as the local view
(coordinates of the data objects) of the underlying dataset. As mentioned in Section 2, both HCI
and DSI are constructed based on the HC values of the underlying data objects instead of their
exact coordinates. As a result, MCs have to listen to broadcast channel more than necessary. This
incurs a huge amount of Tuning Time. Furthermore, as the order of Hilbert curve increases (due
to the skewed distribution or a large number of data objects), spatial locality of the data objects in
2-dimensional space cannot be preserved in the 1-dimensional linear space. Therefore, MCs have
to read much more data objects than necessary.
5. CONCLUSION
This paper addresses the problem of processing range queries on wireless broadcast streams. In
order to support range queries efficiently, this paper proposed a novel index structure, called
Distributed Space Partitioning Index, for processing range queries in wireless broadcast
environments. DSPI utilizes the notion of hierarchical grids in order to allow MCs to selectively
retrieve the required data in an efficient way in terms of Access Latency as well as Tuning Time.
As demonstrated in the simulation study, DSPI outperforms the existing index schemes (e.g., HCI,
DSI).
ACKNOWLEDGEMENTS
This research was supported by Basic Science Research Program through the National Research
Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2013R1A1A2008578)
&& This research was funded by the MSIP (Ministry of Science, ICT & Future Planning), Korea
in the ICT R&D Program 2013
REFERENCES
[1] T.Imielinski, S.Viswanathan and B.R.Bardrinath, Data on air: Organization and access, IEEE
Transaction on Knowledge and Data Engineering (TKDE), 9(3): pp. 353- 372, 1997.
[2] A. Datta, D. VanderMeer, A. Celik and V. Kumar, Broadcast protocols to support efficient retrieval
from databases by mobile users, ACM Transactions on Database Systems, 24(1): pp. 1-79, March
1999.
[3] C. Gostman and M. Linderbaum, On the metric properties of discrete space-filling curves, IEEE
Transactions on Image Processing, 5(5): pp. 794-797, May 1996.
[4] J. Xu, B. Zheng, W.C. Lee and D.L. Lee, Energy efficient index for querying location-dependent data
in mobile broadcast environments, Proc. 19th IEEE Conf. ICDE 03, 5(5): Bangalore, India, March
2003.
[5] B. Zheng, J. Xu, W.C. Lee and D.L. Lee, Energy conserving air indexes for nearest neighbor search,
Proc. 9th Conf. EDBT 04, 5(5): Heraklion, Crete, Greece, March 2004.
[6] J. Xu, W.C. Lee, X. Tang, Q. Gao and S. Li, Exponential index: a parameterized distributed indexing
scheme for data on air, Proc. 2nd ACM Conf. MobiSys 04, Boston, Massachusetts, USA: pp. 153-
164, June 2004.
[7] B. Zheng, W.C. Lee and D. Lee, Spatial queries in wireless broadcast systems, Wireless Network,
10(6): pp. 723-736, December, 2004.
[8] W. Lee and B. Zheng, DSI: A Fully Distributed Spatial Index for Location-based Wireless Broadcast
Services, Proc. 25th IEEE Conf. ICDCS 05, Columbus, Ohio, USA, pp. 349-358, June 2005.
[9] Spatial Datasets. available at http://www.rtreeportal.org.spatial.html.
[10] S. Ilarri, E. Mena, and A. Illarramendi, Location-Dependent Query Processing: Where We Are and
Where We Are Heading, ACM Computing Surveys, 42 (3) (2010), pp. 1-73.
[11] B. Gedik, and L. Liu, Mobieyes: A Distributed Location Monitoring Service Using Moving Location
Queries, IEEE Transactions on Mobile Computing, 5 (10) (2006), pp. 1384-1402.
[12] Y. D. Chung, An indexing scheme for energy-efficient processing of content-based retrieval queries
on a wireless data stream, Information Sciences 177 (2) (2007), pp. 525-542.
15. International Journal of Database Management Systems ( IJDMS ) Vol.6, No.1, February 2014
43
[13] A. B. Waluyo, W. Rahayu, D. Taniar and B. Srinivasan, A novel structure and access mechanism for
mobile data broadcast in digital ecosystems, IEEE Transactions on Industrial Electronics, 58 (6)
(2011), pp. 2173-2182.
[14] J. Zhong, W. Wu, Y. Shi and X. Gao, Energy-efficient tree-based indexing schemes for information
retrieval in wireless data broadcast, Lecture Notes in Computer Science 6588 (2011), pp. 335-351.
[15] Y. Kwon, H. Jung, Y. D. Chung, Monitoring continuous k-nearest neighbor queries in the hybrid
wireless network, Journal of Zhejiang University SCIENCE, 12(3), 2011, pp. 213-220.
[16] H. Jung, B. K. Cho, Y. D. Chung and L. Liu, On processing location based top-k queries in the
wireless broadcasting system, in Proceedings of ACM Symposium on Applied Computing, 2010, pp.
585-591.
[17] H. Jung, Y. D. Chung and L. Liu, Processing generalized k-nearest neighbor queries on a wireless
broadcast stream, Information Sciences, 188, 2012, pp. 67-79.
[18] A. B. Waluyo, W. Rahayu, D. Taniar and B. Srinivasan, A novel structure and access mechanism for
mobile data broadcast in digital ecosystems, IEEE Transactions on Industrial Electronics, 58 (6)
(2011), pp. 2173-2182.
[19] K. Mouratidis, and S. Bakiras, Continuous Monitoring of Spatial Queries in Wireless Broadcast
Environments, IEEE Transactions on Mobile Computing, 8 (10) (2009), pp. 1297-1311.
AUTHORS
Kwanho In received his B.S. degree in Computer Science from Dongguk University,
Gyeongju, Korea, in 2009. He received the M.S. degree in information and
communication engineering from Sungkyunkwan University, Suwon, Korea. His
research interests include database system, spatial data management in
mobile/pervasive environments.
HaRim Jung received his B.S. degree in Computer Science from Kwangwoon
University, Seoul, Korea, in 2004. He received his M.S. and Ph.D. degrees in Computer
Science and Engineering from Korea University, Seoul, Korea, in 2007 and 2012,
respectively. Currently, he is a research fellow at the School of Information and
Communication Engineering, Sungkyunkwan University, Suwon, Korea. His research
interests include location-based services, spatial data management in mobile / pervasive
environments and spatial big data management.
Hee Yong Youn received the B.S. and M.S. degrees in electrical engineering from
Seoul National University, Seoul, Korea, in 1977 and 1979, respectively, and the Ph.D.
degree in computer engineering from the University of Massachusetts at Amherst, in
1988. Currently he is a Professor of the School of Information and Communication
Engineering, Sungkyunkwan University, Suwon, Korea, and the Director of the
Ubiquitous Computing Technology Research Institute. His research interests include
distributed and ubiquitous computing, system software and middleware, and
RFID/USN.
Ung-Mo Kim received the B.E. degree in Mathematics from Sungkyunkwan
University, Korea, in 1981 and the M.S. degree in Computer Science form Old
Dominion University, U.S.A. in 1986. His Ph.D. degree was received in Computer
Science from Northwestern University, U.S.A., in 1990. Currently he is a full professor
of School of Information and Communication Engineering, Sungkyunkwan University,
Korea. His research interests include data mining, database security, data warehousing,
GIS and big data