Information Technology Reference
In-Depth Information
connected to the communication system. Finally the route between BS and all
nodes is completed. Consequently it is necessary to solve the selection of relay
nodes, the establishment, maintenance and reconstruction of route, etc.
BS
1
2
3
5
4
7
6
9
8
11
10
17
18
12
13
19
20
14
15
21
22
16
23
24
33
34
25
26
27
35
36
28
30
29
31
32
Fig. 1. Tree-type network
2.2 Artificial Cobweb Routing Initialization Algorithm
Reference [12] gives a detailed description of artificial cobweb structure so that
this paper will not repeat them. In single-layer artificial cobweb structure, the
central node is responsible to coordinate and deal with the information of its
peripheral nodes within the subnet. In addition it is the relay for the com-
munication between the central node and BS of other associated subnets. The
communication route of BS to any one terminal node is exclusive in the network
based on artificial cobweb network.
We assume that the physical link is connected shown in Fig.1, stipulate that:
1) All nodes in the networking process are responsible to record the physical
signal strength of the received information.
2) Any node within the network can at least communicate with one other
nod.
3) In maximum physical range the signal up to, the node is to find the possible
number of nodes.
4) The logical ID of BS is 0, the logical ID acquired node is no longer involved
in the new logical ID allocation process.
5) Upon completion of the networking, the central node will not become a
bad node (Nodes can't communicate with other nodes caused by the changing
of channel condition).
We illustrate the artificial cobweb routing initialization algorithm based on
Fig.1:
 
Search WWH ::




Custom Search