Impact of Divided Static Random Access Memory Considering Data Aggregation for Wireless Sensor Networks

Similar documents
Hop Count Aware Broadcast Algorithm with Random Assessment Delay Extension for Wireless Sensor Networks

PAPER Divided Static Random Access Memory for Data Aggregation in Wireless Sensor Nodes

Impact of Aggregation Efficiency on GIT Routing for Wireless Sensor Networks

Data Transmission Scheduling Based on RTS/CTS Exchange for Periodic Data Gathering Sensor Networks

A 58-µW Single-Chip Sensor Node Processor with Communication Centric Design

Research Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless Sensor Networks

Implementation of an Adaptive MAC Protocol in WSN using Network Simulator-2

FTA-MAC: Fast Traffic Adaptive energy efficient MAC protocol for Wireless Sensor Networks

Low Power and Low Latency MAC Protocol: Dynamic Control of Radio Duty Cycle

An Energy-Efficient MAC using Dynamic Phase Shift for Wireless Sensor Networks

An Energy Consumption Analytic Model for A Wireless Sensor MAC Protocol

AN EFFICIENT MAC PROTOCOL FOR SUPPORTING QOS IN WIRELESS SENSOR NETWORKS

ViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing

Reservation Packet Medium Access Control for Wireless Sensor Networks

Impact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks

Keywords T MAC protocol, reduction function, wsn, contention based mac protocols, energy efficiency; Fig 1. Listen and sleep cycle in S MAC protocol

Maximizing the Lifetime of Clustered Wireless Sensor Network VIA Cooperative Communication

Performance and Comparison of Energy Efficient MAC Protocol in Wireless Sensor Network

Energy-Efficient Routing Protocol in Event-Driven Wireless Sensor Networks

Reducing Inter-cluster TDMA Interference by Adaptive MAC Allocation in Sensor Networks

Investigating MAC-layer Schemes to Promote Doze Mode in based WLANs

IRI-MAC: An Improved Receiver Initiated MAC Protocol for Wireless Sensor Network

COMPARISON OF TIME-BASED AND SMAC PROTOCOLS IN FLAT GRID WIRELESS SENSOR NETWORKS VER VARYING TRAFFIC DENSITY Jobin Varghese 1 and K.

An Adaptive MAC Protocol for Efficient Group Communications in Sensor Networks

Optimization of Energy Consumption in Wireless Sensor Networks using Particle Swarm Optimization

Performance Evaluation of Intermittent Receiver-driven Data Transmission on Wireless Sensor Networks

VisualNet: General Purpose Visualization Tool for Wireless Sensor Networks

Delay Analysis of ML-MAC Algorithm For Wireless Sensor Networks

The Effect of Physical Topology on Wireless Sensor Network Lifetime

A Framework to Minimize Energy Consumption for Wireless Sensor Networks

Low-Energy-Consumption Ad Hoc Mesh Network Based on Intermittent Receiver-driven Transmission

An Enhanced Cross-Layer Protocol for Energy Efficiency in Wireless Sensor Networks

AN EFFICIENT MAC PROTOCOL BASED ON HYBRID SUPERFRAME FOR WIRELESS SENSOR NETWORKS

A PERFORMANCE EVALUATION OF YMAC A MEDIUM ACCESS PROTOCOL FOR WSN

Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks

An Adaptive Data Aggregation Algorithm in Wireless Sensor Network with Bursty Source

End-To-End Delay Optimization in Wireless Sensor Network (WSN)

Implementation and Performance Evaluation of nanomac: A Low-Power MAC Solution for High Density Wireless Sensor Networks

Energy-efficient routing algorithms for Wireless Sensor Networks

Improving IEEE Power Saving Mechanism

Aggregation Tree Construction in Sensor Networks

Application Aware Data Aggregation in Wireless Sensor Networks

Lecture 8 Wireless Sensor Networks: Overview

Energy Efficiency Maximization for Wireless Sensor Networks

Survey of Asynchronous Medium Access Protocols for Wireless Sensor Networks

Monetary Cost and Energy Use Optimization in Divisible Load Processing

Exploiting Routing Redundancy using MAC layer Anycast to Improve Delay in WSN

AN ADAPTIVE ENERGY EFFICIENT MAC PROTOCOL FOR WIRELESS SENSOR NETWORKS

Energy Efficient Routing Using Sleep Scheduling and Clustering Approach for Wireless Sensor Network

AMAC: Traffic-Adaptive Sensor Network MAC Protocol through Variable Duty-Cycle Operations

A Route Selection Scheme for Multi-Route Coding in Multihop Cellular Networks

Mobile Sink to Track Multiple Targets in Wireless Visual Sensor Networks

Random Asynchronous Wakeup Protocol for Sensor Networks

Geographical Routing Algorithms In Asynchronous Wireless Sensor Network

Optimal Beacon Interval for TDMA-based MAC in Wireless Sensor Networks

Developing Energy-Efficient Topologies and Routing for Wireless Sensor Networks

EX-SMAC: An Adaptive Low Latency Energy Efficient MAC Protocol

A Survey on Medium Access Control Protocols based on Synchronous Duty Cycle Approach in Wireless Sensor Networks

Zonal Rumor Routing for. Wireless Sensor Networks

Enhanced Power Saving Scheme for IEEE DCF Based Wireless Networks

Novel Cluster Based Routing Protocol in Wireless Sensor Networks

ROUTING ALGORITHMS Part 2: Data centric and hierarchical protocols

A MAC Protocol with Little Idle Listening for Wireless Sensor Networks

Abstract. 1. Introduction. 2. Theory DOSA Motivation and Overview

Energy-Efficient and Delay-Aware MAC Protocol in Wireless Sensor Networks for Oil and Gas Pipeline Monitoring Huaping Yu, Mei Guo

An Energy-Efficient MAC Protocol for Delay-Sensitive Wireless Sensor Networks

A REVIEW ON MAC PROTOCOLS IN WIRELESS BODY AREA NETWORKS

RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks

AN ENERGY EFFICIENT AND RELIABLE TWO TIER ROUTING PROTOCOL FOR TOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS

FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions

ADB: An Efficient Multihop Broadcast Protocol Based on Asynchronous Duty-Cycling in Wireless Sensor Networks

Impact of Black Hole and Sink Hole Attacks on Routing Protocols for WSN

A Simple Sink Mobility Support Algorithm for Routing Protocols in Wireless Sensor Networks

Proposal of interference reduction routing for ad-hoc networks

Power Aware Chain Routing Protocol for Data Gathering in Sensor Networks

ANewRoutingProtocolinAdHocNetworks with Unidirectional Links

Etiquette protocol for Ultra Low Power Operation in Sensor Networks

The Impact of Clustering on the Average Path Length in Wireless Sensor Networks

Comparison of TDMA based Routing Protocols for Wireless Sensor Networks-A Survey

A Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for Mitigating the Directional Hidden Node Problem

Fig. 2: Architecture of sensor node

IPv6 Stack. 6LoWPAN makes this possible. IPv6 over Low-Power wireless Area Networks (IEEE )

CSMA based Medium Access Control for Wireless Sensor Network

Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks

Evaluation of Cartesian-based Routing Metrics for Wireless Sensor Networks

Analysis of S-MAC/T-MAC Protocols for Wireless Sensor Networks

Asynchronous Data Aggregation for Real-time Monitoring in Sensor Networks

Homogeneous vs Heterogeneous Clustered Sensor Networks: A Comparative Study

Cross-Layer Interference Avoidance MAC Protocol for Dense Wireless Sensor Networks

An Energy-Efficient MAC Design for IEEE Based Wireless Sensor Networks

MC-LMAC: A Multi-Channel MAC Protocol for Wireless Sensor Networks

Abstract. Figure 1. Typical Mobile Sensor Node IJERTV2IS70270

Intra and Inter Cluster Synchronization Scheme for Cluster Based Sensor Network

An adaptive energy-efficient and low-latency MAC for tree-based data gathering in sensor networks

Dynamic Minimal Spanning Tree Routing Protocol for Large Wireless Sensor Networks

Enhancing the Life Time of Wireless Sensor Network by Using the Minimum Energy Scheduling Algorithms

Doing Nothing Well * Aka: Wake-up Receivers to the Rescue. Jan M. Rabaey, University of California at Berkeley VLSI Symposium June 17, 2009

A Color-theory-based Energy Efficient Routing Algorithm for Wireless Sensor Networks

The Case for a Flexible-Header Protocol in Power Constrained Networks

Energy Efficient Routing for Wireless Sensor Networks with Grid Topology

Transcription:

APSITT8/Copyright 8 IEICE 7SB8 Impact of Divided Static Random Access Considering Aggregation for Wireless Sensor Networks Takashi Matsuda, Shintaro Izumi, Takashi Takeuchi, Hidehiro Fujiwara Hiroshi Kawaguchi, Chikara Ohta, and Masahiko Yoshimoto Graduate School of Engineering Kobe University - Rokkodai-cho, Nada-ku, Kobe, Japan Email: matsuda@cs8.cs.kobe-u.ac.jp Abstract The most challenging issue of sensor networks is extension of overall network system lifetimes. It is important for the extension of system lifetime to determine the routing considering data aggregation. aggregation can reduce network traffic by the elimination of the redundant data. Though data aggregation is effective, sensor node needs a certain amount of RAM to aggregate data. RAM has standby energy, and its power consumption is one of the major factors in sensor node. In this work, we investigate the relationship among RAM capacity, data aggregation and power consumption. Then, we propose to use divided operating SRAM. Proposal method can reduce energy of sensor node even if RAM capacity is large. I. INTRODUCTION Recent advancement in wireless communication technology and electronics has enabled the development of low power sensor network. In achieving wireless sensor networks, the most important issue is extension of the system lifetime. In general, the sensor node works with a battery. Numerous nodes are deployed in a sensing area, frequent battery exchange will be unacceptable burden. In order to reduce the battery exchange frequency, extension of the system lifetime is the hurdle to achieve wireless sensor networks. aggregation is used as one solution of extension of the system lifetime[]. aggregation can effectively reduce network traffic by the elimination of the redundant data. Many approaches are proposed by researchers. aggregation can be categorized into two classes: lossy and lossless[]. Perfect aggregation and beam-forming are lossy aggregations[3], [4]. With perfect aggregation, a sensor node aggregates received data into one unit of data and then sends it to the next hop, where average, maximum, and count operations are examples of perfect aggregation functions[5]. Such an operation can remarkably reduce the amount of transmitted data. Perfect aggregation is quite efficient in this sense, whereas available applications are limited. Examples of lossless aggregations are linear aggregation and data funneling[6], [7]. Linear aggregation performs a simple operation: header aggregation. A sensor node concatenates the payloads of buffered packets whose next-hops are equal and then puts it into one packet. The efficiency of the header aggregation is lower than that of perfect aggregation, whereas lossless aggregation is versatile for all applications. RTC Sensor Fig.. wake up signal CLK Node chip RF Functional block diagram of typical sensor node To aggregate data packet, each sensor node holds relay data temporarily and sends it at once. So, sensor node needs a certain amount of Random Access (RAM) to aggregate data. RAM has standby energy which increases in proportion to memory capacity to hold data. RAM capacity is one of the major factors in low power sensor node. Therefore, there is tradeoff between RAM and data aggregation. In this work, we investigate the relationship among RAM capacity, data aggregation, power consumption. In general, sensed data size strongly depends on a kind of applications. Thus it is difficult to prepare the optimum size of RAM in advance. In this paper, in order to increase flexibility toward various applications, we propose the usage of a divided SRAM (Static Random Access ) which operates partially on demand. Our simulation results shows the proposal approach achieves enough effect on power reduction compared with the usage of conventional SRAM. The rest of the paper is organized as follows: Section II analyzes the energy consumption of typical sensor node. In Section III investigates a relationship between data aggregation and RAM from viewpoints of power consumption. In Section IV proposes the usage of divided SRAM which operates only the minimum part enough to record data packets. Proposal approach will be evaluated against conventional scheme in Section V. Finally, we summarize this paper in Section VI. II. ANALYSIS OF THE MODULE OF SENSOR NODE In this section, we explain about each module of a sensor node, and its power consumption. Figure shows a typical sensor node consists of five types of modules: Radio Frequency (RF), Random Access 3

APSITT8/Copyright 8 IEICE 7SB8 Receiver Receive ACK Sleep Wake packet A Header packet B Header Wake Preamble aggregate Sender Sleep T t Header ' (a) Perfect Aggregation Fig.. Timing chart of I-MAC. packet A packet B Header Header (RAM), Micro Controller Unit (), Real Time (RTC), and Sensors. First, we explain about RF module. RF is an important module to communicate via wireless. In wireless sensor networks, RF has short range and low bit rate communication for energy saving. This means that the transmission power can be reduced while the reception power can not be relatively negligible. RF consumes as much power when the sensor node does not receive any data as when it does. RF possibly operates even if the sensor node is not communicating. Such the state is called idle listening, and the power consumption of idle listening can be dominant factor in a sensor node. In order to reduce such power consumption, some types of cycled receiver MACs (Media Access Control) have been proposed, e.g., S-MAC, T- MAC, D-MAC, X-MAC, I-MAC[8], [9], [], [], []. Cycled receiver MAC can reduce power consumption of idle listening by long wakeup period. Figure shows the timing chart of I-MAC, which is a kind of cycled receiver MACs. With these cycled receiver MACs, each sensor node senses carrier periodically. However, the delay increases as wake up period becomes longer. Moreover, even if duty cycle of RF is small, the power consumption will occupy most of the power consumption in sensor node with less communication frequency. Secondly, we explain about RAM. RAM is an indispensable module to hold sensing data, received packets, and route information. In general, Static Random Access (SRAM) and flash Read Only (flash ROM) is used for the data logger. On the wireless sensor network where the reading and writing frequency of memory is low, the standby power of SRAM is dominant. SRAM standby power increases in proportion to memory capacity. Therefore, large capacity SRAM increases wasteful power consumption. On the other hand, flash ROM has no standby power even if it holds data. However, if flash ROM is used, it is difficult to make the sensor node a single-chip. Thirdly, we explain about. has the role of the instruction of memory reading and writing, analysis and compression of received data, decision of following destination, and so on. Low power is more necessary than high-performance in wireless sensor networks. operates at the same time when RF and the sensors operate. If operates whenever RF operates, it requires a measurable amount of power. Then, the MAC controller which separate from is used. In this scheme, only the MAC controller can process at preamble sampling of cycled MAC and handling the packet which is not sent for me. Moreover, some low power for Fig. 3. Header (b) Header Aggregation aggregate Perfect aggregation and header aggregation. the sensor network is proposed. Fourthly, we explain about RTC. RTC counts real time and wakeup or sleep timer. RTC is important module to know the time of sensing and synchronized communications on RF. Unlike other modules, RTC keeps operating, for a long time until the battery is dead since sensor node had been deployed. Therefore, it is one of the big factors to increase power consumption even though power consumption of RTC is smaller than other modules. Finally, we explain sensor. Sensor is a module to acquire physical information around the sensor node. The power consumption of sensor strongly depends on the kind of sensor. Moreover, the kind of sensor is different according to the kind of application. Therefore, sensor is not considered in this paper. III. RELATIONSHIP BETWEEN DATA AGGREGATION AND RANDOM ACCESS MEMORY The data aggregation is an effective method that the communication traffic can be reduced in wireless sensor networks. To aggregate data, it is necessary to hold some data at each sensor node. Therefore, the memory for the data storage is needed. However, as described in the preceding section, SRAM has standby power to hold data. Therefore, the trade-off exists in the capacity of memory and data aggregation. Some methods are proposed to the data aggregation. There are two classes of data aggregation: lossy and lossless. The typical method of lossy aggregation is perfect aggregation. For applications that require such as maximum, minimum, and mean of sensor measurements over all the sensor nodes, sensor nodes receive all packets, operate, and forward one packet. Although this method is used by many proposed protocols, it is not practicable because applications are limited (Fig. 3(a)). The typical method of lossless aggregation is header aggregation. Header aggregation that is one of the linear aggregations can reduce power consumption as the maximum number of aggregation packets increases. However, if a certain number of packets is exceeded, the effect becomes small. Figure 4 shows the maximum number of aggregation packets and the sending and receiving energy. packet 3

Energy (mj) APSITT8/Copyright 8 IEICE 7SB8 3....5 3 4 5 6 7 8 9 Number of aggregation packets Controller 8kbit SRAM On On On Off Fig. 4. Energy consumption which include, RF ( and ), clock, and memory when the maximum number of aggregation packets is changed (RAM capacity = 86 bit). Fig. 6. Off Off Off Off Divided SRAM by same partition size 8kbit SRAM Energy (mj) 3....5 leak 64 8 56 5 4 48 496 89 6384 3768 RAM capacity (bit) Fig. 5. Energy consumption which include, RF ( and ), clock, and memory when RAM capacity is changed (maximum number of aggregation packets = 5). Controller Fig. 7. Off On Off Off Off On Divided SRAM by multiplicative partition size size is 6 bytes and header size is 4 bytes. A detailed parameter is described in Section V. and energy is reduced due to reduction of traffic for data aggregation. In addition, energy of memory is reduced too. As you see, the effect become small around in exceeded five data packet. If the ratio of header and data changes, the effect of data aggregation changes. The larger the header is, the more effective header aggregation method is. However, the error happens easily to the communication with a long aggregation packet. Figure 5 shows the energy consumption of sensor node when the capacity of SRAM is changed. When the capacity of RAM becomes large, the energy consumption of sensor node becomes larger by the RAM standby power. Though the energy of RF is reduced for data aggregation, The energy of memory is larger than it. Therefore, the best capacity of SRAM to aggregate data exists. IV. DIVIDED SRAM ARCHITECTURE As described in the preceding section, suitable SRAM capacity for the data aggregation exists. However, it is difficult to prepare the best SRAM capacity. Then, we propose to use divided SRAM. The proposal scheme divides SRAM into some partitions, and leaves only the necessary part on. Figure 6 is an image of the proposal SRAM. If the received data exceeds the one partition size, memory controller turns on the next partition. Reversely, the partition which not needs to hold data is turned off. controller operates only when memory is reading or writing. So, power overhead of memory controller is quite small. Thus, power consumption can be reduced by turning on only the partition which hold data. Proposal method can also reduce power consumption by high-compression data aggregation like perfect aggregation. Because, the partition which has no data increases due to high-compression data aggregation. A lot of partition is turned off and power consumption of most blank memory is reduced. On the other hand, power overhead of memory controller increases. Moreover, circuit design of memory controller becomes increasingly more complex. To combat this, we propose a variouslysize partition RAM (Fig. 7). If we divide s bit RAM to n multiplicative size partitions, memory controller can s control partitions by bit. In this paper, we did n not evaluate variously-size partition RAM but same-size partition only. V. PERFORMANCE EVALUATION We used QualNet simulator to evaluate our proposal scheme[5]. 3

APSITT8/Copyright 8 IEICE 7SB8 Base station Energy (mj) 3....5 Fig. 8. Sensor node path Sensor network tree for data gathering application. 64 8 56 5 4 48 496 89 6384 3768 RAM capacity (bit) Fig. 9. Energy consumption which include, RF ( and ), clock, and memory using proposal method (number of partition = 8, maximum number of aggregation packets = 5). A. Simulation Condition Sensor nodes were deployed in a sensing area uniformly. Proposal method is adaptable to any type of application, routing, MAC, and aggregation method. In this simulation, we assume following parameters. Sensor nodes collect data to the base station in accordance with Tiny Diffusion, which is a simplified Directed Diffusion method (Fig. 8)[3][4]. In Tiny Diffusion the base station broadcasts an interest packet to the entire network. Each sensor node that is targeted for the interest packet sends sensed data to the base station. For each parameter setting, 3 trials with different random seeds were executed and the average value of them are plotted in the following graphs. We use I-MAC for MAC protocol. The transmission range is assumed to be circular with a m radius. The RF parameter is refered to[6]. We assume that the transmission power is.9 mw and the reception power is 3.7 mw. The clock power is.5 µw[7]. The parameters are decided by circuit simulation. The memory write power is standby power is nw/bit. The partition control overhead is µw/bit and partition switching time is ns. The power is.5 mw, it is refered by 85 processor[8]. We assume that the header of each packet is 3 bit. The default packet payload is 48 bit. The control packet size is 3 bit. The ACK packet size is 3 bit. The bit rate is kbps. The sample period of the I-MAC is 5 ms. The data gathering period is 6 s. We assume that header aggregation eliminates headers of two or more packets for the same destination. Signal to noise ratio (SNR) threshold is db. If SNR threshold exceeds db, it is considered that the channel interference occurred. In this case, a sender node cannot receive ACK packet from a receiver node and sender node retransmits data. B. Simulation result Figure 9 shows energy consumption which include, RF ( and ), clock, and memory using proposal method when RAM capacity is changed. The number of partition is eight and maximum number of aggregation packets is five. Using proposal method, best RAM capacity is 5 bit from the viewpoint of energy. However, proposal method reduce the overhead which sensor node has the large capacity compared with normal RAM (Fig. 5). For example, energy consumption of proposal scheme collection time [sec] 5 5 5 RAM capacity [bit] Fig.. The data collection time using proposal method (number of partition = 8, maximum number of aggregation packets = 5). is % lower than that of conventional scheme on the condition that sensor node has 89 bit RAM. Figure shows the data collection time when RAM capacity is changed. The larger RAM capacity is, the shorter data collection time is. Proposal scheme can use large capacity of RAM with low power and low delay. Figure shows total energy consumption of sensor node when the number of partition is changed. The number of partitions exceeds eight, the effect of proposal scheme is saturated. Though it is effective to increase number of partition, the hardware design is difficult. Moreover, the overhead of the memory control increases. Figure shows the energy consumption of sensor node when maximum number of aggregation packets is changed. The effect of data aggregation using proposal scheme is saturated from five data aggregation as same as conventional scheme. The efficient of data aggregation changes depending on the ratio of header size and payload size. In this paper, we use header aggregation only. If we use high-compression data aggregation, proposal method is more effective. Figure 3 shows energy consumption when payload size is changed. Eight partition RAM of Proposal scheme is effective with any size of the payload. VI. CONCLUSION In wireless sensor network, memory standby energy is dominant parameter on sensor node. Considering data aggregation, sensor node needs large capacity of memory. 33

APSITT8/Copyright 8 IEICE 7SB8 3 3.5 RAM capacity = 3768 bit RAM capacity = 6384 bit RAM capacity = 89 bit Number of partitions.5 payload size = 5 bit payload size = 56 bit payload size = 8 bit payload size = 64 bit Number of partition Fig.. Total energy consumption of sensor node when the number of partition is changed (maximum number of aggregation packets = 5). RAM capacity = 3768 bit.5 RAM capacity = 6384 bit RAM capacity = 89 bit RAM capacity = 496 bit 4 6 8 Number of aggregation packet Fig.. Total energy consumption of sensor node when the maximum number of aggregation packets is changed (number of partition = 8) In this paper, we propose to use divided operating SRAM for data aggregation. The necessary part of memory keeps power on and the unused part of memory cut off. Proposal scheme can reduce energy consumption even if sensor node has large capacity of RAM. However, if RAM is partitioned with same capacity, the overhead of RAM standby power becomes prominent by large capacity RAM. Therefore, our future work is that we devise means of dividing the memory. ACKNOWLEDGMENT This research work was partially supported by Strategic Information and Communications R&D Promotion Programme (SCOPE), Ministry of Internal Affairs and Communications, Japan. REFERENCES [] B. Krishnamachari, D. Estrinf, and S. Wicker, Modelling - Centric Routing in Wireless Sensor Networks, In Proc. IEEE INFOCOM, June. [] T. F. Abdelzaher, T. He, and J. A. Stankovic, Feedback Control of Aggregation in Sensor Networks, In Proc. IEEE Conference on Decision and Control, Dec. 4. [3] C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, Impact of Density on Aggregation in Wireless Sensor Networks, In Proc. the nd International Conference on Distributed Computing Systems, Nov.. [4] A. Wang, W. B. Heinzelman, A. Sinha, and A. P. Chandrakasan, Energy-Scalable for Battery-Operated MicroSensor Networks, Kluwer Journal of VLSI Signal Processing, vol.9, pp.3.37, Nov.. Fig. 3. [5] J. Zhao, R. Govindan, and D. Estrin, Computing Aggregates for Monitoring Wireless Sensor Networks, In Proc. IEEE International Workshop on Sensor Network Protocols and Applications, May 3 [6] C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann, Impact of Network Density on Aggregation in Wireless Sensor Networks, In Proc. the nd International Conference on Distributed Computing Systems, pp.457 458, Nov.. [7] D. Petrovic, C. Shah, K. Ramchandran, and J. Rabaey, Funneling: Routing with Aggregation and Compression for Wireless Sensor Networks, In Proc. IEEE Sensor Network Protocols Applications, Anchorage, May 3. [8] W. Ye, J. Heidemann, and D. Estrin, An Energy-Efficient MAC Protocol for Wireless Sensor Networks, In Proc. IEEE Infocom, pp.567 576, Jun.. [9] T. V. Dam, K. Langendoen, An Adaptive Energy-efficient MAC Protocol for Wireless Sensor Networks, In Proc. the st International Conference on Embedded Networked Sensor Systems (SenSys), pp.7 8, Nov. 3. [] G. Lu, B. Krishnamachari, and C. Raghavendra, An Adaptive Energy-efficient and Low-latency MAC for Aathering in Sensor Networks, In Proc. Int. Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), pp.4 36, April 4. [] M. Buettner, G. V. Yee, E. Anderson, and R. Han, X-MAC: A Short Preamble MAC Protocol for Duty-cycled Wireless Sensor Networks, In Proc. the 4th international conference on Embedded networked sensor systems, pp.37 3, Oct. 6. [] M. Ichien, T. Takeuchi, S. Mikami, H. Kawaguchi, C. Ohta, and M. Yoshimoto, Isochronous MAC using Long-Wave Standard Time Code for Wireless Sensor Networks, In Proc. International Conference on Communications and Electronics (ICCE), pp. 7 77, Oct. 6. [3] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, Directed Diffusion for Wireless Sensor Networking, In Proc. IEEE/ACM Transaction on Networking, vol., pp. 6, Feb. 3. [4] J. Heidemann, F. Silva, and D. Estrin, Matching Dissemination Algorithms to Application Requirements, In Proc. the ACM SenSys Conference, pp.8 9, Nov. 3. [5] QualNet simulator, http://www.scalable-networks.com [6] B. P. Otis, Y. H. Chee, R. Lu, N. M. Pletcher, J. M. Rabaey, An Ultra-Low Power MEMS-Based Two-Channel Transceiver for Wireless Sensor Networks, In Proc. Symposium on VLSI Circuits, pp. 3, Jun. 4 [7] Real Time IC, http://www.oki.com/en/press/7/z73e. html [8] M. Sheets, F. Burghardt, T. Karalar, J. Ammer, Y. Chee, and J. Rabaey, A Power-Managed Protocol Processor for Wireless Sensor Networks, In Proc. Symposium on VLSI Circuits, pp. 3, Sep. 6 34