Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
  • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W68/00—User notification, e.g. alerting and paging, for incoming communication, change of service or the like
  • H04W68/02—Arrangements for increasing efficiency of notification or paging channel
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W60/00—Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration
  • H04W60/04—Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration using triggered events
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W68/00—User notification, e.g. alerting and paging, for incoming communication, change of service or the like
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor

Definitions

• This disclosure relates generally to apparatus and methods for
• the disclosure relates to network-initiated attachment and paging for mobile devices which are not currently registered in a mobile radio network.
• a wireless network may carry a variety of communication sessions with widely different characteristics.
• one characteristic is duty cycle, that is, the percentage of time that a mobile terminal is actually transmitting or receiving information.
• duty cycle that is, the percentage of time that a mobile terminal is actually transmitting or receiving information.
• mobile terminals may have a low duty cycle if the amount of data to be communicated over an extended time period is very low.
• a method for registration-less paging comprising establishing a mobile device identity for a mobile device in a wireless network; determining a time instance for the identified mobile device to listen to pages; and sending a page from the wireless network to the identified mobile device during the determined time instance.
• a method for a network- initiated attach procedure comprising receiving a request to attach a mobile device in a wireless network; generating a paging message based on the request to attach the mobile device; sending a paging indicator to a mobile device based on the paging message during a time instance based on an agreed rule; and accepting an attach procedure from the mobile device based on the paging indicator.
• an apparatus for registration-less paging comprising means for establishing a mobile device identity for a mobile device in a wireless network; means for determining a time instance for the identified mobile device to listen to pages; and means for sending a page from the wireless network to the identified mobile device during the determined time instance.
• an apparatus for a network-initiated attach procedure comprising means for receiving a request to attach a mobile device in a wireless network; means for generating a paging message based on the request to attach 100007
• the mobile device means for sending a paging indicator to a mobile device based on the paging message during a time instance based on an agreed rule; and means for accepting an attach procedure from the mobile device based on the paging indicator.
• an apparatus comprising a processor and a memory, the memory containing program code executable by the processor for performing the following: establishing a mobile device identity for a mobile device in a wireless network; determining a time instance for the identified mobile device to listen to pages; and sending a page from the wireless network to the identified mobile device during the determined time instance.
• an apparatus comprising a processor and a memory, the memory containing program code executable by the processor for performing the following:receiving a request to attach a mobile device in a wireless network; generating a paging message based on the request to attach the mobile device; sending a paging indicator to a mobile device based on the paging message during a time instance based on an agreed rule; and accepting an attach procedure from the mobile device based on the paging indicator.
• a computer program product comprising a computer-readable medium comprising codes for causing a computer to establish a mobile device identity for a mobile device in a wireless network; codes for causing the computer to determine a time instance for the identified mobile device to listen to pages; and codes for causing the computer to send a page from the wireless network to the identified mobile device during the determined time instance.
• a computer program product comprising a computer-readable medium comprising codes for causing a computer to receive a request to attach a mobile device in a wireless network; codes for causing the computer to generate a paging message based on the request to attach the mobile device; codes for causing the computer to send a paging indicator to a mobile device based on the paging message during a time instance based on an agreed rule; and codes for causing the computer to accept an attach procedure from the mobile device based on the paging indicator.
• Advantages of the present disclosure may include allowing a large number of very low duty cycle mobile devices to be connected to a wireless network whenever the wireless network detects a need for data transfer between a mobile device and the wireless network.
• Figure 1 is a block diagram illustrating an example of an access node/user equipment (UE) system.
• UE access node/user equipment
• Figure 2 illustrates an example of a wireless communications system that supports a plurality of users.
• Figure 3 illustrates an example of a high level M2M architecture with several attached M2M devices. 100007
• Figure 4 illustrates a first example of a flow diagram for registration-less paging.
• Figure 5 illustrates a second example of a flow diagram for registration- less paging.
• Figure 6 illustrates an example of a flow diagram for a network-initiated attach procedure.
• Figure 7 illustrates an example of a device comprising a processor in communication with a memory for executing the processes for registration-less paging or for a network-initiated attach procedure.
• Figure 8 illustrates a first example of a device suitable for registration- less paging.
• Figure 9 illustrates a second example of a device suitable for registration- less paging.
• Figure 10 illustrates an example of a device suitable for a network- initiated attach procedure.
• Figure 1 1 illustrates an example of a flow diagram for registration-less paging from a mobile device perspective.
• Figure 12 illustrates an example of device for implementing registration- less paging from a mobile device perspective.
• CDMA Code Division Multiple Access
• TDMA Time Division Multiple Access
• FDMA Frequency Division Multiple Access
• OFDMA Orthogonal FDMA
• SC-FDMA Single-Carrier FDMA
• a CDMA network may implement a radio technology such as 100007
• UTRA Universal Terrestrial Radio Access
• cdma2000 etc.
• UTRA includes
• a TDMA network may implement a radio technology such as Global System for Mobile Communications (GSM).
• GSM Global System for Mobile Communications
• An OFDMA network may implement a radio technology such as Evolved UTRA (E-UTRA), IEEE 802.1 1, IEEE 802.16, IEEE 802.20, Flash-OFDM®, etc.
• E-UTRA, E-UTRA, and GSM are part of Universal Mobile Telecommunication System (UMTS).
• UMTS Universal Mobile Telecommunication System
• LTE Long Term Evolution
• UTRA, E-UTRA, GSM, UMTS and LTE are described in documents from an organization named "3rd Generation
• 3GPP2 3rd Generation Partnership Project 2
• FIG. 1 is a block diagram illustrating an example of an access node/user equipment (UE) system 100.
• UE access node/user equipment
• FIG. 1 may be implemented in a frequency division multiple access (FDMA) environment, an orthogonal frequency division multiple access (OFDMA) environment, a code division multiple access (CDMA) environment, a wideband code division multiple access (WCDMA) environment, a time division (TDMA) environment, a spatial division multiple access (SDMA) environment, or any other suitable wireless environment.
• FDMA frequency division multiple access
• OFDMA orthogonal frequency division multiple access
• CDMA code division multiple access
• WCDMA wideband code division multiple access
• TDMA time division
• SDMA spatial division multiple access
• the access node/UE system 100 includes an access node 101 (e.g., base station) and a user equipment or UE 201 (e.g., wireless communication device or mobile station).
• the access node 101 e.g., base station
• the access node 101 includes a transmit (TX) data processor A 110 that accepts, formats, codes, interleaves and modulates (or symbol maps) traffic data and provides modulation symbols (e.g., data symbols).
• the TX data processor A 110 is in communication with a symbol modulator A 120.
• the symbol modulator A 120 accepts and processes the data symbols and downlink pilot symbols and provides a stream of symbols.
• symbol modulator A 120 is in communication with processor A 180 which provides configuration information.
• Symbol modulator A 120 is in communication with a transmitter unit (TMTR) A 130.
• the symbol modulator A 120 multiplexes the data symbols and downlink pilot symbols and provides them to the transmitter unit A 130.
• TMTR transmitter unit
• Each symbol to be transmitted may be a data symbol, a downlink pilot symbol or a signal value of zero.
• the downlink pilot symbols may be sent continuously in each symbol period.
• the downlink pilot symbols are frequency division multiplexed (FDM).
• the downlink pilot symbols are orthogonal frequency division multiplexed (OFDM).
• the downlink pilot symbols are code division multiplexed (CDM).
• the transmitter unit A 130 receives and converts the stream of symbols into one or more analog signals and further conditions, for example, amplifies, filters and/or frequency upconverts the analog signals, to generate an analog downlink signal suitable for wireless transmission.
• the analog downlink signal is then transmitted through antenna 140.
• the UE 201 includes antenna 210 for receiving the analog downlink signal and inputting the analog downlink signal to a receiver unit (RCVR) B 220.
• the receiver unit B 220 conditions, for example, filters, amplifies, and frequency downconverts the analog downlink signal to a first
• the first "conditioned” signal is then sampled.
• the receiver unit B 220 is in communication with a symbol demodulator B 230.
• the symbol demodulator B 230 demodulates the first "conditioned” and “sampled” signal (e.g., data symbols) outputted from the receiver unit B 220.
• One skilled in the art would understand that an alternative is to implement the sampling process in the symbol demodulator B 230.
• the symbol demodulator B 230 is in communication with a processor B 240.
• Processor B 240 receives downlink pilot symbols from symbol demodulator B 230 and performs channel estimation on the downlink pilot symbols. In one aspect, the channel estimation is the process of characterizing the current propagation environment.
• the symbol demodulator B 230 receives a frequency response estimate for the downlink leg from processor B 240.
• the symbol demodulator B 230 performs data demodulation on the data symbols to obtain data symbol estimates on the downlink path.
• the data symbol estimates on the downlink path are estimates of the data symbols that were transmitted.
• the symbol demodulator B 230 is also in communication with a RX data processor B 250.
• the RX data processor B 250 receives the data symbol estimates on the downlink path from the symbol demodulator B 230 and, for example, demodulates (i.e., symbol demaps), interleaves and/or decodes the data symbol estimates on the downlink path to recover the traffic data.
• demodulates i.e., symbol demaps
• interleaves i.e., interleaves
• decodes the data symbol estimates on the downlink path to recover the traffic data.
• the processing by the symbol demodulator B 230 and the RX data processor B 250 is complementary to the processing by the symbol modulator A 120 and TX data processor A 110, respectively. 10
• the UE 201 includes a TX data processor B 260.
• the TX data processor B 260 includes a TX data processor B 260.
• TX data processor B 260 accepts and processes traffic data to output data symbols.
• the TX data processor B 260 is in communication with a symbol modulator D 270.
• the symbol modulator D 270 accepts and multiplexes the data symbols with uplink pilot symbols, performs modulation and provides a stream of symbols.
• symbol modulator D 270 is in communication with processor B 240 which provides
• the symbol modulator D 270 is in communication with a transmitter unit B 280.
• Each symbol to be transmitted may be a data symbol, an uplink pilot symbol or a signal value of zero.
• the uplink pilot symbols may be sent continuously in each symbol period.
• the uplink pilot symbols are frequency division multiplexed (FDM).
• the uplink pilot symbols are orthogonal frequency division multiplexed (OFDM).
• the uplink pilot symbols are code division multiplexed (CDM).
• the transmitter unit B 280 receives and converts the stream of symbols into one or more analog signals and further conditions, for example, amplifies, filters and/or frequency upconverts the analog signals, to generate an analog uplink signal suitable for wireless transmission.
• the analog uplink signal is then transmitted through antenna 210.
• the analog uplink signal from UE 201 is received by antenna 140 and processed by a receiver unit A 150 to obtain samples.
• the receiver unit A 150 conditions, for example, filters, amplifies and frequency downconverts the analog uplink signal to a second "conditioned” signal. The second "conditioned” signal is then sampled.
• the receiver unit A 150 is in communication with a symbol demodulator C 100007
• the symbol demodulator C 160 performs data demodulation on the data symbols to obtain data symbol estimates on the uplink path and then provides the uplink pilot symbols and the data symbol estimates on the uplink path to the RX data processor A 170.
• the data symbol estimates on the uplink path are estimates of the data symbols that were transmitted.
• the RX data processor A 170 processes the data symbol estimates on the uplink path to recover the traffic data transmitted by the wireless communication device 201.
• the symbol demodulator C 160 is also in communication with processor A 180. Processor A 180 performs channel estimation for each active terminal transmitting on the uplink leg. In one aspect, multiple terminals may transmit pilot symbols concurrently on the uplink leg on their respective assigned sets of pilot subbands where the pilot subband sets may be interlaced.
• Processor A 180 and processor B 240 direct (i.e., control, coordinate or manage, etc.) operation at the access node 101 (e.g., base station) and at the UE 201, respectively.
• processor A 180 and processor B 240 are associated with one or more memory units (not shown) for storing of program codes and/or data.
• processor A 180 or processor B 240 or both perform computations to derive frequency and impulse response estimates for the uplink leg and downlink leg, respectively.
• the access node/UE system 100 is a multiple-access system.
• a multiple-access system e.g., frequency division multiple access (FDMA), orthogonal frequency division multiple access (OFDMA), code division 100007
• the pilot subbands may be shared among different terminals.
• Channel estimation techniques are used in cases where the pilot subbands for each terminal span the entire operating band (possibly except for the band edges). Such a pilot subband structure is desirable to obtain frequency diversity for each terminal.
• Figure 2 illustrates an example of a wireless communications system 290 that supports a plurality of users.
• reference numerals 292A to 292G refer to cells
• reference numerals 298A to 298G refer to base stations (BS) or base transceiver station (BTS)
• reference numerals 296A to 296J refer to access User Equipments (UE).
• Cell size may vary. Any of a variety of algorithms and methods may be used to schedule transmissions in system 290.
• System 290 provides communication for a number of cells 292A through 292G, each of which is serviced by a corresponding base station 298A through 298G, respectively.
• the present disclosure proposes a technique by which a very large number of mobile terminals, also known as mobile devices, may be attached to a wireless network in a network initiated manner.
• the mobile devices maintain very low duty cycle traffic and are mostly stationary.
• a technique disclosed in the present disclosure employs a single attachment step, the establishment of a long term identifier (LTID) for the mobile device, and the storage of the coverage area, or set of sectors, in which the mobile device is located. Subsequently, the mobile device can 100007
• LTID long term identifier
• the present disclosure describes a process for initiating the attachment of a mobile device from the wireless network side. Also disclosed is a mechanism for paging of mobile devices that are currently not registered in a radio access network or a core network of a wireless network.
• a potential advantage is that a large number of very low duty cycle mobile devices may be connected to a wireless network whenever the wireless network detects a need for data transfer between the mobile device and the wireless network.
• M2M machine-to-machine
• M2M devices mobile devices used for M2M applications are known as M2M devices. Examples for such applications include smart meters, building monitoring and safety systems, smart vending machines, eHealth for disease management, remote monitoring of industrial machines or installations or M2M applications that rely on battery powered mobile devices without frequent recharging.
• M2M device may need to operate at an extremely low duty cycle to ensure a very long battery life.
• the wireless network itself could initiate an attachment of a specific M2M device or a group of M2M devices when there is need to exchange information with the addressed M2M device or group of M2M devices.
• a M2M application running on the wireless network side or a M2M application running on a M2M device needs to communicate with another M2M device or a group of M2M devices, the wireless network could then initiate an attachment of the requested M2M devices without need to stay connected all the time.
• a wireless network-initiated attachment procedure may work with M2M devices that are not registered in the wireless network. Therefore, in one example, a registration-less paging method would enable an efficient use of wireless network-initiated attachment procedures.
• possible bottlenecks may include one or more of the following:
• Radio resources In another example, if a very large number of M2M devices are registered in the wireless network, significant radio resources may be consumed even when no information needs to be transferred between them and the wireless network. For example, possible issues may include need for reporting of neighboring cells or reporting of events that might have to be configured in a wireless network, periodic updates of the location or registration areas, etc.
• one way of servicing many low duty cycle M2M devices performs some form of a low duty cycle registration procedure, which may, in one example, follow one or more of the following steps:
• PDP packet data protocol
• a low duty cycle registration procedure may have negative impacts. From a wireless network side, negative impacts may result if many M2M devices are performing the low duty cycle registration procedure which results in a fairly large overhead for the actual registration procedure compared to the polling step. For example, the processing required for the registration on the wireless network side may be much more than the actual processing for the polling of the server. For example, if the M2M device just wants to ask the server "Is there something for me?", the server should simply answer with a "yes" or "no". This example results in a small amount of information compared to what is transferred and processed for a full registration, setting up of a connection, etc.
• the polling interval may be dimensioned to be significantly shorter than the expected time between events that would trigger the need for data transfer. For example, it may be assumed that less than half of the polls may actually result in some data exchange. If a very large number of M2M devices perform this type of low duty cycle registration procedure, a large waste of capacity may result. 100007
• the device may need to perform expensive procedures, such as attach, even when there is no data traffic. In this case, the battery impact for each of the attach cycles would be much more significant than an appropriate paging.
• Entity to Poll if there is not a single server or a central service layer for determining whether there is a need for action (e.g., transfer of information), it may be difficult to determine which location is the right point to poll. For example, there may be multiple potential entities that a M2M device would have to poll in case it goes through periodic low duty cycle registration.
• one solution to this need may include a wireless network-initiated attach procedure associated with a registration-less paging.
• registration-less paging refers to paging a mobile terminal, e.g. M2M device, which is not registered in a wireless network.
• a mobile terminal e.g. M2M device
• Context information may be location information about the mobile terminal, which may be used to find the mobile terminal as needed for paging.
• an outside user for example a server 100007
• Registration-less paging of the mobile terminal may include a pre-defined rule for a listen time when the mobile terminal should listen to such paging requests.
• the mobile terminal wakes up at the listen time to receive the paging request.
• FIG 3 illustrates an example of a high level M2M architecture with several attached M2M devices.
• a high level M2M architecture uses a M2M service layer on the wireless network side to communicate with a core network of a wireless system as illustrated in Figure 3.
• a number of M2M applications (shown on top in Figure 3) communicate with a M2M service layer (shown as a box below the M2M applications) to provide functionality to exchange information with M2M devices (shown at the bottom in Figure 3).
• M2M devices use a wireless wide area network (WWAN) to connect to the M2M service layer
• WWAN wireless wide area network
• a M2M application sitting on top of the M2M service layer or a M2M application running on one of the M2M devices may request the M2M service layer to establish an exchange of information between the requesting M2M application and a specific M2M device or a group of M2M devices.
• the M2M service layer may contact the core network of the underlying wireless network, e.g., WWAN, to connect to the addressed M2M device. For example, if the M2M device is currently not attached to the network, it would establish the attachment. For example, if the addressed M2M device is not 100007
• the wireless network-initiated attach procedure may be triggered by a special message from the M2M service layer on the wireless network side or by a normal domain name system (DNS) query.
• DNS domain name system
• the wireless network does not have the normal context information for the M2M device which is addressed by the M2M service layer and therefore a special paging message may be introduced.
• the wireless network-initiated attach procedure may operate as follows:
• SGSN/MME serving GPRS support node/mobility management entity
• the paging agent generates a paging message which is similar to paging
• a long term ID which is not allocated by the wireless network itself (e.g. fully qualified domain name (FQDN) or a long term ID (LTID) that was established during a first contact between M2M device and service layer).
• FQDN fully qualified domain name
• LTID long term ID
• the M2M device knows by means of an agreed rule how to determine the time instances at which it is supposed to listen to paging indicators (either on the existing paging channels or on new ones) as a function of the FQDN or long term ID.
• the disclosed approach allows reducing the context that needs to be kept by the wireless network for an M2M device which is not registered to the wireless network to almost zero, beside the allocation of the fully qualified domain name (FQDN) or long term identifier (LTID) plus the cell or group of cells in which the paging needs to occur.
• FQDN fully qualified domain name
• LTID long term identifier
• the wireless network-initiated attach procedure may also use the existing paging mechanisms for devices that are already registered but not attached.
• the disclosed approach contains a new paging mechanism which may be used to page M2M devices that are currently not registered in the wireless network, but for which a long term ID (LTID) has been established already.
• the disclosed approach may be coupled with the flexibility to allow for very long paging cycles to enable long battery life on the M2M device side.
• a registration-less paging procedure may include one or more of the following steps:
• the M2M device which just established its long term ID with the M2M service layer is of the special type that can use the new paging mechanism.
• the core network records the cell or a set of cells that comprise the coverage area of the M2M device and maps this coverage area to the established long-term ID of the M2M device. In one aspect, this information is the small context that is maintained in 100007
• this context is kept static (i.e., not updated) until requested by the M2M device (e.g. when M2M device is moved from one place to another).
• the actual mechanism in the radio access network by which the pages are sent may be the existing ones (i.e. use existing paging channels including paging indicators) or new ones (different paging channels, with no or different paging indicators).
• the M2M device may receive some paging data (e.g. paging message) with this page.
• the paging data may be a short data packet from a M2M application (e.g. user data) or it may be special data for triggering further action.
• One option for the special data is sending a command to initiate a regular attach procedure from the M2M device side.
• the proposed solutions are also applicable to M2M systems which do not use a M2M service layer.
• the proposed solutions could also be used in M2M systems where a M2M server desires to reach a M2M device through the wireless network, e.g., WW AN.
• the M2M server would just need to be able to send a request for a wireless network-initiated attach from the core network of 100007
• the concept could also be extended to initiating attachment of groups of M2M devices by the wireless network.
• FIG. 4 illustrates a first example of a flow diagram for registration-less paging.
• M2M machine-to-machine
• the mobile device detects a valid page for the identified mobile device during the determined time instance.
• FIG. 5 illustrates a second example of a flow diagram for registration- less paging.
• block 510 perform registration, set up a connection and establish a mobile device identity for a machine-to-machine (M2M) device in a wireless network.
• M2M machine-to-machine
• the connection is set up with a M2M service layer.
• the device identity for a M2M device i.e., M2M device identity
• LTID long term ID
• the identified mobile device can use a new paging mechanism.
• the indication is made to a core network within the wireless network.
• block 530 tear down the connection and de-register the identified mobile device from the wireless network.
• the detecting the valid page also includes receiving paging data, such as, user data or special data which triggers further action.
• the special data may be a command which initiates a regular attach procedure from the M2M device side.
• FIG. 6 illustrates an example of a flow diagram for a network-initiated attach procedure.
• receive a request to attach a mobile device in a wireless network In one example, the mobile device is a M2M device.
• the request arrives at a paging agent on a core network side.
• the request arrives through a M2M service layer or through a domain name system (DNS) system.
• the paging agent is a serving GPRS support node (SGSN) or mobile management entity (MME).
• SGSN serving GPRS support node
• MME mobile management entity
• generate a paging message based on the request to attach the mobile device.
• the paging message includes a long term ID (LTID).
• LTID long term ID
• the LTID is not allocated by the wireless network itself.
• the LTID is allocated as a fully qualified domain name (FQDN) or a long term ID (LTID) which was established during a first contact between the mobile device and service layer.
• more than one paging indicator is sent.
• one or more paging indicator is sent during one or more time instances.
• the agreed rule is based on the FQDN or on the LTID.
• the attach procedure is triggered by detection of the paging indicators. 100007
• the processing units may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units 100007
• ASICs application specific integrated circuits
• DSPs digital signal processors
• DSPDs digital signal processing devices
• PLDs programmable logic devices
• FPGAs field programmable gate arrays
• processors controllers, micro-controllers, microprocessors, other electronic units 100007
• the implementation may be through modules (e.g., procedures, functions, etc.) that perform the functions described therein.
• the software codes may be stored in memory units and executed by a processor unit.
• the various illustrative flow diagrams, logical blocks, modules and/or algorithm steps described herein may also be coded as computer-readable instructions carried on any computer-readable medium known in the art or implemented in any computer program product known in the art.
• the steps or functions described herein may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium.
• Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
• a storage media may be any available media that can be accessed by a computer.
• such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
• any connection is properly termed a computer-readable medium.
• the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, 100007
• Disk and disc includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
• a processor is coupled with a memory which stores data, metadata, program instructions, etc. to be executed by the processor for implementing or performing the various flow diagrams, logical blocks and/or modules described herein.
• Figure 7 illustrates an example of a device 700 comprising a processor 710 in communication with a memory 720 for executing the processes for registration-less paging.
• the device 700 is also for executing the processes for a network-initiated attach procedure.
• the device 700 is used to implement the algorithms illustrated in Figures 4, 5, 6 and 11.
• the memory 720 is located within the processor 710.
• the memory 720 is external to the processor 710.
• the processor includes circuitry for implementing or performing the various flow diagrams, logical blocks and/or modules described herein.
• Figure 8 illustrates a first example of a device 800 suitable for registration-less paging.
• the device 800 is implemented by at least one processor comprising one or more modules configured to provide different aspects of 100007
• each module comprises hardware, firmware, software, or any combination thereof.
• the device 800 is also implemented by at least one memory in communication with the at least one processor.
• Figure 9 illustrates a second example of a device 900 suitable for registration-less paging.
• the device 900 is implemented by at least one processor comprising one or more modules configured to provide different aspects of registration-less paging as described herein in blocks 910, 920, 930, 940, 950 and 960.
• each module comprises hardware, firmware, software, or any combination thereof.
• the device 900 is also implemented by at least one memory in communication with the at least one processor.
• Figure 10 illustrates an example of a device 1000 suitable for a network- initiated attach procedure.
• the device 1000 is implemented by at least one processor comprising one or more modules configured to provide different aspects of a network- initiated attach procedure as described herein in blocks 1010, 1020, 1030 and 1040.
• each module comprises hardware, firmware, software, or any combination thereof.
• the device 1000 is also implemented by at least one memory in communication with the at least one processor.
• Figure 1 1 illustrates an example of a flow diagram for registration-less paging from a mobile device perspective.
• block 1140 start an attach procedure based on the received valid page. In one aspect, the step in block 1140 is optional.
• Figure 12 illustrates an example of device 1200 for implementing registration-less paging from a mobile device perspective.
• the device 1200 is implemented by at least one processor comprising one or more modules configured to provide registration-less paging from a mobile device perspective as described herein in blocks 1210, 1220, 1230 and 1240.
• each module comprises hardware, firmware, software, or any combination thereof.
• the device 1200 is also implemented by at least one memory in communication with the at least one processor.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Mobile Radio Communication Systems (AREA)
• Telephonic Communication Services (AREA)

Priority Applications (5)

Applications Claiming Priority (4)

Publications (1)

Family

ID=44142268

Family Applications (1)

Country Status (8)

Cited By (4)

Families Citing this family (33)

Citations (5)

Family Cites Families (24)

• 2010
  • 2010-12-10 US US12/965,681 patent/US10251146B2/en active Active
  • 2010-12-13 CN CN201080056116.7A patent/CN102652450B/zh active Active
  • 2010-12-13 TW TW099143505A patent/TWI441545B/zh not_active IP Right Cessation
  • 2010-12-13 EP EP10796236.7A patent/EP2510730B1/en active Active
  • 2010-12-13 CN CN201510191012.1A patent/CN104869528B/zh active Active
  • 2010-12-13 WO PCT/US2010/060136 patent/WO2011072303A1/en active Application Filing
  • 2010-12-13 BR BR112012013833-2A patent/BR112012013833B1/pt not_active IP Right Cessation
  • 2010-12-13 JP JP2012543334A patent/JP2013514015A/ja not_active Withdrawn
  • 2010-12-13 KR KR1020127017963A patent/KR101383871B1/ko active IP Right Grant
• 2014
  • 2014-07-11 JP JP2014143372A patent/JP5937149B2/ja not_active Expired - Fee Related

Patent Citations (5)

Also Published As

Similar Documents

Legal Events