A Mutual Network Synchronization Method for Wireless Ad Hoc and Sensor Networks

Rentel, Carlos H.; Kunz, Thomas

doi:10.1109/tmc.2007.70787

Cited by 75 publications

(65 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Author [14] show that with high probability the error variance is O(1) as the number of nodes increase in the wireless network. Mutual network synchronization [15] is a key for distributed environment to keep sync network in which geographically separated clocks align their times to one another without the need of reference or master clocks in other word with mutual network synchronization the timing information is exchanged explicitly by using periodic time stamp packets to send theses packet can be send by same beacons used in the IEEE 802.11 or IEEE 802.15.4 Standards. Average Time Sync (ATS), for synchronizing a wireless sensor, this algorithm is based on a popular distributed algorithms known as consensus, agreement, gossip which implies with idea of averaging local information.…”

Section: Related Workmentioning

confidence: 99%

“…Average Time Sync (ATS), for synchronizing a wireless sensor, this algorithm is based on a popular distributed algorithms known as consensus, agreement, gossip which implies with idea of averaging local information. Author [16] proposed algorithm which extend ATS with three feature 1) It is fully distributed without node failure and to new node appearance. 2) It compensation clock skew, thus network synchronized for long periods than using simple clock offset compensation.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Clock Synchronization in IoTs Network through Cloud

Jha

Gupta

2017

IJMUE

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Clock Synchronization in IoTs Network through Cloud

Jha

Gupta

2017

IJMUE

View full text Add to dashboard Cite

show abstract

“…These assumptions are similar to those used in MAC protocols based on transmission scheduling. The time slotting needed in VCMA can be attained in practice using such distributed clock synchronization schemes as those demonstrated in the past by Rentel and Kunz [15] and Djukic and Mohapatra [16]. Though tight synchronization may be difficult and expensive to achieve in some networks, the protocol does not have any bounds on the slot duration used in the network .…”

Section: Related Workmentioning

confidence: 99%

VCMA: Efficient channel access in wireless mesh networks using virtual coordinates

Masilamani

Garcia-Luna-Aceves

2012

MILCOM 2012 - 2012 IEEE Military Communications Conference

View full text Add to dashboard Cite

Abstract-The Virtual Coordinate Multiple Access (VCMA) protocol is introduced and analyzed. VCMA is a medium access control protocol that defines transmissions schedules dynamically based on the assignment and exchange of virtual coordinates relative to an elected root node in a mesh network. VCMA is shown to attain feasible transmission schedules within a finite time, and its channel access delay properties are analyzed. The performance of the VCMA is compared with the performance of 802.11 DCF, which is a contention based MAC protocol; the five-phase reservation (FPRP) protocol, which is a schedule-based MAC protocol based on reserving time slots over fixed-length frames; and the node activation multiple access (NAMA) protocol, which is representative of distributed transmission scheduling based on probabilistic elections per slot. The performance comparison shows that VCMA attains much higher throughput than 802.11 DCF, FPRP or NAMA, and that it has lower variance in channel access intervals than contention-based schemes and schedulebased protocols based on probabilistic elections or reservations carried out in fixed-length frames.

show abstract

“…The time slotting needed in NOMAD and all prior MAC protocols based on transmission scheduling can be attained in practice using such distributed clock synchronization schemes as those demonstrated in the past by Rentel and Kunz [17] and Djukic and Mohapatra [18]. As such, the rest of this paper simply assumes that time slotting is available.…”

Section: Nomadmentioning

confidence: 99%

NOMAD: Deterministic collision-free channel access with channel reuse in wireless networks

Garcia-Luna-Aceves

Masilamani

2011

2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

View full text Add to dashboard Cite

Abstract-The Neighborhood Ordering for Medium Access with Determinism (NOMAD) protocol is introduced. NOMAD defines collision-free transmission schedules dynamically and with no need for a predefined number of time slots per transmission frame by coordinating circular permutations of the identifier of nodes in the neighborhoods shared among nodes. NOMAD is shown to attain feasible transmission schedules within a short finite time and to provide channel access intervals of negligible variance. The performance of the NOMAD is compared with the performance of 802.11 DCF and the node activation multiple access (NAMA) protocol, which is representative of distributed transmission scheduling based on probabilistic elections. NO-MAD is shown to attain higher throughput than 802.11 and NAMA in static and dynamic ad hoc networks, and to eliminate the large variances in channel access times present in contentionbased schemes and prior transmission-scheduling schemes that do not use reservations.

show abstract

A Mutual Network Synchronization Method for Wireless Ad Hoc and Sensor Networks

Cited by 75 publications

References 19 publications

Clock Synchronization in IoTs Network through Cloud

Clock Synchronization in IoTs Network through Cloud

VCMA: Efficient channel access in wireless mesh networks using virtual coordinates

NOMAD: Deterministic collision-free channel access with channel reuse in wireless networks

Contact Info

Product

Resources

About