English
Related papers

Related papers: A Distributed and Deterministic TDMA Algorithm for…

200 papers

Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule transmission in slots to avoid collision, however these methods often lack…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 T. Herman , S. Tixeuil

Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, $\xi$, and then combine them into frames of uniform…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-03-26 Thomas Petig , Elad M. Schiller , Philippas Tsigas

It is well known that biology-inspired self-maintaining algorithms in wireless sensor nodes achieve near optimum time division multiple access (TDMA) characteristics in a decentralized manner and with very low complexity. We extend such…

Networking and Internet Architecture · Computer Science 2012-05-18 Dujdow Buranapanichkit , Yiannis Andreopoulos

Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any kind and any finite number of transient faults. This…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-07 Hirotsugu Kakugawa , Sayaka Kamei , Masahiro Shibata , Fukuhito Ooshita

This paper proposes a Time Division Multiple Access (TDMA) MAC slot allocation protocol with efficient bandwidth usage in wireless sensor networks and Internet of Things (IoTs). The developed protocol has two primary components: a…

Networking and Internet Architecture · Computer Science 2023-02-13 Hrishikesh Dutta , Amit Kumar Bhuyan , Subir Biswas

One of the major challenges in wireless sensor networks (WSNs) is the mitigation of collisions due to simultaneous transmissions by multiple nodes over a common channel which are located in a proximity. TDMA-based channel access provides…

Networking and Internet Architecture · Computer Science 2020-02-04 Ashutosh Bhatia , R. C. Hansdah

Desynchronization approaches in wireless sensor networks converge to time-division multiple access (TDMA) of the shared medium without requiring clock synchronization amongst the wireless sensors, or indeed the presence of a central…

Networking and Internet Architecture · Computer Science 2015-06-23 Dujdow Buranapanichkit , Nikos Deligiannis , Yiannis Andreopoulos

In large-scale resource-constrained wireless networks, such as those prevalent in the Internet of Things (IoT), efficient communication scheduling remains a critical challenge. Among the various approaches, Time Division Multiple Access…

Networking and Internet Architecture · Computer Science 2026-01-07 Hicham Lakhlef , Mohamed Ali Zormati , Khaled Abid , Toufik Ahmed

In dynamic wireless ad-hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC…

Networking and Internet Architecture · Computer Science 2013-08-30 Pierre Leone , Elad M. Schiller

This paper has been withdrawn by arXiv. arXiv admin note: author list truncated due to disputed authorship and content. This submission repeats large portions of text from this http URL by other authors. Duty cycle mode in WSN improves…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-04-30 Rajeev K. Shakya

Packet transmission scheduling on multi-hop wireless sensor networks with 3-egress gateway linear topology is studied. Each node generates a data packet in every one cycle period and forwards it bounded for either of gateways at edges. We…

Networking and Internet Architecture · Computer Science 2021-02-11 Linh Vu Nguyen , Nguyen Viet Ha , Masahiro Shibata , Masato Tsuru

By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a MAC with optimal long-run throughput that is almost…

Networking and Internet Architecture · Computer Science 2013-09-19 Minyu Fang , David Malone , Ken R. Duffy , Douglas J. Leith

The present work considers the localization problem in wireless sensor networks formed by fixed nodes. Each node seeks to estimate its own position based on noisy measurements of the relative distance to other nodes. In a centralized batch…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-19 Gemma Morral , Pascal Bianchi

Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can…

Networking and Internet Architecture · Computer Science 2019-11-13 Jian Ni , Bo Tan , R. Srikant

It was shown recently that CSMA (Carrier Sense Multiple Access)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing networks) under certain assumptions. One important, but idealized…

Networking and Internet Architecture · Computer Science 2016-11-18 Libin Jiang , Jean Walrand

Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower…

Information Theory · Computer Science 2018-04-03 Chuan Zhang , Chao Yang , Wei Xu , Shunqing Zhang , Zaichen Zhang , Xiaohu You

This paper introduces the Discrete Dithered Desynchronization (D3sync) algorithm which is a decentralized Time Division Multiple Access (TDMA) technique in which a set of network nodes computes iteratively a conflict-free schedule so that…

Networking and Internet Architecture · Computer Science 2012-10-09 Saman Ashkiani , Anna Scaglione

The described multicoloring problem has direct applications in the context of wireless ad hoc and sensor networks. In order to coordinate the access to the shared wireless medium, the nodes of such a network need to employ some medium…

Discrete Mathematics · Computer Science 2009-02-12 Fabian Kuhn

A swarm of quadcopters can perform cooperative tasks, such as monitoring of a large area, more efficiently than a single one. However, to be able to successfully work together, the quadcopters must be aware of the position of the other…

Robotics · Computer Science 2022-02-03 Sharif Azem , Anam Tahir , Heinz Koeppl

Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput-optimality, these algorithms can either…

Networking and Internet Architecture · Computer Science 2016-04-04 Mehmet Karaca , Bjorn Landfeldt
‹ Prev 1 2 3 10 Next ›