Reliable congestion-aware information transport in wireless sensor networks (original) (raw)
Related papers
2010
A core functionality of Wireless Sensor Networks (WSNs) is to transport information from the network to the application/user. The evolvable application reliability requirements and the fluctuating perturbations lead to continuous deviation between the attained and desired reliability. Using an existing approach that guarantees a highest reliability is not appropriate for WSN as this over-provisioning wastes the most valuable resources, e.g., energy. In this paper, we present a new approach called as Tunable Reliability with Congestion Control for Information Transport (TRCCIT) in WSN. To provide probabilistically guaranteed tunable reliability TRCCIT implements localized techniques such as probabilistic adaptive retransmissions, hybrid acknowledgment and retransmission timer management. TRCCIT pro-actively alleviates the network congestion by opportunistically transporting the information on multiple paths. TRCCIT fulfills application reliability requirements in a localized way, which is desirable for scalability and adaptability to large scale WSNs. Simulation results show that TRCCIT provides tunable reliability and efficiently mitigates the congestion.
CRRT: Congestion-Aware and Rate-Controlled Reliable Transport in Wireless Sensor Networks
Ieice Transactions on Communications, 2009
For successful data collection in wireless sensor networks, it is important to ensure that the required delivery ratio is maintained while keeping a fair rate for every sensor. Furthermore, emerging high-rate applications might require complete reliability and the transfer of large volume of data, where persistent congestion might occur. These requirements demand a complete but efficient solution for data transport in sensor networks which reliably transports data from many sources to one or more sinks, avoids congestion and maintains fairness. In this paper, we propose congestion-aware and rate-controlled reliable transport (CRRT), an efficient and low-overhead data transport mechanism for sensor networks. CRRT uses efficient MAC retransmission to increase one-hop reliability and end-to-end retransmission for loss recovery. It also controls the total rate of the sources centrally, avoids the congestion in the bottleneck based on congestion notifications from intermediate nodes and centrally assigns the rate to the sources based on rate assignment policy of the applications. Performance of CRRT is evaluated in NS-2 and simulation results demonstrate the effectiveness of CRRT.
Reliable data transport and congestion control in wireless sensor networks
International Journal of Sensor Networks, 2008
Reliable data delivery and congestion control are two fundamental transport layer functions. Due to the specific characteristics of Wireless Sensor Networks (WSNs), traditional transport layer protocols (e.g. Transmission Control Protocol (TCP) and User Datagram Protocol (UDP)) that are widely used in the Internet may not be suitable for WSNs. In this paper, the characteristics of WSNs are reviewed and the requirements and challenges of reliable data transport over WSNs are presented. The issues with applying traditional transport protocols over WSNs are discussed. We then survey recent research progress in developing suitable transport protocols for WSNs. The proposed reliable data transport and congestion control protocols for WSNs are reviewed and summarised. Finally, we describe some future research directions of transport protocol in WSNs.
A Cache-Aware Congestion Control for Reliable Transport in Wireless Sensor Networks
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2018
Data caching and congestion control are two strategies that can enhance the transport reliability in constrained Wireless Sensor Networks. However, these two mechanisms are designed independently for most transport protocols developed for WSN. This work developed a new cache-aware congestion control mechanism for reliable transport. RT-CaCC utilizes cache management policies such as cache insertion, cache elimination and cache size to mitigate packet losses in the network while maximizing cache utilization and resource allocation. It uses two cache management policies for packet loss detection: implicit notifications and expiration of timeout. In addition, it utilizes congestion avoidance using cache-aware rate control mechanism employing transmission window limit as a function of cache size. Results showed that the RT-CaCC obtained significant improvement gain in terms of cache utilization , end-to-end delay and throughput performance specifically during high level of packet loss in the network.
AReIT: Adaptive Reliable Information Transport Protocol for Wireless Sensor Networks
2009
The reliable delivery of services in service oriented architectures often entails the underlying basis of having well structured system and communication network models. With the rapid proliferation of ad-hoc mode of communication, such as Wireless Sensor Networks (WSNs), the reliable delivery of services increasingly encounters new communication and also network perturbation challenges. Empirically the core of service delivery in WSN is information transport from the sensor nodes to the service via a sink node. In this work we classify the different services provided by the WSNs, and provide a reliable information transport protocol (AReIT) for enhanced service delivery. AReIT exploits the spatial and temporal redundancies inside the WSN to provide efficient adaptation for changing service requirement and evolving network conditions. Simulation results show that AReIT provides tunable reliability allowing to save expensive retransmissions while maintaining the reliability level desired by the service.
IEEE Transactions on Wireless Communications, 2018
Reliability of data transport in wireless sensor networks is critical in the presence of high packet loss level either due to link contentions or buffer congestions. Mechanisms such as intermediate caching and congestion control can enhance the reliability performance of transport protocols in the event of packet loss. However, these two mechanisms are designed independently for most cache-based transport protocols. In this paper, we developed a new reliable transport protocol with a cache-aware congestion control mechanism called RT-CaCC. RT-CaCC utilizes cache management policies such as cache insertion, cache elimination, and cache size allocation to mitigate packet losses in the network while maximizing cache utilization and bandwidth allocation. The protocol was evaluated in network topologies with different packet loss scenarios. Results showed that RT-CaCC obtained an average of 15%-38% improvement gain compared with baseline protocols. In addition, RT-CaCC consistently outperformed other cache-based transport protocols like distributed TCP caching and end-to-end reliable and congestion aware transport layer protocol in terms of cache utilization, end-to-end delay, and fairness metrics. Finally, the comparison between simulation and analytical results showed that there is an almost perfect match with the difference between curve points never exceeding 14% of the analytical cost.
2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2017
Data delivery in low power and lossy networks like Wireless Sensor Networks (WSN), which has a significant role in Internet of Things (IoT), is vital due to the high probability of packet loss due to wireless and constrained environment. Data caching and transmission rate control are independent ways of improving the performance of transport protocols in WSN by immediately responding to packet losses in the network. However, a suitable rate control for cache-based transport protocols is not yet investigated. This work developed a dynamic cache-aware rate control algorithm that uses a transmission window rate as a function of cache size allocation used by intermediate nodes and utilizes cache elimination policy to notify packet losses in the network. A baseline cache-based transport protocol called DTSN + is used to implement the rate control algorithm and evaluated under different network scenarios. Results show that the cache-aware approach improves the performance of the baseline transport protocol during high level of packet losses in the network in terms of cache utilization especially at lower cache size value. The algorithm also obtained outstanding throughput, transmission time and fairness performance as compared with original DTSN + and DTC protocols. In the future, these results can serve as an underlying support in designing a new cache-aware congestion control framework that can be integrated in a transport protocol to mitigate packet losses in WSN.
ISRN Sensor Networks, 2012
Design and implementation of wireless sensor Networks have gathered increased attention in recent years due to vast potential of sensor networks consisting of spatially distributed devices (motes) to cooperatively monitor physical or environmental conditions at different locations. Wireless sensor networks are built upon low cost nodes with limited battery (power), CPU clock (processing capacity), and memory modules (storage). Transport layer protocols applied to wireless sensor networks can handle the communications between the sink node and sensor nodes in upstream (sensor-to-sink) or downstream (sink-to-sensor) direction. In this paper, we present a comparative analysis of reliable and congestion aware transport layer protocols for wireless sensor networks and number of open issues that have to be carefully realized to make use of the wireless sensor networks more efficiently and to enhance their performance. We first list the characteristics of transport layer protocols. We then...
An Adaptive Redundancy-Based Mechanism for Fast and Reliable Data Collection in WSNs
2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012
Wireless sensor networks (WSNs) can be used for a variety of applications. For many applications, a high reliability and low delay are required. Due to lossy feature of wireless channel, providing a reliable communication is very challenging. The most frequently used approach for providing the reliability is to use the acknowledgement based retransmission mechanism which increases the end-to-end delay especially when the number of hops from a sensor to the sink node is large. In this paper, we propose a redundancy-based approach to provide a high reliability while maintaining a low end-to-end delay. The proposed mechanism uses a redundant transmission when a link is unreliable or the end-to-end delay requirement is strict. We implement the proposed mechanism on a wireless sensor network which consists of IRIS motes, and evaluate the performance of the proposed mechanism.
2014
The benefits of hop-by-hop transport protocols and in-network storage in intermittently connected networks are well known. However, due to the limitation on the storage capability of wireless sensor networks (WSNs), the hop-by-hop transport protocols based on in-network storage but without storage management are inappropriate to be used directly in intermittently connected WSNs. The absence of storage management leads to node storage overflow resulting in a degraded performance of the network. This paper introduces an efficient transport protocol, Dacksis, which provides end-toend reliability, congestion control and storage management for intermittently connected wireless sensor networks. The design of Dacksis is based on hop-by-hop transport and in-network storage, therefore, the system can react to detected network congestion quickly and can reduce the number of end-to-end packet retransmissions. The storage management feature of Dacksis saves node storage for unconfirmed packets, which decreases the possibility of buffer overflow and packet queuing time, and reduces energy spent on loss recovery. Dacksis forgoes link layer per-packet acknowledgments and transmits packets in blocks to reduce energy consumption. The block size of Dacksis is dynamically determined before each hop-by-hop transmission to enhance the utilization of node storage. Y. Li et al. / Pervasive and Mobile Computing ( ) -mechanisms, which makes them unsuitable to be applied in intermittently connected wireless sensor networks directly. Transmission Control Protocol (TCP) is a canonical example of the end-to-end transport protocol. TCP takes advantage of packet loss as a sign of network congestion and relies on source nodes to provide loss recovery and congestion control. These characteristics of TCP tend to make it less appropriate in intermittently connected wireless sensor networks. First, many factors other than network congestion can cause packet loss in this type of networks, such as signal attenuation, energy exhaustion, and storage overflow. Hence, the congestion detection mechanism in TCP is insufficient to properly detect and react to the problems present in these networks. Second, TCP provides reliability and congestion control in an end-to-end manner, so it cannot react to the detected problems quickly in intermittently connected scenarios. Finally, TCP operations are mainly on the sender side. Therefore the energy of a sensor node could be drained quickly in intermittently connected wireless sensor networks due to the lack of a constant energy supply. Delay-tolerant networks (DTNs) [2], as one category of intermittently connected networks, have been extensively studied in the last decade. DTNs introduce the bundle layer that lies between the application layer and the transport layer in the DTN protocol stack. The bundle layer applies store-and-forward switching to overcome intermittent connections. Persistent storage is provided in the bundle layer for custody transfer to guarantee end-to-end reliability in intermittently connected scenarios. Custody transfer achieves end-to-end reliability by implementing hop-by-hop retransmission: a sender retransmits a bundle if it does not receive an acknowledgment from the next node that accepted the custody transfer before timeout. If there is no next node willing to accept the custody transfer, a sender needs to store bundles until an outbound link becomes available. The hop-by-hop transport and in-network storage successfully address the difficulties introduced by intermittent connection in DTNs. However, because of the limitation on the node storage of intermittently connected wireless sensor networks, the hop-by-hop transport and in-network storage techniques perform poorly without efficient storage management mechanisms.