Information Centric Networking (ICN) is a promising architecture as an alternative paradigm to traditional IP networking. The innovative concepts, such as named data, name-based routing, and in-network caching bring lots of benefits to Wireless Sensor Networks (WSNs). Simple and robust communication model of ICN, based on interest/data messages exchange, is appealing to be deployed in WSNs. However, ICN architectures are designed for power supplied network devices rather than resource-constrained sensor nodes. Introducing ICN-liked architecture to WSNs needs to rethink the naming scheme and forwarding strategy to meet the requirements of energy efficiency and failure recovery. This paper presents a light weight data centric routing mechanism (GRMR) for interest dissemination and data delivery in location-aware WSNs. A simple naming scheme gives assistance for routing decision by individual nodes. Greedy routing engaging with regional multicast mechanism provides an efficient data centric routing approach. The performance is analytically evaluated and simulated in NS-2. The results indicate that GRMR achieves significant energy efficiency under investigated scenarios.

We give a unified view to greedy geometric routing algorithms in ad hoc networks. For this, we first present a general form of greedy routing algorithm using a class of objective functions which are invariant under congruent transformations of a point set. We show that several known greedy routing algorithms such as Greedy Routing, Compass Routing, and Midpoint Routing can be regarded as special cases of the generalized greedy routing algorithm. In addition, inspired by the unified view of greedy routing, we propose three new greedy routing algorithms. We then derive a sufficient condition for our generalized greedy routing algorithm to guarantee packet delivery on every Delaunay graph. This condition makes it easier to check whether a given routing algorithm guarantees packet delivery, and it is closed under convex linear combination of objective functions. It is shown that Greedy Routing, Midpoint Routing, and the three new greedy routing algorithms proposed in this paper satisfy the sufficient condition, i.e., they guarantee packet delivery on Delaunay graphs. We also discuss merits and demerits of these methods.

The mapping from a global routing to a feasible detailed routing in a number of 2D array routing structures has been shown to be an NP-complete problem. These routing structures include the Xilinx style routing architecture, as well as architectures with significantly higher switching flexibility. In response to this complexity, a different class of FPGA routing structures called Greedy Routing Architectures (GRAs) have been proposed. On GRAs, optimally routing each switch box, in a specified order, leads to an optimal chip routing. Because routing each switch box takes polynomial time, the mapping problem on GRAs can be solved in polynomial time. In particular, an H-tree GRA with W2+2W switches per switch box (SpSB) and a 2D array GRA with 4W2+2W SpSB have been proposed. In this paper, we improve on these results by introducing an H-tree GRA with W2/2+2W SpSB and a 2D array GRA with 3.5W2+2W SpSB. These new GRAs have the same desirable mapping properties of the previously described GRAs, but use fewer switches.