11 research outputs found
Localizing objects in large-scale cyber- physical systems
We use the term Cyber-Physical Systems to refer to large-scale distributed sensor systems. Locating the geographic
coordinates of objects of interest is an important problemin such systems. We present a new distributed approach to
localize objects and events of interest in time complexity independent of number of nodes
Highly scalable aggregate computations in cyber-physical systems: physical environment meets communication protocols
In this paper, we focus on large-scale and dense Cyber-
Physical Systems, and discuss methods that tightly integrate
communication and computing with the underlying physical
environment. We present Physical Dynamic Priority Dominance
((PD)2) protocol that exemplifies a key mechanism
to devise low time-complexity communication protocols for
large-scale networked sensor systems. We show that using
this mechanism, one can compute aggregate quantities
such as the maximum or minimum of sensor readings in a
time-complexity that is equivalent to essentially one message
exchange. We also illustrate the use of this mechanism
in a more complex task of computing the interpolation of
smooth as well as non-smooth sensor data in very low timecomplexity
Bandwidth allocation in hexagonal wireless sensor networks for real-time communications
We present an algorithm for bandwidth allocation for delay-sensitive traffic in multi-hop wireless sensor networks. Our solution considers both periodic as well as aperiodic real-time traffic in an unified manner. We also present a distributed MAC protocol that conforms to the bandwidth allocation and thus satisfies the latency requirements of realtime traffic. Additionally, the protocol provides best-effort service to non real-time traffic. We derive the utilization bounds of our MAC protocol
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate time slots to the nodes of a network such that if the nodes transmit only during the allocated time slots, no collision occurs. For real-time applications, by ensuring deterministic channel access, transmission scheduling algorithms have the added significance of making guarantees on transmission latency possible. In this paper we present a distributed transmission scheduling algorithm for hexagonal wireless ad-hoc networks with a particular focus on Wireless Sensor Networks. Afforded by the techniques of ad-hoc networks topology control, hexagonal meshes enable trivial addressing and routing protocols. Our transmission scheduling algorithm constructs network-wide conflictfree packet transmission schedule for hexagonal networks, where the overhead of schedule construction in terms of message exchanges is zero above and beyond that for topology control and other network control related functions. Furthermore, the schedule is optimal in the sense that the bottleneck node does not idle. We also present an implicit clock synchronization algorithm to facilitate scheduling. We derive the real time capacity of our scheduling algorithm. We present evaluations of our scheduling algorithm in the presence of topological irregularities using simulation
Energy-conserving data cache placement in sensor networks
Wireless sensor networks hold a very promising future. The nodes of wireless sensor networks (WSN) have a small energy supply and limited bandwidth available. Since radio communication is expensive in terms of energy consumption, the nodes typically spend most of their energy reserve on wireless communication (rather than on CPU processing) for data dissemination and retrieval. Therefore, the role of energy conserving data communication protocols and services in WSN can not be overemphasized. Caching data at locations that minimize packet transmissions in the network reduces the power consumption in the network, and hence extends its lifetime. Finding locations of the nodes for caching data to minimize communication cost corresponds to finding the nodes of a weighted Minimum Steiner tree whose edge weights depend on the edge’s Euclidean length and its data traffic rate. We call this tree a Steiner Data Caching Tree (SDCT). We prove that an optimal SDCT is binary, and that at-least two of the three internal angles formed at the Steiner points are equal. We derive expressions that determine the exact location of a Steiner point for a set of three nodes based on their location and their data refresh rate requirements. Based on these (optimality) results, we present a dynamic distributed energy-conserving application-layer service for data caching and asynchronous multicast. We present the results of simulation of our service that verifies its power saving properties
BANMAC: An Opportunistic MAC Protocol for Reliable Communications in Body Area Networks
We consider reliable communications in Body Area Networks (BAN), where a set of nodes placed on human body are
connected using wireless links. In order to keep the Specific Absorption Rate (SAR) as low as possible for health safety
reasons, these networks operate in low transmit power regime, which however, is known to be error prone. It has been
observed that the fluctuations of the Received Signal Strength (RSS) at the nodes of a BAN on a moving person show
certain regularities and that the magnitude of these fluctuations are significant (5 - 20 dB). In this paper, we present
BANMAC, a MAC protocol that monitors and predicts the channel fluctuations and schedules transmissions
opportunistically when the RSS is likely to be higher. The MAC protocol is capable of providing differentiated service
and resolves co-channel interference in the event of multiple co-located BANs in a vicinity. We report the design and
implementation details of BANMAC integrated with the IEEE 802.15.4 protocol stack. We present experimental data
which show that the packet loss rate (PLR) of BANMAC is significantly lower as compared to that of the IEEE
802.15.4 MAC. For comparable PLR, the power consumption of BANMAC is also significantly lower than that of the
IEEE 802.15.4. For co-located networks, the convergence time to find a conflict-free channel allocation was
approximately 1 s for the centralized coordination mechanism and was approximately 4 s for the distributed
coordination mechanism
An empirical study of link quality estimation techniques for disconnection detection in WBANs
Sensor nodes in many Wireless Body Area Network (WBAN) architectures are supposed to deliver sensed data to a gateway node on the body. To satisfy the data delivery requirements, the network needs to adapt itself to the changes in connection status of the body nodes to the gateway. As a prerequisite, Link Quality Estimation (LQE) needs to be done to detect the connection status of the nodes. The quality of links in WBANs is highly time-varying. The LQE technique should be agile to react fast to such link quality dynamics while avoiding frequent fluctuations to reduce the network adaptation overhead. In this paper, we present an empirical study on using different LQE methods for detecting the connection status of body nodes to the gateway in WBANs. A set of experiments using 16 wireless motes deployed on a body are performed to log the behavior of the wireless links. We explore the trade-offs made by each LQE method in terms of agility, stability, and reliability in detecting connection changes by analyzing the experimental data. Moreover, different LQE methods are used in an adaptive multi-hop WBAN mechanism, as a case study, and their impact on the Quality-of-Services (QoS) are investigated. © 2013 ACM