1 Introduction
2 Ant colony-based energy control routing protocol
2.1 Data structures of ants
SID | DID | Seq | HOP | Path | TTL |
SID | DID | Seq | HOP | Path |
E
min
|
E
sum
|
Destination nodes | ||||||
---|---|---|---|---|---|---|
Neighbor |
d
1
|
d
2
| ⋯ |
d
i
| ⋯ |
d
n
|
n
1
|
\(\phi _{n_{1}d_{1}}\)
|
\(\phi _{n_{1}d_{2}}\)
| ⋯ |
\(\phi _{n_{1}d_{i}}\)
| ⋯ |
\(\phi _{n_{1}d_{n}}\)
|
n
2
|
\(\phi _{n_{2}d_{1}}\)
|
\(\phi _{n_{2}d_{2}}\)
| ⋯ |
\(\phi _{n_{2}d_{i}}\)
| ⋯ |
\(\phi _{n_{2}d_{n}}\)
|
⋯ | ⋯ | ⋯ | ⋯ | ⋯ | ⋯ | ⋯ |
n
k
|
\(\phi _{n_{k}d_{1}}\)
|
\(\phi _{n_{k}d_{2}}\)
| ⋯ |
\(\phi _{n_{k}d_{i}}\)
| ⋯ |
\(\phi _{n_{k}d_{n}}\)
|
Symbol | Comments |
---|---|
Fant | Forward ant |
Bant | Backward ant |
ϕ
| Pheromone of nodes |
E
avg
| The average energy of a path |
E
sum
| The total energy of a path |
E
min
| The minimum energy of a path |
E
max
(i) | The maximum energy of node i
|
E
cur
(i) | The residual energy of node i
|
N(i) | The neighbor node set of node i
|
HOP
| Hop count of a path |
S
Fant
(i) | Set of received Fants of node i
|
2.2 Route discovery process
2.3 Data transmission and route maintenance
Paths | Pheromone |
---|---|
1-2-3-5-8-9-10 | 14.3 |
1-2-3-5-8-11-10 | 14.7 |
1-6-7-11-10 | 15.5 |
1-4-5-8-9-10 | 2.1 |
1-4-5-8-11-10 | 2.6 |
Destination | Next hop | Pheromone | Probability |
---|---|---|---|
10 | 2 | 41.7 | 0.69 |
10 | 6 | 15.5 | 0.26 |
10 | 4 | 2.6 | 0.95 |