Medium access control in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An asynchronous MAC protocol for wireless sensor networks
Journal of Network and Computer Applications
Scheduling for information gathering on sensor network
Wireless Networks
Energy-efficient power/rate control and scheduling in hybrid TDMA/CDMA wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Wireless Sensor Network for Assisted Living at Home of Elderly People
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part II: Bioinspired Applications in Artificial and Natural Computation
LASA: low-energy adaptive slot allocation scheduling algorithm for wireless sensor networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Analysis of random sleep scheme for wireless sensor networks
International Journal of Sensor Networks
Analytical throughput for the channel MAC paradigm
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
A system for ubiquitous fall monitoring at home via a wireless sensor network and a wearable mote
Expert Systems with Applications: An International Journal
MAC protocol for contacts from survivors in disaster areas using multi-hop wireless transmissions
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
| Hi-index | 0.00 |
In this article we revisit the problem of scheduled access through a detailed foray into the questions of energy consumption and throughput for MAC protocols in wireless sensor networks. We consider a static network model that rules out simultaneous transmission and reception by any sensor node and consequently requires partitioning of nodes into disjoint sets of transmitters and receivers at any time instant. Under the assumption of circular transmission (reception) ranges with sharp boundaries, a greedy receiver activation heuristic is developed relying on the network connectivity map to determine distinct receiver groups to be activated within disjoint time intervals. To conserve limited energy resources in sensor networks, the time allocation to each receiver group is based on the residual battery energy available at the respective transmitters. Upon activating each receiver group separately, the additional time-division mechanism of group TDMA is imposed to schedule transmissions interfering at the non-intended destinations within separate fractions of time in order to preserve the reliable feedback information. The two-layered time-division structure of receiver activation and group TDMA algorithms offers distributed and polynomial-time solutions (as required by autonomous sensor networks) to the problems of link scheduling as well as energy and throughput-efficient resource allocation in wireless access. The associated synchronization and overhead issues are not considered in this article.