IEEE Wireless Communications • 无线传感器网络的专刊

kariday

【文件名】:0673@52RD_cal phenomenon awareness using sensor networks.rar
【格　式】:rar
【大　小】:578K
【简　介】:
A powerful concept to cope with resource
limitations and information redundancy in wireless
sensor networks is the use of collaboration
groups to distill information within the network
and suppress unnecessary activities. When the
phenomena to be monitored have large geographical
extents, it is not obvious how to define
these collaboration groups. This article presents
the application of geometric duality to form such
groups for sensor selection and non-local phenomena
tracking. Using a dual-space transformation,
which maps a non-local phenomenon
(e.g., the edge of a half-plane shadow) to a single
point in the dual space and maps locations of distributed sensor nodes to a set of lines that partitions the dual space, one can turn off the
majority of the sensors to achieve resource
preservation without losing detection and tracking
accuracy. Since the group so defined may
consist of nodes that are far away in physical
space, we propose a hierarchical architecture
that uses a small number of computationally
powerful nodes and a massive number of power
constrained motes. By taking advantage of the
continuity of physical phenomena and the duality
principle, we can greatly reduce the power
consumption in non-local phenomena tracking
and extend the lifetime of the network.
【目　录】:无目录

kariday

【文件名】:0673@52RD_Designing Secure Sensor Networks.rar
【格　式】:rar
【大　小】:122K
【简　介】:
Sensor networks are expected to play an essential
role in the upcoming age of pervasive computing.
Due to their constraints in computation,
memory, and power resources, their susceptibility
to physical capture, and use of wireless communications,
security is a challenge in these
networks. The scale of deployments of wireless
sensor networks require careful decisions and
trade-offs among various security measures. The
authors discuss these issues and consider mechanisms
to achieve secure communication in these networks.
【目　录】:无目录

kariday

【文件名】:0673@52RD_ng with guaranteed delivery in sensor networks.rar
【格　式】:rar
【大　小】:182K
【简　介】:In a geocasting problem, a message is sent
from one node to all the nodes located in a designated
region. For example, a monitoring center
needs to contact all active sensors within a
monitored area to either gather data from them
periodically or provide its location to sensors
covering a certain area for event reporting. Intelligent
flooding methods exist for this task when
all active sensors belong to the monitored area.
However, when a particular area containing only
a small subset of active sensors needs to be monitored,
the problem reduces to geocasting. Most
existing geocasting solutions are shown not to
guarantee delivery. We describe three approaches
to guarantee delivery. Two of them are face
traversal schemes, based on depth-first search of
the face tree and traversal of all faces that intersect
the border of the geocasting region, respectively.
In the entrance zone multicasting-based
approach, the monitoring center divides the
entrance ring of a geocast region into zones of
diameter equal to the transmission radius. The
problem is decomposed into multicasting toward
the center of each zone, and flooding from these
nodes. Improvements to all methods can be
made by applying neighbor or area dominating
sets and coverage, and converting nodes that are
not selected to sleep mode. All solutions that
guarantee delivery are reported here for the first
time (except a message inefficient version of the
face tree traversal scheme).
【目　录】:无目录

kariday

【文件名】:0673@52RD_ess sensor networks by cross-layer interaction.rar
【格　式】:rar
【大　小】:190K
【简　介】:This article presents a cross-layered approach
for networking in wireless sensor networks.
WSNs differ greatly from traditional ad hoc
wireless networks and therefore require the use
of new types of network protocols that are energy-
efficient to ensure a node lifetime of several
years on a single battery and can operate without
assistance of central managers in a dynamic
network topology. We show that a tightly integrated
set of networking protocols is a good
solution to reach the target of highly energy-efficient
WSNs. Our approach combines medium
access organization with routing.
【目　录】:无目录

kariday

【文件名】:0673@52RD_echniques in wireless sensor networks a survey.rar
【格　式】:rar
【大　小】:293K
【简　介】:
Wireless sensor networks consist of small
nodes with sensing, computation, and wireless
communications capabilities. Many routing,
power management, and data dissemination protocols
have been specifically designed for WSNs
where energy awareness is an essential design
issue. Routing protocols in WSNs might differ
depending on the application and network architecture.
In this article we present a survey of
state-of-the-art routing techniques in WSNs. We
first outline the design challenges for routing
protocols in WSNs followed by a comprehensive
survey of routing techniques. Overall, the routing
techniques are classified into three categories
based on the underlying network
structure: flit, hierarchical, and location-based
routing. Furthermore, these protocols can be
classified into multipath-based, query-based,
negotiation-based, QoS-based, and coherentbased
depending on the protocol operation. We
study the design trade-offs between energy and
communication overhead savings in every routing
paradigm. We also highlight the advantages
and performance issues of each routing technique.
The article concludes with possible future
research areas.
【目　录】:无目录

kariday

【文件名】:0673@52RD_The design space of wireless sensor networks.rar
【格　式】:rar
【大　小】:139K
【简　介】:In the recent past, wireless sensor networks
have found their way into a wide variety of applications
and systems with vastly varying requirements
and characteristics. As a consequence, it is
becoming increasingly difficult to discuss typical
requirements regarding hardware issues and software
support. This is particularly problematic in a
multidisciplinary research area such as wireless
sensor networks, where close collaboration
between users, application domain experts, hardware
designers, and software developers is needed
to implement efficient systems. In this article we
discuss the consequences of this fact with regard
to the design space of wireless sensor networks by
considering its various dimensions. We justify our
view by demonstrating that specific existing applications
occupy different points in the design space.
【目　录】:无目录

kariday

【文件名】:0673@52RD_ium access control in wireless sensor networks.rar
【格　式】:rar
【大　小】:225K
【简　介】:
In this article we outline a throughput- and
energy-efficient MAC approach that allows distributed
implementation and supports multihop
communication as required by autonomous and
large-scale wireless sensor networks with high
throughput needs and energy constraints.
The extent of studies on multiple access has
been traditionally limited to simple networks with
multiple transmitters and a single destination.
This model is clearly not sufficient to represent
self-organizing wireless sensor networks with multiple
dynamically changing transmitter-receiver
pairs. As an extension of MAC operation to multidestination
networks, Nguyen et al. [1, 2] looked
at the problem of contention-based access in
wireless networks with two fixed receivers and
used conflict resolution algorithms to explore the
bounds on the maximum stable throughput. The
Group time-division multiple access (TDMA)
algorithm was proposed in [1] as a time-division
mechanism in a two-destination network in order
to separate in time interfering groups of nodes
with packets addressed to different destinations.
The fundamental idea of scheduling transmissions
is not new. However, its use in this context is.
Each group is assigned separate fractions of time
depending on traffic needs. The Group TDMA
method was analyzed in terms of throughput
In this article we revisit the problem of scheduled
access through a detailed foray into the
questions of energy consumption and throughput
for MAC protocols in wireless sensor networks.
We consider a static network model that rules
out simultaneous transmission and reception by
any sensor node and consequently requires partitioning
of nodes into disjoint sets of transmitters
and receivers at any time instant. Under the
assumption of circular transmission (reception)
ranges with sharp boundaries, a greedy receiver
activation heuristic is developed relying on the
network connectivity map to determine distinct
receiver groups to be activated within disjoint
time intervals. To conserve limited energy
resources in sensor networks, the time allocation
to each receiver group is based on the residual
battery energy available at the respective transmitters.
Upon activating each receiver group separately,
the additional time-division mechanism
of Group TDMA is imposed to schedule transmissions
interfering at the non-intended destinations
within separate fractions of time in order to
preserve the reliable feedback information. The
two-layered time-division structure of receiver
activation and Group TDMA algorithms offers
distributed and polynomial-time solutions (as
required by autonomous sensor networks) to the
problems of link scheduling as well as energy and
throughput-efficient resource allocation in wireless
access. The associated synchronization and
overhead issues are not considered in this article.
【目　录】:无目录

[此贴子已经被作者于2006-7-3 14:11:12编辑过]

kariday

【文件名】:0673@52RD_development with high system visibility.part1.rar
【格　式】:rar
【大　小】:900K
【简　介】:Recently, increasing research attention has
been directed toward wireless sensor networks:
collections of small low-power nodes, physically
situated in the environment, that can intelligently
deliver high-level sensing results to the user.
As the community has moved into more complex
design efforts — large-scale, long-lived systems
that truly require self-organization and
adaptivity to the environment — a number of
important software design issues have arisen. To
make software robust, we must carefully observe
its behavior and understand its failure modes.
However, many of these failures are not manifested
until deployment time. Channel and storage
limitations make visibility into a deployed
system difficult, hindering our understanding of
failure modes. Simulation is difficult to apply;
the network’s physical situatedness makes it sensitive
to subtleties of sensors and wireless communication
channels that are difficult to model.
In this article we describe EmStar, a PC-based
software framework that aims to make development
easier by improving system visibility.
EmStar’s novel execution environments encompass
pure simulation, true in-situ deployment,
and hybrid modes that combine simulation with
real wireless communication and sensors situated
in the environment.

【目　录】:无目录

kariday

【文件名】:0673@52RD_development with high system visibility.part2.rar
【格　式】:rar
【大　小】:900K
【简　介】:
【目　录】:

kariday

【文件名】:0673@52RD_development with high system visibility.part3.rar
【格　式】:rar
【大　小】:565K
【简　介】:
【目　录】: