A reliable data transport protocol for partitioned actors in Wireless Sensor and Actor Networks

Handigol, Nikhil; Selvaradjou, Ka.; Murthy, C. Siva Ram

doi:10.1109/hipc.2010.5713174

Cited by 7 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It simultaneously addresses the objectiveness of both congestion congestion control and timely event transport reliability in WSNs. Because the actor–actor communication (AAC) is an important requirement for the timely responses to events reported by the sensors, an energy efficient actor–actor reliable transport protocol for WSNs is proposed in , to provide effective AAC in case that actor nodes get partitioned. It consists of a transport wrapper and a dynamic priority scheduler, and achieves high reliability with minimum retransmissions under both static and dynamic network topology conditions.…”

Section: Related Workmentioning

confidence: 99%

“…As research in multimedia sensor networks is currently going on, it is commonly recognized that applicationspecific requirements such as real-time delivery should be defined as well as supported by the networks. With corresponding to the needs above, numerous approaches [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20] have been proposed to employ validated previous related works in wireless sensor networks. However, because a sensor node has several rigid constraints such as error-prone wireless communication and low computing power, we need significant changes or modifications therein.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Modeling and routing scheme for (m,k)-firm streams in wireless multimedia sensor networks

Kim

Sung

2013

Wirel. Commun. Mob. Comput.

View full text Add to dashboard Cite

In this paper, we propose a novel scheme of how to efficiently and reliably deliver multimedia real-time streams in wireless sensor networks. To specify the property of streams, a multimedia stream is modeled as an (m,k)-firm stream that is known to have the characteristics of weakly hard real-time system. In addition, a distributed, measurement-based routing scheme for (m,k)-firm streams is newly proposed while considering several constraints on node as well as on communication medium. Simulations and their analysis are provided to validate the suitability of traffic modeling, reduced dynamic failure probability, and extended network lifetime when the proposed routing protocol is employed.As motivated by the aforementioned needs, we consider the (m,k)-firm model [21] in wireless sensor networks. A real-time stream with the (m,k)-firm guarantee requirement demands that at least m out of any k consecutive packets in this stream must meet their respective deadline. Two well-known examples for a (m,k)-firm stream are video and audio streams, because they are tolerant to packet loss but sensitive to real-time delivery. The concept of (m,k)-firm is appropriate for wireless sensor networks due to minimum requirement and its inevitable packet loss. Packet loss is naturally expected because of the poor wireless connectivity and bandwidth constraints on wireless sensor networks. Despite of the apparent suitability of the model, to the best of the authors' knowledge, the research in [16] has been only addressed to date except for the schemes developed by our research group [22,23].Although our previous work was proposed to introduce and support a (m,k)-firm model in wireless multimedia sensor networks, our contribution was limited to develop the appropriate scheduling for the traffic model. Thus, in consequence of our achievements, we propose a scheme on how to efficiently and reliably model a (m,k)-firm traffic in wireless multimedia sensor networks and employ routing algorithm to guarantee real-time delivery. In the proposed scheme, both m and k values are determined by the density

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Modeling and routing scheme for (m,k)-firm streams in wireless multimedia sensor networks

Kim

Sung

2013

Wirel. Commun. Mob. Comput.

View full text Add to dashboard Cite

show abstract

“…Actor-actor reliable transport protocol (A 2 RT) [17] seeks to provide realtime and reliable data delivery between partitioned resource-rich actor nodes whose connectivity is bridged by resource-constrained sensor nodes. Caching of packets at actor nodes improves the performance, compared with end-to-end reliability.…”

Section: Transport Protocolsmentioning

confidence: 99%

Routing metrics for cache-based reliable transport in wireless sensor networks

Grilo

Heidrich

2013

J Wireless Com Network

View full text Add to dashboard Cite

The Internet of Things (IoT) will bring the pervasive networking of objects, integrating different technologies that will interconnect nodes with heterogeneous capabilities and resources. Although radio-frequency identification will likely play a major role in the IoT, it is not the only one. Wireless sensor networks (WSN) will likely become the paradigm for communication of more powerful nodes in the IoT. The energy and bandwidth constraints of WSNs have motivated the development of new reliable transport protocols in which intermediate nodes are able to cache packets and to retransmit them to the destination in the course of the end-to-end packet recovery process (e.g., pump slowly fetch quickly, reliable multi-segment transport, distributed TCP caching, distributed transport for sensor networks (DTSN)). These protocols use memory resources at the intermediate nodes to achieve lower energy consumption, higher goodput, and lower delay. In a heterogeneous IoT environment, nodes are likely to differ greatly in terms of memory capacity, ranging from almost memoryless tags to more powerful sensors/actuators. Consequently, network nodes will present different eligibilities to support the reliable transport functions, which must be taken into account when setting up routes. The ability to select paths formed by cache-rich nodes becomes essential to maximize network performance and increase energy efficiency. This paper proposes new routing metrics related with the availability of the transport-layer cache at intermediate nodes. A cross-layer protocol architecture is also proposed to support those metrics as well as to integrate legacy metrics such as hop distance and link quality. Simulation results based on the DTSN transport protocol demonstrate that the proposed metrics and cross-layer architecture are essential to leverage the transport layer error recovery mechanism, resulting in increased energy efficiency

show abstract

A Cluster-Based Coordination and Communication Framework Using GA for WSANs

Kumar

Ranga

2014

Lecture Notes in Electrical Engineering

View full text Add to dashboard Cite

A reliable data transport protocol for partitioned actors in Wireless Sensor and Actor Networks

Cited by 7 publications

References 12 publications

Modeling and routing scheme for (m,k)-firm streams in wireless multimedia sensor networks

Modeling and routing scheme for (m,k)-firm streams in wireless multimedia sensor networks

Routing metrics for cache-based reliable transport in wireless sensor networks

A Cluster-Based Coordination and Communication Framework Using GA for WSANs

Contact Info

Product

Resources

About