2007 15th IEEE International Conference on Networks最新文献

筛选
英文 中文
Searching ISP Router Networks for Footprints of Engineering Design Consideration 搜索ISP路由器网络的工程设计考虑的足迹
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444100
Wilson Wang-Kit Thong, Guanrong Chen, K. Ko
{"title":"Searching ISP Router Networks for Footprints of Engineering Design Consideration","authors":"Wilson Wang-Kit Thong, Guanrong Chen, K. Ko","doi":"10.1109/ICON.2007.4444100","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444100","url":null,"abstract":"Modeling router-level networks is a challenging task, for it is unclear today as how to represent such networks by a simple and accurate model of modest size and complexity. To provide more insights into router-level network modeling, this paper studies some topological features of several Internet service provider (ISP) networks. The main concern is on the relationships amongst bandwidth constraints, topological features, and engineering design consideration. Computer experiments show some highly unlikely topological structures to network congestion, which are common amongst several geographically independent ISP networks. It suggests that engineering design consideration paves a feasible way to model router-level networks. The findings in this paper may provide some new information toward developing a more realistic model for the router-level Internet.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123377476","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
A Location-aware Key Predistribution Scheme for Distributed Wireless Sensor Networks 分布式无线传感器网络的位置感知密钥预分配方案
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444084
N. T. Canh, T. V. Phuong, Young-Koo Lee, Sungyoung Lee, Heejo Lee
{"title":"A Location-aware Key Predistribution Scheme for Distributed Wireless Sensor Networks","authors":"N. T. Canh, T. V. Phuong, Young-Koo Lee, Sungyoung Lee, Heejo Lee","doi":"10.1109/ICON.2007.4444084","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444084","url":null,"abstract":"Key establishment plays a central role in authentication and encryption in wireless sensor networks, especially when they are mainly deployed in hostile environments. Because of the strict constraints in power, processing and storage, designing an efficient key establishment protocol is not a trivial task. Also, it is infeasible to apply public key techniques onto large-scale wireless sensor networks. Most of proposed solutions are based on symmetric key techniques and mainly focused on key predistribution mechanism. In this paper, we present a new key predistribution scheme using bivariate polynomial combining with expected deployment knowledge. We show that our approach takes advantage in terms of resilience against node compromised over prior schemes with the same resource requirements.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116194463","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
Resource Allocation Schemes for 3G Mobile Service Providers with Heterogeneous Traffic 具有异构流量的3G流动服务供应商的资源分配方案
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444070
S. Alqahtani
{"title":"Resource Allocation Schemes for 3G Mobile Service Providers with Heterogeneous Traffic","authors":"S. Alqahtani","doi":"10.1109/ICON.2007.4444070","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444070","url":null,"abstract":"For 3G and beyond wideband code-division multiple access (WCDMA) cellular networks supporting heterogeneous traffic , sharing the radio access network has become an important issue for 3G mobile service providers (MSPs). Sharing of network infrastructure among MSPs offers an alternative solution to reducing the investment in the coverage phase of WCDMA. In radio access network (RAN) sharing method, which is our focus in this study, each MSP has its own core network and only the RAN is shared. It implies that multiple MSPs fully share the same RAN. This paper tackles an uplink efficient scheduling to provide maximum system throughput and proportional fairness in accordance with MSP capacity share through adaptive resource allocation scheme. We refer to this new scheme as MSPs Code Division Generalized Processor sharing scheme (MSP-CDGPS). It employs both adaptive rate allocation to maximize the resource utilization and GPS techniques to provide fair services for each MSP supporting multimedia traffic. The simulation results show that the proposed scheme improves both system utilization (throughput) and average delays for each traffic class.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"13 51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127123694","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
Service Differentiation in Wireless Networks: Adaptive Ad Hoc Qs Versus IEEE 802.11e 无线网络中的业务分化:自适应Ad Hoc q与IEEE 802.11e
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444104
A. Mowlaei, Bu-Sung Lee, T. Lim, C. Yeo
{"title":"Service Differentiation in Wireless Networks: Adaptive Ad Hoc Qs Versus IEEE 802.11e","authors":"A. Mowlaei, Bu-Sung Lee, T. Lim, C. Yeo","doi":"10.1109/ICON.2007.4444104","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444104","url":null,"abstract":"IEEE 802.11e standard was proposed to provide quality of service (QoS) support in wireless local area networks (WLANs). Currently, the number of WLAN cards which support this standard is limited and on the other hand many users already have WLAN cards. We proposed a MAC-independent service differentiation mechanism which is called ad hoc Qs. Furthermore, we enhanced its operations by making it adaptive to the number of active stations and the requested service. In this paper, we compare the performance of 802.11e and adaptive ad hoc Qs in terms of service differentiation in wireless networks. The simulation results show that the adaptive ad hoc Qs surpasses 802.11e in some features: Firstly, adaptive ad hoc Qs is implemented just by software upgrade in contrast to IEEE 802.11e which needs hardware upgrade. Secondly, By increasing the amount of High priority traffics, the low priority traffics will suffer from starvation when 802.11e standard is used for service differentiation. Adaptive ad hoc Qs protects the Low priority traffics from starvation while the amount of High priority traffics is increasing. In addition, adaptive ad hoc Qs provides higher channel utilization in multi-hop wireless ad-hoc network compare to 802.11e.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129057871","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}
引用次数: 3
Node Localisation in Wireless Ad Hoc Networks 无线自组织网络中的节点定位
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444052
J. Arnold, N. Bean, M. Kraetzl, M. Roughan
{"title":"Node Localisation in Wireless Ad Hoc Networks","authors":"J. Arnold, N. Bean, M. Kraetzl, M. Roughan","doi":"10.1109/ICON.2007.4444052","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444052","url":null,"abstract":"Wireless ad hoc networks often require a method for estimating their nodes' locations. Typically this is achieved by the use of pair-wise measurements between nodes and their neighbours, where a number of nodes already accurately know their location and the remaining nodes must calculate theirs using these known locations. Typically, a minimum mean square estimate (MMSE), or a maximum likelihood estimate (MLE) is used to generate the unknown node locations, making use of range estimates derived from measurements between the nodes. In this paper we investigate the efficacy of using radio frequency, received signal strength (RSS) measurements for the accurate location of the transmitting nodes over long ranges. We show with signal strength measurements from three or more wireless probes in noisy propagation conditions, that by using a weighted MMSE approach we can obtain significant improvements in the variance of the location estimate over both the standard MMSE and MLE approaches.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"385 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122777797","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}
引用次数: 6
Scalable Bandwidth Optimization in Advance Reservation Networks 提前预约网络的可扩展带宽优化
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444068
Stephan Schmidt, Jérôme Kunegis
{"title":"Scalable Bandwidth Optimization in Advance Reservation Networks","authors":"Stephan Schmidt, Jérôme Kunegis","doi":"10.1109/ICON.2007.4444068","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444068","url":null,"abstract":"In this paper, we present an algorithm for continuous bandwidth optimization in networks supporting advance reservations such as Grid computing environments or QoS-aware MPLS networks. The need for such reoptimization arises when resources for incoming reservation requests are allocated using fast dynamic routing with simple path selection algorithms. Although this is often necessary to satisfy time constraints for answering reservation requests, it inevitably leads to network inefficiencies due to the fact that the resulting uneven load distribution leads to bottlenecks within the network. We propose a combination of fast online bandwidth reservation with background reoptimization which continuously frees up bandwidth for future time slots in order to allow the network to carry more traffic without adding further capacity. A combinatorial time-approximation scheme suitable for large networks will be used. In addition, we evaluate several performance metrics and show that a significant improvement in request admission rate and bandwidth utilization can be achieved under the proposed scheme.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820988","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}
引用次数: 11
Characterization of Traffic in Wireless Sensor Networks 无线传感器网络中业务量的表征
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444126
J. McEachen, W. Beng
{"title":"Characterization of Traffic in Wireless Sensor Networks","authors":"J. McEachen, W. Beng","doi":"10.1109/ICON.2007.4444126","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444126","url":null,"abstract":"We present an analysis of traffic collected from different topologies of wireless sensor networks. Specifically, over 2.1 million packets were analyzed from two different and commonly used network topologies, namely a direct connection to a base station and a daisy-chained connection to the base. The data traffic between the nodes was captured over a composite period of 180 hours. Using the captured information, analysis was performed to categorize and identify the information through anomalies and variations of traffic patterns. Data was also be analyzed for self-similarity and statistical distribution. The results have shown that by monitoring the traffic distribution and types of message sent, traffic analysis is able to distinguish between the two topology setups. The status of the nodes can also be determined with the traffic collected. Examples include new nodes joining the network and operational status of the nodes. Statistical analysis has also been done and found that wireless sensor network traffic is not self-similar except for the interarrival time of the direct connection mode.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"506 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116553906","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}
引用次数: 7
Predictive Lawful Interception in Mobile IPv6 Networks 移动IPv6网络中的预测性合法拦截
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444137
A. Rojas, P. Branch, G. Armitage
{"title":"Predictive Lawful Interception in Mobile IPv6 Networks","authors":"A. Rojas, P. Branch, G. Armitage","doi":"10.1109/ICON.2007.4444137","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444137","url":null,"abstract":"The lawful interception (LI) of communications is necessary in modern telecommunications networks in order to help law enforcement agencies with the investigation and prosecution of criminal activities. The challenging aspect of LI in mobile IPv6 networks lies in the variety of ways that the network can be operated and translates into LI solutions which range in complexity from trivial to complex. In turn, the complexity of an LI solution manifests in LI signalling volume and effects the ability to fulfill critical LI requirements such as capturing 100% of target traffic. We propose a generic LI architecture that supports user mobility prediction schemes to fulfill LI requirements. We then propose two simple user mobility prediction schemes before analysing their prediction performance and effect on LI metrics. Our results show that the simple prediction scheme proposed in this paper can accurately predict the future position of a mobile user and can lead to the fulfillment of LI requirements, such as capturing 100% of target traffic, while at the same time being sensitive to security issues by restricting interception activation only to parts of the network that are visited by the mobile target.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132720160","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}
引用次数: 3
Last-Backlogged First-Served Deficit Round Robin (LBFS-DRR) Packet Scheduling Algorithm LBFS-DRR (last - backlog first - service Deficit Round Robin)报文调度算法
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444108
D. Nikolova, C. Blondia
{"title":"Last-Backlogged First-Served Deficit Round Robin (LBFS-DRR) Packet Scheduling Algorithm","authors":"D. Nikolova, C. Blondia","doi":"10.1109/ICON.2007.4444108","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444108","url":null,"abstract":"In this article we present a novel packet scheduling algorithm LBFS-DRR, which combines features from the Last-Come First-Served scheduling discipline and the Deficit Round Robin (DRR) algorithm. In comparison with DRR it provides lower average packet delay, while preserving the advantageous feature like O(l) complexity, fairness, bandwidth guarantee. The lower mean delay is realized by giving service in a round first to flows transmitting bellow their (weighted) fair share. The algorithm exploits the high variability in the typical user traffic pattern resulting in lower mean file transfer delay.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133382193","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}
引用次数: 4
Cross Layer versus Single Layer Approaches for Intrusion Detection in MANETs manet中跨层与单层入侵检测方法
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444085
John Felix Charles Joseph, A. Das, Boon-Chong Seet, Bu-Sung Lee
{"title":"Cross Layer versus Single Layer Approaches for Intrusion Detection in MANETs","authors":"John Felix Charles Joseph, A. Das, Boon-Chong Seet, Bu-Sung Lee","doi":"10.1109/ICON.2007.4444085","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444085","url":null,"abstract":"Because of the inherent characteristics of MANET, such as distributed control and the lack of infrastructure, security threats exist almost in all layers of the network stack. This makes the design of intrusion detection systems for MANETS extremely hard. This work focuses primarily on studying the ability of detection of routing attacks in MANETS using various IDS schemes. We illustrate the inadequacy of conventional protocol-specific detection strategies using practical simulated experiments. Furthermore, we study the potential of a cross-layer IDS to overcome the problems associated with the design of MANET IDS. The strengths and weaknesses of single layer and cross layer approaches are examined using simulation-based experiments. The experimental results clearly show the supremacy of the cross-layer approach over single-layer (protocol-specific) approaches for MANETs.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"109 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133391971","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}
引用次数: 20
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学术文献互助群
群 号:481959085
Book学术官方微信