A distributed media access protocol for packet radio networks and performance analysis. Part 2: Network set‐up time and data rate

Pond, L.C.; Li, Victor O. K.

doi:10.1002/dac.4500080105

Cited by 5 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Distributed time slot assignment is not a new topic for wireless networks. DTSAP (Dynamic Distributed Time Slot Assignment Protocol) [6][7][8], FPRP (Five-Phase Reservation Protocol for Mobile Ad Hoc Networks) [9], E-TDMA (Evolutionary-TDMA Scheduling Protocol) [10], HRMA (Hop-Reservation Multiple Access) [11] are examples of distributed scheduling protocols for ad hoc networks. Most of the ad hoc network algorithms are developed for peer to peer data traffic.…”

Section: Introductionmentioning

confidence: 99%

A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic

Bekmezci

Alagöz

2017

JCOMSS

View full text Add to dashboard Cite

The scarcest resource for most of the wireless sensor networks (WSNs) is energy and one of the major factors inenergy consumption for WSNs is due to communication. Notonly transmission but also reception is the source of energyconsumption. The lore to decrease energy consumption is toturn off radio circuit when it is not needed. This is why TDMA has advantages over contention based methods. Time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, centralized approach is not scalable. In this paper, a new energy efficient and delay sensitive distributed time slot assignment algorithm (DTSM) is proposed for sensor networks under convergecast traffic pattern. DTSM which is developed as part of the military monitory (MILMON) system introduced in [27], aims to operate with low delay and low energy. Instead of collision based periods, it assigns slots by the help of tiny request slots. While traditional slot assignment algorithms do not allow assigning the same slot within two hop neighbors, because of the hidden node problem, DTSM can assign, if assignment is suitable for convergecast traffic. Simulation results have shown that delay and energy consumption performance of DTSM is superior to FPRP, DRAND, and TRAMA which are the most known distributed slot assignment protocols for WSNs or ad hoc networks. Although DTSM has somewhat long execution time, itsscalability characteristic may provide application specific time durations.

show abstract

Section: Introductionmentioning

confidence: 99%

A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic

Bekmezci

Alagöz

2017

JCOMSS

View full text Add to dashboard Cite

show abstract

“…Distributed time slot assignment is not a new topic for wireless networks. DTSAP (Dynamic Distributed Time Slot Assignment Protocol) [10][11][12], FPRP (Five-Phase Reservation Protocol for Mobile Ad Hoc Networks) [13], E-TDMA (Evolutionary-TDMA Scheduling Protocol) [14], HRMA (Hop-Reservation Multiple Access) [15] are examples of distributed scheduling protocols for ad hoc networks. Most of the ad hoc network algorithms are developed for peer-to-peer data traffic.…”

Section: Introductionmentioning

confidence: 99%

Delay Sensitive, Energy Efficient and Fault Tolerant Distributed Slot Assignment Algorithm for Wireless Sensor Networks under Convergecast Data Traffic

Bekmezci

Alagöz

2009

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The scarcest resource for most of the wireless sensor networks (WSNs) is energy and the major factor in energy consumption for WSNs is communication. Not only transmission, but also reception is the source of energy consumption. The lore to decrease energy consumption is to turn off the radio circuit when it is not needed. This is why TDMA is advantageous over contention based methods. A time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, a centralized approach is not scalable. In this article, a new energy efficient, delay sensitive, and fault tolerant distributed time slot assignment algorithm, referred to as ft_DTSM, is proposed for sensor networks under convergecast traffic pattern. ft_DTSM aims at operating with low delay and low energy under faulty nodes assumption. Instead of random access based periods, it assigns slots with the help of tiny request slots. While traditional slot assignment algorithms do not allow assigning the same slot within two hop neighbors, because of the hidden node problem, ft_DTSM can assign, if the assignment is suitable for convergecast traffic. Simulation results have shown that both delay and energy consumption performances of ft_DTSM is superior to existing distributed slot assignment protocols for WSNs. ft_DTSM can also distribute the slots so that the network can continue its operation against a single point of failure. Although ft_DTSM has a somewhat longer execution time, its scalability characteristic may provide application specific time durations.

show abstract

“…In Pond and Li[5,6], a hierarchical architecture for a distributed media access protocol is developed for the US Army's Enhanced Position Location and %porting System (EPLRS) [7]. Again, the goal is to capture the advantage of reduced overhead available with a quasktationary infrastructure.…”

Section: Quasi-stationary Infrastructuresmentioning

confidence: 99%

Vertex-Linked Infrastructure for ADHOC Networks

Emerging Location Aware Broadband Wireless Ad Hoc Networks

View full text Add to dashboard Cite

An ad hoc network is composed of geographically dispersed nodes that may move arbitrarily and communicate with each other without the supporc of a stationary infrastructure. Compared with a wireless network with a stationary infrastructure, such as a cellular network, an ad hoc network is inherently less efficient. Therefore, a number of proposals have been made to develop a quasktationary infrastructure for ad hoc networks. However, the dynamic nature of id hoc networks makes it very costly to maintain such an infrastructure. This article proposes a VertexLinked Infrastructure (VLI) for ad hoc networks. This novel approach uses an easily deployable, survivable, wired infrastructure as a backbone of the ad hoc network, thus realizing the advantages of an infrastructure in wireless communications, but without the overhead due to maintaining such an infrastructure.

show abstract

A distributed media access protocol for packet radio networks and performance analysis. Part 2: Network set‐up time and data rate

Cited by 5 publications

References 4 publications

A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic

A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic

Delay Sensitive, Energy Efficient and Fault Tolerant Distributed Slot Assignment Algorithm for Wireless Sensor Networks under Convergecast Data Traffic

Vertex-Linked Infrastructure for ADHOC Networks

Contact Info

Product

Resources

About