ENHANCEMENT OF SENSOR NODE EFFICIENCY IN HETEROGENEOUS NETWORK USING DISTANCE (SEP) IN WSN

Similar documents
Z-SEP: Zonal-Stable Election Protocol for Wireless Sensor Networks

An Improved Gateway Based Multi Hop Routing Protocol for Wireless Sensor Network

Zonal based Deterministic Energy Efficient Clustering Protocol for WSNs

FUZZY LOGIC APPROACH TO IMPROVING STABLE ELECTION PROTOCOL FOR CLUSTERED HETEROGENEOUS WIRELESS SENSOR NETWORKS

K-SEP: A more stable SEP using K-Means Clustering and Probabilistic Transmission in WSN

ENERGY PROFICIENT CLUSTER BASED ROUTING PROTOCOL FOR WSN 1

Hierarchical Routing Algorithm to Improve the Performance of Wireless Sensor Network

F-MCHEL: Fuzzy Based Master Cluster Head Election Leach Protocol in Wireless Sensor Network

DE-LEACH: Distance and Energy Aware LEACH

Keywords Wireless Sensor Network, Cluster, Energy Efficiency, Heterogeneous network, Cluster, Gateway

Heterogeneous LEACH Protocol for Wireless Sensor Networks

A NOVEL APPROACH OF IMPROVED STABLE ELECTION PROTOCOL (I-SEP) IN WSN

ESRP: Energy Sensitive Routing Protocol for Wireless Sensor Networks

ISSN: X International Journal of Advanced Research in Electronics and Communication Engineering (IJARECE) Volume 6, Issue 1, January 2017

Comparative Analysis of EDDEEC & Fuzzy Cost Based EDDEEC Protocol for WSNs

Performance Comparison of Energy Efficient Clustering Protocol in Heterogeneous Wireless Sensor Network

Summary of Energy-Efficient Communication Protocol for Wireless Microsensor Networks

CFMTL: Clustering Wireless Sensor Network Using Fuzzy Logic and Mobile Sink In Three-Level

Novel Cluster Based Routing Protocol in Wireless Sensor Networks

New Data Clustering Algorithm (NDCA)

Modified Stable Election Protocol (M-SEP) for Hierarchical WSN

CLUSTER HEAD SELECTION USING QOS STRATEGY IN WSN

SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks

An Energy-Efficient Hierarchical Routing for Wireless Sensor Networks

Modified Low Energy Adaptive Clustering Hierarchy for Heterogeneous Wireless Sensor Network

(EBHCR) Energy Balancing and Hierarchical Clustering Based Routing algorithm for Wireless Sensor Networks

Keywords Clustering, Sensor Nodes, Residual Energy, Wireless Sensor Networks, Zones

Enhancement of Hierarchy Cluster-Tree Routing for Wireless Sensor Network

COMPARATIVE PERFORMANCE ANALYSIS OF TEEN SEP LEACH ERP EAMMH AND PEGASIS ROUTING PROTOCOLS

INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND TECHNOLOGY (IJARET)

An Energy Efficiency Routing Algorithm of Wireless Sensor Network Based on Round Model. Zhang Ying-Hui

Ameliorate Threshold Distributed Energy Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks

Density controlled-divide and Rule Scheme for Energy Efficient Routing in WSNs

EDAC: A Novel Energy-Aware Clustering Algorithm for Wireless Sensor Networks

EETSR: Energy Efficient Threshold Sensitive Hierarchical Routing Protocol for Wireless Sensor Network

International Journal of Research in Advent Technology Available Online at:

A PROPOSAL FOR IMPROVE THE LIFE- TIME OF WIRELESS SENSOR NETWORK

AN IMPROVED ENERGY EFFICIENT ROUTING PROTOCOL FOR HETEROGENEOUS WIRELESS SENSOR NETWORKS. Received January 2017; revised May 2017

Hybrid Approach for Energy Optimization in Wireless Sensor Networks

A Distributed Clustering Mechanism in HWSNs for Enhancing the Lifetime

Efficient Heterogeneous Wireless Sensor Network Using Improved Energy Optimization Approach

Distributed clustering algorithms for data-gathering in wireless mobile sensor networks

SCH-BASED LEACH ALGORITHM TO ENHANCE THE NETWORK LIFE TIME IN WIRELESS SENSOR NETWORK (WSN)

IMPROVEMENT OF LEACH AND ITS VARIANTS IN WIRELESS SENSOR NETWORK

An Energy Efficient Clustering in Wireless Sensor Networks

A Centroid Hierarchical Clustering Algorithm for Data Gathering in Wireless Sensor Networks.

ENERGY EFFICIENT TWO STAGE CHAIN ROUTING PROTOCOL (TSCP) FOR WIRELESS SENSOR NETWORKS

Energy Efficient System for Wireless Sensor Networks using Modified RECHS Protocol

Energy Efficient Scheme for Clustering Protocol Prolonging the Lifetime of Heterogeneous Wireless Sensor Networks

MODIFIED LEACH-C PROTOCOL FOR CLUSTER BASED ROUTING IN ENERGY EFFICIENT WIRELESS SENSOR NETWORKS

A MULTI-HOP ROUTING SCHEME BASED ON DIFFERENT SPATIAL DENSITY OF NODES IN WSNS

Effect Of Grouping Cluster Based on Overlapping FOV In Wireless Multimedia Sensor Network

Position-Based Clustering: An Energy-Efficient Clustering Hierarchy for Heterogeneous Wireless Sensor Networks

Energy Efficient data collection through Double Cluster Heads in Wireless Sensor Network

SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks

Distributed Cluster Head Election (DCHE) Scheme for Improving Lifetime of Heterogeneous Sensor Networks

Efficient Cluster Head Selection Method Based On K-means Algorithm to Maximize Energy of Wireless Sensor Networks

Energy Efficient Homogeneous and Heterogeneous System for Wireless Sensor Networks

A Mobile-Sink Based Distributed Energy-Efficient Clustering Algorithm for WSNs

Multi-Hop Clustering Protocol using Gateway Nodes in Wireless Sensor Network

High Speed Data Collection in Wireless Sensor Network

Energy Efficient Clustering Approach for Data Aggregation and Fusion in Wireless Sensor Networks

Low Energy Adaptive Clustering Hierarchy Variance in Wireless Sensor Network (LEACH)

Implementation of Energy Efficient Clustering Using Firefly Algorithm in Wireless Sensor Networks

Analysis of Cluster-Based Energy-Dynamic Routing Protocols in WSN

Comparative analysis of centralized and distributed clustering algorithm for energy- efficient wireless sensor network

Extending Network Lifetime of Clustered-Wireless Sensor Networks Based on Unequal Clustering

A Proposed Technique for Reliable and Energy Efficient Hierarchical Routing in Heterogeneous Wireless Sensor Networks

DISTANCE BASED CLUSTER FORMATION FOR ENHANCING THE NETWORK LIFE TIME IN MANETS

Adapting Distance Based Clustering Concept to a Heterogeneous Network

Distributed Fuzzy Logic-based Cluster Routing for Wireless Sensor Networks

LOAD BALANCING USING CLUSTERING IN WSN WITH FUZZY LOGIC TECHNIQUES

Proficient D-SEP Protocol with Heterogeneity for Maximizing the Lifetime of Wireless Sensor Networks

Webpage: Volume 3, Issue VI, June 2015 ISSN

Clustering Routing Protocol Based on Location Node in Wireless Sensor Networks

Webpage: Volume 4, Issue VI, June 2016 ISSN

A Modified LEACH Protocol for Increasing Lifetime of the Wireless Sensor Network

Energy Efficient Hierarchical Cluster-Based Routing for Wireless Sensor Networks

Energy Efficient Zonal Stable Election Protocol for WSNs

A Novel Energy Aware Clustering for Multilevel Heterogeneous Wireless Sensor Networks

The Study of the Energy Efficient Protocols (MODLEACH, SEP and DEEC)

Energy Efficient Clustering Protocol for Wireless Sensor Network

International Journal of Computer Engineering and Applications, Volume XII, Issue III, March 18, ISSN

A REVIEW ON LEACH-BASED HIERARCHICAL ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORK

An Energy Efficient Unequal Cluster Based Routing Protocol For WSN With Non-Uniform Node Distribution

G-DEEC: GATEWAY BASED MULTI-HOP DISTRIBUTED ENERGY EFFICIENT CLUSTERING PROTOCOL FOR WIRELESS SENSOR NETWORKS

A Survey on Energy Efficient Hierarchical (Leach) Clustering Algorithms in Wireless Sensor Network

A Review Paper on Routing Protocols in Wireless Sensor Networks

Fuzzy based Stable Clustering Protocol forheterogeneous Wireless Sensor Networks

Energy Efficient Clustering Protocol for Minimizing Cluster Size and Inter Cluster Communication in Heterogeneous Wireless Sensor Network

SHORTEST PATH BASED GEOGRAPHIC ROUTING IN CLUSTERED WIRELESS SENSOR NETWORK

ENERGY AWARE CLUSTERING PROTOCOL (EACP) FOR HETEROGENEOUS WSNS

Fig. 2: Architecture of sensor node

There into, Ei : Residual energy of each node in I round; Er : average energy of rest nodes in I round;

A Zone-Based Clustering Protocol for Wireless Sensor Networks

HCTE: Hierarchical Clustering based routing algorithm with applying the Two cluster heads in each cluster for Energy balancing in WSN

An Energy Efficient Data Dissemination Algorithm for Wireless Sensor Networks

Effect of Sensor Mobility and Channel Fading on Wireless Sensor Network Clustering Algorithms

ICHALEC Improved Cluster Head And Low Energy Consumption Protocol In Wireless Sensor Network

Analysis of Cluster based Routing Algorithms in Wireless Sensor Networks using NS2 simulator

Transcription:

Int. J. Engg. Res. & Sci. & Tech. 2015 Bhagwati and Yashpal Yadav, 2015 Research Paper ISSN 2319-5991 www.ijerst.com Vol. 4, No. 3, August 2015 2015 IJERST. All Rights Reserved ENHANCEMENT OF SENSOR NODE EFFICIENCY IN HETEROGENEOUS NETWORK USING DISTANCE (SEP) IN WSN Bhagwati 1 * and Yashpal Yadav 1 *Corresponding Author: Yashpal Yadav kaushik.bhagwati2@gmail.com In this research we reflect the Wireless Sensor Networks (WSNs) have seen an increased interest in various applications like border field security, disaster management and medical applications. So, large number of sensor nodes are deployed for such applications, which can work autonomously. Due to small power batteries in WSNs, efficient utilization of battery power is an important factor. Clustering is an efficient technique to extend life time of sensor networks by reducing the energy consumption. In this paper, we propose a protocol; Distance based Stable Election Protocol (D-SEP). Our CH selection scheme is based on the weighted election probabilities of each node according to the Energy Consumption (EC) of each node.our simulation results show that our proposed protocol, ECRSEP outperforms all these protocols in terms of network stability and network lifetime. Keywords: WSN, SEP protocol, CH, etc. INTRODUCTION While Wireless Sensor Networks (WSNs) are increasingly equipped to handle more complex functions, in-network processing may require these battery powered sensors to judiciously use their constrained energy to prolong the effective network life time especially in a heterogeneous settings. Clustered techniques have since been employed to optimize energy consumption in this energy constrained WSN. We propose clustering algorithm in a threetier node scenario to prolong the effective network life-time. Simulation results shows that the D-SEP protocol achieves better performance in this respect, compared to other existing clustering algorithm such as LEACH and SEP in both heterogeneous and homogenous environments. WSN technologies have been employed in recent years for monitoring purposes in various domains from engineering industry to our home environment due to their ability to intelligently monitor remote locations. Sensor nodes are organized in the sensing zone to display exact boards and assemble data. Before, the sensor nodes send the data to sink or Base Station (BS) though the wireless 1 DPG Institute of Technology & Management, Sector - 34, Near Hero Honda Chowk (NH8), Gurgaon, Haryana 122 001, India. 55

Figure 1: Event Detection at the Cluster Head Heterogeneous with WSN transmission system. WSN have been universal in numerous submissions counting healthcare system, battlefield surveillance system, environment monitoring system, and so on. Power or energy saving is most of the significant structures for the sensor nodes to range their lifetime in wireless sensor networks. A sensor node consumes typically its energy in conveying and receiving packets. In wireless sensor networks, the chief power source of the sensor nod is battery. SEP WITH HETEROGENEITY SEP (Stable election protocol (Smaragdakis, 2004) is a projected system for heterogeneous Figure 2: Snapshot of Cluster Foundation in SEP for 100 Nodes wireless sensor networks. Now two kinds of nodes (Advanced and normal nodes) are measured with dissimilar initial energy. The advanced or progressive nodes are prepared with extra energy than the normal nodes at the opening. Additional, in literature it has been experimental that the SEP produces longer stability area for higher standards of extra energy transported by more controlling nodes, but it cannot be useful to multi-level. We propose a deterministic energy-efficient clustering protocol that is dynamic, distributive, self-organizing and more energy efficient than the existing protocols. It utilizes a simplified approach which minimizes computational overhead-cost to self-organize the sensor network. Our simulation result shows a better performance with respect to energy consumption, which is reflected in the network lifetime in both homogeneous and heterogeneous settings when compared with the existing protocols. It is worthy of note that our approach approximates an ideal solution for balanced energy consumption in hierarchical wireless sensor networks. LITERATURE REVIEW Development in the network life has been found since of the cluster head has not dead ever. As a cluster head has been died it has been substituted by its vice Cluster head. Babaie et al. (2010) have proposed a original technique to choice a cluster Head. LEACH protocol has set threshold value to 0 for next 1/p circles when a node has been designated as a cluster head. This method enhanced LEACH method, by regulating threshold seeing some factors. Ahlawat et al. (2013) has proposed a new method in which idea of Vice Cluster head has 56

been taken out to recover the network lifetime. Vice Cluster head has been designated as alternative head that has functioned when the cluster head has dropped down. Standards for the selection of vice cluster head have set up on the base of three factors, i.e., Minimum distance, maximum residual energy, and minimum energy. Bakr et al. (2011) have complete attention mostly on covering the WSN lifetime. Lifetime has been protracted by making WSNs dismissed by adding spare nodes. The passive (switched off) spares has been made available to develop active (be switched on) when some active WSN node energy tired. Beiranavand et al. (2013) have proposed a development in LEACH blessed I-LEACH, An Development has been done by as essentially three factors; Residual Energy in nodes, Distance from base station and number of adjacent nodes. Reduction in energy consumption and continuation in network life time has been experiential. PROBLEM STATEMENT One of the problems in the SEP protocol is that the cluster head which are far away to the base station will consume more energy and are dying very frequently. Whereas cluster-heads which are near to the base station takes operation until end, that will cause network instability and the network lifetime is greatly affected. We will try to enhance the lifetime of the network by avoiding direct transmission method; instead we have used the multi-hop transmission method. By this method we can enhance the lifetime of sensor network. The parameters for the evolutions of results for simulation are described below: Stability period: It is defined as the time interval between starting of the operation of the network and to the death of the first node. It is also called stable region. Instability period: It is defined as the time interval between the deaths of first sensor node to the death of last node. Cluster head per round: It is the number of nodes that sends data to the sink directly after aggregating the data. Network lifetime: It is defined as the staring of the network operation to the death of the last node. Throughput: It is defined as the rate of data sent over network, it includes both the data transfer, i.e., from node to cluster head and cluster head to sink. SYSTEM MODEL Energy Model A sensor usage its energy in instruction to transmit out three main purposes: acquisition, communication and data processing. Acquisition: the energy expended to convey out the acquisition is usually insignificant. Nevertheless, it differs in substantial proportions dependent on the type of checking being approved out. Communication: It consumes more energy than any other task. It concealments the communications in standings of release and reception. Figure 1 shows the transmission system model and the instructions useful to measured energy consumption (Li, 2005). Data processing: The energy consumed for the 57

Figure 3: Energy Consumption Model for Communications control operation is very low as compared with the communication energy. The energy wanted to convey 1 KB over a 100 m distance is around equivalent to the energy essential to transmit out 3 million instructions at a speed of 100 million instructions per second (MIPS). This level strength be much reliant on on the circuitry installed in the nodes and the features requested. communicates with the adjacent neighbor in multi-hop mode, nodes route data intended eventually to the base station through middle nodes. Figure 4: Multi-jump Linear Model Featuring Equal Distances Between The Nodes...(1) where E elec signifies energy consumed in transmission, eamp amplification, k the message length, d the transmitter/receiver distance and α a factor telling attenuation. To obtain a message of k bits, the receiver then consumes:...(2) Communication topology we accept a simple linear topology to deliberate communication mode, as shown in Figure 2 in order to shorten the analysis. At the left of the Figure 2, there are n sensor nodes decided at intermissions of r. The base station is on the right end. By single hop mode, each node straight communicates with the base station; by contrast, each node PROPOSED IMPLEMENTATION Step1: First of all for network setup all the constants and variable are initialized. Like number of nodes, diameters of sensor network, probability of node to become cluster head, distance of base station from the network, distance between the cluster head and base station, energy supplied to each node, transmitter and receiver energy per node, amplification energy, etc. In this we describe five different types of nodes like normal nodes, intermediate nodes, advance nodes, super nodes and ultra-nodes. 58

Ultra Nodes: Ultra nodes having energy greater than all the other nodes. In RFLSEP, 0.2% of total no. of nodes with additional energy level 4. Super Nodes: Super nodes having energy less then ultra-nodes but greater than all the other nodes. In RFLSEP, 0.2% of total no. of nodes with additional energy level 3. Advance Nodes: Advance nodes having energy less thanultra-nodes and super nodes but greater then rest of the other nodes. In RFLSEP, 0.2% of total no. of nodes with additional energy level 2. Intermediate Nodes: Nodes having energy greater than normal nodes but less then rest of the nodes. In RFLSEP, 0.2% of total nodes with additional energy level 1. Normal Nodes: Nodes having energy less than all other nodes are considered as normal nodes. Rest of nodes are normal nodes with energy level 0.5. Variable a, b, c, d represents the energy level and m, x, y, z represents the fraction with respect to total number of nodes for ultra, super, advance, intermediate respectively. On the basis of energy level probability of nodes to become cluster head is calculated by using following formulas: generate random number between 0 and 1. The generated random number is compared with calculated threshold. If the generate d random is number is less than the calculated threshold then the node will become cluster head for that particular round. Step 4: Confidence Value (56 V) on that first broadcasting happens, is stored in an interior variable in the sensor node called Sensed Value (5F5I). It decreases the amount of broadcasts. Now the sensor nodes will again communicate the packets in identical cluster time when the difference of the 565Iand 5F5I is more than the 5F5G, i.e,. if the 565I varies from 5F5I by a quantity equivalent to or more than 5F5G, then it supplementary decrease the number of communications. Evaluate energy dissipated using following predefined equations. d = M 2 π k, d = 0.765M2...(6) to CH to BS E d = E + l fs d < d...(7) d 2 Tx1, 1 elec ε,...(8) Step 5: Update remaining energy of each node (i) and move to step 2 again. Figure 5: Flow Diagram of Simulation Process 0 Pnrm=p/1+a*m+b*x+c*y+d*z...(1) Pint=p*(1+b)/1+a*m+b*x+c*y+d*z...(2) Padv=p*(1+a)/1+a*m+b*x+c*y+d*z...(3) Psup= p*(1+c)/1+a*m+b*x+c*y+d*z....(4) Pult=p*(1+d)/1+a*m+b*x+c*y+d*z...(5) Step 2: For each and every node following steps are repeated until all the nodes become dead. Step 3: For cluster head selection each node 59

RESULTS The simulation is done in MATLAB. Let us undertake the heterogeneous sensor network with 100 sensor nodes are randomly distributed in the 100 m * 100 m zone. The base station is situated at the center (50, 50). We have set the minimum probability for becoming a cluster head (pmin) to 0.0005 and primarily the cluster head probability for all the nodes is 0.05. The parameters used in our simulation are listed in the Table 1. Table 1: Simulation Parameters Description Parameter Values Simulation Round 100 Sink Location 0.000005 Network Size 100*100 Initial Energy Eo (0.5) Initial energy of advance nodes 3 j Distance threshold 2 mm of rounds. It is obvious that the rounds of the energy decrease 0.6 to 0.567. Figure 9 shows the results for the cases Average energy of each node with 50 numbers of rounds. It is obvious that the rounds of the energy decrease 0.6 to 0.531. Figure 10 shows the results for the cases Average energy of each node with 80 numbers of rounds. It is obvious that the rounds of the energy decrease 0.6 to 0.0.52. Figure 11 shows the results for the cases Average energy of each node with 100 numbers of rounds. It is obvious that the rounds of the energy decrease 0.6 to 0.456. Figure 12 shows the results for the cases dead nodes with 25 numbers of rounds. It is obvious that the rounds of the dead node 0. Figure 13 shows the results for the cases dead nodes with 50 numbers of rounds. It is obvious that the rounds of the dead node 0. Multi root dist from higher e.ad Energy for data aggregation EDA Transmitting and receiving energy Eelec Amplification energy for short distance Efs Amplification energy for long distance Eamp 10 mm 5 nj/bit/signal 5 nj/bit 111 Pj/bit/m2 0.014pJ/bit/m4 Figure 14 shows the results for the cases dead nodes with 80 numbers of rounds. It is obvious that the rounds of the dead node 4. Figure 6: Heterogeneous Network in Running Form of Node Probability Popt 0.3 Figure 6 shows the whole heterogeneous network in running formof network size 100 and round no. 100. Figure 7 shows the no. of dead nodes after completion the 100 round heterogeneous network. Figure 8 shows the results for the cases Average energy of each node with 25 numbers 60

Figure 7: After Completion the 100 Round Heterogeneous Network Figure 10: Average Energy of Each Node with 80 Numbers Of Rounds Figure 8: Average Energy of Each Node with 25 Numbers of Rounds Figure 11: Average Energy of Each Node with 100 Numbers of Rounds Figure 9: Average Energy of Each Node with 50 Numbers of Rounds Figure 12: Number of Dead Nodes of Initial 25 Rounds 61

Figure 13: Number of Dead Nodes of Initial 50 Rounds Finally, we observe that the network lifetime increase with our result analysis. CONCLUSION Figure 14: Number of Dead Nodes of Initial 80 Rounds Figure 15 shows the results for the cases dead nodes with 100 numbers of rounds. It is obvious that the rounds of the dead node 10.5. Figure 15: Number of Dead Nodes of Initial 100 Rounds The SEP protocol for the heterogeneous wireless sensor network, discussed the two types of sensor nodes (normal and advanced) possible for the wireless sensor networks. It evaluates the performance of SEP protocol under these energy models using MATLAB. Due to the concept of energy level based cluster head selection, hard and soft threshold value, three levels of node heterogeneity and being reactive routing network protocol SEP produces increase in energy efficiency, enhanced lifetime of network and maximum throughput as shown in the simulation result. It is observed that there is minimizing level of energy consumption, energy efficient, more stability, and network life time, only required in case of SEP protocol in comparison with other protocol. In the future, the link heterogeneity of networks will be considered. Also the impact of location and size of the cluster to cluster heads election algorithm will be our further research and also includes introducing some level of mobility in the network. REFERENCES 1. Ahlawat A and Malik V (2013), An Extended Vice-Cluster Selection Approach to Improve V-LEACH Protocol in WSN, IEEE 3 rd conference on Advance Computing and Communication Technology, April, pp. 236-240. 2. Babaie S, Agaalizadeh S and Golsorkhtabar M (2010), The Novel Threshold Based Hierarchical Clustering Method for Wireless Sensor Network, IEEE International 62

Conference on Electronics and Information Engineering (ICEIE), August, pp. 191-195. 3. Bakr B A and Leszek L (2011), Extending Wireless Sensor Network Lifetime in the LEACH-SM Protocol by Spare Selection, IEEE 5 th Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, July, pp. 277-282. 4. Beiranvand Z, Patooghy A and Fazeli M (2013), I-LEACH: An Efficient Routing Algorithm to Improve Performance and to Reduce Energy Consumption in Wireless Sensor Networks, IEEE 5 th International Conference on Information and Knowledge Technology, May, pp. 13-18. 5. Li W and Cassandras C G (2005), Sensor Networks and Cooperative Control, European Journal of Control, Vol. 11, Nos. 4-5, pp. 436-463. 6. Smaragdakis G, Matta I and Bestavros B (2004), SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks, Second International Workshop on Sensor and Actor Network Protocols and Applications (SANPA 2004). 63