1363737
Power save mechanisms for multi-hop wireless networks
In this paper, we discuss power save mechanisms that allow hosts to go to sleep to conserve energy. When sleeping hosts need to receive packets from other hosts, these hosts must somehow wake up the sleeping hosts. The paper discusses a busy-tone mechanism for this purpose, and an approach to improve the mechanism by using multiple busy tones. We generalize this protocol to develop the notion of multi-level power save mechanisms, and present some examples to illustrate this notion.
1871640
Exploring the Energy-Latency Trade-Off for Broadcasts in Energy-Saving Sensor Networks
Networking protocols for multi-hop wireless sensor networks (WSNs) are required to simultaneously minimize resource usage as well as optimize performance metrics such as latency and reliability. This paper explores the energy-latency-reliability trade-off for broadcast in multi-hop WSNs, by presenting a new protocol called PBBF (probability-based broadcast forwarding). PBBF works at the MAC layer and can be integrated into any sleep scheduling protocol. For a given application-defined level of reliability for broadcasts, the energy required and latency obtained are found to be inversely related to each other. Our analysis and simulation study quantify this relationship at the reliability boundary, as well as performance numbers to be expected from a deployment. PBBF essentially offers a WSN application designer considerable flexibility in choice of desired operation points
7955941
Leveraging Channel Diversity for Key Establishment in Wireless Sensor Networks
As the use of sensor networks increases, security in this domain becomes a very real concern. One fundamental aspect of providing confidentiality and authentication is key distribution. While public-key encryption has provided these properties historically, sensors are resource constrained and benefit from symmetric key approaches. In this work, we propose a novel protocol for symmetric key distribution that uses the multiple channels available on sensor hardware. This channel diversity, along with spatial diversity of device locations, allows neighboring sensors to establish secure link keys from plaintext keys that are broadcast by sensors in their neighborhood. In particular, we show that using even one extra channel during the initialization procedure significantly improves the security of key establishment. Via analysis and simulation, we show that our protocol performs well in terms of network connectivity and resilience to colluding malicious devices, when compared to previous work. We show that our protocol can achieve over 90% connectivity among neighboring sensors with link keys that are uncompromised even when 80% of the devices in the network are malicious and collude. Finally, we present a thorough discussion of the comparative advantages and disadvantages of our approach compared to previous techniques.
1634653
A characterization of strongly chordal graphs
Abstract In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the cycle.
32918943
Bounds on the number of isolates in sum graph labeling
A simple undirected graph H is called a sum graph if there is a labeling L of the vertices of H into distinct positive integers such that any two vertices u and v of H are adjacent if and only if there is a vertex w with label L(w )= L(u )+ L(v). The sum number � (G) of a graph G =( V; E) is the least integer r such that the graph H consisting of G and r isolated vertices is a sum graph. It is clear that � (G)6|E|. In this paper, we discuss general upper and lower bounds on the sum number. In particular, we prove that, over all graphs G =( V; E) with 5xed |V |?3 and |E|, the average of � (G) is at least |E |− 3|V |(log|V |)=[log(( |V | 2 )=|E|)] −| V |− 1. In other words, for most graphs, � (G) ∈ (|E|). c � 2001 Elsevier Science B.V. All rights reserved.
6192829
Clutter invariant ATR
One of the central problems in automated target recognition is to accommodate the infinite variety of clutter in real military environments. The principle focus of our paper is on the construction of metric spaces where the metric measures the distance between objects of interest invariant to the infinite variety of clutter. Such metrics are formulated using second-order random field models. Our results indicate that this approach significantly improves detection/classification rates of targets in clutter.
41148524
Vertex-Magic Total Labelings Of Generalized Petersen Graphs
A vertex-magic total labeling of a graph G=(V, E) with v vertices and e edges is an assignment of the integers from 1 to v + e to the vertices and edges of G with the property that the sum of the label on a vertex and the labels on its incident edges is a constant, independent of the choice of the vertex. In this paper we give a vertex-magic total labeling for the generalized Petersen graphs P(n, m) for all n@3,1@m⌊(n−1)/2⌋.
2423429
On d-antimagic labelings of prisms