A wireless token ring protocol for ad-hoc networks

Lee, D.; Puri, Anuj; Varaiya, Pravin; Sengupta, Raja; Attias, R.; Tripakis, Stavros

doi:10.1109/aero.2002.1035254

Cited by 28 publications

(22 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Token ring protocols have been studied for application to mobile ad hoc networks (MANETs) [7], [8]. The work described in [7] is limited to the study of several algorithms that permit a token to circulate amongst all members of a graph.…”

Section: Attributes Of M-rbpmentioning

confidence: 99%

“…The work described in [7] is limited to the study of several algorithms that permit a token to circulate amongst all members of a graph. WTRP [8] was developed for communication between unmanned vehicles. To provide bandwidth guarantees, each source is only permitted to transmit source messages in a time slot assigned by its position in the token ring.…”

Section: Attributes Of M-rbpmentioning

confidence: 99%

See 1 more Smart Citation

Reliable Collaborative Decision Making in Mobile Ad Hoc Networks

Willke

Maxemchuk

2004

Management of Multimedia Networks and Services

View full text Add to dashboard Cite

Abstract.Mobile units, such as vehicles in a traffic flow or robots in a factory, may use sensors to interact with their environment and a radio to communicate with other autonomous units in the local area. Collaborative decision making can be carried out through information sharing amongst these units and result in cooperative problem solving. Examples of solutions include coordinated vehicle control for collision avoidance and executing complementary path plans for robots on a factory floor. We propose an application-level protocol that enables units to contribute their local knowledge and actions to a shared global view of the problem space. The protocol uses a time-driven token ring architecture to permit any unit to reliably broadcast a message to the entire group. The protocol ensures that all units commit the same set of received messages in the same order by a deadline, and it upholds these guarantees in the presence of channel failures, hidden units, and a changing set of collaborators. Units in the network are made aware of when others fail to maintain the global view. Failing units may be required to operate autonomously, pending information recovery.

show abstract

Section: Attributes Of M-rbpmentioning

confidence: 99%

Section: Attributes Of M-rbpmentioning

confidence: 99%

Reliable Collaborative Decision Making in Mobile Ad Hoc Networks

Willke

Maxemchuk

2004

Management of Multimedia Networks and Services

View full text Add to dashboard Cite

show abstract

“…Wireless Token Ring Protocol (WTRP) is a medium-access-control (MAC) protocol with advantages such as robustness against single node failure, and support for flexible topologies, in which nodes may be partially connected [13-15, 30, 31]. Lee et al [30,31] presented a WTRP for ad hoc networks and an intelligent transportation system. Xianpu et al [44] showed a dynamic token protocol for Mobile Ad Hoc Network (MANET) where all nodes in the network are clustered into several subnets, whose functions are the same as the logic token rings in WTRP.…”

Section: Introductionmentioning

confidence: 99%

“…A wireless ring is a structure for applications running on wireless sensor networks that provide quality of service [13,[30][31][32]34]. Wireless Token Ring Protocol (WTRP) is a medium-access-control (MAC) protocol with advantages such as robustness against single node failure, and support for flexible topologies, in which nodes may be partially connected [13-15, 30, 31].…”

Section: Introductionmentioning

confidence: 99%

Centdian Computation in Cactus Graphs

Ben‐Moshe¹,

Dvir²,

Segal³

et al. 2012

JGAA

View full text Add to dashboard Cite

This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a convex combination of two QoS requirements: transport and delay. To the best of our knowledge, no efficient algorithm has yet been developed for constructing a centdian node in a cactus graph, either sequential or distributed. We first investigate the properties of the centdian node in a cycle graph, and then explore the behavior of the centdian node in a cactus graph. Finally, we present new efficient sequential and distributed algorithms for finding all centdian nodes in a cycle graph and a cactus graph.

show abstract

“…While Blackburst is effective at providing a prioritized communication scheme for more generic scenarios, RI-EDF provides a real-time guarantee with improved throughput for applications with mainly periodic traffic. Lee et al presented a wireless token ring protocol [9] in which a token passed from node to node reduces contention on the medium. However, this approach is not conducive to applications demanding energy-efficiency as nodes must monitor all traffic for implicit acknowledgment of the token.…”

Section: Related Workmentioning

confidence: 99%

A Robust Implicit Access Protocol for Real-Time Wireless Collaboration

Crenshaw

Tirumala

Hoke

et al.

17th Euromicro Conference on Real-Time Systems (ECRTS'05)

View full text Add to dashboard Cite

Advances in wireless technology have brought us closer to extensive deployment of distributed real-time embedded systems connected through a wireless channel. The medium access control (MAC) layer protocol is critical in providing a real-time guarantee. We have devised a real-time wireless MAC protocol which, demonstrated in both simulations and implementation, provides better throughput than existing protocols and predictable temporal behavior with minimal impact on node failures, packet losses and noise in the channel.

show abstract

A wireless token ring protocol for ad-hoc networks

Cited by 28 publications

References 4 publications

Reliable Collaborative Decision Making in Mobile Ad Hoc Networks

Reliable Collaborative Decision Making in Mobile Ad Hoc Networks

Centdian Computation in Cactus Graphs

A Robust Implicit Access Protocol for Real-Time Wireless Collaboration

Contact Info

Product

Resources

About