# An Enhanced Distributed Scheme for WSNs

Authors: Tarek R. Sheltami
Journal: Mobile Information Systems
 (2015)

---

## Abstract

This paper investigates data processing schemes that define the distribution of decision making that affects system accuracy and energy consumption. There exist two typical schemes, namely: centralized and distributed schemes. In a centralized scheme, nodes collect samples and send them to a “fusion center.” This scheme provides optimal decision accuracy; however, it consumes considerable energy. In contrast, distributed schemes allow nodes to make local 1-bit decisions, which are sent to the fusion center to make the final decision. In a hybrid scheme, the network specifies the level of accuracy required for the whole system. This can be achieved by manipulating the scheme to work interchangeably as centralized or distributed. Most of the energy consumed is in the transmission process; therefore, this paper proposes an energy-saving hybrid scheme that focuses on optimizing transmission energy. In this proposed scheme, each node is able to alternate between centralized and decentralized scheme according to its location and path length. To validate the proposed approach, it is simulated and the results are compared with the hybrid scheme.


---

## Body

## 1. Introduction

The main goal of WSNs is to detect certain events in the environment. It is important to try to achieve maximum detection accuracy and to minimize false alarms. At the same time, availability of WSN resources and accessibility limitations should be considered. The solution is a trade-off between two factors: accuracy and energy efficiency. With sensor capabilities a tremendous societal benefit is achieved when sensors are integrated into available devices, machines, and environments. They can help to avoid infrastructure failure disasters, protect precious natural resources, enhance security, and enable new “smart” applications such as context-aware systems and home technologies. Wireless sensor networks are based on numerous advanced technologies such as very large scale integration (VLSI), microelectromechanical systems (MEMS), and wireless communications. The development of these technologies is contributing to a wider application of WSNs. For example, with the enhancement of MEMS technology, sensors are becoming smaller, and developments in semiconductor technologies are producing smaller microprocessors with higher processing capacities. The improvement of computing and sensing technologies is enabling the development of flexible WSNs, which can be widely applied [1, 2].Monitoring environmental changes and detecting specified events is the main function of sensor networks. This function is achieved through four basic components of a sensor network [3]: distributed or localized sensors, an interconnecting network (most often wireless based), a central point of information clustering a set of computing resources at the central point or network core to handle data collecting, event trending, status querying, and data mining. WSNs use centralized fusion centers (sinks), which work as cluster gateways, and many distributed sensors (motes) [4]. These sensors sense and send observations to the centralized unit. The centralized unit decides if an event is initiated or not.Most of the power consumed in a network is used in processing, transmitting, and sensing. Until now limited power resources for sensors has been the main constraint in WSNs. It is very important to reduce sensor power consumption while maintaining acceptable detection accuracy according to application requirements. Many researchers have focused on the above three processes [5], attempting to enhance the power consumption efficiency of the sensors for each of them. Some schemes enhance the operating system and reduce the required processing cycles; other schemes optimize the RF part including collision space and noise filtering. This thesis focuses on schemes which study decision processing and transmitting where those schemes define how to collect observations (sampling rate), where to process them (locally or centralized), and the data to be sent from nodes to the fusion center, which will affect the degree of loss of data and accuracy [6]. The main goal of this paper is to produce an optimum controlling scheme that extends network/sensor lifetime by reducing power consumption and maximizing the network efficiency and accuracy. Our proposed scheme balances between the reduction of data transmission and processing by distributing these two activities among the nodes and the central unit (sink).Existing wireless communication protocols are shown in Table1, including IEEE 802.11 (WiFi), IEEE 802.15.1 (Bluetooth), IEEE 802.15.4 (ZigBee, 6LoWPAN, WirelessHART, and ISA-100.11a), and IEEE 802.16 (WiMAX).Table 1
Wireless communication protocols.
Standards
IEEE 802.15.4Low power wireless personal area network (LP-WPAN)
IEEE 802.51.1(WPAN)
IEEE 802.11(WLAN)
IEEE 802.16(WWAN)
ZigBee
6LoWPAN
WirelessHART
ISA 100.11a
Bluetooth
WiFI
WiMAX
Range in meters
100
50
100
100
15 Km
Data rate
250–500 Kpbs
250 Kbps
250 Kbps
250 Kbps
1–3 Kbps
250 Kbps
250 Kbps
Frequencies
2.4 GHz
2.4 GHz
2.4 GHz
2.4 GHz
2.4 GHz
2.4, 3.7 and 5 GHz
2.3, 2.5  and 3.5 GHz
Network topology
Star, mesh, cluster tree
Star, mesh, cluster tree IPv6
Star, mesh, cluster tree
Star, mesh, cluster tree
Star
Star, tree, P2P
Star, tree, P2P
Applications
WSNs (monitoring and control)
WSNs, Internet, automation and entertainment
Wirelessly process monitoring and control application
Wireless systems of automation
WSNs (monitoring and control)
PC-based data acquisitionmobile Internet
Mobile InternetThe main WSN solutions such as ZigBee, WirelessHART, 6LoWPAN, and ISA-100 are based on this standard, which offers a complete networking solution by developing the remaining upper communication layers.ZigBee. ZigBee [7–9] is a simple, low cost, low power wireless technology used in LR-PANs embedded applications. ZigBee provides the network layer and the framework for the application layer. The MAC sublayer and lower layers are based on the IEEE 802.15.4 standards (see Figure 1).Figure 1
ZigBee protocol stack.The ZigBee network layer supports star, tree, and mesh topologies. It is utilized in three types of devices: ZigBee coordinator, ZigBee routers, and end devices.WirelessHART. Based on IEEE 802.15.4 standard highway addressable remote transducer (HART) foundation, WirelessHART [10–12] was developed for low-power 2.4 GHz operation. Similar to ZigBee, WirelessHART specifies four principal devices (Figure 2): network manager, gateways, field devices, and handhelds, as well as adapters, which allow existing HART field devices to be integrated into the network.Figure 2
Elements of a typical WirelessHART installation.6LoWPAN. 6LoWPAN [13, 14] is the abbreviation of IPv6 over low power wireless personal area networks, in which standard IPv6 packets are enabled to communicate over an IEEE 802.15.4-based network. Using 6LoWPAN, low power devices have all the benefits of IP communication and management. It is targeted at wireless IP networking applications in home, office, and factory environments.ISA100.11a. The core wireless technology employed by ISA100.11a [15] is IEEE 802.15.4, which sorts the 2.4 GHz unlicensed band into 16 channels.As shown in Table6, the network layer is based on IETF RFC4944 (6LoWPAN):(i)
IP connectivity through compressed IPv6 and UDP packets,(ii)
addressing scheme:
(a)
EUI-64 (64 bits),(b)
IPv6 (128 bits),(c)
short address (16 bits IEEE 802.15.4).The entire ISA100.11a stack is constructed employing widely accepted and proven industry standards.


## 2. Related Work

As mentioned earlier, each node has the responsibility of collecting, processing, transmitting, and receiving data. The common functions of every detection scheme are that (1) nodes collect observations, and (2) the fusion center (sink) takes the final decision.There are two traditional detection schemes: the centralized detection scheme and the distributed detection scheme, the methodologies of which will be covered in details. In our approach, we use a tree topology where nodes are “independently and identically distributed” (i.i.d.). They are connected to the Fusion Center (FC) through a multihop route, where nodes also act as hops to receive data from child nodes and forward it to the FC with any processing, encryption or encoding. The focus here is only on accuracy and energy consumption, and it is assumed that lower layers are working perfectly and that there are no efficiency problems caused by RF or by packet collisions; that is, there is no data retransmission.


### 2.1. Bayesian Decision Theory

#### 2.1.1. Binomial Distribution

A Bernoulli trial can result in a success with probabilityp and a failure with probability q=1-p. Equation (1) gives the probability distribution of the binomial random variable x. The number of successes in n independent trials is(1)fx;n,p=Pr⁡⁡x∣p=nxpx1-pn-x.The probability that two events,A andB, will both occur will be PA∩B=PB∩A=PBP(A∣B)=PAP(B∣A). From this formula the main equations (2) of Bayes’ rule can be derived:(2)PA∣B=PAPB∣APB,PA=∑i=1kPBi∩A=∑i=1kPBiPA∣Bi.From Figure3 we find PE∩A=PEPA∣E=2/33/50=0.04.Figure 3
Conditional probability example.The distribution ofH, givenD, which is called the posterior distribution, where P(D) is the marginal distribution of D, is given by(3)PH∣D=PD∣HP(H)P(D).Binary assumption is defined byH, which represents event occurrence: (H=H1) if an event happens and (H=H0) if not; H^ is the actual event status: H′ is the final decision;K is node counts; D is the collected samples, T is sample count at each node, and L is the node path length. For each sample Sij where i is varied from 1 to K andJ from 1 to T collected in a node i,  P(Sij=1∣H^=H1)=p1, P(Sij=1∣H^=H0)=p0.Bayes Decision. Choose event happened if P(H1∣D)≥P(H0∣D); otherwise choose not happened.


### 2.2. Centralized Detection Schemes

In centralized detection schemes a network will haveK number of nodes. These nodes will collect T samples of observations from the environment every specific period, and they will send T samples together at the end of the period. At the fusion center D=[T*K] samples will be received.According to Bayes, a final decision can be calculated as shown in the following:(4)H^=1,PH1∣D≥PH0∣D0,otherwise.The probability of error can be calculated using the following equation:(5)Pe=p*Pfalsepositive+1-p*Pfalsenegative⟶Pe=p*PH′=H1∣H0+1-p*PH′=H0∣H1⟶Pe=p*1-Pn≥γFC∣H1+1-p*Pn≥γFC∣H0.To calculate power consumption for the whole network in (6), the following equation can be used, whereE = total energy, ET = transmission energy, ER = receiving energy, and EP = processing energy:(6)E=ET+ER+EP⟶E=∑i=1K(Li*T*et)+∑i=1K(Li*T*er)⟶E=∑i=1K(Li*T*(et+er)).


### 2.3. Distributed Detection Scheme

In this scheme nodes collect data and make local decisions according to these observations and conclude the event appearance as a 1-bit result. This result is sent to the fusion center to make a final decision according to the collected 1-bit results from all nodes. In this scheme data accuracy between nodes and the fusion center has been lost.We proposeK number of nodes; these nodes will collect T samples of environmental observations with (ni = number of 1s for node i) and will send a 1-bit local decision every specific period.At the fusion center,D=[1*K] samples will be received.According to Bayes, a local decision can be calculated as shown in the following:(7)Hι^=1,PH1∣ni≥PH0∣ni0,otherwise.From (1) and (4), we can calculate local decision as shown in the following:(8)PH1∣ni≥PH0∣ni⟶Pni∣H1PH1Pni≥Pni∣H0PH0Pni⟶Pni∣H1Pni∣H0≥P(H0)P(H1)Tnip1T1-p1T-niTnip0T1-p0T-ni≥1-pp⟶ni≥ln⁡⁡1-p/p+Tln⁡⁡1-p0/1-p1ln⁡⁡p11-p0/p01-p1=γlocal⟶H^=1,ni≥γlocal0,otherwise.For final decision we collect b = total 1s if local decision(9)H^=1,PH1∣b≥PH0∣b0,otherwise.From (1) and (4), we can calculate final decision as shown in the following:(10)PH1∣b≥PH0∣b⟶Pb∣H1PH1Pb≥Pb∣H0PH0Pb⟶Pb∣H1Pb∣H0≥PH0PH1,PD=∑i=γlocalTTip1T(1-p1)T-i,PF=∑i=γlocalTTip0T(1-p0)T-i,KbpDK1-pDK-bKbpFK1-pFK-b≥1-pp⟶b≥ln⁡⁡1-p/p+Kln⁡⁡1-pF/1-pDln⁡⁡pD1-pF/pF1-pD=γFC⟶H^=1,b≥γFC0,otherwise.The probability of error can be calculated using(11)Pe=p*Pfalsepositive+(1-p*Pfalsenegative)⟶Pe=p*1-Pb≥γFC∣H1+1-p*Pb≥γFC∣H0.To calculate power consumption for the whole network (12) can be used, where E = total energy, ET=transmissionenergy, ER = receiving energy, and ET = processing energy:(12)E=ET+ER+EP⟶E=∑i=1KLi*1*et+∑i=1KLi*1*er+∑i=1KT*ep⟶E=∑i=1K(Li*(et+er))+∑i=1KT*ep.


### 2.4. Hybrid Detection Scheme

Neither the centralized nor the distributed detection scheme is flexible enough for designers to choose between detection accuracy and energy consumption. Yu et al. [16] proposed a hybrid scheme that balances detection accuracy and total energy consumption. According to a defined level of accuracy, the nodes will vary between sending all collected data and sending a 1-bit result. Thus, such schemes attempt to balance accuracy and energy consumption.In this scheme, assume there areK number of nodes. These nodes will collect T samples of environmental observations with (ni = number of 1s for node i). There will be upper and lower bounds N0 and N1, where 0≤N0<N1≤T. The node result will be 0 if the number of 1s is less than N0. In other words, if the number of 0s collected is greater than or equal to T-N0, 1 will be sent if the number of 1s is greater than or equal to N1. Otherwise all the collected data will be sent, as shown in (17): (13)Resulti=1,ni≥N1ni,N0<ni<N10,ni≤N0.From (12), assume that out of K sensor nodes, t nodes send 1s, s nodes send 0s, and K-s-t nodes send all their observations. The total data sent, Ω, will be (14)Ω=1,…,1;n1,…,nK-s-t;0,…,0;.From (12) we can derive the following probability:(15)Pb=0∣Hθ=∑i=0N0TipθT1-pθT-i,Pb=1∣Hθ=∑i=N1TTipθT(1-pθ)T-i,(16)PD=KsK-stPb=0∣H1sPb=1∣H1t·Pni=1∣H1k-s-t,(17)PF=KsK-stPb=0∣H0sPb=1∣H0t·Pni=1∣H0k-s-t.Following from (16) and (17), the final probability of error can be determined using(18)Pe=p*1-PD+1-p×PD.To calculate power consumption for the whole network (16) can be used, where E = total energy, ET=transmissionenergy, ER = receiving energy, and ET = processing energy:(19)E=ET+ER+EP⟶E=∑i=1s+tLi*1*et+∑i=1K-s-tLi*T*et+∑i=1s+tLi*1*er+∑i=1K-s-tLi*T*er+∑i=1KT*ep⟶E=∑i=1s+tLi*et+er+∑i=1K-s-tLi*T*et+er+∑i=1KT*ep.


## 2.1. Bayesian Decision Theory

### 2.1.1. Binomial Distribution

A Bernoulli trial can result in a success with probabilityp and a failure with probability q=1-p. Equation (1) gives the probability distribution of the binomial random variable x. The number of successes in n independent trials is(1)fx;n,p=Pr⁡⁡x∣p=nxpx1-pn-x.The probability that two events,A andB, will both occur will be PA∩B=PB∩A=PBP(A∣B)=PAP(B∣A). From this formula the main equations (2) of Bayes’ rule can be derived:(2)PA∣B=PAPB∣APB,PA=∑i=1kPBi∩A=∑i=1kPBiPA∣Bi.From Figure3 we find PE∩A=PEPA∣E=2/33/50=0.04.Figure 3
Conditional probability example.The distribution ofH, givenD, which is called the posterior distribution, where P(D) is the marginal distribution of D, is given by(3)PH∣D=PD∣HP(H)P(D).Binary assumption is defined byH, which represents event occurrence: (H=H1) if an event happens and (H=H0) if not; H^ is the actual event status: H′ is the final decision;K is node counts; D is the collected samples, T is sample count at each node, and L is the node path length. For each sample Sij where i is varied from 1 to K andJ from 1 to T collected in a node i,  P(Sij=1∣H^=H1)=p1, P(Sij=1∣H^=H0)=p0.Bayes Decision. Choose event happened if P(H1∣D)≥P(H0∣D); otherwise choose not happened.


## 2.1.1. Binomial Distribution

A Bernoulli trial can result in a success with probabilityp and a failure with probability q=1-p. Equation (1) gives the probability distribution of the binomial random variable x. The number of successes in n independent trials is(1)fx;n,p=Pr⁡⁡x∣p=nxpx1-pn-x.The probability that two events,A andB, will both occur will be PA∩B=PB∩A=PBP(A∣B)=PAP(B∣A). From this formula the main equations (2) of Bayes’ rule can be derived:(2)PA∣B=PAPB∣APB,PA=∑i=1kPBi∩A=∑i=1kPBiPA∣Bi.From Figure3 we find PE∩A=PEPA∣E=2/33/50=0.04.Figure 3
Conditional probability example.The distribution ofH, givenD, which is called the posterior distribution, where P(D) is the marginal distribution of D, is given by(3)PH∣D=PD∣HP(H)P(D).Binary assumption is defined byH, which represents event occurrence: (H=H1) if an event happens and (H=H0) if not; H^ is the actual event status: H′ is the final decision;K is node counts; D is the collected samples, T is sample count at each node, and L is the node path length. For each sample Sij where i is varied from 1 to K andJ from 1 to T collected in a node i,  P(Sij=1∣H^=H1)=p1, P(Sij=1∣H^=H0)=p0.Bayes Decision. Choose event happened if P(H1∣D)≥P(H0∣D); otherwise choose not happened.


## 2.2. Centralized Detection Schemes

In centralized detection schemes a network will haveK number of nodes. These nodes will collect T samples of observations from the environment every specific period, and they will send T samples together at the end of the period. At the fusion center D=[T*K] samples will be received.According to Bayes, a final decision can be calculated as shown in the following:(4)H^=1,PH1∣D≥PH0∣D0,otherwise.The probability of error can be calculated using the following equation:(5)Pe=p*Pfalsepositive+1-p*Pfalsenegative⟶Pe=p*PH′=H1∣H0+1-p*PH′=H0∣H1⟶Pe=p*1-Pn≥γFC∣H1+1-p*Pn≥γFC∣H0.To calculate power consumption for the whole network in (6), the following equation can be used, whereE = total energy, ET = transmission energy, ER = receiving energy, and EP = processing energy:(6)E=ET+ER+EP⟶E=∑i=1K(Li*T*et)+∑i=1K(Li*T*er)⟶E=∑i=1K(Li*T*(et+er)).


## 2.3. Distributed Detection Scheme

In this scheme nodes collect data and make local decisions according to these observations and conclude the event appearance as a 1-bit result. This result is sent to the fusion center to make a final decision according to the collected 1-bit results from all nodes. In this scheme data accuracy between nodes and the fusion center has been lost.We proposeK number of nodes; these nodes will collect T samples of environmental observations with (ni = number of 1s for node i) and will send a 1-bit local decision every specific period.At the fusion center,D=[1*K] samples will be received.According to Bayes, a local decision can be calculated as shown in the following:(7)Hι^=1,PH1∣ni≥PH0∣ni0,otherwise.From (1) and (4), we can calculate local decision as shown in the following:(8)PH1∣ni≥PH0∣ni⟶Pni∣H1PH1Pni≥Pni∣H0PH0Pni⟶Pni∣H1Pni∣H0≥P(H0)P(H1)Tnip1T1-p1T-niTnip0T1-p0T-ni≥1-pp⟶ni≥ln⁡⁡1-p/p+Tln⁡⁡1-p0/1-p1ln⁡⁡p11-p0/p01-p1=γlocal⟶H^=1,ni≥γlocal0,otherwise.For final decision we collect b = total 1s if local decision(9)H^=1,PH1∣b≥PH0∣b0,otherwise.From (1) and (4), we can calculate final decision as shown in the following:(10)PH1∣b≥PH0∣b⟶Pb∣H1PH1Pb≥Pb∣H0PH0Pb⟶Pb∣H1Pb∣H0≥PH0PH1,PD=∑i=γlocalTTip1T(1-p1)T-i,PF=∑i=γlocalTTip0T(1-p0)T-i,KbpDK1-pDK-bKbpFK1-pFK-b≥1-pp⟶b≥ln⁡⁡1-p/p+Kln⁡⁡1-pF/1-pDln⁡⁡pD1-pF/pF1-pD=γFC⟶H^=1,b≥γFC0,otherwise.The probability of error can be calculated using(11)Pe=p*Pfalsepositive+(1-p*Pfalsenegative)⟶Pe=p*1-Pb≥γFC∣H1+1-p*Pb≥γFC∣H0.To calculate power consumption for the whole network (12) can be used, where E = total energy, ET=transmissionenergy, ER = receiving energy, and ET = processing energy:(12)E=ET+ER+EP⟶E=∑i=1KLi*1*et+∑i=1KLi*1*er+∑i=1KT*ep⟶E=∑i=1K(Li*(et+er))+∑i=1KT*ep.


## 2.4. Hybrid Detection Scheme

Neither the centralized nor the distributed detection scheme is flexible enough for designers to choose between detection accuracy and energy consumption. Yu et al. [16] proposed a hybrid scheme that balances detection accuracy and total energy consumption. According to a defined level of accuracy, the nodes will vary between sending all collected data and sending a 1-bit result. Thus, such schemes attempt to balance accuracy and energy consumption.In this scheme, assume there areK number of nodes. These nodes will collect T samples of environmental observations with (ni = number of 1s for node i). There will be upper and lower bounds N0 and N1, where 0≤N0<N1≤T. The node result will be 0 if the number of 1s is less than N0. In other words, if the number of 0s collected is greater than or equal to T-N0, 1 will be sent if the number of 1s is greater than or equal to N1. Otherwise all the collected data will be sent, as shown in (17): (13)Resulti=1,ni≥N1ni,N0<ni<N10,ni≤N0.From (12), assume that out of K sensor nodes, t nodes send 1s, s nodes send 0s, and K-s-t nodes send all their observations. The total data sent, Ω, will be (14)Ω=1,…,1;n1,…,nK-s-t;0,…,0;.From (12) we can derive the following probability:(15)Pb=0∣Hθ=∑i=0N0TipθT1-pθT-i,Pb=1∣Hθ=∑i=N1TTipθT(1-pθ)T-i,(16)PD=KsK-stPb=0∣H1sPb=1∣H1t·Pni=1∣H1k-s-t,(17)PF=KsK-stPb=0∣H0sPb=1∣H0t·Pni=1∣H0k-s-t.Following from (16) and (17), the final probability of error can be determined using(18)Pe=p*1-PD+1-p×PD.To calculate power consumption for the whole network (16) can be used, where E = total energy, ET=transmissionenergy, ER = receiving energy, and ET = processing energy:(19)E=ET+ER+EP⟶E=∑i=1s+tLi*1*et+∑i=1K-s-tLi*T*et+∑i=1s+tLi*1*er+∑i=1K-s-tLi*T*er+∑i=1KT*ep⟶E=∑i=1s+tLi*et+er+∑i=1K-s-tLi*T*et+er+∑i=1KT*ep.


## 3. System Model (Telos)

In order to evaluate and develop our scheme, the behavior of WSN sensors should be understood, and a power consumption model should be defined [17]. For this purpose the typical operation conditions of TelosB (Figure 4) have been selected as a basis for our power model [18, 19].Figure 4
TelosB by the University of California.I use the datasheet of Telos working at 250 kbps and 2.4 GHz (ultralow power IEEE 802.15.4 compliant wireless sensor module), which is one of the most widely known WSN nodes, and I use the power details from Table2.Table 2
Telos typical operation conditions [24].
Min
Nom
Max
Unit
Supply voltage
2.1
3.6
V
Supply voltage during flash memory programming
2.7
3.6
V
Operation free air temperature
−40
85
°C
Current consumption: MCU on, radio RX
21.8
23
mA
Current consumption: MCU on, radio TX
19.5
21
mA
Current consumption: MCU on, radio off
1800
2400
μA
Current consumption: MCU idle, radio off
54.5
1200
μA
Current consumption: MCU standby
5.1
21.0
μAFrom the power consumption model in Figure5, it can be concluded that transmission is responsible for a large amount of node power consumption.Figure 5
Power consumption of “TelosB.”So far, only the behavior of a single node has been discussed. Now the power consumption of all the nodes in the network should be addressed.The formula for calculating the overall power consumed while sending a single bit from source (sensor node) to destination (fusion center) throughN hop nodes equals the energy required to send and receive this bit between all of the N hops, where E = total energy, ET=sendingenergy, and ER=receivingenergy:(20)Energyconsumedpernode:E=ET+ER⟶E=N*et+N-1*er.So, for the special case where a node is directly connected to the FC, energy used =et+er.For instance, if hops count = 10, energy used will =10et+9er.Thus, the length of a route affects the overall power consumed in the network and the network life time as well.


### 3.1. Power Calculation

We use TelosB model to calculate power consumption [20, 21], with the following:(i)
MCU current consumption: 2.4 mA,(ii)
Rx current consumption: 23 mA,(iii)
Tx current consumption: 21 mA.


### 3.2. Processing Energy

The MSP430 [22] is running at a clock rate of 8 MHz, Instruction Cycle Time = 200 ns, so in every cycle we can finish 40 Instructions/Cycle, [8*10-6/200*10-9].Let us assume that we need 2,000 instructions for the measurement, for data processing, and for preparing a packet for transmission over the network. This would result in2000/(40*8*106)=6.25*10-6s; the amount of energy consumed per sample at a current of 2.4 mA would be(21)EP=2.4*6.25*10-6=15*10-6mA/s.


### 3.3. Transmission Energy

Using CC2420, sending data takes place at a speed of 250 kbps. If one node collects from a local sensor or from all the children 1 bit of data to be forwarded to the parent node, power consumption can be calculated as in the following equations:(22)1250*103=4*10-6s,(23)ER=23*4*10-6=92*10-6mA/bit,(24)ET=21*4*10-6=84*10-6mA/bit.


### 3.4. Simulation Network Design

In order to derive more realistic data from our simulation model, we will apply TelosB properties in our network, with maximum coverage = 100 m. A total ofN sensors are randomly deployed in the region of interest (ROI) which is a square area of a2. I have selected a to be equal to 300 m; hence the ROI = 0.09 km2. The locations of sensors are unknown before deployment time. However, it is known that all sensors are i.i.d., and every sensor locations (x,y) will follow a uniform distribution in the ROI.


## 3.1. Power Calculation

We use TelosB model to calculate power consumption [20, 21], with the following:(i)
MCU current consumption: 2.4 mA,(ii)
Rx current consumption: 23 mA,(iii)
Tx current consumption: 21 mA.


## 3.2. Processing Energy

The MSP430 [22] is running at a clock rate of 8 MHz, Instruction Cycle Time = 200 ns, so in every cycle we can finish 40 Instructions/Cycle, [8*10-6/200*10-9].Let us assume that we need 2,000 instructions for the measurement, for data processing, and for preparing a packet for transmission over the network. This would result in2000/(40*8*106)=6.25*10-6s; the amount of energy consumed per sample at a current of 2.4 mA would be(21)EP=2.4*6.25*10-6=15*10-6mA/s.


## 3.3. Transmission Energy

Using CC2420, sending data takes place at a speed of 250 kbps. If one node collects from a local sensor or from all the children 1 bit of data to be forwarded to the parent node, power consumption can be calculated as in the following equations:(22)1250*103=4*10-6s,(23)ER=23*4*10-6=92*10-6mA/bit,(24)ET=21*4*10-6=84*10-6mA/bit.


## 3.4. Simulation Network Design

In order to derive more realistic data from our simulation model, we will apply TelosB properties in our network, with maximum coverage = 100 m. A total ofN sensors are randomly deployed in the region of interest (ROI) which is a square area of a2. I have selected a to be equal to 300 m; hence the ROI = 0.09 km2. The locations of sensors are unknown before deployment time. However, it is known that all sensors are i.i.d., and every sensor locations (x,y) will follow a uniform distribution in the ROI.


## 4. Enhanced Hybrid Detection Scheme

The hybrid scheme adjusts the behavior of the network to vary between centralized and distributed schemes and also establishesN0 and N1 parameters to define that behavior, and Y is the number of observations equal to 1. We propose to enhance the hybrid scheme by dynamically choosing the N0, N1 parameter instead of it being static.In the hybrid scheme ifY is between N0 and N1 the node will act as centralized; otherwise it will act as distributed, as shown in Figure 6. For the special case N1-N0≤1 the node will always act as distributed, and the node will act more centralized if N1-N0 becomes larger (until N0=0 and N1=MAX).Figure 6
Node behaviour depends onN0 and N1.However,N0 and N1 can be made dynamic, with a preference for a distributed orientation for nodes with longer route paths; for the remaining nodes it can remain more centralized, as in the original hybrid scheme, according to the requirements of the application.For every sensorS varied from 1 to K we will assign specific {N0i,N1i}. These sensors will be classified according to the route path: (25)Si=1,ni≥N1ini,N0i<ni<N1i0,ni≤N0i.Since0≤N0<N1≤T, we will have a finite number of combinations for N0 and N1. These combinations—or groups of them should be mapped to all sensors, depending on sensor path weight.The above mapping is a normaln-to-one mapping problem, which in our case can be solved experimentally by testing it in different deployed wireless sensor applications.


### 4.1. Network Deployment

Similar to most wireless sensor networks, the FC is deployed in an accessible location, while the sensor nodes are deployed randomly in the targeted area. This can be considered as a mesh network. After deploying the nodes, discovering the network is the first action to be taken. The FC broadcasts discover packets to all nodes in the covered area. These nodes then broadcast to further nodes until all the nodes are covered and routing paths; next hop and node configuration are defined.To simplify the problem, nodes discover paths to the FC based on SPF (shortest path first) and select subsequent hops to forward received packets to. This information is crucial.Since the nodes have already collected the broadcast packets, which include source, destination, and path, the nodes are able to select their routes based on the path length.


### 4.2. Nodes Configuration

For each node there are fixed configurations such asTx/Rx power, frequencies, and calculation process. Some parameters need to be configured by the manufacturer or the user in order to optimize network efficiency. On the other hand, some parameters may be configured by the network itself.In our scheme, every node has certain parameters that are defined during the manufacturing phase or by the developer during network deployment, that is, sampling rate(T), CPmin⁡, and CPmax⁡.CP is the probability that the system works as centralized, which can be calculated from N0 and N1. In our scheme each node will select N0 and N1 depending on its path length. N0 and N1 should generate CP where CPMin⁡≤CPN0,N1≤CPMax⁡.From those inputs{T,p0,p1,max⁡(path_length),CPmin⁡,CPmax⁡} each node is able to calculate the N0 and N1 that satisfy application requirements.FromT we can find (N0,N1) combinations = 2T, which is our ROT. Every node should be able to map the proper (N0,N1) from both (CPmin⁡,CPmax⁡) and max⁡(path_length), as can be seen in Figure 7.Figure 7
Mapping(N0,N1) combinations to available path length.We can map these ranges by means of a simple 1-to-many mapping technique, where we index the initial range and assign the remaining ones equally to the next range, as applied in Algorithm1.Algorithm 1:Local N0 and N1 selection.
Define{CPmin,CPmax}
for each{N0,N1}
CPi = binCDF(N1i-1,T,P[S=1])-binCDF(N0i,T,P[S=1]);
if CPmin<CPi<CPmax
add CPi to CP;
end if
end for
s
e
e
d = count(Path)/count(CP)
fori=1→ count(Path)
cp_seed=min⁡(ceil(i/seed),size(CP,1))
CPi=CP(cp_seed);
end for


### 4.3.N0, N1 Selection

To be able to selectN0 and N1 at each node the problem is divided into simpler problems as follows:(1)
Define all combination ofN0 and N1 and calculate the equivalent CP.(2)
Define validN0 and N1 based on CPmin⁡ and CPmax⁡.(3)
Define max path length, and map valid(N0,N1) to every path zone.


#### 4.3.1. AllN0, N1 Combinations

A selection ofN0 and N1 will define when the node will act as more centralized or more distributed. For T collected samples we will have 0≤N0<N1≤T. We can haveC different combinations for those N0 and N1, where C=T!/((T-2)!2!).For each combination we can calculate itsCPCENT, and we will have the C list of CP, which should be sorted according to its values.C
P
CENT can be calculated as in the following:(26)CPCENT=binocdfN1-1-binocdfN0,where cdf is the cumulative distribution function which can be calculated as in the following: (27)y=Fx∣n,p=∑i=0xnipi1-pn-iI0,1,…,ni.For example, forT=5, P[S=1]=0.45, we generate all possible combinations of (N0,N1) as shown in Table 3.Table 3
CP values for all (N0, N1) combinations.
N
0
N
1
CP
0
5
0.93
0
4
0.82
1
5
0.73
1
4
0.61
0
3
0.54
2
5
0.39
1
3
0.34
2
4
0.28
0
2
0.21
3
5
0.11
0
1
0.00
1
2
0.00
2
3
0.00
3
4
0.00
4
5
0.00


#### 4.3.2. ValidN0 and N1 Combinations

For example, we can select initialCPmin⁡=0.50, CPmax⁡=0.90.First of all we find the valid(N0,N1) combinations. The selection of CPmin⁡=0.50, CPmax⁡=0.90 gives us 4 valid combinations (Table 4).Table 4
(N0, N1) valid combination list.
CP
N
0
N
1
0.82
0
4
0.73
1
5
0.61
1
4
0.54
0
3


#### 4.3.3. Map(N0,N1) Combinations to Available Zones

In our scheme, every node has certain parameters that are defined during the manufacturing phase or by the developer during network deployment, that is, sampling rate (T), CPmin⁡, and CPmax⁡. All nodes are classified according to path length to Z zones. We have here a random WSN where maximum path = 6, which means 6 different zones. Figure 8 shows an example of WSN nodes classified into zones.Figure 8
Network zones classification.We define minimumCPmin⁡ and maximum CPmax⁡, where CPmax⁡ is the maximum CP combination that can be assigned for zone 1, and CPmin⁡ is the minimum CP that can be assigned to the next zones (where all CP≤CPmin⁡).For every zonez, we assign CPz=CPi from (23), which can be used to map between zones and (N0,N1) combinations (Table 5):(28)i=z÷CountofallZonesCountofCPsbetweenCPmin⁡andCPmax⁡,CP1=16/4=12=1,CP2=26/4=22=1,CP3=36/4=32=2,CP4=46/4=42=2,CP5=56/4=52=3,CP6=66/4=62=3.Table 5
All (N0, N1) combinations.
N
0
N
1
CP
0
1
0.00
1
2
0.00
2
3
0.00
3
4
0.00
4
5
0.00
3
5
0.11
0
2
0.21
2
4
0.28
1
3
0.34
2
5
0.39
0
3
0.54
1
4
0.61
1
5
0.73
0
4
0.82
0
5
0.93Table 6
ISA100.11a stack (Internet source).
Session
ISA native and legacy protocols (tunnelling)
Transport
UDP (IETF RFC 768)
Network
6LoWPAN (IETF RFC 4944)
Data link
Upper data link ISA100.11.a
IEEE 802.15.4
Physical
IEEE 802.15.4In this scheme we find that(N0,N1) are dynamically selected by the nodes, depending on the path length, and the entire procedure described above requires minimal extra processing at the node, since the whole process is part of the network discovery phase.Out ofK sensor nodes, t nodes send 1s, s nodes send 0s, and k-s-t nodes send all their observation so total send data Ω will be Ω=1,…,1;n1,…,nk-s-t;0,…,0;. Our final decision, based on Bayes’ rule, is H′=H1 if PH1∣Ω≥PH0∣Ω. From the above rule we can derive the following relations:(29)PΩ∣H1PΩ∣H0≥1-pp,where we can calculate PΩ∣H1 and Pbi=0∣Hα, Pbi=1∣Hα, and Pbi=1∣Hα as follows: (30)PΩ∣Hα=ksk-stPb=0∣Hαs·Pb=1∣Hαt×Pni∣Hαk-s-t,Pbi=0∣Hα=∑n=T-N0iTnT-N0i-11-pαT-N0ipαi-T-N0i,Pbi=1∣Hα=∑n=N1iTn-1N1i-11-pαn-N1ipαN1i,Pni∣Hα=Tni1-pα1-nipαni.


## 4.1. Network Deployment

Similar to most wireless sensor networks, the FC is deployed in an accessible location, while the sensor nodes are deployed randomly in the targeted area. This can be considered as a mesh network. After deploying the nodes, discovering the network is the first action to be taken. The FC broadcasts discover packets to all nodes in the covered area. These nodes then broadcast to further nodes until all the nodes are covered and routing paths; next hop and node configuration are defined.To simplify the problem, nodes discover paths to the FC based on SPF (shortest path first) and select subsequent hops to forward received packets to. This information is crucial.Since the nodes have already collected the broadcast packets, which include source, destination, and path, the nodes are able to select their routes based on the path length.


## 4.2. Nodes Configuration

For each node there are fixed configurations such asTx/Rx power, frequencies, and calculation process. Some parameters need to be configured by the manufacturer or the user in order to optimize network efficiency. On the other hand, some parameters may be configured by the network itself.In our scheme, every node has certain parameters that are defined during the manufacturing phase or by the developer during network deployment, that is, sampling rate(T), CPmin⁡, and CPmax⁡.CP is the probability that the system works as centralized, which can be calculated from N0 and N1. In our scheme each node will select N0 and N1 depending on its path length. N0 and N1 should generate CP where CPMin⁡≤CPN0,N1≤CPMax⁡.From those inputs{T,p0,p1,max⁡(path_length),CPmin⁡,CPmax⁡} each node is able to calculate the N0 and N1 that satisfy application requirements.FromT we can find (N0,N1) combinations = 2T, which is our ROT. Every node should be able to map the proper (N0,N1) from both (CPmin⁡,CPmax⁡) and max⁡(path_length), as can be seen in Figure 7.Figure 7
Mapping(N0,N1) combinations to available path length.We can map these ranges by means of a simple 1-to-many mapping technique, where we index the initial range and assign the remaining ones equally to the next range, as applied in Algorithm1.Algorithm 1:Local N0 and N1 selection.
Define{CPmin,CPmax}
for each{N0,N1}
CPi = binCDF(N1i-1,T,P[S=1])-binCDF(N0i,T,P[S=1]);
if CPmin<CPi<CPmax
add CPi to CP;
end if
end for
s
e
e
d = count(Path)/count(CP)
fori=1→ count(Path)
cp_seed=min⁡(ceil(i/seed),size(CP,1))
CPi=CP(cp_seed);
end for


## 4.3.N0, N1 Selection

To be able to selectN0 and N1 at each node the problem is divided into simpler problems as follows:(1)
Define all combination ofN0 and N1 and calculate the equivalent CP.(2)
Define validN0 and N1 based on CPmin⁡ and CPmax⁡.(3)
Define max path length, and map valid(N0,N1) to every path zone.


### 4.3.1. AllN0, N1 Combinations

A selection ofN0 and N1 will define when the node will act as more centralized or more distributed. For T collected samples we will have 0≤N0<N1≤T. We can haveC different combinations for those N0 and N1, where C=T!/((T-2)!2!).For each combination we can calculate itsCPCENT, and we will have the C list of CP, which should be sorted according to its values.C
P
CENT can be calculated as in the following:(26)CPCENT=binocdfN1-1-binocdfN0,where cdf is the cumulative distribution function which can be calculated as in the following: (27)y=Fx∣n,p=∑i=0xnipi1-pn-iI0,1,…,ni.For example, forT=5, P[S=1]=0.45, we generate all possible combinations of (N0,N1) as shown in Table 3.Table 3
CP values for all (N0, N1) combinations.
N
0
N
1
CP
0
5
0.93
0
4
0.82
1
5
0.73
1
4
0.61
0
3
0.54
2
5
0.39
1
3
0.34
2
4
0.28
0
2
0.21
3
5
0.11
0
1
0.00
1
2
0.00
2
3
0.00
3
4
0.00
4
5
0.00


### 4.3.2. ValidN0 and N1 Combinations

For example, we can select initialCPmin⁡=0.50, CPmax⁡=0.90.First of all we find the valid(N0,N1) combinations. The selection of CPmin⁡=0.50, CPmax⁡=0.90 gives us 4 valid combinations (Table 4).Table 4
(N0, N1) valid combination list.
CP
N
0
N
1
0.82
0
4
0.73
1
5
0.61
1
4
0.54
0
3


### 4.3.3. Map(N0,N1) Combinations to Available Zones

In our scheme, every node has certain parameters that are defined during the manufacturing phase or by the developer during network deployment, that is, sampling rate (T), CPmin⁡, and CPmax⁡. All nodes are classified according to path length to Z zones. We have here a random WSN where maximum path = 6, which means 6 different zones. Figure 8 shows an example of WSN nodes classified into zones.Figure 8
Network zones classification.We define minimumCPmin⁡ and maximum CPmax⁡, where CPmax⁡ is the maximum CP combination that can be assigned for zone 1, and CPmin⁡ is the minimum CP that can be assigned to the next zones (where all CP≤CPmin⁡).For every zonez, we assign CPz=CPi from (23), which can be used to map between zones and (N0,N1) combinations (Table 5):(28)i=z÷CountofallZonesCountofCPsbetweenCPmin⁡andCPmax⁡,CP1=16/4=12=1,CP2=26/4=22=1,CP3=36/4=32=2,CP4=46/4=42=2,CP5=56/4=52=3,CP6=66/4=62=3.Table 5
All (N0, N1) combinations.
N
0
N
1
CP
0
1
0.00
1
2
0.00
2
3
0.00
3
4
0.00
4
5
0.00
3
5
0.11
0
2
0.21
2
4
0.28
1
3
0.34
2
5
0.39
0
3
0.54
1
4
0.61
1
5
0.73
0
4
0.82
0
5
0.93Table 6
ISA100.11a stack (Internet source).
Session
ISA native and legacy protocols (tunnelling)
Transport
UDP (IETF RFC 768)
Network
6LoWPAN (IETF RFC 4944)
Data link
Upper data link ISA100.11.a
IEEE 802.15.4
Physical
IEEE 802.15.4In this scheme we find that(N0,N1) are dynamically selected by the nodes, depending on the path length, and the entire procedure described above requires minimal extra processing at the node, since the whole process is part of the network discovery phase.Out ofK sensor nodes, t nodes send 1s, s nodes send 0s, and k-s-t nodes send all their observation so total send data Ω will be Ω=1,…,1;n1,…,nk-s-t;0,…,0;. Our final decision, based on Bayes’ rule, is H′=H1 if PH1∣Ω≥PH0∣Ω. From the above rule we can derive the following relations:(29)PΩ∣H1PΩ∣H0≥1-pp,where we can calculate PΩ∣H1 and Pbi=0∣Hα, Pbi=1∣Hα, and Pbi=1∣Hα as follows: (30)PΩ∣Hα=ksk-stPb=0∣Hαs·Pb=1∣Hαt×Pni∣Hαk-s-t,Pbi=0∣Hα=∑n=T-N0iTnT-N0i-11-pαT-N0ipαi-T-N0i,Pbi=1∣Hα=∑n=N1iTn-1N1i-11-pαn-N1ipαN1i,Pni∣Hα=Tni1-pα1-nipαni.


## 4.3.1. AllN0, N1 Combinations

A selection ofN0 and N1 will define when the node will act as more centralized or more distributed. For T collected samples we will have 0≤N0<N1≤T. We can haveC different combinations for those N0 and N1, where C=T!/((T-2)!2!).For each combination we can calculate itsCPCENT, and we will have the C list of CP, which should be sorted according to its values.C
P
CENT can be calculated as in the following:(26)CPCENT=binocdfN1-1-binocdfN0,where cdf is the cumulative distribution function which can be calculated as in the following: (27)y=Fx∣n,p=∑i=0xnipi1-pn-iI0,1,…,ni.For example, forT=5, P[S=1]=0.45, we generate all possible combinations of (N0,N1) as shown in Table 3.Table 3
CP values for all (N0, N1) combinations.
N
0
N
1
CP
0
5
0.93
0
4
0.82
1
5
0.73
1
4
0.61
0
3
0.54
2
5
0.39
1
3
0.34
2
4
0.28
0
2
0.21
3
5
0.11
0
1
0.00
1
2
0.00
2
3
0.00
3
4
0.00
4
5
0.00


## 4.3.2. ValidN0 and N1 Combinations

For example, we can select initialCPmin⁡=0.50, CPmax⁡=0.90.First of all we find the valid(N0,N1) combinations. The selection of CPmin⁡=0.50, CPmax⁡=0.90 gives us 4 valid combinations (Table 4).Table 4
(N0, N1) valid combination list.
CP
N
0
N
1
0.82
0
4
0.73
1
5
0.61
1
4
0.54
0
3


## 4.3.3. Map(N0,N1) Combinations to Available Zones

In our scheme, every node has certain parameters that are defined during the manufacturing phase or by the developer during network deployment, that is, sampling rate (T), CPmin⁡, and CPmax⁡. All nodes are classified according to path length to Z zones. We have here a random WSN where maximum path = 6, which means 6 different zones. Figure 8 shows an example of WSN nodes classified into zones.Figure 8
Network zones classification.We define minimumCPmin⁡ and maximum CPmax⁡, where CPmax⁡ is the maximum CP combination that can be assigned for zone 1, and CPmin⁡ is the minimum CP that can be assigned to the next zones (where all CP≤CPmin⁡).For every zonez, we assign CPz=CPi from (23), which can be used to map between zones and (N0,N1) combinations (Table 5):(28)i=z÷CountofallZonesCountofCPsbetweenCPmin⁡andCPmax⁡,CP1=16/4=12=1,CP2=26/4=22=1,CP3=36/4=32=2,CP4=46/4=42=2,CP5=56/4=52=3,CP6=66/4=62=3.Table 5
All (N0, N1) combinations.
N
0
N
1
CP
0
1
0.00
1
2
0.00
2
3
0.00
3
4
0.00
4
5
0.00
3
5
0.11
0
2
0.21
2
4
0.28
1
3
0.34
2
5
0.39
0
3
0.54
1
4
0.61
1
5
0.73
0
4
0.82
0
5
0.93Table 6
ISA100.11a stack (Internet source).
Session
ISA native and legacy protocols (tunnelling)
Transport
UDP (IETF RFC 768)
Network
6LoWPAN (IETF RFC 4944)
Data link
Upper data link ISA100.11.a
IEEE 802.15.4
Physical
IEEE 802.15.4In this scheme we find that(N0,N1) are dynamically selected by the nodes, depending on the path length, and the entire procedure described above requires minimal extra processing at the node, since the whole process is part of the network discovery phase.Out ofK sensor nodes, t nodes send 1s, s nodes send 0s, and k-s-t nodes send all their observation so total send data Ω will be Ω=1,…,1;n1,…,nk-s-t;0,…,0;. Our final decision, based on Bayes’ rule, is H′=H1 if PH1∣Ω≥PH0∣Ω. From the above rule we can derive the following relations:(29)PΩ∣H1PΩ∣H0≥1-pp,where we can calculate PΩ∣H1 and Pbi=0∣Hα, Pbi=1∣Hα, and Pbi=1∣Hα as follows: (30)PΩ∣Hα=ksk-stPb=0∣Hαs·Pb=1∣Hαt×Pni∣Hαk-s-t,Pbi=0∣Hα=∑n=T-N0iTnT-N0i-11-pαT-N0ipαi-T-N0i,Pbi=1∣Hα=∑n=N1iTn-1N1i-11-pαn-N1ipαN1i,Pni∣Hα=Tni1-pα1-nipαni.


## 5. Simulation Results

### 5.1. Enhanced Hybrid Detection Scheme

#### 5.1.1. Power Consumption

By applying “Telos” power model and using (18), (19), and (21), power calculation isprocessing power =15*10-6mA/sample, Rxpower=92*10-6mA/bit, Tx power = 84*10-6mA/bit, and T=5.Centralized. In centralized scheme, the RF transmission is the most power consuming process (Figure 9).Figure 9
Centralized scheme power consumption.Distributed. Similar to the centralized scheme, in the RF scheme, the most power consuming process in is the transmission part, (Figure 10).Figure 10
Distributed scheme power consumption.Hybrid (
N
0
=
1
,
N
1
=
4
). We assume the following: p=0.5, p0=0.2, p1=0.7, and T=5; K is varied from 10 to 30 (Figure 11).Figure 11
Hybrid scheme power consumption.Enhanced Hybrid. We define the probability of node behavior as centralized CP; we get CP values out of possible combination of N0 and N1.Figure12 shows the power consumption of enhanced hybrid scheme, where we assign CPmin⁡=0.25 and CPmax⁡=0.70.Figure 12
Enhanced hybrid scheme power consumption.All Energy Schemes. The performance of the four schemes is shown in Figure 13, as we can see that enhanced scheme outperforms other schemes.Figure 13
Power consumption of all schemes.Accuracy Behavior. In our simulation we are able to get the same result which is given in [16], where we used hybrid (N0,N1)=(1,3), (1,4), and (0,4) as shown in Figure 14.Figure 14
Comparison of three schemes in detection accuracy.The performance of the four schemes is shown in Figure15, as we can see that enhanced scheme outperforms other schemes. In comparison to hybrid scheme our scheme gives a very close level of accuracy, as illustrated in Figure 15.Figure 15
Probability of error for all schemes.


## 5.1. Enhanced Hybrid Detection Scheme

### 5.1.1. Power Consumption

By applying “Telos” power model and using (18), (19), and (21), power calculation isprocessing power =15*10-6mA/sample, Rxpower=92*10-6mA/bit, Tx power = 84*10-6mA/bit, and T=5.Centralized. In centralized scheme, the RF transmission is the most power consuming process (Figure 9).Figure 9
Centralized scheme power consumption.Distributed. Similar to the centralized scheme, in the RF scheme, the most power consuming process in is the transmission part, (Figure 10).Figure 10
Distributed scheme power consumption.Hybrid (
N
0
=
1
,
N
1
=
4
). We assume the following: p=0.5, p0=0.2, p1=0.7, and T=5; K is varied from 10 to 30 (Figure 11).Figure 11
Hybrid scheme power consumption.Enhanced Hybrid. We define the probability of node behavior as centralized CP; we get CP values out of possible combination of N0 and N1.Figure12 shows the power consumption of enhanced hybrid scheme, where we assign CPmin⁡=0.25 and CPmax⁡=0.70.Figure 12
Enhanced hybrid scheme power consumption.All Energy Schemes. The performance of the four schemes is shown in Figure 13, as we can see that enhanced scheme outperforms other schemes.Figure 13
Power consumption of all schemes.Accuracy Behavior. In our simulation we are able to get the same result which is given in [16], where we used hybrid (N0,N1)=(1,3), (1,4), and (0,4) as shown in Figure 14.Figure 14
Comparison of three schemes in detection accuracy.The performance of the four schemes is shown in Figure15, as we can see that enhanced scheme outperforms other schemes. In comparison to hybrid scheme our scheme gives a very close level of accuracy, as illustrated in Figure 15.Figure 15
Probability of error for all schemes.


## 5.1.1. Power Consumption

By applying “Telos” power model and using (18), (19), and (21), power calculation isprocessing power =15*10-6mA/sample, Rxpower=92*10-6mA/bit, Tx power = 84*10-6mA/bit, and T=5.Centralized. In centralized scheme, the RF transmission is the most power consuming process (Figure 9).Figure 9
Centralized scheme power consumption.Distributed. Similar to the centralized scheme, in the RF scheme, the most power consuming process in is the transmission part, (Figure 10).Figure 10
Distributed scheme power consumption.Hybrid (
N
0
=
1
,
N
1
=
4
). We assume the following: p=0.5, p0=0.2, p1=0.7, and T=5; K is varied from 10 to 30 (Figure 11).Figure 11
Hybrid scheme power consumption.Enhanced Hybrid. We define the probability of node behavior as centralized CP; we get CP values out of possible combination of N0 and N1.Figure12 shows the power consumption of enhanced hybrid scheme, where we assign CPmin⁡=0.25 and CPmax⁡=0.70.Figure 12
Enhanced hybrid scheme power consumption.All Energy Schemes. The performance of the four schemes is shown in Figure 13, as we can see that enhanced scheme outperforms other schemes.Figure 13
Power consumption of all schemes.Accuracy Behavior. In our simulation we are able to get the same result which is given in [16], where we used hybrid (N0,N1)=(1,3), (1,4), and (0,4) as shown in Figure 14.Figure 14
Comparison of three schemes in detection accuracy.The performance of the four schemes is shown in Figure15, as we can see that enhanced scheme outperforms other schemes. In comparison to hybrid scheme our scheme gives a very close level of accuracy, as illustrated in Figure 15.Figure 15
Probability of error for all schemes.


## 6. Conclusions

The main purpose of this paper is to enhance the event collection and detection capability of current WSN schemes. Two of the available schemes—centralized and distributed schemes—are basic and have no flexibility. The third scheme—the hybrid scheme—uses the two previous schemes to balance accuracy and energy; nevertheless all the nodes remain with fixed configuration and limited flexibility. On the contrary, the proposed scheme is designed to be more flexible in order to balance the power consumption and the detection accuracy at the node level. Every node is flexible in deciding how to behave, that is, whether to be more centralized or distributed.To be able to compare the tradeoff between accuracy and power consumption in these schemes the model used should be realistic. This is one of the most significant weaknesses of the previous research, in which all power consumption calculations have been based solely on an assumed model. In the proposed scheme this weakness has been overcome by using a real WSN model, which produces realistic results.As can be seen from the simulation results, our scheme saves a substantial amount of energy compared to the hybrid scheme, while retaining accuracy to almost the same degree. In addition, our scheme deals more efficiently with larger network area and denser node-number.Although the focus of this paper has been on reducing overall power consumption, other future enhancements are also possible, for example, enhancing overall network lifetime by improving(N0,N1) selection techniques where the following factors can be considered:(i)
individual node power level,(ii)
event occurrence probability at each node,(iii)
next-hop distance and realTx, Rx power.



---

*Source: 276804-2015-03-05.xml*