Packet Delivery Time Research Articles

End-to-end control and optimization in information and calculating networks

Distributed systems and networks of computers assume the presence of multiple nodes interacting with each other through a packet switching network. Each node generates data packets, consisting of a certain number of bytes of useful information and bytes of service information, such as: node addresses, data type, checksum, etc. A packet switching network consists of a set of switching equipment; during each data transfer between nodes, a path is chosen that includes a certain amount of this equipment. The article describes a distributed information and computing system, controlled by all nodes from a single control center. A method for optimal control of such a system by the criterion of minimum data delivery time has been developed. Given that the delivery time of packets depends on the number of switching equipment that they pass, various types of network interference, internal and external noise in the monitoring channels and inside the control object are analyzed. It is shown that in the presence of random delays in the delivery of data and noise in the observations, end-to-end system management should be considered as an asymptotic approximation. It is proposed to solve this problem by means of linearised recurrent control minimizing the functional of delaying the delivery of packets in a system with arising stochasticities. This approach opens up good prospects for minimizing data delivery delays in modern distributed systems with remote spaced elements. And taking into account the unified control center, it makes it possible to create an intelligent subsystem for analyzing requirements in the data packet transfer system to eliminate downtime in the data delivery environment.

Predicting the Route of the Longest Lifetime and the Data Packet Delivery Time between Two Vehicles in VANET

Among the most critical issues in VANET are the frequent failures of the route caused by the high mobility of vehicles, the increase of the network overload caused by control messages, and the increase of the data packet delivery time. Short communication route lifetime often breaks down during data packet transmission between the source and the destination vehicles, which results in a relaunch of a new route reconstruction that becomes more frequent and depletes a significant amount of network resources. To face these issues, much research has considered the route stability and the route lifetime determination between source and destination vehicles as important factors to improve the quality of service in the VANET network. However, this research did not take into account the route that has the longest lifetime as the most stable route and assumes that vehicles move at a constant speed during a direct communication between them. Furthermore, it did not model the data packet delivery time between the source and the destination vehicles. For this reason, we propose two protocols that use vehicles density to predict the data packet delivery time before sending the data and use vehicles movement information to determine the longest lifetime route, taking into account the variation of the vehicles velocity for comfort applications on highway. Our schemes are evaluated in function of vehicles density by measuring the average route lifetime, the percentage of packets delivery, the control overhead, the average end-to-end delay, the throughput, and the average number of route failures generated during the transmission of data packets.

Comparative Analysis of Stability to Induced Deadlocks for Computing Grids with Various Node Architectures

The classification and application of switching methods and their advantages and disadvantages are considered. A computing grid model was constructed in the form of a colored Petri net with a node, which implements cut-through packet switching. The model consists of packet switching nodes, traffic generators, and guns that form malicious traffic disguised as usual user traffic. The characteristics of the grid model are investigated under a workload with different intensities. The influence of malicious traffic such as “traffic duel” to the quality of service parameters of the grid is estimated. A comparative analysis of computing grid stability with nodes, which implement store-and-forward (SAF) and cut-through switching technologies, was conducted. It is shown that grid performance is approximately the same under workload, and under peak load the grid with a node implementing SAF packet transmission is more stable. The grid with nodes implementing SAF technology comes to a complete deadlock through an additional load, which is less than 10%. It is shown after detailed study that the traffic duel configuration does not affect the grid with cut-through nodes when increasing the workload up to peak load, at which the grid comes to a complete deadlock. The periodicity of execution of the guns, which generate malicious traffic, is determined by a random function with the Poisson distribution. The CPN Tools modeling system is used for constructing models and measuring characteristics. The grid performance and average packet delivery time are estimated under different variants of the grid load.

Comparison of three LoRa devices and its application on street light monitoring system

This paper discusses implementation of Long Range (LoRa) networks as an Internet of Things (IoT) objects especially on street light monitoring. Low Powered Wide Area Network (LPWAN) is used as a communication network. LoRa devices are configured with a frequency of 470 MHz, spread factor 9, bandwidth of 31.25 KHz, and code rate of 4/5. The study found that the UM402 LoRa module has the farthest network range, up to 1 Km. By focusing on a range of up to 250 m, the LoRa Dragino shield has the fastest data packet delivery time at 0.77 s. UM402 LoRa module has the largest Received Signal Strength Indication (RSSI) value at 50m, it is -34. All LoRa devices used in this research can operate well at the ideal distance of street lights (35 m).

Performance evaluation of communication grids with cut-through switching nodes

For the performance evaluation of communication and computing rectangular grids of arbitrary size with a node that implements the cut-through packet switching technology, a model is constructed in the form of a reenterable colored Petri net. The grid model consists of three main parts: a grid structure model, a switching node model, and a terminal device model that generates a user’s traffic. The listed models are presented in a single copy, in accordance with the rules of reenterable models construction, the main parameters of the models are the grid topology, traffic intensity and packet processing time. The advantages of a reenterable model for the properties investigation and the design of complex systems are shown. Models of guns were added for the investigation of ill-intentioned traffic influence. The results of the grid performance estimation and the average packet delivery time for nodes with different packet switching technology under working load conditions are presented. The behavior of the communication grid model under workload conditions and ill-intentioned traffic is investigated. The quality of service parameters were estimated and the efficiency of real-size communication and computing grids was investigated for different types and intensities of ill-intentioned traffic. It is shown that the Focus configuration leads the grid, with the node that implements the technology of cut-through packet switching, to a complete deadlock under workload conditions. The other configurations lead the grid to a complete deadlock only under peak load conditions, while in the workload environment the Side shot and Crossfire configurations reduce the average packet delivery time.

On Detection of Sybil Attack in Large-Scale VANETs Using Spider-Monkey Technique

Sybil security threat in vehicular ad hoc networks (VANETs) has attracted much attention in recent times. The attacker introduces malicious nodes with multiple identities. As the roadside unit fails to synchronize its clock with legitimate vehicles, unintended vehicles are identified, and therefore erroneous messages will be sent to them. This paper proposes a novel biologically inspired spider-monkey time synchronization technique for large-scale VANETs to boost packet delivery time synchronization at minimized energy consumption. The proposed technique is based on the metaheuristic stimulated framework approach by the natural spider-monkey behavior. An artificial spider-monkey technique is used to examine the Sybil attacking strategies on VANETs to predict the number of vehicular collisions in a densely deployed challenge zone. Furthermore, this paper proposes the pseudocode algorithm randomly distributed for energy-efficient time synchronization in two-way packet delivery scenarios to evaluate the clock offset and the propagation delay in transmitting the packet beacon message to destination vehicles correctly. The performances of the proposed technique are compared with existing protocols. It performs better over long transmission distances for the detection of Sybil in dynamic VANETs' system in terms of measurement precision, intrusion detection rate, and energy efficiency.

Distributed power control in crowdsensing‐based femtocell networks with QoS provisioning

AbstractWe consider mobile crowdsensing campaigns that are practiced in the emerging data collection in femtocell networks, which are effective in improving the capacity and coverage of communication users. One of the challenging issues is how to allocate the transmission power and reduce the cross‐tier and co‐tier interferences among users. This paper proposes a Stackelberg game to characterize the actions of macrocell and femtocell users. In the game, the macrocell user is seen as the leader, whereas the femtocell users are seen as the followers. For the macrocell, it aims at maximizing the leader's profit with the constraint of the maximum tolerable interference. The femtocell users attempt to maximize the followers' profit in the network system with consideration of performance guarantee in the aspects of packet delivery rate and time delay, which are modeled as probability constraints. Spectrum sharing is assumed among the macrocell and femtocells. The uncertain channel state information is considered in the formulated problem, and the probability threshold method is utilized to convert the uncertain constraints into tractable ones. Furthermore, a power control and price bargaining algorithm is derived to get the practical operation. Finally, numerical results validate the performances of the proposed scheme in the aspects of convergence, utility of uses, and power consumption.

DATA EXCHANGE EVALUATION IN GLOBAL NETWORKS BASED ON INTEGRATED QUALITY INDICATOR OF SERVICE NETWORK

Context. Increasing amount of data circulating in computer systems and networks requires new approaches to the protocols and mechanisms to ensure the user experience and security of information. Evaluation of the communication effectiveness in a computer network is performed on the basis of particular criteria and quality of service indicators in the data exchange protocols in a wide area network (WAN), which does not allow to fully appreciate the quality of service efficiency, taking into account the economic costs of providing the required values of service indicators quality. An important task in this sense is the study of the complex index of efficiency of data exchange in the global computer networks, taking into account the economic costs. Objective. Consideration of the criteria of the complex index service quality, efficiency of cryptographic information protection, and effectiveness of communication in global computer networks in various ways on the basis of the exchange control integrated efficiency indicator, taking into account the economic costs of providing the required quality of service parameter value. Method. The complex index of efficiency, taking into account the economic costs to ensure the required quality of service parameter values in a global computer networks. Results. It was offered the methodics of evaluating data effectiveness in global computer networks, based on a simple multifactor analysis. Proposed and justified a comprehensive indicator of the effectiveness of data exchange, which takes into account, as the specifications (baud rate, probability and packet delivery time, etc.), and economic parameters, such as cost of deployment and network maintenance, and so on. Conclusions. The method of evaluating the effectiveness of the data on a global computer networks, based on a simple multivariate analysis is offered. With the proposed method analyzed the data transmission efficiency in networks with different technologies, such as X.25 (v.34), Frame Relay, Fast Ethernet (0.1Gb, 1Gb, 10Gb, 40 Gb) on the same criteriaIt is shown that today the most effective technology on the set of parameters a 10Gb Ethernet. The novelty of this approach lies in the possibility of technical and economic parameters combination of the communication effectiveness, it allows to introduce an integrated performance indicator. The practical use of the proposed complex index will more accurately assess the effectiveness of communication protocols, which are used in global IP-based networks, the economic costs of deployment and maintenance of the network, the cost of providing the required quality of service indicator.

BA Virtual-Queue based Backpressure Scheduling Algorithm for Heterogeneous Multi-Hop Wireless Networks

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

Reliable Communication Protocol for Applications in Multi-Robot Systems

Multi-robot systems (MRSs) have a wide variety of applications, such as search and rescue in disaster scenarios, where many robots coordinate with each other to accomplish a task. Such MRS applications use infrastructureless environment in which robots rely on inherently unreliable ad hoc network to communicate with each other. Reliable communication among the peers can greatly enhance the performance of a multi-robot system. This paper proposes a reliable communication protocol (RCP) for applications in multi-robot systems. RCP acts as an interface between MRS applications and the underlying communication framework. RCP accepts data from MRS applications and reliably delivers it to other peers. RCP is transparent to MRS applications as well as the underlying communication hardware. To evaluate its performance, we have implemented RCP on seven Stargate micro-controllers that communicate with each other using an ad hoc network. Further, to test the performance of RCP in MRS applications involving higher number of peers, we have also implemented RCP on laptops with Intel i7 microprocessors. The obtained results show that RCP achieves reliability while reducing packet delivery time as well as the number of retries needed to deliver a failed packet.

RER: a real time energy efficient routing protocol for query-based applications in wireless sensor networks

Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saver protocols are used to minimize the overall energy consumed by a wireless sensor network (WSN), while energy balancer protocols efficiently distribute the consumption of energy throughout the network. Energy saver protocols are not necessarily good at balancing energy consumption and energy balancer protocols are not always efficient at reducing energy consumption. On the other hand, although delay is another important factor for WSNs energy-aware protocols do not take care of it. This paper proposes a real time energy efficient routing protocol for query-based applications in WSNs, which offers an efficient trade-off between traditional energy balancing and energy saving objectives while supporting a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

Power-Aware Relay Selection and Routing Scheme for Multi-Interface Sensor Networks

We present a joint relay and radio interface selection algorithm with packet deadline under limited power usage in multi-interface sensor networks. We find route optimization techniques in multi-interface networks: 1) selecting the most conservatively lowest-power interface to guarantee timely transmission considering the remaining hops to destination, and 2) searching detouring paths when the power level of an involved relay node is too low to use the necessary interface that guarantees timely delivery. We aim to achieve data delivery with packet deadline requirement while minimizing energy consumption at each node, and further prolonging network lifetime by selecting cost-effective relay nodes and wireless interfaces. We evaluate our proposed algorithm in terms of total power consumption and packet delivery performance, compared to homogeneous radio interface scenarios of only Wi-Fi interface and only 802.15.4 ZigBee interface. Simulation results show that the proposed algorithm exploits the given packet delivery time enough to conserve power consumption by selecting as low power interface as possible, and spreading out network traffic over the network. Our proposed algorithm demonstrates very reliable packet delivery performance without incurring delivery failures due to power outage and missed deadline.

LTE-D2D 차량 네트워크에서 정보 전달 방법

Current IEEE 802.11p which is suggested for vehicle to vehicle communication supports one hop communication. Thus, it has a limitation to carry out efficient data dissemination. In this thesis, we suggest LTE-D2D based vehicle network to provide efficient data dissemination in the vehicle environment. In this network architecture, we use name based message with IP packet options and we put the intermediate vehicle node called ‘super vehicle node’ and each normal vehicle node in the cell requests data to the super vehicle node. The super vehicle node responses data to the normal vehicle node. Performance analysis is based mathematical modeling. We compare LTE cellular network to LTE-D2D based vehicle network about throughput according to packet delivery time. ※ 본 연구는 미래창조과학부 및 정보통신산업진흥원의 IT융합 고급인력과정 지원사업의 연구결과로 수행되었음 (NIPA-2014-H040114-1005) First Author : Soongsil University, School of EE, adgirlyh@dcn.ssu.ac.kr, 학생회원 ° Corresponding Author : Soongsil University, Schoo of EE younghan@ssu.ac.kr, 종신회원 논문번호:KICS2014-12-492, Received December 16, 2014; Revised March 13, 2015; Accepted March 13, 2015 I. 서 론 최근 사물 간 통신에 대한 관심이 늘어나면서 이에 대한 응용으로 차량 간 통신에 대한 연구도 활발히 진 행되고 있다. 따라서 이제 차량은 단순히 이동 수단 기능만이 아닌 안전과 오락을 위한 정보 제공의 기능 까지 담당하게 되었다. 이에 따라 앞으로 차량 통신에 서 발생되는 트래픽 량이 더욱 증가할 전망이다. 늘어 나는 트래픽은 기지국에 많은 부하를 가져올 수 있기 때문에 이를 효과적으로 관리하기 위한 차량 네트워 크 내 정보 전달 방법에 대한 연구가 필요하다. 차량 네트워크 기술은 VANET(Vehicular Ad-hoc Networks)이라고 한다. VANET 기술은 IEEE 802.11a/g 기술을 기반으로 하며 현재 IEEE 802.11p 기술을 표준으로 한다. 따라서 차량 네트워크에 대한 많은 제안들은 802.11p를 사용하여 한 홉 전송을 통 논문 / LTE-D2D 차량 네트워크에서 정보 전달 방법 603 한 차량과 차량 간 통신을 수행한다. 하지만 IEEE 802.11p를 사용하는 VANET에서는 한 홉 전송으로 인해 정보의 전송 범위가 한정적이다. 또한 무선 링크 를 통해 동적으로 움직이는 차량 간 통신 환경에 맞게 빠른 속도를 지원하기 위해 인증 절차를 생략하여 보 안상에 문제가 있을 수 있다 . 본 논문에서는 근거리 통신 기술 중 LTE-D2D 기 술을 사용하여 기존 LTE 기지국과의 연동을 통해 넓 은 커버리지를 제공할 수 있는 차량 네트워크 구조를 제안한다. 또한 차량 네트워크에서 효율적인 정보 전 달을 위해 버스, 화물차와 같은 중간 차량 노드의 역 할을 추가하였다. 이를 통해 일반적으로 기지국을 거 쳐 LTE 코어망까지 정보를 요청하고 응답받던 메시 지 수행 과정을 중간 차량 노드가 일부 담당할 수 있 도록 설정하였다. 전송되는 메시지의 형태는 기존 IP 패킷 옵션을 지닌 이름 기반의 정보 메시지를 사용하 여 자연재해와 같이 통신망이 끊어진 긴급 상황에서 도 효과적인 정보 전달이 가능하도록 설계하였다. 본 논문의 2장에서는 제안한 네트워크 구조와 관련 된 연구로 VANET의 개념과 VANET에서 사용되는 근거리 통신 기술인 802.11p와 LTE-D2D, 정보 전달 과 관련된 ICN 기술에 대해 설명하고 3장에서는 LTE-D2D 차량 네트워크에서 정보 전달 방법에 대해 제안한다. 4장에서는 기존 LTE 셀룰러 네트워크와 LTE-D2D 차량 네트워크에서의 데이터 처리율 비교 를 통해 제안한 방법의 성능을 분석한다. 끝으로 5장 에서 결론을 맺는다.

Joint Radio Selection and Relay Scheme through Optimization Model in Multi-Radio Sensor Networks

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

Localized Routing Approach to Bypass Holes in Wireless Sensor Networks

Geographic greedy forwarding (GF) technique has been widely used by many algorithms for routing in sensor networks because of its high efficiency resulting from its local and memoryless nature. Hence, it ensures scalability which is a fundamental requirement for protocol applicability to large-scale sensor networks with limited resources. Nevertheless, GF suffers from a serious drawback when packets, based on geographic distance, cannot be delivered; i.e., the so-called “local minimum phenomenon”. This problem has been tackled in previous research works to guarantee packet delivery by routing around the boundaries of the hole, but at an excessive consumption of control overheads. In this paper, we propose a novel approach that exploits GF technique and guarantees at the same time packet delivery (handles the local minimum situations). Our approach is of a local nature that does not retain memories and performs better than the state-of-the-art approaches in terms of its ability to guarantee packet delivery and to derive efficient routing paths. We provide, in this paper, proof of its correctness (packet delivery guaranty) while showing, through simulations, its performance effectiveness in terms of reducing path lengths, average end-to-end delays, and overall energy consumption.

QoS-aware resource management for LTE-Advanced relay-enhanced network

Relaying is one of the major innovative concepts proposed in the recent years for cellular radio communication systems. It is a perfect solution for dealing with the issue of high variability of performance in cellular networks. By coordinated deployment at cell-edge or in shadowed areas, relay nodes can extend network coverage and increase the low end-user performance. Considering the advantages, relaying is recently being included in the standards of the fourth generation systems such as the LTE-Advanced and the WiMAX. However, one major problem of relaying is still to be resolved. Specifically, there are no concrete concepts for quality-of-service provisioning for relayed transmissions. This paper investigates the case of packet delivery times over multi-hop links in relay-enhanced networks. The discussion is specifically based on relaying implementation in the LTE-Advanced system. The quality-of-service satisfaction and its fairness for the base station and relay-node-connected users are analyzed in the framework of the utility theory. For the purpose of this analysis, utility functions are proposed for real-time traffic with minimum data rate and/or maximum packet delivery time requirements. Furthermore, several optimization concepts are proposed for managing multi-hop transmissions in a quality-of-service aware manner. The included analysis based on the LTE-Advanced system level simulations shows that the proposed optimizations have the potential to improve the overall quality-of-service satisfaction in a relay-enhanced system.

Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network

From the viewpoint of quality of service, the packet error rate (PER) and delivery time are both of critical performance indicators to assess internet quality for supervisor and customers. A computer network is composed of Internet data centers and delivery mediums and we can regard it as a network topology with vertices and arcs. Virtually, each component (vertex or arc) has multiple capacities/states due to failure, maintenance, etc. Evaluating the reliability of a network with unreliable vertices is a difficult problem because of the disabled of adjacent arcs by vertex failure. Hence the network with unreliable vertices can be called a multi-state unreliable vertex computer network (MUVCN). Concentrating on the MUVCN, this paper addresses the data delivery from the source to the sink through k(k⩾2) disjoint minimal paths simultaneously, and proposes an algorithm to assess system reliability fulfilling demand constraint, tolerable PER, and time threshold. Furthermore, a routing strategy for raising system reliability is established in advance to specify the main and backup minimal paths. Subsequently, such a system reliability named the backup reliability can be computed faster.

Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor Networks

Wireless sensor network (WSN) typically has energy consumption restriction. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saving protocols are used to minimize the overall energy consumed by a WSN, while energy balancing protocols attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP) for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

Random Scheduling for Exploiting Throughput and TSMA Scheduling for Alleviating Interference in Wireless Systems

Wireless systems schedule communicates resourcefully by allocating the shared band among associations in the identical geographic region. The lack of central control in wireless networks calls for the design of distributed scheduling algorithms. We present a distributed framework that guarantees maximum throughput. The framework is based on random scheduling which reflect best throughput power distribution in multi-hop wireless systems. The revision of this difficulty has been restricted due to the non-convexity of the primary optimization complications that forbids a well-organized answer. We yield a randomization method to agree with this trouble. We demonstrate the power distribution result through mathematical analysis and perform numerous extensions for the measured difficulty. Also, we examine how fast data can be composed from a Wireless Sensor (WS) system structured as tree. We discover and estimate a method by means of accurate simulation prototype under join cast. We reflect period setting up on a single occurrence channel with the goal of reducing the number of period slits needed to complete a join cast. We associate Time Separation Multiple Access (TSMA) scheduling with broadcast power controller to lessen the properties of interference and demonstrate that while power controller aids in decreasing the plan distance under a single occurrence, arrangement broadcasts by means of numerous occurrences is well-organized. We estimate the performance of several channel task techniques and discovery experientially that for reasonable extent systems of many nodes, the use of multiple occurrence scheduling can be sufficient to reject maximum intervention. Graphical representations are given for Mean life time, Packet Delivery Rate (PDR), throughput and time delay.