1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
|
// Package mesh implements peer-to-peer mesh networking
package mesh
import (
"fmt"
"net"
"sync"
"time"
"veilith/transport"
)
// MeshTransport implements peer-to-peer mesh networking
type MeshTransport struct {
peers map[string]*Peer // address -> peer
mu sync.RWMutex
listener net.Listener
localAddr string
closed bool
discoveryInterval time.Duration
}
// Peer represents a mesh network peer
type Peer struct {
Address string
PublicKey string
LastSeen time.Time
Conn net.Conn
IsRelay bool // Can this peer relay messages?
}
// NewMeshTransport creates a new mesh transport
func NewMeshTransport() *MeshTransport {
return &MeshTransport{
peers: make(map[string]*Peer),
discoveryInterval: 30 * time.Second,
}
}
// Connect connects to a mesh peer
func (m *MeshTransport) Connect(address string) (net.Conn, error) {
m.mu.Lock()
defer m.mu.Unlock()
if m.closed {
return nil, fmt.Errorf("mesh transport is closed")
}
// Check if already connected
if peer, exists := m.peers[address]; exists {
if peer.Conn != nil {
peer.LastSeen = time.Now()
return peer.Conn, nil
}
}
// Establish new connection
conn, err := net.DialTimeout("tcp", address, 10*time.Second)
if err != nil {
return nil, fmt.Errorf("failed to connect to peer %s: %w", address, err)
}
// Add peer
m.peers[address] = &Peer{
Address: address,
LastSeen: time.Now(),
Conn: conn,
}
return conn, nil
}
// Listen starts listening for mesh connections
func (m *MeshTransport) Listen(address string) (net.Listener, error) {
m.mu.Lock()
defer m.mu.Unlock()
if m.closed {
return nil, fmt.Errorf("mesh transport is closed")
}
if m.listener != nil {
return nil, fmt.Errorf("already listening on %s", m.localAddr)
}
listener, err := net.Listen("tcp", address)
if err != nil {
return nil, fmt.Errorf("failed to listen on %s: %w", address, err)
}
m.listener = listener
m.localAddr = address
// Start peer discovery in background
go m.startPeerDiscovery()
return listener, nil
}
// Type returns the transport type
func (m *MeshTransport) Type() transport.TransportType {
return transport.TransportMesh
}
// Close closes the mesh transport
func (m *MeshTransport) Close() error {
m.mu.Lock()
defer m.mu.Unlock()
if m.closed {
return nil
}
m.closed = true
// Close listener
if m.listener != nil {
if err := m.listener.Close(); err != nil {
return fmt.Errorf("failed to close listener: %w", err)
}
m.listener = nil
}
// Close all peer connections
for addr, peer := range m.peers {
if peer.Conn != nil {
peer.Conn.Close()
}
delete(m.peers, addr)
}
return nil
}
// AddPeer manually adds a peer to the mesh
func (m *MeshTransport) AddPeer(address string) error {
m.mu.Lock()
defer m.mu.Unlock()
if m.closed {
return fmt.Errorf("mesh transport is closed")
}
if _, exists := m.peers[address]; exists {
return fmt.Errorf("peer already exists: %s", address)
}
m.peers[address] = &Peer{
Address: address,
LastSeen: time.Now(),
}
return nil
}
// RemovePeer removes a peer from the mesh
func (m *MeshTransport) RemovePeer(address string) error {
m.mu.Lock()
defer m.mu.Unlock()
peer, exists := m.peers[address]
if !exists {
return fmt.Errorf("peer not found: %s", address)
}
if peer.Conn != nil {
peer.Conn.Close()
}
delete(m.peers, address)
return nil
}
// GetPeers returns all known peers
func (m *MeshTransport) GetPeers() []*Peer {
m.mu.RLock()
defer m.mu.RUnlock()
peers := make([]*Peer, 0, len(m.peers))
for _, peer := range m.peers {
peers = append(peers, peer)
}
return peers
}
// GetPeerCount returns the number of known peers
func (m *MeshTransport) GetPeerCount() int {
m.mu.RLock()
defer m.mu.RUnlock()
return len(m.peers)
}
// startPeerDiscovery periodically discovers new peers
func (m *MeshTransport) startPeerDiscovery() {
ticker := time.NewTicker(m.discoveryInterval)
defer ticker.Stop()
for {
select {
case <-ticker.C:
m.mu.RLock()
if m.closed {
m.mu.RUnlock()
return
}
m.mu.RUnlock()
// Clean up stale peers
m.cleanupStalePeers(5 * time.Minute)
// In a real implementation, you would:
// 1. Query known peers for their peer lists
// 2. Attempt connections to new peers
// 3. Exchange routing tables
}
}
}
// cleanupStalePeers removes peers that haven't been seen recently
func (m *MeshTransport) cleanupStalePeers(maxAge time.Duration) {
m.mu.Lock()
defer m.mu.Unlock()
now := time.Now()
for addr, peer := range m.peers {
if now.Sub(peer.LastSeen) > maxAge {
if peer.Conn != nil {
peer.Conn.Close()
}
delete(m.peers, addr)
}
}
}
// SetDiscoveryInterval sets the peer discovery interval
func (m *MeshTransport) SetDiscoveryInterval(interval time.Duration) {
m.mu.Lock()
defer m.mu.Unlock()
m.discoveryInterval = interval
}
// String returns a string representation
func (m *MeshTransport) String() string {
m.mu.RLock()
defer m.mu.RUnlock()
return fmt.Sprintf("MeshTransport(peers=%d, listening=%s, closed=%v)",
len(m.peers), m.localAddr, m.closed)
}
|
