Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.32
Xin Huang, S. Ganapathy, T. Wolf
Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such "services" are typically performed on some nodes along the path of a packet. We present a novel decentralized algorithm that can determine an allocation of services to network nodes. The algorithm can obtain globally optimal solutions for a single service and approximate solutions for two or more services. In our simulation results, we validate the correctness of the algorithm, quantify the quality of the approximations, and compare the results to those of a centralized algorithm. Our results show that the proposed algorithm presents an effective solution to the service placement problem that can be implemented in a realistic network.
{"title":"A Distributed Routing Algorithm for Networks with Data-Path Services","authors":"Xin Huang, S. Ganapathy, T. Wolf","doi":"10.1109/ICCCN.2008.ECP.32","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.32","url":null,"abstract":"Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such \"services\" are typically performed on some nodes along the path of a packet. We present a novel decentralized algorithm that can determine an allocation of services to network nodes. The algorithm can obtain globally optimal solutions for a single service and approximate solutions for two or more services. In our simulation results, we validate the correctness of the algorithm, quantify the quality of the approximations, and compare the results to those of a centralized algorithm. Our results show that the proposed algorithm presents an effective solution to the service placement problem that can be implemented in a realistic network.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128780061","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.43
Manish Kushwaha, Isaac Amundson, P. Völgyesi, P. Ahammad, G. Simon, X. Koutsoukos, Á. Lédeczi, S. Sastry
The paper describes a target tracking system running on a heterogeneous sensor network (HSN) and presents results gathered from a realistic deployment. The system fuses audio direction of arrival data from mote class devices and object detection measurements from embedded PCs equipped with cameras. The acoustic sensor nodes perform beamforming and measure the energy as a function of the angle. The camera nodes detect moving objects and estimate their angle. The sensor detections are sent to a centralized sensor fusion node via a combination of two wireless networks. The novelty of our system is the unique combination of target tracking methods customized for the application at hand and their implementation on an actual HSN platform.
{"title":"Multi-Modal Target Tracking Using Heterogeneous Sensor Networks","authors":"Manish Kushwaha, Isaac Amundson, P. Völgyesi, P. Ahammad, G. Simon, X. Koutsoukos, Á. Lédeczi, S. Sastry","doi":"10.1109/ICCCN.2008.ECP.43","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.43","url":null,"abstract":"The paper describes a target tracking system running on a heterogeneous sensor network (HSN) and presents results gathered from a realistic deployment. The system fuses audio direction of arrival data from mote class devices and object detection measurements from embedded PCs equipped with cameras. The acoustic sensor nodes perform beamforming and measure the energy as a function of the angle. The camera nodes detect moving objects and estimate their angle. The sensor detections are sent to a centralized sensor fusion node via a combination of two wireless networks. The novelty of our system is the unique combination of target tracking methods customized for the application at hand and their implementation on an actual HSN platform.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124663868","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.104
Andrew R. Dalton, S. Dandamudi, J. Hallstrom, S. K. Wahba
We present a testbed for visualizing the behavior of sensor network applications constructed using TinyOS 2.0. The testbed enables network designers to capture node-level runtime behaviors and to link the captured behaviors to form a network-level snapshot. A multi-resolution approach based on static selectors and dynamic filters helps to achieve manageable visualizations by including only those network nodes and program actions relevant to a global behavior of interest. We demonstrate the system's utility using a standard network example and summarize its resource usage and performance characteristics.
{"title":"A Testbed for Visualizing Sensornet Behavior","authors":"Andrew R. Dalton, S. Dandamudi, J. Hallstrom, S. K. Wahba","doi":"10.1109/ICCCN.2008.ECP.104","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.104","url":null,"abstract":"We present a testbed for visualizing the behavior of sensor network applications constructed using TinyOS 2.0. The testbed enables network designers to capture node-level runtime behaviors and to link the captured behaviors to form a network-level snapshot. A multi-resolution approach based on static selectors and dynamic filters helps to achieve manageable visualizations by including only those network nodes and program actions relevant to a global behavior of interest. We demonstrate the system's utility using a standard network example and summarize its resource usage and performance characteristics.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124734454","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.88
M. Veyseh, J. Garcia-Luna-Aceves
The parallel interaction medium access (PIMA) protocol is introduced to orchestrate channel access in a wireless ad hoc network when nodes are endowed with a single half- duplex radio, and can either transmit multiple packets to multiple destinations in parallel or receive multiple packets from multiple transmitters in parallel using OFDMA. Analytical and simulation results indicate that PIMA attains tremendous improvements in channel throughput compared to MAC protocols aimed at attaining concurrency via traditional channel switching techniques proposed in the past for multi-channel networks.
{"title":"Parallel Interaction Medium Access for Wireless Ad Hoc Networks","authors":"M. Veyseh, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.2008.ECP.88","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.88","url":null,"abstract":"The parallel interaction medium access (PIMA) protocol is introduced to orchestrate channel access in a wireless ad hoc network when nodes are endowed with a single half- duplex radio, and can either transmit multiple packets to multiple destinations in parallel or receive multiple packets from multiple transmitters in parallel using OFDMA. Analytical and simulation results indicate that PIMA attains tremendous improvements in channel throughput compared to MAC protocols aimed at attaining concurrency via traditional channel switching techniques proposed in the past for multi-channel networks.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116985252","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.46
J. Touch, Venkata K. Pingali
The recursive network architecture (RNA) explores the relationship of layering to protocol and network architecture. RNA examines the implications of using a single, tunable protocol, called a metaprotocol, for different layers of the protocol stack, reusing basic protocol operations across different protocol layers to avoid reimplementation. Its primary goal is to encourage cleaner cross-layer interaction, to support dynamic service composition, and to gain an understanding of how layering affects architecture. This paper provides a description of RNA and a recently completed initial prototype. The prototype extends the Click modular router with control capabilities including dynamic composition and discovery. These capabilities are used to demonstrate simple but flexible stacks of instances of a metaprotocol that are customizable at runtime.
{"title":"The RNA Metaprotocol","authors":"J. Touch, Venkata K. Pingali","doi":"10.1109/ICCCN.2008.ECP.46","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.46","url":null,"abstract":"The recursive network architecture (RNA) explores the relationship of layering to protocol and network architecture. RNA examines the implications of using a single, tunable protocol, called a metaprotocol, for different layers of the protocol stack, reusing basic protocol operations across different protocol layers to avoid reimplementation. Its primary goal is to encourage cleaner cross-layer interaction, to support dynamic service composition, and to gain an understanding of how layering affects architecture. This paper provides a description of RNA and a recently completed initial prototype. The prototype extends the Click modular router with control capabilities including dynamic composition and discovery. These capabilities are used to demonstrate simple but flexible stacks of instances of a metaprotocol that are customizable at runtime.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126795611","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.68
S. Nair, Erik Zentveld, B. Crispo, A. Tanenbaum
As the sale of digital content is moving more and more online, the content providers are beginning to realize that bandwidth infrastructures are not easily scalable. The emergence of peer-to-peer content delivery networks present these providers with a way to overcome this limitation. However, such networks have so far been ad-hoc in nature. One of the main reason for this has been the lack of incentives for end users to contribute their bandwidth to the network. In this paper we present the design and implementation of a peer-to-peer protocol named Floodgate that provides a micropayment based incentive for peers to contribute their bandwidth. Floodgate implements an optimistic fair exchange protocol and is designed to be resilient against targeted attacks. Performance measurements, including those conducted over the PlanetLab infrastructure, show that Floodgate's security and cryptographic overheads are low when compared against the standard BitTorrent implementation.
{"title":"Floodgate: A Micropayment Incentivized P2P Content Delivery Network","authors":"S. Nair, Erik Zentveld, B. Crispo, A. Tanenbaum","doi":"10.1109/ICCCN.2008.ECP.68","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.68","url":null,"abstract":"As the sale of digital content is moving more and more online, the content providers are beginning to realize that bandwidth infrastructures are not easily scalable. The emergence of peer-to-peer content delivery networks present these providers with a way to overcome this limitation. However, such networks have so far been ad-hoc in nature. One of the main reason for this has been the lack of incentives for end users to contribute their bandwidth to the network. In this paper we present the design and implementation of a peer-to-peer protocol named Floodgate that provides a micropayment based incentive for peers to contribute their bandwidth. Floodgate implements an optimistic fair exchange protocol and is designed to be resilient against targeted attacks. Performance measurements, including those conducted over the PlanetLab infrastructure, show that Floodgate's security and cryptographic overheads are low when compared against the standard BitTorrent implementation.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126146734","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.168
A. Bari, Yufei Xu, A. Jaekel
Two-tiered sensor networks have gained popularity in recent years, due to their ability to facilitate load-balanced data gathering, fault-tolerance as well as increased network connectivity and coverage. Using higher-powered relay nodes as cluster heads can lead to further improvements in network performance. It is important to determine an appropriate placement scheme for such relay nodes, in order to achieve specified coverage and connectivity requirements with as few relay nodes as possible. A significant amount of work has been done in this area in recent years. However, existing placement strategies typically do not consider energy dissipation due to routing and are not capable of optimizing the routing scheme and placement concurrently. In this paper, we propose an integrated integer linear program (ILP) formulation that determines the minimum number of relay nodes, along with their locations and a suitable communication strategy such that i) all sensor nodes are able to connect to at least ks relay nodes, ii) the upper tier relay node network is at least Kr-connected and iii) the network has a guaranteed lifetime. We also present an intersection based scheme for creating the initial set of potential relay node positions, which are used by our ILP, and evaluate its performance under different conditions. Experimental results on networks with hundreds of sensor nodes show that our approach leads to significant improvements over existing energy-unaware placement schemes.
{"title":"Integrated Placement and Routing of Relay Nodes for Fault-Tolerant Hierarchical Sensor Networks","authors":"A. Bari, Yufei Xu, A. Jaekel","doi":"10.1109/ICCCN.2008.ECP.168","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.168","url":null,"abstract":"Two-tiered sensor networks have gained popularity in recent years, due to their ability to facilitate load-balanced data gathering, fault-tolerance as well as increased network connectivity and coverage. Using higher-powered relay nodes as cluster heads can lead to further improvements in network performance. It is important to determine an appropriate placement scheme for such relay nodes, in order to achieve specified coverage and connectivity requirements with as few relay nodes as possible. A significant amount of work has been done in this area in recent years. However, existing placement strategies typically do not consider energy dissipation due to routing and are not capable of optimizing the routing scheme and placement concurrently. In this paper, we propose an integrated integer linear program (ILP) formulation that determines the minimum number of relay nodes, along with their locations and a suitable communication strategy such that i) all sensor nodes are able to connect to at least ks relay nodes, ii) the upper tier relay node network is at least Kr-connected and iii) the network has a guaranteed lifetime. We also present an intersection based scheme for creating the initial set of potential relay node positions, which are used by our ILP, and evaluate its performance under different conditions. Experimental results on networks with hundreds of sensor nodes show that our approach leads to significant improvements over existing energy-unaware placement schemes.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127416071","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.79
M. Youssef, Baek-Young Choi, C. Scoglio, E. Park
High bandwidth one-to-many applications emerging in IP over WDM optical networks demand multicast support at WDM layer so that data signals would be efficiently duplicated inside network without O/E/O conversion. Multicast trees in an optical layer can be built with light-trees which use light-splitting technique. Most of recent studies have been focused to efficiently build and configure light-trees without existing unicast or multicast traffic into consideration. In this paper we consider the dynamic and optimal design problem of multicast configuration for realistic and constrained WDM networks. In such a network, both unicast and multicast are supported, and WDM switches have limited number of wavelengths and light splitting capability. On the other hand, the amount of bandwidth per wavelength is abundant. Using subwavelength sharing among traffic demands of unicast and multicast, we build a hybrid virtual topology which exploits both existing light-trees and light- paths. By optimizing WDM resources in addition to resource sharing with existing unicast and multicast demands, we truly maximize the WDM layer capability and efficiently support more multicast traffic demands. We validate the efficiency of our approach with extensive simulations.
高带宽一对多应用程序出现在IP / WDM光网络多播支持需求在WDM层,这样数据信号有效地复制在网络没有O / E / O转换。光层中的组播树可以利用分光技术构建光树。最近的研究已经集中有效地构建和配置light-trees没有考虑现有的单播或多播流量。本文研究了现实约束下WDM网络组播配置的动态优化设计问题。在这种网络中，同时支持单播和多播，并且WDM交换机具有有限的波长数和分光能力。另一方面，每个波长的带宽量是丰富的。利用单播和组播业务需求之间的亚波长共享，我们构建了一种混合虚拟拓扑，该拓扑利用了现有的光树和光路。通过优化WDM资源，与现有的单播和组播需求共享资源，真正实现了WDM层能力的最大化，有效支持更多的组播业务需求。我们通过大量的仿真验证了我们方法的有效性。
{"title":"Dynamic Hybrid Topology Design for Multicast in Constrained WDM Networks","authors":"M. Youssef, Baek-Young Choi, C. Scoglio, E. Park","doi":"10.1109/ICCCN.2008.ECP.79","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.79","url":null,"abstract":"High bandwidth one-to-many applications emerging in IP over WDM optical networks demand multicast support at WDM layer so that data signals would be efficiently duplicated inside network without O/E/O conversion. Multicast trees in an optical layer can be built with light-trees which use light-splitting technique. Most of recent studies have been focused to efficiently build and configure light-trees without existing unicast or multicast traffic into consideration. In this paper we consider the dynamic and optimal design problem of multicast configuration for realistic and constrained WDM networks. In such a network, both unicast and multicast are supported, and WDM switches have limited number of wavelengths and light splitting capability. On the other hand, the amount of bandwidth per wavelength is abundant. Using subwavelength sharing among traffic demands of unicast and multicast, we build a hybrid virtual topology which exploits both existing light-trees and light- paths. By optimizing WDM resources in addition to resource sharing with existing unicast and multicast demands, we truly maximize the WDM layer capability and efficiently support more multicast traffic demands. We validate the efficiency of our approach with extensive simulations.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128058971","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.22
Qing Liu, C. Xie, T. Frangieh, N. Ghani, A. Gumaste, N. Rao, T. Lehman
Recent studies on inter-domain DWDM networks have focused on topology abstraction for state summarization, i.e. transforming a physical topology to a virtual mesh, tree, or star network. Although these schemes give very good inter- domain blocking reduction, associated inter-domain routing overheads are significant, particularly as the number of domains and border OXC nodes increase. To address these scalability limitations, novel routing update triggering policies for multi-domain DWDM networks are developed. The performance of inter-domain lightpath RWA and signaling schemes in conjunction with these strategies is then studied in order to gauge the overall effectiveness of these approaches.
{"title":"Inter-Domain Routing Scalability in Optical DWDM Networks","authors":"Qing Liu, C. Xie, T. Frangieh, N. Ghani, A. Gumaste, N. Rao, T. Lehman","doi":"10.1109/ICCCN.2008.ECP.22","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.22","url":null,"abstract":"Recent studies on inter-domain DWDM networks have focused on topology abstraction for state summarization, i.e. transforming a physical topology to a virtual mesh, tree, or star network. Although these schemes give very good inter- domain blocking reduction, associated inter-domain routing overheads are significant, particularly as the number of domains and border OXC nodes increase. To address these scalability limitations, novel routing update triggering policies for multi-domain DWDM networks are developed. The performance of inter-domain lightpath RWA and signaling schemes in conjunction with these strategies is then studied in order to gauge the overall effectiveness of these approaches.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"19 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133408686","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}
Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.106
Binbin Qian, Jie Wu
In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack of a fixed infrastructure to serve as the backbone of the network, it is difficult to manage nodes' locations and ensure stable node performance. In this paper, we introduce an extension of an algorithm, multi-path intelligent virtual mobile node (MIVMN) Abstraction, which effectively processes the unpredictable motion and availability of mobile nodes in MANETs. Earlier work has applied an abstract node, or virtual mobile node, that consists of a set of real nodes traveling on a predetermined path, or virtual path, which causes unavoidable failure when all the nodes that are emulating the virtual mobile node leave its region. The objective of this paper is to increase the message delivery ratio and decrease the fail ratio of the virtual mobile nodes. In order to achieve this, we allow the messages to switch between multiple Hamiltonian circles. Through simulation results we show that the MIVMN abstraction successfully meets our goals.
{"title":"Multi-Path Intelligent Virtual Mobile Nodes for Ad Hoc Networks","authors":"Binbin Qian, Jie Wu","doi":"10.1109/ICCCN.2008.ECP.106","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.106","url":null,"abstract":"In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack of a fixed infrastructure to serve as the backbone of the network, it is difficult to manage nodes' locations and ensure stable node performance. In this paper, we introduce an extension of an algorithm, multi-path intelligent virtual mobile node (MIVMN) Abstraction, which effectively processes the unpredictable motion and availability of mobile nodes in MANETs. Earlier work has applied an abstract node, or virtual mobile node, that consists of a set of real nodes traveling on a predetermined path, or virtual path, which causes unavoidable failure when all the nodes that are emulating the virtual mobile node leave its region. The objective of this paper is to increase the message delivery ratio and decrease the fail ratio of the virtual mobile nodes. In order to achieve this, we allow the messages to switch between multiple Hamiltonian circles. Through simulation results we show that the MIVMN abstraction successfully meets our goals.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132759055","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
扫码关注我们
求助内容：
应助结果提醒方式：