Compressed Paging Identifier Segmentation for Wireless Overhead Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network control methods in wireless communication systems are inefficient, requiring excessive bandwidth, time, and power due to large overhead signaling in paging messages, especially in systems with a large number of stations.
Innovation Solution
The method involves assigning paging identifiers to stations, partitioning the identifier space into sets, and generating compressed paging messages that include explicit or implicit identification of sets, allowing for efficient transmission and decoding by only relevant stations, reducing the need for all stations to listen to the entire message.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional paging messages are used to notify all stations, then all stations can receive complete information, but the overhead signaling consumes excessive bandwidth, time, and power
Solution Approach 1:
The patent segments the paging identifier space into multiple sets (e.g., first paging identifier set, second paging identifier set, etc.). Each set is associated with specific stations, allowing the access point to transmit paging messages targeted at specific sets rather than broadcasting to all stations. This segmentation enables stations to selectively decode only the paging messages relevant to them, significantly reducing the overhead signaling consumption of bandwidth and power while maintaining reliable paging delivery.
2Reliability
If all stations listen to the entire paging message, then no information is lost, but time is wasted by stations that do not need the information
Solution Approach 1:
By dividing the paging identifier space into distinct sets and associating each set with specific stations, the system enables targeted paging messages. Stations only need to listen to and process paging messages corresponding to their assigned identifier sets, eliminating the time waste of processing irrelevant information while ensuring complete information delivery for stations that need it.
Solution Approach 2:
The patent implements local quality by tailoring paging message transmission to specific local groups (identifier sets) rather than using a uniform broadcast approach. Each station or group of stations receives paging information customized to their needs, allowing them to process only the relevant information locally without wasting time on unrelated paging messages.
3Device complexity
If paging identifier space is not partitioned, then the system is simpler to implement, but the overhead signaling becomes excessive in systems with many stations
Solution Approach 1:
The patent segments the paging identifier space into multiple manageable sets, which reduces the overhead signaling amount. Instead of managing a single large identifier space for all stations, the system divides it into smaller subsets that can be addressed individually in paging messages. This segmentation strategy effectively reduces the quantity of overhead signaling required while maintaining a relatively simple implementation structure.
Data Source
AI summary
Methods and systems for reducing overhead paging are described. One example of such a method includes generating a compressed traffic indication map (TIM) element, the compressed TIM element comprising a partial virtual bitmap field constructed from at least one encoded block field that includes an encoded block information field identifying at least one encoding mode for encoded block information, and sending the compressed TIM element to an at least one station (STA) associated with the access point that supports at least one multiple basic service set identifier (BSSID). The method may also include, in response to the at least one encoding mode comprising an offset, length, bitmap (OLB) mode, encoding the encoded block information field to include a length subfield followed by contiguous subblock subfields, each subblock subfield including a corresponding subblock of a partial virtual map.