Secure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals

Size: px
Start display at page:

Download "Secure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals"

Transcription

1 Int'l Conf. Wireless etworks ICW'16 51 Secure Wireless Multihop Transissions by Intentional Collisions with oise Wireless Signals Isau Shiada 1 and Hiroaki Higaki 1 1 Tokyo Denki University, Japan Abstract In wireless ultihop counication, data essages are transitted fro a source wireless node to a destination one along a wireless ultihop transission route consisting of a sequence of interediate wireless nodes. Each interediate wireless node forwards data essages to its next-hop wireless node. Here, a wireless signal carrying the data essage is broadcasted by using an oni antenna and it is not difficult for a eavesdropper wireless node to overhear the wireless signal to get the data essage. Soe researches show that it is useful to transit noise wireless signal which collide to the data essage wireless signal in order for interfering the overhearing. However, soe special devices such as directional antennas and/or high coputation power for coplicated signal processing are required. For wireless ultihop networks with huge nuber of wireless nodes, sall and cheap wireless nodes are andatory for construction of the network. This paper proposes the ethod for interfering the overhearing by the eavesdropper wireless nodes where routing protocol and data essage transission protocol with cooperative noise signal transissions by 1-hop and 2-hop neighbor wireless nodes of each interediate wireless node. Keywords: Wireless Multihop Counication, Interfering Overhearing, oise Wireless Signals, Intentional Collisions, Routing Protocol. 1. Introduction In wireless ad-hoc networks and wireless sensor networks, data essages are transitted along a wireless transission route fro a source wireless node to a destination one. A wireless transission route consists of a sequence of interediate wireless nodes which forward data essages fro its previous-hop wireless node to its next-hop one. Each interediate wireless node broadcasts a wireless signal for the data essage transission by using an oni directional antenna. Hence, it is possible for all its neighbor wireless nodes within its wireless transission range to receive the data essage. That is, the neighbor wireless node, even if it is an eavesdropper, overhears the data essage. Usually, the data essages are securely transitted by cryptography. The source wireless node encrypts a clear text and the data essage carries a cryptogra. In order for achieving the clear text fro the cryptogra in the overheard data essage, a cryptography key is required for both the destination wireless node and the eavesdropper wireless node. Especially, in sensor networks which transit and gather sensor data essages initiated by source sensor nodes with sensor and wireless counication devices to a wireless sink nodes connected to a high perforance sensor database, it is ipossible for each sensor node to ipleent highly secure cryptography ethods since its ipleentation, operation and aintenance costs should be low. Thus, even in sensor networks with siple and facile cryptography ethods, the sensor data is required to be transitted securely. For such a requireent, soe secure wireless transission ethods have been proposed as shown in the next section. One ethod requires each interediate wireless nodes to devise directional antennas and wireless signals are required to be transitted only in the specified direction by using a bea-foring ethod. The other one required each interediate wireless nodes to support high perforance signal processing with coplex calculation. However, it is difficult to introduce these conventional ethods to wireless ultihop networks consists of sall, light and cheap wireless nodes such as sensor nodes. Therefore, this paper proposes a novel secure wireless ultihop transission ethods without special hardwares such as directional antennas and/or processors supporting high perforance signal processing in each interediate wireless nodes. That is, under an assuption that wireless signals are transitted according to the unit disc odel [6] by using an oni antenna by each interediate wireless node, it akes difficult for eavesdropper wireless nodes to overhear the data essages transitted along a wireless ultihop transission route. The next section overviews related works. Our proposal for interfering the overhearing by eavesdropper wireless nodes by cooperation with neighbor wireless nodes of each interediate one is shown in Section 3. Both the routing and the data essage transission protocols are proposed. Section 4 evaluated our proposed ethod in siulation experients. 2. Related Works There are various security probles in wireless ultihop networks and a lot of solutions have been discussed and proposed. The selfish wireless node proble and the blackhole attack proble are well known peculiar probles in wireless ultihop networks. On the other hand, a so-tospeak eavesdropper proble is a coon one for wired and wireless networks and a countereasure solution is andatory. Especially in wireless networks, since all the data

2 52 Int'l Conf. Wireless etworks ICW'16 essages are carried by wireless signals which are inherently broadcasted and are easily overheard by any neighbor wireless node, uch ore advanced ethod has been required to be developed. The doinant technology is an cryptography. Due to the characteristics of the obile wireless nodes, siple and facile encryption/decryption ethods have been proposed for achieving enough security with reasonably low coputational coplexity. However, the cryptography is a ethod which akes difficult for eavesdroppers to achieve the clear text fro the cryptogra carried by the data essage. That is, it ay fall behind. Thus for taking the initiative, the ethod to ake difficult or ipossible for eavesdropper wireless nodes to overhear the data essages carrying the cryptogras is uch effective. The cobination of the ethod interfering the overhearing and the cryptography for wireless ultihop networks is expected to provide an acceptable tradeoff between required security and inevitable overhead. In wireless ultihop sensor networks and IoT (Internet of Things) consisting of huge nuber of low-power wireless nodes without coputational power enough to support highly secure counication ethods, a novel secure counication ethod not depending only on the cryptography is required. One of such ethods akes difficult for eavesdropper wireless nodes to overhear the transitted data essages by intentional collisions with noise wireless signals. Paper [2] proposes a ethod for secure wireless data essage transission under assuptions that bea foring by using directional antennas is available for all the wireless nodes (at least all the wireless nodes which is possible to transit data essages to their neighbor nodes). As shown in Figure 1, a sender wireless node s transit a wireless signal carrying a data essage to a receiver wireless node r by using bea foring such that r and only its liited neighbor wireless nodes receive it. Concurrently with the transission of the wireless signal, r also transits a noise wireless signal called a jaing wireless signal to all its neighbor wireless nodes through its oni antenna. Since the wireless signal transission range of the noise wireless signal covers the wireless signal transission range of the wireless signal carrying the data essage, no wireless node can receive the data essage itself without any collision. Here, one of the neighbor wireless node f of r forwards its receiving collided wireless signal which is the superposition of these wireless signals to r. On receipt of the collided wireless signal fro f, r reoves the original noise wireless signal fro the receiving wireless signal and achieves the original wireless signal carrying the data essage since the noise signal was transitted by r itself. This signal processing is only possible by r since no other wireless nodes even though f have the original noise wireless signal transitted by r. This sees an excellent secure counication ethod by using the intentional collisions with the noise wireless signals. However, the assuptions of the directional antennas for bea foring and high perforance processors f Fig. 1: Secure Wireless Transission by Intentional Collision with oise Wireless Signal and Forwarding Collided Message. for coplex signal processing to reove the noise wireless signals fro the collided wireless signals are not reasonable to apply to the wireless ultihop networks such as sensor networks and IoT. This is because the sensor nodes and the IoT devices ay be so sall, light and cheap and the their networks consist of huge nuber of such wireless nodes that it is difficult or ipossible to have such functionalities. Another paper [5] also discusses the ethod to realize secure wireless counication based on the noise wireless signal transissions. Here, a sender wireless node also transits a wireless signal carrying the data essage through a directional antenna for bea foring and all the other wireless nodes except for a receiver wireless node transit noise wireless signals siultaneously. Since the receipt wireless signal power is extreely high only at the receiver wireless node and the S/ ratio in the other wireless nodes is too low to receive (overhear) the data essage, the data essage is securely transitted fro the sender wireless node to the receiver one and eavesdropper wireless nodes also fail to receive the data essage. In addition to the requireent for the directional antennas in all the wireless nodes, high battery power consuption is an additional proble since all the wireless nodes are required to transit the noise wireless signals. 3. Proposal This section proposes a novel ethod for secure wireless ultihop transissions of data essages which interferes eavesdropper wireless nodes trying to achieve the clear texts carried by the data essages. Our ethod akes difficult for the eavesdropper wireless nodes to overhear the data essages which are broadcasted by interediate wireless nodes in a wireless ultihop transission route. Here, no additional special hardware such as directional antennas for bea foring and high perforance processors to support highly coplex signal processing is needed in the interediate wireless nodes. That is, the transissions of the wireless signals fro oni antennas of the wireless nodes are odeled by the unit disc odel [4].

3 Int'l Conf. Wireless etworks ICW' oise Signal Transission for Ad-Hoc Wireless Counications This section discusses the ethod for secure wireless transissions of data essages in wireless ad-hoc counication between neighbor wireless nodes, i.e., only 1-hop wireless transissions. Wireless nodes s and r are the sender and receiver ones, respectively. r is in the wireless signal transission range of s. A data essage is broadcasted by s to all the neighbor wireless node of s in the wireless signal transission range of s. Hence, r surely receives. At the sae tie all the neighbor wireless nodes including possible eavesdropper wireless nodes in the wireless signal transission range of s receive as shown in Figure2. In order to prevent to receive, noise wireless signals are introduced sae as the related works discussed in the previous section. Only noise wireless signals transitted by wireless nodes whose wireless signal transission ranges cover at least a part of the wireless signal transission range of s contribute to the secure wireless transission of fro s to r. At the sae tie, the noise wireless signal never reach r.if r is in the noise wireless signal transission range, r cannot receive due to the collision caused by and the noise wireless signal. Fig. 2: oise Wireless Signal Transissions by 1-Hop eighbor odes. This paper proposes the following conditions for a wireless node j to transit a noise wireless signal to prevent possible eavesdropper wireless node to receive the data essage transitted fro a sender wireless node s to a receiver one r (3). [oise Wireless Transitting ode j ] (1) j is a neighbor wireless node of s. j is in the wireless signal transission range of s. (2) j is not a neighbor wireless node of r. r is out of the wireless signal transission range of r. The condition (1) is a sufficient condition for the wireless signal transission range of j to cover a part of the wireless signal transission range of s. Since both and the noise wireless signal reach the wireless nodes in the coon area of both the wireless signal transission ranges, Fig. 3: oise Wireless Signal Transissions for Ad-Hoc Counication. a collision of the occurs at the wireless nodes. Hence the possible eavesdropper wireless nodes are prevented to receive by the collisions. In addition as discussed in the later subsection, the wireless nodes satisfying the condition (1) does not require any additional control essage transission to synchronously transit the noise wireless signals with fro s to r. Thus, this subsection proposes that the neighbor wireless nodes of s transit the noise wireless signals. The condition (2) is a necessary condition for the wireless signal transission range of j not to include r. Because of the assuption of the unit disc odel for the wireless signal transission range, r is out of the wireless signal transission range of j, either. Thus, the noise wireless signal fro j never reach r and no collisions between and the noise wireless signal occur at r. Thus, this subsection proposes that the neighbor wireless nodes of r do not transit the noise wireless signals. The wireless nodes satisfying both of the above two conditions are specified by the control essage transissions for the RTS/CTS control ipleented in the alost all the wireless LA protocols such as IEEE and so on. All the wireless nodes satisfying the condition (1) receive a RTS (Request to Send) control essage fro s and all the wireless nodes satisfying the condition (2) do not receive a CTS (Clear to Send) control essage fro r. The CTS control essage is transitted by r with the specified SIFS (Short Inter Frae Space) interval after receipt of the RTS control essage. Thus, if a wireless node j does not receive the RTS control essage fro r even with the SIFS interval after the receipt of the CTS control essage fro s, j transits a noise wireless signal to prevent possible eavesdropper wireless node in the wireless signal transission range of s to overhear a wireless signal carrying the data essage. In addition, since these RTS/CTS control essages carry AV inforation, it is also possible for j to specify the tie duration while the data essage is transitted fro s to r. That is,

4 54 Int'l Conf. Wireless etworks ICW'16 j can specify the tie duration for the noise wireless signal transissions. j is required to transit the noise wireless signal while the data essage is transitted fro s to s but it ust not transit it while the corresponding acknowledgent control essage is transitted fro r to s for avoidance of collisions of the wireless signal carrying the acknowledgent essage and the noise wireless signal. It is also realised based on the AV inforation. 3.2 oise Signal Transission for Wireless Multihop Counications The previous subsection proposes a ethod to prevent eavesdropper wireless nodes to overhear the data essage transitted between neighbor wireless nodes. Here, secure ad-hoc wireless counication is realized by noise wireless signals transitted by the neighbor wireless nodes of a sender wireless node out of the wireless signal transission range of a receiver wireless node. The wireless nodes and the tie duration required to transit the noise wireless signals are also specified by the RTS/CTS control essage transissions and no additional control essages are required to be transitted. However, the existence probability of the neighbor wireless nodes transitting the noise wireless signals preventing the overhearing of possible eavesdropper wireless nodes depends on the distribution of the wireless nodes, i.e., the density of the wireless nodes, and the distance s r between the sender wireless node s and the receiver one r. As shown in Figure 4, if the distance s r is relatively long, the coon area of the wireless signal transission ranges of s and r is sall and the area including the wireless nodes satisfying the conditions in the previous subsection is large. Hence, the coverage of the noise wireless signals overlapping the wireless signal transission range of s in which possible eavesdropper wireless nodes overhear the data essages is relatively high. On the other hand as shown in Figure 5, if s r is relative short, the coon area of the wireless signal transission range of s and r is sall. Since the wireless nodes in this area cannot transit the noise wireless signals which reach r, the coverage of the noise wireless signals overlapping the wireless signal transission range of s is relatively low and it is difficult to prevent eavesdropper wireless nodes to overhear the data essage. In order to solve the proble, additional wireless nodes are required to transit the noise wireless signals to iprove the coverage, i.e., the area where wireless nodes does not receive the noise wireless signals though they receive the data essage fro s is required to be reduced. It is clear that no wireless nodes in the wireless signal transission range of r can transit the noise wireless signals without collisions at r, noise wireless signal transissions by the wireless nodes out of the wireless transission ranges of both s and r are expected to be efficient. Therefore, wireless nodes out of the both wireless transission ranges of s and r are required to transit the noise wireless Fig. 4: Eavesdropper Interfering with Far Sender/Receiver Wireless odes. Fig. 5: Eavesdropper Interfering with ear Sender/Receiver Wireless odes. signals if its wireless signal transission range covers even a part of the wireless signal transission range of s. Such wireless nodes are 2-hop neighbor wireless nodes of s and are not 1-hop neighbor wireless nodes of r. Different fro the wireless nodes transitting the noise wireless signals for secure data essage transission in 1-hop ad-hoc counications discussed in the previous subsection, it is difficult to require the 2-hop neighbor wireless nodes of s to transit the noise wireless signals without additional control essages to the original RTS/CTS control. This is because the 2-hop neighbor wireless nodes are both out of the wireless signal transission ranges of s and r, additional control essages are required to be transitted to notify the to transit the noise wireless signals. In addition, it is ipossible for 1-hop neighbor wireless nodes of s to transit the additional control essage concurrently with the CTS control essage after receipt of the RTS control essage since the transitted control essage collides with the CTS control essage fro r at s. Therefore, the 2-hop neighbor wireless nodes of interediate wireless nodes being required to transit the noise wireless signals are deterined in a routing protocol which detects the wireless ultihop transission route 0... n which is a sequence of interediate

5 Int'l Conf. Wireless etworks ICW'16 55 wireless nodes fro a source wireless node s = 0 to a destination wireless node d = n. Since a certain control essages is transitted along the detected wireless ultihop transission route in ost of the ad-hoc routing protocols, each interediate wireless node transits soe control essages to notify a part of its 2-hop neighbor wireless nodes to be required to transit the noise wireless signals siultaneously with the data essage transissions. The 2-hop neighbor wireless nodes of s selected to transit the noise wireless signals according to the conditions for 1-hop ad-hoc counications described in the previous subsection are also required to transit the noise wireless signals for secure wireless ultihop counications. That is, 1-hop neighbor wireless nodes of an interediate wireless node i out of the wireless signal transission range of its next-hop wireless node i+1 is required to transit the noise wireless signals concurrently with the data essage transissions fro i to i+1. In addition to cover the wireless signal transission range of i by the noise wireless signal transission ranges to prevent eavesdropper wireless nodes to overhear the data essage, a part of the 2-hop neighbor wireless nodes are also required to transit the noise wireless signals. Though the transission ranges of the 2-hop neighbor nodes of i surely overlap the wireless signal transission range of s, they do not transit the noise wireless signals if r is their 1-hop neighbor wireless node for avoidance the collisions with the receiving data essage transissions at i+1. Therefore, for wireless ultihop data essage transissions fro a source wireless node s to a destination one d along the wireless ultihop transission route 0... n, the wireless nodes j satisfying the following conditions transits the noise wireless signals to prevent the data essages to be overheard by possible eavesdropper wireless nodes. [oise Wireless Signal Transitting ode j ] (1) A wireless node j is a 1-hop neighbor wireless node of i and in not a 1-hop neighbor wireless node of i+1. (2) j is not a 1-hop neighbor wireless node of i and i+1 either and a 2-hop neighbor wireless node of both i and i Protocol 4. Evaluation This section evaluates the coverage of the wireless signal transission ranges of the interediate wireless nodes of the wireless ultihop transission routes by the noise wireless signals transitted in accordance with the proposed ethod in siulation experients. A wireless transission range of a wireless node is 10 and its 1-hop and 2-hop neighbor nodes are randoly distributed according to the unique distribution randoness. Here average nubers of neighbor wireless nodes are 0 20 and the distance between an interediate wireless node and its next-hop wireless node is For each density of i-1 i i+1 i+2 Fig. 6: oise Wireless Signal Transissions for Wireless Multihop Counication. i-1 Jreq( i) i Rrep i+1 Jreq( ) i+1 i+2 Fig. 7: Routing Protocol with Selection of 2-Hop eighbor Wireless odes Transitting oise Wireless Signal. the wireless nodes and the distance between the successive interediate wireless nodes, the coverage is evaluated for 1,000 different distributions of the wireless nodes. For each distributions of the wireless nodes, the coverage of the wireless signal transission ranges of the interediate wireless nodes along the wireless ultihop transission routes by the noise wireless signal transission ranges for the following three cases: (1) Only 1-hop neighbor wireless nodes of the interediate wireless nodes satisfying the proposed conditions transit the noise wireless signals. (2) All the 1-hop neighbor wireless nodes of the interediate wireless nodes and the 2-hop ones satisfying the proposed conditions transit the noise wireless signals. (3) All the 1-hop neighbor wireless nodes of the interediate wireless nodes and only the liited 2-hop neighbor wireless nodes which is a neighbor of the 1- hop neighbor wireless nodes which transit the noise wireless signals transit the noise wireless signals. Figure 8 shows the results of the siulation experients. The coverage onotonically increases according to the average nubers of neighbor wireless nodes, i.e., the total

6 56 Int'l Conf. Wireless etworks ICW'16 nubers of wireless nodes in siulation and the distance between the source and the destination wireless nodes. In the (1) case, the coverage for the low density of neighbor wireless nodes and the short distance between the successive interediate wireless nodes is relatively low. However, in the (3) case, the coverage is sufficiently iproved by introduction of the noise wireless signal transissions by the 2-hop neighbor wireless nodes of the interediate wireless node. [6]Urrutia, J., Two Probles on Discrete and Coputational Geoetry, Proceedings of Japan Conference on Discrete and Coputational Geoetry, pp (1999) (1) (2) (3) Fig. 8: oise Wireless Signal Coverage. 5. Concluding Rearks This paper proposes a novel secure wireless ultihop data essage transissions by the intentional collisions with the noise wireless signals. Here, the noise wireless signals are transitted by a part of the 1-hop and 2-hop neighbor wireless nodes of the interediate wireless nodes to ake difficult for possible eavesdropper wireless nodes to overhear the data essages. To select the neighbor wireless nodes transitting the noise wireless signals, we extends AODV routing protocol with additional control essages. The results of the siulation experients show that the coverage of the noise wireless signals is reasonably high. In future work, we will further extend the routing and data essage transission protocol to increase the nuber of 2- hop neighbor wireless nodes transitting the noise wireless signals to ake ore secure wireless ultihop counications and will evaluate the perforance of our proposed ethod in wireless ultihop counication environents. References [1]Boneh, D., Dunworth, C. and Lipton, R.J., Breaking DES Using a Molecular Coputer, Proceedings of the 1st International Workshop on DA Based Coputers, pp (1995). [2]He, X. and Yener, A., Two-Hop Secure Counication Using an Untrusted Relay: A Case for Cooperative Jaing, Proceedings of the IEEE Global Telecounications Conference 2008 (2008). [3]Kanachi, T. and Higaki, H., Wireless Multihop Transissions for Secret Sharing Counication, Proceedings of the 14th IEEE International Conference on Scalable Coputing and Counications, pp (2014). [4]Kranakis, E., Singh, H. and Urrutia, J., Copass Routing on Geoetric etworks, Proceedings of the 11th Canadian Conference on Coputational Geoetry, pp (1999). [5]Tekin, E. and Yener, A., The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Avhievable Rates and Cooperative Jaing, IEEE Transactions on Inforation Theory, Vol. 54, o. 6, pp (2008).

COLLABORATIVE BEAMFORMING FOR WIRELESS AD-HOC NETWORKS

COLLABORATIVE BEAMFORMING FOR WIRELESS AD-HOC NETWORKS International Journal of Coputer Science and Counication Vol. 3, No. 1, January-June 2012, pp. 181-185 COLLABORATIVE BEAMFORMING FOR WIRELESS AD-HOC NETWORKS A.H. Karode 1, S.R. Suralkar 2, Manoj Bagde

More information

Cooperative Watchdog in Wireless Ad-Hoc Networks Norihiro SOTA and Hiroaki HIGAKI *

Cooperative Watchdog in Wireless Ad-Hoc Networks Norihiro SOTA and Hiroaki HIGAKI * 2017 2nd International Conference on Computer, Network Security and Communication Engineering (CNSCE 2017) ISBN: 978-1-60595-439-4 Cooperative Watchdog in Wireless Ad-Hoc Networks Norihiro SOTA and Hiroaki

More information

The Flaw Attack to the RTS/CTS Handshake Mechanism in Cluster-based Battlefield Self-organizing Network

The Flaw Attack to the RTS/CTS Handshake Mechanism in Cluster-based Battlefield Self-organizing Network The Flaw Attack to the RTS/CTS Handshake Mechanis in Cluster-based Battlefield Self-organizing Network Zeao Zhao College of Counication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China National

More information

Integrating fast mobility in the OLSR routing protocol

Integrating fast mobility in the OLSR routing protocol Integrating fast obility in the OLSR routing protocol Mounir BENZAID 1,2, Pascale MINET 1 and Khaldoun AL AGHA 1,2 1 INRIA, Doaine de Voluceau - B.P.105, 78153 Le Chesnay Cedex, FRANCE ounir.benzaid, pascale.inet@inria.fr

More information

Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols

Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols Navodaya Garepalli Kartik Gopalan Ping Yang Coputer Science, Binghaton University (State University of New York) Contact:

More information

Image Filter Using with Gaussian Curvature and Total Variation Model

Image Filter Using with Gaussian Curvature and Total Variation Model IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.

More information

DYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION

DYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION www.arpnjournals.co DYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION N. Snehalatha 1 and Paul Rodrigues 2 1 School of Coputing, SRM University, Chennai, Tail Nadu, India 2 Departent

More information

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng

More information

A wireless sensor network for visual detection and classification of intrusions

A wireless sensor network for visual detection and classification of intrusions A wireless sensor network for visual detection and classification of intrusions ANDRZEJ SLUZEK 1,3, PALANIAPPAN ANNAMALAI 2, MD SAIFUL ISLAM 1 1 School of Coputer Engineering, 2 IntelliSys Centre Nanyang

More information

Distributed Multicast Tree Construction in Wireless Sensor Networks

Distributed Multicast Tree Construction in Wireless Sensor Networks Distributed Multicast Tree Construction in Wireless Sensor Networks Hongyu Gong, Luoyi Fu, Xinzhe Fu, Lutian Zhao 3, Kainan Wang, and Xinbing Wang Dept. of Electronic Engineering, Shanghai Jiao Tong University,

More information

Analysing Real-Time Communications: Controller Area Network (CAN) *

Analysing Real-Time Communications: Controller Area Network (CAN) * Analysing Real-Tie Counications: Controller Area Network (CAN) * Abstract The increasing use of counication networks in tie critical applications presents engineers with fundaental probles with the deterination

More information

Adaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN

Adaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN Proceedings of the nd International onference on oputer Science and Electronics Engineering (ISEE 3) Adaptive Paraeter Estiation Based ongestion Avoidance Strategy for DTN Qicai Yang, Futong Qin, Jianquan

More information

The optimization design of microphone array layout for wideband noise sources

The optimization design of microphone array layout for wideband noise sources PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun

More information

Dynamical Topology Analysis of VANET Based on Complex Networks Theory

Dynamical Topology Analysis of VANET Based on Complex Networks Theory BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volue 14, Special Issue Sofia 014 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.478/cait-014-0053 Dynaical Topology Analysis

More information

A Novel Fast Constructive Algorithm for Neural Classifier

A Novel Fast Constructive Algorithm for Neural Classifier A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore

More information

Multi Packet Reception and Network Coding

Multi Packet Reception and Network Coding The 2010 Military Counications Conference - Unclassified Progra - etworking Protocols and Perforance Track Multi Packet Reception and etwork Coding Aran Rezaee Research Laboratory of Electronics Massachusetts

More information

Redundancy Level Impact of the Mean Time to Failure on Wireless Sensor Network

Redundancy Level Impact of the Mean Time to Failure on Wireless Sensor Network (IJACSA) International Journal of Advanced Coputer Science and Applications Vol. 8, No. 1, 217 Redundancy Level Ipact of the Mean Tie to Failure on Wireless Sensor Network Alaa E. S. Ahed 1 College of

More information

PERFORMANCE ANALYSIS OF THE UMTS SYSTEM FOR PACKET DATA TRANSFER OVER DEDICATED CHANNELS

PERFORMANCE ANALYSIS OF THE UMTS SYSTEM FOR PACKET DATA TRANSFER OVER DEDICATED CHANNELS PERFORMACE AALSIS OF THE MTS SSTEM FOR PACKET DATA TRASFER OVER DEDICATED CHAELS Manju Sarvagya, Ratna V. Raja Kuar Departent of Electronics and Electrical Counication Engineering Indian Institute of Technology,

More information

Improve Peer Cooperation using Social Networks

Improve Peer Cooperation using Social Networks Iprove Peer Cooperation using Social Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Noveber 5, 2007 Corresponding

More information

Research Article A Game Theory Based Congestion Control Protocol for Wireless Personal Area Networks

Research Article A Game Theory Based Congestion Control Protocol for Wireless Personal Area Networks Journal of Sensors Volue 216, Article ID 61683, 13 pages http://dx.doi.org/1.11/216/61683 Research Article A Gae Theory Based Congestion Control Protocol for Wireless Personal Area Networks Chuang Ma,

More information

Performance Analysis of Exposed Terminal Effect in IEEE Ad Hoc Networks in Finite Load Conditions

Performance Analysis of Exposed Terminal Effect in IEEE Ad Hoc Networks in Finite Load Conditions Perforance Analysis of Exposed Terinal Effect in IEEE 80.11 Ad Hoc Networks in Finite Load Conditions Diitris Vassis 1, Georgios Korentzas 1 1 Dept. of Inforation and Counication Systes Engineering University

More information

Lighting Control System with Low Rate Network Green Computing System. Abstract

Lighting Control System with Low Rate Network Green Computing System. Abstract The 2 nd RMUTP International Conference 2010 Page 24 Lighting Control Syste with Low Rate Network Green Coputing Syste Wanapun Waiyawut Departent of Coputer Engineering, Faculty of Engineering, Rajaangala

More information

Evaluation of the Timing Properties of Two Control Networks: CAN and PROFIBUS

Evaluation of the Timing Properties of Two Control Networks: CAN and PROFIBUS Evaluation of the Tiing Properties of Two Control Networs: CAN and PROFIBUS Max Mauro Dias Santos 1, Marcelo Ricardo Steer 2 and Francisco Vasques 3 1 UnilesteMG, CEP 35170-056, Coronel Fabriciano MG Brasil.

More information

Equation Based Congestion Control for Video Transmission over WCDMA Networks

Equation Based Congestion Control for Video Transmission over WCDMA Networks Equation Based Congestion Control for Video Transission over WCDMA Networks Antonios Alexiou, Diitrios Antonellis and Christos Bouras Research Acadeic Coputer Technology Institute, Greece and Coputer Engineering

More information

MAC schemes - Fixed-assignment schemes

MAC schemes - Fixed-assignment schemes MAC schees - Fixed-assignent schees M. Veeraraghavan, April 6, 04 Mediu Access Control (MAC) schees are echaniss for sharing a single link. MAC schees are essentially ultiplexing schees. For exaple, on

More information

Multipath Selection and Channel Assignment in Wireless Mesh Networks

Multipath Selection and Channel Assignment in Wireless Mesh Networks Multipath Selection and Channel Assignent in Wireless Mesh Networs Soo-young Jang and Chae Y. Lee Dept. of Industrial and Systes Engineering, KAIST, 373-1 Kusung-dong, Taejon, Korea Tel: +82-42-350-5916,

More information

An Adaptive and Low-latency Power Management Protocol for Wireless Sensor Networks

An Adaptive and Low-latency Power Management Protocol for Wireless Sensor Networks An Adaptive and Low-latency Power Manageent Protocol for Wireless Sensor Networks Giuseppe Anastasi, Marco Conti*, Mario Di Francesco, Andrea Passarella* Pervasive Coputing & Networking Lab. (PerLab) Departent

More information

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,

More information

Feature Based Registration for Panoramic Image Generation

Feature Based Registration for Panoramic Image Generation IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh

More information

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,

More information

Adaptive Holistic Scheduling for In-Network Sensor Query Processing

Adaptive Holistic Scheduling for In-Network Sensor Query Processing Adaptive Holistic Scheduling for In-Network Sensor Query Processing Hejun Wu and Qiong Luo Departent of Coputer Science and Engineering Hong Kong University of Science & Technology Clear Water Bay, Kowloon,

More information

Enhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue

Enhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade

More information

An Adaptive Low-latency Power Management Protocol for Wireless Sensor Networks

An Adaptive Low-latency Power Management Protocol for Wireless Sensor Networks An Adaptive Low-latency Power Manageent Protocol for Wireless Sensor Networks Giuseppe Anastasi, Marco Conti*, Mario Di Francesco, Andrea Passarella* Pervasive Coputing & Networking Lab. (PerLab) Departent

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI

More information

BP-MAC: A High Reliable Backoff Preamble MAC Protocol for Wireless Sensor Networks

BP-MAC: A High Reliable Backoff Preamble MAC Protocol for Wireless Sensor Networks BP-MAC: A High Reliable Backoff Preable MAC Protocol for Wireless Sensor Networks Alexander Klein* Jirka Klaue Josef Schalk EADS Innovation Works, Gerany *Eail: klein@inforatik.uni-wuerzburg.de ABSTRACT:

More information

QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS

QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755

More information

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles

More information

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,

More information

Different criteria of dynamic routing

Different criteria of dynamic routing Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich

More information

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University

More information

Data Caching for Enhancing Anonymity

Data Caching for Enhancing Anonymity Data Caching for Enhancing Anonyity Rajiv Bagai and Bin Tang Departent of Electrical Engineering and Coputer Science Wichita State University Wichita, Kansas 67260 0083, USA Eail: {rajiv.bagai, bin.tang}@wichita.edu

More information

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural

More information

Energy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks

Energy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr

More information

Closing The Performance Gap between Causal Consistency and Eventual Consistency

Closing The Performance Gap between Causal Consistency and Eventual Consistency Closing The Perforance Gap between Causal Consistency and Eventual Consistency Jiaqing Du Călin Iorgulescu Aitabha Roy Willy Zwaenepoel EPFL ABSTRACT It is well known that causal consistency is ore expensive

More information

A Periodic Dynamic Load Balancing Method

A Periodic Dynamic Load Balancing Method 2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation

More information

FINITE STATE DESCRIPTION OF COMMUNICATION PROTOCOLS*

FINITE STATE DESCRIPTION OF COMMUNICATION PROTOCOLS* irnper neuvork protocols. A. Danthine. editor, 'iniversite de liege. I'->7X. F3 FINITE STATE DESCRIPTION OF COMMUNICATION PROTOCOLS* Gregor V. Bochann Departeent de Matheatiques Ecole Polytechnique Federals

More information

An Efficient Approach for Content Delivery in Overlay Networks

An Efficient Approach for Content Delivery in Overlay Networks An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr

More information

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University

More information

On the Accuracy of MANET Simulators

On the Accuracy of MANET Simulators On the ccuracy of MNT Siulators avid avin david.cavin@epfl.ch Yoav Sasson yoav.sasson@epfl.ch istributed Systes Laboratory cole Polytechnique Fédérale de Lausanne (PFL) H-115 Lausanne ndré Schiper andre.schiper@epfl.ch

More information

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented

More information

Relocation of Gateway for Enhanced Timeliness in Wireless Sensor Networks Abstract 1. Introduction

Relocation of Gateway for Enhanced Timeliness in Wireless Sensor Networks Abstract 1. Introduction Relocation of ateway for Enhanced Tieliness in Wireless Sensor Networks Keal Akkaya and Mohaed Younis Departent of oputer Science and Electrical Engineering University of Maryland, altiore ounty altiore,

More information

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3 2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition

More information

Database Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2

Database Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2 2nd International Conference on Advances in Mechanical Engineering and Industrial Inforatics (AMEII 206) Database Design on Mechanical Equipent Manageent Syste Zheng Qiu, Wu kaiyuan, Wu Chengyan, Liu Lei2

More information

Collaborative Web Caching Based on Proxy Affinities

Collaborative Web Caching Based on Proxy Affinities Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA

More information

Relief shape inheritance and graphical editor for the landscape design

Relief shape inheritance and graphical editor for the landscape design Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru

More information

IN many interactive multimedia streaming applications, such

IN many interactive multimedia streaming applications, such 840 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 8, NO. 5, MAY 06 A Geoetric Approach to Server Selection for Interactive Video Streaing Yaochen Hu, Student Meber, IEEE, DiNiu, Meber, IEEE, and Zongpeng Li, Senior

More information

MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer

MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer Departent of Coputer Science and Engineering University of South Florida Tapa, FL 33620 Abstract -- The

More information

EUROPEAN ETS TELECOMMUNICATION August 1995 STANDARD

EUROPEAN ETS TELECOMMUNICATION August 1995 STANDARD EUROPEAN ETS 300 428 TELECOMMUNICATION August 1995 STANDARD Source: ETSI TC-NA Reference: DE/NA-052619 ICS: 33.040 Key words: B-ISDN, ATM Broadband Integrated Services Digital Network (B-ISDN); Asynchronous

More information

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical

More information

Joint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points

Joint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points Joint Measureent- and Traffic Descriptor-based Adission Control at Real-Tie Traffic Aggregation Points Stylianos Georgoulas, Panos Triintzios and George Pavlou Centre for Counication Systes Research, University

More information

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of

More information

Modeling Parallel Applications Performance on Heterogeneous Systems

Modeling Parallel Applications Performance on Heterogeneous Systems Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln

More information

A Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage

A Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage 216 IEEE 23rd International Conference on High Perforance Coputing A Low-Cost Multi-Failure Resilient Replication Schee for High Data Availability in Cloud Storage Jinwei Liu* and Haiying Shen *Departent

More information

Efficient and Strategyproof Spectrum Allocations in Multi-Channel Wireless Networks

Efficient and Strategyproof Spectrum Allocations in Multi-Channel Wireless Networks Efficient and Strategyproof Spectru Allocations in Multi-Channel Wireless Networks Ping Xu, Xiang-Yang Li, Senior Meber, IEEE, ShaoJie Tang, and JiZhong Zhao Abstract In this paper, we study the spectru

More information

Performance Analysis of RAID in Different Workload

Performance Analysis of RAID in Different Workload Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,

More information

Development of a Computer Application to Simulate Porous Structures

Development of a Computer Application to Simulate Porous Structures Vol. Materials 5, No. Research, 3, 00Vol. 5, No. 3, 75-79, 00. Developent of a Coputer Application to Siulate Porous Structures 00 75 Developent of a Coputer Application to Siulate Porous Structures S.C.

More information

Modeling epidemic data diffusion for wireless mobile networks

Modeling epidemic data diffusion for wireless mobile networks WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Coun. Mob. Coput. (212) Published online in Wiley Online Library (wileyonlinelibrary.co)..2233 RESEARCH ARTICLE Modeling epideic data diffusion for wireless

More information

Virtual source-based minimum interference path multicast routing in optical virtual private networks

Virtual source-based minimum interference path multicast routing in optical virtual private networks Photon Netw Coun (2007) 13:19 30 DOI 10.1007/s11107-006-0012-7 ORIGINAL ARTICLE Virtual source-based iniu interference path ulticast routing in optical virtual private networks Jun-Mo Jo Suk-Jin Lee Kyung-Dong

More information

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.

More information

QoS and Sensible Routing Decisions

QoS and Sensible Routing Decisions QoS and Sensible Routing Decisions Erol Gelenbe Dept. of Electrical & Electronic Engineering Iperial College London SW7 2BT e.gelenbe@iperial.ac.uk Abstract Network Quality of Service (QoS) criteria of

More information

Deterministic Voting in Distributed Systems Using Error-Correcting Codes

Deterministic Voting in Distributed Systems Using Error-Correcting Codes IEEE TRASACTIOS O PARALLEL AD DISTRIBUTED SYSTEMS, VOL. 9, O. 8, AUGUST 1998 813 Deterinistic Voting in Distributed Systes Using Error-Correcting Codes Lihao Xu and Jehoshua Bruck, Senior Meber, IEEE Abstract

More information

Compiling an Honest but Curious Protocol

Compiling an Honest but Curious Protocol 6.876/18.46: Advanced Cryptography May 7, 003 Lecture 1: Copiling an Honest but Curious Protocol Scribed by: Jonathan Derryberry 1 Review In previous lectures, the notion of secure ultiparty coputing was

More information

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints 519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka

More information

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The

More information

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We

More information

Data Acquisition of Obstacle Shapes for Fish Robots

Data Acquisition of Obstacle Shapes for Fish Robots Proceedings of the 2nd WEA International Conference on Dynaical ystes and Control, Bucharest, oania, October -17, 6 Data Acquisition of Obstacle hapes for Fish obots EUNG Y. NA, DAEJUNG HIN, JIN Y. KIM,

More information

Privacy-preserving String-Matching With PRAM Algorithms

Privacy-preserving String-Matching With PRAM Algorithms Privacy-preserving String-Matching With PRAM Algoriths Report in MTAT.07.022 Research Seinar in Cryptography, Fall 2014 Author: Sander Sii Supervisor: Peeter Laud Deceber 14, 2014 Abstract In this report,

More information

Efficient file search in non-dht P2P networks

Efficient file search in non-dht P2P networks Available online at www.sciencedirect.co Coputer Counications 3 (28) 34 37 www.elsevier.co/locate/coco Efficient file search in non-dht P2P networks Shiping Chen a, Zhan Zhang b, *, Shigang Chen b, Baile

More information

A CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER

A CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER A CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER VIOLETA TOMAŠEVIĆ, SLOBODAN BOJANIĆ 2 and OCTAVIO NIETO-TALADRIZ 2 The Mihajlo Pupin Institute, Volgina 5, 000 Belgrade, SERBIA AND MONTENEGRO 2 Technical University

More information

Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues

Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu

More information

Energy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networks

Energy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networks Energy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networs F. Mousavi Madani Departent of coputer engineering Alzahra University Tehran, Iran, osavif@alzahra.ac.ir Received:

More information

An Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks

An Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks An Ad Hoc Adaptive Hashing Technique for Non-Uniforly Distributed IP Address Lookup in Coputer Networks Christopher Martinez Departent of Electrical and Coputer Engineering The University of Texas at San

More information

The Boundary Between Privacy and Utility in Data Publishing

The Boundary Between Privacy and Utility in Data Publishing The Boundary Between Privacy and Utility in Data Publishing Vibhor Rastogi Dan Suciu Sungho Hong ABSTRACT We consider the privacy proble in data publishing: given a database instance containing sensitive

More information

Rule Extraction using Artificial Neural Networks

Rule Extraction using Artificial Neural Networks Rule Extraction using Artificial Neural Networks S. M. Karuzzaan 1 Ahed Ryadh Hasan 2 Abstract Artificial neural networks have been successfully applied to a variety of business application probles involving

More information

Galois Homomorphic Fractal Approach for the Recognition of Emotion

Galois Homomorphic Fractal Approach for the Recognition of Emotion Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,

More information

Minimax Sensor Location to Monitor a Piecewise Linear Curve

Minimax Sensor Location to Monitor a Piecewise Linear Curve NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location to Monitor a Piecewise Linear Curve To M. Cavalier The Pennsylvania State University University Par, PA 680 Whitney A. Conner

More information

Sherlock is Around: Detecting Network Failures with Local Evidence Fusion

Sherlock is Around: Detecting Network Failures with Local Evidence Fusion Sherlock is Around: Detecting Network Failures with Local Evidence Fusion Qiang Ma, Kebin Liu 2, Xin Miao, Yunhao Liu,2 Departent of Coputer Science and Engineering, Hong Kong University of Science and

More information

Resource Optimization for Web Service Composition

Resource Optimization for Web Service Composition Resource Optiization for Web Coposition Xia Gao, Ravi Jain, Zulfikar Razan, Ulas Kozat Abstract coposition recently eerged as a costeffective way to quickly create new services within a network. Soe research

More information

Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization

Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization 1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,

More information

Content-Centric Multicast Beamforming in Cache-Enabled Cloud Radio Access Networks

Content-Centric Multicast Beamforming in Cache-Enabled Cloud Radio Access Networks Content-Centric Multicast Beaforing in Cache-Enabled Cloud Radio Access Networks Hao Zhou, Meixia Tao, Erkai Chen, Wei Yu *Dept. of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China

More information

M Software management

M Software management M Software anageent This docuent is part of the UCISA Inforation Security Toolkit providing guidance on the policies and processes needed to ipleent an organisational inforation security policy. To use

More information

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao

More information

IQ246 Controller. Data Sheet IQ246 CONTROLLER. Description. Features. Physical

IQ246 Controller. Data Sheet IQ246 CONTROLLER. Description. Features. Physical IQ26 Controller IQ26 CONTROLLER Description Features The IQ26 controller is designed to provide a sall footprint with relatively high capacity of inputs and ouputs and can be used for the control of all

More information

Problem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm

Problem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm Proble Solving of graph correspondence using Genetics Algorith and ACO Algorith Alireza Rezaee, 1, Azizeh Ajalli 2 Assistant professor,departent of Mechatronics Engineering, Faculty of New Sciences and

More information

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se

More information

COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT

COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT B.BOOBA 1 Dr. T.V.GOPAL 2 1 Research Scholar, Assist. Professor(Sl.Gr),Departent of Coputer Applications, Easwari

More information

Research on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm

Research on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm roceedings of the 7th International Conference on Innovation & Manageent 893 Research on a Kind of QoS-Sensitive Seantic Web Services Coposition Method Based on Genetic Algorith Cao Hongjiang, Nie Guihua,

More information

9 th European Conference on the Mathematics of Oil Recovery Cannes, France, 30 August - 2 September 2004

9 th European Conference on the Mathematics of Oil Recovery Cannes, France, 30 August - 2 September 2004 1 PARALLEL WELL LOCAION OPIMIZAION USING SOCHASIC ALGORIHMS ON HE GRID COMPUAIONAL FRAMEWORK Hector Klie 1, Wolfgang Bangerth 1,2, Mary F Wheeler 1, Manish Parashar 3 and Vincent Matossian 3 1 Center for

More information

Construction of a regular hendecagon by two-fold origami

Construction of a regular hendecagon by two-fold origami J. C. LUCERO /207 Construction of a regular hendecagon by two-fold origai Jorge C. Lucero 1 Introduction Single-fold origai refers to geoetric constructions on a sheet of paper by perforing a sequence

More information

Predicting x86 Program Runtime for Intel Processor

Predicting x86 Program Runtime for Intel Processor Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given

More information