164 research outputs found

    An Energy-aware Ad-hoc Routing Strategy for Queriable Wireless Sensor Networks

    Get PDF
    The data volume handled by wireless sensor networks (WSN) is ever growing due to increasing node counts and node complexity – be it in traditional WSN applications or for Car2X or Internet-of-Things. Queriable WSN are a concept to handle the large data volumes in such networks by abstracting the network as a virtual database table to which users can pose queries. This declarative approach enables networks which can flexibly adapt to changing application requirements. In addition they possess a flat learning curve since users do not need to have a high technological understanding of the sensor node firmware. Upon executing a query it is first propagated through the network and once it has reached the desired nodes, results are collected and send back through the query-posing node (usually the sink). The routing which is used for the data aggregation step plays a major role in the energy efficiency in networks with increasing node and sensor value counts as represented by Car2X networks for instance. In this paper, an ad-hoc routing strategy for queriable WSN is proposed which is both energy-aware and application-specific. It will be shown that this routing can contribute greatly towards decreasing the energy consumption needed for data aggregation and thus helps increasing the network’s lifespan

    Robotic Wireless Sensor Networks

    Full text link
    In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future

    Dynamic distributed clustering in wireless sensor networks via Voronoi tessellation control

    Get PDF
    This paper presents two dynamic and distributed clustering algorithms for Wireless Sensor Networks (WSNs). Clustering approaches are used in WSNs to improve the network lifetime and scalability by balancing the workload among the clusters. Each cluster is managed by a cluster head (CH) node. The first algorithm requires the CH nodes to be mobile: by dynamically varying the CH node positions, the algorithm is proved to converge to a specific partition of the mission area, the generalised Voronoi tessellation, in which the loads of the CH nodes are balanced. Conversely, if the CH nodes are fixed, a weighted Voronoi clustering approach is proposed with the same load-balancing objective: a reinforcement learning approach is used to dynamically vary the mission space partition by controlling the weights of the Voronoi regions. Numerical simulations are provided to validate the approaches

    Editorial for the special issue on Energy‐efficient Networking

    Full text link
    Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/136372/1/dac3311_am.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/136372/2/dac3311.pd

    Keberkesanan program simulasi penapis sambutan dedenyut terhingga (FIR) terhadap kefahaman pelajar kejuruteraan elektrik

    Get PDF
    Kefahaman merupakan aset bagi setiap pelajar. Ini kerana melalui kefahaman pelajar dapat mengaplikasikan konsep yang dipelajari di dalam dan di luar kelas. Kajian ini dijalankan bertujuan menilai keberkesanan program simulasi penapis sambutan dedenyut terhingga (FIR) terhadap kefahaman pelajar kejuruteraan elektrik FKEE, UTHM dalam mata pelajaran Pemprosesan Isyarat Digital (DSP) bagi topik penapis FIR. Metodologi kajian ini berbentuk kaedah reka bentuk kuasi�eksperimental ujian pra-pasca bagi kumpulan-kumpulan tidak seimbang. Seramai 40 responden kajian telah dipilih dan dibahagi secara rawak kepada dua kllmpulan iaitu kumpulan rawatan yang menggunakan program simulasi penapis FIR dan kumpulan kawalan yang menggunakan kaedah pembelajaran berorientasikan modul pembelajaran DSP UTHM. Setiap responden menduduki dua ujian pencapaian iaitu ujian pra dan ujian pasca yang berbentuk kuiz. Analisis data berbentuk deskriptif dan inferens dilakllkan dengan menggunakan Peri sian Statistical Package for Social Science (SPSS) versi 11.0. Dapatan kajian menunjukkan kedua-dua kumpulan pelajar telah mengalami peningkatan dari segi kefahaman iaitu daripada tahap tidak memuaskan kepada tahap kepujian selepas menggunakan kaedah pembelajaran yang telah ditetapkan bagi kumpulan masing-masing. Walaubagaimanapun, pelajar kumpulan rawatan menunjukkan peningkatan yang lebih tinggi sedikit berbanding pelajar kumpulan kawalan. Namun begitu, dapatan kajian secara ujian statistik menunjukkan tidak terdapat perbezaan yang signifikan dari segi pencapaian markah ujian pasca di antara pelajar kumpulan rawatan dengan pelajar kumpulan kawalan. Sungguhpun begitu, penggunaan program simulasi penapis FIR telah membantu dalam peningkatan kefahaman pelajar mengenai topik penapis FIR

    Unmanned Ground Vehicle for Data Collection in Wireless Sensor Networks: Mobility-aware Sink Selection

    Get PDF
    Several recent studies have demonstrated the benefits of using the Wireless Sensor Network (WSN) technology in large-scale monitoring applications, such as planetary exploration and battlefield surveillance. Sensor nodes generate continuous stream of data, which must be processed and delivered to end users in a timely manner. This is a very challenging task due to constraints in sensor node’s hardware resources. Mobile Unmanned Ground Vehicles (UGV) has been put forward as a solution to increase network lifetime and to improve system's Quality of Service (QoS). UGV are mobile devices that can move closer to data sources to reduce the bridging distance to the sink. They gather and process sensory data before they transmit it over a long-range communication technology. In large-scale monitored physical environments, the deployment of multiple-UGV is essential to deliver consistent QoS across different parts of the network. However, data sink mobility causes intermittent connectivity and high re-connection overhead, which may introduce considerable data delivery delay. Consequently, frequent network reconfigurations in multiple data sink networks must be managed in an effective way. In this paper, we contribute an algorithm to allow nodes to choose between multiple available UGVs, with the primary objective of reducing the network reconfiguration and signalling overhead. This is realised by assigning each node to the mobile sink that offers the longest connectivity time. The proposed algorithm takes into account the UGV’s mobility parameters, including its movement direction and velocity, to achieve longer connectivity period. Experimental results show that the proposed algorithm can reduce end-to-end delay and improve packet delivery ratio, while maintaining low sink discovery and handover overhead. When compared to its best rivals in the literature, the proposed approach improves the packet delivery ratio by up to 22%, end-to-end delay by up to 28%, energy consumption by up to 58%, and doubles the network lifetime

    Efficient Data-Processing Algorithms for Wireless-Sensor-Networks-Based Planetary Exploration

    Get PDF
    The Space Wireless Sensor Networks for Planetary Exploration project aims to design a wireless sensor network that consists of small wireless sensor nodes dropped onto the moon surface to collect scientific measurements. Data gathered from the sensors will be processed and aggregated for uploading to a lunar orbiter and subsequent transmission to Earth. In this paper, efficient data-processing/fusion algorithms are proposed, the purpose of which is to integrate the scientific sensor data collected by the wireless sensor network, reducing the data volume without sacrificing the data quality to satisfy energy constraints of wireless-sensor-network nodes operating in the extreme moon environment. The results of an extensive simulation experiment targeted at the Space Wireless Sensor Networks for Planetary Exploration lunar exploration mission are reported, which quantify the performance efficiency of the data-processing scheme. It is shown that the proposed data-processing algorithms can reduce the wireless-sensor-network node energy consumption significantly, decreasing the data transmission energy up to 91%. In addition, it is shown that up to 99% of the accuracy of the original data can be preserved in the final reconstructed data

    Development of Energy-efficient Algorithms for Wireless Sensor Networks

    Get PDF
    corecore