- Research Article
- Open Access
Trade-Offs between Energy Saving and Reliability in Low Duty Cycle Wireless Sensor Networks Using a Packet Splitting Forwarding Technique
© Giuseppe Campobello et al. 2010
Received: 1 February 2010
Accepted: 13 July 2010
Published: 1 August 2010
One of the challenging topics and design constraints in Wireless Sensor Networks (WSNs) is the reduction of energy consumption because, in most application scenarios, replacement of power resources in sensor devices might be unfeasible. In order to minimize the power consumption, some nodes can be put to sleep during idle times and wake up only when needed. Although it seems the best way to limit the consumption of energy, other performance parameters such as network reliability have to be considered. In a recent paper, we introduced a new forwarding algorithm for WSNs based on a simple splitting procedure able to increase the network lifetime. The forwarding technique is based on the Chinese Remainder Theorem and exhibits very good results in terms of energy efficiency and complexity. In this paper, we intend to investigate a trade-off between energy efficiency and reliability of the proposed forwarding scheme when duty-cycling techniques are considered too.
The recent years have witnessed a large diffusion of wireless sensor networks in different application scenarios: agricultural fields monitoring, environmental pollution monitoring, search and rescue operations in contaminated areas, antimining operations, and so forth. Sensor networks are composed of several low-cost devices with limited processing and storage capabilities, consequently, one of the hot topics in wireless sensor networks is the reduction of energy consumption.
Due to the growing gap between application requirements and the slow progress in battery capacity, several techniques have been proposed in the literature which put nodes periodically into sleep whenever communications are not needed. Although this is the most effective way to reduce energy consumption, depending on the forwarding technique used, a sleep/wake up scheduling algorithm is sometime required which implies solving critical synchronization issues.
In , we have presented a forwarding technique based on the Chinese Remainder Theorem (CRT) which splits the original packets into several packets such that each node of the network will forward only small subpackets. The sink, once all subpackets are received correctly, will recombine them reconstructing the original message.
The proposed technique, investigated through analytical models and simulations, shows very good results in terms of energy efficiency and appears particularly suitable for those forwarding nodes that are more solicited than others due to their position into the sensor network. Moreover, we have investigated how the original packet can be also reconstructed even if not all the subpackets are received by the sink, in order to increase the network reliability.
However, previous results do not consider the possibility that sensor nodes can be in a sleep state due to a duty-cycling technique employed. Obviously, if the packet is splitted and some of the next-hop nodes are switched off, the probability that the splitted message is not forwarded increases if compared to the unsplitted case. On the other hand, duty-cycling techniques are needed to effectively reduce energy consumption. Therefore, it is important to investigate the performance of the proposed algorithm when duty-cycling techniques are also considered.
In this paper, we show that, with a proper choice of the duty-cycle period, the advantages of the CRT with duty-cycling are the same of those reported in , where the nodes are always active. Moreover, we investigate a trade-off between reliability and energy efficiency when the nodes are not perfectly synchronized.
The rest of the paper is organized as follows. Section 2 presents a brief summary of related works already existing in the literature and highlights the distinguished approach of our solution as compared to them. Section 3 describes the basic idea with the help of some examples. Section 4 resumes the duty-cycle technique adopted in this work. Sections 5 and 6 describe the initialization and forwarding procedure. In Sections 7 and 8, some analytical results are derived. In Section 9, the performance of the CRT-based forwarding approach is discussed and the analytical model is validated. Finally, in Section 10, some concluding remarks are drawn.
2. Related Works
When using duty-cycle techniques, the active and sleep states of the network nodes should be carefully designed in order to maintain the network connected and guarantee the delivery of the packets.
In the literature, several approaches have been proposed, most of them regarding the MAC layer.
A well-known MAC protocol is S-MAC , where, to maintain the synchronization, each node periodically broadcasts its schedule in a control message, so that the neighbors can update this information in their schedule tables. Other approaches are TRAMA , which reduces the energy consumption by ensuring that communications are collision free and by placing nodes in sleep mode when they are not communicating; T-MAC , which uses an adaptive duty-cycle, where the active part of it is dynamically changed. This reduces the amount of energy wasted on idle listening.
Other approaches regard a cross-layer interaction between MAC and routing, for example, [5, 6]. Both approaches exploit information at routing layer in order to deliver data packets much faster, without sacrificing the energy efficiency achieved by the duty-cycle mechanism.
In most cases the previous approaches require a very tight synchronization which is difficult to achieve in a sensor network composed by simple devices. Moreover, these approaches introduce delivery latency and do not work well when there are frequent changes in the network topologies and in the radio links conditions, causing serious problems related to the network reliability. An interesting example of using a multipath approach together with erasure codes to increase the reliability of a WSN has been proposed in . However, that work suggested the use of disjoint paths. As compared to our proposed forwarding technique, the use of disjoint paths has two main drawbacks. First of all, a route discovery mechanism is needed. Secondly, as the number of disjoint paths are limited, the number of splits (and therefore the achievable energy reduction factor) is limited too.
Another similar work is , where the authors have proposed a protocol called ReInForM (Reliable Information Forwarding using Multiple Paths in Sensor Networks). The main idea investigated in this paper, is the introduction of redundancy in data to increase the probability of data delivery. The redundancy adopted is in the form of multiple copies of the same packet which travel to the destination along multiple paths. However, as shown in , multiple paths could remarkably consume more energy than the single shortest path because several copies of the same packet have to be sent. Furthermore, in all the papers mentioned above, the authors do not consider the splitting procedure as a method for reducing energy consumption.
An attempt to guarantee reliability, while minimizing the energy consumption and, at the same time, considering a packet splitting procedure, has been made in . As in , the authors use disjoint paths and erasure codes to provide reliability in the network. However, the algorithm proposed is a centralized one based on convex programming which is not suitable for WSNs.
In this paper we show that, by using the CRT-based approach also in a network where nodes alternate between sleep and awake state, both reliability and energy saving can be achieved with a moderate increase in the overall complexity and with very low overhead as compared to the commonly used forwarding techniques.
3. The Forwarding Algorithm Based on the Chinese Remainder Theorem
The basic idea of the proposed forwarding technique  is to split the messages sent by the source node of a wireless sensor network so that the maximum number of bits per packet that a node has to forward is reduced, increasing in this way the network lifetime.
If there are bits for each packet, the maximum number of bits transmitted by a node belonging to the set is bits in the case (a), and bits in the case (b). Let us now assume that each node in the set knows that and have three possible next-hops and that a different forwarding scheme is adopted, as shown in Figure 1(c). In particular, when , , and receive a packet, they split it and send to the sink only a part (e.g., bits each). In this case, , , and have to transmit at most bits each. If we compare the two forwarding methods we can conclude that the last one reduces the maximum number of bits transmitted by a node belonging to the set . More precisely, the reduction factor is when we compare the splitting procedure with the procedure shown in case (a), and when the splitting procedure is compared to the procedure shown in case (b). Summarizing, an average reduction factor of 4/9 is obtained.
This example shows that by splitting a packet, it is possible to reduce the maximum number of transmitted bits per node, and therefore the energy that a node consumes for the transmission.
The splitting procedure is achieved applying the Chinese Remainder Theorem (CRT) which represents a low-complexity approach requiring only a modular division between integers and consequently it can be performed by very simple devices as sensor nodes.
Basically, the CRT can be formulated as follows .
Given primes , with , by considering their product , then for any set of given integers there exists a unique integer that solves the system of simultaneous congruences , and it can be obtained by . The coefficients are given by , where , and is its modular inverse, that is, solves .
In order to apply the previous technique two questions must be answered: how to obtain the prime numbers in a distributed manner, and how to cope with packet loss.
In , we have presented a solution to the previous problems. In particular, we have discussed how to choose the set of prime numbers , with , in a distributed manner so that the message can be reconstructed by the sink, even if CRT components are lost. For sake of completeness an example is reported in Section 6.
Basically, is the number of admissible failures, that is, the maximum number of CRT components that can be lost (for each packet) without decreasing the network reliability, and is the main design parameter of the proposed algorithm. However, as already stated in Section 1, if duty-cycle techniques are adopted within the proposed CRT-based scheme (or any other splitting techniques) without modifications, the number of packets lost greatly increases. This loss cannot be compensated by increasing because large values of reduces the energy efficiency and therefore the network lifetime, that is, a trade-off between energy consumption and reliability exists.
This paper provides a solution to the above problem. As a major result we prove that, under proper conditions, the performance of the proposed CRT-based forwarding algorithm are the same with and without duty-cycle techniques. Furthermore, we investigate how energy consumption and reliability are related to the parameter and other common parameters of duty-cycling techniques. In particular, we show how the parameter can be properly chosen in order to cope with possible duty-cycle mismatching.
4. Duty-Cycling Parameters
Obviously, a low dutycycle is desirable in order to reduce the power consumption and increase the network lifetime.
Duty-cycle techniques impose a proper synchronization scheme to avoid that messages are received while a node is in a power saving state with the effect of increasing the packet loss and reducing the network reliability.
For instance, let us consider Figure 3, where the first time-line represents the clock signal of a generic node which waits to receive a message, while the second time-line represents the time instants when a generic source node generates a message. Let us assume that the first message, generated at the time from , and after a transmission time equal to , is received at the time . This time instant belongs to an active state for node and therefore the message will be correctly received. On the other hand, the second message, generated at the time instant , and requiring a transmission time , is received during a power saving state of and consequently it will be lost.
Throughout the paper we indicate with the maximum transmission time which includes propagation delay, packet duration, maximum backoff, and time to receive an acknowledge (if an ARQ technique is used). It is worth mentioning that can be evaluated taking the specific MAC protocol into account.
For instance, in the case of the IEEE 802.15.4 standard , the maximum backoff time is 27.4 ms and assuming a negligible propagation delay (usually less than 1 s), a packet duration of 1.8 ms (i.e., a 56-byte packet at a bitrate of 250 Kbps), and operating without ARQ, it follows that ms.
We show in the next sections how nodes can be synchronized on the basis of the knowledge of the parameters , and . Furthermore, we show how CRT allows to achieve high reliability even under an imperfect synchronization.
5. Initialization Procedure
An initialization procedure for the proposed CRT-based forwarding technique has been extensively described in . The above mentioned procedure is mainly based on the exchange of Initialization Messages (IMs) and allows to organize the network in clusters. The sink is supposed to belong to the cluster 1 and generates a first IM with its own address and a sequence number SN = 2. Each node which receives an IM from its neighbors, with a sequence number SN = , will belong to cluster and will retransmit the IM with an increased SN value together with its own address and the list of the nodes that will be used as forwarders (which it knows according to the source addresses specified in the received IMs).
On the basis of the received IMs, at the end of the above procedure, each node in the network will know its own next-hops, which other nodes will use it as a next-hop, and into how many parts the received packets can be split. Further details on the initialization procedure are reported in .
We show below how nodes can be synchronized using the same IMs seen above.
It is worth mentioning that, using the proposed CRT-based scheme, a perfect synchronization among all the nodes of the network is not needed and we will demonstrate that a synchronization among consecutive clusters is sufficient.
Synchronization of the nodes belonging to cluster 2 is straightforward. In fact, we can consider that all the nodes in cluster 2 (i.e., the nodes that receive the first IM from the sink) start their synchronization signals when receiving the first IM. If the time needed to process the IM is negligible, with respect to the duration of an active state, we can assume that all nodes in cluster 2 are perfectly synchronized.
It is worth mentioning that for a perfect synchronization, the clock signal of the node in cluster should be set to be in phase with the clock signal of the node in cluster , so that the active states can overlap. However, due to the fact that is unknown, this is not possible. Therefore, using the previous procedure, the clock signal of nodes in cluster is only roughly estimated (on the basis of the time ). Despite this fact, we demonstrate that the previous estimation, under proper conditions derived below, is sufficient.
In fact, let us suppose that in the forwarding phase, for instance, after clock cycles, a node in cluster wishes to send a message to one of the nodes in cluster , so that it sends the message at the time . The message will be received by nodes in cluster at the time .
Simulation results confirm that, if the condition given by (2) is respected, all the messages sent in active states will reach the sink correctly, that is, the loss probability due to the duty-cycle is zero.
It is worth noting that a node in cluster can receive more IMs from different nodes in cluster . However, if we assume that IMs are processed by nodes belonging to the same cluster in almost the same time, we can use only the first message for synchronization purpose, and possible processing time differences can be easily taken into account by a small increasing of .
In Figure 4, a single message per cycle has been considered. However, multiple transmissions (or retransmissions of the same message) in the same cycle are possible and desirable.
In this case, only the first message is sent in the center of the active state (i.e., in Figure 4) while the other messages follow (in the same cycle).
Obviously, a maximum value of exists in order to respect (3). Nevertheless, we can choose a low value of to reduce the power consumption, and a large value of to have a large number of transmissions per cycle.
We remark that, in IEEE 802.15.4 WSNs, the fact that the standard is based on a cluster-tree topology  may make easier the integration of the proposed CRT-based forwarding technique. In fact, in this case some information needed for performing the splitting procedure are already in the nodes (each node knows how many children it has) and the different branches of the cluster-tree can be straightforwardly used for sending the CRT components.
According to the initialization procedure, node knows that it is the only next-hop of node and therefore it must forward the packet without performing a splitting procedure. It is worth highlighting that it is not necessary for to specify the list of the destination addresses in the packet. In fact, in the initialization phase, nodes have already received the IM message IM:[SN = 5, , ], and therefore they know that node has 4 next-hops and that all of them have to split into parts the messages received from . Therefore, when receive the packet, they proceed as follows: ( ) according to both the packet size, , and the number of next-hops, , they independently obtain the set of prime numbers (as explained below); ( ) they select one of the prime numbers, each of them on the basis of their position in the list of addresses specified in the previously mentioned IM; ( ) they send the components (one each), together with a proper mask, to one of the possible next-hops ( or in the example). The mask is needed to identify the component, i.e., its index . For instance, it could be the binary representation of the index followed by the number of components. In particular, in the example we considered, without loss of generality, that only node is in the coverage range of nodes and and only node is in the coverage range of nodes and .
Nodes and simply forward the CRT components. Finally, when the sink receives a component , it identifies the number of expected components on the basis of the mask, and therefore it calculates the set of prime numbers, and the coefficients needed to reconstruct the original message. Finally, when the sink receives at least components of the original message, it can reconstruct the message by (where is the product of the prime numbers related to the received components).
It is worth noting that nodes can easily obtain the set of prime numbers by considering the smallest consecutive primes that satisfy . For instance, if , , and , the set 10313,10321,10331,10333 is the set of smallest consecutive primes that guarantees whatever is the component (in general the set of components ) that is not received by the sink. Let us observe that, by fixing , , and , the set is unique so that all the nodes obtain the same set in a stand-alone manner. We point out that the values of and can be preprogrammed in the sensor nodes or sent in the IM packets.
7. Energy Reduction Factor
For comparison purposes, we have considered the Shortest Path with Load Balancing (SP), which is very similar to the probabilistic routing. A sensor node having a packet to forward, randomly chooses a neighbor node as next-hop so that the number of hops needed to reach the sink is minimized. Load balancing (i.e., a random choice of the next hop) allows to prolong the network lifetime avoiding that some nodes can be overloaded.
Throughout the paper we consider that an SP packet is composed by words of -bits each and that the CRT-based splitting procedure can be applied to each word by considering that the same prime number is used for all the words of the same packet.
It is worth noting that we are considering the average value of the components, , because in the case of CRT, a node transmits packets which can have components of different length, . However, if a large number of packets are considered, the expected total number of bits is and the previous equation is still valid.
In (9), we have not explicitly considered the effect of packet header. However, it is straightforward to prove that when the length of the header is negligible in comparison to the total packet length (or if the CRT is applied to the header too), (9) is still valid.
In , we have shown that and can be expressed in terms of the number of possible nodes that can be used as next-hops, , and the number of messages .
In particular, we proved that the above equation is valid also if the CRT components are forwarded independently and do not follow distinct paths.
Both and are related to the network, density, . As regards , if we restrict our analysis to the nodes of the second cluster, it can be easily obtained by , where is the transmission range of the sink. These nodes are the most critical because they represent the sink's neighbors, and if these nodes run out of energy, the sink remains isolated.
As regards , we consider that a certain number of events , randomly occurs in the sensor network and that for each event, all the nodes that recognize the event, generate a message having the sink node as destination. More precisely, we assume that only nodes inside the circular area of radius , with center in the location of the event, will send a message to the sink. For each event, the number of messages generated is in the order of , so .
On the basis of the previous equation, we can state that the number of events that a WSN can handle before that the falls below is not dependent from the density of the WSN, and that for a desired a large number of events can be handled if the transmission range is large enough in comparison to the event range.
In this section, we introduce an analytical framework which allows to relate with the probability of erasure for a single hop, . Moreover, we investigate the relation between and a possible duty-cycle mismatch.
It is worth noting that the possibility to obtain different trade-offs between energy saving and reliability by choosing different values of is one of the main advantages of using the CRT as splitting technique, and that this is not possible with other simple splitting techniques (e.g., simple chunk). Furthermore, considering the limited energy and computation capability of sensor nodes, the very low complexity of the CRT allows it to be more suitable to achieve reliability in WSNs in comparison to other techniques (e.g., FEC techniques based on RS and LT codes) commonly used for other types of wireless networks.
8.1. Reliability and Admissible Failures
Let us assume that, after the splitting procedure starts, each node fails to forward a packet (i.e., a CRT component) due to channel errors or other impairments, with a known probability, . Therefore, if is the number of hops needed to reach the sink, the probability that a CRT component is not received successfully is .
This allows us, knowing (i.e., and ) and , to select in a simple manner an appropriate value of so that the desired value of can be achieved. Once is known, it is possible to calculate the appropriate set of primes , with so that the splitting procedure can be performed correctly .
8.2. Reliability and Duty Cycle
In this subsection, we introduce a model for the reliability in order to take into account possible duty-cycle mismatching. In particular, we evaluate the probability that a CRT component is not received successfully due to the fact that condition in (2) is not satisfied.
On the basis of such a probability, the results previously obtained can be extended. In particular, the new reliability can be obtained by (14) considering instead of , and the proper value of to obtain a desired reliability can be evaluated on the basis of (15).
9. Performance Evaluation
In this section, we evaluate the performance of CRT in terms of energy consumption and reliability and validate our analytical model. Let us consider a sensor network where nodes are randomly distributed in a square area of size GridSize , with density . Sensor nodes are assumed to be static, the sink node is located in the center of the square grid in the first cluster (so that its cluster identifier is = 1), and each sensor node has a transmission range equal to . Clusters have been obtained according to the initialization procedure described in Section 5. Furthermore, to model erasure channels we considered that each node fails to forward a packet or a CRT component with a known probability, . Instead, issues like packet retransmissions and memory management are not considered here for sake of simplicity.
In particular, we have evaluated the number of packets lost, , when the following values are considered: , , , m, m, GridSize = [300 m 300 m], , , and . From the number of packets lost we have obtained the as = where is the number of messages sent by the sources.
As can be observed, low values of are sufficient to increase the reliability. For instance, when and , we have a reliability value of about , but it is sufficient to choose to increase the reliability to . Moreover, it is possible to observe that the results obtained through the analytical model in (14), and those reported by the simulator are very close to each other, for all the values of considered. In particular, simulations show that, when the condition of perfect synchronization in (2) is satisfied, the loss is only due to channel errors.
Previous results show that the parameters are related. In particular, when increases, the decreases and increases. Therefore, it is important to select so that a desired trade-off between reliability and energy reduction can be achieved.
It is worth mentioning that the previous results have also been obtained by simulating also a duty-cycle technique under the synchronization condition given by (2). This allows us to state that performance of the proposed method and its analytical model derived in  are valid also if a duty-cycle technique is adopted.
Now, we consider the effect of small duty-cycle mismatching (i.e., synchronization faults). Duty-cycles mismatching are possible, for instance, if (i.e., the maximum transmission time) is not perfectly estimated or if small variations happen during the actual network operations.
Figure 11 shows the impact of the redundancy factor over the reliability . It is possible to see that the value of goes down to 0.58 (for = 1/32) and 0.35 (for = 1/16) when , that is, when the number of admissible failures is zero. Increasing the value of , it is possible to increase in both cases. In particular, (resp. ) is sufficient to achieve when the perturbation is 10% (resp. 15%). Moreover, it is possible to observe that, as expected, when = 1/16, the values of are lower than the values of when = 1/32. This happen because, for the same value of , the mismatch on the duty-cycle synchronization in the first case is higher than the second case. Finally, Figure 11 allow us to state that the developed model (i.e., (18)-(19)) is able to accurately predict the effect of a possible duty-cycle mismatching.
The increase in the reliability has as a counter-effect, namely, a decrease in the value of . In Figure 12, we have reported the values of versus the values of . First of all, it is possible to see that decreases when increases, but its values are always greater than zero for both values of . This means that with the CRT-based forwarding technique we have an improvement with respect to the shortest path, for all the values of considered. Secondly, it is possible to observe that the variation of related to different values of is very small.
Results obtained allow us to assert that, thanks to the CRT approach, we can reduce the energy consumption so prolonging the network lifetime. Moreover, in case of failures due to channel errors or synchronization mismatches, it is possible to find a trade-off between the increase in reliability of the network and the energy efficiency.
In this paper we have discussed the trade-off conditions between energy consumption and reliability of a novel forwarding technique for WSNs, based on the Chinese Remainder Theorem (CRT).
In particular, first, we have derived an analytical model able to predict the energy efficiency of the method when applied in a sensor network where node use a duty-cycle technique in order to reduce the energy consumption. Then, we have discussed how to select the CRT algorithm parameters in order to obtain a reasonably trade-off between energy consumption and reliability.
Finally, through simulations, we have assessed the results obtained analytically, and we have shown that the CRT-based forwarding technique works well also in networks with duty cycle. Moreover, we have shown that possible synchronization mismatches can be compensated by choosing the CRT parameters accordingly.
- Campobello G, Leonardi A, Palazzo S: A novel reliable and energy-saving forwarding technique for wireless sensor networks. Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '09), May 2009, New Orleans, La, USA 269-278.View ArticleGoogle Scholar
- Ye W, Heidemann J, Estrin D: An energy-efficient MAC protocol for wireless sensor networks. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '02), June 2002, New York, NY, USA 1567-1576.Google Scholar
- Rajendran V, Obraczka K, Garcia-Luna-Aceves JJ: Energy-efficient, collision-free medium access control for wireless sensor networks. Wireless Networks 2006, 12(1):63-78. 10.1007/s11276-006-6151-zView ArticleGoogle Scholar
- van Dam T, Langendoen K: An adaptive energy-efficient MAC protocol for wireless sensor networks. Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SenSys '03), November 2003, Los Angeles, Calif, USA 171-180.View ArticleGoogle Scholar
- Du S, Saha AK, Johnson DB: RMAC: a routing-enhanced duty-cycle MAC protocol for wireless sensor networks. Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM '07), May 2007, Anchorage, Alaska, USA 1478-1486.Google Scholar
- Xu Y, Heidemann J, Estrin D: Geography-informed energy conservation for ad hoc routing. Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom '01), July 2001, Rome, Italy 70-84.View ArticleGoogle Scholar
- Dulman S, Nieberg T, Wu J, Havinga P: Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks. Proceedings of the Wireless Communications and Networking Conference (WCNC '03), March 2003, New Orleans, La, USAGoogle Scholar
- Deb B, Bhatnagar S, Nath B: ReInForM: reliable information forwarding using multiple paths in sensor networks. Proceedings of the 28th Annual IEEE Conference on Local Computer Networks (LCN '03), October 2003, Bonn, GermanyGoogle Scholar
- Ganesan D, Govindan R, Shenker S, Estrin D: Highly resilient, energy efficient multipath routing in wireless sensor networks. Mobile Computing and Communications Review 2002., 1(2):Google Scholar
- Djukic P, Valaee S: Minimum energy reliable ad hoc networks. Proceedings of the 22nd Biennial Symposium on Communications, June 2004, Kingston, CanadaGoogle Scholar
- Hong J-H, Wu C-H, Wu C-W: RSA cryptosystem based on the Chinese remainder theorem. Proceedings of Asia and South Pacific Design Automation Conference (ASP-DAC '01), January 2001, Yokohama, JapanGoogle Scholar
- 802.15.4-2003 : IEEE Standard for Information Technology-Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs). 2003.Google Scholar
- Cuomo F, Cipollone E, Abbagnale A: Performance analysis of IEEE 802.15.4 wireless sensor networks: an insight into the topology formation process. Computer Networks 2009, 53(18):3057-3075. 10.1016/j.comnet.2009.07.016View ArticleMATHGoogle Scholar
- Papoulis A, Unnikrishna Pillai S: Probability, Random Variables and Stochastic Processes. McGraw-Hill, New York, NY, USA; 2002.Google Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.