Performance Analysis of IEEE in Multi-hop Wireless Networks
|
|
- Muriel Fisher
- 8 years ago
- Views:
Transcription
1 Performane Analysis of IEEE in Multi-hop Wireless Networks Lan Tien Nguyen 1, Razvan Beuran,1, Yoihi Shinoda 1, 1 Japan Advaned Institute of Siene and Tehnology, 1-1 Asahidai, Nomi, Ishikawa, Japan National Institute of Information and Communiation Tehnology Hokuriku Researh Center, -1 Asahidai, Nomi, Ishikawa, Japan lannt@jaist.a.jp Abstrat. Multi-hop wireless networks provide a quik and easy way for networking when we need a temporary network or when abling is diffiult. The Medium Aess Control (MAC plays an important role in the ahievable system performane. There have been many studies on analyti modeling of single-hop wireless networks but only a few on the analysis of multihop wireless networks. Furthermore, the objet of these researhes is an homogeneous ad-ho wireless networks; therefore they are not appropriate for a network with struture suh as wireless mesh networks. This paper introdues an analyti model of throughput performane for the IEEE multi-hop networks, whih allows us to ompute the ahievable throughput on a given path in multi-hop wireless networks. The model shows that there is an optimal point at whih throughput is maximized. Using this model and a Markov model for modeling the operation of the IEEE DCF we an determine the amount of data that eah node should injet to the network to get the best throughput performane. 1 Introdution Multi-hop wireless networks provide a quik and easy way for networking when we need a temporary network or when abling is diffiult. The Distributed Coordination Funtion, Carrier Sense Multiple Aess with Collision Avoidane (CSMA/CA based, is the most popular MAC protool for wireless ommuniation. The analysis in this paper is based on the operation of DCF. In wireless networks, the throughput that an be sent through a wireless link depends on various fators suh as the distane between nodes, the transmission power, harateristis of environment like path loss, fading, noise, et. Given the broadast nature in wireless environment, the ahievable throughput on a wireless link not only dependent on the operation data rate on that link, but also depends on number of nodes using the same radio hannel within the two end-points arrier sense area. Considering a traffi flow sent from soure node to destination node through other intermediate nodes, the middle nodes may have to ontend with more nodes than the soure node or the destination node does. Consequently, the soure node an injet more data into the path than the amount that an be forwarded by middle nodes. This
2 may lead to paket loss and low performane in wireless network sine the ost to resend a paket is high and when injeting the amount of data larger than the one the hannel an aepted makes the ondition even worse and leads to a high paket loss. High paket loss in turn an trigger re-routing and make the network topology instable [1]. To date, there have been a lot of studies on analyti modeling of both single-hop wireless networks [], [3], [4], [5], [6] and multi-hop wireless networks [7], [8], [9] [10]. All of these models are assumed to use saturated traffi load (whih mean a node always has a paket ready for transmission exept the model whih is proposed in [10]. Other studies fous on the theoretial upper bound of throughput on an homogeneous ad-ho network [11], [1] or are based on the assumption of global sheduling [13], [14], [15], whih may not be a good assumption in a real wireless networks using IEEE In this paper, we introdue an analyti model of throughput performane for multi-hop networks allowing us to ompute the ahievable throughput on a given path in multi-hop wireless networks. The model shows that there is an optimal point at that throughput is maximized. Based on this model and Markov model for modeling the operation of the IEEE DCF we an determine the amount of data that eah node should injet to the network to get the best throughput performane. Related work Following the analytial methodology introdued for the analysis of ALOHA protool and arrier sense multiple aess [16], [17], a lot of analytial modeling of wireless MAC protools has often foused on single-hop wireless networks. Although some models are proposed for multi-hop wireless networks [18], [19], they an t model the effet of binary exponential bak-off sheme (BEB whih is the key to adjust transmission intervals in IEEE Reently there are more researhes on modeling IEEE DCF in single-hop wireless networks [],[3], [4], [5], [6]. With a Markov Chain model, the exponential bak-off sheme was aurately modeled. However, these models an t be diretly applied to multi-hop wireless networks due to the hidden node problem. One of the first analytial models of IEEE DCF for multi-hop wireless networks is proposed in [7]. The hidden node problem is taken into aount, but transmission of all the nodes is assumed to follow a Poisson proess whih doesn t math the behavior of IEEE binary exponential bak-off sheme. In the model whih is proposed by Wang and Garia-Luna-Aeves in [8] the BEB sheme an t be aptured effetively either beause only a simple model for exponential bak-off sheme is used. Some reent works have solved the problem to model behavior of binary exponential bak-off sheme [9], [10]. Carvalho and Garia-Luna-Aeves introdued an analytial model to study operation of DCF in multi-hop wireless networks [9]. The model takes into aount the impat of both physial layer and network topology. However, the impat of hidden nodes is not onsidered. David Malone et al. proposed a model whih is effetive in apturing the binary exponential bak-off sheme of
3 80.11 DCF in both saturated and non-saturated environment [10]. This model helps us in studying the relation between input load and output load of a node depending on several parameters of IEEE DCF. There are some researh results on the apaity of general ad-ho network [11], [1] and mesh network [13]. It was shown that for stationary networks, the apaity for eah node derease as O(1/ n ; meanwhile for the mobile networks that an tolerate long delay, the apaity may remain onstant. In mesh networks, the authors in [13] laimed that gateways are bottleneks and the available apaity for eah node redues to O(1/n, where n is the number of node assoiated with one gateway. 3 Network model We onsider a multi-hop wireless network in whih eah node uses IEEE DCF for medium aess ontrol and has only one radio interfae operating on the same radio hannel. In our model we also assume that only one transmission rate is used although a/b/g standards support multiple transmission rates At the MAC layer, the data payload is assumed to be 104 bytes plus 34 bytes from MAC header. Request-to-Send (RTS and Clear-to-Send (CTS are assumed to be sent at the lowest data rate that is supported by physial layer. At the appliation layer, we assume that there is single data flow and our goal is to present an analytial model to ompute ahievable throughput along a path. Beause of having only one flow in the network so the model we use only onsider intra-flow interferene ourring for pakets of the same flow transported over different wireless links. The inter-flow will be taken into aount in our future model. 4 Throughput Analysis The analytial model that we use to ompute ahievable throughput along a wireless multi-hop path is based on the model presented in [] but it takes into aount hidden nodes whih strongly affets ahievable throughput in multi-hop wireless networks. Similar to [11] we define three radio ranges: Transmission range (R t : represents the range in whih a frame an be suessfully reeived if there is no interferene from other nodes. This value is determined by transmission power, reeiver sensitivity and radio propagation properties. A node B is onsidered in transmission range of node A if pakets ome from node A are reeived at node B with power higher than minimum reeption power of node B. Carrier sense range (R s : represents the range in whih a transmission an trigger arrier sense detetion at radio interfae of the node. This value is determined by reeiver s sensitivity and also transmission power, radio propagation properties. A node B is onsidered in arrier sense range of node A if pakets ome from node A are reeived at node B with power higher than minimum detetion power of node B. Interferene range (R i : represents the range in whih the station in reeive mode will be interfered by other transmitter and thus suffers a loss.
4 Considering a transmission from node A to node B, the hidden nodes in this ase are the nodes that are inside the interferene range of node B (reeiver but outside both transmission range of node B and arrier sense range of node A (transmitter. Let s say C is a node in the hidden node set. Beause C is outside the arrier sense range of node A so it is not aware of transmissions between A and B. Any transmission of C will orrupt the transmission between A and B. The RTS/CTS sheme an t solve hidden node problem, and this reason makes performane of IEEE worse in multi-hop wireless networks. Our model will take into aount the impat of the hidden node problem on the throughput of a given path. We onsider n fixed nodes and n - 1 nodes send traffi to the next nodes along that path as illustrated in the Figure 1. The following notations are used to denote subset of n nodes. Carrier sense range of node j Transmission range of node j j - 4 j - 3 j - j - 1 j j + 1 j + j + 3 j + Transmission range of node j + 1 Interferene range of node j + 1 Fig. 1. Illustration of the three different ranges. C j refers to subset of nodes within arrier sense range of node j. C j + refers to the subset C j plus node j itself. I j refers to the subset of nodes within interferene range of node j. T j refers to the subset of node within transmission range of node j. Let S to be normalized system throughput, whih an be ompute as fration of time that hannel is used to suessfully transmit payload data. In a slot time hannel an be idle, busy with a suessful transmission or busy with a ollision. In order to alulate the average length of a slot time we have to onsider what an happen in a slot time or the probability that hannel has one of three different states. Let n be maximum number of nodes in the interferene range of nodes in the path, τ the probability that a node transmits in a random hosen slot time, and P tr the probability that there is at least one transmission in the onsidered slot time. One time slot is denoted as σ. Beause of n different nodes ontent on the hannel, eah node will transmit in a slot time with probability τ. n tr = 1 (1 τ (1 P
5 Consider a transmission between node j and node j+1 and suessful transmission need k time slot. Let P s be the probability that the transmission is suessful, whih is given by probability that there is only the sender transmit at the time in C j and none of nodes in {I j U I j+1 }/{T j U T j+1 } transmit in k time slot. Let h be number of nodes in {I j U I j+1 }/{T j U T j+1 }, these nodes are alled hidden nodes. nτ (1 τ (1 τ Ps = P n 1 hk ( We an express the ahievable throughput S as the following ratio E S = E tr p sl Where E p is average amount of payload information is suessfully transmitted in a slot time, E sl being average length of a slot time. (3 Fig.. Suess time and ollision time with basi aess and RTS/CTS mehanism. Let E(P be average paket payload size. Sine a paket an be transmitted suessfully in a slot time with probability P tr.p s, we may have E p = Ptr Ps E(P (4 The average length of a slot time is obtained onsidering that: a slot time is idle with probability 1-P tr ; ontain a suessful transmission with probability P tr.p s and ontains a ollision with probability P tr (1-P s. Thus equation (3 an be expressed as (1/ n Ptr Ps E[ P] S = (1 P σ + P P T + P (1 P T tr tr s s tr s (5
6 Where T s is the average time that the hannel is sensed busy by a suessful transmission, T being average time that hannel is sensed busy by a ollision and σ is duration of a slot time. The value of T s and T depends on the aess mehanism used. Firstly, we onsider the system uses the basi aess mehanism. Denoting δ as propagation delay, from Figure we an obtain the value of T bas s and T bas as follows T bas s = Phy _ hdr + MAC _ hdr + E[ P] + SIFS + δ + ACK + DIFS + δ (6 T bas = Phy _ hdr + MAC _ hdr + E[ P] + DIFS + δ (7 where E[P] is the average length of longest paket involve in the ollision. In our model we assume that all pakets have the same payload length so that E[P] = E[P] = P Seondly, onsidering the system in whih eah paket is transmitted by using RTS/CTS mehanism T s and T an be omputed by the following equations: T RTS s = RTS + SIFS + δ + CTS + SIFS + δ + Phy _ hdr (8 + MAC _ hdr + E[ P] + SIFS + δ + ACK + DIFS + δ T RTS = RTS + DIFS + δ (9 In order to see the relation between S and τ we rearrange equation (5 as T where T = σ. S = T s T (1/ n E[ P] σ + tr P P tr s [ P ( T 1 + 1] As T s, T, n, E[P] and σ are onstants and let us all From (1 ( and (11 F( τ 1 P P = tr tr s [ P ( T 1 + 1] 1 T 1 ( = T F τ n n hk 1 hk τ (1 τ τ (1 τ + 1 By analyzing the relation between F and τ we an get the relation between S and τ. Taking the derivative of (1 with respet to τ. ( T = τ df d It is easy to see that 1(1 τ n + T nτ (1 τ τ ( n n+ hk + hk T (10 (11 (1 (13
7 lim + τ > 0 lim τ > 1 df (14 < 0 dτ df (15 > 0 dτ From (14 and (15 there must be a value of τ in the range [0:1] at that the value of F is minimum and hene it maximizes the value of S. It is possible to assume that τ 1. That assumption omes from the mehanism of the IEEE DCF standards [1]. Aording to [1] the minimum value of ontention window (CW 0 is 3 so the value of τ should be smaller than 1/CW 0 (0.031 and our assumption is valid. To find that value of τ under the ondition τ 1 we an approximate df dτ n n( n 1 (16 ( 1 τ 1 nτ + τ Making equation = 0 to be quadrati equation and then we an solve it. Paket Payload MAC header Physial header ACK RTS CTS Channel Bit Rate Propagation delay Slot Time SIFS DIFS Table 1. System Parameters. 104 bytes 7 bits 19 bits 11 bits + Physial header 160 bits + Physial header 11 bits + Physial header 1 Mbit/s 1 μs 0 μs 10 μs 50 μs Figure 6 shows the theoretial maximum throughput that an ahieve with DCF with the RTS/CTS mehanism. The parameters used to ompute numerial results are summarized in Table 1. 5 Simulation and Analysis Results In this setion some results of both analysis and simulation are presented for evaluating the effetiveness of the proposed analytial model. For simulation we use ns-.7 [], with CMU Monarh Projet wireless and mobile ns- extensions [3]. The network topology used inludes 100 nodes, whih are putted in a line. The distane between two nodes is hanged from 00 m to 54 m to vary the number of nodes in the
8 interferene range. The transmission range and arrier sense range are set to be 50 m and 550 m, respetively. The data rate used in all simulations is 1 Mbps and the other parameters are set aording to the Table 1. The traffi soure for a node will send data at several onstant rates; these rates are set to one of the following rate 0, 30, 40, 50, 70, 90, 10, 150, 00 Kbps for monitoring the hanges of throughput at eah node. The simulation results in Figure 3, 4 and 5 show that when the input traffi load inreases multi-hop wireless network will get to saturation status but with higher number of node in the interferene range the throughput will be dereased quikly beause of ollisions. Fig. 3. Single node throughput versus single node traffi load (n = 5; h = 1. In the analytial model, the input traffi load is represented by transmission probability τ, where τ is the probability that a node transmits in a random hosen slot time. The value of τ obviously depends on the node s input traffi load, traffi of other nodes in its arrier sense range and the mehanism is used to aess media (IEEE DCF in this ase. By using a Markov model, the relation between τ and input traffi load an be obtain from a researh of K. Duffy et al [10].
9 Fig. 4. Single node throughput versus single node traffi load (n = 11; h = 1. where 1 q W0 τ = η (1 q(1 p(1 (1 q q W0 1 (1 p q qw0 qw0 ( qw0 + 3q η = + W0 W0 1 (1 q (1 q(1 (1 q q( W0 + 1( p(1 q q(1 p + (1 q + (1 q pq W + 0 (1 p (1 q(1 p W0 1 (1 q M 1 W0 (1 p p( p + 1 (1 p Here, p is the probability that a node senses the hannel busy on an attempted transmission, q being the probability that the node s buffer has pakets waiting for transmission, W 0 being the minimum ontention window of the node and being M W 0 the node s maximum ontention window size. M is the maximum bak-off stage. On other hand, based on the nature of wireless environment we have a relation between τ and p 1 (17 n 1 p = (1 τ (18 where n is number of node in the interferene range of the node inluding itself. Based on the assumption that we an ompute the value of q from given input traffi load of the node, by solving equations (17 and (18 we an find the value of p and τ
10 at that the node operates. Getting the value of τ by doing so is somehow diffiult. However, with the given network topology, the analytial model an predit the maximum throughput of a node or the input traffi load an be used to saturate the network. Fig. 5.. Single node throughput versus single node traffi load (n = 3; h = 1. Fig. 6. Single node throughput versus transmission probability τ, obtained by the analytial model. Figures 3, 4, and 5 present the simulation results with different network onditions while Figure 6 shows the analytial results. It is an be seen that the maximum values of throughput from simulation results are reasonably onsistent with the maximum throughputs from analytial results. The maximum values of throughput in figures 3, 4, and 5 are 114 kbps, 70 kbps, 36 kbps while the analytial model gives us the values
11 of 106 kbps, 59 kbps, 31 kbps respetively. Thus we an say that the analytial model an be applied to predit the saturation throughput on a given path of multihop wireless networks and onsequently the optimum input traffi load is obtained. 6 Conlusions In this paper we propose an analytial model for analyzing the throughput performane of IEEE multihop wireless networks. Comparison with simulation results shows that the model is suessful to estimate the saturation throughput on a given path in the multihop wireless network. The model also allows us to understand how the interferene range and hidden node affet to throughput performane or say in other way the impat of physial onditions to MAC performane. By using this model performane of MAC protool in IEEE multihop wireless network an be studied more effetively. For the future work, we will study the issue of improving throughput performane in IEEE wireless mesh network and in partiular, we will fous on routing protool and admission ontrol mehanism for that network. We will also need a better model whih allows us to predit per hop throughput as well as delay time and jitter with inter-flow interferene and multiple transmission rates will be taken into aount. Aknowledgements. The finanial support from the 1st entury COE program Verifiable and Evolvable e-soiety, Japan Advaned Institute of Siene and Tehnology, is gratefully aknowledged. Referenes 1. P. C. Ng, S. C. Liew, Re-routing Instability in IEEE Multi hop Ad ho Networks, IEEE WLN 04, Nov. 004, Tampa, USA. G. Bianhi, Performane analysis of the IEEE distributed oordination funtion, IEEE Journal on Seleted Areas in Communiations, vol. 18, no. 3, pp , Mohammad Hossein Manshaei, Gion Reto Cantieni, Chadi Barakat, Thierry Turletti: Performane Analysis of the IEEE MAC and Physial Layer Protool. WOWMOM 005: Chuan H. Foh, M. Zukerman, Performane Analysis of the IEEE MAC Protool, EW00 Proeedings, Xiao Y and Rosdahl J, Performane Analysis and Enhanement for the Current and Future IEEE MAC Protools, ACM SIGMOBILE Mobile Computing and Communiations Review (MCR, speial issue on Wireless Home Networks, Vol. 7, No., Apr. 003, pp F. Cali, M. Conti, and E. Gregori. Dynami tuning of the IEEE protool to ahieve a theoretial throughput limit. IEEE/ACM Transations on Networking, 8(6: , Deember H. Chhaya and S. Gupta. Performane modeling of asynhronous data transfer methods of IEEE MAC protool. Wireless Networks, 3:17 34, 1997
12 8. Y. Wang and J. J. Garia-Luna-Aeves. Performane of ollision avoidane protools in single-hannel ad ho networks. In Pro. of ICNP, pages , November M. Carvalho and J. Aeves. Salable model for hannel aess protools in multihop ad ho networks. In ACM Mobiom 04, September K. Duffy, D. Malone, and D. J. Leith, Modeling the Distributed Coordination Funtion in non-saturated onditions, IEEE Communiations Letters, vol. 9, no. 8, pp , P. Gupta, P. R. Kumar, The Capaity of Wireless Networks, IEEE Trans. Inform. Theory, Vol.46, No., pp , Mar J. Li, C. Blake et al., Capaity of Ad Ho Wireless Networks, ACM MobiCom 01, Rome, Italy, July J. Jangeun and M. L. Sihitiu, The nomial apaity of wireless mesh networks, IEEE Wireless Communiations, pp. 8-14, Ot K. Jain et al. Impat of Interferene on Multi-hop Wireless Network Performane, ACM MobiCom 03, San Diego, USA, Sept M. Kodialam, T. Nandagopal, Charaterizing Ahievable Rates in Multi-hop Wireless Networks: The Joint Routing and Sheduling Problem, ACM MobiCom 03, San Diego, USA, Sept L. Kleinrok and F. A. Tobagi. Paket swithing in radio hannels: Part I - arrier sense multiple-aess modes and their throughput-delay harateristis. IEEE Transations on Communiations, 3(1: , F. A. Tobagi and L. Kleinrok. Paket swithing in radio hannels: Part II - the hidden terminal problem in arrier sense multiple-aess modes and the busy-tone solution. IEEE Transations on Communiations, 3(1: , F. A. Tobagi. Analysis of a two-hop entralized paket radio network - part II: Carrier sense multiple aess. IEEE Transations on Communiations, 8(:08 16, February F. A. Tobagi. Analysis of a two-hop entralized paket radio network - part II: Carrier sense multiple aess. IEEE Transations on Communiations, 8(:08 16, February K. Xu, M. Gerla, and S. Bae, "How effetive is the IEEE RTS/CTS handshake in ad ho networks," in Pro. of GLOBECOM '0, IEEE standards for wireless LAN medium aess ontrol (MAC and physial layer (PHY speifiations The network simulator - ns, 3. CMU Monarh Projet Extensions to NS,
Computer Networks Framing
Computer Networks Framing Saad Mneimneh Computer Siene Hunter College of CUNY New York Introdution Who framed Roger rabbit? A detetive, a woman, and a rabbit in a network of trouble We will skip the physial
More informationIEEE 802.11 Ad Hoc Networks: Performance Measurements
IEEE 8. Ad Hoc Networks: Performance Measurements G. Anastasi Dept. of Information Engineering University of Pisa Via Diotisalvi - 56 Pisa, Italy Email: g.anastasi@iet.unipi.it E. Borgia, M. Conti, E.
More informationStatic Fairness Criteria in Telecommunications
Teknillinen Korkeakoulu ERIKOISTYÖ Teknillisen fysiikan koulutusohjelma 92002 Mat-208 Sovelletun matematiikan erikoistyöt Stati Fairness Criteria in Teleommuniations Vesa Timonen, e-mail: vesatimonen@hutfi
More informationA Holistic Method for Selecting Web Services in Design of Composite Applications
A Holisti Method for Seleting Web Servies in Design of Composite Appliations Mārtiņš Bonders, Jānis Grabis Institute of Information Tehnology, Riga Tehnial University, 1 Kalu Street, Riga, LV 1658, Latvia,
More informationFibonacci Backoff Algorithm for Mobile Ad Hoc Networks
Fibonacci Backoff Algorithm for Mobile Ad Hoc Networks Saher S Manaseer Mohamed Ould-Khaoua Lewis M Mackenzie Department of Computing Science University of Glasgow, Glasgow G 8RZ, UK {saher, mohamed, lewis}@dcs.gla.ac.uk
More informationWireless Transmission Systems. Instructor
Teleommuniation Engineering Tehnology, Texas A&M University Wireless Transmission Systems Leture Notes - Copyright Jeff M. MDougall 2 Wireless Transmission Systems Teleommuniation Engineering Tehnology,
More information3. TMT for IEEE 802.11g Networks
136 IJCSNS International Journal of Computer Science and Network Security, VOL.11 No.4, April 2011 The Theoretical Maximum Throughput Calculation for the IEEE802.11g Standard Alex V. Barbosa, Marcos F.
More informationAttenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction
Wireless Physical Layer Q1. Is it possible to transmit a digital signal, e.g., coded as square wave as used inside a computer, using radio transmission without any loss? Why? It is not possible to transmit
More informationAn integrated optimization model of a Closed- Loop Supply Chain under uncertainty
ISSN 1816-6075 (Print), 1818-0523 (Online) Journal of System and Management Sienes Vol. 2 (2012) No. 3, pp. 9-17 An integrated optimization model of a Closed- Loop Supply Chain under unertainty Xiaoxia
More informationCSMA/CA. Information Networks p. 1
Information Networks p. 1 CSMA/CA IEEE 802.11 standard for WLAN defines a distributed coordination function (DCF) for sharing access to the medium based on the CSMA/CA protocol Collision detection is not
More informationA TCP-like Adaptive Contention Window Scheme for WLAN
A TCP-like Adaptive Contention Window Scheme for WLAN Qixiang Pang, Soung Chang Liew, Jack Y. B. Lee, Department of Information Engineering The Chinese University of Hong Kong Hong Kong S.-H. Gary Chan
More informationImproved SOM-Based High-Dimensional Data Visualization Algorithm
Computer and Information Siene; Vol. 5, No. 4; 2012 ISSN 1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Siene and Eduation Improved SOM-Based High-Dimensional Data Visualization Algorithm Wang
More informationDeduplication with Block-Level Content-Aware Chunking for Solid State Drives (SSDs)
23 IEEE International Conferene on High Performane Computing and Communiations & 23 IEEE International Conferene on Embedded and Ubiquitous Computing Dedupliation with Blok-Level Content-Aware Chunking
More informationBandwidth Allocation and Session Scheduling using SIP
JOURAL OF COUICAIS, VOL., O. 5, AUGUS 006 7 Bandwidth Alloation and Session Sheduling using SIP Hassan HASSA, Jean-arie GARCIA and Olivier BRU LAAS-CRS, oulouse, Frane Email: {hhassan}@laas.fr Abstrat
More informationHierarchical Clustering and Sampling Techniques for Network Monitoring
S. Sindhuja Hierarhial Clustering and Sampling Tehniques for etwork Monitoring S. Sindhuja ME ABSTRACT: etwork monitoring appliations are used to monitor network traffi flows. Clustering tehniques are
More informationDataflow Features in Computer Networks
Magyar Kutatók 1. Nemzetközi Szimpóziuma 1 th International Symposium of Hungarian Researhers on Computational Intelligene and Informatis Gyula Max Budapest University of Tehnology and Eonomis, Department
More informationCollision of wireless signals. The MAC layer in wireless networks. Wireless MAC protocols classification. Evolutionary perspective of distributed MAC
The MAC layer in wireless networks The wireless MAC layer roles Access control to shared channel(s) Natural broadcast of wireless transmission Collision of signal: a /space problem Who transmits when?
More informationAdaptive DCF of MAC for VoIP services using IEEE 802.11 networks
Adaptive DCF of MAC for VoIP services using IEEE 802.11 networks 1 Mr. Praveen S Patil, 2 Mr. Rabinarayan Panda, 3 Mr. Sunil Kumar R D 1,2,3 Asst. Professor, Department of MCA, The Oxford College of Engineering,
More informationMobile Communications Exercise: Satellite Systems and Wireless LANs. Georg von Zengen, IBR, TU Braunschweig, www.ibr.cs.tu-bs.de
Mobile Communications Exercise: Satellite Systems and Wireless LANs N 1 Please define the terms inclination and elevation using the following two figures. How do these parameters influence the usefulness
More informationCSE331: Introduction to Networks and Security. Lecture 6 Fall 2006
CSE331: Introduction to Networks and Security Lecture 6 Fall 2006 Open Systems Interconnection (OSI) End Host Application Reference model not actual implementation. Transmits messages (e.g. FTP or HTTP)
More informationCapacity at Unsignalized Two-Stage Priority Intersections
Capaity at Unsignalized Two-Stage Priority Intersetions by Werner Brilon and Ning Wu Abstrat The subjet of this paper is the apaity of minor-street traffi movements aross major divided four-lane roadways
More informationarxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA
LBNL-52402 Marh 2003 On the Speed of Gravity and the v/ Corretions to the Shapiro Time Delay Stuart Samuel 1 arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrene Berkeley National Laboratory
More informationEnhanced Power Saving for IEEE 802.11 WLAN with Dynamic Slot Allocation
Enhanced Power Saving for IEEE 802.11 WLAN with Dynamic Slot Allocation Changsu Suh, Young-Bae Ko, and Jai-Hoon Kim Graduate School of Information and Communication, Ajou University, Republic of Korea
More informationLearning Curves and Stochastic Models for Pricing and Provisioning Cloud Computing Services
T Learning Curves and Stohasti Models for Priing and Provisioning Cloud Computing Servies Amit Gera, Cathy H. Xia Dept. of Integrated Systems Engineering Ohio State University, Columbus, OH 4310 {gera.,
More informationAUDITING COST OVERRUN CLAIMS *
AUDITING COST OVERRUN CLAIMS * David Pérez-Castrillo # University of Copenhagen & Universitat Autònoma de Barelona Niolas Riedinger ENSAE, Paris Abstrat: We onsider a ost-reimbursement or a ost-sharing
More informationEffectiveness of a law to reduce alcohol-impaired driving in Japan
Effetiveness of a law to redue alohol-impaired driving in Japan T Nagata, 1,2 S Setoguhi, 3 D Hemenway, 4 M J Perry 5 Original artile 1 Takemi Program, Department of International Health, Harvard Shool
More informationHenley Business School at Univ of Reading. Pre-Experience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD)
MS in International Human Resoure Management For students entering in 2012/3 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date of speifiation:
More informationCS6956: Wireless and Mobile Networks Lecture Notes: 2/11/2015. IEEE 802.11 Wireless Local Area Networks (WLANs)
CS6956: Wireless and Mobile Networks Lecture Notes: //05 IEEE 80. Wireless Local Area Networks (WLANs) CSMA/CD Carrier Sense Multi Access/Collision Detection detects collision and retransmits, no acknowledgement,
More informationAsia-Pacific Advanced Network
Frame aggregations in the wireless LANs: A review paper Presented by: Anwar Saif Asia-Pacific Advanced Network Wireless communication 2009 Abstract The overhead induced by the IEEE 802.11 PHY and MAC layer
More informationTrade Information, Not Spectrum: A Novel TV White Space Information Market Model
Trade Information, Not Spetrum: A Novel TV White Spae Information Market Model Yuan Luo, Lin Gao, and Jianwei Huang 1 Abstrat In this paper, we propose a novel information market for TV white spae networks,
More informationOn the Characteristics of Spectrum-Agile Communication Networks
1 On the Charateristis of Spetrum-Agile Communiation Networks Xin Liu Wei Wang Department of Computer Siene University of California, Davis, CA 95616 Email:{liu,wangw}@s.udavis.edu Abstrat Preliminary
More informationMATE: MPLS Adaptive Traffic Engineering
MATE: MPLS Adaptive Traffi Engineering Anwar Elwalid Cheng Jin Steven Low Indra Widjaja Bell Labs EECS Dept EE Dept Fujitsu Network Communiations Luent Tehnologies Univ. of Mihigan Calteh Pearl River,
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationParametric model of IP-networks in the form of colored Petri net
Parametri model of IP-networks in the form of olored Petri net Shmeleva T.R. Abstrat A parametri model of IP-networks in the form of olored Petri net was developed; it onsists of a fixed number of Petri
More informationScalable TCP: Improving Performance in Highspeed Wide Area Networks
Salable TP: Improving Performane in Highspeed Wide Area Networks Tom Kelly ERN - IT Division Geneva 3 Switzerland tk@am.a.uk ABSTRAT TP ongestion ontrol an perform badly in highspeed wide area networks
More informationOpenScape 4000 CSTA V7 Connectivity Adapter - CSTA III, Part 2, Version 4.1. Developer s Guide A31003-G9310-I200-1-76D1
OpenSape 4000 CSTA V7 Connetivity Adapter - CSTA III, Part 2, Version 4.1 Developer s Guide A31003-G9310-I200-1-76 Our Quality and Environmental Management Systems are implemented aording to the requirements
More informationNeural network-based Load Balancing and Reactive Power Control by Static VAR Compensator
nternational Journal of Computer and Eletrial Engineering, Vol. 1, No. 1, April 2009 Neural network-based Load Balaning and Reative Power Control by Stati VAR Compensator smail K. Said and Marouf Pirouti
More informationSUDOKU: Secure and Usable Deployment of Keys on Wireless Sensors
SUDOKU: Seure and Usable Deployment of Keys on Wireless Sensors Matthias Wilhelm, Ivan Martinovi, Ersin Uzun, and Jens B. Shmitt diso Distributed Computer Systems Lab, TU Kaiserslautern, Germany {wilhelm,
More informationA Keyword Filters Method for Spam via Maximum Independent Sets
Vol. 7, No. 3, May, 213 A Keyword Filters Method for Spam via Maximum Independent Sets HaiLong Wang 1, FanJun Meng 1, HaiPeng Jia 2, JinHong Cheng 3 and Jiong Xie 3 1 Inner Mongolia Normal University 2
More informationOpenSession: SDN-based Cross-layer Multi-stream Management Protocol for 3D Teleimmersion
: SN-based ross-layer Multi-stream Management Protool for 3 Teleimmersion hsan refin Raoul Rivas Rehana Tabassum Klara Nahrstedt University of Illinois at Urbana-hampaign, Urbana, IL {marefin2, trivas,
More informationChannel Assignment Strategies for Cellular Phone Systems
Channel Assignment Strategies for Cellular Phone Systems Wei Liu Yiping Han Hang Yu Zhejiang University Hangzhou, P. R. China Contat: wliu5@ie.uhk.edu.hk 000 Mathematial Contest in Modeling (MCM) Meritorious
More informationEnhancement of VoIP over IEEE 802.11 WLANs by Adapting Transmitting Interval
Enhancement of VoIP over IEEE 82.11 WLANs by Adapting Transmitting Interval Zhuo Chen, Lingyun Wang, and Xinbing Wang School of Electronic, Information and Electrical Engineering Shanghai Jiao Tong University
More informationAn Experimental Study of Throughput for UDP and VoIP Traffic in IEEE 802.11b Networks
An Experimental Study of Throughput for UDP and VoIP Traffic in IEEE 82.11b Networks Sachin Garg sgarg@avaya.com Avaya Labs Research Basking Ridge, NJ USA Martin Kappes mkappes@avaya.com Avaya Labs Research
More informationGreen Cloud Computing
International Journal of Information and Computation Tehnology. ISSN 0974-2239 Volume 4, Number 4 (2014), pp. 431-436 International Researh Publiations House http://www. irphouse.om /ijit.htm Green Cloud
More informationCan I add a VoIP call?
Can I add a VoIP call? Sachin Garg Avaya Labs Basking Ridge, NJ 07920 Email: sgarg@avaya.com Martin Kappes Avaya Labs Basking Ridge, NJ 07920 Email: mkappes@avaya.com Abstract In this paper, we study the
More informationprotection p1ann1ng report
f1re~~ protetion p1ann1ng report BUILDING CONSTRUCTION INFORMATION FROM THE CONCRETE AND MASONRY INDUSTRIES Signifiane of Fire Ratings for Building Constrution NO. 3 OF A SERIES The use of fire-resistive
More informationEffects of Inter-Coaching Spacing on Aerodynamic Noise Generation Inside High-speed Trains
Effets of Inter-Coahing Spaing on Aerodynami Noise Generation Inside High-speed Trains 1 J. Ryu, 1 J. Park*, 2 C. Choi, 1 S. Song Hanyang University, Seoul, South Korea 1 ; Korea Railroad Researh Institute,
More informationAsymmetric Error Correction and Flash-Memory Rewriting using Polar Codes
1 Asymmetri Error Corretion and Flash-Memory Rewriting using Polar Codes Eyal En Gad, Yue Li, Joerg Kliewer, Mihael Langberg, Anxiao (Andrew) Jiang and Jehoshua Bruk Abstrat We propose effiient oding shemes
More informationPerformance Evaluation Of Multiband CSMA/CA With RTS/CTS For M2M Communication With Finite Retransmission Strategy
Performance Evaluation Of Multiband CSMA/CA With RTS/CTS For M2M Communication With Finite Retransmission Strategy Baher Mawlawi, Jean-Baptiste Doré, Nikolai Lebedev, Jean-Marie Gorce To cite this version:
More informationTHE EFFECT OF WATER VAPOR ON COUNTERFLOW DIFFUSION FLAMES
THE EFFECT OF WATER VAPOR ON COUNTERFLOW DIFFUSION FLAMES by Jaeil Suh and Arvind Atreya Combustion and Heat Tkansfer Laboratory Department of Mehanial Engineering and Applied Mehanis The University of
More information... neither PCF nor CA used in practice
IEEE 802.11 MAC CSMA/CA with exponential backoff almost like CSMA/CD drop CD CSMA with explicit ACK frame added optional feature: CA (collision avoidance) Two modes for MAC operation: Distributed coordination
More informationSupply chain coordination; A Game Theory approach
aepted for publiation in the journal "Engineering Appliations of Artifiial Intelligene" 2008 upply hain oordination; A Game Theory approah Jean-Claude Hennet x and Yasemin Arda xx x LI CNR-UMR 668 Université
More informationPerformance analysis and simulation in wireless mesh networks
Performance analysis and simulation in wireless mesh networks Roberto Cusani, Tiziano Inzerilli, Giacomo Di Stasio University of Rome Sapienza INFOCOM Dept. Via Eudossiana 8, 84 Rome, Italy Abstract Wireless
More informationImpact Simulation of Extreme Wind Generated Missiles on Radioactive Waste Storage Facilities
Impat Simulation of Extreme Wind Generated issiles on Radioative Waste Storage Failities G. Barbella Sogin S.p.A. Via Torino 6 00184 Rome (Italy), barbella@sogin.it Abstrat: The strutural design of temporary
More information10. Wireless Networks
Computernetzwerke und Sicherheit (CS221) 10. Wireless Networks 1. April 2011 omas Meyer Departement Mathematik und Informatik, Universität Basel Chapter 6 Wireless and Mobile Networks (with changes CS221
More informationAn Efficient Network Traffic Classification Based on Unknown and Anomaly Flow Detection Mechanism
An Effiient Network Traffi Classifiation Based on Unknown and Anomaly Flow Detetion Mehanism G.Suganya.M.s.,B.Ed 1 1 Mphil.Sholar, Department of Computer Siene, KG College of Arts and Siene,Coimbatore.
More informationMedium Access Control (MAC) Protocols for Ad hoc Wireless Networks - III
Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks - III CS: 647 Advanced Topics in Wireless Networks Drs. Baruch Awerbuch & Amitabh Mishra Department of Computer Science Johns Hopkins
More informationDownlink Scheduling and Radio Resource Allocation in Adaptive OFDMA Wireless Communication Systems for User-Individual QoS
Downlin Sheduling and Radio Resoure Alloation in Adaptive OFDMA Wireless Communiation Systems for User-Individual QoS Lu Yanhui, Wang Chunming, Yin Changhuan, and Yue Guangxin Abstrat In this paper, we
More informationISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 5, September
Analysis and Implementation of IEEE 802.11 MAC Protocol for Wireless Sensor Networks Urmila A. Patil, Smita V. Modi, Suma B.J. Associate Professor, Student, Student Abstract: Energy Consumption in Wireless
More informationClassical Electromagnetic Doppler Effect Redefined. Copyright 2014 Joseph A. Rybczyk
Classial Eletromagneti Doppler Effet Redefined Copyright 04 Joseph A. Rybzyk Abstrat The lassial Doppler Effet formula for eletromagneti waves is redefined to agree with the fundamental sientifi priniples
More informationChapter 5 Single Phase Systems
Chapter 5 Single Phase Systems Chemial engineering alulations rely heavily on the availability of physial properties of materials. There are three ommon methods used to find these properties. These inlude
More informationExpress Forwarding : A Distributed QoS MAC Protocol for Wireless Mesh
Express Forwarding : A Distributed QoS MAC Protocol for Wireless Mesh, Ph.D. benveniste@ieee.org Mesh 2008, Cap Esterel, France 1 Abstract Abundant hidden node collisions and correlated channel access
More informationSebastián Bravo López
Transfinite Turing mahines Sebastián Bravo López 1 Introdution With the rise of omputers with high omputational power the idea of developing more powerful models of omputation has appeared. Suppose that
More informationDeadline-based Escalation in Process-Aware Information Systems
Deadline-based Esalation in Proess-Aware Information Systems Wil M.P. van der Aalst 1,2, Mihael Rosemann 2, Marlon Dumas 2 1 Department of Tehnology Management Eindhoven University of Tehnology, The Netherlands
More informationCourse 8-9 DSL type digital access techniques (Digital Subscriber Line)
Course 8-9 DSL type digital aess tehniques (Digital Subsriber Line) o The term refers to the tehnologies and equipments used in a telephone network to ensure the aess to a high speed digital network on
More informationImproving Performance for CSMA/CA Based Wireless Networks
Improving Performance for CSMA/CA Based Wireless Networks A dissertation submitted for the degree of Doctor of Philosophy by Tianji Li, BSc., MSc. Supervisor: Prof. Douglas Leith Hamilton Institute National
More informationAn Analysis of the Optimum Node Density for Ad hoc Mobile Networks
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith y, and Louise E. Moser y Department of Computer Science y Department of Electrical and Computer
More informationThroughput Modeling in IEEE 802.11 WLAN-based Wireless Networks
Throughput Modeling in IEEE 82.11 WLAN-based Wireless Networks Kirill Ermolov Aalto University Espoo, Finland kirill.ermolov@aalto.fi Abstract Wireless Local Area Networks (WLANs) are nowadays the most
More information' R ATIONAL. :::~i:. :'.:::::: RETENTION ':: Compliance with the way you work PRODUCT BRIEF
' R :::i:. ATIONAL :'.:::::: RETENTION ':: Compliane with the way you work, PRODUCT BRIEF In-plae Management of Unstrutured Data The explosion of unstrutured data ombined with new laws and regulations
More informationHow To Determine The Capacity Of An 802.11B Network
Capacity of an IEEE 802.11b Wireless LAN supporting VoIP To appear in Proc. IEEE Int. Conference on Communications (ICC) 2004 David P. Hole and Fouad A. Tobagi Dept. of Electrical Engineering, Stanford
More informationA Game Theoretical Approach to Gateway Selections in Multi-domain Wireless Networks
1 A Game Theoretial Approah to Gateway Seletions in Multi-domain Wireless Networks Yang Song, Starsky H.Y. Wong and Kang-Won Lee IBM Researh, Hawthorne, NY Email: {yangsong, hwong, kangwon}@us.ibm.om Abstrat
More informationRecovering Articulated Motion with a Hierarchical Factorization Method
Reovering Artiulated Motion with a Hierarhial Fatorization Method Hanning Zhou and Thomas S Huang University of Illinois at Urbana-Champaign, 405 North Mathews Avenue, Urbana, IL 680, USA {hzhou, huang}@ifpuiuedu
More informationModeling and analyzing interference signal in a complex electromagnetic environment
Liu et al. EURASIP Journal on Wireless Communiations and Networking (016) 016:1 DOI 10.1186/s13638-015-0498-8 RESEARCH Modeling and analyzing interferene signal in a omplex eletromagneti environment Chun-tong
More informationPerformance Monitoring and Control in Contention- Based Wireless Sensor Networks
Performance Monitoring and Control in Contention- Based Wireless Sensor Networks Thomas Lindh #1, Ibrahim Orhan #2 # School of Technology and Health, KTH Royal Institute of Technology Marinens vag 30,
More informationLecture 17: 802.11 Wireless Networking"
Lecture 17: 802.11 Wireless Networking" CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Lili Qiu, Nitin Vaidya Lecture 17 Overview" Project discussion Intro to 802.11 WiFi Jigsaw discussion
More informationJournal of Engineering Science and Technology Review 6 (5) (2013) 143-148. Research Article
Jestr Journal o Engineering Siene and Tehnology Review 6 (5) (13) 143-148 Researh Artile JOURNAL OF Engineering Siene and Tehnology Review www.jestr.org Numerial Analyses on Seismi Behaviour o Conrete-illed
More informationContext-Sensitive Adjustments of Cognitive Control: Conflict-Adaptation Effects Are Modulated by Processing Demands of the Ongoing Task
Journal of Experimental Psyhology: Learning, Memory, and Cognition 2008, Vol. 34, No. 3, 712 718 Copyright 2008 by the Amerian Psyhologial Assoiation 0278-7393/08/$12.00 DOI: 10.1037/0278-7393.34.3.712
More informationIEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 3, MAY/JUNE 2012 401
IEEE TRASACTIOS O DEPEDABLE AD SECURE COMPUTIG, VOL. 9, O. 3, MAY/JUE 2012 401 Mitigating Distributed Denial of Servie Attaks in Multiparty Appliations in the Presene of Clok Drifts Zhang Fu, Marina Papatriantafilou,
More informationA novel active mass damper for vibration control of bridges
IABMAS 08, International Conferene on Bridge Maintenane, Safety and Management, 3-7 July 008, Seoul, Korea A novel ative mass damper for vibration ontrol of bridges U. Starossek & J. Sheller Strutural
More informationAgent-Based Grid Load Balancing Using Performance-Driven Task Scheduling
Agent-Based Grid Load Balaning Using Performane-Driven Task Sheduling Junwei Cao *1, Daniel P. Spooner, Stephen A. Jarvis, Subhash Saini and Graham R. Nudd * C&C Researh Laboratories, NEC Europe Ltd.,
More informationIntelligent Measurement Processes in 3D Optical Metrology: Producing More Accurate Point Clouds
Intelligent Measurement Proesses in 3D Optial Metrology: Produing More Aurate Point Clouds Charles Mony, Ph.D. 1 President Creaform in. mony@reaform3d.om Daniel Brown, Eng. 1 Produt Manager Creaform in.
More informationA Three-Hybrid Treatment Method of the Compressor's Characteristic Line in Performance Prediction of Power Systems
A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition of Power Systems A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition
More informationOn the Throughput Evaluation of Wireless Mesh Network Deployed in Disaster Areas
On the Throughput Evaluation of Wireless Mesh Network Deployed in Disaster Areas 13 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current
More informationCARRIER VOICE NETWORK MANAGEMENT
CARRIER VOICE NETWORK MANAGEMENT Elvis N. Ngah Supervised by: Dr. Sandjai Bhulai Department of Mathematis Vrije Universiteit Amsterdam The Netherlands Deryk Cole Network Operations Center Telesonique Global
More informationAn Enhanced Critical Path Method for Multiple Resource Constraints
An Enhaned Critial Path Method for Multiple Resoure Constraints Chang-Pin Lin, Hung-Lin Tai, and Shih-Yan Hu Abstrat Traditional Critial Path Method onsiders only logial dependenies between related ativities
More informationCluster-based Multi-path Routing Algorithm for Multi-hop Wireless Network
International Journal of Future Generation Communication and Networking 67 Cluster-based Multi-path Routing Algorithm for Multi-hop Wireless Network Jie Zhang, Choong Kyo Jeong, Goo Yeon Lee, Hwa Jong
More informationHow To Fator
CHAPTER hapter 4 > Make the Connetion 4 INTRODUCTION Developing seret odes is big business beause of the widespread use of omputers and the Internet. Corporations all over the world sell enryption systems
More informationSLA-based Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments
2 th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing SLA-based Resoure Alloation for Software as a Servie Provider (SaaS) in Cloud Computing Environments Linlin Wu, Saurabh Kumar
More informationHenley Business School at Univ of Reading. Chartered Institute of Personnel and Development (CIPD)
MS in International Human Resoure Management (full-time) For students entering in 2015/6 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date
More informationTCP in Wireless Networks
Outline Lecture 10 TCP Performance and QoS in Wireless s TCP Performance in wireless networks TCP performance in asymmetric networks WAP Kurose-Ross: Chapter 3, 6.8 On-line: TCP over Wireless Systems Problems
More informationComputational Analysis of Two Arrangements of a Central Ground-Source Heat Pump System for Residential Buildings
Computational Analysis of Two Arrangements of a Central Ground-Soure Heat Pump System for Residential Buildings Abstrat Ehab Foda, Ala Hasan, Kai Sirén Helsinki University of Tehnology, HVAC Tehnology,
More informationChapter 1 Microeconomics of Consumer Theory
Chapter 1 Miroeonomis of Consumer Theory The two broad ategories of deision-makers in an eonomy are onsumers and firms. Eah individual in eah of these groups makes its deisions in order to ahieve some
More informationWireless Network Measurement: VoIP and 802.11e
Wireless Network Measurement: VoIP and 82.11e by Ian Dangerfield, B.A Masters Thesis Hamilton Institute National University of Ireland Maynooth Maynooth Co. Kildare December 27 Research Supervisor: Dr.
More informationAlgorithm of Removing Thin Cloud-fog Cover from Single Remote Sensing Image
Journal of Information & Computational Siene 11:3 (2014 817 824 February 10, 2014 Available at http://www.jois.om Algorithm of Removing Thin Cloud-fog Cover from Single Remote Sensing Image Yinqi Xiong,
More informationProfessional Certificate Training in Business Writing
Professional Certifiate Training in Business Writing About Training in Business Writing ZeebraCross Centre for Management Exellene (ZCME) is an initiative of ZeebraCross (Unit of InfousRx Marketing and
More informationADV-MAC: Advertisement-based MAC Protocol for Wireless Sensor Networks
ADV-MAC: Advertisement-based MAC Protocol for Wireless Sensor Networks Surjya Ray, Ilker Demirkol and Wendi Heinzelman Department of Electrical and Computer Engineering University of Rochester, Rochester,
More information802.11 standard. Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale
802.11 standard Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale IEEE 802.11 Requirements Design for small coverage (e.g. office, home) Low/no mobility High data-rate applications Ability to
More informationOpen and Extensible Business Process Simulator
UNIVERSITY OF TARTU FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Institute of Computer Siene Karl Blum Open and Extensible Business Proess Simulator Master Thesis (30 EAP) Supervisors: Luiano Garía-Bañuelos,
More informationGranular Problem Solving and Software Engineering
Granular Problem Solving and Software Engineering Haibin Zhu, Senior Member, IEEE Department of Computer Siene and Mathematis, Nipissing University, 100 College Drive, North Bay, Ontario, P1B 8L7, Canada
More informationCustomer Efficiency, Channel Usage and Firm Performance in Retail Banking
Customer Effiieny, Channel Usage and Firm Performane in Retail Banking Mei Xue Operations and Strategi Management Department The Wallae E. Carroll Shool of Management Boston College 350 Fulton Hall, 140
More information