Patent Application
20110158163
The present application claims the benefit of Indian Patent Application No. 1476/KOL/2009, filed Dec. 28, 2009, which is hereby incorporated by reference in its entirety.
Ad hoc networks are decentralized wireless networks which do not rely on a pre-existing infrastructure, such as access points or dedicated routers, but instead utilize each node in forwarding data for other nodes. “For-the-purpose” networks are ad-hoc networks that are formed by a group of nodes utilizing their own wireless interfaces for collaborative tasks. These networks are generally formed when an infrastructure network is either unreliable or non-existent, and therefore are usually short lived and self-centric. By self-centric, it is implied that the node within the network may be disinterested in communication outside the network, for example with the internet. “For-the-purpose” networks may be established for conferences, exhibitions or any other such places. Such networks may or may not have a large number of participating nodes. Typically all nodes may be confined within certain predefined geographical limits. Furthermore, the nodes may be executing a predefined set of services, such as application support and communication services.
One desire for “for-the-purpose” networks is quick employability to decrease the time required to start communication between nodes. This suggests reducing both network start-up time and the time for formulating a logical distribution infrastructure. In this regard, network start-up time mainly refers to topology awareness before commencement of transmission within a single hop, while logical distribution infrastructure implies the formation of a tree or mesh for distribution of data. These two activities are among the most energy and bandwidth consuming activities on the network, which can influence network performance greatly.
The IEEE 802.11 standard, broadly used for wireless networking today, is designed to support both infrastructure and ad-hoc wireless networks. IEEE 802.11 coordinates a plurality of nodes' access of the wireless medium through a Distributed Coordination Function (DCF) that is based on a distributed, contention based carrier sensing with collision avoidance (Carrier Sense Multiple Access with Collision Avoidance, or CSMA/CA) Media Access Control (MAC) protocol. Under this protocol, a node wishing to transmit must listen for the channel status during an interval of time called the DCF Inter-Frame Space (DIFS), wherein frames are digital data transmission units. If the channel is found to be busy during the DIFS interval, the sending node may defer its transmission. Control frames of IEEE 802.11 have a duration field which is used to set the Network Allocation Vector (NAV) within the node to identify the time period after which the node enters into a contention phase. If a channel is found to be idle for DIFS, the sending node is free to take control of the wireless medium, and does so by raising a Request to Send (RTS) frame. The receiving node waits for the Small Inter-Frame Space (SIFS) duration, after which it sends a Clear to Send (CTS) frame. Subsequently the sending node sends a DATA frame which the receiving node replies to with an Acknowledgement (ACK) frame, both of which are separated by the SIFS duration. This protocol enables peer-to-peer unicast communication between one-hop neighbors.
It is convenient to characterize the control and transmission of data over a network using the concept of layers. In these characterizations, a network and what is transmitted over it are divided into separate abstraction layers, where each layer is a collection of similar functions that serve the layer above it, and receives service from the layer below it.
One model, the Transmission Control Protocol/Internet Protocol (TCP/IP) reference model, abstracts network functions into four layers. TCP/IP Layer 1, the Link Layer, provides the ability to transfer data by managing the delivery of frames through the use of physical addressing. TCP/IP Layer 2, the Network Layer, manages the routing function by maintaining end to end connection from source to target machines using the routing functions. TCP/IP Layer 3, the Transport Layer, provides the inter-process communication, error correction, and other functions, such as reliability management. TCP/IP Layer 4, or the Application Layer, interacts directly with a software application, and determines the identity and availability of communication partners for an application with data to transmit to.
Under another model, the Open System Interconnection Reference Model (OSI Model), layered communications are abstracted into seven layers. OSI Layer 2, the Data Link layer, is broadly analogous to TCP/IP Layer 1 in that it manages the delivery of data transfers between network entities through physical addressing. OSI Layer 3, the Network Layer, is analogous to the Network Layer of TCP/IP Layer 2. Additional models, both presently existing, or developed in the future, may also be used to characterize network interactivity, however the nomenclature is unimportant, and focus should remain instead on the roles taken by the layers.
Currently, routing issues for ad-hoc networks are typically controlled from the Network Layer, TCP/IP Layer 2 (OSI Layer 3). Routing and related issues from this layer and above contribute considerable control traffic towards TCP/IP Layer 1, the Link Layer (OSI Layer 2, the Data Link Layer). Moreover, the transmission is essentially uni-casting in nature. To support multicasting and broadcasting, additional provisions should be made and maintained throughout the life of the network.
Services, another essential component of a network, represent the functionality a network can perform, and typically remain at the core of network operations. Currently the service related issues for ad-hoc networks are addressed at application layer. Service-related provisions also contribute towards control traffic, creating considerable control overhead at TCP/IP Layer 1 (OSI Layer 2), and presenting a high cost for bandwidth scarce “for-the-purpose” networks.
Features of the invention are shown in the drawings, in which like reference numerals designate like elements. The drawings form part of this original disclosure in which:
In the description which follows, a number of terms are used. Terms may be defined as follows:
Node. Any device that may interact on a network, including but not limited to a computer, a handheld device, a mobile device, a netbook, a smart phone, mobile internet device, and so on.
Sending node. A node that is in a state that wishes to transmit data.
Listening node. Any node that is in a 1-hop vicinity of a sending node.
Participating node. Any node that determines, based on a service code transmitted by a sending node, that it wishes to participate in communication with the sending node.
Non-participating node. Any node that determines, based on a service code transmitted by a sending node, that it does not wish to participate in communication with a sending node.
Referring to
The service code may be of any suitable type or configuration, including but not limited to a number comprising a node identifier and a unique identification number for a service. As a non-limiting example, in some embodiments the service code could be 64 bits long, wherein the first 48 bits would identify a node within a network, while the remaining 16 bits could define the services extended by the node. The node identifier can be any suitable identifying number, including but not limited to the node's identification number, for example, the node's MAC ID number. In an embodiment, a service may be known over a network by the service code. In an embodiment, nodes may store service codes in a code table. In an embodiment, the code table may be periodically refreshed across the nodes. In an embodiment, there may be a default initial set of services. Some default services may perform basic network maintenance and operation management, including but not limited to topology assessment, and code table initialization.
Once the first frame has been generated, the sending node may have to wait until the network channel is free to transmit the frame. Returning to
As seen in step 130, once the first frame has been transmitted from the sending node to the listening nodes, the sending node determines if at least one of the one or more listening nodes has determined that it is a participating node. In some embodiments, the sending node's determination process comprises receiving a second frame from each participating node. The second frame may be in accordance with any number of routing protocols, including but not limited to any of the IEEE 802.11 specification protocols, such as 802.11a, 802.11b, 802.11 g, and 802.11n. In some embodiments, as illustrated in
If there are no participating nodes, then there are no nodes to which data may be transferred. In an embodiment, if no ICTS frames are received by the sending node within a predetermined interval of time, the sending node may mark the transmission accordingly, and may resume with other transmissions on queue. Returning to
In some embodiments where at least one listening node is a participating node, determining if any listening nodes are participating nodes comprises receiving a second frame from the participating nodes. The method 100 may further comprise receiving a third frame from the participating nodes. In some embodiments, method 100 may further comprise determining path reliability from the third frame (160). This may be done by any suitable means, including but not limited to comparing the third frame and the second frame to analyze deviation in their existence or content.
The third frame may be in accordance with any number of routing protocols, including but not limited to any of the IEEE 802.11 specification protocols, such as 802.11a, 802.11b, 802.11 g, and 802.11n. In some embodiments, as illustrated in
Returning to
If based on the service code a listening node is a participating node, the participating node may then proceed to step 230, where it may transmit a second frame. The second frame may be in accordance with any number of routing protocols, including but not limited to any of the IEEE 802.11 specification protocols, such as 802.11a, 802.11b, 802.11 g, and 802.11n. In some embodiments, as illustrated in
Returning to the embodiment of
As seen in step 260 of the embodiment of method 200 in
In an embodiment, this duration includes the time required for any participating nodes to transmit the first frame (which may include the integrated service code), the second frame, the piece of data, and the third frame. As a non-limiting example, in embodiments where the frames are respectively IRTS, ICTS, and IACK, the duration of the sleep mode may be a time t1, wherein t1=(TIRTS+SIFS+N*TICTS(N)+α*SIFS+TDATA+N*TIACK(N))−β*TIACK. Within the calculation of such an embodiment, T values are the time to transmit each frame or piece of data, SIFS is the time of the Small Inter-Frame Space (the time between a data frame and an acknowledgement), N is the number of nodes transmitting the respective frames, and α and β are appropriate constants. In an embodiment, any values of α and β may be used which provide sufficient time for contention and confirmation. In various embodiments, the value of the constant α may be selected to provide time for retransmission of collided ICTS frames that may occur in spite of the common contention process. In some embodiments, the value of β may be chosen such that all non-participating nodes awaken from their sleep modes prior to a subsequent transmission, which may ensure that all nodes have the opportunity to access the medium, and are not habitually asleep when the medium is free for transmission. In an embodiment, β may be selected to provide a fractional time of TIACK. In some embodiments, α and β are approximately 3 and 0.5 respectively. In other embodiments, other values for α and β may of course be used. In some embodiments, after sleeping the node may proceed back to channel assessment (step 205), and take part in communication afresh.
In an embodiment illustrated in
In an embodiment, as seen in
If after receiving the first frame 425 the listening node determines based on the service code within the first frame that it is a non-participating node, then the listening node may enter a sleep state 450. This sleep state may be for any suitable duration, including the time required for any participating nodes to transmit the first frame (which may include the integrated service code), n(ICTS) frames, the piece of data, and n(IACK) frames. After the sleep duration is complete, the non-participating node may awake 460, and return to an idle state 400, wherein it may wait before attempting to send or receive its next transmission
Turning now to
As depicted in
Depending on the desired configuration, processor 910 may be of any type including but not limited to a microprocessor (μP), a microcontroller (μC), a digital signal processor (DSP), or any combination thereof. Processor 910 may include one more levels of caching, such as a level one cache 911 and a level two cache 912, a processor core 913, and registers 914. An example processor core 913 may include an arithmetic logic unit (ALU), a floating point unit (FPU), a digital signal processing core (DSP Core), or any combination thereof. An example memory controller 915 may also be used with processor 910, or in some implementations memory controller 915 may be an internal part of processor 910.
Depending on the desired configuration, system memory 920 may be of any type including but not limited to volatile memory (such as RAM), non-volatile memory (such as ROM, flash memory, etc.) or any combination thereof. System memory 920 may include an operating system 921, one or more applications 922, and program data 924. Application 922 may include a service oriented network routing algorithm 923 that is arranged to perform the functions as described herein including those described with respect to method 100 of
Computing device 900 may have additional features or functionality, and additional interfaces to facilitate communications between basic configuration 901 and any required devices and interfaces. For example, a bus/interface controller 940 may be used to facilitate communications between basic configuration 901 and one or more data storage devices 950 via a storage interface bus 941. Data storage devices 950 may be removable storage devices 951, non-removable storage devices 952, or a combination thereof. Examples of removable storage and non-removable storage devices include magnetic disk devices such as flexible disk drives and hard-disk drives (HDD), optical disk drives such as compact disk (CD) drives or digital versatile disk (DVD) drives, solid state drives (SSD), and tape drives to name a few. Example computer storage media may include volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data.
System memory 920, removable storage devices 951 and non-removable storage devices 952 are examples of computer storage media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which may be used to store the desired information and which may be accessed by computing device 900. Any such computer storage media may be part of computing device 900.
Computing device 900 may also include an interface bus 942 for facilitating communication from various interface devices (e.g., output devices 960, peripheral interfaces 970, and communication devices 980) to basic configuration 901 via bus/interface controller 940. Example output devices 960 include a graphics processing unit 961 and an audio processing unit 962, which may be configured to communicate to various external devices such as a display or speakers via one or more A/V ports 963. Example peripheral interfaces 970 include a serial interface controller 971 or a parallel interface controller 972, which may be configured to communicate with external devices such as input devices (e.g., keyboard, mouse, pen, voice input device, touch input device, etc.) or other peripheral devices (e.g., printer, scanner, etc.) via one or more I/O ports 973. An example communication device 980 includes a network controller 981, which may be arranged to facilitate communications with one or more other computing devices 990 over a network communication link via one or more communication ports 982.
The network communication link may be one example of a communication media. Communication media may typically be embodied by computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and may include any information delivery media. A “modulated data signal” may be a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media may include wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency (RF), microwave, infrared (IR) and other wireless media. The term computer readable media as used herein may include both storage media and communication media.
Computing device 900 may be implemented as a portion of a small-form factor portable (or mobile) electronic device such as a cell phone, a personal data assistant (PDA), a personal media player device, a wireless web-watch device, a personal headset device, an application specific device, or a hybrid device that include any of the above functions. Computing device 900 may also be implemented as a personal computer including both laptop computer and non-laptop computer configurations.
The present disclosure is not to be limited in terms of the particular embodiments described in this application, which are intended as illustrations of various aspects. Many modifications and variations can be made without departing from its spirit and scope, as will be apparent to those skilled in the art. Functionally equivalent methods and apparatuses within the scope of the disclosure, in addition to those enumerated herein, will be apparent to those skilled in the art from the foregoing descriptions. Such modifications and variations are intended to fall within the scope of the appended claims. The present disclosure is to be limited only by the terms of the appended claims, along with the full scope of equivalents to which such claims are entitled. It is to be understood that this disclosure is not limited to particular methods, reagents, compounds compositions or biological systems, which can, of course, vary. It is also to be understood that the terminology used herein is for the purpose of describing particular embodiments only, and is not intended to be limiting.
With respect to the use of substantially any plural and/or singular terms herein, those having skill in the art can translate from the plural to the singular and/or from the singular to the plural as is appropriate to the context and/or application. The various singular/plural permutations may be expressly set forth herein for sake of clarity.
It will be understood by those within the art that, in general, terms used herein, and especially in the appended claims (e.g., bodies of the appended claims) are generally intended as “open” terms (e.g., the term “including” should be interpreted as “including but not limited to,” the term “having” should be interpreted as “having at least,” the term “includes” should be interpreted as “includes but is not limited to,” etc.). It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases “at least one” and “one or more” to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim recitation to embodiments containing only one such recitation, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an” (e.g., “a” and/or “an” should be interpreted to mean “at least one” or “one or more”); the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should be interpreted to mean at least the recited number (e.g., the bare recitation of “two recitations,” without other modifiers, means at least two recitations, or two or more recitations). Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). In those instances where a convention analogous to “at least one of A, B, or C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B.”
In addition, where features or aspects of the disclosure are described in terms of Markush groups, those skilled in the art will recognize that the disclosure is also thereby described in terms of any individual member or subgroup of members of the Markush group.
As will be understood by one skilled in the art, for any and all purposes, such as in terms of providing a written description, all ranges disclosed herein also encompass any and all possible subranges and combinations of subranges thereof. Any listed range can be easily recognized as sufficiently describing and enabling the same range being broken down into at least equal halves, thirds, quarters, fifths, tenths, etc. As a non-limiting example, each range discussed herein can be readily broken down into a lower third, middle third and upper third, etc. As will also be understood by one skilled in the art all language such as “up to,” “at least,” “greater than,” “less than,” and the like include the number recited and refer to ranges which can be subsequently broken down into subranges as discussed above. Finally, as will be understood by one skilled in the art, a range includes each individual member. Thus, for example, a group having 1-3 cells refers to groups having 1, 2, or 3 cells. Similarly, a group having 1-5 cells refers to groups having 1, 2, 3, 4, or 5 cells, and so forth.
While various aspects and embodiments have been disclosed herein, other aspects and embodiments will be apparent to those skilled in the art. The various aspects and embodiments disclosed herein are for purposes of illustration and are not intended to be limiting, with the true scope and spirit being indicated by the following claims.
| Number | Date | Country | Kind |
|---|---|---|---|
| 1476/KOL/2009 | Dec 2009 | IN | national |
