This is interesting concept, yet routing and routing table size can be a problem. I would personally use IPv6 and focus on different "discovery protocols". Same applies to Mobile IPv6 and other situations where IP address should roam. If address is easily findable, then it doesn't require actual address roaming, because clients current address can be easily looked up when required. Of course this doesn't provide 'seamless roaming', but I've noticed that in many cases even when seamless roaming is advertised, it isn't truly seamless.
Just compact highlights & keywords from longer document: In NDN, all data is signed by data producers and verified by the consumers, and the data name provides essential context for security. Name-based routing also raises a scalability question. Routing and forwarding plane separation has proven necessary for Internet development. A router remembers the interface from which the request comes in, and then forwards the Interest packet by looking up the name in its Forwarding Information Base (FIB), which is populated by a name-based routing protocol. The router stores in a Pending Interest Table (PIT) all the Interests waiting for returning Data packets. Because an NDN Data packet is meaningful independent of where it comes from or where it may be forwarded to, the router can cache it to satisfy future requests. Data signatures are mandatory — applications cannot “opt out” of security. Besides efficient digital signatures, NDN needs flexible and usable mechanisms to manage user trust. Secure binding of names to data provides a basis for a wide range of trust models, e.g., if a piece of data is a public key, a binding is effectively a public key certificate. NDN’s data-centric security can be extended to content access control and infrastructure security. efficient signatures, usable trust management, network security, content protection and privacy. IP architecture: address space exhaustion, NAT traversal, mobility, and address management. There is no address exhaustion problem since the namespace is unbounded. There is no NAT traversal problem since a host does not need to expose its address in order to offer content. Mobility, which requires changing addresses in IP, no longer breaks communication since data names remain the same. Finally, address assignment and management is no longer required in local networks, which is especially empowering for embedded sensor networks. Routers simply treat names as a sequence of opaque components and do component-wise longest prefix match of the name in a packet against the FIB. How to maintain control over the routing table sizes. Another important question is whether looking up variable-length, hierarchical names can be done at line rate. Intelligent Data Plane NDN node can monitor the packet delivery performance of different interfaces and detect packet loss if any occurs, all at the time scale of a round-trip time. Forwarding Strategy, Since each Interest retrieves one Data packet, a router can control the traffic load by controlling the number of pending Interests to achieve flow balance. The PIT state can also be used to effectively mitigate DDoS attacks. Automatic in-network caching is enabled by naming data. Content Store. NDN routers are able to reuse the data For static files, NDN achieves almost optimal data delivery. One may also be able to learn what data is requested through clever probing schemes to derive what is in the cache. However NDN removes entirely the information regarding who is requesting the data. the NDN architecture naturally offers privacy protection at a fundamentally different level than the current IP networks. reliability checking, data signing and trust decisions NDN avoids congestion collapse that can occur in today’s Internet when a packet is lost at the last hop and bandwidth is mostly consumed by repeated retransmissions from the original source host. Sync utilizes naming conventions to enable multiple parties to synchronize their datasets by exchanging data digests, so that individual parties can discover and retrieve new and missing data in a most efficient and robust manner.