Improving Spatial Reuse of IEEE Based Ad Hoc Networks

Size: px
Start display at page:

Download "Improving Spatial Reuse of IEEE Based Ad Hoc Networks"

Transcription

1 mproving Spatial Reuse of EEE Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos to improve the performance of EEE base a hoc networks from the perspective of spatial reuse. Since employs virtual carrier sensing to reserve the meium prior to a packet transmission, the relative size of the spatial region it reserves for the impening traffic significantly affects the overall network performance. We show that the space reserve by for a successful transmission is far from optimal an epening on the one hop istances between the sener an the receiver, we can have three scenarios with very ifferent spatial reuse characteristics. We also introuce a new quantitative measure, the spatial reuse inex, to evaluate the efficiency of the meium reservation accomplishe by virtual carrier sensing. We also propose an improve virtual carrier sensing mechanism for wireless LAN scenarios an using analysis an simulation results, show that it can significantly increase the spatial reuse an network throughput.. NTRODUCTON n EEE base a hoc networks, concurrent transmissions an channel contentions are manage by the istribute coorination function (DCF) [1]. DCF employs Virtual Carrier Sensing () to etermine channel access rights an reuce collisions among the stations competing for the share meium. While using physical carrier sensing an backoff mechanisms to istributely etermine channel access, also uses the exchange of RTS an CTS messages to avoi the well known hien terminal problem [1]. To avoi interfering with the ongoing transmission, all noes which hear the RTS or CTS message efer their transmission till the ongoing transmission is over. Consequently, the geographical area over which the hanshake can be hear etermines the overall throughput achievable in the network. To evaluate the effectiveness an efficiency of the meium reservation accomplishe by the mechanism an consequently the, spatial reuse can serve as an important benchmark. We note that there is a traeoff between higher spatial reuse an increase chances of collisions. Due to its tight connection with the network throughput an latency, spatial reuse serves as one of the key factors in wireless network capacity analysis. This paper analyzes the spatial reuse characteristics of an proposes a protocol to significantly improve the reuse characteristics. Recently, extensive research efforts have been evote to the performance evaluation of a hoc networks, most of which focus on the capacity analysis [3][4][5]. To the best of our knowlege, the influence of interference range on the network performance was first explore in [6] which examines the interaction of the MAC an a hoc forwaring from the perspective of spatial reuse. t is shown that for the total capacity to scale with network size, the average istance between source an estination noes must remain small as the network grows. n [7], spatial reuse characteristics are use to examine the performance of EEE MAC in multihop networks. The paper presents several serious problems encountere in EEE multihop networks an their unerlying causes an conclues that current wireless LAN protocols o not function well in multihop a hoc networks. n [8], the hanshake is analyze an it is shown that this mechanism is not always effective ue to the fact that the power neee for interrupting a packet reception is much lower than that for elivering a packet successfully. Thus the virtual carrier sensing implemente by hanshake cannot prevent all interferences as expecte in theory. Although some of the previous work evaluates the capacity an effectiveness of virtual carrier sensing, none of them has stuie the spatial reuse characteristics thoroughly. n this paper, we evaluate the performance of EEE base a hoc networks in terms of the spatial reuse an provie a quantitative measure of spatial reuse which reflects the effectiveness of meium reservation conucte by virtual carrier sensing. Our analysis shows that there are three ifferent cases with respect to the effectiveness of meium reservation, which we escribe as uneractive, moerate an overactive, respectively. We also show that the the space reserve by for a successful transmission oes not always match the space in which interference may occur. The paper further examines the overactive scenario an proposes an improve virtual carrier sensing scheme to enhance spatial reuse. We focus our analysis an simulations on Wireless LANs, where noes harly move uring packet transmission an have relatively small one-hop istance between them. Experimental an analytic results show that our propose scheme achieves significantly higher throughput over the virtual carrier sensing mechanism use in The rest of the paper is organize as follows. n Section we analyze the three scenarios with respect to the effectiveness of spatial reuse an introuce the spatial reuse measure. An improve scheme is propose an evaluate in Section. Section V summarizes our conclusions.

2 SPATAL REUSE ANALYSS As escribe in the previous section, spatial reuse is a key parameter that etermines the performance of wireless networks. n this section, we present a thorough analysis of the spatial reuse in virtual carrier sensing. We also introuce a metric to evaluate the spatial reuse. A. The Signal to nterference Ratio Moel Successful reception of a packet at the physical layer epens on the signal to noise ratio at the receiver. The basic raio propagation moel that we assume in this paper is the two-ray groun reflection moel [2]. Accoring to this moel, the receive power at istance is given by P r () = P tg t G r h 2 t h2 r (1) 4 L where P t is the transmitte power, h t an h r are the heights of the transmitter an receiver antennas respectively, G t an G r are the antenna gains an L is the system loss. As will be seen shortly, it is not ifficult to exten our analysis to the free space moel [2]. Now we escribe the three ranges that we use heavily in this paper, following the efinitions of [8]. Since we use ns-2 [9], [1] as our simulator, whose PHY layer is moele on the 914MHz Lucent WaveLAN DSSS raio interface, the relevant ata in ns-2 an the WaveLAN car are also provie. ffl Transmission Range ( ): The range within which a MAC frame can be successfully elivere an its type/subtype (RTS, CTS, Data, etc.) fiel can be correctly ientifie, assuming there is no interference from other raios. Accoring to Eqn. (1) an for WaveLAN an ns-2, the transmission range in is equal to 25 meters. ffl Carrier Sense Range (R s ): The range within which the power from the transmitter can be sense, inicating the busy state of the meium. Using Eqn. (1) an the carrier sensing power threshol of WaveLAN, we have 55 meters as the common carrier sense range. ffl nterference Range ( ): The range within which stations in receive moe will be interfere with by other transmitters an thus suffer a loss. As will be shown later, it oes not take a fixe value. To obtain the value of, we nee to introuce the moel of signal to interference ratio (SR), which irectly follows the Physical Moel in Gupta an Kumar s work [3]. Suppose that noe B is receiving packets from noe A, which is at an onehop istance of s meters, an concurrently another noe C, i meters away from B, is sening packets to a fourth noe D. We also assume all noes transmit at the same power P t an have the same raio parameters. To etermine whether there is a collision at B, we nee to compare the power receive at B from both A an C, enote by P s (signal power) an P i (interference power), respectively. Neglecting ambient noise, from Eqn. (1), we have [8] SR = P s P i = i s ff CPThresh (2) where CPThresh enotes the Capture Threshol, set to 1 in ns-2, an ff is the signal attenuation coefficient, which is equal to 4 in the two-ray groun reflection moel. Thus the interference range is given by = s (CPThresh) 1=ff = k SR s (3) We use k So enote the multiplier, which epens on the SR moel. n ns-2, k SR = 4p 1 = 1:78. Thus there is no fixe relation between an ; is proportional to the one-hop istance s. Note that an R s are merely raio ranges, which implies they only apply in the PHY layer. However, is involve with the SR moel an the comparison of the receive power, so it must be hanle at the MAC layer as well. We now show how the relative magnitues of an affect the performance of virtual carrier sensing an the effectiveness of the hanshake. Since in Wireless LANs it is common that all noes are within R s meters of each other, in the following sections we focus our iscussions to the other two ranges. B. Effectiveness of Virtual Carrier Sensing n [1], noes efer any impening transmission by the appropriate intervals whenever an RTS or CTS is overhear. This virtual carrier sensing mechanism, together with physical carrier sensing, etermines the busy/ile state of the meium. ts unerlying justification can be escribe by the conitions below. 1) Sufficient conition: f a noe can overhear an, then it is potentially able to interfere with the upcoming transmission. 2) Necessary conition: f a noe is capable of interfering with an ongoing transmission, then it must be able to overhear the preceing RTS or CTS. Obviously, achieves its best performance only when both conitions are satisfie. This happens when the transmission range is equal to the interference range. However, as we mentione earlier, this is not the common case as is not a fixe value. To better illustrate the effectiveness of mechanism, we classify all the situations into three categories with respect to r = =, the ratio of the one-hop istance as compare to. 1) Uneractive Scenario: Fig. 1 shows the scenario where the interference range (otte line circle) is larger than the transmission range (soli line circle). From Eqn. (2) we have = k SR >, so in this scenario, is confine by =k SR <<.nns-2 an WaveLAN, this range is between 141 an 25 meters. As shown in Fig. 1, every location falls into one of the four zones, marke by,, an V. Specifically, Zone, the intersection of the two soli line circles, represents the area in which a noe can overhear both RTS an CTS of the ongoing transmission. n Zone, only RTS can be overhear, while a noe in Zone can only overhear CTS. Zone V, however, is out of an a noe locate in it can sense some energy in the meium but is not able to ientify the signal.

3 V the necessary conition. Thus the hanshake an consequently the has reasonable performance in this case an we call it the Moerate Scenario. V sener receiver V V Fig. 1. Scenario : Uneractive, :56 << Fig. 3. Scenario : Overactive, <:36 n this scenario, we can see the sufficient conition aresse previously is satisfie, as any noe locate in Zone, or is able to interfere with the ongoing traffic. However, while a noe in Zone V can not successfully receive packets, it is still able to interrupt the ongoing transmission since it is within the interference range. Note that noes in Zone V fail to obtain the transmission uration information from the packets an thus o not efer from accessing the channel. Therefore in this scenario mechanism might fail to prevent a hien noe from interfering with the transmission, an we call this the Uneractive Scenario. Fig. 2. Scenario : Moerate, :36 <<:56 2) Moerate Scenario: Fig. 2 epicts the scenario where is smaller than an part of the otte line circles (interference region) lies within Zone /. n this scenario the range of is =(k SR +1) << =k SR, which is between :36 an :56 an 9 < < 141 meters in Lucent s WaveLAN an ns-2. n Fig. 2, observe the interference circle (otte line) an the transmission circle (soli line). As can be seen, Zone,, all intersect with the interference circle, which implies that the noes in the three zones have a chance (equal to 1% when = ) to interfere with the ongoing traffic. On the other han, all the noes within the interference circle are able to receive the preceing, which satisfies 3) Overactive Scenario: n Fig. 3, is small enough so that there is no intersection between the interference circle an Zone / an both interference circles are locate within Zone. n this case, the range of is < =(k SR +1)an for Lucent s WaveLAN an ns-2, is below :36 (9 meters). We call this the Overactive Scenario since the sufficient conition is no longer satisfie while the necessary conition still hols. t is seen that, although the noes in Zone / can still receive, they are not capable of interrupting the ongoing transmission. n this case gives false alarms that reuce the spatial reuse. t is also interesting that the power level neee for a successful packet elivery is much smaller than that of interrupting a transmission, a scenario which might not have been consiere when the was first propose. C. Evaluation of Spatial Reuse The effectiveness of is closely relate to the efficiency of spatial reuse, which in turn has a strong influence on the throughput an elay characteristics. Since the necessary an sufficient conitions mentione above are rarely satisfie simultaneously, the spatial reuse achieve in general is far from ieal. n Fig. 3, the spatial reuse is low since noes outsie the interference circles coul actually transmit/receive espite the etection of. n this scenario the hanshake claims much more space than necessary for a successful transmission, thereby reucing the spatial reuse. On the other han, in Fig. 1, mechanism unerestimates the space require for a successful transmission an thus incurs potential collisions by excessive spatial reuse, which is also unesirable. To evaluate spatial reuse quantitatively, we introuce the Spatial Reuse nex (SR) as follows: area of the region where interference may occur SR = area of the region reserve by to avoi interference (4) n a single hop scenario, this inex is equivalent to the ratio of the area of the interference region (union of the two otte line circles) to that of the transmission region (union of the

4 Spatial Reuse nex Overactive Moerate spatial reuse curve saturation point Uneractive One hop istance as compare to transmission range: / Fig. 4. Spatial Reuse nex (SR) two soli line circles). Assume r = =, the ratio of the onehop istance to the transmission range, we can compute the one-hop SR as p SR one hop = (ßk2 k 2 cos 1 1 2k ß cos 1 r 2 + r 4 4k 2 1)r 2 p4 r 2 (5) where k = k SR as specifie in (2). Using k SR = 4p 1 = 1:78, we obtain the SR curve in Fig. 4. n Fig. 4, the reuse inex achieves its optimal (saturation) value of 1 as r =1=k SR =:56. This happens when = an hanshake elivers its best performance. For SR above 1, uneractive causes an excessive spatial reuse, which may introuce unforeseeable collisions. We also see that overactive has a low spatial reuse with its SR below.5. t can be seen that the SR serves as a goo measure for evaluating both spatial reuse an hanshake efficiency.. AN MPROVED SCHEME AND EXPERMENTAL RESULTS n generic Wireless LAN settings, one-hop istances less than 1 meters are one of the most common scenarios since such environments are primarily expecte to span rooms in a builing, a few houses or builings. Accoring to the WaveLAN an ns-2 settings, these woul correspon to the overactive scenario. Also, while the uneractive scenario is not esirable ue to the potential collisions incurre, an alternative CTS reply scheme to eliminate such collisions has been propose in [8]. For these reasons, we only consier the overactive scenario in our propose scheme. A. Aggressive Virtual Carrier Sensing (A) We see in Fig. 3 that spatial reuse is inaequate in most wireless LAN scenarios since prohibits eligible noes in Zone / from sening or receiving. To enhance spatial reuse, we propose a simple new scheme name Aggressive Virtual Carrier Sensing (A). ts basic iea is escribe in Table -A, where we use an event-action table. To illustrate the working of A, consier a noe in Zone with ata to sen. Uner 82.11, the noe has to Zone etection Sener s action Normal Aggressive Normal Receiver s action Aggressive RTS&CTS hol hol hol hol RTS only hol sen RTS hol respon with CTS CTS only hol sen RTS hol respon with CTS TABLE NORMAL VS.AGGRESSVE : EVENT-ACTON TABLE efer/hol its RTS till the en of the ongoing transmission an then use the backoff mechanism. n our propose scheme, however, a noe in Zone woul sen its RTS immeiately whenever it wants to sen a packet, or respon instantly with a CTS if it is an intene receiver. n short, a noe which overhears either a RTS or a CTS but not both woul not consier the meia as busy. The unerlying justification for A is that in the overactive scenario, if a sener or receiver can hear either a RTS or a CTS but not both, it is guarantee that such a noe cannot interfere with the ongoing transmission. B. Evaluation of A From the iscussion in the Section -A, it is clear that A increases the spatial reuse in wireless LANs by allowing noes in Zones an to transmit. This improvement can be quantifie if we re-evaluate the spatial reuse inex of Eqn. 5. Accoring to its efinition, the -reserve region (enominator in Eqn. (4)) shrinks to the intersection of the two transmission circles when we apply A. Therefore we can re-erive the SR as p SR AV CS = (ßk2 k 2 cos 1 1 2k cos 1 r 2 r 4 4k 2 1)r 2 p4 r 2 (6) n Fig. 5, we compare the new SR curve with the original one, with the X-axis set as the real-worl one-hop istance. We see that the spatial reuse improves significantly with A in wireless LAN settings, specially as the one hop istance increases. n fact, the spatial reuse can be further improve in the overactive scenario if we exten our attention to Zone. n Fig. 3, the noes in Zone which are not within the interference circles, can also sen an receive packets without Fig. 5. Spatial Reuse nex Normal Aggressive One hop istance (meters) Comparison of A with the normal in terms of SR

5 Throughput per connection (Kbps) Normal Aggressive One hop istance (meters) Fig. 6. Ranom connection patterns for one hop istance of 85 meters Fig. 7. Throughput in Aggressive an Normal interrupting the ongoing transmission. However, in orer to juge whether such a noe is within the interference circle, the istance information between the noes is also require. With a more sophisticate MAC protocol that can hanle istance measurements an istribution, even better spatial reuse can be achieve. Finally, we note that there are some traeoffs when using the A. Since noes in Zone an transmit while the original transmission is going on, the original source an estination noes will not upate their NAV which might lea to potential collisions. However, the probability of such collisions epens on the spatial istribution of the traffic patterns an are likely to be small. C. Simulation Results Using ns-2 base simulation results, we now show that the improve SR results in increase network throughput. The raio parameters assume correspon to Lucent s WaveLAN. For evaluating the scheme, we use a test topology wherein we ranomly generate two pairs of noes with the same one-hop istance. Due to the assumption of wireless LAN settings, we confine this one-hop istance to less than 9 meters, the upper boun for the overactive RTS scenario. The locations of the pairs are generate ranomly so that either pair has a chance to be place in any zone of the other pair. UDP is use as the transport protocol for both the connections an each source is a CBraffic generator with a rate of 448Kbps. The generate topology is then simulate an the per-connection throughput is measure. This experiment is then repeate 2 times with ranomize placement of the two source estination pairs. From these 2 runs, the average per-connection throughput is compute for both A an the normal. The 2 ranom connections pairs generate for the case of one hop istance of 85 meters is shown in Figure 6. Fig. 7 plot the achieve per session throughput for ifferent one-hop istances. t can be seen from the figure that A achieves about 2% greater throughput that normal in the overactive RTS scenario. n Fig. 7, the throughput achieve by normal stays at a constant level an has little fluctuation, while for A, the throughput goes up slightly as we increase the one-hop istance. This matches our intuition that as Zone an Zone grow larger, A gains a better chance to enhance the spatial reuse, consequently improving the overall throughput. V. CONCLUSONS The performance of wireless networks in general an EEE base a hoc networks in particular, in terms of both the throughput an elay characteristics, epen on the spatial reuse characteristics. n this paper, we present a thorough analysis of the spatial reuse characteristics of base a hoc networks. We showe that epening on the one hop istances between the sener an the receiver, we can have three scenarios with ifferent spatial reuse characteristics. We also introuce a new metric, spatial reuse inex, an emonstrate its effectiveness in evaluating the spatial reuse. The paper also propose an improve virtual carrier sensing scheme for wireless LAN scenarios. This protocol is specifically esigne to enhance the spatial reuse in the overactive scenario. Through both analytic an simulation results, we show the effectiveness of our scheme in increasing the spatial reuse an also the network throughput. REFERENCES [1] ANS/EEE St 82.11: Wireless LAN Meium Access Control (MAC) an Physical Layer (PHY) Specification, [2] T. Rappaport, Wireless Communications: Principle an Practice, Prentice Hall, New Jersey, [3] P. Gupta an P. R. Kumar, The Capacity of Wireless Networks, EEE Transaction on nformation Theory, vol. 46, no. 2, pp , March 2. [4] M. Gastpar an M. Vetterli. On the capacity of wireless networks: The relay case, n Proc. NFOCOM, New York, NY, June 22. [5] Y. C. Tay an K. C. Chua, A Capacity Analysis for the EEE MAC Protocol, Wireless Networks, vol. 7, no. 2, pp , 21. [6] J. Li, C. Blake, D. Couto et. al., Capacity of A Hoc Wireless Networks, n Proc. ACM MobiCom 21, Rome, taly, July 21 [7] S. Xu an T. Saaawi, Does the EEE MAC Protocol Work Well in Multihop Wireless A Hoc Networks? EEE Communications Magazine, vol. 39, no. 6, pp , June 21. [8] K. Xu, M. Gerla, an S. Bae, How Effective is the EEE Hanshake in A Hoc Networks? n Proc. GLOBECOM 22, Taipei, November 22. [9] K. Fall an K. Varahan, Es., ns manual/ns Notes an Documentation, [1] CMU Monarch Group, CMU Monarch Extensions to ns,

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract

More information

Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!

Questions? Post on piazza, or  Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)! EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an

More information

Overview : Computer Networking. IEEE MAC Protocol: CSMA/CA Internet mobility TCP over noisy links

Overview : Computer Networking. IEEE MAC Protocol: CSMA/CA Internet mobility TCP over noisy links Overview 15-441 15-441: Computer Networking 15-641 Lecture 24: Wireless Eric Anerson Fall 2014 www.cs.cmu.eu/~prs/15-441-f14 Internet mobility TCP over noisy links Link layer challenges an WiFi Cellular

More information

Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!

Questions? Post on piazza, or  Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)! EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an

More information

Architecture Design of Mobile Access Coordinated Wireless Sensor Networks

Architecture Design of Mobile Access Coordinated Wireless Sensor Networks Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,

More information

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:

More information

EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks

EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks sensors Article EDOVE: Energy an Depth Variance-Base Opportunistic Voi Avoiance Scheme for Unerwater Acoustic Sensor Networks Safar Hussain Bouk 1, *, Sye Hassan Ahme 2, Kyung-Joon Park 1 an Yongsoon Eun

More information

An Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique

An Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech

More information

Message Transport With The User Datagram Protocol

Message Transport With The User Datagram Protocol Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer

More information

Probabilistic Medium Access Control for. Full-Duplex Networks with Half-Duplex Clients

Probabilistic Medium Access Control for. Full-Duplex Networks with Half-Duplex Clients Probabilistic Meium Access Control for 1 Full-Duplex Networks with Half-Duplex Clients arxiv:1608.08729v1 [cs.ni] 31 Aug 2016 Shih-Ying Chen, Ting-Feng Huang, Kate Ching-Ju Lin, Member, IEEE, Y.-W. Peter

More information

Collisions & Virtual collisions in IEEE networks

Collisions & Virtual collisions in IEEE networks Collisions & Virtual collisions in IEEE 82.11 networks Libin Jiang EE228a project report, Spring 26 Abstract Packet collisions lead to performance degradation in IEEE 82.11 [1] networks. The carrier-sensing

More information

On the Placement of Internet Taps in Wireless Neighborhood Networks

On the Placement of Internet Taps in Wireless Neighborhood Networks 1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization 1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24

More information

Lecture 1 September 4, 2013

Lecture 1 September 4, 2013 CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the

More information

Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs

Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,

More information

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks : a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications

More information

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita

More information

Study of Network Optimization Method Based on ACL

Study of Network Optimization Method Based on ACL Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science

More information

Cascading Multi-Hop Reservation and Transmission in Underwater Acoustic Sensor Networks

Cascading Multi-Hop Reservation and Transmission in Underwater Acoustic Sensor Networks Sensors 2014, 14, 18390-18409; oi:10.3390/s141018390 Article OPEN ACCESS sensors ISSN 1424-8220 www.mpi.com/journal/sensors Cascaing Multi-Hop Reservation an Transmission in Unerwater Acoustic Sensor Networks

More information

Coupling the User Interfaces of a Multiuser Program

Coupling the User Interfaces of a Multiuser Program Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces

More information

An Energy Efficient Routing for Wireless Sensor Networks: Hierarchical Approach

An Energy Efficient Routing for Wireless Sensor Networks: Hierarchical Approach An Energy Efficient Routing for Wireless Sensor Networks: Hierarchical Approach Nishi Sharma, Vanna Verma Abstract Wireless sensor networks (WSNs) is one of the emerging fiel of research in recent era

More information

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,

More information

Robust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks

Robust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,

More information

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 1, NO. 4, APRIL 01 74 Towar Efficient Distribute Algorithms for In-Network Binary Operator Tree Placement in Wireless Sensor Networks Zongqing Lu,

More information

Skyline Community Search in Multi-valued Networks

Skyline Community Search in Multi-valued Networks Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h

More information

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,

More information

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle

More information

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html

More information

Simulation Based Analysis of the Impact of Hidden Terminal to the TCP Performance in Mobile Ad Hoc Networks

Simulation Based Analysis of the Impact of Hidden Terminal to the TCP Performance in Mobile Ad Hoc Networks Simulation Based Analysis of the Impact of Hidden Terminal to the TCP Performance in Mobile Ad Hoc Networks Abstract The hidden terminal is classified as the sending hidden terminal and receiving hidden

More information

A Plane Tracker for AEC-automation Applications

A Plane Tracker for AEC-automation Applications A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)

More information

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH

SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway

More information

Dynamic Power Control MAC Protocol in Mobile Adhoc Networks

Dynamic Power Control MAC Protocol in Mobile Adhoc Networks Dynamic Power Control MAC Protocol in Mobile Adhoc Networks Anita Yadav Y N Singh, SMIEEE R R Singh Computer Science and Engineering Electrical Engineering Computer Science and Engineering Department Department

More information

Comparison of Wireless Network Simulators with Multihop Wireless Network Testbed in Corridor Environment

Comparison of Wireless Network Simulators with Multihop Wireless Network Testbed in Corridor Environment Comparison of Wireless Network Simulators with Multihop Wireless Network Testbe in Corrior Environment Rabiullah Khattak, Anna Chaltseva, Laurynas Riliskis, Ulf Boin, an Evgeny Osipov Department of Computer

More information

A Metric for Routing in Delay-Sensitive Wireless Sensor Networks

A Metric for Routing in Delay-Sensitive Wireless Sensor Networks A Metric for Routing in Delay-Sensitive Wireless Sensor Networks Zhen Jiang Jie Wu Risa Ito Dept. of Computer Sci. Dept. of Computer & Info. Sciences Dept. of Computer Sci. West Chester University Temple

More information

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract

More information

Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach

Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach Jian Zhao, Chuan Wu The University of Hong Kong {jzhao,cwu}@cs.hku.hk Abstract Peer-to-peer (P2P) technology is popularly

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

TCP Timeout Mechanism for Optimization of Network Fairness and Performance in Multi-Hop Pipeline Network

TCP Timeout Mechanism for Optimization of Network Fairness and Performance in Multi-Hop Pipeline Network Draft Version - Brunel University, Lonon TCP Timeout Mechanism for Optimization of Network Fairness an Performance in Multi-Hop Pipeline Network Siva Kumar Subramaniam 1, Rajagopal Nilavalan 3, Wamaeva

More information

Impact of FTP Application file size and TCP Variants on MANET Protocols Performance

Impact of FTP Application file size and TCP Variants on MANET Protocols Performance International Journal of Moern Communication Technologies & Research (IJMCTR) Impact of FTP Application file size an TCP Variants on MANET Protocols Performance Abelmuti Ahme Abbasher Ali, Dr.Amin Babkir

More information

Research Article REALFLOW: Reliable Real-Time Flooding-Based Routing Protocol for Industrial Wireless Sensor Networks

Research Article REALFLOW: Reliable Real-Time Flooding-Based Routing Protocol for Industrial Wireless Sensor Networks Hinawi Publishing Corporation International Journal of Distribute Sensor Networks Volume 2014, Article ID 936379, 17 pages http://x.oi.org/10.1155/2014/936379 Research Article REALFLOW: Reliable Real-Time

More information

Optimal Routing and Scheduling for Deterministic Delay Tolerant Networks

Optimal Routing and Scheduling for Deterministic Delay Tolerant Networks Optimal Routing an Scheuling for Deterministic Delay Tolerant Networks Davi Hay Dipartimento i Elettronica olitecnico i Torino, Italy Email: hay@tlc.polito.it aolo Giaccone Dipartimento i Elettronica olitecnico

More information

CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing

CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing Tim Roughgaren October 19, 2016 1 Routing in the Internet Last lecture we talke about elay-base (or selfish ) routing, which

More information

Ad-Hoc Networks Beyond Unit Disk Graphs

Ad-Hoc Networks Beyond Unit Disk Graphs A-Hoc Networks Beyon Unit Disk Graphs Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerlan {kuhn, wattenhofer, zollinger}@inf.ethz.ch ABSTRACT

More information

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks 1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing

More information

A shortest path algorithm in multimodal networks: a case study with time varying costs

A shortest path algorithm in multimodal networks: a case study with time varying costs A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via

More information

Supporting Fully Adaptive Routing in InfiniBand Networks

Supporting Fully Adaptive Routing in InfiniBand Networks XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar

More information

AnyTraffic Labeled Routing

AnyTraffic Labeled Routing AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,

More information

Optimal Oblivious Path Selection on the Mesh

Optimal Oblivious Path Selection on the Mesh Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract

More information

Effectiveness of DSDV Protocol Under Hidden Node Environment

Effectiveness of DSDV Protocol Under Hidden Node Environment Computing For Nation Development, February 25 26, 2010 Bharati Vidyapeeth s Institute of Computer Applications and Management, New Delhi Effectiveness of DSDV Protocol Under Hidden Node Environment Ruchi

More information

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite

More information

Improving IEEE Power Saving Mechanism

Improving IEEE Power Saving Mechanism 1 Improving IEEE 82.11 Power Saving Mechanism Eun-Sun Jung 1 and Nitin H. Vaidya 2 1 Dept. of Computer Science, Texas A&M University, College Station, TX 77843, USA Email: esjung@cs.tamu.edu 2 Dept. of

More information

Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks

Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks Coorinating Distribute Algorithms for Feature Extraction Offloaing in Multi-Camera Visual Sensor Networks Emil Eriksson, György Dán, Viktoria Foor School of Electrical Engineering, KTH Royal Institute

More information

Lab work #8. Congestion control

Lab work #8. Congestion control TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño

More information

Throughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem

Throughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple

More information

Comparison of Methods for Increasing the Performance of a DUA Computation

Comparison of Methods for Increasing the Performance of a DUA Computation Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,

More information

Disjoint Multipath Routing in Dual Homing Networks using Colored Trees

Disjoint Multipath Routing in Dual Homing Networks using Colored Trees Disjoint Multipath Routing in Dual Homing Networks using Colore Trees Preetha Thulasiraman, Srinivasan Ramasubramanian, an Marwan Krunz Department of Electrical an Computer Engineering University of Arizona,

More information

Performance Modelling of Necklace Hypercubes

Performance Modelling of Necklace Hypercubes erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract

More information

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2 This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar

More information

Announcements / Wireless Networks and Applications Lecture 9: Wireless LANs Wireless. Regular Ethernet CSMA/CD.

Announcements / Wireless Networks and Applications Lecture 9: Wireless LANs Wireless. Regular Ethernet CSMA/CD. Announcements 18-452/18-750 Wireless Networks and Applications Lecture 9: Wireless LANs 802.11 Wireless Peter Steenkiste Homework 1 should be out by tomorrow Project 1 by Friday Schedule:» Thursday lecture

More information

Non-homogeneous Generalization in Privacy Preserving Data Publishing

Non-homogeneous Generalization in Privacy Preserving Data Publishing Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h

More information

An Infrastructureless End-to-End High Performance Mobility Protocol

An Infrastructureless End-to-End High Performance Mobility Protocol Proceeings of the 5 IEEE International Conference on Electro Information Technology, 5, Lincoln Nebraska, May 5 An Infrastructureless En-to-En High Performance Mobility Protocol Saneep Davu, Rai Y. Zaghal

More information

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks

Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks 1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stoylar arxiv:15.4984v1 [cs.ni] 27 May 21 Abstract

More information

Robust Camera Calibration for an Autonomous Underwater Vehicle

Robust Camera Calibration for an Autonomous Underwater Vehicle obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of

More information

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base

More information

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks 01 01 01 01 01 00 01 01 Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University

More information

PAPER. 1. Introduction

PAPER. 1. Introduction IEICE TRANS. COMMUN., VOL. E9x-B, No.8 AUGUST 2010 PAPER Integrating Overlay Protocols for Proviing Autonomic Services in Mobile A-hoc Networks Panagiotis Gouvas, IEICE Stuent member, Anastasios Zafeiropoulos,,

More information

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,

More information

A Survey on Modified RTS/CTS Mechanism

A Survey on Modified RTS/CTS Mechanism A Survey on Modified RTS/CTS Mechanism Prachi Srivastava Computer Science and Engineering, MMMEC, Gorakhpur prachi.srivastava.itm@gmail.com Dayashankar Singh Computer Science and Engineering, MMMEC, Gorakhpur

More information

All-to-all Broadcast for Vehicular Networks Based on Coded Slotted ALOHA

All-to-all Broadcast for Vehicular Networks Based on Coded Slotted ALOHA Preprint, August 5, 2018. 1 All-to-all Broacast for Vehicular Networks Base on Coe Slotte ALOHA Mikhail Ivanov, Frerik Brännström, Alexanre Graell i Amat, an Petar Popovski Department of Signals an Systems,

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus

More information

Routing and quality of service support for mobile ad hoc networks

Routing and quality of service support for mobile ad hoc networks Computer Networks 51 (2007) 3142 3156 www.elsevier.com/locate/comnet Routing an quality of service support for mobile a hoc networks Anelise Munaretto a,c, *, Mauro Fonseca b,c a CPGEI/UTFPR, Programa

More information

Using Vector and Raster-Based Techniques in Categorical Map Generalization

Using Vector and Raster-Based Techniques in Categorical Map Generalization Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department

More information

Adjacency Matrix Based Full-Text Indexing Models

Adjacency Matrix Based Full-Text Indexing Models 1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,

More information

Characterizing Decoding Robustness under Parametric Channel Uncertainty

Characterizing Decoding Robustness under Parametric Channel Uncertainty Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric

More information

Calculation on diffraction aperture of cube corner retroreflector

Calculation on diffraction aperture of cube corner retroreflector November 10, 008 / Vol., No. 11 / CHINESE OPTICS LETTERS 8 Calculation on iffraction aperture of cube corner retroreflector Song Li (Ó Ø, Bei Tang (», an Hui Zhou ( ï School of Electronic Information,

More information

Local Path Planning with Proximity Sensing for Robot Arm Manipulators. 1. Introduction

Local Path Planning with Proximity Sensing for Robot Arm Manipulators. 1. Introduction Local Path Planning with Proximity Sensing for Robot Arm Manipulators Ewar Cheung an Vlaimir Lumelsky Yale University, Center for Systems Science Department of Electrical Engineering New Haven, Connecticut

More information

Directional Antenna based Time Division Scheduling in Wireless Ad hoc Networks

Directional Antenna based Time Division Scheduling in Wireless Ad hoc Networks Directional Antenna based Time Division Scheduling in Wireless Ad hoc Networks Li Shaohua and Dong-Ho Cho School of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology

More information

Enhancing Pipeline Network Performance Using Dual Interleaving Cluster Head Routing Protocol

Enhancing Pipeline Network Performance Using Dual Interleaving Cluster Head Routing Protocol 284 IJCSNS International Journal of Computer Science an Network Security, VOL.17 No.4, April 2017 Enhancing Pipeline Network Performance Using Dual Interleaving Cluster Hea Routing Protocol Siva Kumar

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.

More information

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,

More information

Adjusted Probabilistic Packet Marking for IP Traceback

Adjusted Probabilistic Packet Marking for IP Traceback Ajuste Probabilistic Packet Marking for IP Traceback Tao Peng, Christopher Leckie, an Kotagiri Ramamohanarao 2 ARC Special Research Center for Ultra-Broaban Information Networks Department of Electrical

More information

MODULE VII. Emerging Technologies

MODULE VII. Emerging Technologies MODULE VII Emerging Technologies Computer Networks an Internets -- Moule 7 1 Spring, 2014 Copyright 2014. All rights reserve. Topics Software Define Networking The Internet Of Things Other trens in networking

More information

Secure Network Coding for Distributed Secret Sharing with Low Communication Cost

Secure Network Coding for Distributed Secret Sharing with Low Communication Cost Secure Network Coing for Distribute Secret Sharing with Low Communication Cost Nihar B. Shah, K. V. Rashmi an Kannan Ramchanran, Fellow, IEEE Abstract Shamir s (n,k) threshol secret sharing is an important

More information

Mohammad Hossein Manshaei 1393

Mohammad Hossein Manshaei 1393 Mohammad Hossein Manshaei manshaei@gmail.com 1393 1 An Analytical Approach: Bianchi Model 2 Real Experimentations HoE on IEEE 802.11b Analytical Models Bianchi s Model Simulations ns-2 3 N links with the

More information

HOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM

HOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM HOW O SECURTY TECHNOLOGES NTERACT WTH EACH OTHER TO CREATE VALUE? THE ANALYSS O REWALL AN NTRUSON ETECTON SYSTEM Huseyin CAVUSOGLU Srinivasan RAGHUNATHAN Hasan CAVUSOGLU Tulane University University of

More information

Power Aware Routing using Power Control in Ad Hoc Networks

Power Aware Routing using Power Control in Ad Hoc Networks Power Aware Routing using Power Control in Ad Hoc Networks Eun-Sun Jung and Nitin H. Vaidya Dept. of Computer Science, Texas A&M University, College Station, TX 77843, USA Email: esjung@cs.tamu.edu, Dept.

More information

Multicast Routing : Computer Networking. Example Applications. Overview

Multicast Routing : Computer Networking. Example Applications. Overview Multicast outing 5-744: Computer Networking Unicast: one source to one estination Multicast: one source to many estinations Two main functions: Efficient ata istribution Logical naming of a group L-0 Multicast

More information

A Measurement Framework for Pin-Pointing Routing Changes

A Measurement Framework for Pin-Pointing Routing Changes A Measurement Framework for Pin-Pointing Routing Changes Renata Teixeira Univ. Calif. San Diego La Jolla, CA teixeira@cs.ucs.eu Jennifer Rexfor AT&T Labs Research Florham Park, NJ jrex@research.att.com

More information

Trailing Mobile Sinks: A Proactive Data Reporting Protocol for Wireless Sensor Networks

Trailing Mobile Sinks: A Proactive Data Reporting Protocol for Wireless Sensor Networks Trailing Mobile Sinks: A Proactive Data Reporting Protocol for Wireless Sensor Networks Xinxin Liu, Han Zhao, Xin Yang Computer & Information Science & Eng. University of Floria Email:{xinxin,han,xin}@cise.ufl.eu

More information

Performance Study of a Cross-Layer Based Multipath Routing Protocol for IEEE e Mobile Ad Hoc Networks

Performance Study of a Cross-Layer Based Multipath Routing Protocol for IEEE e Mobile Ad Hoc Networks I. J. Communications, Network an System Sciences, 2008, 4, 285-385 Publishe Online November 2008 in SciRes (http://www.scirp.org/journal/ijcns/). Performance Stuy of a Cross-Layer Base Multipath Routing

More information

Depth Sizing of Surface Breaking Flaw on Its Open Side by Short Path of Diffraction Technique

Depth Sizing of Surface Breaking Flaw on Its Open Side by Short Path of Diffraction Technique 17th Worl Conference on Nonestructive Testing, 5-8 Oct 008, Shanghai, China Depth Sizing of Surface Breaking Flaw on Its Open Sie by Short Path of Diffraction Technique Hiroyuki FUKUTOMI, Shan LIN an Takashi

More information

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science

More information

Performance Evaluation of Modified IEEE MAC for Multi-Channel Multi-Hop Ad Hoc Network *

Performance Evaluation of Modified IEEE MAC for Multi-Channel Multi-Hop Ad Hoc Network * Performance Evaluation of Modified IEEE 802.11 MAC for Multi-Channel Multi-Hop Ad Hoc Network * Jiandong LI ISN Lab., Xidian University JL384@cornell.edu Zygmunt J. Haas Cornell University haas@ece.cornell.edu

More information

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative

More information

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks 0 0 0 0 0 0 0 0 on-uniform Sensor Deployment in Mobile Wireless Sensor etworks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University Boca Raton,

More information

WLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic

WLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic WLAN Inoor Positioning Base on Eucliean Distances an Fuzzy Logic Anreas TEUBER, Bern EISSFELLER Institute of Geoesy an Navigation, University FAF, Munich, Germany, e-mail: (anreas.teuber, bern.eissfeller)@unibw.e

More information