Smart Meter Network Routing via Imaginary Node
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing methods for smart meter networks are inefficient due to high communication overhead, inability to discover multiple loop-free routes, and reliance on network-wide flooding, which is not suitable for large-scale multi-hop mesh networks.
Innovation Solution
A method that uses an imaginary destination node to discover multiple loop-free routes by minimizing flooding, ensuring reliable two-way communication through bidirectional routes verification and fault recovery, and optimizing route selection based on criteria such as disjointedness and reliability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional routing methods (AODV, AOMDV, DSR) are used for route discovery, then multiple routes can be discovered, but network-wide flooding causes high communication overhead and bandwidth consumption
Solution Approach 1:
The patent segments the network-wide flooding process into localized route discovery operations. Instead of broadcasting route requests across the entire network, the method confines route discovery to local neighborhoods using geographic information, thereby reducing communication overhead while maintaining route discovery reliability
Solution Approach 2:
The patent applies local quality by using geographic location information to make route discovery decisions locally rather than globally. Nodes use their own location and location of destination to determine next-hop nodes, eliminating the need for network-wide flooding and reducing energy consumption
2Adaptability or versatility
If route information is included in each packet (DSR method), then dynamic routing is achieved, but the node list increases packet overhead especially when the route is long
Solution Approach 1:
The patent extracts the routing decision-making process from the packet payload. Instead of including complete node lists in packets, the method pre-determines next-hop nodes using geographic information and embedded location data, removing the need for lengthy node lists while preserving dynamic routing capability
Solution Approach 2:
The patent performs preliminary routing decisions by pre-calculating next-hop nodes based on geographic location information before packets are transmitted. This preliminary action eliminates the need to include extensive route information in each packet, reducing overhead while maintaining adaptability
3Loss of information
If multiple network-wide broadcast floods are used to determine routes, then complete route information is obtained, but communication overhead becomes too high for large smart meter networks
Solution Approach 1:
The patent introduces dynamics by using real-time geographic location information to adapt routing decisions. Instead of static network-wide flooding, the method dynamically determines next-hop nodes based on current location data, achieving route information completeness with minimal communication overhead
Solution Approach 2:
The patent introduces geographic location information as an intermediary that mediates between source and destination nodes. This intermediary enables indirect routing decisions without requiring direct communication between all nodes, eliminating the need for multiple network-wide floods while maintaining route information completeness
Data Source
AI summary
A set of routes are discovered in a network including concentrators, smart meters and an imaginary node. Each concentrator node, a source, broadcasts a route request (RREQ) packet to the imaginary destination node. Intermediate nodes store a route as a node list (NL) in the RREQ packet and as a route table (RT) in the node. Then, each smart meter node can select a primary route and a secondary route from the smart meter node to any concentrator from the route table.