WO2008024099A2 - Peer-to-peer network and user information discovery and sharing for mobile users and devices - Google Patents

Abstract

Systems and methods for mobile peer-to-peer information sharing are disclosed. With the preferred systems and methods, mobile users and devices collect information about networks that they visit, and carry that information as they move to new networks. Mobile users and/or devices then share such information directly with each other.

Description

PEER-TQ-PEER NETWORK AND USER INFORMATION DISCOVERY AND SHARING FOR MOBILE

USERS AND DEVICES DESCRIPTION

BACKGROUND

[Para 1 ] Field of the Invention:

[Para 2] The present application relates to, inter alia, methods for peer-to-peer network and information discovery systems and methods. The entire disclosures of each of the following co-pending provisional patent applications of the present assignees are incorporated herein by reference: (1 ) U.S. Provisional Patent Application Serial Number 60/625,1 06 entitled Network Discovery Mechanisms filed on November 5, 2004; (2) U.S. Provisional Patent Application Serial Number 60/593,377 entitled Network Discovery Mechanisms filed on January 9, 2005; and (3) U.S. Provisional Patent Application Serial Number __ entitled Network Discovery Mechanisms filed on April 1 3, 2005.

Background Discussion:

[Para 3] General Background Discussion:

[Para 4] Networks and Internet Protocol

[Para 5] There are many types of computer networks, with the Internet having the most notoriety. The Internet is a worldwide network of computer networks. Today, the Internet is a public and self-sustaining network that is available to many millions of users. The

Internet uses a set of communication protocols called TCP/IP (i.e., Transmission Control

Protocol/Internet Protocol) to connect hosts. The Internet has a communications infrastructure known as the Internet backbone. Access to the Internet backbone is largely controlled By Internet^' Service^' Providers (ISPs) that resell access to corporations and individuals.

[Para 6] With respect to IP (Internet Protocol), this is a protocol by which data can be sent from one device (e.g., a phone, a PDA [Personal Digital Assistant], a computer, etc.) to another device on a network. There are a variety of versions of IP today, including, e.g., IPv4, IPv6, etc. Each host device on the network has at least one IP address that identifies the host device's point of attachment to the IP networks.

[Para 7] IP is a connectionless protocol. The connection between end points during a communication is not continuous. When a user sends or receives data or messages, the data or messages are divided into components known as packets. Every packet is treated as an independent unit of data.

[Para 8] In order to standardize the transmission between points over the Internet or the like networks, an OSI (Open Systems Interconnection) model was established. The OSI model separates the communications processes between two points in a network into seven stacked layers, with each layer adding its own set of functions. Each device handles a message so that there is a downward flow through each layer at a sending end point and an upward flow through the layers at a receiving end point. The programming and/or hardware that provides the seven layers of function is typically a combination of device operating systems, application software, TCP/IP and/or other transport and network protocols, and other software and hardware.

[Para 9] Typically, the top four layers are used when a message passes from or to a user and the bottom three layers are used when a message passes through a device (e.g., an IP host device). An IP host is any device on the network that is capable of transmitting and receiving IP packets, such as a server, a router or a workstation. Messages destined for 'sdmd όthέr'H'dslt'cireiiOtiiaSSecl up to the upper layers but are forwarded to the other host. In the OSI and other similar models, IP is in Layer-3, the network layer.

Wireless Networks

[Para 10] Wireless networks can incorporate various types of mobile devices, such as, e.g., cellular and wireless telephones, PCs (personal computers), laptop computers, wearable computers, cordless phones, pagers, headsets, printers, PDAs, etc. For example, mobile devices may include digital systems to secure fast wireless transmissions of voice and/or data. Typical mobile devices include some or all of the following components: a transceiver (i.e., a transmitter and a receiver, including, e.g., a single chip transceiver with an integrated transmitter, receiver and, if desired, other functions); an antenna; a processor; one or more audio transducers (for example, a speaker or a microphone as in devices for audio communications); electromagnetic data storage (such as, e.g., ROM, RAM, digital data storage, etc., such as in devices where data processing is provided); memory; flash memory; a full chip set or integrated circuit; interfaces (such as, e.g., USB, CODEC, UART, PCM, etc.); and/or the like.

[Para 1 1] Wireless LANs (WLANs) in which a mobile user can connect to a local area network (LAN) through a wireless connection may be employed for wireless communications. Wireless communications can include, e.g., communications that propagate via electromagnetic waves, such as light, infrared, radio, microwave. There are a variety of WLAN standards that currently exist, such as, e.g., Bluetooth, IEEE 802.1 1 , and HomeRF.

[Para 12] By way of example, Bluetooth products may be used to provide links between mobile computers, mobile phones, portable handheld devices, personal digital assistants (PDAs), and other mobile devices and connectivity to the Internet. Bluetooth is a computing and tielecb'riiffitιhieati5ϊ1-; Trii3ύ§try specification that details how mobile devices can easily interconnect with each other and with non-mobile devices using a short-range wireless connection. Bluetooth creates a digital wireless protocol to address end-user problems arising from the proliferation of various mobile devices that need to keep data synchronized and consistent from one device to another, thereby allowing equipment from different vendors to work seamlessly together. Bluetooth devices may be named according to a common naming concept. For example, a Bluetooth device may possess a Bluetooth Device Name (BDN) or a name associated with a unique Bluetooth Device Address (BDA). Bluetooth devices may also participate in an Internet Protocol (IP) network. If a Bluetooth device functions on an IP network, it may be provided with an IP address and an IP (network) name. Thus, a Bluetooth Device configured to participate on an IP network may contain, e.g., a BDN, a BDA, an IP address and an IP name. The term "IP name" refers to a name corresponding to an IP address of an interface.

[Para 1 3] An IEEE standard, IEEE 802.1 1 , specifies technologies for wireless LANs and devices. Using 802.1 1 , wireless networking may be accomplished with each single base station supporting several devices. In some examples, devices may come pre-equipped with wireless hardware or a user may install a separate piece of hardware, such as a card, that may include an antenna. By way of example, devices used in 802.1 1 typically include three notable elements, whether or not the device is an access point (AP), a mobile station (STA), a bridge, a PCMCIA card or another device: a radio transceiver; an antenna; and a MAC (Media Access Control) layer that controls packet flow between points in a network. [Para 14] In addition, Multiple Interface Devices (MIDs) may be utilized in some wireless networks. MIDs may contain two independent network interfaces, such as a Bluetooth interface and an 802.1 1 interface, thus allowing the MID to participate on two separate netwόrks''is^;;iwel'ra^'s to'interfate with Bluetooth devices. The MID may have an IP address and a common IP (network) name associated with the IP address.

[Para 1 5] Wireless network devices may include, but are not limited to Bluetooth devices, Multiple Interface Devices (MIDs), 802.1 I x devices (IEEE 802.1 1 devices including, e.g., 802.1 I a, 802.1 I b and 802.1 I g devices), HomeRF (Home Radio Frequency) devices, Wi-Fi (Wireless Fidelity) devices, GPRS (General Packet Radio Service) devices, 3G cellular devices, 2.5G cellular devices, GSM (Global System for Mobile Communications) devices, EDGE (Enhanced Data for GSM Evolution) devices, TDMA type (Time Division Multiple Access) devices, or CDMA type (Code Division Multiple Access) devices, including CDMA2000. Each network device may contain addresses of varying types including but not limited to an IP address, a Bluetooth Device Address, a Bluetooth Common Name, a Bluetooth IP address, a Bluetooth IP Common Name, an 802.1 1 IP Address, an 802.1 1 IP common Name, or an IEEE MAC address.

[Para 16] Wireless networks can also involve methods and protocols found in, e.g., Mobile IP (Internet Protocol) systems, in PCS systems, and in other mobile network systems. With respect to Mobile IP, this involves a standard communications protocol created by the Internet Engineering Task Force (IETF). With Mobile IP, mobile device users can move across networks while maintaining their IP Address assigned once. See Request for Comments (RFC) 3344. NB: RFCs are formal documents of the Internet Engineering Task Force (IETF). Mobile IP enhances Internet Protocol (IP) and adds means to forward Internet traffic to mobile devices when connecting outside their home network. Mobile IP assigns each mobile node a home address on its home network and a care-of-address (CoA) that identifies the current location of the device within a network and its subnets. When a device is moved to a different network, it receives a new care-of address. A mobility agent on the home network can associate each home address with its care-of address. The mobile node can setid the Ηόrri'iέ;¹ ^erita bihicring update each time it changes its care-of address using, e.g., Internet Control Message Protocol (ICMP).

[Para 1 7] In basic IP routing (i.e. outside mobile IP), typically, routing mechanisms rely on the assumptions that each network node always has a constant attachment point to, e.g., the Internet and that each node's IP address identifies the network link it is attached to. In this document, the terminology "node" includes a connection point, which can include, e.g., a redistribution point or an end point for data transmissions, and which can recognize, process and/or forward communications to other nodes. For example, Internet routers can look at, e.g., an IP address prefix or the like identifying a device's network. Then, at a network level, routers can look at, e.g., a set of bits identifying a particular subnet. Then, at a subnet level, routers can look at, e.g., a set of bits identifying a particular device. With typical mobile IP communications, if a user disconnects a mobile device from, e.g., the Internet and tries to reconnect it at a new subnet, then the device has to be reconfigured with a new IP address, a proper netmask and a default router. Otherwise, routing protocols would not be able to deliver the packets properly.

Network and Information Discovery

[Para 18] In the evolution of wireless networking based on, e.g., wireless LAN (Local Area Network) and cellular technologies, and as mobility services prevail and people become increasingly mobile, it is increasingly important for a mobile device to be able to find an appropriate point of network attachment that meets the application requirements and the characteristics of the mobile, in a timely, accurate and efficient manner. By way of example, such network discovery can relate to, e.g., the discovery of information that the mobile station uses to access a network, such as, by way of example, a network attachment point identification (e.g., an L2 address and/or a geographical address of an access point), SL tøAt ^/ty-p§'W.g^;;lV ^'"{&.£' mi Xλ g") of an access point, a security type (e.g., "WPA" or "PANA and IPsec") supported by an access point, a layer-3 type (e.g., "IPv4 only" or "IPv4/v6 dual stack"), a provider name, or the addresses of a server or an agent (e.g., PANA authentication agents, access routers, SIP servers and Mobile IP home agents). [Para 19] Additionally, mobile users and their mobile devices (e.g., mobile phones, Personal Digital Assistants, notebook computers, on-vehicle networking devices and/or the like) need to discover a growing range of information as they travel across potentially heterogeneous radio networks. This information includes, e.g.:

[Para 20] • User-interest information (i.e., information of interest to human users): Examples include the existence and/or locations, etc., of: a) local networks (such as, e.g., public hotspot networks and/or the like); b) network services (such as, e.g., voice-over-IP services and/or the like); c) networked devices (such as, e.g., printers, displays, disks and/or the like); d) applications and/or software utilities; e) location-sensitive information, application contents, dynamically changing information (such as, e.g., news information, local area information, information regarding traffic accidents and/or road conditions and/or the like) and/or the like, which are in the current and/or neighboring networks. In the preferred examples, a neighboring network includes a nearby network that a mobile device or user can move into (such as, e.g., a subsequent or next network from its current network). Depending on circumstances, a neighboring network's radio coverage area may or may not overlap with a radio coverage area of the mobile device's or user's current network.

[Para 21 ] • Device-interest information: Emerging mobile devices often need information, which human users may or may not be interested in, regarding neighboring networks to better support mobility and mobile applications. For example, to reduce handoff delay and interruptions to on-going user applications during handoff, a mobile device can petfόfm pfe-ftand'off processing, before it starts the handoff into a target network. For example, a mobile device may acquire a local IP address from, and even authenticate with, the target network when the mobile is still using its current network to transport user application traffic even before the mobile detects the radio signals from the target network. To do so, the mobile device needs to know, e.g., the IP address of the IP address server (e.g., the Dynamic Host Configuration Protocol or DHCP server) and the authentication server in the target network before it starts handoff to the target network. See, e.g., device-interest information discussed in the above-referenced co-pending provisional applications entitled Network Discovery Mechanisms incorporated herein by reference above.

{Para 22] In this document, mobile users and mobile devices may be referred to generally as "mobiles" in, e.g., contexts where there is no need to distinguish between a human user and a device.

[Para 23] Several frameworks and protocols are available for discovering network services and devices, which have been referred to as service discovery approaches. See, e.g.. the below references [1 ], [2], [3] and [5], incorporated herein by reference. Examples of services include, by way of example: shared network devices such as, e.g., printers, displays and/or disks; software utilities; information such as, e.g., databases and files; and/or the like. The leading service discovery frameworks include Jini (see reference [1 ] below), (see reference UPnP [2] above), and Salutation (see reference [3] below).

[Para 24] These services were described in the above co-pending provisional applications entitled Network Discovery Mechanisms, incorporated herein by reference above and are discussed in the following paragraphs.

[Para 25] First, Jini allows devices and software components to form a dynamic distributed network system. It provides mechanisms for service construction, lookup, communication, and use in a distributed system. All services are registered with a central register. Clients locate services using a directory service referred to as the lookup service. [Para 26] Second. Salutation provides a method for applications, services and devices to describe and advertise their capabilities, and to find other applications, services and devices. The Salutation architecture has two major components: Salutation Manager and Transport Manager. Salutation Manager is a service broker. Each service provider registers its capability with a Salutation Manager. A client queries a Solution Manager to find a service, and the Salutation Managers coordinate with each other to locate the service for the client. The Transport Manager provides reliable transport of Solution messages. [Para 27] Third, the Universal Plug and Play (UPnP) is architecture for dynamically establishing peer-to-peer network connectivity among user devices. It provides capabilities for devices to dynamically join a network, obtain an IP address, convey its capabilities upon request, and learn about the presence and capabilities of other devices. UPnP does not use central service registry.

[Para 28] These existing service discovery mechanisms focus on discovering existing network services and devices. Among other deficiencies, they cannot support the discovery of dynamic information, such as changing traffic conditions, accidents, and/or other dynamically changing information. They allow a device to discover only other devices, services, or applications that implement the same service discovery platform. For example, an UPnP device may not be able to discover an IP router or a piece of network information or user content that is not implemented based on UPnP. Furthermore, existing service discovery methods do not support "neighborhood discovery" - e.g., discovering information regarding neighboring networks and location-based information, such as, e.g.: the existence and/or locations of neighboring networks; addresses of the DHCP servers, autfie'hti cation ^"servers,^" and SIP servers in a neighboring network; and /or other location- based network information and user content available in the neighboring networks. [Para 29] Recently, an autonomous collaborative discovery approach was proposed by the present inventors, see item [6] below, to support real-time discovery of user and network information including location-sensitive information, dynamic information (e.g., traffic conditions), and neighboring networks (e.g., existence and locations of neighboring networks, and addresses of key network elements such as access routers and authentication servers in neighboring networks). In this approach, mobile users and their mobile devices act as scouts to collect user and network information as part of their routine use of each network. They then make the information available on a knowledge server, which can be independent of network providers, to be shared by all subscribing mobile users and devices of the knowledge server.

[Para 30] Recognizing that existing service discovery approaches lack the ability to support neighborhood discovery, the Internet Engineering Task Force (IETF) has been developing a Candidate Access Router Discovery (CARD) protocol (see reference [4] below) that allows user devices to discover the IP address and capabilities of access routers in neighboring networks. CARD, however, has a number of limitations, including: [Para 31] • It requires neighboring access routers to use the CARD protocol to dynamically exchange network information, which is difficult when neighboring networks belong to different network providers.

[Para 32] • It requires all access routers to implement the CARD protocol to communicate with mobile users, which is a difficult proposition.

[Para 33] • A mobile device can only obtain the information a local network provider configures its CARD protocol to provide. Thus, the available information can vary significantly from network to network. This is unsuitable to support mobile devices that may heed ^'differerit'iήfόrmatiόh depending on their different networking capabilities and user applications.

[Para 34] Recently, peer-to-peer file sharing over the Internet has been growing rapidly. With reference to FIG. 1 , existing peer-to-peer file sharing mechanisms can be classified into the following categories, depending on the techniques used in discovering the files: [Para 35] • Approaches using centralized index server clusters: These approaches use centralized index server clusters to maintain up-to-date indexes that indicate which end devices have which popular files. When a user wants a file, it first queries an index server to find out which peers may have the requested file. Then, the user can go to the peers directly to get the file. By way of example, this type of method is used by the popular music file sharing system Napster (see, e.g.. references [10], [1 1 ] and [1 2] below). [Para 36] • Approaches using no index: These approaches do not maintain any index. Instead, they rely on flooding for a user to find the files that the user wants. For example, Gnutella ((see, e.g.. references [10], [1 1 ] and [1 2] below) is a peer-to-peer file sharing system using such methods. When a user wants a file, the user sends a request to all of its neighbors. Each neighbor will, in turn, forward the request to its own neighbors. Each node with the requested file sends the file to the request originator. The scope of the search is typically controlled by the number of hops that the request can be forwarded. [Para 37] • Approaches using local indexes: Each user maintains its local index pointing to the locations of frequently requested files. For example, Freenet (see, e.g.. references [10] and [1 1 ] below) is a file sharing system that uses local indexes. When a node receives a request for a file, it searches its local index first to see if it knows where the requested file is located. If it knows the locations, it forwards the request to only those locations. This reduces the query traffic volume over the networks. (Paifa ^'3^'S]^'"^"1 Existing ^' peer-to-peer file sharing methods are not designed for sharing information in a highly time-sensitive manner (such as, e.g., information about neighboring networks), which is important for mobile users/devices, especially for in-vehicle networking devices (e.g., networking devices fixedly mounted within a vehicle, such as, e.g., related to navigation and/or information systems and/or other systems). Furthermore, they are not designed for network neighborhood discovery.

[Para 39] The preferred embodiments improve upon technologies described, e.g., in the following information, each of which is incorporated herein by reference in its entirety:

[Para 40] [1 ] Sun Microsystems Inc., http://www.sun.com/jini/;

[Para 41 ] [2] Microsoft Corporation, "Universal Plug and Play Device Architecture", http://www.upnp.org/;

[Para 42] [3] Salutation Consortium, "Salutation Architecture Specification", June 1 ,

1999, http://www.salutation.org/;

[Para 43] [4] Marco Liebsch and Ajoy Singh (editors), "Candidate Access Router

Discovery", Internet Draft draft-ietf-seamoby-card-protocol-06.txt, Internet Engineering

Task Force, June 2004;

[Para 44] [5] K. Arabshian, H. Schulzrinne, "CloServ: Global Service Discovery

Architecture", Mobiquitous 2004, Boston;

[Para 45] [6] T. Zhang, S., Madhani, E. van den Berg, "AC-CDS Autonomous

Collaborative Collection, Discovery, and Sharing of User and Network Information",

International Conference on Information Technology: Research and Education (ITRE),

Hsinchu Taiwan, June 28, 2005;

[Para 46] [7] Resource Description Framework, http: / /www.w3.orq /TR/rdf-primer:

[Para 47] [8] SOAP, Simple Object Access Protocol, http://www.w3.org/TR/soap12: "[PaUra'^ef^{"'11 '}"""^Y'-" "^" pT?ϊajOϊet;"^"b. Gardy, L. Thimonier, "Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search", Discrete Applied Mathematics 39, pp. 207-229, 1992;

[Para 49] [10] A. Creapo, H. Garcia-Molina, "Routing Indices for Peer-to-Peer Systems;" [Para 50] [1 1 ] A. Saroiu, PX Gummadi, S.D. Gribble, "A Measurement Study of Peer-to- Peer Sharing Systems;" [Para 51] [1 2] http: / /www.napster.com: [Para 52] [1 3] http: / /qnutella.wego.com; [Para 53] [14] http: / /f reetnet.sourceforqe.com.

SUMMARY OF THE INVENTION

[Para 54] The present invention improves upon the above and/or other background technologies.

[Para 55] According to some of the preferred embodiments, a novel mobile peer-to-peer information sharing (hereinafter referred to with the acronym MP2P-IS) method is employed that addresses the real-time information discovery needs of mobile users and their devices. In some preferred embodiments, MP2P-IS has at least some, preferably all, of the following characteristics:

[Para 56] • The ability to discover and share information about neighboring networks, in a highly timely manner;

[Para 57] • The use of application-centric approaches that allow mobiles to discover information they want, rather than merely what network providers think they may need; [Para 58] • The ability to discover dynamically changing information; [Para 59] • The existence of no or virtually no dependency on local networks, except for transporting user packets; and/or [Para^" 6^'O] • The support of heterogeneous radio systems (such as, e.g., those which may belong to competing network providers who may not be motivated or may not have established the necessary agreements to share network information with each other). [Para 61 ] In some preferred embodiments, neighborhood discovery is used as an example to describe MP2P-IS. In some illustrative embodiments, mobile users may include pedestrians (such as, e.g., carrying mobile devices or the like) or people in moving vehicles (such as, e.g., being transported with mobile devices or the like). In various embodiments, mobile devices can involve in-vehicle networking devices, handheld devices, mobile sensors such as sensors on moving vehicles or carried on people, and/or any other now or later known or developed mobile devices.

[Para 62] According to some illustrative embodiments, a method of network neighborhood discovery of neighboring-network and location-based information using mobile peer-to-peer information sharing includes: a) having a plurality of mobiles each collect network and location-based information regarding networks that it uses; b) having each of the mobiles maintain the information for a finite period even after it leaves a network for which the information is collected; c) having a first mobile of the plurality of mobiles transmit a request for neighboring-network information or location-based information to peer mobiles of the first mobile; and d) having at least one of the peer mobiles transmit at least some of the requested information to the first mobile based on the information collected by the at least one of the peer mobiles. In some embodiments, the location-based information includes dynamically changing user content information available in neighboring networks and/or or dynamic events that the mobile devices or their users can observe.

[Para 63] According to other illustrative embodiments, a method for mobile peer-to-peer information sharing includes: a) having a plurality of mobile devices each collect TήforfaέtMnWφlrdiriψhetwόYKs that it uses; b) having each of the mobile devices maintain the information even after it leaves a network for which such information is collected; c) transmitting a request for neighboring-network information regarding neighboring networks from a first of the plurality of mobile devices to a set of first contact peers of the plurality of mobile devices; d) determining if the set of first contact peers is sufficient for obtaining the neighboring-network information regarding neighboring networks; e) if a determination is that the set of first contact peers are insufficient, transmitting a request for neighboring-network information regarding neighboring networks from the first of the plurality of mobile devices to a set of extended peers of the plurality of mobile devices. In some preferred embodiments, the information regarding networks that the mobile devices used includes device-interest information and/or user-interest information. [Para 64] In some embodiments, the method includes having the set of first contact peers include peers that are in the first mobile device's current IP sub-network. In some embodiments, the method includes having the plurality of mobile devices each maintain a list of extended peers, and having the first mobile device transmit messages to the extended peers' contact addresses, such as, e.g., the extended peers' unicast IP addresses. In some preferred embodiments, the extended peers include peers that the mobile got to know in a previous network, and preferably the mobile devices retain each extended peer for a finite lifetime which is based on a time period or on a network location. [Para 65] According to the preferred embodiments, mobiles share information in a peer- to-peer manner without requiring that the peers have direct radio connectivity with one another. On the other hand, according to the preferred embodiments, peer-to-peer sharing of information among mobiles is performed in a manner such that mobiles can be peers of one another regardless of whether or not they have direct radio connectivity with one another. [Para '66] ' " ""F IbHH^rrTi'ci'ffeT'^cb^'rding to the preferred embodiments, peer mobiles can use any combination of different radio access technologies and can be interconnected via an IP network. By way of example, in the preferred embodiments, a mobile with a WiFi radio can be a peer with a mobile with a CDMA2000 radio as long as, for example, they both can transmit and receive IP packets to each other (such as, e.g., via an IP network interconnecting the WiFi and the CDMA2000 radio access networks). Moreover, even in circumstances where a plurality of mobile peers use the same type of radio technology, they do not necessarily have to have direct radio connectivity with each other. By way of example, the mobiles can each be connected to, e.g., a radio access point and can communicate with one another through the access point.

[Para 67] In this disclosure, in various embodiments, a transmission from a first peer to a second peer can be direct or indirect. In addition, in various embodiments, transmissions can involve transmissions over wireless and/or wired communication media. For illustrative purposes, in some embodiments, a first peer can send a wireless transmission to a radio access point that may, in turn, send a wired transmission destined for another peer (e.g., directly or indirectly destined for the other peer).

[Para 68] In the preferred embodiments, the transmission of communications between peers, whether direct or indirect, is performed in substantially real time, without substantial delay imposed by intermediate system or network components, such as, e.g., radio access points. However, in some embodiments, intermediate system or network components could potentially impose some delay in the transmission of communications, such as, e.g., by storing data received from peers and sending a modified transmission to a requesting mobile based on transmission(s) received from one or more peer (such as, e.g., transmitting a message aggregating information from a plurality of peers). [Para 69] lri a^'dditϊόni it is contemplated that in some embodiments, a mobile can be connected to and /or disconnected to a variety of networks over time and that such connections can include wireless connections and/or wired connections in various embodiments. By way of example, a mobile may send and receive wireless signals in acquiring information from one network, and may then potentially be moved to a new network where it is attached via a wired connection.

[Para 70] The above and/or other aspects, features and/or advantages of various embodiments will be further appreciated in view of the following description in conjunction with the accompanying figures. Various embodiments can include and/or exclude different aspects, features and/or advantages where applicable. In addition, various embodiments can combine one or more aspect or feature of other embodiments where applicable. The descriptions of aspects, features and/or advantages of particular embodiments should not be construed as limiting other embodiments or the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[Para 71 ] The preferred embodiments of the present invention are shown by a way of example, and not limitation, in the accompanying figures, in which: [Para 72] FIG. 1 is a schematic architectural diagram depicting existing peer-to-peer file sharing methods;

[Para 73] FIG. 2 is a schematic architectural diagram showing an illustrative scenario related to the collection of information and movement of mobile devices between networks according to some illustrative embodiments;

[Para 74] FIG. 3 is a schematic architectural diagram showing an illustrative scenario related to the use of extended peers according to some illustrative embodiments; and [Para 75]^''"'" ""'l^ϊ^'G 1^!'"^^'' is^""a" gf ajSH teal diagram depicting rate of change in number of neighboring networks discovered verses the number of mobiles in the local area network according to some illustrative and non-limiting analytical models.

DISCUSSION OF THE PREFERRED EMBODIMENTS

[Para 76] While the present invention may be embodied in many different forms, a number of illustrative embodiments are described herein with the understanding that the present disclosure is to be considered as providing examples of the principles of the invention and that such examples are not intended to limit the invention to preferred embodiments described herein and/or illustrated herein.

Introductory Discussion

[Para 77] In modern networking environments, mobile users and their devices need to discover a growing range of information. Users may want to know, for example, the existence and locations of surrounding networks and the local services and application contents available on these networks. Emerging mobile devices, especially networking devices on moving vehicles (such as, e.g., vehicle mounted computer devices, navigation systems, information systems, etc.), may need to know information about neighboring networks so that they can, for example, acquire a local IP address from, and authenticate with, a neighboring network before an actual handoff starts or even before the mobile device detects a radio signal from the neighboring network. Such pre-handoff processing allows, among other things, fast-moving vehicles to roam seamlessly across homogeneous and heterogeneous radio systems.

[Para 78] As described below, the preferred embodiments of the present invention provide a mobile peer-to-peer information sharing (hereinafter referred to with the acronym MP≥V-fSj mefnod In which mobile users and devices collect information about each network they visit during their routine use of the network. Rather than forgetting the information after leaving the network, a mobile device carries the information with it as it moves into other networks. In the preferred embodiments, MP2P-IS takes advantage of a users' natural mobility to bring information collected by user devices to locations where that information can be useful to, and easily accessible by, other users and devices. The mobile users and devices then share directly with each other the information they need. [Para 79] Thus, according to some of the preferred embodiments, a novel mobile peer- to-peer information sharing method is employed that addresses the real-time information discovery needs of mobile users and their devices. In some preferred embodiments, MP2P- IS has at least some, preferably all, of the following characteristics: [Para 80] • The ability to discover and share information about neighboring- networks, in a highly timely manner;

[Para 81 ] • The use of application-centric approaches that allow mobiles to discover information they want, rather than merely what network providers think they may need; [Para 82] • The ability to discover dynamically changing information; [Para 83] • The existence of no or virtually no dependency on local networks, except for transporting user packets; and/or

[Para 84] • The support of heterogeneous radio systems (such as, e.g., those which may belong to competing network providers who may not be motivated or may not have established the necessary agreements to share network information with each other).

Detailed Discussion

[Para 85] In some preferred embodiments, neighborhood discovery is used as an example to describe MP2P-IS. In some illustrative embodiments, mobile users may include pedestrians (such as¹; ^'"e7gτ; Carrying mobile devices or the like) or people in moving vehicles (such as, e.g., being transported with mobile devices or the like). In various embodiments, mobile devices can involve in-vehicle networking devices, handheld devices, and/or any other now or later known or developed mobile devices.

[Para 86] In some preferred embodiments, MP2P-IS uses the following at least some, preferably all, of the following principles and basic methods that differ from other service discovery approaches or CARD.

[Para 87] First, in the preferred embodiments, mobile users and their devices collect device-interest and user-interest information regarding each network they visit as part of their routine use of the network.

[Para 88] As shown in FIC. 2, for example, after using Network 1 , a mobile A can learn a wide range of information regarding the network without any extra assistance from the network provider. Such information may include the type of the network (such as, e.g., IEEE 802.1 l a/b/g networks, IEEE 802.16 networks or the like), the addresses of the radio access points and the parameters needed to connect to them, the IP addresses of the IP access routers, the DHCP server, the authentication server, the authentication protocols supported, local content, and /or other network and user information the user and the user's device used in the network. In addition, the mobile may discover additional information regarding a visited network if the visited network supports service discovery capabilities and the mobile device implements the service discovery protocol required by the visited network. [Para 89] In various embodiments, a mobile user or device can collect a broad range of information about the networks it detects and/or uses. For instance, in some embodiments, when a mobile device receives radio beacons from a wireless network, it can learn the existence of the network, the general location of the network, the type of the network, and/or capabilities of the network. Additionally, once a mobile device connects to "a ^"network! ^'successfully::^{' '}aj ϊrie device can also know the addresses of the key network elements in the network, such as the addresses of the IP address servers and the authentication servers (e.g., if authentication is required); and b) a human user can also know the user information contents he finds or uses in the network. Additionally, mobile users and devices can also observe or detect dynamic events (such as, e.g., events depending on circumstances at a particular time, such as, for example, traffic conditions or other conditions, etc.) and can accumulate information contents related thereto. [Para 90] In some instances, mobile users and devices themselves can operate as information creators. For example, a user may accumulate information in the user's mobile communication device about the points of interest or attraction that the user has visited, time-sensitive information about a point of interest or attraction the user is currently visiting (such as, e.g., current waiting times in traffic or at an establishment, etc.) and/or the like, and can make the information available to other users. By way of example, a mobile device could include, e.g., a user interface, such as a key board or the like, that a user can operate to enter text or alphanumeric data related to such information. [Para 91] With reference to FIG. 2, in this illustrative example, after moving from Network 1 to Network 2, the mobile device also preferably knows that Networks 1 and _? are neighboring networks. If the mobile receives radio signals from the two networks at the same time, it preferably further knows that the two networks have overlapping radio coverage areas.

[Para 92] In preferred embodiments, each mobile user and device does not have to know what information other mobiles need. Instead, in preferred embodiments, it simply collects the information that it needs for itself.

[Para 93] Second, in the preferred embodiments, rather than forgetting (e.g., deleting or discarding) the information regarding the network after the mobile device leaves the fteftvoric,^^"W2P^::ISTfibBire^1'device preferably carries the information with it (preferably, for a finite time period) as it moves into other networks. In preferred embodiments, MP2P- IS takes advantage of a users' natural mobility to bring the information collected by each user to locations where the information can be useful to, and easily accessible by, other mobiles.

[Para 94] In the illustrative example shown in FIG. 2, after the mobile A moves into Network 2, the information it collected about Network 1 can become useful to a mobile S which is in the Network i? and which desires to know the information regarding its neighboring networks. It is noteworthy that the mobile 5 may not even know that there is even any neighboring network at all.

[Para 95] Notably, a single peer may potentially not have all of the information needed by a mobile. By way of example, the peer mobile A in FIG. 2may potentially only know about Network 1 and may potentially not know anything about other neighboring networks of mobile S. However, in some circumstances, a proper set of peers may collectively know all the information that a mobile needs at the time that the mobile needs it. The determination of a proper set of peers is discussed below.

[Para 96] Third, in the preferred embodiments, mobiles share directly, in a peer-to-peer fashion, with each other the information they need. Preferably, this sharing is carried out in an on-demand manner. In this regard, by way of example with reference to FIG. 2, consider a mobile device that learns the IP address of an authentication server in Network 1 and the parameters needed by a mobile to authenticate with Network 1 (such as, e.g., security protocol used in Network 1), from the radio signals it has received from Network 1 or as a result of connecting to the network. The mobile device will carry the information with it when it moves into a neighboring Network 2, where it can share that information with other mobiles who wish to know the information. t^ra"97I^u Wxt, we" consider how a mobile, such as, e.g., a mobile S shown in FIC. 2, discovers information about neighboring networks from peer mobiles. To discover information, the mobile S preferably queries a set of peers. In this disclosure, we refer to the set of peers that mobile S queries first and directly each time it initiates information discovery as mobile's "First Contact Peers."

[Para 98] Here, there are a few fundamental considerations that we now address:

[Para 99] 1. First, we consider how a mobile can determine the set of first contact peers in a way that allows the mobile to get the information it needs quickly.

[Para 100] 2. Second, we consider how to extend the search scope when the first contact peers cannot provide the requested information.

[Para 101] Addressing these considerations is more difficult in mobile networks than in peer-to-peer file sharing over the Internet due to, e.g., the following:

[Para 102] • Information discovery by mobiles often needs to be done in a very time sensitive manner.

[Para 103] • The set of peers that has the information needed by a mobile can change rapidly and dynamically. For example, with reference to FIC. 2, as a mobile S moves from the Network 1 to the Network 2, the peers that mobile S used in Network 1 to get information regarding Network Vs neighboring networks may not know anything about

Network 2's neighboring networks. In particular, the set of peers that has the information needed by a mobile may depend on the locations of the mobile and the peers, and how long each peer keeps the information it learns about a network. Therefore, in some preferred embodiments, a mobile selects its first contact peers based on its current location and updates the list dynamically as the mobile moves about.

[Para 104] • It is difficult for a mobile to locate and reach peers outside its current local IP subnet. This is because: (Pith ¹I U$Y "o"¹ " ^|l It is'diffictilt! to know the IP addresses (or other forms of contact address) of the peers outside the mobile's local IP subnet.

[Para 106] o it is often difficult to use broadcasting to reach even the peers in a neighboring network. First, two neighboring radio networks can be an arbitrary IP hop count away from each other, making it difficult for the mobile to control its IP broadcast scope to reach a neighboring network. Second, a network often does not accept broadcast packets from a different network; this is especially the case when the two networks belong to different network providers. Besides, flooding even only the neighboring networks is not an attractive approach because it would be too costly and too time-consuming. Third, a mobile may not even know whether there is any neighboring network when it wishes to discover its neighboring networks.

[Para 107] o it is difficult for a mobile to track the peers that it got to know in the past. Notably, a peer's IP address can change when it moves from one network to another network. In addition, different peers may use different mobility management protocols. Furthermore, some peers may not even have any IP-layer or higher-layer mobility support, making it difficult for a mobile to track the peers as they move from network to network. [Para 108] According to the preferred embodiments, the following approach is advantageously employed for a mobile to dynamically establish and update a list of its contact peers to discover information from regarding neighboring networks. [Para 109] First, a mobile's default set of first contact peers are preferably the peers that are in the mobile's current visited IP sub-network. In such a case, a mobile can preferably reach its default peers by, e.g.,, broadcasting a query message within the local IP subnetwork without having to know the identities and/or addresses of such default peers. [Para 1 1 0] Second, if the default first contact peers do not provide all the requested information, the search scope is preferably extended. To extend the search scope, a mobile prefe'raW rriathWnSYsei o'r^'Hst of "Extended Peers." Preferably, this set of extended peers is in addition to its first contact peers. IN some instances, an extended peer can be outside the mobile's current IP subnet, in which case the mobile should know an extended peer's contact address, such as, e.g., its unicast IP address (or other forms of contact address such as a SIP URI), so that it can contact the extended peer via a standard IP unicast or the like. [Para 1 1 1] In some embodiments, extended peers are selected by using all of the peers that the mobile got to know in a previous network. For example, in the illustrative example shown in FIG. 3, the mobile A remembers the first contact peers it used in Network 1 when it moves into Network <?, where these peers will become mobile A's "extended peers." As a result, while in Network 2, mobile A may potentially contact these extended peers. Notably, these extended peers may have also moved out of the Network 1 into other networks. As a result, these extended peers may be able to provide the information that the mobile A wants. For instance, in the example shown in FIC. 3, the mobile C will now be able to tell mobile A that Network 3 is a neighboring network of Network 1 .

[Para 1 12] As indicated above, in some instances, an extended peer may have changed its IP address since the time the requesting mobile last contacted it. This means that the requesting mobile may not always be able to reach all of its extended peers. However, it is not necessary to reach all of the peers, but rather to reach a sufficient number of such peers. That is, the goal is preferably not to reach all the extended peers, but to reach enough peers so that the peers it reaches will collectively have the information needed by the requesting mobile with a satisfactorily high probability.

[Para 1 1 3] In the preferred embodiments, a mobile maintains each extended peer for a finite lifetime. In some examples, a mobile may remove an extended peer from its set or list a) if the extended peer has not been used for a certain time period and/or b) if the mobile has moved far away from where it first got to know the extended peer (such as, e.g., baSed 6ri' phylsiea'l ldtation;"suth as, e.g., determined by global positioning systems and/or other means, based on numbers of networks, and /or the like). By way of example, if the mobile A in FIG. 3maintains each extended peer as long as the mobile is not more than two networks away from the network in which the mobile got to know the extended peer, then it will still remember its extended peer (e.g., mobile C) that it got to know in Network 1 and, thus, it can ask mobile C for information about its current neighboring networks. [Para 1 14] Third, in some preferred embodiments, before a mobile seeks to know the information about its neighboring networks, it can determine whether querying its first contact peers alone should allow it to get the information it needs with a high enough probability. In some preferred embodiments, methods described below can be employed. In this regard, one illustrative way to make such a determination is to use a predictive model based on the mobile's experience of getting the information it needs from its first contact peers alone in the previous networks. In some embodiments, the mobile can record whether it has obtained sufficient information from its first contact peers alone in the previous networks, then it may use a statistical model to predict whether it will likely obtain the information it needs again from only its first contact peers.

[Para 1 1 5] If the mobile determines that its first contact peers alone will not likely provide all the requested information, in some embodiments, it may send the initial query to its extended peers and to its first contact peers at the same time. In addition, based on such a determination or under other circumstances, the mobile can also send an instruction to its first peers to extend the search. For example, the mobile can use a Time-To-Live (TTL) field in the initial query message to instruct the first peers that they should extend the search to their respective peers (e.g., to their default and /or extended peers). That is, depending on circumstances, the mobile does not have to wait until it receives responses ^"from^"1 its first contact peers before it starts contacting the extended peers, such that query delays are reduced.

[Para 1 16] Fourth, in some preferred embodiments, upon receiving a query, a peer returns the requested information to the request originator if the peer has the requested information. In some embodiments, the peer then determines whether it should further forward the query to its own default peers and/or extended peers based on the value of the TTL field in the received query message. In some preferred embodiments, each time a peer forwards a query message, it decrements the TTL field in the message. In such cases, a peer receiving the request message with, e.g., a zero TTL will not forward the message any further.

[Para 1 17] Preferably, in order to ensure that peers can discover and exchange information, each mobile describes the information items in a standard and extensible manner. In some illustrative embodiments, MP2P-IS can employ the Resource Description Framework (RDF).

[Para 1 18] In addition, the protocol used for mobiles to communicate with each other to discover and share information is preferably a standard protocol so that mobile devices manufactured by different equipment makers can share information with each other. It is also preferably lightweight. That is, it should, e.g., have low time complexity (i.e., should not create excessive delay), low power consumption if it is implemented on power- constrained mobile devices, and/or low software complexity to reduce cost, such as when it is to be implemented on small devices. In some illustrative embodiments, MP2P-IS can employ the Simple Object Access Protocol (SOAPKsee. e.g.. reference [8] above).

Analytical Models ΪPlJ-a' T^'l &l ^AδMήctf-ftfetfaβbVe, in some cases, a mobile may operate (such as, e.g., be programmed or otherwise configured) so as to carryout a determination of whether to contact certain peers, such as, e.g., using a predictive model.

[Para 120] In this regard, an important question for consideration is: how likely will a mobile be able to get the information it needs from its first contact peers alone? This is an important question because, among other things:

[Para 1 21] • First, when a mobile's first contact peers have the requested information, the latency of information discovery is minimized. In addition, the network resources consumed for information discovery is also reduced.

[Para 122] • Second, the answers will provide guidance to determine how many first contact peers a mobile needs to have so that it can get the information it wants without having to extend its search scope beyond its first contact peers.

[Para 123] • Third, when a mobile's first contact peers are peers inside the mobile's current IP subnet, answers to the above question helps determine how many peers need to be in an IP subnet for a mobile to be able to get the information it needs simply by querying only the peers inside the mobile's current IP subnet. Querying peers inside the current IP subnet is much easier than querying other peers because the mobile does not have to maintain the IP addresses of the peers inside the current IP network.

[Para 1 24] In the following paragraphs, an exemplary preferred analytical model is described and analysis results are provided that help to answer the following question: how many peers have to be inside a network so that they collectively have information about all neighboring networks?

[Para 125] Consider a mobile Mi in a Network Ni, wherein the mobile desires to know the information regarding all of its neighboring networks. Here, we consider the case of inquiring about all neighboring networks because a mobile may not know whether there is a neighboring network and may not be sure which specific neighboring network it will move into next.

[Para 1 26] Here, let N={Ni, N2, N3, ...N_n} be the set of the neighboring networks plus Network Ni. Let M2, M3, ...,Mk} be the set of mobiles in Network Ni at the time mobile Mi wishes to know about Ni 's neighboring networks. Assume that each mobile M-, (i= l , ...k) came into Network Ni from each network Nj 0=1. ■■■. π) with uniformly equal probability. Thus, we ask the question: how large will k need to be for the Ar mobiles in network Ni to collectively have the information regarding all the neighboring networks? [Para 1 27] Here, the problem of determining the value of Ar can be considered as becoming the "Coupon Collector's Problem." See reference [9] above. The Coupon Collector's Problem can be formulated as follows: how many balls Ar do we have to throw in n bins before each bin contains at least one ball? In such an example, the n bins correspond to the number of networks (i.e., n networks) and the Ar balls correspond to the number of mobiles (i.e., k mobiles) in Network Ni needed to collectively have the information regarding all the n- 1 neighboring networks of Network Ni .

[Para 128] Let S(J) be the average number of mobiles (including the requesting mobile) in a network Ni before the mobiles collectively have the information regarding j different networks. In an example, we will assume that the request originator (i.e., mobile Mi) does not have knowledge regarding any neighboring network when it sends out its query. We assume that it only knows about Ni . Therefore, S(I )=I .

[Para 1 29] Given that the mobiles in Network Ni have already had information regarding j distinct networks, we denote by M(J) as the average number of additional mobiles that are needed to be in network Ni so that the mobiles in Network Ni will know about a new neighboring network. Then, S(n) can be expressed as: S(n - 1) = S(n - 2) + M (n - 2)

5(2) = 5(1) + M (I) 5(I) = I

[Para 1 30] Now, suppose that the current mobiles in network Ni have information about n-1 distinct networks. Then, the probability that one additional mobile in network Ni will bring information about a new neighboring network will be 1 /n. The probability that only the second additional mobile in network Ni will bring the information about a new neighboring network can be expressed as ((n-1)/n)(l /n). The probability that only the third additional mobile in network Ni will bring the information regarding a new neighboring network can be expressed as ((n-l )/n)((n-l )/n)(l /n), and so on. Therefore, M(n-l ) can be calculated as follows:

[Para 131 ] Similarly, we can derive that:

n-k

[Para 1 32] Therefore, we have:

_{S(Λ) β l +} _»_ ₊ -^_ ₊ _«_ ₊ _JL.₊ ... _{+ Λ} rt - l «. - 2 n - 3 n - 4

= // Vi ₊ I 2 ₊I 3 ₊... ₊- n ~U I I n Jl

[Para 133] Based on this model, FIG. 4is a graph that shows neighboring networks discovered verses the number of mobiles in the local network. FIG. 4 demonstrates the number of neighboring networks a mobile will be able to discover by broadcasting a query to only the local network as a function of the number of mobiles currently in the local network. It can be observed from FIG. 4 that it takes only a small number of peers in the local network to provide the information regarding all of the neighboring networks. This suggests that the present MP2P-IS approach, even in its simplest form, in which a mobile queries only peers in its local network area (e.g., IP subnet), should perform well in sparsely populated networks and/or in networks that have small coverage areas. [Para 134] The preferred embodiments provide a new peer-to-peer approach for mobile users and their mobile devices to discover and share, in real time, e.g., network information regarding and /or user content in neighboring networks. The foregoing analysis results reveal that a mobile will often be able to find the information it needs simply by broadcasting a query to the peers in its local IP subnet, even when there is only a small number of peers in the local IP subnet.

[Para 135] In some illustrative embodiments, where, as discussed above, a mobile operates so as to carry out a determination of whether to contact extended peers, the determination can include a determination of the number of peers in the current network, such that based on the foregoing, the mobile will be able to predict if additional peers may be necessary. In some preferred embodiments, based on the foregoing analytical model, the mobile communications to extended peers and from such extended peers can be minimized as the number of peers required to have all necessary information is often a small number.

Broad Scope of the Invention

[Para 1 36] While illustrative embodiments of the invention have been described herein, the present invention is not limited to the various preferred embodiments described herein, but includes any and all embodiments having equivalent elements, modifications, omissions, combination^'s (e!gl, of aspects across various embodiments), adaptations and /or alterations as would be appreciated by those in the art based on the present disclosure. The limitations in the claims (e.g., including that to be later added) are to be interpreted broadly based on the language employed in the claims and not limited to examples described in the present specification or during the prosecution of the application, which examples are to be construed as non-exclusive. For example, in the present disclosure, the term "preferably" is non-exclusive and means "preferably, but not limited to." In this disclosure and during the prosecution of this application, means-plus-function or step-plus-function limitations will only be employed where for a specific claim limitation all of the following conditions are present in that limitation: a) "means for" or "step for" is expressly recited; b) a corresponding function is expressly recited; and c) structure, material or acts that support that structure are not recited. In this disclosure and during the prosecution of this application, the terminology "present invention" or "invention" may be used as a reference to one or more aspect within the present disclosure. The language present invention or invention should not be improperly interpreted as an identification of criticality, should not be improperly interpreted as applying across all aspects or embodiments (i.e., it should be understood that the present invention has a number of aspects and embodiments), and should not be improperly interpreted as limiting the scope of the application or claims. In this disclosure and during the prosecution of this application, the terminology "embodiment" can be used to describe any aspect, feature, process or step, any combination thereof, and/or any portion thereof, etc. In some examples, various embodiments may include overlapping features. In this disclosure, the following abbreviated terminology is employed: "e.g." which means "for example."

Claims

What is claimed is:

[Claim 1 ] 1. A method of network neighborhood discovery of neighboring-network and location-based information using mobile peer-to-peer information sharing, comprising: a) having a plurality of mobiles each collect network and location-based information regarding networks that it uses; b) having each of said mobiles maintain said information for a finite lifetime even after it leaves a network for which said information is collected; c) having a first mobile of said plurality of mobiles transmit a request for neighboring-network information or location-based information to peer mobiles of said first mobile; and d) having at least one of said peer mobiles transmit at least some of said requested information to said first mobile based on said information collected by said at least one of said peer mobiles.

[Claim 2] 2. The method of claim 1 , wherein said location-based information includes dynamically changing user content information available in neighboring networks or dynamic events that the mobile devices or their users can observe.

[Claim 3] 3. A method for mobile peer-to-peer information sharing, comprising: a) having a plurality of mobile devices each collect information regarding networks that it uses; b) having each of said mobile devices maintain said information even after it leaves a network for which such information is collected; C) " tfSW§ffi'itting a request for neighboring-network information regarding neighboring networks from a first of said plurality of mobile devices to a set of first contact peers of said plurality of mobile devices; d) determining if said set of first contact peers is sufficient for obtaining said neighboring-network information regarding neighboring networks; e) if a determination is that said set of first contact peers are insufficient, transmitting a request for neighboring-network information regarding neighboring networks from said first of said plurality of mobile devices to a set of extended peers of said plurality of mobile devices.

[Claim 4] 4. The method of claim 3, wherein said information regarding networks that the mobile devices used includes device-interest information.

[Claim 5] 5. The method of claim 3, wherein said information regarding networks that the mobile devices used includes user-interest information.

[Claim 6] 6. The method of claim 3, wherein said information regarding networks that the mobile devices used includes both device-interest information and user-interest information.

[Claim 7] 7. The method of claim 4, wherein said device-interest information includes information used by the mobile devices to access a network.

[Claim 8] 8. The method of claim 7, wherein said device-interest information includes at least one IP address of an IP address server or an authentication server. [Claim 9] 9. The method of claim 5, wherein said user-interest information includes the location of local networks, network services or networked devices.

[Claim 1 0] 10. The method of claim 5, wherein said user-interest information includes applications and software utilities.

[Claim U ] 1 1. The method of claim 5, wherein said user-interest information includes location-sensitive information or application contents.

[Claim 1 2] 12. The method of claim 5, wherein said user-interest information includes dynamically changing user-interest information.

[Claim 1 3] 13. The method of claim 3, further including having said set of first contact peers include peers that are in said first mobile device's current IP sub-network.

[Claim 1 4] 14. The method of claim 13, further including having said first mobile device broadcast a query message within said current IP sub-network without knowing the identities or addresses of at least some of said first contact peers.

[Claim 1 5] 1 5. The method of claim 3, further including having said plurality of mobile devices each maintain a list of extended peers.

[Claim 16] 16. The method of claim 15, further including having said first mobile device transmit messages to said extended peers' contact addresses. [Claim 1 7] 17. The method of claim 16, further including having said first mobile device transmit unicast messages to said extended peers' unicast IP addresses.

[Claim 1 8] 18. The method of claim 3, further including having said extended peers include peers that the mobile got to know in a previous network.

[Claim 19] 19. The method of claim 15, further including having said mobile devices retain each extended peer for a finite lifetime which is based on a time period or on a network location.

[Claim 20] 20. The method of claim 3, further including having said first mobile device send an initial query concurrently to both its set of first contact peers and its extended peers.

[Clai m 21 ] 21. The method of claim 3, further including having said first mobile device include a time-to-live field in an initial query message, and having said first mobile device's peers extend the search to their own peers.

[Claim 22] 22. The method of claim 3, further including upon receiving a query from said first mobile device having a peer return at least some of said requested information if the peer has at least some of said requested information. tCTafrri 2"3T """^"2"ϊ. ^"The method of claim 3, further including upon receiving a query from said first mobile device having a peer determine whether it should forward the query to its own peers based on a value of a time-to-live field.

[Claim 24] 24. The method of claim 3, wherein said determining includes evaluating how many peers are in an IP sub-network of the first of said mobile devices.

[Claim 25] 25. The method of claim 3, wherein said determining includes determining whether said set of first contact peers do not provide all of the requested information, and extending a search to said extended peers if said first contact peers do not provide all of the requested information.