Sensors and Sensor Networks 20.2 Sensor Networks 343
lifetime and reduce energy consumption in forward-
ing data. In order to minimize energy consumption,
routing schemes can be broadly classified into two cat-
egories: (1) clustering-based data forwarding scheme
(Fig.20.7a,b) and (2) multihop data forwarding scheme
without clustering (Fig.20.7b,d).
In recent years, with the advancement of wireless
mobile communication technologies, ad hoc wireless
sensor networks (AWSNs) have become important.
With this advancement, the above wired (microwired)
architectures remain relevant only where wireless com-
munication is physically prohibited; otherwise, wireless
architectures are considered superior. The architecture
of AWSN is fully flexible and dynamic, that is, a mo-
bile ad hoc network represents a system of wireless
nodes that can freely reorganize into temporary net-
works as needed, allowing nodes to communicate in
areas with no existing infrastructure. Thus, interconnec-
tion between nodes can be dynamically changed, and
the network is set up only for a short period of com-
munication [20.28]. Now the AWSN with an optimal
ad hoc routing scheme has become an important design
concern.
In applications where there is no given pattern of
sensor deployment, such as battlefield surveillance or
environmental monitoring, the AWSN approach can
provide efficient sensor networking. Especially in dy-
namic network environments such as AWSN, three
main distributed services, i. e., lookup service, com-
position service, and dynamic adaptation service by
self-organizingsensor networks, arealso studiedto con-
trol the system (see, for instance, [20.29]).
In order to route information in an energy-efficient
way, directed diffusion routing protocols based on the
localized computation model [20.30, 31] have been
studied for robust communication. The data consumer
will initiate requests for data with certain attributes.
Nodes will then diffuse the requests towards producers
via a sequence of local interactions. This process sets
up gradients in the network which channel the delivery
of data. Even though the network status is dynamic, the
impact of dynamics can be localized.
A mobile-agent-based DSN (MADSN) [20.32] uti-
lizes a formal concept of agent to reduce network
bandwidth requirements. A mobile agent is a floating
processor migrating from node to node in the DSN and
performing data processing autonomously. Each mo-
bile agent carries partially integrated data which will
be fused at the final CH with other agents’ informa-
tion. To save time and energy consumption, as soon as
certain requirements of a network are satisfied in the
progress of its tour, the mobile agent returns to the base
station without having to visit other nodes on its route.
This logic reduces network load, overcoming network
latency, and improves fault-tolerance performance.
20.2.5 Sensor Network Protocols
Communication protocols for distributed microsensor
networks provide systems with better network capa-
bility and performance by creating efficient paths and
accomplishing effective communication between the
sensor nodes [20.29,33,34].
The point-to-point protocol (PTP) is the simplest
communication protocol and transmits data to only one
of its neighbors, as illustrated in Fig. 20.8a. However,
PTP is not appropriate for a DSN because there is no
communication path in case of failure of nodes or links.
In the flooding protocol (FP), the information sent
out by the sender node is addressed to all of its neigh-
bors, as shown in Fig.20.8b. This disseminates data
quickly in a network wherebandwidth is not limitedand
links are not loss-prone. However, since a node always
sends data to its neighbors, regardless of whether or not
the neighbor has already received the data from another
source, it leads to the implosion problem and wastes re-
sources by sending duplicate copies of data to the same
node.
The gossiping protocol (GP) [20.35, 36]isanal-
ternative to the classic flooding protocol in which,
instead of indiscriminately sending information to all
its neighboring nodes, each sensor node only forwards
the data to one randomly selected neighbor, as depicted
in Fig.20.8c. While the GP distributes information
more slowly than FP, it dissipates resources, such as
energy, at a relatively lower rate. In addition, it is not as
robust relative to link failures as a broadcasting protocol
(BP), because a node can only rely on one other node to
resend the information for it in the case of link failure.
In order to solve the problem of implosion and
overlap, Heinzelman et al. [20.37] proposed the sensor
a) PTP b) FP c) GP
Fig. 20.8a–c Three basic communication protocols: (a) point-to-
point protocol (PTP),
(b) flooding protocol (FP), and (c) gossiping
protocol (GP)
Part C 20.2