{"title":"A hybrid source-channel coding scheme for object-based wireless video communications","authors":"Haohong Wang, A. Katsaggelos","doi":"10.1109/ICCCN.2004.1401636","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401636","url":null,"abstract":"In this paper, we study the joint source-channel coding of object-based video, and propose a data hiding scheme that improves the video error resilience by adaptively embedding the shape and motion information in the texture data. Within a rate-distortion theoretical framework, the source coding, channel coding, data embedding, and decoder error concealment are jointly optimized based on the knowledge of transmission channel conditions. The problem is solved using Lagrangian relaxation and dynamic programming. Experimental results indicate that the proposed hybrid source-channel coding scheme significantly outperforms methods without data hiding or unequal error protection","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133072856","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}
{"title":"Formal specification and verification of a micropayment protocol","authors":"M. Gouda, A. Liu","doi":"10.1109/ICCCN.2004.1401715","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401715","url":null,"abstract":"In this paper, we investigate the security of micropayment protocols that support low-value transactions. We focus on one type of such protocols that are based on hash chains. We present a formal specification of a typical hash chain based micropayment protocol using abstract protocol notation, and discuss how an adversary can attack this protocol using message loss, modification, and replay. We use convergence theory to show that this protocol is secure against these attacks. The specification and verification techniques used in this paper can be applied to other micropayment protocols as well","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133972020","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}
{"title":"Performance versus cost analysis of WDM networks with dynamic traffic grooming capabilities","authors":"I. Cerutti, A. Fumagalli, S. Sheth","doi":"10.1109/ICCCN.2004.1401693","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401693","url":null,"abstract":"The objective of this paper is to compare three well-known WDM network architectures (first-generation, single-hop, and multi-hop) when they are deployed to accommodate dynamic end-to-end connections with sub-wavelength transmission rates. The comparison is based on a performance figure that is uniquely defined to take into account the various architecture costs determined by the cost of the deployed network elements. The defined performance figure permits also to compare the three architectures for all possible line-to-node cost ratio values","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121833148","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}
{"title":"An analytical study on the impact of authentication in wireless local area network","authors":"W. Liang, Wenye Wang","doi":"10.1109/ICCCN.2004.1401670","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401670","url":null,"abstract":"Authentication can provide security by preventing unauthorized usage and negotiating the credentials for secure communications. Nevertheless, it induces heavy overhead to communications, further deteriorating the quality of service (QoS). Therefore, analyzing the QoS and security impact of authentication becomes critical to developing efficient authentication schemes. In this paper, we first introduce a system model for the analysis of challenge/response authentication in wireless networks. Then, we evaluate authentication cost, delay, and call dropping probability for different security levels. By considering traffic and mobility patterns, we show the numerical results to illustrate the impact of authentication on security and system performance","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127170708","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}
{"title":"A dynamic-priority based approach to streaming video over cellular network","authors":"Shantanu Kumar Singh, H. Leong, S. Chakravarty","doi":"10.1109/ICCCN.2004.1401647","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401647","url":null,"abstract":"In a wireless cellular environment, a mobile device experiences burst error phase in which many consecutive packets are lost. This can drastically decrease the quality of the streamed video. Some researchers have proposed a time-window based static-prioritized approach of sending video packets, in which the video packets are reordered in every time-window from the highest priority to the lowest priority, and sent strictly in that order (high to low) till the window timer expires. This static-prioritized approach may yield sub-optimal quality (in terms of the total number of decodable frames received) of streamed video if the wireless channel is frequently experiencing burst error phase. This paper proposes an approach which is an improvement to the existing static-prioritized transmission approach and is called dynamic-prioritized scheme (DPS). The key idea in the proposed dynamic-prioritized approach (DPS) is to send the most important frame packets (e.g. T frame packets) during good channel condition and the least important frame packets (e.g. `B' frame packets) during the bad channel condition (burst error period). DPS works exactly as SPS works if there is no burst error detected. But if a burst error is detected, DPS does the following `key' things - (1) sends least priority decodable frames till the end of burst period and (2) switches back to sending high priority frames when the burst error period is over. The proposed approach performs better, even in case when there are frequent wireless burst error phase. DPS may yield more number of total decodable frames than SPS; the reason being that the probability of less important frames ('B' frames) reaching the client during burst error period is higher (due to their small size and hence fewer number of packets needed to send a single frame) than the probability of more important frames (4P frames) reaching the client (due to their large size and hence more number of packets needed to send a single frame)","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125183591","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}
{"title":"Bandwidth-guaranteed QoS multicast routing by multiple paths/trees in ad hoc wireless networks","authors":"Huayi Wu, X. Jia, Yanxiang He, Chuanhe Huang","doi":"10.1109/ICCCN.2004.1401733","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401733","url":null,"abstract":"In this paper, we investigate the issues of QoS multicast routing in ad hoc wireless networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blocked if there does not exist a single multicast tree that has the requested bandwidth, even though there is enough bandwidth in the system to support the call. In this paper we propose a multicast routing scheme by using multiple paths or multiple trees to meet the bandwidth requirement of a call. Three multicast routing strategies are studied, SPT (shortest path tree) based multiple-paths (SPTM), least cost tree based multiple-paths (LCTM) and multiple least cost trees (MLCT). The final routing tree(s) can meet the user's QoS requirements such that the delay from the source node to the furthest destination node shall not exceed the bound and the aggregate bandwidth of the paths or trees shall meet the bandwidth requirement of the call. Extensive simulations have been conducted to evaluate the performance. The simulation results show that the new scheme has three major advantages: 1) it greatly reduces the system blockings; 2) multicast routing is in a fully distributed fashion; 3) the proposed routing protocol follows the format of existing on-demand multicast routing protocols for ad hoc networks, which makes it easy to be incorporated into the existing on-demand routing protocols","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122795228","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}
{"title":"Performance comparison of geocast routing protocols for a MANET","authors":"Pei-Chun Yao, Edward Krohne, T. Camp","doi":"10.1109/ICCCN.2004.1401631","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401631","url":null,"abstract":"This work classifies the current geocast routing protocols of a mobile ad hoc network (MANET) into three categories. We then simulate a typical geocast routing protocol in each category. We performed four studies designed to highlight the various strengths and weaknesses of the protocols: node density, traffic/congestion, mobility, and a combination study examining all three parameters together.","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114132165","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}
{"title":"Measurement and analysis of worm propagation on Internet network topology","authors":"Jonghyune Kim, S. Radhakrishnan, S. Dhall","doi":"10.1109/ICCCN.2004.1401716","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401716","url":null,"abstract":"There has been a constant barrage of worms over the Internet during the recent past. Besides threatening network security, these worms cause an enormous economic burden in terms of loss of productivity at the victim hosts. In addition, these worms create unnecessary network data traffic that causes network congestion, thereby hurting all users. To develop appropriate tools for thwarting quick spread of worms, researchers are trying to understand the behavior of the worm propagation with the aid of epidemiological models. In this study, we apply the classical SIS model and a modification of SIR model to simulate worm propagation in two different network topologies. Whereas in the SIR model once a node is cured after infection it becomes permanently immune, our modification allows this immunity to be temporary, since the cured nodes may again become infected, maybe with a different strain of the same worm. The simulation study also shows that time to infect a large portion of the network vary significantly depending on where the infection begins. This information could be usefully employed to choose hosts for quarantine to delay worm propagation to the rest of the network","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126517997","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}
{"title":"HRED: a simple and efficient active queue management algorithm","authors":"Liujia Hu, A. Kshemkalyani","doi":"10.1109/ICCCN.2004.1401681","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401681","url":null,"abstract":"Active queue management (AQM) is an area of critical importance for the operation of networks. In this paper, we propose a minimal adjustment to the classic random early detection (RED) algorithm, called hyperbola RED (HRED), that uses the hyperbola as the drop probability curve. The control law of HRED can regulate the queue size close to the reference queue size which is settable by the user. As a result, it is expected that HRED is no longer sensitive to the level of network load, its behavior shows low dependence on the parameter settings, and it can achieve higher network utilization. Additionally, very little work needs to be done to migrate from RED to HRED on Internet routers because only the drop profile is adjusted. We implemented HRED on a real Internet router to examine and compare its performance with the classic RED and parabola RED that are currently deployed on Internet routers. From experiments on the real network, we conclude that HRED is insensitive to the network conditions and parameter settings, and can achieve higher network utilization than the other RED schemes","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"400 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133236870","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}
{"title":"Optimal priority-based lightpath allocation for survivable WDM networks","authors":"Suqin Zhong, A. Jaekel","doi":"10.1109/ICCCN.2004.1401576","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401576","url":null,"abstract":"This paper introduces a new and efficient mixed-integer linear program (MILP) formulation for dynamic lightpath allocation in survivable WDM networks, using both shared and dedicated path protection. The objective is to minimize the amount of additional optical resources (wavelength-links) needed for the new connection. The formulation can handle multiple levels of service and traditional shared and dedicated path protection schemes can be treated simply as a special case of the formulation. Experiments carried out on a number of different networks demonstrate that this approach can improve performance and is feasible for practical sized networks","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115473348","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}