Nimble and adaptive time-division multiple access control phase algorithm for cluster-based wireless sensor networks

2007 ◽  
Vol 1 (2) ◽  
pp. 179 ◽  
Author(s):  
J. Ma ◽  
K. Yang ◽  
S. Ou
Author(s):  
Eric E. Petrosky ◽  
Alan J. Michaels ◽  
Joseph M. Ernst

Low power, low cost, and security-conscious wireless sensor networks are becoming increasingly pervasive in the internet of things (IoT). In these networks, receiver-assigned code division multiple access (RA-CDMA) offers benefits over existing multiple access techniques. RA-CDMA networks are asynchronous, robust against multipath interference, and offer resilience against collision. A lightweight medium access control (MAC) protocol is needed to facilitate communication in RA-CDMA networks between low power sensor nodes and access points. This article provides an overview of RA-CDMA and proposes elements of a new MAC protocol that could improve performance of certain wireless sensor networks. Key features of the proposed MAC design are introduced and compared to those of existing protocols, highlighting its simple and lightweight design. Through its compatibility with RA-CDMA, the MAC design eliminates significant overhead and complexity while meeting requirements for low power networks, which enables the implementation of dense IoT sensor networks.


2017 ◽  
Vol 13 (8) ◽  
pp. 155014771772631 ◽  
Author(s):  
Junhee Lee ◽  
Wun-Cheol Jeong ◽  
Byeong-Cheol Choi

In this article, we propose a time division multiple access scheduling algorithm for end-to-end on-time packet delivery in multi-hop wireless sensor networks. Our proposed algorithm establishes a new communication path to substitute the old path including the link failed and schedules communication links on the new path by allocating timeslots satisfying end-to-end delay bound. Max–min optimization is employed to maximize the number of dedicated timeslots to establish the substitute path in the event of the next link failure. We evaluate the performance of the proposed algorithm using QualNet network simulator and compare it with the performance of the algorithm that minimizes the end-to-end delay. Our numerical results show that the path survival ratio of the proposed algorithm is approximately two times higher when large number of communication links fails. In addition, we apply the global recovery and local recovery schemes to observe the increase in the overhead message exchanges. Compared to the global recovery scheme, local recovery scheme requires six times less control messages to establish the substitute path when a small number of link failures occur, whereas more than 90% communication paths survive.


Sign in / Sign up

Export Citation Format

Share Document