Contact The DL Team Contact Us | Switch to tabbed view

top of pageABSTRACT

QSM is a multicast engine designed to support a style of distributed programming in which application objects are replicated among clients and updated via multicast. The model requires platforms that scale in dimensions previously unexplored; in particular, to large numbers of multicast groups. Prior systems we-ren’t optimized for such scenarios and can’t take ad-vantage of regular group overlap patterns, a key fea-ture of our application domain. Furthermore, little is known about performance and scalability of such sys-tems in modern managed environments. We shed light on these issues and offer architectural insights based on our experience building QSM.
Advertisements



top of pageAUTHORS



Author image not provided  Krzysztof Ostrowski

No contact information provided yet.

Bibliometrics: publication history
Publication years2006-2010
Publication count15
Citation Count42
Available for download6
Downloads (6 Weeks)4
Downloads (12 Months)33
Downloads (cumulative)1,257
Average downloads per article209.50
Average citations per article2.80
View colleagues of Krzysztof Ostrowski


Ken Birman Ken Birman

homepage
kenatcs.cornell.edu
Bibliometrics: publication history
Publication years1982-2014
Publication count192
Citation Count2,871
Available for download59
Downloads (6 Weeks)165
Downloads (12 Months)1,909
Downloads (cumulative)48,750
Average downloads per article826.27
Average citations per article14.95
View colleagues of Ken Birman


Author image not provided  Danny Dolev

No contact information provided yet.

Bibliometrics: publication history
Publication years1981-2016
Publication count159
Citation Count2,942
Available for download61
Downloads (6 Weeks)105
Downloads (12 Months)1,027
Downloads (cumulative)28,880
Average downloads per article473.44
Average citations per article18.50
View colleagues of Danny Dolev

top of pageREFERENCES

References are not available

top of pageCITED BY

9 Citations

 
 
 
 
 
 

top of pageINDEX TERMS

Index Terms are not available

top of pagePUBLICATION

Title NCA '08 Proceedings of the 2008 Seventh IEEE International Symposium on Network Computing and Applications table of contents
Pages 9-18
Publication Date2008-07-10 (yyyy-mm-dd)
PublisherIEEE Computer Society Washington, DC, USA ©2008
ISBN: 978-0-7695-3192-2 doi>10.1109/NCA.2008.33

top of pageREVIEWS


Reviews are not available for this item
Computing Reviews logo

top of pageCOMMENTS

Be the first to comment To Post a comment please sign in or create a free Web account

top of pageTable of Contents

Proceedings of the 2008 Seventh IEEE International Symposium on Network Computing and Applications
Table of Contents
Cover Art
Page: C1
doi>10.1109/NCA.2008.62
Available formats: Publisher SitePublisher Site
Title Page i
Page: i
doi>10.1109/NCA.2008.1
Available formats: Publisher SitePublisher Site
Title Page iii
Page: iii
doi>10.1109/NCA.2008.2
Available formats: Publisher SitePublisher Site
Copyright Page
Page: iv
doi>10.1109/NCA.2008.3
Available formats: Publisher SitePublisher Site
Message from the Program Committee
Page: x
doi>10.1109/NCA.2008.4
Available formats: Publisher SitePublisher Site
External Reviewers
Page: xv
doi>10.1109/NCA.2008.7
Available formats: Publisher SitePublisher Site
Sponsors
Page: xvi
doi>10.1109/NCA.2008.58
Available formats: Publisher SitePublisher Site
Invited Keynotes
Pages: xvii-xviii
doi>10.1109/NCA.2008.59
Available formats: Publisher SitePublisher Site
APART: Low Cost Active Replication for Multi-tier Data Acquisition Systems
Paolo Romano, Diego Rughetti, Francesco Quaglia, Bruno Ciciani
Pages: 1-8
doi>10.1109/NCA.2008.52
Available formats: Publisher SitePublisher Site

This paper proposes APART (A Posteriori Active ReplicaTion),a novel active replication protocol specifically tailored formulti-tier data acquisition systems.Unlike existing active replication solutions, APART does not rely ona-priori coordination schemes ...
expand
Quicksilver Scalable Multicast (QSM)
Krzysztof Ostrowski, Ken Birman, Danny Dolev
Pages: 9-18
doi>10.1109/NCA.2008.33
Available formats: Publisher SitePublisher Site

QSM is a multicast engine designed to support a style of distributed programming in which application objects are replicated among clients and updated via multicast. The model requires platforms that scale in dimensions previously unexplored; in particular, ...
expand
FOSeL: Filtering by Helping an Overlay Security Layer to Mitigate DoS Attacks
Hakem Beitollahi, Geert Deconinck
Pages: 19-28
doi>10.1109/NCA.2008.23
Available formats: Publisher SitePublisher Site

Denial of service (DoS) attacks are major threat againstavailability in the Internet. A large number of countermea-sure techniques try to detect attack and then filter out DoSattack packets. Unfortunately these techniques that filterDoS traffic by looking ...
expand
Execution Patterns in Automatic Malware and Human-Centric Attacks
Mohammed Gadelrab, Anas Abou El Kalam, Yves Deswarte
Pages: 29-36
doi>10.1109/NCA.2008.37
Available formats: Publisher SitePublisher Site

With the massive surges of new malware, the ‎intuitive detection techniques currently used in most ‎security tools deem ineffective. Consequently, we ‎urgently need better solutions that are established on ‎solid theoretical basis. ...
expand
Finite Memory: A Vulnerability of Intrusion-Tolerant Systems
Giuliana Santos Veronese, Miguel Correia, Lau Cheuck Lung, Paulo Verissimo
Pages: 37-44
doi>10.1109/NCA.2008.40
Available formats: Publisher SitePublisher Site

In environments like the Internet, faults follow unusualpatterns, dictated by the combination of malicious attackswith accidental faults such as long communication delayscaused by temporary network partitions. In this scenario,attackers can force buffer ...
expand
FaSReD: Fast and Scalable Resource Discovery in Support of Multiple Resource Range Requirements for Computational Grids
Denvil Smith, Nian-Feng Tzeng, Milad M. Ghantous
Pages: 45-51
doi>10.1109/NCA.2008.14
Available formats: Publisher SitePublisher Site

Distributed Grid resource discovery (ReD) systems lack the ability to adapt efficiently to an increase in the number of attributes. The main contribution of this paper is a fast and scalable ReD mechanism, dubbed FaSReD, which composes a resource key ...
expand
A Fast and Robust Content-based Publish/Subscribe Architecture
Hojjat Jafarpour, Sharad Mehrotra, Nalini Venkatasubramanian
Pages: 52-59
doi>10.1109/NCA.2008.51
Available formats: Publisher SitePublisher Site

We present cluster-based publish/subscribe, a novel architecture that is not only resilient to event broker failures but also provides load balancing and fast event dissemination service. Our proposed approach achieves fault tolerance by organizing event ...
expand
Network Planning Optimization for Multimedia Networks
Priscila Solis Barreto, Paulo H. P. de Carvalho
Pages: 60-67
doi>10.1109/NCA.2008.30
Available formats: Publisher SitePublisher Site

This work presents a planning methodology for multimedia networks based on a hybrid traffic model and an evolutionary optimization procedure. The methodology intends to optimize the sizing of network elements to comply with two QoS simultaneous network ...
expand
User Profile-Based Authorization Policies for Network QoS Services
Julio Cesar Royer, Roberto Willrich, Michel Diaz
Pages: 68-75
doi>10.1109/NCA.2008.39
Available formats: Publisher SitePublisher Site

Recent papers propose QoS solutions allowing the users to explicitly specify the quality level they request during a so-called explicit QoS service invocation that includes dynamic QoS offering and new mechanisms for authentication, authorization and ...
expand
Multicoordinated Agreement Protocols for Higher Availabilty
Lásaro Jonas Camargos, Rodrigo Malta Schmidt, Fernando Pedone
Pages: 76-84
doi>10.1109/NCA.2008.28
Available formats: Publisher SitePublisher Site

Adaptability and graceful degradation are important features in distributed systems. Yet, consensus and other agreement protocols, basic building blocks of reliable distributed systems, lack these features and must perform expensive reconfiguration even ...
expand
A New Minimum Density RAID-6 Code with a Word Size of Eight
James S. Plank
Pages: 85-92
doi>10.1109/NCA.2008.29
Available formats: Publisher SitePublisher Site

RAID-6 storage systems protect k disks of data with twoparity disks so that the system of k+2 disks may toleratethe failure of any two disks. Coding techniques for RAID-6systems are varied, but an important class of techniquesare those with minimum density, ...
expand
Generalizing RDP Codes Using the Combinatorial Method
Wang Gang, Liu Xiaoguang, Lin Sheng, Xie Guangjun, Liu Jing
Pages: 93-100
doi>10.1109/NCA.2008.27
Available formats: Publisher SitePublisher Site

In this paper, we present PDHLatin - a new class of 2-erasure horizontal codes with dependent parity symbols based on column-hamiltonian Latin squares (CHLS). We prove that PDHLatin codes are MDS codes. We also present a new class of 2-erasure parity ...
expand
Flexible Parameterization of XOR based Codes for Distributed Storage
Peter Sobe, Kathrin Peter
Pages: 101-110
doi>10.1109/NCA.2008.45
Available formats: Publisher SitePublisher Site

Distributed storage systems apply erasure-tolerant codes to guaranteereliable access to data despite failures of storage resources.While many codes can be mapped to XOR operations andefficiently implemented on common microprocessors, only a certainnumber ...
expand
Supporting Concurrent Task Deployment Wireless Sensor Networks
Song Guo, Chunxia Fan, T. D. C. Little
Pages: 111-118
doi>10.1109/NCA.2008.42
Available formats: Publisher SitePublisher Site

Deploying large-scale sensor networks involves the programming of many devices based on a desired mission. Techniques for reprogramming devices in situ have been investigated to mitigate the effort required when program updates are required or when the ...
expand
Failure, Disconnection and Partition Detection in Mobile Environment
Denis Conan, Pierre Sens, Luciana Arantes, Mathieu Bouillaguet
Pages: 119-127
doi>10.1109/NCA.2008.18
Available formats: Publisher SitePublisher Site

In mobile environment, nodes can move around and voluntarily leave or join the network. Furthermore, they can crash or be disconnected from the network due to the absence of network signals. Therefore, failure, disconnection and mobility may create partitions ...
expand
Cross-Layer Architecture for Differentiated Services in Ad Hoc Networks
Maria Fazio, Maurizio Paone, Dario Bruneo, Antonio Puliafito
Pages: 128-135
doi>10.1109/NCA.2008.56
Available formats: Publisher SitePublisher Site

In the last few years, wireless ad hoc networks experienced a great diffusion thanks to their simple deployment everywhere and whenever needed. Already used for entertainment applications (e.g., instant messaging) or for specific domains (e.g., military) ...
expand
Dynamic Routing Selection for Wireless Sensor Networks
Wang Ke, Thomas D. C. Little
Pages: 136-143
doi>10.1109/NCA.2008.43
Available formats: Publisher SitePublisher Site

With the decrease in the cost and in the size of computing devices, wireless sensor networks (WSNET) have the potential of being composed by an extremely large number of nodes offering multiple services. Such networks have the capability of executing ...
expand
Comparing Error Detection Techniques for Web Applications: An Experimental Study
Luis Moura Silva
Pages: 144-151
doi>10.1109/NCA.2008.57
Available formats: Publisher SitePublisher Site

Web applications are highly sensitive to the occurrence of user-visible failures. Despite the usage of system-level monitoring tools there are still some application-level errors that escape to those tools and end up to be seen in the web pages of the ...
expand
Fair-Queued Ethernet for Medical Applications
Stephan Pöhlsen, Frank Franz, Kai Kück, Jörg-Uwe Meyer, Christian Werner
Pages: 152-159
doi>10.1109/NCA.2008.19
Available formats: Publisher SitePublisher Site

Ethernet is becoming an accepted standard for more and more medical applications. It is a best-effort network standard without any transmission guarantees. However, in medical applications real-time transmission guarantees are getting more and more important.In ...
expand
Impact of Social Networking Services on the Performance and Scalability of Web Server Infrastructures
Claudia Canali, José Daniel Garcia, Riccardo Lancellotti
Pages: 160-167
doi>10.1109/NCA.2008.34
Available formats: Publisher SitePublisher Site

The last generation of Web is characterized by social networking services where users exchange a growing amount of multimedia content. The impact of these novel services on the underlying Web infrastructures is significantly different from traditional ...
expand
Is the Popular R*-tree Suited for Packet Classification?
Christine Maindorfer, Thomas Ottmann
Pages: 168-176
doi>10.1109/NCA.2008.20
Available formats: Publisher SitePublisher Site

Packet classification enables network routers to provide advanced network services including network security, quality of service (QoS) routing, and multimedia communications. In order to classify a packet, network nodes must perform a search over a ...
expand
A Linear Inter-Session Network Coding Scheme for Multicast
Min Yang, Yuanyuan Yang
Pages: 177-184
doi>10.1109/NCA.2008.36
Available formats: Publisher SitePublisher Site

Network coding is a promising generalization of routing which allows a network node to generate output messages by encoding its received messages to reduce the bandwidth consumption in the network. An important application where network coding offers ...
expand
Application-Layer Packet Processing through Ethereal Memory
Fong Pong, Nian-Feng Tzeng
Pages: 185-194
doi>10.1109/NCA.2008.32
Available formats: Publisher SitePublisher Site

This work deals with an architectural framework to enable application-layer packet processing for lowered processing latency and enhanced throughput. Creating an “Ethereal memory” shared by application programs and network interface drivers, ...
expand
On the Application of Formal Methods for Specifying and Verifying Distributed Protocols
Marina Gelastou, Chryssis Georgiou, Anna Philippou
Pages: 195-204
doi>10.1109/NCA.2008.24
Available formats: Publisher SitePublisher Site

In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with ...
expand
Approaching the Limits of FlexRay
Christoph Heller, Josef Schalk, Stefan Schneele, Reinhard Reichel
Pages: 205-210
doi>10.1109/NCA.2008.25
Available formats: Publisher SitePublisher Site

The aeronautic industry is strongly interested in utilizing the automotive FlexRay protocol. Economic benefits to be derived from the automotive mass market, and technological benefits arising from to the deterministic communication behavior are projected. ...
expand
An Abstract Channel Specification and an Algorithm Implementing It Using Java Sockets
Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman, Elaine L. Sonderegger
Pages: 211-219
doi>10.1109/NCA.2008.12
Available formats: Publisher SitePublisher Site

Abstract models and specifications can be used in the design of distributed applications to formally reason about their safety properties. However, the benefits of using formal methods are often negated by the ad hoc process of mapping the semantics ...
expand
Multilayered Video Multiple Trees Multicast Algorithms for Heterogeneous Wireless Ad Hoc Networks
Osamah Badarneh, Michel Kadoch, Ahmed ElHakeem
Pages: 220-223
doi>10.1109/NCA.2008.21
Available formats: Publisher SitePublisher Site

In this paper, we address the issue of multilayered multicast routing in wireless ad hoc networks (WAHNs). Existing multilayered multicast protocols assume homogeneous ad hoc wireless networks; in which all nodes are of the same type (they have the same ...
expand
An Improved Anti Collision Algorithm using Parity Bit in RFID System
SungSoo Kim, YongHwan Kim, SeongJoon Lee, KwangSeon Ahn
Pages: 224-227
doi>10.1109/NCA.2008.9
Available formats: Publisher SitePublisher Site

The RFID(Radio Frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio frequency. In RFID system, the reader needs the anti collision algorithm for fast identifying all of the tags ...
expand
Feedback-controlled WLAN: Achieving Channel-Availability in Mesh Networks
Svilen Ivanov, Edgar Nett, André Herms, Daniel Mahrenholz, Stefan Schemmer
Pages: 228-231
doi>10.1109/NCA.2008.54
Available formats: Publisher SitePublisher Site

Wireless mesh networks are a promising backbone-solution for applications in industrial automation. However, high availability of the communication channel is not inherently guaranteed because of environment-dynamics and unauthorized users congesting ...
expand
Police Security Communication over Public Cellular Network Infrastructure
Rongyu He, Chaowen Chang, Guolei Zhao, Zheng Qin, Xi Qin
Pages: 232-235
doi>10.1109/NCA.2008.26
Available formats: Publisher SitePublisher Site

The availability of a communication channel that could be everywhere accessible, possibly via wireless devices is a constant matter for the police force. The well-developed public cellular network infrastructure and widespread mobile device can provide ...
expand
Analysis of Delay Time Distributions in Multistage Interconnection Networks Considering Multicast Traffic
Marcus Brenner, Armin Zimmermann
Pages: 236-239
doi>10.1109/NCA.2008.35
Available formats: Publisher SitePublisher Site

Multistage interconnection networks (Banyan networks) are proposed as connections in multiprocessor systems and in high-bandwidth network switches. In order to achieve suitable solutions when designing such networks to fit a given task, performance evaluation ...
expand
Supporting Cache Coherence in Mobile Cooperative Systems
Carla Diacui Medeiros Berkenbrock, Celso Massaki Hirata
Pages: 240-243
doi>10.1109/NCA.2008.11
Available formats: Publisher SitePublisher Site

Efficient cache coherence strategies are critical to maintain data consistency and provide a reasonable performance of wireless applications with mobile devices. However, the majority of the current strategies for cache coherence in mobile environments ...
expand
Experiments of Large File Caching and Comparisons of Caching Algorithms
Brad Whitehead, Chung-Horng Lung, Amogelang Tapela, Gopinath Sivarajah
Pages: 244-248
doi>10.1109/NCA.2008.44
Available formats: Publisher SitePublisher Site

File sizes have grown tremendously over the past years for music/video applications and the trend is still growing. As a result, large ISPs are facing increasing demand for bandwidth from the growth of file sizes. A main contribution to this bandwidth ...
expand
Improving Efficiency and Performance of Distributed File-Systems
Micah Galizia, Hanan Lutfiyya
Pages: 249-252
doi>10.1109/NCA.2008.55
Available formats: Publisher SitePublisher Site

This paper presents a distributed file-system for the present day medium-sized network. Existing servers and workstations pool their unused storage resources to form a communal share. Erasure codes provide fault tolerance and eliminate the need for replication. ...
expand
Persistent Logical Synchrony
Francesc D. Muñoz-Escoí, Rubén de Juan-Marín, J. Enrique Armendáriz-Íñigo, José Ramón González de Mendívil
Pages: 253-258
doi>10.1109/NCA.2008.15
Available formats: Publisher SitePublisher Site

The virtually synchronous execution model provides anappropriate support for developing reliable applications when the crash failure model is being assumed. Using it, group broadcasts only need to be based on asynchronous communication. Synchronization ...
expand
EPH: An Efficient and Robust Group Membership Topology for Distributed Systems
Ravi Madipadaga, Sabishaw Bhaskaran, Saikat Mukherjee
Pages: 259-262
doi>10.1109/NCA.2008.53
Available formats: Publisher SitePublisher Site

Group membership protocols in distributed systems enable entities in a group to be aware of all other entities in the group. This information is essential for the system to perform as a cohesive unit collaborating to achieve a common objective. In dynamic ...
expand
Supporting Linearizable Semantics in Replicated Databases
Luis Rodrigues, Nuno Carvalho, Emili Miedes
Pages: 263-266
doi>10.1109/NCA.2008.22
Available formats: Publisher SitePublisher Site

This paper proposes a novel database replication algorithm that offers strong consistency (linearizable semantics) and allows reads and non-conflicting writes to execute in parallel in multiple replicas. The proposed algorithm supports the use of quorums ...
expand
Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs
Chadi Kari, Alexander Russell, Narasimha Shashidhar
Pages: 267-270
doi>10.1109/NCA.2008.46
Available formats: Publisher SitePublisher Site

A fundamental problem in distributed computing is the task of cooperatively executing a given set of t tasks by pprocessors where the communication medium is dynamic and subject to failures. The dynamics of the communicationmedium lead to groups of processors ...
expand
Learning Minimum Delay Paths in Service Overlay Networks
Hong Li, Lorne Mason, Michael Rabbat
Pages: 271-274
doi>10.1109/NCA.2008.48
Available formats: Publisher SitePublisher Site

We propose a novel approach using active probingand learning techniques to track minimum delay pathsfor real-time applications in service overlay networks.Stochastic automata are used to probe paths in a decentralized,scalable manner. We propose four ...
expand
Discovering New Trends in Web Robot Traffic Through Functional Classification
Derek Doran, Swapna S. Gokhale
Pages: 275-278
doi>10.1109/NCA.2008.47
Available formats: Publisher SitePublisher Site

This paper proposes a novel functional classification scheme to understand and analyze web robot traffic. The scheme is rooted in the recognition that the crawling behavior of a robot on a site is primarily governed byits intended purpose or functionality. ...
expand
Effect of Parallel TCP Stream Equalizer on Real Long Fat-pipe Network
Yutaka Sugawara, Takeshi Yoshino, Hiroshi Tezuka, Mary Inaba, Kei Hiraki
Pages: 279-282
doi>10.1109/NCA.2008.50
Available formats: Publisher SitePublisher Site

With the rapid progress of high-performance cluster applications, data transfer between clusters in distant locations becomes more important.But, it is difficult to transfer data using parallel TCP streams on long distance high bandwidth network. In ...
expand
Sorting Based Data Centric Storage
Fenghui Zhang, Anxiao (Andrew) Jiang, Jianer Chen
Pages: 283-286
doi>10.1109/NCA.2008.16
Available formats: Publisher SitePublisher Site

Data-centric storage, which supports efficient in-network data query and processing, is an important concept for sensor networks. Previous approaches mostly use hash functions to store data, where data with the same key valueare stored in sensors at ...
expand
A New Recovery Escalation Algorithm with Load Balancing and Backup Resources Sharing in Path Protected WDM Optical Networks
Xiaobing Zheng, Lei Guo, Xingwei Wang, Yu Zhang, Xuekui Wang
Pages: 287-290
doi>10.1109/NCA.2008.17
Available formats: Publisher SitePublisher Site

This paper proposes a new survivable algorithm, Enhanced Shared-Path Protection (ESPP), to tolerate multi-link failures in WDM optical networks. In ESPP, we consider the load balancing to reduce the blocking probability, use resources sharing to save ...
expand
Identifying Failures in Grids through Monitoring and Ranking
Demetrios Zeinalipour-Yazti, Kyriacos Neocleous, Chryssis Georgiou, Marios D. Dikaiakos
Pages: 291-298
doi>10.1109/NCA.2008.10
Available formats: Publisher SitePublisher Site

In this paper we present FailRank, a novel framework for integrating and ranking information sources that characterize failures in a grid system. After the failing sites have been ranked, these can be eliminated from the job scheduling resource pool ...
expand
Adaptive Checkpoint Replication for Supporting the Fault Tolerance of Applications in the Grid
Andre Luckow, Bettina Schnor
Pages: 299-306
doi>10.1109/NCA.2008.38
Available formats: Publisher SitePublisher Site

A major challenge in a dynamic Grid with thousands of machines connected toeach other is fault tolerance. The more resources and components involved, themore complicated and error-prone becomes the system. Migol is an adaptive Grid middleware,which addresses ...
expand
Autonomic Share Allocation and Bounded Prediction of Response Times in Parallel Job Scheduling for Grids
Angela Sodan
Pages: 307-314
doi>10.1109/NCA.2008.49
Available formats: Publisher SitePublisher Site

Grid schedulers which need to decide on which sites the jobs are best allocated require controlled and predictable service. Fair-share scheduling has become widely used but lacks a formal model and depends on the current machine load. Existing approaches ...
expand
Designing Mechanisms for Reliable Internet-based Computing
Antonio Fernandez Anta, Chryssis Georgiou, Miguel A. Mosteiro
Pages: 315-324
doi>10.1109/NCA.2008.41
Available formats: Publisher SitePublisher Site

In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master processor assigns, across the Internet, ...
expand
Detecting Selective Forwarding Attacks in Wireless Sensor Networks Using Two-hops Neighbor Knowledge
Tran Hoang Hai, Eui-Nam Huh
Pages: 325-331
doi>10.1109/NCA.2008.13
Available formats: Publisher SitePublisher Site

Wireless sensor networks have many potential applications for both civil and military tasks. However, WSNs are susceptible to many types of attacks because they are deployed in open and unprotected environment. Selective forwarding attack is one of the ...
expand
Secure Data Collection Scheme in Wireless Sensor Network with Mobile Sink
Amar Rasheed, Rabi Mahapatra
Pages: 332-340
doi>10.1109/NCA.2008.31
Available formats: Publisher SitePublisher Site

Wireless sensor networks that use a mobile sink to collect sensor data along a predetermined path raise a new security challenge: without verifying the source of the data request message, the network will become vulnerable to attacks. We propose an efficient ...
expand
Author Index
Pages: 341-343
doi>10.1109/NCA.2008.60
Available formats: Publisher SitePublisher Site
Roster Page
Page: 344
doi>10.1109/NCA.2008.61
Available formats: Publisher SitePublisher Site

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2016 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Reader    QuickTime    Windows Media Player    Real Player
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder