Several Wireless LAN handover schemes have been proposed for access networks. These efforts have not yet, however, produced a satisfactory solution for access networks that provide broadband Internet services to moving vehicles such as express buses, trucks and high-speed trains. In this paper, we propose a WLAN access network system for high-speed moving vehicles. The proposed system achieves a short handover time and no packet loss during handover. A daisy-chain network architecture reduces construction costs to enable the wide deployment of many WLAN access points. We also present a performance evaluation of the prototype system.
{"title":"Wireless LAN access network system for moving vehicles","authors":"T. Okabe, Takayuki Shizuno, T. Kitamura","doi":"10.1109/ISCC.2005.156","DOIUrl":"https://doi.org/10.1109/ISCC.2005.156","url":null,"abstract":"Several Wireless LAN handover schemes have been proposed for access networks. These efforts have not yet, however, produced a satisfactory solution for access networks that provide broadband Internet services to moving vehicles such as express buses, trucks and high-speed trains. In this paper, we propose a WLAN access network system for high-speed moving vehicles. The proposed system achieves a short handover time and no packet loss during handover. A daisy-chain network architecture reduces construction costs to enable the wide deployment of many WLAN access points. We also present a performance evaluation of the prototype system.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122264809","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}
The main concern of sensor networks is to maintain full coverage of the monitoring areas, not to keep each node alive as long as possible. That is, it is not necessary to keep nodes alive if they are replaceable by their surrounding nodes and the full coverage is still maintained. Thus, we argue that the objective of designing an energy-aware route selection protocol is to prolong the monitoring lifetime of sensor networks, or the duration that sensor networks may maintain full coverage of the monitoring areas, not the power lifetime of individual nodes. In this paper, we propose a density-based route selection protocol, DBR, and introduce a new metric, potential energy, to be used to select the routes that pass through the highly replaceable nodes. We also conduct a simulation to compare DBR with two existing route selection protocols, MTPR and MMBCR, and the result is satisfactory. DBR outperforms MTPR significantly in almost every case, and is better than MMBCR in most cases while slightly worse in some cases.
{"title":"Density-based routing mechanism for sensor networks","authors":"Ren-Song Ko, Chih-Chung Lai","doi":"10.1109/ISCC.2005.46","DOIUrl":"https://doi.org/10.1109/ISCC.2005.46","url":null,"abstract":"The main concern of sensor networks is to maintain full coverage of the monitoring areas, not to keep each node alive as long as possible. That is, it is not necessary to keep nodes alive if they are replaceable by their surrounding nodes and the full coverage is still maintained. Thus, we argue that the objective of designing an energy-aware route selection protocol is to prolong the monitoring lifetime of sensor networks, or the duration that sensor networks may maintain full coverage of the monitoring areas, not the power lifetime of individual nodes. In this paper, we propose a density-based route selection protocol, DBR, and introduce a new metric, potential energy, to be used to select the routes that pass through the highly replaceable nodes. We also conduct a simulation to compare DBR with two existing route selection protocols, MTPR and MMBCR, and the result is satisfactory. DBR outperforms MTPR significantly in almost every case, and is better than MMBCR in most cases while slightly worse in some cases.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130123615","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}
The fear of incompatibility issues between legacy IPv4 systems and new IPv6 implementations can delay the migration towards a full IPv6 native Internet. Network engineers need to ensure that heterogeneous IPv6 devices behaves consistently to the IPv6 specifications and correctly enterprise in a multi-vendor environment. This paper analyzes IPv6 conformance testing, a set of rigorous test methodologies that allows to throughout verify the quality of IPv6 devices during their entire life cycle, and can give confidence to the customers. We analyze the TAHI IPv6 conformance and interoperability test suite and present our conformance test results for the latest versions of IPv6 host implementations.
{"title":"IPv6 conformance and interoperability testing","authors":"J. Ruiz, A. Vallejo, J. Abella","doi":"10.1109/ISCC.2005.87","DOIUrl":"https://doi.org/10.1109/ISCC.2005.87","url":null,"abstract":"The fear of incompatibility issues between legacy IPv4 systems and new IPv6 implementations can delay the migration towards a full IPv6 native Internet. Network engineers need to ensure that heterogeneous IPv6 devices behaves consistently to the IPv6 specifications and correctly enterprise in a multi-vendor environment. This paper analyzes IPv6 conformance testing, a set of rigorous test methodologies that allows to throughout verify the quality of IPv6 devices during their entire life cycle, and can give confidence to the customers. We analyze the TAHI IPv6 conformance and interoperability test suite and present our conformance test results for the latest versions of IPv6 host implementations.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131564893","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}
The mobile IPv6 handover process consists of three major stages: movement detection, duplicate address detection and binding signaling. Most of the research efforts for optimizing the handover process focuses on minimizing the delays caused by the first two stages. The delay introduced by binding signaling is largely ignored since the correspondent node is assumed to be stationary. However, this delay can be significant when two communicating nodes are both mobile and may roam across different networks simultaneously. mobile IPv6 requires that the binding signaling exchanged between the mobile node and the correspondent node to be authenticated using a procedure called return mutability test. The signaling involved in the return routability procedure is mandated to be redirected through the home agents to the most up-to-date addresses of the communicating nodes. This may result in a longer handover duration if the mobile and correspondent nodes are both far from their home agent, In this paper, we present our recommendation on the use of direct signaling without the need to have any redirection from a network element. We also present an analysis of the cost involved in utilizing direct and indirect signaling mechanisms.
{"title":"An analytical study of direct and indirect signaling for mobile IPv6 in mobile-to-mobile communications","authors":"E. Wu, Y. Sekercioglu, G. Daley, S. Narayanan","doi":"10.1109/ISCC.2005.22","DOIUrl":"https://doi.org/10.1109/ISCC.2005.22","url":null,"abstract":"The mobile IPv6 handover process consists of three major stages: movement detection, duplicate address detection and binding signaling. Most of the research efforts for optimizing the handover process focuses on minimizing the delays caused by the first two stages. The delay introduced by binding signaling is largely ignored since the correspondent node is assumed to be stationary. However, this delay can be significant when two communicating nodes are both mobile and may roam across different networks simultaneously. mobile IPv6 requires that the binding signaling exchanged between the mobile node and the correspondent node to be authenticated using a procedure called return mutability test. The signaling involved in the return routability procedure is mandated to be redirected through the home agents to the most up-to-date addresses of the communicating nodes. This may result in a longer handover duration if the mobile and correspondent nodes are both far from their home agent, In this paper, we present our recommendation on the use of direct signaling without the need to have any redirection from a network element. We also present an analysis of the cost involved in utilizing direct and indirect signaling mechanisms.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130814622","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}
N. Montavont, Eric Njedjou, Franck Lebeugle, Thomas Noël
This document describes a mechanism that enhances mobile IP protocols to smoothly manage handovers for MNs equipped with multiple interfaces and moving across different links. For this purpose, the document provides precise indications on how to use the link layer events information to accelerate IP movement detection and optimize vertical inter-technology handovers. Experimentation results on vertical handovers between WLAN and GPRS networks are also given.
{"title":"Link triggers assisted optimizations for mobile lPv4/v6 vertical handovers","authors":"N. Montavont, Eric Njedjou, Franck Lebeugle, Thomas Noël","doi":"10.1109/ISCC.2005.94","DOIUrl":"https://doi.org/10.1109/ISCC.2005.94","url":null,"abstract":"This document describes a mechanism that enhances mobile IP protocols to smoothly manage handovers for MNs equipped with multiple interfaces and moving across different links. For this purpose, the document provides precise indications on how to use the link layer events information to accelerate IP movement detection and optimize vertical inter-technology handovers. Experimentation results on vertical handovers between WLAN and GPRS networks are also given.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132856857","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}
The resilient packet ring (RPR) IEEE 802.17 is a new medium access control (MAC) protocol for high-speed ring networks. In order to achieve fairness among nodes, a fairness algorithm is employed at each RPR node. In this paper, we develop an analytical model for fair rate calculation in the standard RPR aggressive fairness algorithm in parking lot scenario. Our approach is to model the fair rate calculation by a non-linear discrete-time low-pass filter. We verify our model by simulation results and analyze the convergence of the fairness algorithm. Further, the effect of various parameters on convergence time is investigated.
{"title":"On modeling of fair rate calculation in resilient packet rings","authors":"A. Shokrani, I. Lambadaris, J. Talim","doi":"10.1109/ISCC.2005.109","DOIUrl":"https://doi.org/10.1109/ISCC.2005.109","url":null,"abstract":"The resilient packet ring (RPR) IEEE 802.17 is a new medium access control (MAC) protocol for high-speed ring networks. In order to achieve fairness among nodes, a fairness algorithm is employed at each RPR node. In this paper, we develop an analytical model for fair rate calculation in the standard RPR aggressive fairness algorithm in parking lot scenario. Our approach is to model the fair rate calculation by a non-linear discrete-time low-pass filter. We verify our model by simulation results and analyze the convergence of the fairness algorithm. Further, the effect of various parameters on convergence time is investigated.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132163371","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}
Sensor networks are large-scale distributed sensing networks comprised of many small sensing devices equipped with memory, processors, and short-range wireless communication radio. Instead of broadcast-based routing protocols, in this paper we propose a novel energy-efficient routing protocol, which is called straight line routing algorithm (SLR), for wireless sensor networks. To achieve the routing task without broadcasting, the source host constructs the event path and the sink host constructs the query path respectively. That is, the routing path is found as the query path and the event path first intersect. Moreover, the SLR is able to build both the query path and the event path without any help of the geographic information. We evaluate the performance of straight line routing and rumor routing protocols through extensive simulations. The simulation results indicate that compared with rumor routing, the SLR can save more energy consumption, provide better path quality, and improve the successful ratio of routing as well.
传感器网络是由许多配备了存储器、处理器和短距离无线通信无线电的小型传感设备组成的大规模分布式传感网络。本文提出了一种新的高效节能的无线传感器网络路由协议，即直线路由算法(straight line routing algorithm, SLR)。为了实现不广播的路由任务，源主机构造事件路径，接收主机构造查询路径。也就是说，路由路径是在查询路径和事件路径首先相交时找到的。此外，单反可以在没有任何地理信息帮助的情况下构建查询路径和事件路径。我们通过大量的仿真来评估直线路由和谣言路由协议的性能。仿真结果表明，与谣言路由相比，SLR可以节省更多的能量消耗，提供更好的路径质量，并提高路由成功率。
{"title":"Straight line routing for wireless sensor networks","authors":"Cheng-Fu Chou, Jia-Jang Su, Chao-Yu Chen","doi":"10.1109/ISCC.2005.139","DOIUrl":"https://doi.org/10.1109/ISCC.2005.139","url":null,"abstract":"Sensor networks are large-scale distributed sensing networks comprised of many small sensing devices equipped with memory, processors, and short-range wireless communication radio. Instead of broadcast-based routing protocols, in this paper we propose a novel energy-efficient routing protocol, which is called straight line routing algorithm (SLR), for wireless sensor networks. To achieve the routing task without broadcasting, the source host constructs the event path and the sink host constructs the query path respectively. That is, the routing path is found as the query path and the event path first intersect. Moreover, the SLR is able to build both the query path and the event path without any help of the geographic information. We evaluate the performance of straight line routing and rumor routing protocols through extensive simulations. The simulation results indicate that compared with rumor routing, the SLR can save more energy consumption, provide better path quality, and improve the successful ratio of routing as well.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115196479","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}
Third generation (3G) mobile phones are leading the telecommunications world into a new era. 3G networks offer increased speed for mobile users and enable new services. Mobile streaming applications benefit from these new capabilities, although streaming doesn't strictly requires a 3G network to work. The purpose of this paper is to show how 3G can improve the performance of streaming applications. In particular, we reference the 3GPP packet-switched streaming service (PSS).
{"title":"Mobile streaming services in WCDMA networks","authors":"Miikka Lundan, I. Curcio","doi":"10.1109/ISCC.2005.104","DOIUrl":"https://doi.org/10.1109/ISCC.2005.104","url":null,"abstract":"Third generation (3G) mobile phones are leading the telecommunications world into a new era. 3G networks offer increased speed for mobile users and enable new services. Mobile streaming applications benefit from these new capabilities, although streaming doesn't strictly requires a 3G network to work. The purpose of this paper is to show how 3G can improve the performance of streaming applications. In particular, we reference the 3GPP packet-switched streaming service (PSS).","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116039685","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}
Introducing node mobility into the network also introduces new anonymity threats. Nevertheless, this important change of the concept of anonymity has not been studied in state-of-art network security research. This paper presents the needed study. Then we show that anonymous routing in mobile networks has great impact on routing performance. We calls for the attention to devise new and efficient anonymous routing schemes for mobile ad hoc networks.
{"title":"Mobility changes anonymity: mobile ad hoc networks need efficient anonymous routing","authors":"J. Kong, X. Hong, M. Sanadidi, M. Gerla","doi":"10.1109/ISCC.2005.105","DOIUrl":"https://doi.org/10.1109/ISCC.2005.105","url":null,"abstract":"Introducing node mobility into the network also introduces new anonymity threats. Nevertheless, this important change of the concept of anonymity has not been studied in state-of-art network security research. This paper presents the needed study. Then we show that anonymous routing in mobile networks has great impact on routing performance. We calls for the attention to devise new and efficient anonymous routing schemes for mobile ad hoc networks.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128213968","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}
DiffServ network model, which is a scalable framework for providing quality of service to applications, defines multiple service classes each with different level of priority in queuing of network routers. Recent study shows that the global treatment of premium class as the most prioritized service class strongly affects the performance of low priority classes. This negative impact becomes more acute in the core of the network where the traffic is aggregated. In order to alleviate the inter-class effect, the routing algorithm used to compute the premium paths must minimize the load of high priority class over the network links. In this paper, we propose a new routing architecture which allows the core routers to use multipath scheme for forwarding of arriving premium packets. Simulation results show that our approach outperforms several earlier algorithms in terms of maximum premium congestion on the network.
{"title":"Core based multipath routing in DiffServ networks","authors":"S. Zarifzadeh, H. Khanmirza, N. Yazdani","doi":"10.1109/ISCC.2005.44","DOIUrl":"https://doi.org/10.1109/ISCC.2005.44","url":null,"abstract":"DiffServ network model, which is a scalable framework for providing quality of service to applications, defines multiple service classes each with different level of priority in queuing of network routers. Recent study shows that the global treatment of premium class as the most prioritized service class strongly affects the performance of low priority classes. This negative impact becomes more acute in the core of the network where the traffic is aggregated. In order to alleviate the inter-class effect, the routing algorithm used to compute the premium paths must minimize the load of high priority class over the network links. In this paper, we propose a new routing architecture which allows the core routers to use multipath scheme for forwarding of arriving premium packets. Simulation results show that our approach outperforms several earlier algorithms in terms of maximum premium congestion on the network.","PeriodicalId":315855,"journal":{"name":"10th IEEE Symposium on Computers and Communications (ISCC'05)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130960977","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：