Distributed algorithms for mobile ad hoc networks /
We first present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA (Park and Corson, 1997), which in turn is based on...
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2001.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
Internet
Link to OAKTrust copyCushing: Theses & Dissertations Microforms (Does not check out)
| Call Number: |
2001 Thesis M35 |
|
|---|---|---|
| Call Number | Status | Get It |
| 2001 Thesis M35 | Available | |
Available Online
| Call Number: |
2001 Thesis M35 |
|
|---|---|---|
| Call Number | Status | Get It |
| 2001 Thesis M35 | Available | |