Abstract: A mobile ad hoc network is a network of mobile nodes
without any notion of centralized administration. In such a network,
each mobile node behaves not only as a host which runs applications
but also as a router to forward packets on behalf of others. Clustering
has been applied to routing protocols to achieve efficient
communications. A CH network expresses the connected relationship
among cluster-heads. This paper discusses the methods for
constructing a CH network, and produces the following results: (1)
The required running costs of 3 traditional methods for constructing a
CH network are not so different from each other in the static
circumstance, or in the dynamic circumstance. Their running costs in
the static circumstance do not differ from their costs in the dynamic
circumstance. Meanwhile, although the routing costs required for the
above 3 methods are not so different in the static circumstance, the
costs are considerably different from each other in the dynamic
circumstance. Their routing costs in the static circumstance are also
very different from their costs in the dynamic circumstance, and the
former is one tenths of the latter. The routing cost in the dynamic
circumstance is mostly the cost for re-routing. (2) On the strength of
the above results, we discuss new 2 methods regarding whether they
are tolerable or not in the dynamic circumstance, that is, whether the
times of re-routing are small or not. These new methods are revised
methods that are based on the traditional methods. We recommended
the method which produces the smallest routing cost in the dynamic
circumstance, therefore producing the smallest total cost.
Abstract: In order to monitor for traffic traversal, sensors can be
deployed to perform collaborative target detection. Such a sensor
network achieves a certain level of detection performance with the
associated costs of deployment and routing protocol. This paper
addresses these two points of sensor deployment and routing algorithm
in the situation where the absolute quantity of sensors or total energy
becomes insufficient. This discussion on the best deployment system
concluded that two kinds of deployments; Normal and Power law
distributions, show 6 and 3 times longer than Random distribution in
the duration of coverage, respectively. The other discussion on routing
algorithm to achieve good performance in each deployment system
was also addressed. This discussion concluded that, in place of the
traditional algorithm, a new algorithm can extend the time of coverage
duration by 4 times in a Normal distribution, and in the circumstance
where every deployed sensor operates as a binary model.