RahPhone: work of cellular phones without
towers, or business-idea of cost of billion
dollars
Re-posts and translations to other languages are necessary. Translated from 3-th russian edition,
computer20.euro.ru/rah.htm Processes are highlighted in red, variables of program code - in
brown, another definitions - in gray, other important notes - in green.
Basic concepts
Non-filled niche
People live in cities so tightly, that signal from cellular phone, caught by neighbour gadget, is
more powerful, than the one that reaches retranslation tower (areas of antennas are taken into
account). It opened second channel to transfer packages - not via tower, but directly from phone
to phone. These nets are not implemented yet, but have already obtained name MANet, Mobile
Ad-hoc Net (together with VANet, Vechicle Ad-hoc Net, having less Brouwn motion of devices
and not using hand-draw services - email, SMS, chats - they compose mesh-nets, i.e. working
without base stations; accordingly communication in these nets has name "meshworking").
Capacity of the niche is more than 3 billion phones, exploited on the planet. If several of them
are connected in each city to internet for intercity connection (we shall name it as intercity, it can
be deployed by a student or a university employee on free internet during night; by local fond,
gathering donations for intercity; by an individual, paying not for traffic, but for the bandwidth,
which is not fully used by him), if a wire between villages is stretched (with connection of pair
of phones to Pentium I, taken from flea market), then we have the following unique features:
free-ness: towers, belonging to private capital, bring direct ecomonic damage to citizens
(have you compared the incomes from sale of traffic and of drugs?), besides, cellular
providers steal money from the accounts; base stations make the country dependent on
the delivery and repair of foreign hardware
age-less-ness: SIM-card is not necessary - pupils will not need passport to buy it, demand
on the phones increases
extra-territorial-ness [from consumer point of view]: roaming is not necessary - which
can not exist
limit-less-ness, i.e. infinity of traffic
server-less-ness: phones are used to save collective information (what makes unnecessary
buying of hundreds servers like in case of Wikipedia) and personal information (e.g.
mailboxes on phones of mailbox's owners, instead of all together on one device, what
turns whole system into distributed chat)
steady-ness: system functions during war, when "phones" continuously die under
bombing
stelth-ness: enemy can not overhear and oversee own citizens, when they do not speak
(overhearing from tower during speaking without encryption is possible as before); can
not get confidential information, beginning from IMEI and finishing by the password to
unlock the keyboard; can not force the phone register in the cell, until there is necessity to
call, and use it as a beacon to find user - all these support own spies, and also foreign
revolutionaries, gangsters and the ones who do not pay taxes
encryption: for the enemy not to overhear and oversee conversation itself - aims are the
same, as in previous item
"novomed" [from the point of view of psychological operations, psyop-es]: new media to
throw rumours, to broadcast, and for alternative elections (to de-legitimate president,
governor, mayor, manager, director) for the purpose of divergence of elites, to support
counter-elites, to strengthen friends and weaken enemies among the leaders, to ground
own politics abroad, to prepare population (phones are taken away from soldiers) for
entering of troops. This media leaves far behind all others in speed to reach auditorium
(which speaks via phones after ter-acts, instead of watching TV in cars or on pavements),
that allows in last moment to re-interpret topic, which just now will be raised by the
enemy, or to give disclaimer, or to lower validity, or to accent on positive aspects ("spin-
technology"), before destructive effect of the message appears. It is simultaneously
facility both for attack, and for protection, but the main thing - it is an instantly working
mechanism, there is no alternative for it
The following becomes cheaper and not under censorship for people of hostile countries
radio-drived weapon: planes without pilots with video-camera (with phone) and
stationary cameras-"stickers" on building to observe police actions in the streets; moto-
carts with mine or cumulative charge for blast under car just during runing on asphalt;
stationary mines, detonated by a call; machine-guns and rifles without soldier (destroyed
by anti-tank-gun or grenade-cup-discharger)
In spite of the intensive development of corresponding protocols - see
en.wikipedia.org/wiki/Ad_hoc_routing_protocol_list - they are not really applicable for phones.
Firstly, structural restrictions are in all of them (the case is demonstrative acknowledgement of
the words of Feynman, that the majority of scientists are cargo-admirers), what will quickly stop
the development of networks on base of these protocols. Secondly, they all use distant-vector
algorithms of routing, requiring a large quantity of records in the tables of routing, and therefore
not-placeable in the phones.
Developed software (for now under WiFi, but any of the frequencies
en.wikipedia.org/wiki/Comparison_of_wireless_data_standards can be applied in general) is not
portable to phones, because they use the protocols mentioned above. However in order to have a
complete picture, we shall list the programs and draw attention, that all, except one, identify
nodes by IP-address (to not mix up with addresses in the internet, it is necessary to go into it via
proxy). In one case, usual phone number is address of device, what has the name "Distributed
Numbering Architecture" and binds the user to the institute of phone number distribution.
FreiFunk.net is deployed on notebooks and used in many countries. It is based on library of
routing OpenWrt.org and on one of protocols BATMAN open-mesh.org , Babel
pps.jussieu.fr/~jch/software/babel , OLSR OLSR.org , depravity of which is stated, e.g. on the
lists.alioth.debian.org/pipermail/babel-users/2008-August/000151.html Besides, software does
not allow chaotic mobile displacements, and price of notebooks is high.
VillageTelco.org consists of kit MeshPotato and is combination of stationary mesh-net, usual
analog phone, i.e. POTS-phone, and converter ATA between them (together MeshPotsAta, in
which people saw spanish "Patata" and translated into english - "Potato"). It inherited routing
algorithm from FreiFunk. Kits are available as 119$ apiece, reduction to 89$ is promised. So
deal is characterized by absence of mobility and necessary of special hardware.
Ninux.org will use OLSR for smartphones. Project is not developed.
ServalProject.org will apply code of VillageTelco for smartphones and identify them by DNA,
but how calls to cellular provider and calls to Serval-net are separated - UNknown. Project does
NOT supply neither binary, nor source codes; promises to appear on market after a year, NOT
reporting under what licence.
Single project, in which "rubber" address is mentioned (this and other used terms are specified in
the following section) - is Netsukuku for notebooks. Summary of documentation is on the
permalink.gmane.org/gmane.network.peer-to-peer.netsukuku/1693 , practically address is only
four-bytes. Instruction for installation is available on the
permalink.gmane.org/gmane.network.peer-to-peer.netsukuku/1688 Program is developed slowly,
judging by mailing list lists.dyne.org/mailman/listinfo/netsukuku , and has the following
restrictions:
R-DHT is absent, dublet is used instead of triplet
copies of dublet is stored in all notebooks of one distal group and copied on each
computer, crossed into it - obviously, all copies become inaccessible after rebuildings of
groups (which even are not described)
O-DHT is absent
T-DHT is absent, dublet is re-stored by owner each month (as it is described in
documentation - in file "andna.pdf", #3.7)
at merging of trees, tree is considered as smaller, when has less notebooks, what is
detected not by questioning (because it can be easy forged by hacker), but by
measurement of whole calculation power WCP (it is a bit hard to forge it, because it is
necessary to connect claster to computer) - however calculation task for WCP is not
invented yet
wave of renovations for routing tables goes not from connecting/ disconnecting/ crossing
notebook, but from all - and moments and periodicity of wave are unknown
Structured paradigm
We shall name it as RaH (Rubber-and-Hash), it is summ of technologies, to which we shall refer
as to rubber address and ROT-DHT (rubber-open-transfer DHT).
Address consists of arbitrary quantity of bytes. We unite near-layed phones into groups with 254
devices and assign identifiers from 1 to 254 to gadgets (255 is used as "asterisk", and 0 - as "end
of address string"). We unite each closely located 254 groups into super-group, inside which we
number similarly. We continue this process, until whole city will look like a tree. Then list of
identifiers from root to phone itself is address of device. Last identifier belongs to phone itself,
so eigher sub-groups, or phones can be in some group. Further we shall name group-root of tree
as proximal, and groups-ends of branches - as distal ones.
Running ahead, we mark, that special phone - coordinator - is distinguished in each group. It
gives identifiers in group (so sub-groups and phones are added into group one-by-one,
consecutively); it reports identifier, nearest to given one (it is necessary for R-DHT, look four
paragraphs below); it makes decision to rebuild group and informs its element about chosen
parameters of rebuilding (service question about maximum length of address go via whole tree
of coordinators - look merging in the end of article). Coordinators of groups for different level of
hierarchy do not coincide, because memory of phones is small. Coordinators are a vulnerable
sections, so re-elections of them occurs each 4 hours (but not inphase for different levels).
Process goes for some group in the following way. Coordinators of sub-groups choose one
between themselves, and give right to decide into its sub-group. Iteration is repeated there and
goes further into distal side. Each coordinator remembers coordinators of sub-groups (together
their names compose sub-society, what can be implemented comfortably by technology
computer20.euro.ru/sql5.19.3.pdf p.120, 123-125) and super-name (name of coordinator of
super-group). Phones choose in last group. Each choosing one generates casual number and
reports to other choosings, that all do the same calculations, and nobody could become
coordinator as result of fraud. And hash-function from 254 arguments (or less), invariant to
permutation of them, is calculated.
ROT-DHT - is hybrid of R-DHT (rubber DHT), O-DHT (open DHT) и T-DHT (transfer DHT),
each of which - is a superstructure upon usual DHT.
Usual DHT is a hash-table, parts of which without duplication are located on all phones; hash-
key points to address of device, and than is used repeatedly to find meaning inside it. During
motion in city, phones cross from one group into another, and address is changed. But each
phone chooses arbitrary literal name for itself as hash-key, and store and renew pair "own name -
own address" (dublet) in DHT. So actual address is always available in it, besides this, "bi-
directional" programs - e.g. for vocal talk - report collocutor about change of address. But usual
DHT requires equal length of all addresses, invariability of them, and isolateness of DHT from
crime. ROT-DHT overcomes these restrictions.
R-DHT differs by usage of two generators of pseudo-casual numbers. Against bombing of
phones and cutting intercity, dublet is duplicated on several, e.g. 200, geographically remote
devices-storers (so word "storers" concern always to devices, containing the same duplet). Name
hash is priming for "perpendicular" generator, which specifies identifier within a group. Name
hash and this identifier are primings for "longitudal" generator, sequence of numbers of which is
interpreted as rubber address. At miss past sub-group or phone, nearest sub-group or phone is
chosen (we know the nearest from coordinator). Perpendicular generator is switched-on always
on proximal level, on more distal level - if there are more 254 storers, and at least two of them
are in one sub-group. We shall name all numbers, generated by it for given copy of dublet, as
deflection (is string, finished by "/0"). It is written into copy together with name and address -
and then copy has name triplet - and is priming for both generators in any level of hierarchy
together with name hash. To search address by name, storers are asked consecutively, one-by-
one (price of which is some waste of time) to economise traffic.
In O-DHT, future storer verifies triplet before saving by requiring name on base of address from
triplet - and does not save at mismatch of names. Switched-off owner of name loose own name
after some time as result of perturbations - crosses of storers and rebuilding of groups,
containing them (this stimulates to keep phones switched-on always and routed foreign traffic).
Novation of T-DHT is that, if perturbation has touched storer, it re-save all triplets, located in it:
it calculates addresses of new storers on base of name hash and deflection; it sends triplets into
net - and they are saved on devices, nearest already without it; then it deletes triplets in itself. I.e.
he is empty just after perturbation.
Open key for asymmetric encryption are stored together with name, address, deflection - this
transforms triplet into quadruplet. For arbitrary name, OS of phone extracts address and key
from ROT-DHT and sends pair "mentioned name - arbitrary number", encrypted by this key, to
this address (arbitrary number - we shall name it as hider - is necessary, that overhearing towers
could not detect start of conversation, having created list of names, used in RahNet, encrypted by
their open keys). Receiver decrypts by own private key, compares name with own name and, if
they coincide, sends hider back as acknowledgements, encrypted by private key. If hiders
coincide, initiator of conversation (because collocutor can be a server, and it is necessary to not
increase burden on it, especially this can become new type of attack) generates symmetric key
(symmetric encryption is faster asymmetric in degree), encrypts it by open key, and sends to
collocutor.
Routing paradigm
That phone could accept calls both from RahNet, and from provider, it must have two wireless
modems (what is it - look en.wikipedia.org/wiki/Cellular_modem), i.e. must support two SIM-
cards. Provider is necessary to receive GPRS (intercity) and to receive calls from abonents, not
connected yet to RahNet. But to call, one modem, i.e. one-SIM's phone, is enough.
Provider will not recognize call into RahNet as call to itself and will not remove money from
account, because format of packages are different. But even if they would be identical, it is
possible to not authentify, having sent package with wrong SSD_A, which is result of hash-
function CAVE from number SSD_UPDATE, sent by tower to phone once per week, and from
numbers ESN and AKEY, burned in phone and SIM-card. Tower also calculates SSD_A and
compares with it from package (authentification SIS passes similarly, only sizes of numbers in
bytes are other, and one half of result is used for comparison, and other half - to encrypt called
number). Both in case of different formats, and in case of call without authentification, it is
necessary to re-program modem insteaf of OS.
Calls into RahNet look so. We shall name ability of two phones to communicate without any
mediator as bond, and devices on its ends - as adjaceners. We shall name bonds, crossed border
of given group, as its bridges, and devices on their ends - as mates. Bonds inside distal group - as
shoulders, and phones on their ends - as twins. Joinings and breaks - tinkling - occur at
rapprochement-moving-off of phones; and device crosses into other group, when quantity of
bridges with it exceeds quantity of shoulder with old group in 2 times (new group, to where
maximum quantity of bridges lead, is chosen). Breaks are diagnosed not only by termination of
traffic: during its absence, adjaceners are exchange by notifications about own existence (like
phones exchange by them with towers in usual cellural service) - and so often, how tinkling is
often.
Routing consists of routing of bridges and routing of shoulders.
Phone knows from adjaceners about all bridges of groups, in which it is (then it does selective
revise with some devices in these groups). Bridge consist of two addresses, of different length
possibly. Let phone has address e.g. 1.1.1.1 , and bridges are: 1.1.1.4-1.1.2.5 , 1.1.2.7-1.2.9.3 ,
1.2.6.8-2.5.7.4 Phone searches in bridges the first byte, distinguishing them from its own
address, and deletes tail of strings after byte - it normalizes. Result are 1.1.1.4-1.1.2 , 1.1.2-1.2 ,
1.2-2 So gantries with greater and smaller pylons appear (pylons are always of different length,
a package moves from greater to smaller). If new gantry is not in list of gantries, it is added
there; if it is, counter is incremented for it.
Set of greater pylons with identical size are correlated to each smaller pylon (the most greater are
the most best, because they are closer to routing phone itself). Elements of set are tied into ring
with creeper - next greater pylon will be used next time (ring is bi-directional, that deletings
would be possible). We shall name address from package after normalization as approach.
Smaller pylon, equal to it, is found for it, and pair's greater pylon is considered as new meaning
of approach. Iterations are repeated, until found greater pylon will fall into the same distal group,
where routing phone is. If this is phone itself, it sends package into last meaning of approach. If
no, routing of shoulders is executed for last greater pylon. Thus iterator passes round tree of
gantries, and counter of greater pylon and pointer to next smaller pylon are stored together with
greater pylon. So paradigm is very limited link-state algorithm.
In purpose of optimization, we shall enter additional service tables. We shall name last meaning
of approach in first case and last meaning of greater pylon in second case as abutment. If it is
calculated for each smaller pylon (including for not terminal one in tree of gantries), then routing
becomes instant, but re-calculation is necessary at each tinkling of bridges. We divide length of
the most long route into 3 parts, draft them in all routes and calculate abutment for each peace -
re-calculation will be seldom in 3 times. Although with assembling peaces into route.
Summirizing, optimization is limited vector-distance algorithm. Since distal tinkling occurs at
each cross into other group, one this part must consist of only distal bridge.
Similarly, phones know from twins about all shoulder within distal group (set of shoulder can be
checked, having appealed selectively to device, mentioned in list; and set of devices - having
appealed to coordinator). Every time after this, wave algorithm calculates into which of twins
package should be sent, that package will reach necessary neighbour in group, and how much
intermediate devices are in this way, i.e. again "link-state". Vector-distance optimization is
possible for it.
Against monopoly capture of traffic by men, discussing or downloading films, phone has short-
time memory, in which it notes receivers of routed packages and frequency of these packages
and, using which, it routes for different users equally. Really packages are delayed in phone-
sender itself by the first device-resender.
Financing
It is donations; re-burnings of phones; advertisment in RahNet's search server (it should be
created even by men, who are against advertisment principally, because they harm not for users,
but for Google, which will scan RahNet in any case); creation-and-learnig-to-create pages under
viewer, more progressive than browser with temporary HTML (e.g. under OSforP, last edition
for central ideas of which is available as computer20.euro.ru/api/api.htm), and which thus makes
new industry with separate profit.
Firstly - before appearance of mass of users - re-burnings are executed
amongst students for communication in dormitory, amongst schoolboys of high classes
for communication in school and in houses with many floors
by buying extremely old phones, re-burning and sale in retail to schoolboys of average
classes with too low prices (acceptable for their pocket's money)
by agreements with directors of companies to re-burn phones of employees (company
pays, it is free for employees) at impossibility to lay local wire communication and at
high price for trank communication
and after appearance - for all tail groups of population. Money are spent firstly for advertisment
on forums, than - for advertisment by leaflets and to lease internet-channels for intercity.
Protocol is not changed to not write by self the "name2name" and "RahAsk" (look below) under
all OS, and to not switch-off "Skype".
If product will be not released under open license GPL, we should expect appearance of
CAPTCHA, switched-on by command, spreading in net (to devices, whose triplets are in reached
phone, instead of to twins), with seggestion to send payed SMS (although possiblly with
differentiation for capatil and for province, for first world and for third one).
Ideas of the second lay
Opposition, particular tactics
Net will contain adjaceners, from which packages go into nowhere. Firstly towers of cellural
providers - gaps - will be them. But they are easy detectable, because they say about bridge via
one-two borders and about shoulder to too much quantity of gadgets, located over much borders:
tower is heard on GSM-900 over 35 km, on GSM-1800 - over 6 km. There are two way to fight
against gaps. First: gadgets - not all, but some, on base of generator of casual numbers to
economise traffic - notice about gap the its adjaceners and neighbours in distal group. One of
which also can be the same tower, and so it will know, that it is discovered and will imitate, that
it go further around city. Second way - is the same, that against holes.
Since gaps are easy detectable, holes - cellular phones, working on municipal electricity supply -
will be installed in traffic lights and on walls of houses (or providers will be duty to make this by
their money). Therefore OS-sender scatters packages via several trajectories, having marked
them by trajectory number, that OS-receiver will answer, via which packages come. ETX -
fraction of lost packages - and dt - time between first and last received copies of a package - are
calculated for trajectories.
If packages are duplicated on trajectories, than broadcast is made once for all first adjaceners. All
of them, except one, are informed by service pre-package about address of this one, packages
into which they also must caught. Start of broadcast is waited during 1 second to not memorize
much pre-packages. At the end of conversation, OS-es inform by finalizing package (with
arbitrary number-hider, that overhearing towers could not find termination of conversation): the
each other - to release cells, used to count ETX and dt; the all first adjaceners - to stop catch
foreign packages. At break of communication (possible death of collocutor) OS-es - both sender,
and receiver - issue finalizing package automatically. OS-sender also sends it to old group after
cross into another. Duplication on trajectories starts from beginning in a new group.
Further development is to search hole on trajectory by requests to adjaceners of elements of
trajectory: whether they find death of own packages. But after finding, there is a need to
broadcast packages-simulators into hole, that it would not switched-off and represent itself as
new phone (and if requests should be secretly for hole, than, that volume of traffic will not be
changed, we should interview even in case, when packages are not lost).
Mates of broken or created bridge inform devices of both groups, which it joined or will be join,
by flood of tinkling. At des-information about break of bridge (attack "false abyss"), adjaceners
inform groups in the same manner, like new bridge appear between them. At des-information
about appearence (attack "false bridge") - like bridge is broken. Phones, connected to computers
and using their spacious hard disks, trace these beeping bridges and notify others phones.
Entering of gantries allows to not remember myriads of bridges between giant groups, having
great common border, and so allows to economise memory, to be non-sensitive to attack
"multiplication of bridge" (when two devices looks like groups with big quantity of bridges
between them) - but also does not allow to choose shortest route, because gantry is information
about several bridges at once. Maximum meaning of its counter - let it occupies 4 bytes - means,
that gantry is false and must be deleted (phones, connected to computer, collect statistics about
deleted gantries). Presence of gantries, which must be deleted, at least on two neighbour levels of
hierarchy of tree means, that phone is in fog - in fictitious branch of tree, created by gap or hole.
To leave it, device cross into group above it, and if device cannot - it signalizes user to change
location.
Installation of holes, keeping silence, by hostile country and noise from researchers of net are
possible.
There are no particular tactics against government suppressing and, as its variant, filling by
fibers - fictitious traffic between gaps and holes; it is necessary to apply general one (convenient
also against loss of packages).
Opposition, general tactics
Only one comes to brain, we shall name it conditionally as kill together. It is entering into one of
subsystems of enemy, that damage, inflicted for you, falls also on this subsystem. Govenments
cannot suppress simultaneously provider's and RahNet's traffics, because economies became
phone-dependent and cannot exist without immediate communication. While there are hundreds
of cellural channels, but phones contain no more four wireless modems, maximum support four
SIM-cards, and usually - only one card, whole RahNet will work on only one frequency channel.
And to exclude selective suppressing, it continually moves to channel, where providers work,
otherwise there is a need to destroy gaps and holes.
But what is the question, should the most burden be chosen? Providers can not give SIM-cards
on some channels, and imitate their maximum burden by towers. They can apply different tactics
in different cities: work on average burden in one cities, on great burden - in anothers. One
person should not turn RahNet to providers, because he will be the most vulnerable its part, so
whole commune should trace a providers. Phones count among themself, on what channels they
themselves work (this statistics is so exactly as estimation of providers, as much fraction of all
devices is connected to RahNet); counting of voting is not transfused via intercity (remains
within city), and RahNet works on different channels in different cities, united together by
intercity.
Other technologies, implemented by self
The following are used to provide stelth-ness:
onion routing (package goes not via shortest route, but by zigzag, and visit different
places of planet; it is impossible to detect traffic of some user or to give advantage for
international traffic over local one - by price of appreciable delay)
garlic routing (packages to different receivers are united into one package, are encrypted
before sending via bond, are devided into particular packages on other end of bond)
symmetric and asymmetric (to send symmetric key) encryption
technology, which we shall name asPersistent Traffic: packages not only scattered to
different trajectories (without duplication); but also phone fills channel by fictitious
packages during silence to not create waves of traffic in net, traced by towers; packages
are delayed (on phone-sender itself by first device-resender) if they are too much (i.e.
transfer become not realtime, since buffering in re-senders is inadmissible); traffic
increases and lowers in whole net simultaneously, what is supplied by service packages
Public resources of ROT-DHT are:
translations of menu of phone to nation languages (several translations simultaneously is
possible)
list of tower's inter-phones (connected to electricity supply and giving internet to others
via cellular provider)
list of wire inter-phones (via wire) - just when quantity of Mb/month of incoming and
separately outcoming traffic for self, for each of friends separately, for any of another
friends, for strangers; what fraction of traffic, remained after self and friends and giving
to strangers in last day of month, are specified in adjustments of phone, than phone
immediately enter itself into appropriate list
Computers will also be connected to RahNet after spreading of it. That search robot should not
download server twice - via RahNet and via internet - specify domain name of connected
computer in adjusting of phone, and phone will say it, if will be asked.
Other technologies, implemented by volunteer
Browser Opera has turbo-mode - free obtaining of archived html-page (7% of primary volume)
from server of company, which itself download page. If turbo-driver under FireFox or other
browser is available in source code, use it. If no, motivating by creation of it under browsers, ask
proprietary protocol from Opera. If it will not give, ask again, having informed about RahPhone
(but company perlustrate and can falsify traffic - against making search system for internet and
caching internet in ROT-DHT. Fight against falsification by selective direct loadings and
following scandal - company does not serve users of own browser. Turbo-driver should go to
server via different proxies, that it would not ignore driver selectively. Hire freelancers at long
absence of volunteer (maybe company will refuse to support turbo-mode in general, but cost to
write turbo-driver will be dipped during event by economy of traffic). Finally, offer Opera to
write plug-in for phone after spreading of RahNet.
For mutual human help, offer volunteer to write program, we shall name it as SimHelp, sending
parameters of inserted SIM-card to collocutor and so providing the ability to call with it (i.e. to
use number and its money) and to buy (i.e. to make SMS-banking, internet-banking, NFC).
Leave possibility itself to implement Skype as decision of this company and of volunteers.
Offer also volunteers to write daemon for computers, we shall name it as name2name, reporting
Rah-name of phone, connected to it (or of one of wireless modems).
And also daemon RahAsk, allowing to make fictitious mailboxes from RahNet on computers,
that owners of phones could ask questions into emails of internet (letters are never deleted in free
hosts and remain in governmental databases). Fictitious nature is that, daemon only remembers,
into what phone should it re-send letter, received for given user of computer. It automatically
adds computer to public resources in ROT-DHT, as well as deletes correlation email-phone after
40 days.
Barriers before project
Certainly, it is impossible to re-program wireless modem by applet. In some phones, modem can
be such SoC, elements of which is unreadable by processor of phone itself or by connected
computer - but unreadability of modem's RAM or modem's flash is compensated by re-
programming of this flash via exits of chip. Tivoizated versions are worse: control summ of
modem's OS, which are on its flash, is burned in modem's ROM and is checked by ROM-booter
- thus chip of ROM should be exchanged. Necessity - in mediators "modem's flash -
COM/LPT/USB" (can be connected both to computer, and to this phone itself) and in new chips
of ROM - creates incomes of outside businessmen, what is barrier for wishing to join to RahNet
from one hand, but from other hand - is a reason for commercialization and source of profit, and
so - of helpers.
Together with re-burning or re-making the modem, OS must be replaced by new one with
algorithms of project - it is more technologically, than patching of each of already existing OS-
es. Although all OS-es with open source code - MeeGo, Ubuntu Mobile, Maemo (pro-parent of
first two), Moblin (pro-parent of first in list); NitdRoid, CyanogenMod, VillainROM, AndRoid
(pro-parent of previous three); OpenMoko, Access Linux Platform - are bulky and used only on
a smartphones, the last are already available for inhabitant of capitals, and can lower to prices of
phones during implementation of project. OS on base of AndRoid, which bumps tails from
market, should be taken, and should be reduced for simple phones.
Capacity of accumulators is small. If phone sends packages not only, when it itself speaks, but
also when re-sends foreign packages, it broadcasts all time, so battery is enough in this mode for
2.5 hour in average. Real applicable decisions are:
not carry some of phones, but keep permanently connected to electricity supply in
houses, offices and cars as repeaters (many people have already 2-3 phones, one of which
they can connect to electricity)
use fuel battery on alcohol (phone Toshiba T002 is delivered with it already) - free home-
brew allows to not pay for additional accumulators and electric energy, and to be in
places without electricity
radio-isotope battery (production does not begin, fluid semiconductor is being developed
for it in university of Missouri). It is possible to agitate for production because it
o is independent business with giant profit
o allows to keep buyed nuclear material at impossibility to produce it, which can be
used for military purposes at necessity
o politic advertisment on radio-isotope batteries will reach 3 billions customers
o these batteries is much less usual ones at the same powers, what allows to carry
them as contraband into states, forbidding them, if nuclear material is chosen,
which not excrete decamouflaging (and simultaneously harming to health) radio-
active gases
Other variants in order of falling of usefulness (continue, please, brain storm on forum of this
article):
manual dynamo-machine (analogues are in electric torch and in child computer XO for
100$)
dynamo-machine plus spring from mechanical clock
piezo-element in shoe (wire maybe stretched in line of trousers, but what to do with
skirt?)
pendulum as in self-charged clock (supposedly small power)
buy several accumulators and change each 2.5 hours (average period of their service -
400 chargings)
piezo-electric (nano)cloth (production does not begin, material is being developed in
Technological university of Jorge)
solar battery-shirt (upper cloth over both shirt, and winter jacket - but mass production of
cheap organic solar batteries is not began yet)
dynamo-machine for bicycle ("Bicycle Charger Kit" exists on market) - it brings to
dependency from bicycle
Other meta-code of technical project
Cross of phone
Each phone is in single state after switching-on. After joining with any other device, it infuses
into group, in which device is - it obtains identifier from coordinator. If device is single too,
generator of casual numbers decides, who of them will be coordinator.
Group difference - quantity of bytes, changed at the end of phone address (change of lengths
itself of address is in parameter too) - instead of quantity of bonds with different distal groups is
taken into account at cross of phone. Phone executes the following actions during transition:
release identifier in old coordinator and obtains in new
re-saves foreign triplets, renews own triplets (in which its address is), and orders to bi-
directional programs to report collocutors about change of address
reload table of shoulders
updates table of gantries on base of group difference, make flood about disappearance of
gantries into old group and about appearance into new
Empty phone after cross offers all devices in distal group by flood of pull to re-save in it the
triplets, for which it is nearest, rather then they.
Re-buildings of groups
If group was saturated before appending of phone, i.e. it contained 254 devices, than firstly it is
devided into two halfs. If super-group would be over-burden as result this, than beforehand it is
devided into two, and so on into proximal side. That phone, walking around city, would not wait
these cascade devisions, that its transition would occur instantly, groups of 2 lower levels of
hierarchy are supported in state with not more, e.g., 150 elements.
If curve line, which not crossed by bridges between sub-groups, maybe be stretched via group,
than splitting occurs along this curve, because routing into one part of group does not mean
routings into another, and routing of bridges becomes broken.
If quantity of elements in group become below, e.g., 70 (fluctuations are less in part, closer to
root of tree, and this parameter must be bigger there), than group is named as degenerated and is
united with nearest degenerated - content of more distal group is transfered into more proximal.
When two cities grow and touch each other, or are united by intercity, merging occurs: proximal
group of smaller tree becomes sub-group of proximal group of bigger tree. Smaller is that, in
which the most long addresses are shorter. If lengths are equal, tree is chosen randomly.
Addresses, triplets and routing tables are updated by (flood of merging) before opening of bridge
between trees.
If group contains only one element, group has name intermediate and is liquidated, and element
is transfered into super-group. If whole group - bus with tourists, train, electric train, ship, liner,
plane - moves (do not mess with cross of a one phone), what is diagnosed by break of all
brother's bridges (connecting with groups from the same super-group), into group, in which only
phones are, than intermediate group is inserted between the last and phones, into which then
motion occurs.
Let's remind, all phones are empty after re-building of a group.
Conclusion
And after all, who first will release mentioned phone, will become monopolist de facto for long
years. And if businessman or govenment will do it, if it will be done on commercial base, their
profit from meshworking will more Microsoft and Google. And they will be capable to open
ideologically foreign countries as tin banks, giving advantage in routing for international traffic
above local one, sinсe contact in border zone give possibility to step easy over state borders
(remembering, that already nobody interests slavic, and CIA hires with knowledge of arabic and
persian, today's disobediences in Tunis, Libya, Egypt, Yemen cause suspicions). To secure all us,
it is necessary to release product under open license GPL, so we address to community with
request for donations during personal meeting (which is possible in much places of continent),
and also with request to take part in writing of program code, in computer modeling and revision
of parameters, in change of wireless modem.
Dmitry Turin (DmitryTurin.narod.ru):
dima.turin@centrum.cz (all letters from domain .ru come into spam), dima.turin@gmail.com