Minimize end-to-end delay through cross-layer optimization in multi-hop wireless sensor networks

End-to-end delay plays a very important role in wireless sensor networks. It refers to the total time taken for a single packet to be transmitted across a network from source to destination. There are many factors could affect the end-to-end delay, among them the routing path and the interference level along the path are the two basic elements that could have significant influence on the result of the end-to-end delay. This thesis presents a transmission scheduling scheme that minimizes the end-to-end delay when the node topology is given. The transmission scheduling scheme is designed based on integer linear programming and the interference modeling is involved. By using this scheme, we can guarantee that no conflicting transmission will appear at any time during the transmission. A method of assigning the time slot based on the given routing is presented. The simulation results show that the link scheduling scheme can significantly reduce the end-to-end delay. Further, this article also shows two methods which could directly addresses routing and slot assignment, one is MI+MinDelay algorithm and the other is called One-Phase algorithm. A comparison was made between the two and the simulation result shows the latter one leads to smaller latency while it takes much more time to be solved. Besides, due to the different routing policy, we also demonstrate that the shortest path routing does not necessarily result in minimum end-to-end delay --Abstract, page ii

Aggregation Scheduling Algorithms in Wireless Sensor Networks

In Wireless Sensor Networks which consist of tiny wireless sensor nodes with limited battery power, one of the most fundamental applications is data aggregation which collects nearby environmental conditions and aggregates the data to a designated destination, called a sink node. Important issues concerning the data aggregation are time efficiency and energy consumption due to its limited energy, and therefore, the related problem, named Minimum Latency Aggregation Scheduling (MLAS), has been the focus of many researchers. Its objective is to compute the minimum latency schedule, that is, to compute a schedule with the minimum number of timeslots, such that the sink node can receive the aggregated data from all the other nodes without any collision or interference. For the problem, the two interference models, the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR), have been adopted with different power models, uniform-power and non-uniform power (with power control or without power control), and different antenna models, omni-directional antenna and directional antenna models. In this survey article, as the problem has proven to be NP-hard, we present and compare several state-of-the-art approximation algorithms in various models on the basis of latency as its performance measure

A distributed delay-efficient data aggregation scheduling for duty-cycled WSNs

With the growing interest in wireless sensor networks (WSNs), minimizing network delay and maximizing sensor (node) lifetime are important challenges. Since the sensor battery is one of the most precious resources in a WSN, efficient utilization of the energy to prolong the network lifetime has been the focus of much of the research on WSNs. For that reason, many previous research efforts have tried to achieve tradeoffs in terms of network delay and energy cost for such data aggregation tasks. Recently, duty-cycling technique, i.e., periodically switching ON and OFF communication and sensing capabilities, has been considered to significantly reduce the active time of sensor nodes and thus extend network lifetime. However, this technique causes challenges for data aggregation. In this paper, we present a distributed approach, named distributed delay efficient data aggregation scheduling (DEDAS-D) to solve the aggregation-scheduling problem in duty-cycled WSNs. The analysis indicates that our solution is a better approach to solve this problem. We conduct extensive simulations to corroborate our analysis and show that DEDAS-D outperforms other distributed schemes and achieves an asymptotic performance compared with centralized scheme in terms of data aggregation delay.N/

Flexible Congestion Management for Error Reduction in Wireless Sensor Networks

The dissertation is concerned with the efficient resolution of data congestion on wireless sensor networks (WSNs). WSNs are of increasing relevance due to their applications in automation, industrial processes, natural-disaster detection, weather prediction, and climate monitoring. In large WSNs where measurements are periodically made at each node in the network and sent in a multi-hop fashion via the network tree to a single base-station node, the volume of data at a node may exceed the transmission capabilities of the node. This type of congestion can negatively impact data accuracy when packets are lost in transmission. We propose flexible congestion management for sensor networks (FCM) as a data-collection scheme to reduce network traffic and minimize the error resulting from data-volume reduction. FCM alleviates all congestion by lossy data fusion, encourages opportunistic fusion with an application-specific distortion tolerance, and balances network traffic. We consider several data-fusion methods including the k-means algorithm and two forms of adaptive summarization. Additional fusion is allowed when like data may be fused with low error up to some limit set by the user of the data-collection application on the network. Increasing the error limit tends to reduce the overall traffic on the network at the cost of data accuracy. When a node fuses more data than is required to alleviate congestion, its siblings are notified that they may increase the sizes of their transmissions accordingly. FCM is further improved to re-balance the network traffic of subtrees such that subtrees whose measurements have lower variance may decrease their output rates while subtrees whose measurements have higher variance may increase their output rates, while still addressing all congestion in the network. We verify the effectiveness of FCM with extensive simulations