Abstract
Many protocols designed for wireless sensor networks require the existence of special purpose nodes distributed throughout the network to perform such services as aggregation, access coordination, etc. To avoid inter-node interference, it is desirable to schedule beforehand the nodes that will interact with the servers in a given time interval. Previous solutions either assume a fully connected network with a single server or clustered architecture with one server per cluster and no inter-cluster interference. In this paper, we propose a contention-based protocol for scheduling service requests by nodes in environments with multiple servers without any assumption about clustering. We describe two versions of our protocol: one based on random backoff and the other on truncated binary exponential backoff. Results show that a high number of requests can be fulfilled within a reasonable response delay and its performance is better than TDMA-like clustering-based schemes when the interference between clusters is taken into account.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - IEEE Military Communications Conference MILCOM |
| DOIs | |
| Publication status | Published - 2008 |
| Event | 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success - Washington, DC, United States Duration: Nov 17 2008 → Nov 19 2008 |
Other
| Other | 2008 IEEE Military Communications Conference, MILCOM 2008 - Assuring Mission Success |
|---|---|
| Country | United States |
| City | Washington, DC |
| Period | 11/17/08 → 11/19/08 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
A contention-based service scheduling protocol for multi-node multi-server wireless sensor networks. / Al-Abri, Dawood; McNair, Janise.
Proceedings - IEEE Military Communications Conference MILCOM. 2008. 4753373.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A contention-based service scheduling protocol for multi-node multi-server wireless sensor networks
AU - Al-Abri, Dawood
AU - McNair, Janise
PY - 2008
Y1 - 2008
N2 - Many protocols designed for wireless sensor networks require the existence of special purpose nodes distributed throughout the network to perform such services as aggregation, access coordination, etc. To avoid inter-node interference, it is desirable to schedule beforehand the nodes that will interact with the servers in a given time interval. Previous solutions either assume a fully connected network with a single server or clustered architecture with one server per cluster and no inter-cluster interference. In this paper, we propose a contention-based protocol for scheduling service requests by nodes in environments with multiple servers without any assumption about clustering. We describe two versions of our protocol: one based on random backoff and the other on truncated binary exponential backoff. Results show that a high number of requests can be fulfilled within a reasonable response delay and its performance is better than TDMA-like clustering-based schemes when the interference between clusters is taken into account.
AB - Many protocols designed for wireless sensor networks require the existence of special purpose nodes distributed throughout the network to perform such services as aggregation, access coordination, etc. To avoid inter-node interference, it is desirable to schedule beforehand the nodes that will interact with the servers in a given time interval. Previous solutions either assume a fully connected network with a single server or clustered architecture with one server per cluster and no inter-cluster interference. In this paper, we propose a contention-based protocol for scheduling service requests by nodes in environments with multiple servers without any assumption about clustering. We describe two versions of our protocol: one based on random backoff and the other on truncated binary exponential backoff. Results show that a high number of requests can be fulfilled within a reasonable response delay and its performance is better than TDMA-like clustering-based schemes when the interference between clusters is taken into account.
UR - http://www.scopus.com/inward/record.url?scp=78650759286&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650759286&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2008.4753373
DO - 10.1109/MILCOM.2008.4753373
M3 - Conference contribution
AN - SCOPUS:78650759286
SN - 9781424426775
BT - Proceedings - IEEE Military Communications Conference MILCOM
ER -