发布求助
文献互助 智能选刊 最新文献

2006 International Conference on Systems and Networks Communications (ICSNC'06)最新文献

筛选
英文 中文
E-Services for an Electronic Education Market 电子教育市场的电子服务
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.34
F. Bodendorf
{"title":"E-Services for an Electronic Education Market","authors":"F. Bodendorf","doi":"10.1109/ICSNC.2006.34","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.34","url":null,"abstract":"More and more universities, companies and other organizations are supplying products and services for media-based education and training. The customers are not only students but also an increasing number of working people looking for continuing education. Supporting the convergence of supply and demand electronically in this context is truly challenging. The concept of an electronic market for e-learning is introduced. This marketplace offers services for both suppliers and customers applying the electronic commerce paradigm to the delivery of education and training.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129200667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Confessible Threshold Ring Signatures 可忏悔的阈值环签名
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.29
Yu-Shian Chen, C. Lei, Yun-Peng Chiu, Chun-Ying Huang
{"title":"Confessible Threshold Ring Signatures","authors":"Yu-Shian Chen, C. Lei, Yun-Peng Chiu, Chun-Ying Huang","doi":"10.1109/ICSNC.2006.29","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.29","url":null,"abstract":"We present two threshold ring signature schemes with different properties. One focuses on the confessibility (or signer verifiability) and the denouncibility properties. The other focuses on the threshold-confessibility. Our schemes are built on generic ring signature schemes and can be easily adapted to most existing ring signature schemes. Based on the former works, we also construct a realization of our schemes as an example. We prove that our schemes are secure in the random oracle model.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116391319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Security Architecture for Web-based Health Insurance Systems 基于web的健康保险系统的安全体系结构
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.65
Mücahit Mutlugün, I. Sogukpinar
{"title":"Security Architecture for Web-based Health Insurance Systems","authors":"Mücahit Mutlugün, I. Sogukpinar","doi":"10.1109/ICSNC.2006.65","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.65","url":null,"abstract":"Today, the use of information systems in healthcare has dramatically increased. Some health insurance companies use WWW for patient operations such as opening patient consultation, prescription etc. From the security point of view, generally simple security is applied in order to identify patients and physicians. The lack of security results in exploitation of insurance companies by some of patients and physicians. In this paper, we have examined the current web-based healthcare insurance systems and purposed security architecture to solve security problems. The security architecture highly depends on patient and physician smart cards and fingerprint-based biometrics.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123978033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Tracing and Managing hazardous material in Sensor Networks 传感器网络中有害物质的追踪与管理
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.73
R. Fehling
{"title":"Tracing and Managing hazardous material in Sensor Networks","authors":"R. Fehling","doi":"10.1109/ICSNC.2006.73","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.73","url":null,"abstract":"This paper will look at a real world project in the field of hazardous material management and how sensor networks can efficiently help to increase safety and security as well as autonomously enable sophisticated application integration. We will introduce a Sensor Data Model that is able to handle the avalanche of sensor data by organizing, analyzing and correlating sensor data by using Zones and complex event processing. The model uses state-awareness for a truly event driven architecture.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127045887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Grooming of Multicast Sessions in Sparse Splitting WDM Mesh Networks using Virtual Source Based Trees 稀疏分割WDM Mesh网络中基于虚拟源树的组播会话疏导
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.42
N. Sreenath, B. Palanisamy, S. Nadarajan
{"title":"Grooming of Multicast Sessions in Sparse Splitting WDM Mesh Networks using Virtual Source Based Trees","authors":"N. Sreenath, B. Palanisamy, S. Nadarajan","doi":"10.1109/ICSNC.2006.42","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.42","url":null,"abstract":"Cost effective grooming of several sessions with fractional wavelength bandwidth onto a single wavelength has become prominent in WDM networks. We, in this paper, address the problem of routing and wavelength assignment of multicast sessions with subwavelength traffic demands in sparse splitting WDM networks. We assume a sparse splitting node architecture in which only a few nodes in the network are split-capable. A node with splitting capability can forward an incoming message to more than one outgoing link in the optical form. The multicast capability at the non-split nodes can be achieved by converting the optical signal into electronic form and transmitting in optical form onto all the required outgoing links. However, the traffic duplication at the electronic level is more expensive than the optical level in terms of the delay incurred due to the opticalelectronic- optical (O/E/O) conversion. We study the problem of assigning routes and wavelengths to the multicast sessions with the objective of minimizing the resources required for electronic copying. Since the multicast traffic grooming problem is computationally intractable, we adopt a heuristic approach called VSGroom. The performance of the proposed heuristic is studied and compared through extensive simulation experiments.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126727360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Hybrid Agents for Power-Aware Intrusion Detection in Highly Mobile Ad Hoc Networks 高移动Ad Hoc网络中功率感知入侵检测的混合代理
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.43
T. Srinivasan, V. Mahadevan, A. Meyyappan, A. Manikandan, M. Nivedita, N. Pavithra
{"title":"Hybrid Agents for Power-Aware Intrusion Detection in Highly Mobile Ad Hoc Networks","authors":"T. Srinivasan, V. Mahadevan, A. Meyyappan, A. Manikandan, M. Nivedita, N. Pavithra","doi":"10.1109/ICSNC.2006.43","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.43","url":null,"abstract":"Highly mobile ad hoc networks with their changing topology and distributed nature are more prone to intruders. The efficiency of an Intrusion Detection System in the case of an ad hoc network is not only determined by its dynamicity in monitoring but also by its flexibility in utilizing the available power in each of its nodes. In this paper, we propose a hybrid intrusion detection system, based on a power level metric for potential ad hoc hosts, which is used to determine the duration for which a particular node can support a network-monitoring node. Power - aware Hybrid Intrusion Detection System (PHIDS) focuses on the available power level in each of the nodes and determines the network monitors. Power aware intrusion detection using hybrid agents result in maintaining power and provides an iterative poweroptimal solution to identify fewer nodes for distributed agent-based intrusion detection.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129206934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
A New EAAODV Routing Protocol based on Mobile Agent 一种新的基于移动代理的EAAODV路由协议
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.9
Zhao Chenchen, Yang Zhen
{"title":"A New EAAODV Routing Protocol based on Mobile Agent","authors":"Zhao Chenchen, Yang Zhen","doi":"10.1109/ICSNC.2006.9","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.9","url":null,"abstract":"This paper proposes a new routing scheme for mobile Ad hoc networks .. EAAODV (Energy-Aware AODV), which combines the on-demand routing capability of Ad hoc On-Demand Distance Vector routing protocol with a distributed topology discovery mechanism - mobile agents. Utilizing the interior characteristics of the mobile agent technology, EAAODV obtains the dynamic energy distribution in the network, thus reaching the balance condition. EAAODV eliminates the problem of low efficiency and link breaking in routing due to the energy exhaustion of some nodes, which exists in the traditional protocols. This paper analyzes the scheme by means of both mathematics and simulation technologies. Results show that EAAODV hybrid protocol proposed in this paper is able to achieve a longer surviving network duration and a larger throughput compared to the traditional AODV protocols.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122194759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
An Enhanced Gnutella for Ad-Hoc Networks 用于Ad-Hoc网络的增强Gnutella
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.20
Hyun-Duk Choi, Ho-Hyun Park, Miae Woo
{"title":"An Enhanced Gnutella for Ad-Hoc Networks","authors":"Hyun-Duk Choi, Ho-Hyun Park, Miae Woo","doi":"10.1109/ICSNC.2006.20","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.20","url":null,"abstract":"In recent years, Internet has witnessed the introduction of many peer-to-peer systems designed to implement large scale resource sharing. These systems exhibit interesting features like self configuration, self-healing and complete decentralization, which make the systems appealing for deployment in ad hoc environments as well. This paper enhances Gnutella with peer-node hierarchy to achieve better performance with less overhead in the ad hoc network. The proposed system introduces ultrapeer selection scheme based on the metric values and a proactive communication mechanism among ultrapeers. According to the simulation results, the proposed system gives better performance than Gnutella in terms of query success rate, query response time, and overhead.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126439519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Error Correcting Codes from Modified Butson-Hadamard Matrices 修正布特森-阿达玛矩阵的纠错码
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.37
M. Lee, Xueqin Jiang, Gi Yeon Hwang, Subash Shree Pokhrel
{"title":"Error Correcting Codes from Modified Butson-Hadamard Matrices","authors":"M. Lee, Xueqin Jiang, Gi Yeon Hwang, Subash Shree Pokhrel","doi":"10.1109/ICSNC.2006.37","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.37","url":null,"abstract":"These codes are close to the Plotkin bound and have easy construction and decoding procedure.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131183101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Probabilistic-Based Energy Aware Routing for Network Lifetime and Source Level Fairness in Wireless Sensor Networks 基于概率的无线传感器网络寿命和源级公平能量感知路由
2006 International Conference on Systems and Networks Communications (ICSNC'06) Pub Date : 2006-10-29 DOI: 10.1109/ICSNC.2006.63
Na Wang, C. Chang
{"title":"Probabilistic-Based Energy Aware Routing for Network Lifetime and Source Level Fairness in Wireless Sensor Networks","authors":"Na Wang, C. Chang","doi":"10.1109/ICSNC.2006.63","DOIUrl":"https://doi.org/10.1109/ICSNC.2006.63","url":null,"abstract":"Wireless sensor networks are often used to sample the state of physical phenomena in space. Sensor nodes, which usually have limited energy, collect data locally and forward them to a sink node. Thus there are two operating domains pertinent to the performance of such networks: (1) in time, which is the network longevity or lifetime, and (2) in space, which is the network coverage or source level fairness, i.e., the effective rate at which the state of the phenomena observed is reported at the sink. In this design paper we propose a simple, localized, probabilistic-based protocol that addresses performance issues in both domains. Our protocol addresses the time domain by exploring multiple paths for data delivery so that energy consumption can be uniformly distributed throughout the network, and addresses the spatial domain by dropping packets selectively in congested nodes, so that data flows from all sources will have their share of bandwidth to reach the sink.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114844966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信