Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Data Aggregation Techniques In Sensor Networks: A Survey, Ramesh Rajagopalan, Pramod K. Varshney
Data Aggregation Techniques In Sensor Networks: A Survey, Ramesh Rajagopalan, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
Wireless sensor networks consist of sensor nodes with sensing and communication capabilities. We focus on data aggregation problems in energy constrained sensor networks. The main goal of data aggregation algorithms is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In this paper, we present a survey of data aggregation algorithms in wireless sensor networks. We compare and contrast different algorithms on the basis of performance measures such as lifetime, latency and data accuracy. We conclude with possible future research directions.
A Key Predistribution Scheme For Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney
A Key Predistribution Scheme For Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Pramod K. Varshney
Electrical Engineering and Computer Science - All Scholarship
To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key pre-distribution scheme and …
Comparisons Of K-Anonymization And Randomization Schemes Under Linking Attacks, Zhouxuan Teng, Wenliang Du
Comparisons Of K-Anonymization And Randomization Schemes Under Linking Attacks, Zhouxuan Teng, Wenliang Du
Electrical Engineering and Computer Science - All Scholarship
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attributes. If attacks succeed, the identity of the record will be revealed and potential confidential information contained in other attributes of the record will be disclosed. Kanonymity counters this attack by requiring that each record must be indistinguishable from at least K − 1 other records with respect to the identifying attributes. Randomization can also be used for protection against linking attacks. In this paper, we compare the performance of K-anonymization and randomization schemes under …
Service Oriented Architecture For Voip Conferencing, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Tao Huang
Service Oriented Architecture For Voip Conferencing, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Tao Huang
Electrical Engineering and Computer Science - All Scholarship
Voice/Video over IP (VoIP) systems to date have been either highly centralized or dependent on the IP multicast in nature. Global Multimedia Collaboration System is a scalable, integrated and service-oriented VoIP conferencing system, based on the XGSP collaboration framework and NaradaBrokering messaging middleware. This system can provide media and session services to heterogeneous endpoints such as H.323, SIP, Access Grid, RealPlayer as well as cellular phone. In this paper, we address the challenges of scalability, interoperablity and heterogeneity in massive VoIP conferencing system. We believe that our approach opens up new opportunities for leveraging classic VoIP systems by using new …