Composable Information Gradients in Wireless Sensor Networks

Lin, Hongfei; Lu, Maohua; Milosavljević, Nikola; Gao, Jie; Guibas, Leonidas J.

doi:10.1109/ipsn.2008.21

Cited by 49 publications

(48 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this step we compute n harmonic functions, where n is the number of holes. This uses the Dirichlet boundary condition and an iterative gossip-style algorithm, similar to the distributed algorithm used in [15]. Simply connected domain.…”

Section: Theorem 31 (Ahlfors [1] -Slit Conformal Map)mentioning

confidence: 99%

Topology dependent space filling curves for sensor networks and applications

Ban

Goswami

Zeng

et al. 2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper we propose an algorithm to construct a "space filling" curve for a sensor network with holes. Mathematically, for a given multi-hole domain R, we generate a path P that is provably aperiodic (i.e., any point is covered at most a constant number of times) and dense (i.e., any point of R is arbitrarily close to P). In a discrete setting as in a sensor network, the path visits the nodes with progressive density, which can adapt to the budget of the path length. Given a higher budget, the path covers the network with higher density. With a lower budget the path becomes proportional sparser. We show how this density-adaptive space filling curve can be useful for applications such as serial data fusion, motion planning for data mules, sensor node indexing, and double ruling type in-network data storage and retrieval. We show by simulation results the superior performance of using our algorithm vs standard space filling curves and random walks.

show abstract

Section: Theorem 31 (Ahlfors [1] -Slit Conformal Map)mentioning

confidence: 99%

Topology dependent space filling curves for sensor networks and applications

Ban

Goswami

Zeng

et al. 2013

2013 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

show abstract

“…Chan and Perrig [7] proposed PIKE. Combinatorial designs have been used in a number of designs like [8], [9], [10], [11], [12], [6]. A new combinatorial scheme for key distribution that makes use of finite plane in Zq, where q is a prime number.…”

Section: Key Predistributionmentioning

confidence: 99%

“…The other parameter considers the proportion of links broken under node compromise. It can be shown that proposed design's results is much better in connectivity and resiliency compared to [8], [10], [12], [13] .…”

Section: Key Predistributionmentioning

confidence: 99%

Deterministic Key Distribution in Wireless Sensor Network using Finite Affine Plane

Giri¹,

Mahadevan²

2013

IJCA

View full text Add to dashboard Cite

Security of large scale densely deployed and infrastructureless wireless networks of resource limited sensor nodes requires efficient key distribution and management mechanisms. Key management is an important area of research in Wireless Sensor Networks (WSN), because resource constraints make security protocols difficult to be implemented. Key predistribution, a new combinatorial scheme for key distribution that makes use of finite plane. This gives rise to a new type of combinatorial design. Which involves preloading keys in sensor nodes, has been considered as the best solution when sensor nodes are battery powered and have to work unattended.

show abstract

“…Those methods, however, may encounter the problem of gradient plateau or single point failure, which makes local greedy algorithm invalid. Lin et al [20] propose a gradient creation method using harmonic function to guarantee that greedy navigation never gets stuck.…”

Section: Related Workmentioning

confidence: 99%

Run to Potential: Sweep Coverage in Wireless Sensor Networks

et al. 2009

2009 International Conference on Parallel Processing

View full text Add to dashboard Cite

Abstract-Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how well an interested area is monitored (covered) by sensors. The traditional way of evaluating sensor coverage requires that every point in the field should be monitored and the sensor network should be connected to transmit messages to a processing center (sink). Such a requirement is too strong to be financially practical in many scenarios. In this study, we address another type of coverage problem, sweep coverage, when we utilize mobile nodes as supplementary in a sparse and probably disconnected sensor network. Different from previous coverage problem, we focus on retrieving data from dynamic Points of Interest (POIs), where a sensor network does not necessarily have fixed data rendezvous points as POIs. Instead, any sensor node within the network could become a POI. We first analyze the relationship among information access delay, information access probability, and the number of required mobile nodes. We then design a distributed algorithm based on a virtual 3D map of local gradient information to guide the movement of mobile nodes to achieve sweep coverage on dynamic POIs. Using the analytical results as the guideline for setting the system parameters, we examine the performance of our algorithm compared with existing approaches.

show abstract

Composable Information Gradients in Wireless Sensor Networks

Cited by 49 publications

References 23 publications

Topology dependent space filling curves for sensor networks and applications

Topology dependent space filling curves for sensor networks and applications

Deterministic Key Distribution in Wireless Sensor Network using Finite Affine Plane

Run to Potential: Sweep Coverage in Wireless Sensor Networks

Contact Info

Product

Resources

About