Patent Grant
8514760
The present invention relates to the field of wireless sensor networks; more specifically, it relates to a wireless sensor network and a method for routing data in a wireless sensor network.
Wireless sensor networks transmit data by hops between sensor nodes. Sending data and receiving data consume power which is generally limited in wireless sensor networks. The multiple hops add time delays to the data transmission time. Present wireless sensor networks and methods do not address both these issues simultaneously. Accordingly, there exists a need in the art to mitigate the deficiencies and limitations described hereinabove.
A first aspect of the present invention is a method, comprising: (a) detecting a temporal event by a source sensor node of a wireless sensor network comprising a multiplicity of sensor nodes; (b) identifying multiple paths from the source sensor node to a sink of the wireless sensor network, the multiple paths consisting of sensor node to sensor node hops; and after (b), (c) using a processor of the source sensor node, optimizing a distribution of data packets to each path of the multiple paths by simultaneously reducing (i) power consumed by sensor nodes in each path of the multiple paths and (ii) a time to transmit the data packets from the source sensor node to the sink.
A second aspect of the present invention is a computer program product, comprising: a computer useable storage medium having a computer readable program therein, wherein the computer readable program when executed on a computer causes the computer to: (a) collect information relative to a temporal event detected by a source sensor node of a wireless sensor network comprising a multiplicity of sensor nodes; (b) identify multiple paths from the source sensor node to a sink of the wireless sensor network, the multiple paths consisting of sensor node to sensor node hops; and after (b), (c) optimize a distribution of data packets to each path of the multiple paths by simultaneously reducing (i) power consumed by sensor nodes in each path of the multiple paths and (ii) a time to transmit the data packets from the source sensor node to the sink.
A third aspect of the present invention is a wireless sensor network, comprising: a set of sensor nodes, each sensor node of the set of sensor nodes including a sensor, a processor, a memory unit, a battery and a transceiver; each sensor node of the set of sensor nodes configured to identify multiple paths from itself to a sink of the wireless sensor network, each path of the multiple paths comprising sensor node to sensor node hops; and each sensor node of the set of sensor nodes configured to optimize a distribution of data packets to each path of the multiple paths by simultaneously reducing (i) power consumed by sensor nodes in each path of the multiple paths and (ii) a time to transmit the data packets from itself to the sink.
These and other aspects of the invention are described below.
The features of the invention are set forth in the appended claims. The invention itself, however, will be best understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein:
In the novel wireless sensor networks of the present invention, data packet routing in wireless sensor networks is an event driven temporal activity. When a sensor node detects an event in its vicinity, it becomes a source node (or source) and initiates a route discovery algorithm to a sink (e.g., a gateway node or a base station). If the data volume is greater than a predetermined data volume limit, multiple sensor node paths from the source to the sink are selected in order to reduce the amount of time to transmit all the information from the source to the sink. The information from the sensor is converted into data packets in the source node. The distribution of data packets over the various paths is computed using an optimization algorithm that adaptively addresses both data transmission delay and power consumption by optimizing the balance between power consumption and transmission delay.
Any sensor node in a wireless sensor network can act as a source but there is only one sink. The sink alone will receive all the data packets sent by the source node(s). There may be multiple source nodes transmitting data over different sets of multiple data paths at the same time to the sink. Each sensor node (nεN) has a unique identifier. The data (D) sensed by each node is divided among the multiple paths (Δj) such that the power consumed by all the sensor nodes in all the paths is minimized to the extent that delay time is not compromised.
Sensors of sensor nodes according to embodiments of the present invention include, but are not limited to, environmental sensors (e.g., temperature, pressure, wind speed, wind direction, light intensity, detection of chemicals and detection of radiation) and monitoring and surveillance sensors (e.g., vehicle presence and/or movement and/or human presence and/or movement).
Power consumption in a wireless sensor network according to embodiments of the present invention is categorized into two parts. The first part is power consumed by processing (by the processor and memory) and sensing (by the sensor). The second part is power consumed by transmitting and receiving data packets (i.e., communication delay). Given j paths, the lifespan of the jth path is Pjmin and is defined as the power remaining to the sensor node with the least amount of remaining power in the jth path. Pjmin thus defines the maximum lifespan of the jth path. For a path to be stable, Pjmin must be equal to or less than the power that will be consumed during the time it takes to transmit all the data packets assigned to the jth path,
Power consumption at each sensor node due to processing and sensing in the jth path is given by:
Kr=nj*tj (1)
where
Kr is the effective rate of power loss from a node due to processing and sensing (joule/second);
nj is the number of sensor nodes in the jth path; and
tj is the time the path is in use for transmitting data packets.
The time delay per data packet per hop is given by:
τj=qj+1/Bj (2)
where
τj is the average delay/packet/hop for jth path (seconds/packet/hop);
qj is the average queuing delay in jth path; and
Bj is the bit rate of the jth path (in packets/seconds).
The power consumed for transmission and reception of data packets over the jth path is given by:
pj=2*Δj*tpj*Hj (3)
where
pj is the power consumed in the jth path;
tpj is the transmission power/packet/hop for jth path (joules/packet/hop);
Δj is the number of data packets transmitted over the jth path; and
Hj is the number of hops in the jth path.
The “2” is because the node must receive and then transmit the data packets.
Comparing equations (1) and (3) Kr is seen to be independent of data packet transmission/reception related energy consumption, so Kr need not be considered in the distribution of data packets to the various paths.
As the data packets are routed simultaneously over the j paths, the communication delay is not the sum of the individual path delays. Instead, the communication delay can be estimated as the maximum of the individual delay paths. Path delay consists of two components. The first is queuing and processing delay (the average queuing delay/packet/hop for the jth path. The second is transmission/reception delay. The source to sink transmission delay (message switching assumed) for the jth path is given by:
TDj=Δj*τj*Hj*pj (4)
where
TDj is the source to sink delay of the jth path;
Δj is the number of data packets transmitted over the jth path
τj=qj+1/Bj (equation 2);
Hj is the number of hops in the jth path; and
pj=1 if a path is selected else pj=0.
Thus, the total delay from source to sink transmission delay (message switching assumed) is given by:
TD=max[(Δj*τj*Hj*pj)] (5).
When a sensor node detects an event in its vicinity it becomes a source node, generates a set of data packets describing the event, and if the number of data packets is greater than a predetermined number, executes a multipath route discovery algorithm to the sink node. Examples of multipath routing algorithms are described in “Multipath Routing Algorithms for Congestion Minimization” by Banner and Orda, IEEE/ACM Transactions on Networking, Vol. 15, No. 2, April 2007, which is hereby incorporated by reference.
The total data volume D is thus divided into datasets Δj, which are distributed over the multiple paths. Data packet distribution is computed using an optimization algorithm given by:
Z=Σj(2*Δj*tpj*Hj*pj) (6)
where Z is the objective function; and
Δj, pj, Hj and pj have been described supra.
The constraints of the optimization problem are:
ΣjΔj=D (7)
max[(Δj*τj*Hj*pj)]≦{[D*τstab*Hstab*pj]+[max[(D/nj*Δj*Hj*pj)]}/2 (8)
2*Δj*tpj+Kr*max(Δj*τj*Hj*pj)<Pjmin (9)
where
Δj, pj, Hj, D, tpj, pj, Pjmin have been described supra;
τstab is the average delay/packet/hop for the maximum life span path (seconds/packet/hop); and
Hstab is the number of hop counts for the maximum life-span path.
Equation (7) requires the total data number of packets must be distributed among multiple paths. Inequality (8) requires that the average delay from the source to the sink is less than a predefined maximum value. Inequality (9) requires that the life-span of a path should be sufficient to transmit the entire volume of data packets sent over it without interruption.
A sensor node must have sufficient amount of energy to be able to receive all the data packets from a previous sensor node and successively transmit all the data packets received to a subsequent node which is covered by the term (2*Δj*tpj). Also the node immediately prior to the sink (terminating node) has to have sufficient power to survive the entire amount of time it will take for all data packets sent along the path to be received and transmitted to the sink, (i.e., the survival time of the terminating node equals to the net end-to-end delay). During this time the terminating node dissipates energy at a rate of Kr. So, the term Kr*max (Δj*τj*Hj*pj) accounts for the amount of power that is dissipated in the terminal node (i.e., the sensor node before the sink).
In the interval of time that it takes to transmit data packets from the source to the sink, the power consumption of each node taking part in data packet transmissions decreases by (2*Δj*tpj)+Kr*max [(Δj*τj*Hj*pj)] and the power of any node not taking part in data packet transmission decreases by Kr*max [(Δj*τj*Hj*pj)].
Returning to step 405. If the data volume is above the preset limit, then the method proceeds to step 420. In step 420, the route discovery algorithm generates multiple paths from the source through the WSN to the sink. Next, in step 425 the source runs the optimization algorithm to distribute the data packets over the multiple paths. Next, in step 430, the source sends the data packets over the multiple paths with transmission time and power consumption being optimized with respect to each other. Steps 420, 425 and 430 are essentially scheme (3) described infra and are illustrated in more detail in
In order to test and verify the embodiments of the present invention, the power consumption of three schemes were simulated. The first scheme is a single-path scheme. The second scheme is a multipath with equal numbers of data packets. The third scheme is the novel multipath and data packet number optimized scheme according to embodiments of the present invention.
In the first, single path scheme (1), the maximum delay=delay caused in a single most stable path if the entire data volume are sent through it (i.e., max [(Δj*τj*Hj*pj)]≦([D*τstab*Hstab*pj]). In the first scheme the upper limit of transmission delay is high and the constraint will be satisfied in most cases.
In the second, multipath equal data packet size scheme (2) the maximum delay=total delay if the data is equally distributed over all the paths (i.e., max [(Δj*τj*Hj*pj)]≦[max (D/nj*τi*Hi*pj)], where n=number of spatial paths). In the second scheme, the upper limit of transmission delay is low and consequently the constraint is very restrictive.
In the third, novel multipath and data packet number optimized scheme (3) the upper limit of delay constraint as the average of values of the upper limits proposed in schemes 1 and 2. The optimization problem of equation (6) has been subsequently solved using an SQP technique.
A simulation program was developed using MATLAB. MATLAB stands for “Matrix Laboratory” and is a numerical computing environment and fourth-generation programming language. Developed by “The MathWorks”, MATLAB allows matrix manipulations, plotting of functions and data, implementation of algorithms, creation of user interfaces, and interfacing with programs written in other languages, including C, C++, and Fortran. First the simulation program runs a route discovery algorithm in an area of 15 by 15 square meters where 192 sensor nodes are deployed randomly. Each of the sensor nodes had a transmission radius of 2.4 meters. The sensor nodes were models based on MICA2 motes available from Crossbow of Milpitas, Ca, USA. The routing algorithm gives five possible paths between the source and sink with the parameters listed in TABLE I:
With these input parameters, the optimization algorithm divides data over the paths for a optimal power consumption relative to transmission delay. The overall power consumption and transmission delay are calculated and compared with corresponding values derived by simulating schemes (1) and (2). The results are shown in
Generally, the method described herein with respect to a method for routing data in a wireless sensor network is practiced as a distributed algorithm and the methods described supra in the flow diagrams
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a wireless sensor network, method of routing of data packets in a wireless sensor network or a computer program product having computer readable program code for routing of data packets in a wireless sensor network embodied thereon. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a sensor node, gateway node or base station which may be a general purpose computer.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The algorithms may be encoded on the computer program product as executable code which may then be loaded into the memory devices of sensor nodes of the wireless sensor network from a removable data and/or program storage device of the base station before or after deployment of the sensor and gateway nodes through their respective transceivers. Alternatively, the algorithms may be encoded on the computer program product as executable code which may then be loaded into the memory devices of sensor nodes of the wireless sensor network from a removable data and/or program storage device of a general purpose computer before deployment of the sensor and gateway nodes through their respective transceivers. Alternatively, the algorithms may be encoded on the computer program product as executable code may be loaded into the memory devices of sensor nodes during a programming step during fabrication of the sensor nodes either through their respective transceivers or by wired access to their respective memory devices.
Thus the embodiments of the present invention provide a wireless sensor network and method of transmitting data over a wireless sensor network that adaptively addresses both data transmission delay and power consumption by optimizing the balance between power consumption and transmission delay.
The description of the embodiments of the present invention is given above for the understanding of the present invention. It will be understood that the invention is not limited to the particular embodiments described herein, but is capable of various modifications, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, it is intended that the following claims cover all such modifications and changes as fall within the true spirit and scope of the invention.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6735630 | Gelvin et al. | May 2004 | B1 |
| 7277414 | Younis et al. | Oct 2007 | B2 |
| 7436789 | Caliskan et al. | Oct 2008 | B2 |
| 7881206 | St. Pierre et al. | Feb 2011 | B2 |
| 8085792 | Aly | Dec 2011 | B1 |
| 20060178156 | Kim | Aug 2006 | A1 |
| 20080253327 | Kohvakka et al. | Oct 2008 | A1 |
| 20090109885 | Fonseca et al. | Apr 2009 | A1 |
| 20090201899 | Liu et al. | Aug 2009 | A1 |
| 20090296704 | Kim et al. | Dec 2009 | A1 |
| 20100278069 | Sharma et al. | Nov 2010 | A1 |
| 20100309841 | Conte | Dec 2010 | A1 |
| Entry |
|---|
| He et al.; “Energy-Efficient Surveillance System Using Wireless Sensor Networks”; Proceedings of ACM MobiSYS 2004. 19 pages. |
| Heinzelman et al.; “Energy-Efficient Communication Protocol for Wireless Microsensor Networks”; IEEE Proceedings of the 33rd Hawaii International Conference on System Sciences, Jan. 2000. pp. 1-10. |
| De et al.; “Meshed multipath routing with selective forwarding: an efficient strategy in wireless sensor networks”; Computer Networks 43 (2003). pp. 481-497. [online]. <URL: http://www.sciencedirect.com/science?—ob=ArticleURL&—udi=B6VRG-4991M83-4&—user=10&—rdoc=1&—fmt=&—orig=search&—sort=d&—docanchor=&view=c&—searchStrld=1144395716&—rerunOrigin=google&—acct=C000050221&—version=1&—urlVersion=0&—userid=10&md5=327cf1d493757f3fc812530bad3cabb6 >. |
| Das et al.; “An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks”; Journal of Parallel and Distributed Computing, vol. 63, 2003. pp. 141-153. |
| Banner et al.; “Multipath Routing Algorithms for Congestion Minimization”; IEEE/ACM Transactions on Networking, vol. 15, No. 2, Apr. 2007. pp. 413-424. |
| Shillingford et al.; Detour: Delay- and Energy-Aware Multi-Path Routing in Wireless Ad Hoc Networks; 2007; [online]. 8 pages < URL: http://netscale.cse.nd.edu/twiki/pub/Main/PubDETOURMobitiquous07/detour.pdf >. |
| Morcos et al.; “M2RC: Multiplicative-increase/additive-decrease Multipath Routing Control for Wireless Sensor Networks”; [online]. 6 pages. < URL: http://www.cs.bu.edu/faculty/best/res/papers/sigbed05.pdf >. |
| Lou et al.; “Performance Optimization using Multipath Routing in Mobile Ad Hoc and Wireless Sensor Networks”; 2005. [online]. 29 pages. < URL: http://web.njit.edu/wins/files/lou-chapter.pdf >. |
| De et al.; “Meshed Multipath Routing: An Efficient Strategy in Sensor Networks”; 2003. 6 pages. [online]. < URL: http://www.cs.ucf.edu/˜turgut/COURSES/EEL5937—SensorNet—Spr04/wcnc—mmpr.pdf >. |
| Inderscience Publishers Ltd; “International Journal of Ad Hoc and Ubiquitous Computing”; Copyright 2004-2009 Inderscience Enterprises Limited. 11 pages. [online]. [retrieved on Dec. 24, 2009]. Retrieved from the Internet: < URL: http://www.inderscience.com/coming.php?ji=145&jc=ijahuc&np=24&jn=International%20Journarl%20of%20Ad%20Hoc%20and%20Ubiquitous%20Computing >. |
| Chuang et al.; “Minimum-Delay Energy-Efficient Source to Multisink Routing in Wireless Sensor Networks”; 2007 IEEE. 8 pages. [online]. < URL: http://portal.acm.org/citation.cfm?id=1283012 >. |
| Number | Date | Country | |
|---|---|---|---|
| 20110261738 A1 | Oct 2011 | US |
