A router in wired network typically requires multiple network interfaces to act as a router or a forwarding node. In an ad-hoc multi-hop wireless network on the other hand, any node with a wireless network interface card can operate as a router or a forwarding node, since it can receive a packet from a neighboring node, do a route lookup based on the packet's destination IP address, and then transmit the packet to another neighboring node using the same wireless interface. This paper investigates a combined medium access and next-hop address lookup based on fixed length labels (instead of IP addresses), which allows the entire packet forwarding operation to be executed within the wireless NIC without the intervention of the host protocol stack. Medium access schemes to date, such as IEEE 802.11, have been designed implicitly for either receiving or transmitting a packet, but not for a forwarding operation, i.e. receiving a packet from an upstream node and then immediately transmitting the packet to a downstream node as an atomic channel access operation. This paper proposes a MAC protocol for packet forwarding in multi-hop wireless networks. The proposed protocol builds on the IEEE 802.11 DCF MAC using RTS/CTS and uses MPLS like labels in the control packets (RTS/CTS) to allow the forwarding node to determine the next hop node while contending for the channel. The throughput of this protocol is compared with 802.11 DCF MAC through simulation.
{"title":"A label-switching packet forwarding architecture for multi-hop wireless LANs","authors":"A. Acharya, Archan Misra, Sorav Bansal","doi":"10.1145/570790.570797","DOIUrl":"https://doi.org/10.1145/570790.570797","url":null,"abstract":"A router in wired network typically requires multiple network interfaces to act as a router or a forwarding node. In an ad-hoc multi-hop wireless network on the other hand, any node with a wireless network interface card can operate as a router or a forwarding node, since it can receive a packet from a neighboring node, do a route lookup based on the packet's destination IP address, and then transmit the packet to another neighboring node using the same wireless interface. This paper investigates a combined medium access and next-hop address lookup based on fixed length labels (instead of IP addresses), which allows the entire packet forwarding operation to be executed within the wireless NIC without the intervention of the host protocol stack. Medium access schemes to date, such as IEEE 802.11, have been designed implicitly for either receiving or transmitting a packet, but not for a forwarding operation, i.e. receiving a packet from an upstream node and then immediately transmitting the packet to a downstream node as an atomic channel access operation. This paper proposes a MAC protocol for packet forwarding in multi-hop wireless networks. The proposed protocol builds on the IEEE 802.11 DCF MAC using RTS/CTS and uses MPLS like labels in the control packets (RTS/CTS) to allow the forwarding node to determine the next hop node while contending for the channel. The throughput of this protocol is compared with 802.11 DCF MAC through simulation.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"17 1","pages":"33-40"},"PeriodicalIF":0.0,"publicationDate":"2002-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89956731","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}
This paper is directed towards providing quality of service guarantees for transmission of multimedia traffic over wireless links. The quality of service guarantees require transmission of packets within prespecified deadlines. Oftentimes, bursty, location dependent channel errors preclude such deadline satisfaction leading to packet drop. Wireless systems need resource reservation to limit such deadline violation related packet drop below acceptable thresholds. The resource reservation depends on the scheduling policy, statistical channel qualities and arrival traffic. We choose Earliest Deadline First as the baseline scheduling policy and design an admission control strategy which provides delay guarantees and limits the packet drop by regulating the number of admitted sessions in accordance with the long term transmission characteristics and arrival traffic of the incoming sessions. We analytically quantify the stochastic packet drop guarantees provided by the framework, and show using simulation that the design results in low packet drop.
{"title":"Providing stochastic delay guarantees through channel characteristics based resource reservation in wireless network","authors":"P. Chaporkar, S. Sarkar","doi":"10.1145/570790.570792","DOIUrl":"https://doi.org/10.1145/570790.570792","url":null,"abstract":"This paper is directed towards providing quality of service guarantees for transmission of multimedia traffic over wireless links. The quality of service guarantees require transmission of packets within prespecified deadlines. Oftentimes, bursty, location dependent channel errors preclude such deadline satisfaction leading to packet drop. Wireless systems need resource reservation to limit such deadline violation related packet drop below acceptable thresholds. The resource reservation depends on the scheduling policy, statistical channel qualities and arrival traffic. We choose Earliest Deadline First as the baseline scheduling policy and design an admission control strategy which provides delay guarantees and limits the packet drop by regulating the number of admitted sessions in accordance with the long term transmission characteristics and arrival traffic of the incoming sessions. We analytically quantify the stochastic packet drop guarantees provided by the framework, and show using simulation that the design results in low packet drop.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"33 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2002-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78959041","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}
Pervasive computing devices such as Personal Digital Assistants (PDAs) and laptop computers are becoming increasingly ubiquitous. The future promises even more advanced devices such as digital watches, jewelry, and even clothing. However, as pervasive devices become more widely used for more advanced applications, their resource limitations are becoming more apparent. In this work, we focus on data management and power limitations. We investigate the benefit of using power-aware schemes to automatically manage content across a collection of devices and prolong data availability. We monitor the available energy supply on each device and migrate content from devices that are in danger of dying. In our simulated environment, we have found that, using intelligent techniques for data management can increase the amount of time a collection of devices remains usable by over 2 times. Furthermore, our techniques can perform autonomously, independent of user intervention.
{"title":"Power-aware data management for small devices","authors":"Sami Rollins, K. Almeroth, K. Nagaraja","doi":"10.1145/570790.570804","DOIUrl":"https://doi.org/10.1145/570790.570804","url":null,"abstract":"Pervasive computing devices such as Personal Digital Assistants (PDAs) and laptop computers are becoming increasingly ubiquitous. The future promises even more advanced devices such as digital watches, jewelry, and even clothing. However, as pervasive devices become more widely used for more advanced applications, their resource limitations are becoming more apparent. In this work, we focus on data management and power limitations. We investigate the benefit of using power-aware schemes to automatically manage content across a collection of devices and prolong data availability. We monitor the available energy supply on each device and migrate content from devices that are in danger of dying. In our simulated environment, we have found that, using intelligent techniques for data management can increase the amount of time a collection of devices remains usable by over 2 times. Furthermore, our techniques can perform autonomously, independent of user intervention.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"42 1","pages":"80-87"},"PeriodicalIF":0.0,"publicationDate":"2002-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85088328","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}
Our experiments with IEEE 802.11b based wireless ad hoc networks show that neighbor sensing with broadcast messages introduces "communication gray zones": in such zones data messages cannot be exchanged although the HELLO messages indicate neighbor reachability. This leads to a systematic mismatch between the route state and the real world connectivity, resulting in disruptive behavior for multi-media data transfer over ad hoc routing protocols. Concentrating on AODV we explore this issue and evaluate three different techniques to overcome the gray zone problem. We present quantitative measurements of these improvements and discuss the consequences for ad hoc routing protocols and their implementations.
{"title":"Coping with communication gray zones in IEEE 802.11b based ad hoc networks","authors":"Henrik Lundgren, Erik Nordström, C. Tschudin","doi":"10.1145/570790.570799","DOIUrl":"https://doi.org/10.1145/570790.570799","url":null,"abstract":"Our experiments with IEEE 802.11b based wireless ad hoc networks show that neighbor sensing with broadcast messages introduces \"communication gray zones\": in such zones data messages cannot be exchanged although the HELLO messages indicate neighbor reachability. This leads to a systematic mismatch between the route state and the real world connectivity, resulting in disruptive behavior for multi-media data transfer over ad hoc routing protocols. Concentrating on AODV we explore this issue and evaluate three different techniques to overcome the gray zone problem. We present quantitative measurements of these improvements and discuss the consequences for ad hoc routing protocols and their implementations.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"23 1","pages":"49-55"},"PeriodicalIF":0.0,"publicationDate":"2002-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81059892","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}
This paper presents a cooperative caching architecture suitable for continuous media (CM) proxy caching in MANET environments. The proposed scheme introduces an application manager component, which is interposed between traditional Internet CM applications and the network layer. The application manager transparently performs data location and service migration of active CM streaming sessions so as to exploit nearby data sources based on the dynamic topology of a MANET. We propose two data location schemes - Cache-State - a link-state based scheme and Reactive - an on-demand scheme. Since service migration can occur frequently, the application manager uses soft-state signaling techniques to communicate between remote application managers by translating hard-state application signaling, such as Real Time Streaming Protocol (RTSP) into soft-state messages. The proposed schemes are evaluated through simulation studies using the NS simulator. Simulation studies show that both Cache-State and Reactive schemes demonstrate significant QoS improvements and reduced bandwidth consumption.
{"title":"A cooperative cache architecture in support of caching multimedia objects in MANETs","authors":"W. H. Lau, Mohan J. Kumar, S. Venkatesh","doi":"10.1145/570790.570800","DOIUrl":"https://doi.org/10.1145/570790.570800","url":null,"abstract":"This paper presents a cooperative caching architecture suitable for continuous media (CM) proxy caching in MANET environments. The proposed scheme introduces an application manager component, which is interposed between traditional Internet CM applications and the network layer. The application manager transparently performs data location and service migration of active CM streaming sessions so as to exploit nearby data sources based on the dynamic topology of a MANET. We propose two data location schemes - Cache-State - a link-state based scheme and Reactive - an on-demand scheme. Since service migration can occur frequently, the application manager uses soft-state signaling techniques to communicate between remote application managers by translating hard-state application signaling, such as Real Time Streaming Protocol (RTSP) into soft-state messages. The proposed schemes are evaluated through simulation studies using the NS simulator. Simulation studies show that both Cache-State and Reactive schemes demonstrate significant QoS improvements and reduced bandwidth consumption.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"116 1","pages":"56-63"},"PeriodicalIF":0.0,"publicationDate":"2002-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80492739","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}
Mobile media streaming is envisioned to become an important service over packet-switched 2.5G and 3G wireless networks. At the same time, TCP-friendly rate-adaptation behavior for streaming will become an important IETF requirement. In this paper we investigate TCP-friendly on-demand streaming over wired and wireless links. We consider two approaches for achieving TCP-friendliness: first, by tunneling RTP packets over TCP and secondly by employing an RTP server rate control which does not exceed a variable rate constraint derived from the recently developed TFRC protocol. To allow a reasonable fair comparison between TCP and TFRC, we assume a simple retransmission mechanism on top of TFRC. We consider streaming from a server in the public Internet to both wired and wireless clients. For the wireless case we assumed a client which is connected to the public Internet via a dedicated 64 kbps WCDMA streaming bearer. Simulation results carried out in ns-2 show that TCP and TFRC can not fully utilize the WCDMA bearer at 5% packet loss rate over the shared public Internet link. Smooth playout of a typical 64 kbps video stream would require high initial buffering delays (>10 seconds) and large receiver buffer sizes (>60 KB). We finally investigate the gains from a proxy that splits the connection and uses TCP-friendly congestion control only over the shared part of the client-server connection. Simulation results show improvements in average throughput and wireless link utilization. By employing appropriate packet re-scheduling mechanisms, the initial buffering delay and the client buffer size for a typical 64 kbps video stream can be decreased by a factor of three to four.
{"title":"Proxy-based TCP-friendly streaming over mobile networks","authors":"Lei Huang, U. Horn, F. Hartung, M. Kampmann","doi":"10.1145/570790.570794","DOIUrl":"https://doi.org/10.1145/570790.570794","url":null,"abstract":"Mobile media streaming is envisioned to become an important service over packet-switched 2.5G and 3G wireless networks. At the same time, TCP-friendly rate-adaptation behavior for streaming will become an important IETF requirement. In this paper we investigate TCP-friendly on-demand streaming over wired and wireless links. We consider two approaches for achieving TCP-friendliness: first, by tunneling RTP packets over TCP and secondly by employing an RTP server rate control which does not exceed a variable rate constraint derived from the recently developed TFRC protocol. To allow a reasonable fair comparison between TCP and TFRC, we assume a simple retransmission mechanism on top of TFRC. We consider streaming from a server in the public Internet to both wired and wireless clients. For the wireless case we assumed a client which is connected to the public Internet via a dedicated 64 kbps WCDMA streaming bearer. Simulation results carried out in ns-2 show that TCP and TFRC can not fully utilize the WCDMA bearer at 5% packet loss rate over the shared public Internet link. Smooth playout of a typical 64 kbps video stream would require high initial buffering delays (>10 seconds) and large receiver buffer sizes (>60 KB). We finally investigate the gains from a proxy that splits the connection and uses TCP-friendly congestion control only over the shared part of the client-server connection. Simulation results show improvements in average throughput and wireless link utilization. By employing appropriate packet re-scheduling mechanisms, the initial buffering delay and the client buffer size for a typical 64 kbps video stream can be decreased by a factor of three to four.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"36 1","pages":"17-24"},"PeriodicalIF":0.0,"publicationDate":"2002-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85116021","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}
We evaluate the multicasting gain over unicast in the cellular networks, where cells are engineered for a specific target call blocking probability. Our approach is Monte-Carlo simulation of dynamic multicast connections, and the traditional Engset model for the unicast traffic. We predict the gain given by multicasting by using earlier studied traffic patterns, and conclude that intervention of the network operator is needed to secure a significant multicasting gain.
{"title":"Multicasting vs. unicasting in mobile communication systems","authors":"J. Aaltonen, J. Karvo, S. Aalto","doi":"10.1145/570790.570808","DOIUrl":"https://doi.org/10.1145/570790.570808","url":null,"abstract":"We evaluate the multicasting gain over unicast in the cellular networks, where cells are engineered for a specific target call blocking probability. Our approach is Monte-Carlo simulation of dynamic multicast connections, and the traditional Engset model for the unicast traffic. We predict the gain given by multicasting by using earlier studied traffic patterns, and conclude that intervention of the network operator is needed to secure a significant multicasting gain.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"17 1","pages":"104-108"},"PeriodicalIF":0.0,"publicationDate":"2002-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83241612","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 scheme proposed in this paper balances the partly conflicting objectives of meeting the diverse quality of service (QoS) needs of mobile hosts (MHs) and achieving high uplink throughput in a Direct Sequence Code Division Multiple Access (DS-CDMA) based cellular network. The QoS needs of the MHs are modeled using the notion of a service curve, which is a function characterizing the minimum number of bits a MH must transmit in any given time interval in order to meet its QoS requirement. Each MH is also assumed to have a specified bound on the acceptable bit error rate.The technique proposed in this paper maximizes the uplink throughput subject to the service curve constraints by jointly adapting the transmitted power and the number of spreading codes used by each MH in relaying its data bits. During this joint adaptation, the technique also imposes specified bounds on the transmitted power and the number of spreading codes that a MH can handle. The proposed technique is evaluated using a discrete-event simulation. The evaluation shows that the proposed scheme can effectively balance the two above-mentioned objectives.
{"title":"Service curve assurances versus uplink throughput in CDMA networks","authors":"Lun Tong, P. Ramanathan, A. Sayeed","doi":"10.1145/605991.606001","DOIUrl":"https://doi.org/10.1145/605991.606001","url":null,"abstract":"The scheme proposed in this paper balances the partly conflicting objectives of meeting the diverse quality of service (QoS) needs of mobile hosts (MHs) and achieving high uplink throughput in a Direct Sequence Code Division Multiple Access (DS-CDMA) based cellular network. The QoS needs of the MHs are modeled using the notion of a service curve, which is a function characterizing the minimum number of bits a MH must transmit in any given time interval in order to meet its QoS requirement. Each MH is also assumed to have a specified bound on the acceptable bit error rate.The technique proposed in this paper maximizes the uplink throughput subject to the service curve constraints by jointly adapting the transmitted power and the number of spreading codes used by each MH in relaying its data bits. During this joint adaptation, the technique also imposes specified bounds on the transmitted power and the number of spreading codes that a MH can handle. The proposed technique is evaluated using a discrete-event simulation. The evaluation shows that the proposed scheme can effectively balance the two above-mentioned objectives.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"35 1","pages":"74-81"},"PeriodicalIF":0.0,"publicationDate":"2001-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75202548","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}
As the number of Mobile IP users grows, so will the signaling overhead associated with Internet mobility management in the core IP network. This presents a significant challenge to Mobile IP as the number of mobile devices scale-up. In cellular networks, registration and paging techniques are used to minimize the signaling overhead and optimize the mobility management performance. Currently, Mobile IP supports registration but not paging. In this paper, we argue that Mobile IP should be extended to support paging to improve the scalability of the protocol to handle large populations of mobile devices. To address this, we introduce P-MIP, a set of simple paging extensions for Mobile IP, and discuss the construction of paging areas, movement detection, registration, paging and data handling. We present analysis and simulation results for Mobile IP with and without paging extensions, and show that P-MIP can scale well supporting large numbers of mobile devices with reduced signaling under a wide variety of system conditions. The ns-2P-MIP source code used to evaluate the protocol in this paper is available on the web (comet.columbia.edu/pmip).
{"title":"P-MIP: paging in mobile IP","authors":"Xiaowei Zhang, Javier Gomez, A. Campbell","doi":"10.1145/605991.605998","DOIUrl":"https://doi.org/10.1145/605991.605998","url":null,"abstract":"As the number of Mobile IP users grows, so will the signaling overhead associated with Internet mobility management in the core IP network. This presents a significant challenge to Mobile IP as the number of mobile devices scale-up. In cellular networks, registration and paging techniques are used to minimize the signaling overhead and optimize the mobility management performance. Currently, Mobile IP supports registration but not paging. In this paper, we argue that Mobile IP should be extended to support paging to improve the scalability of the protocol to handle large populations of mobile devices. To address this, we introduce P-MIP, a set of simple paging extensions for Mobile IP, and discuss the construction of paging areas, movement detection, registration, paging and data handling. We present analysis and simulation results for Mobile IP with and without paging extensions, and show that P-MIP can scale well supporting large numbers of mobile devices with reduced signaling under a wide variety of system conditions. The ns-2P-MIP source code used to evaluate the protocol in this paper is available on the web (comet.columbia.edu/pmip).","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"30 1","pages":"44-54"},"PeriodicalIF":0.0,"publicationDate":"2001-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75425213","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}
There is interest in providing global communications service by using a Low Earth Orbit (LEO) satellite network, resulting in many proposals, the most ambitious of which is Teledesic, and the commercial implementation of constellations including Iridium and Globalstar. Many proposals intend to use ATM or an ATM-like switch fabric, and may also use ATM signaling. LEO satellite networks are mobile with respect to a fixed point on the earth, and therefore require an efficient ATM handover mechanism to provide continuous network connectivity. The Wireless ATM working group of the ATM Forum is standardising wireless extensions to ATM, of which connection handover is a major component. We identify weaknesses in the ATM Forum handover procedure when applied to LEO satellite networks, resulting in degradation of quality of service (QoS) during handover. We also propose a handover procedure, based on the handover framework established by the ATM Forum, which addresses these weaknesses and minimises the QoS degradation during handover.
{"title":"ATM connection handover in LEO satellite networks","authors":"Paul Grosser","doi":"10.1145/605991.606005","DOIUrl":"https://doi.org/10.1145/605991.606005","url":null,"abstract":"There is interest in providing global communications service by using a Low Earth Orbit (LEO) satellite network, resulting in many proposals, the most ambitious of which is Teledesic, and the commercial implementation of constellations including Iridium and Globalstar. Many proposals intend to use ATM or an ATM-like switch fabric, and may also use ATM signaling. LEO satellite networks are mobile with respect to a fixed point on the earth, and therefore require an efficient ATM handover mechanism to provide continuous network connectivity. The Wireless ATM working group of the ATM Forum is standardising wireless extensions to ATM, of which connection handover is a major component. We identify weaknesses in the ATM Forum handover procedure when applied to LEO satellite networks, resulting in degradation of quality of service (QoS) during handover. We also propose a handover procedure, based on the handover framework established by the ATM Forum, which addresses these weaknesses and minimises the QoS degradation during handover.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"10 1","pages":"103-110"},"PeriodicalIF":0.0,"publicationDate":"2001-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88663551","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
扫码关注我们
求助内容：
应助结果提醒方式：