A SIMULATION MODEL FOR THE LIFE- TIME OF WIRELESS SENSOR NETWORKS



Similar documents
On the Lifetime of Wireless Sensor Networks

Hybrid Energy Efficient Distributed Protocol for Heterogeneous Wireless Sensor Network

Distributed Coordinate-free Hole Recovery

MAP : A Balanced Energy Consumption Routing Protocol for Wireless Sensor Networks

An Efficient Energy-Aware Coverage- Preserving Hierarchical Routing Protocol for WSN

A Survey on Rendezvous Data Collection in Wireless Sensor Networks. Presented by Longfei Shangguan Supervisor:Dr.Yunhao Liu

A Survey on Lifetime Maximization of Wireless Sensor Network using Load Balancing

An Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks

Coverage Related Issues in Networks

Minimum-Hop Load-Balancing Graph Routing Algorithm for Wireless HART

A New MAC Protocol for Moving Target in Distributed Wireless Sensor Networks

Partial Coverage in Homological Sensor Networks

Connectivity-based Distributed Coverage Hole Detection in Wireless Sensor Networks

A Routing Algorithm Designed for Wireless Sensor Networks: Balanced Load-Latency Convergecast Tree with Dynamic Modification

Mobile Network Analysis - Hole Healing

Dynamic and Adaptive Organization of Data-Collection Infrastructures in Sustainable Wireless Sensor Networks

Recent advances in microelectromechanical

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS

Energy Efficient Coverage for Mobile Sensor Network

OPTIMIZED SENSOR NODES BY FAULT NODE RECOVERY ALGORITHM

Energy Consumption analysis under Random Mobility Model

Int. J. Sensor Networks, Vol. 5, No. 3,

Load Balanced Data Transmission within the Probabilistic Wireless Sensor Network

QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES

How To Balance Network Load In A Wireless Sensor Network

A RFID Data-Cleaning Algorithm Based on Communication Information among RFID Readers

Energy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network

A Novel Distributed Algorithm for Complete Targets Coverage in Energy Harvesting Wireless Sensor Networks

International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS)

An Empirical Approach - Distributed Mobility Management for Target Tracking in MANETs

DAG based In-Network Aggregation for Sensor Network Monitoring

Securing wireless sensor networks

Enhanced Dual Level Fuzzy based Cluster Head Selection for Energy Efficient Wireless Sensor Networks

Evaluation of Unlimited Storage: Towards Better Data Access Model for Sensor Network

ENHANCED GREEN FIREWALL FOR EFFICIENT DETECTION AND PREVENTION OF MOBILE INTRUDER USING GREYLISTING METHOD

A Graph-Center-Based Scheme for Energy-Efficient Data Collection in Wireless Sensor Networks

Power Efficiency Metrics for Geographical Routing In Multihop Wireless Networks

Load-Balancing Enhancement by a Mobile Data Collector in Wireless Sensor Networks

Dynamic Antenna Mode Selection for Link Maintenances in Mobile Ad Hoc Network

Survey on Network Lifetime Enhancement Method

Load Balancing Routing Algorithm among Multiple Gateways in MANET with Internet Connectivity

DATA COLLECTION SCHEME FOR WIRELESS SENSOR NETWORK WITH MOBILE COLLECTOR

How To Balance Load In Rdi With Power Conservation In A Power Efficient System

Consecutive Geographic Multicasting Protocol in Large-Scale Wireless Sensor Networks

Power Aware Routing in Ad Hoc Wireless Networks

Survey on Load balancing protocols in MANET S (mobile ad-hoc networks)

Protocol Design for Neighbor Discovery in AD-HOC Network

A Hierarchical Structure based Coverage Repair in Wireless Sensor Networks

Gossiping using the Energy Map in Wireless Sensor Networks

A Network Flow Approach in Cloud Computing

Figure 1. The Example of ZigBee AODV Algorithm

Load-balancing Approach for AOMDV in Ad-hoc Networks R. Vinod Kumar, Dr.R.S.D.Wahida Banu

Wireless Sensor Network: Improving the Network Energy Consumption

Dipak Wajgi Dept. of Computer Science and Engineering Ramdeobaba College of Engg. and Management Nagpur, India

Congestion Control in WSN using Cluster and Adaptive Load Balanced Routing Protocol

Repairing Sensor Network Using Mobile Robots

Power Consumption Analysis of Prominent Time Synchronization Protocols for Wireless Sensor Networks

Node Degree based Clustering for WSN

MCTA: Target Tracking Algorithm based on

Load Balancing Routing Algorithm for Data Gathering Sensor Network

SECURE DATA TRANSMISSION USING INDISCRIMINATE DATA PATHS FOR STAGNANT DESTINATION IN MANET

Implementation of a Lightweight Service Advertisement and Discovery Protocol for Mobile Ad hoc Networks

A Security Architecture for. Wireless Sensor Networks Environmental

Implementation of Energy Efficient Adaptive Load Balancing Algorithm by Rainbow Mechanism in Wireless Sensor Networks

LOAD BALANCING AND EFFICIENT CLUSTERING FOR IMPROVING NETWORK PERFORMANCE IN AD-HOC NETWORKS

Energy Aware Load Balancing in Secure Heterogeneous Wireless Sensor Network

Fuzzy-Based Clustering Solution for Hot Spot Problem in Wireless Sensor Networks

AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION

Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm

A Secure Data Transmission for Cluster based Wireless Sensor Network Using LEACH Protocol

SECURE AND RELIABLE DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS

Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration

EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK

ISSN: (Online) Volume 2, Issue 2, February 2014 International Journal of Advance Research in Computer Science and Management Studies

MAXIMIZING THE LIFETIME OF NETWORK SECURITY BY DSDV PROTOCOL USING GAME THEORY TECHNIQUES IN WIRELESS SENSOR NETWORK

Probabilistic Coverage in Wireless Sensor Networks

DoS Attack and Its Countermeasure in Energy-Constrained Wireless Networks

Halmstad University Post-Print

Isolines: Energy-efficient Mapping in Sensor Networks

Adaptive Medium Access Control (MAC) for Heterogeneous Mobile Wireless Sensor Networks (WSNs).

A Catechistic Method for Traffic Pattern Discovery in MANET

A SECURE DATA TRANSMISSION FOR CLUSTER- BASED WIRELESS SENSOR NETWORKS IS INTRODUCED

An Energy Efficient Location Service for Mobile Ad Hoc Networks

Investigating the Energy Sink-Hole Problem in Connected k-covered Wireless Sensor Networks

Step by Step Procedural Comparison of DSR, AODV and DSDV Routing protocol

Fault Detection and Recovery in Wireless Sensor Network Using Clustering

A Network Stability Monitoring Mechanism of Cluster-Oriented

Securing MANET Using Diffie Hellman Digital Signature Scheme

A Multi-Poller based Energy-Efficient Monitoring Scheme for Wireless Sensor Networks

Coverage-Hole Trap Model in Target Tracking using Distributed Relay-Robot Network

STUDY OF MOBILE NODE BASED COVERAGE RECOVERY PROCESS FOR WSN DEPLOYED IN LARGE FOOD GRAIN WAREHOUSE

Keywords coverage holes, energy efficient, hole detection, hole healing

A Routing Method for Top-k Query Processing in Mobile Ad Hoc Networks

CHARACTERIZING OF INFRASTRUCTURE BY KNOWLEDGE OF MOBILE HYBRID SYSTEM

Medium Access Control with Dynamic Frame Length in Wireless Sensor Networks

Service Management in Wireless Sensors Network

Routing and Transport in Wireless Sensor Networks

LBN: Load-balancing Network for Data Gathering Wireless Sensor Networks

Transcription:

A SIMULATION MODEL FOR THE LIFE- TIME OF WIRELESS SENSOR NETWORKS Abdelrahman Elleithy 1 and Gonhsin Liu 2 1 Department of Computer Science and Engineering, University of Bridgeport, Bridgeport, CT, USA aelleith@bridgeport.edu 2 Department of Computer Science and Engineering, University of Bridgeport, Bridgeport, CT, USA gonhsin@bridgeport.edu ABSTRACT In this paper we present a model for the lifetime of wireless sensor networks. The model takes into consideration several parameters such as the total number of sensors, network size, percentage of sink nodes, location of sensors, the mobility of sensors, and power consumption. A definition of the life time of the network based on three different criteria is introduced; percentage of available power to total power, percentage of alive sensors to total sensors, and percentage of alive sink sensors to total sink sensors. A Matlab based simulator is developed for the introduced model. A number of wireless sensor networks scenarios are presented and discussed. KEYWORDS Wireless Sensor Network, Network Lifetime, Models, Simulation 1. A MODEL FOR LIFETIME OF WIRELESS SENSORS NETWORK Wireless sensors have received increased attention in the past years due to their popularity and cost effectiveness when they are used in harsh environments. They have been used in many applications including military applications, environmental applications, health applications, and home applications. Although they are very cost effective and easily deployed in harsh environments, they are limited by the power available through their life cycle. Sensors are usually deployed with limited power which is depleted over their lifecycle. Once their power is depleted, the sensors become dead and they are no more useful. An evaluation of the life cycle of a wireless sensor network is very essential to estimate how long a network can live and when the network and its sensors might be replaced or recharged if possible. In this section we present a model for the lifetime of Wireless sensor networks based on a paper by [1]. The model takes different parameters that used in literature. The following parameters are considered: 1. The time until the first sensor is drained of its energy [2]; 2. The time until the first cluster head is drained of its energy [3] ; DOI : 1.5121/ijasuc.211.241 1

3. The time there is at least a certain fraction β of surviving nodes in the network [4]; 4. The time until all nodes have been drained of their energy [5]; 5. K-coverage: the time the area of interest is covered by at least k nodes [6] ; 6. 1% coverage 7. α-coverage a. The time each target is covered by at least one node [7] ; b. The time the whole area is covered by at least one node [8] ; a. The accumulated time during which at least α portion of the region is covered by at least one node [9]; b. The time until the coverage drops below a predefined threshold α (until last drop below threshold) [1] ; c. The continuous operational time of the system before either the coverage or delivery ratio first drops below a predefined threshold [11]; 8. The number of successful data-gathering trips [12] ; 9. The number of total transmitted messages [13]; 1. The percentage of nodes that have a path to the base station [11]; 11. Expectation of the entire interval during which the probability of guaranteeing connectivity and k-coverage simultaneously is at least α [6]; 12. The time until connectivity or coverage are lost [14]; 13. The time until the network no longer provides an acceptable event detection ratio [5]; 14. The time period during which the network continuously satisfies the application requirement [15]; 15. min(t1, t2, t3) with t1: time for cardinality of largest connected component of communication graph to drop below c1 n(t), t2: time for n(t) to drop below c2 n, t3: time for the covered volume to drop below c3 l d [16]. 2. PARAMETERS USED IN THE MODEL In this section we address parameters that were introduced in literature that can be used in a complete model for a wireless sensors networks life time. The following parameters are introduced: 1. The total number of available sensors 2. The set of all nodes those that are alive at a certain time t 3. The set of nodes those that are active at a time t 2

4. The set of nodes those that are active at any time in the time interval [t _t, t] 5. The set of sink nodes or base stations B(t) is defined to be a subset of the existing nodes SY 6. The ability of nodes m1 and mn to communicate at a time t 7. The ability of two nodes to communicate in the time interval [t _t, t] such that the links between consecutive hops become available successively within the time interval (support for delay tolerant networking) 8. The set of target points to be sensed by the network 9. The area that is covered by all sensors of a certain type y, at a time t. 3. DEFINITION OF NETWORK LIFETIME There are two network lifetime metrics that introduced in literature based on definitions on the previous sections. Both metrics depict the network lifetime in seconds. The metrics probably become most expressive when used together. (1) The first metric gives the accumulated network lifetime Za as the sum of all times that ζ (t) is fulfilled, stopping only when the criterion is not fulfilled for longer than tsd seconds. (2) The second metric, the total network lifetime Zt, gives the first point in time when the liveliness criterion is lost for a longer period than the service disruption tolerance tsd. 4. SIMULATION OF THE LIFETIME OF WSN In this section we present the following model for simulating the life time in a WSN. Although the Matlab code is developed with the following default parameters, it can be modified for other values. Assumptions: 1. Total number of sensors: Input parameter 2. Network size: Input parameter in meters 3. Percentage of sink sensors: Input parameter (between and 1) 4. Location of sensors: Randomly generated over the network 5. Initial power per sensor: Random between and 1 units 6. Movement of sensors: a) sensors can move in the x direction for a random value between -5 and +5 b) sensors can move in the y direction for a random value between -5 and +5 c) The total value a senor moves is : 3

7. Power Consumption: a. Communications: 1 unit for regular sensor and 2 units for sink sensor b. Movement: d unit for the moving sensor as calculated in 6 8. Stopping criteria (we consider the network dead if one of the following conditions satisfied): a. Percentage of available power to total power: less than 25 % b. Percentage of alive sensors to total sensors: less than 25 % c. Percentage of alive sink sensors to total sink sensors: less than 5 % 4.1. Scenario Number 1 In this scenario the following parameters are considered: 1. Total number of sensors: 15 2. Network size: 3 m X 3 m 3. Percentage of sink sensors: 15.6 % Figure 1 shows the status of Initial and final network. Note: sink nodes are red Figure 1: Status of Initial and final network. Figures 2 to 5 show different network performance parameters over the life cycle of the network. In this scenario the network was considered dead because after 21 cycles the following status is reached: 1. Percentage of available power to total power: 181 / 7751 = 23 % 2. Percentage of alive sensors to total sensors: 78 / 15 = 52 % 3. Percentage of alive sink sensors to total sink sensors: 12 / 21 = 57 % 4

The network is considered dead because that condition number (1) is satisfied where the percentage of available power to total power is 23 % which is less than the 25 % criteria. Total power in the network Power 9 8 7 6 5 4 3 2 1 1 3 5 7 9 11 13 15 17 19 21 Figure 2: Total Power in the network over the life cycle Number of dead sensors 8 Dead sensors 6 4 2 1 3 5 7 9 11 13 15 17 19 21 Figure 3: Numbers of dead sensors over the life cycle 5

Total number of alive sensors 17 15 Alive sensors 13 11 9 7 5 1 3 5 7 9 11 13 15 17 19 21 Figure 4: Total number of alive sensors over the life cycle Dead sink nodes 1 Dead sink 8 6 4 2 1 3 5 7 9 11 13 15 17 19 21 Figure 5: Total number of dead sinks nodes over the life cycle 4.2. Scenario Number 2 In this scenario the following parameters are considered: 1. Total number of sensors: 1 2. Network size: 2 m X 2 m 3. Percentage of sink sensors: 1. % 6

Figure 6 shows the status of Initial and final network. Note: sink nodes are red. Figure 6: shows the status of Initial and final network. Figures 7 to 1 show different network performance parameters over the life cycle of the network. In this scenario the network was considered dead because after 23 cycles the following status is reached: 1. Percentage of available power to total power: 1248. / 5352 = 23 % 2. Percentage of alive sensors to total sensors: 5 / 1 = 5 % 3. Percentage of alive sink sensors to total sink sensors: 5 / 13 = 38 % The network is considered dead because that condition number (1) is satisfied where the percentage of available power to total power is 23 % which is less than the 25 % criteria. Total Power in the network Power 6 55 5 45 4 35 3 25 2 15 1 1 3 5 7 9 11 13 15 17 19 21 23 Figure 7: Total Power in the network over the life cycle 7

Number of Dead Sensors 6 5 Dead Sensors 4 3 2 1 1 3 5 7 9 11 13 15 17 19 21 23 Figure 8: Numbers of dead sensors over the life cycle Total number of alive sensors 11 1 Alive sensors 9 8 7 6 5 1 3 5 7 9 11 13 15 17 19 21 23 Figure 9: Total number of alive sensors over the life cycle 8

Dead sink nodes Dead sink 9 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 2 21 22 23 Figure 1: Total number of dead sinks nodes over the life cycle 4.3 Scenario Number 3 In this scenario the following parameters are considered: 1. Total number of sensors: 5 2. Network size: 1 m X 1 m 3. Percentage of sink sensors: 2. % Figure 11 shows the status of Initial and final network. Note: sink nodes are red. Figure 11: Status of Initial and final network. 9

Figures 12 to 15 show different network performance parameters over the life cycle of the network. In this scenario the network was considered dead because after 25 cycles the following status is reached: 1. Percentage of available power to total power: 66. / 2542 = 23 % 2. Percentage of alive sensors to total sensors: 23 / 5 = 46 % 3. Percentage of alive sink sensors to total sink sensors: 4 / 13 = 3 % The network is considered dead because that condition number (1) is satisfied where the percentage of available power to total power is 23 % which is less than the 25 % criteria. Total Power in the network 3 25 Power 2 15 1 5 1 3 5 7 9 11 13 15 17 19 21 23 25 Figure 12: Total Power in the network over the life cycle Number of Dead Sensors Dead Sensors 3 25 2 15 1 5 1 3 5 7 9 11 13 15 17 19 21 23 25 Figure 13: Numbers of dead sensors over the life cycle 1

Total number of alive sensors Alive Sensors 55 5 45 4 35 3 25 2 1 3 5 7 9 11 13 15 17 19 21 23 25 Figure 14: Total number of alive sensors over the life cycle Total number of dead sink nodes Dead Sink 1 8 6 4 2 1 3 5 7 9 11 13 15 17 19 21 23 25 Figure 15: Total number of dead sinks nodes over the life cycle 4.4 Scenario Number 4 In this scenario the following parameters are considered: 1. Total number of sensors: 5 2. Network size: 15 m X 15 m 3. Percentage of sink sensors: 2. % Figure 16 shows the status of Initial and final network. 11

Note: sink nodes are red. Figure 16: Status of Initial and final network. Figures 17 to 2 show different network performance parameters over the life cycle of the network. In this scenario the network was considered dead because after 21 cycles the following status is reached: 1. Percentage of available power to total power: 56 / 269 = 24 % 2. Percentage of alive sensors to total sensors: 2 / 5 = 4 % 3. Percentage of alive sink sensors to total sink sensors: 2 / 1 = 2 % The network is considered dead because that condition number (1) is satisfied where the percentage of available power to total power is 23 % which is less than the 25 % criteria. Total Power in the network 25 2 Power 15 1 5 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 2 21 Figure 17: Total Power in the network over the life cycle 12

Number of Dead Sensors Dead Sensors 35 3 25 2 15 1 5 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 2 21 Figure 18: Numbers of dead sensors over the life cycle Total number of alive sensors Alive Sensors 55 5 45 4 35 3 25 2 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 2 21 Figure 19: Total number of alive sensors over the life cycle Total number of dead sink nodes Dead Sink 1 8 6 4 2 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 2 21 Figure 2: Total number of dead sinks nodes over the life cycle 13

5. CONCLUSIONS Although wireless sensors networks are very popular, they are limited by the power available through their life cycle. Once their power is depleted, sensors might be replaced or recharged if possible. A model to estimate the life time of wireless sensors networks are an important tool that can help the designers of the network to design their network by adjusting important parameters such as initial power, number of sensors, number of sink sensors, etc. In this paper we present a model for the lifetime of wireless sensor networks. The model takes into consideration several parameters such as the total number of sensors, network size, percentage of sink nodes, location of sensors, the mobility of sensors, and power consumption. A number of wireless sensor networks scenarios are presented and discussed. In order to examine the validity of our simulator, we have tested it for many scenarios. In this paper we are presenting four of these scenarios. The following parameters are used: total number of sensors, network size as defined by its width and length, and the percentage of sink sensors. In each scenario, we have evaluated both the total power in the network over the life cycle, number of dead sensors over the life cycle, total number of alive sensors over the life cycle, and number of dead sinks nodes over the life cycle. The results presented in this paper show how important such a simulator from the designer perspective. The model can be used as a design tool as well as a research tool to evaluate the network performance. We would expect to extend in the future the work presented in this model to include other parameters and other models for defining the life cycle of the wireless sensor networks. REFERENCES [1] Dietrich, I. and Dressler, F. (29) On the Lifetime of Wireless Sensor Networks, ACM Transactions on Sensor Networks, vol. 5, no. 1, pp. 1-39. [2] Giridhar, A. and Kumar, P. (25) Maximizing the functional lifetime of sensor networks, Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN), pp. 13-19. [3] Soro, S. and Heinzelman, W. B. (25) Prolonging the lifetime of wireless sensor networks via unequal clustering. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS). [4] Cerpa, A. and Estrin, D. (24) ASCENT: Adaptive self-configuring sensor networks topologies IEEE Transactions on Mobile Computing, vol. 3, issue 3, pp. 272-285. [5] Tian, D. and Georganas, N. D. (22) A coverage-preserving node scheduling scheme for large wireless sensor networks. Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pp. 32-41. [6] Mo, W., Qiao, D., and Wang, Z. (25) Mostly-sleeping wireless sensor networks: connectivity, k- coverage, and alpha-lifetime, Proceedings of the 43rd Annual Allerton Conference on Communication, Control, and Computing. [7] Cardei, M., Thai, M. T., Li, Y., and Wu, W. (25) Energy-efficient target coverage in wireless sensor networks, Proceedings of the 24th IEEE Conference on Computer Communications (INFOCOM), vol. 3, pp. 1976-1984. [8] Bhardwaj, M. and Chandrakasan, A. (22) Bounding the lifetime of sensor networks via optimal role assignments, Proceedings of the 21st IEEE Conference on Computer Communications (INFOCOM), vol. 3, pp. 1587-1596. 14

[9] Zhang, H. and Hou, J. C. (25) Maintaining sensing coverage and connectivity in large sensor networks, Ad Hoc and Sensor Wireless Networks, vol. 1, pp. 89-124. [1] Wu, K., Gao, Y., Li, F., and Xiao, Y. (25) Lightweight deployment-aware scheduling for wireless sensor networks, Mobile Networks and Applications, vol. 1, no. 6, pp. 837-852. [11] Carbunar, B., Grama, A., Vitek, J., and Carbunar, O. (26) Redundancy and coverage detection in sensor networks, ACM Transactions on Sensor Networks, vol. 2, no. 1, pp. 94-128. [12] Olariu, S. and Stojmenovic, I. (26) Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting, Proceedings of the 25th IEEE Conference on Computer Communications (INFOCOM), pp 1-12. [13] Baydere, S., Safkan, Y., and Durmaz, O. (25) Lifetime analysis of reliable wireless sensor networks, IEICE Transactions on Communications, E88-B, 6, pp. 2465-2472. [14] Kansal, A., Ramamoorthy, A., Srivastava,M. B., and Pottie,G. J. (25) On sensor network lifetime and data distortion, Proceedings of the International Symposium on Information Theory (ISIT), pp. 6-1. [15] Kumar, S., Arora, A., and Lai, T. H. (25) On the lifetime analysis of always-on wireless sensor network applications, Proceedings of the IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS), pp 188-19. [16] Blough, D. M. and Santi, P. (22) Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks, Proceedings of the 8th ACM International Conference on Mobile Computing and Networking (MobiCom), pp. 183-192. Authors Abdelrahman Elleithy is a Ph.D. student in the University of Bridgeport pursuing his degree in Computer Science and Engineering. Abdelrahman has received his B.S. in Computer Science and MS in Computer Science in 27 and 28 respectively from the University of Bridgeport. Abdelrahman has participated twice in a sponsored program by the National Science Foundation, and the National Institutes of Health where he designed micro-electro-mechanical systems (MEMS) for biomedical applications. Current research interests of Abdelrahman include wireless communications, mobile communications and wireless sensor networks. Gonhsin Liu is an associate professor in the Depratment of Computer Sceince and Engineering at the University of Bridgeport. Prof. Liu has received his B.S.from Tatung Institute of Technology and his M.S.and Ph.D.from State University of New York at Buffalo. Prof. Liu has research interests in Digital Signal, Image Processing, and Unix/Linux opertaing ssytems. 15