Data Aggregation Scheduling in Wireless Networks

Data aggregation is one of the most essential data gathering operations in wireless networks. It is an efficient strategy to alleviate energy consumption and reduce medium access contention. In this dissertation, the data aggregation scheduling problem in different wireless networks is investigated. Since Wireless Sensor Networks (WSNs) are one of the most important types of wireless networks and data aggregation plays a vital role in WSNs, the minimum latency data aggregation scheduling problem for multi-regional queries in WSNs is first studied. A scheduling algorithm is proposed with comprehensive theoretical and simulation analysis regarding time efficiency. Second, with the increasing popularity of Cognitive Radio Networks (CRNs), data aggregation scheduling in CRNs is studied. Considering the precious spectrum opportunity in CRNs, a routing hierarchy, which allows a secondary user to seek a transmission opportunity among a group of receivers, is introduced. Several scheduling algorithms are proposed for both the Unit Disk Graph (UDG) interference model and the Physical Interference Model (PhIM), followed by performance evaluation through simulations. Third, the data aggregation scheduling problem in wireless networks with cognitive radio capability is investigated. Under the defined network model, besides a default working spectrum, users can access extra available spectrum through a cognitive radio. The problem is formalized as an Integer Linear Programming (ILP) problem and solved through an optimization method in the beginning. The simulation results show that the ILP based method has a good performance. However, it is difficult to evaluate the solution theoretically. A heuristic scheduling algorithm with guaranteed latency bound is presented in our further investigation. Finally, we investigate how to make use of cognitive radio capability to accelerate data aggregation in probabilistic wireless networks with lossy links. A two-phase scheduling algorithm is proposed, and the effectiveness of the algorithm is verified through both theoretical analysis and numerical simulations

Non-Metaheuristic Clustering Algorithms for Energy-Efficient Cooperative Communication in Wireless Sensor Networks: A Comparative Study

 Wireless Sensor Networks (WSNs) are now considered a vital technology that enables the gathering and distribution of data in various applications, such as environmental monitoring and industrial automation. Nevertheless, the finite energy resources of sensor nodes pose significant obstacles to the long-term viability and effectiveness of these networks. Researchers have developed and studied various non-meta algorithms to improve energy efficiency, data transfer, and network lifespan. These efforts contribute to enhancing cooperative communication modules. This analysis conducts a detailed examination and comparative evaluation of different well-known clustering methods in the field of Wireless Sensor Networks (WSNs), providing significant insights for improving cooperative communication. Our purpose is to provide a comprehensive perspective on the contributions of these algorithms to improving energy efficiency in WSNs. This will be achieved by examining their practical implementations, underlying mathematical principles, strengths, shortcomings, real-world applications, and potential for further improvement

Adaptive Transmission Range Based Topology Control Scheme for Fast and Reliable Data Collection

An Adaptive Transmission Range Based Topology Control (ATRTC) scheme is proposed to reduce delay and improve reliability for data collection in delay and loss sensitive wireless sensor network. The core idea of the ATRTC scheme is to extend the transmission range to speed up data collection and improve the reliability of data collection.The main innovations of our work are as follows: (1) an adaptive transmission range adjustment method is proposed to improve data collection reliability and reduce data collection delay. The expansion of the transmission range will allow the data packet to be received by more receivers, thus improving the reliability of data transmission. On the other hand, by extending the transmission range, data packets can be transmitted to the sink with fewer hops.Thereby the delay of data collection is reduced and the reliability of data transmission is improved. Extending the transmission range will consume more energy. Fortunately, we found the imbalanced energy consumption of the network.There is a large amount of energy remains when the network died. ATRTC scheme proposed in this paper can make full use of the residual energy to extend the transmission range of nodes. Because of the expansion of transmission range, nodes in the network form multiple paths for data collection to the sink node.Therefore, the volume of data received and sent by the near-sink nodes is reduced, the energy consumption of the near-sink nodes is reduced, and the network lifetime is increased as well. (2)According to the analysis in this paper, compared with the CTPR scheme, the ATRTC scheme reduces the maximum energy consumption by 9%, increases the network lifetime by 10%, increases the data collection reliability by 7.3%, and reduces the network data collection time by 23%

Perceptually Important Points-Based Data Aggregation Method for Wireless Sensor Networks

يستهلك إرسال واستقبال البيانات معظم الموارد في شبكات الاستشعار اللاسلكية (WSNs). تعد الطاقة التي توفرها البطارية أهم مورد يؤثر على عمر WSN في عقدة المستشعر. لذلك، نظرًا لأن عُقد المستشعر تعمل بالاعتماد على بطاريتها المحدودة ، فإن توفير الطاقة ضروري. يمكن تعريف تجميع البيانات كإجراء مطبق للقضاء على عمليات الإرسال الزائدة عن الحاجة ، ويوفر معلومات مدمجة إلى المحطات الأساسية ، مما يؤدي بدوره إلى تحسين فعالية الطاقة وزيادة عمر الشبكات اللاسلكية ذات للطاقة المحدودة. في هذا البحث ، تم اقتراح طريقة تجميع البيانات المستندة إلى النقاط المهمة إدراكيًا (PIP-DA) لشبكات المستشعرات اللاسلكية لتقليل البيانات الزائدة عن الحاجة قبل إرسالها إلى المحطة الاساسية. من خلال استخدام مجموعة بيانات Intel Berkeley Research Lab (IBRL) ، تم قياس كفاءة الطريقة المقترحة. توضح النتائج التجريبية فوائد الطريقة المقترحة حيث تعمل على تقليل الحمل على مستوى عقدة الاستشعار حتى 1.25٪ في البيانات المتبقية وتقليل استهلاك الطاقة حتى 93٪ مقارنة ببروتوكولات PFF و ATP.The transmitting and receiving of data consume the most resources in Wireless Sensor Networks (WSNs). The energy supplied by the battery is the most important resource impacting WSN's lifespan in the sensor node. Therefore, because sensor nodes run from their limited battery, energy-saving is necessary. Data aggregation can be defined as a procedure applied for the elimination of redundant transmissions, and it provides fused information to the base stations, which in turn improves the energy effectiveness and increases the lifespan of energy-constrained WSNs. In this paper, a Perceptually Important Points Based Data Aggregation (PIP-DA) method for Wireless Sensor Networks is suggested to reduce redundant data before sending them to the sink. By utilizing Intel Berkeley Research Lab (IBRL) dataset, the efficiency of the proposed method was measured. The experimental findings illustrate the benefits of the proposed method as it reduces the overhead on the sensor node level up to 1.25% in remaining data and reduces the energy consumption up to 93% compared to prefix frequency filtering (PFF) and ATP protocols

Data aggregation in wireless sensor networks

Energy efficiency is an important metric in resource constrained wireless sensor networks (WSN). Multiple approaches such as duty cycling, energy optimal scheduling, energy aware routing and data aggregation can be availed to reduce energy consumption throughout the network. This thesis addresses the data aggregation during routing since the energy expended in transmitting a single data bit is several orders of magnitude higher than it is required for a single 32 bit computation. Therefore, in the first paper, a novel nonlinear adaptive pulse coded modulation-based compression (NADPCMC) scheme is proposed for data aggregation. A rigorous analytical development of the proposed scheme is presented by using Lyapunov theory. Satisfactory performance of the proposed scheme is demonstrated when compared to the available compression schemes in NS-2 environment through several data sets. Data aggregation is achieved by iteratively applying the proposed compression scheme at the cluster heads. The second paper on the other hand deals with the hardware verification of the proposed data aggregation scheme in the presence of a Multi-interface Multi-Channel Routing Protocol (MMCR). Since sensor nodes are equipped with radios that can operate on multiple non-interfering channels, bandwidth availability on each channel is used to determine the appropriate channel for data transmission, thus increasing the throughput. MMCR uses a metric defined by throughput, end-to-end delay and energy utilization to select Multi-Point Relay (MPR) nodes to forward data packets in each channel while minimizing packet losses due to interference. Further, the proposed compression and aggregation are performed to further improve the energy savings and network lifetime --Abstract, page iv

Reliable load-balancing routing for resource-constrained wireless sensor networks

Wireless sensor networks (WSNs) are energy and resource constrained. Energy limitations make it advantageous to balance radio transmissions across multiple sensor nodes. Thus, load balanced routing is highly desirable and has motivated a significant volume of research. Multihop sensor network architecture can also provide greater coverage, but requires a highly reliable and adaptive routing scheme to accommodate frequent topology changes. Current reliability-oriented protocols degrade energy efficiency and increase network latency. This thesis develops and evaluates a novel solution to provide energy-efficient routing while enhancing packet delivery reliability. This solution, a reliable load-balancing routing (RLBR), makes four contributions in the area of reliability, resiliency and load balancing in support of the primary objective of network lifetime maximisation. The results are captured using real world testbeds as well as simulations. The first contribution uses sensor node emulation, at the instruction cycle level, to characterise the additional processing and computation overhead required by the routing scheme. The second contribution is based on real world testbeds which comprises two different TinyOS-enabled senor platforms under different scenarios. The third contribution extends and evaluates RLBR using large-scale simulations. It is shown that RLBR consumes less energy while reducing topology repair latency and supports various aggregation weights by redistributing packet relaying loads. It also shows a balanced energy usage and a significant lifetime gain. Finally, the forth contribution is a novel variable transmission power control scheme which is created based on the experience gained from prior practical and simulated studies. This power control scheme operates at the data link layer to dynamically reduce unnecessarily high transmission power while maintaining acceptable link reliability

Data Management and Wireless Transport for Large Scale Sensor Networks

Today many large scale sensor networks have emerged, which span many different sensing applications. Each of these sensor networks often consists of millions of sensors collecting data and supports thousands of users with diverse data needs. Between users and wireless sensors there are often a group of powerful servers that collect and process data from sensors and answer users\u27 requests. To build such a large scale sensor network, we have to answer two fundamental research problems: i) what data to transmit from sensors to servers? ii) how to transmit the data over wireless links? Wireless sensors often can not transmit all collected data due to energy and bandwidth constraints. Therefore sensors need to decide what data to transmit to best satisfy users\u27 data requests. Sensor network users can often tolerate some data errors, thus sensors may transmit data in lower fidelity but still satisfy users\u27 requests. There are generally two types of requests-raw data requests and meta-data requests. To answer users\u27 raw data requests, we propose a model-driven data collection approach, PRESTO. PRESTO splits intelligence between sensors and servers, i.e., resource-rich servers perform expensive model training and resource-poor sensors perform simple model evaluation. PRESTO can significantly reduce data to be transmitted without sacrificing service quality. To answer users\u27 meta-data request, we propose a utility-driven multi-user data sharing approach, MUDS. MUDS uses utility function to unify diverse meta-data metrics. Sensors estimate utility value of each data packet and sends packets with highest utility first to improve overall system utility. After deciding what data to transmit from sensors to servers, the next question is how to transmit these data over wireless links. Wireless transport often suffers low bandwidth and unstable connectivity. In order to improve wireless transport, I propose a clean-slate re-design of wireless transport, Hop. Hop uses reliable perhop block transfer as a building block and builds all other components including hidden-terminal avoidance, congestion avoidance, and end-to-end reliability on top of it. Hop is built based on three key ideas: a) hop-by-hop transfer adapts to the lossy and highly variable nature of wireless channel significantly better than end-to-end transfer, b) the use of blocks as the unit of control is more efficient over wireless links than the use of packets, and c) the duplicated functionality in different layers in the network stack should be removed to simplify the protocol and avoid complex interaction

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

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