Abstract
In this paper, based on coding theory concepts, a new time scheduling algorithm for multihop packet radio networks is described. Each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the jth slot provided the assigned code has a 1 in this jth bit. The proposed algorithm is better than the previously known algorithms in terms of minimum system throughput. The algorithm also preserves other desired properties, such as topology independence, guaranteed minimum throughput, bounded maximum delay, and fair transmission policy.
Original language | English (US) |
---|---|
Pages | 1918-1922 |
Number of pages | 5 |
State | Published - 2001 |
Externally published | Yes |
Event | IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States Duration: Nov 25 2001 → Nov 29 2001 |
Conference
Conference | IEEE Global Telecommunicatins Conference GLOBECOM'01 |
---|---|
Country | United States |
City | San Antonio, TX |
Period | 11/25/01 → 11/29/01 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Global and Planetary Change