Pub Date : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534997
Peng Wang, S. Bohacek
A large number of algorithms focus on using scheduling to maximize the stability region. However, this goal does not necessarily result in good performance in terms of supporting a large number of users where users' average time to transfer a file meets a target. This paper develops several computationally efficient schemes for computing schedules for time-varying offered load. Two important findings are that when the traffic is time-varying, the computational complexity can be substantially reduced by using the previous schedule as an initial starting point of the optimization (i.e., warm start). Furthermore, very few iterations (e.g., one iteration) are needed to get a suitable schedule, that is, there is no need to wait for the optimization to converge. A second finding is that there is no need to repeatedly solve the maximum weighted independent set (MWIS) problem. Instead, the MWIS problem is only solved during initialization. Because of the computational efficiency, the schemes presented can be used to frequently update schedules, allowing schedules to quickly adapt to changes in the offered load. Consequently, as compared to other scheduling schemes, the schemes developed support a larger number of users for a given average service time.
{"title":"Fast computation of schedules for dynamic traffic in wireless mesh networks","authors":"Peng Wang, S. Bohacek","doi":"10.1109/WOWMOM.2010.5534997","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534997","url":null,"abstract":"A large number of algorithms focus on using scheduling to maximize the stability region. However, this goal does not necessarily result in good performance in terms of supporting a large number of users where users' average time to transfer a file meets a target. This paper develops several computationally efficient schemes for computing schedules for time-varying offered load. Two important findings are that when the traffic is time-varying, the computational complexity can be substantially reduced by using the previous schedule as an initial starting point of the optimization (i.e., warm start). Furthermore, very few iterations (e.g., one iteration) are needed to get a suitable schedule, that is, there is no need to wait for the optimization to converge. A second finding is that there is no need to repeatedly solve the maximum weighted independent set (MWIS) problem. Instead, the MWIS problem is only solved during initialization. Because of the computational efficiency, the schemes presented can be used to frequently update schedules, allowing schedules to quickly adapt to changes in the offered load. Consequently, as compared to other scheduling schemes, the schemes developed support a larger number of users for a given average service time.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126244690","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534933
Angelos K. Marnerides, D. Hutchison, D. Pezaros
Network traffic abnormalities pose one of the greatest threats for networked environments. Autonomic communications offer a solution: it should be possible to design network mechanisms that behave adaptively and respond to any anomalous phenomenon that threatens normal network behaviour. In this paper we present the design of an adaptive anomaly detection component that has been built as part of an autonomic network system. We have implemented an entropy estimator to predict the onset of anomalous traffic behaviour within an autonomic resilience framework, and a Supervised Naive Bayesian classifier which synergistically empower the core properties of self-adaptation, self-learning and self-protection for next generation networks. Being part of an always-on, automated measurement and control infrastructure, such mechanism enforces the adaptive system reaction to suboptimal network operation and its subsequent restoration, while requiring minimal static (re)configuration and operator intervention.
{"title":"Autonomic diagnosis of anomalous network traffic","authors":"Angelos K. Marnerides, D. Hutchison, D. Pezaros","doi":"10.1109/WOWMOM.2010.5534933","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534933","url":null,"abstract":"Network traffic abnormalities pose one of the greatest threats for networked environments. Autonomic communications offer a solution: it should be possible to design network mechanisms that behave adaptively and respond to any anomalous phenomenon that threatens normal network behaviour. In this paper we present the design of an adaptive anomaly detection component that has been built as part of an autonomic network system. We have implemented an entropy estimator to predict the onset of anomalous traffic behaviour within an autonomic resilience framework, and a Supervised Naive Bayesian classifier which synergistically empower the core properties of self-adaptation, self-learning and self-protection for next generation networks. Being part of an always-on, automated measurement and control infrastructure, such mechanism enforces the adaptive system reaction to suboptimal network operation and its subsequent restoration, while requiring minimal static (re)configuration and operator intervention.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"17 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114110655","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534934
Robert Gazda, D. Purkayastha, Xin Feng, F. Samimi
In today's media environment, multimedia content is accessed by mobile users in a silo fashion, with content locked to individual point devices and networks. Content, available on one device or one network, may not be accessed from other devices, or over other networks. Users cannot easily share multimedia sessions across devices, such as smartphones and laptops. Media content does not adapt with user mobility. Specifically, users cannot take advantage of the multitude of media devices that they encounter as they move, in order to achieve a "best" possible multimedia experience. In the future, media will transition seamlessly between devices, networks, and access technologies with the user, as the user moves. Session continuity technologies, driven by global standards bodies, will make seamless media mobility possible. Media content will be optimized based on the real-time conditions of the user, including: available networks and bandwidth, available device configurations and rendering capabilities, battery consumption, memory and processing power, location, cost, etc. Our demonstration allows a user to transfer a streaming video session across a collection of laptop and smartphone devices. Specifically, the demonstration includes: a MAC Pro laptop, a MacBook Air laptop, Android Gl / G2 smartphones, and a Blackberry Bold 9000 smartphone. Each terminal device runs a small media application, which presents the user with a set of video clips for viewing. When the user selects a clip, the application server commands the media server to stream the requested video. Each video may be viewed to completion; or, the user may transfer the video session to any of the other terminal devices in the demonstration. With a click or touch of the screen, the media application presents the user with a list of available devices to engage in media transfer sessions. With another click or touch, the user may trigger a media session transfer: • The application server dynamically configures the media server and triggers the target device to get engaged in the streaming session. • The target device initializes its media player, which begins to buffer the video stream. During buffering time, which lasts a few seconds, an advertisement image is displayed (pre-roll canvas). • The originating device continues to play the video, until the video session begins playing on the target device. • The target device notifies the originating device as soon as its initialization is complete and it starts playing the video. Upon receiving the notification, the originating device tears down the video session and returns to the media application home screen.
{"title":"Demonstration of seamless multimedia session transfer to support pervasive mobile computing","authors":"Robert Gazda, D. Purkayastha, Xin Feng, F. Samimi","doi":"10.1109/WOWMOM.2010.5534934","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534934","url":null,"abstract":"In today's media environment, multimedia content is accessed by mobile users in a silo fashion, with content locked to individual point devices and networks. Content, available on one device or one network, may not be accessed from other devices, or over other networks. Users cannot easily share multimedia sessions across devices, such as smartphones and laptops. Media content does not adapt with user mobility. Specifically, users cannot take advantage of the multitude of media devices that they encounter as they move, in order to achieve a \"best\" possible multimedia experience. In the future, media will transition seamlessly between devices, networks, and access technologies with the user, as the user moves. Session continuity technologies, driven by global standards bodies, will make seamless media mobility possible. Media content will be optimized based on the real-time conditions of the user, including: available networks and bandwidth, available device configurations and rendering capabilities, battery consumption, memory and processing power, location, cost, etc. Our demonstration allows a user to transfer a streaming video session across a collection of laptop and smartphone devices. Specifically, the demonstration includes: a MAC Pro laptop, a MacBook Air laptop, Android Gl / G2 smartphones, and a Blackberry Bold 9000 smartphone. Each terminal device runs a small media application, which presents the user with a set of video clips for viewing. When the user selects a clip, the application server commands the media server to stream the requested video. Each video may be viewed to completion; or, the user may transfer the video session to any of the other terminal devices in the demonstration. With a click or touch of the screen, the media application presents the user with a list of available devices to engage in media transfer sessions. With another click or touch, the user may trigger a media session transfer: • The application server dynamically configures the media server and triggers the target device to get engaged in the streaming session. • The target device initializes its media player, which begins to buffer the video stream. During buffering time, which lasts a few seconds, an advertisement image is displayed (pre-roll canvas). • The originating device continues to play the video, until the video session begins playing on the target device. • The target device notifies the originating device as soon as its initialization is complete and it starts playing the video. Upon receiving the notification, the originating device tears down the video session and returns to the media application home screen.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121733902","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534955
Youndo Lee, Kideok Cho, T. Kwon, Yanghee Choi
Flooding, that is to deliver a packet from one node to all other nodes in the network, is an integral part of many wireless protocols. Flooding is often implemented by a series of broadcasts of each node and this causes some problems such as the broadcast storm and low reliability, by being engaged with the effects of radio signal propagation, e.g., multipath fading and interference. Many researchers have studied these problems over the years, however, most of these studies have been carried out assuming that all nodes in the network are equipped with a single radio interface and utilize only a single channel. This implies that most of the existing mechanisms that enhance the performance of flooding in wireless networks will not work in multi-radio multi-channel wireless mesh networks (MR-MC WMNs). Motivated by this, in this paper, we propose a flooding mechanism that works well in MR-MC WMNs. Our flooding mechanism, which can operate with an arbitrary number of radio interfaces and channels, increases the reliability of flooding while alleviates the broadcast storm problem, using only local information. Through a detailed simulation study, we demonstrate that our flooding mechanism improves both the reliability and the efficiency of flooding in MR-MC WMNs.
{"title":"A robust flooding algorithm in multi-radio multi-channel wireless mesh networks","authors":"Youndo Lee, Kideok Cho, T. Kwon, Yanghee Choi","doi":"10.1109/WOWMOM.2010.5534955","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534955","url":null,"abstract":"Flooding, that is to deliver a packet from one node to all other nodes in the network, is an integral part of many wireless protocols. Flooding is often implemented by a series of broadcasts of each node and this causes some problems such as the broadcast storm and low reliability, by being engaged with the effects of radio signal propagation, e.g., multipath fading and interference. Many researchers have studied these problems over the years, however, most of these studies have been carried out assuming that all nodes in the network are equipped with a single radio interface and utilize only a single channel. This implies that most of the existing mechanisms that enhance the performance of flooding in wireless networks will not work in multi-radio multi-channel wireless mesh networks (MR-MC WMNs). Motivated by this, in this paper, we propose a flooding mechanism that works well in MR-MC WMNs. Our flooding mechanism, which can operate with an arbitrary number of radio interfaces and channels, increases the reliability of flooding while alleviates the broadcast storm problem, using only local information. Through a detailed simulation study, we demonstrate that our flooding mechanism improves both the reliability and the efficiency of flooding in MR-MC WMNs.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133124167","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534935
Surendar Chandra, Xuwen Yu
Asynchronous group communication systems propagate updates from each group member to every other member. Contemporary users are wireless and operate from a variety of locations. Hence, we investigate the propagation performance for these users. An analysis of wireless users in academia, corporation and in a city-wide hotspot federation shows that the availability durations and the duration between sessions depends on the locale. A longer term analysis shows that the user session lengths are becoming smaller while the duration between sessions are becoming larger with significant user churn. We show that the propagation performance depends on the locale. New users incur a heavy cost in receiving updates from prior users; applications need to develop expiration mechanisms to reduce this overhead. Also, since users regularly leave the system, practical communication mechanisms need to choose their propagation periodicity in order to respond to scenarios when the user abruptly leaves the system without propagating their updates to other users.
{"title":"An analysis of distributed and asynchronous wireless group communication mechanisms","authors":"Surendar Chandra, Xuwen Yu","doi":"10.1109/WOWMOM.2010.5534935","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534935","url":null,"abstract":"Asynchronous group communication systems propagate updates from each group member to every other member. Contemporary users are wireless and operate from a variety of locations. Hence, we investigate the propagation performance for these users. An analysis of wireless users in academia, corporation and in a city-wide hotspot federation shows that the availability durations and the duration between sessions depends on the locale. A longer term analysis shows that the user session lengths are becoming smaller while the duration between sessions are becoming larger with significant user churn. We show that the propagation performance depends on the locale. New users incur a heavy cost in receiving updates from prior users; applications need to develop expiration mechanisms to reduce this overhead. Also, since users regularly leave the system, practical communication mechanisms need to choose their propagation periodicity in order to respond to scenarios when the user abruptly leaves the system without propagating their updates to other users.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132348410","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534942
J. Koskela, A. Gurtov
We present the design and evaluation of a secure peer-to-peer HTTP middleware framework that enables a multitude of web applications without relying on service providers. The framework is designed to be deployed in existing network environments, allowing ordinary users to create private services without investing in network infrastructure. Compared to previous work, scalability, NAT/firewall traversal and peer mobility is achieved without the need for maintaining dedicated servers by utilizing new network protocols and re-using existing network resources.
{"title":"A secure peer-to-peer web framework","authors":"J. Koskela, A. Gurtov","doi":"10.1109/WOWMOM.2010.5534942","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534942","url":null,"abstract":"We present the design and evaluation of a secure peer-to-peer HTTP middleware framework that enables a multitude of web applications without relying on service providers. The framework is designed to be deployed in existing network environments, allowing ordinary users to create private services without investing in network infrastructure. Compared to previous work, scalability, NAT/firewall traversal and peer mobility is achieved without the need for maintaining dedicated servers by utilizing new network protocols and re-using existing network resources.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132025174","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534896
Jiao Zhang, Fengyuan Ren, Tao He, Chuang Lin
Data aggregation has been widely recognized as an efficient method to reduce energy consumption in wireless sensor networks, which can support a wide range of applications such as monitoring temperature, humidity, level, speed etc. The data sampled by the same kind of sensors have much redundancy since the sensor nodes are usually quite dense in wireless sensor networks. To make data aggregation more efficient, the packets with the same attribute, defined as the identifier of different data sampled by different sensors such as temperature sensors, humidity sensors, etc., should be gathered together. However, to the best of our knowledge, present data aggregation mechanisms did not take packet attribute into consideration. In this paper, we take the lead in introducing packet attribute into data aggregation and propose an Attribute-aware Data Aggregation mechanism using Dynamic Routing (ADADR) which can make packets with the same attribute convergent as much as possible and therefore improve the efficiency of data aggregation. This goal cannot be achieved by present static routing schemes employed in most of data aggregation mechanisms since they construct routes before transmitting the sampled data and thus can not dynamically forward packets in response to the variation of packets at intermediate nodes. Hence, we present a potential-based dynamic routing scheme which employs the concept of potential in physics and pheromone in ant colony to achieve our goal. The results of simulations in series of scenarios show that ADADR indeed conserve energy by reducing the average number of transmissions each packet needs to reach the sink and is scalable with regard to the network size.
{"title":"Attribute-aware data aggregation using dynamic routing in wireless sensor networks","authors":"Jiao Zhang, Fengyuan Ren, Tao He, Chuang Lin","doi":"10.1109/WOWMOM.2010.5534896","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534896","url":null,"abstract":"Data aggregation has been widely recognized as an efficient method to reduce energy consumption in wireless sensor networks, which can support a wide range of applications such as monitoring temperature, humidity, level, speed etc. The data sampled by the same kind of sensors have much redundancy since the sensor nodes are usually quite dense in wireless sensor networks. To make data aggregation more efficient, the packets with the same attribute, defined as the identifier of different data sampled by different sensors such as temperature sensors, humidity sensors, etc., should be gathered together. However, to the best of our knowledge, present data aggregation mechanisms did not take packet attribute into consideration. In this paper, we take the lead in introducing packet attribute into data aggregation and propose an Attribute-aware Data Aggregation mechanism using Dynamic Routing (ADADR) which can make packets with the same attribute convergent as much as possible and therefore improve the efficiency of data aggregation. This goal cannot be achieved by present static routing schemes employed in most of data aggregation mechanisms since they construct routes before transmitting the sampled data and thus can not dynamically forward packets in response to the variation of packets at intermediate nodes. Hence, we present a potential-based dynamic routing scheme which employs the concept of potential in physics and pheromone in ant colony to achieve our goal. The results of simulations in series of scenarios show that ADADR indeed conserve energy by reducing the average number of transmissions each packet needs to reach the sink and is scalable with regard to the network size.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132145157","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534915
Guillaume-Jean Herbiet, P. Bouvry
In this contribution, we present SHARC, a Sharper Heuristic for Assignment of Robust Communities. This algorithm performs distributed network partitioning into communities using epidemic propagation of community labels and the computation of a neighborhood similarity metric. Due to its decentralized nature, SHARC is scalable and well suited for networks where no global knowledge nor node coordination exist, like ad hoc networks. Besides, SHARC is computationally efficient and does not depend on configuration parameters. We validated our approach and compared it to alternative solutions using static and dynamic networks. Results show that SHARC provides a sharper and more robust community assignment and prevents the domination of a single community in both static and dynamic networks.
{"title":"SHARC: Community-based partitioning for mobile ad hoc networks using neighborhood similarity","authors":"Guillaume-Jean Herbiet, P. Bouvry","doi":"10.1109/WOWMOM.2010.5534915","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534915","url":null,"abstract":"In this contribution, we present SHARC, a Sharper Heuristic for Assignment of Robust Communities. This algorithm performs distributed network partitioning into communities using epidemic propagation of community labels and the computation of a neighborhood similarity metric. Due to its decentralized nature, SHARC is scalable and well suited for networks where no global knowledge nor node coordination exist, like ad hoc networks. Besides, SHARC is computationally efficient and does not depend on configuration parameters. We validated our approach and compared it to alternative solutions using static and dynamic networks. Results show that SHARC provides a sharper and more robust community assignment and prevents the domination of a single community in both static and dynamic networks.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"2 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133080431","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534990
P. Sitbon, W. Feng, N. Bulusu
For many applications in mobile wireless ad hoc networks (MANETs), forming an end-to-end data path is not always necessary; instead, the primary routing goal is often data collection or dissemination where only a data source is known. Routing algorithms must be carefully chosen in order to suit the needs of applications employing them. Our focus is on data collection applications in MANETs where limited mobility information is required to route data in a scalable manner. To address this goal, we employ the concepts of delay-tolerant networking (DTN) in which data makes progress toward a destination with high latency expectations and little knowledge of routing topology. Specifically, we present time-to-network (TTN) forwarding, a method of forwarding data generated by mobile nodes to a network endpoint in such a way that delivery latency is lowered without high networking cost. By segmenting mobility patterns into trips, we are able to apply TTN to a vehicular network using only an estimated destination arrival time for each vehicle. We evaluate TTN using mobility data from the TRANSIMS simulator for a real road network. Results show that our algorithm produces collection-to-network latencies similar to more generic algorithms but at a lower cost and with higher efficiency. Furthermore, we establish a lower bound for delivery latency in our experiments and compare it to TTN. This also helps normalize the interpretation of results specific to our mobility model.
{"title":"TTN: A time-to-network approach to data reporting in mobile ad hoc networks","authors":"P. Sitbon, W. Feng, N. Bulusu","doi":"10.1109/WOWMOM.2010.5534990","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534990","url":null,"abstract":"For many applications in mobile wireless ad hoc networks (MANETs), forming an end-to-end data path is not always necessary; instead, the primary routing goal is often data collection or dissemination where only a data source is known. Routing algorithms must be carefully chosen in order to suit the needs of applications employing them. Our focus is on data collection applications in MANETs where limited mobility information is required to route data in a scalable manner. To address this goal, we employ the concepts of delay-tolerant networking (DTN) in which data makes progress toward a destination with high latency expectations and little knowledge of routing topology. Specifically, we present time-to-network (TTN) forwarding, a method of forwarding data generated by mobile nodes to a network endpoint in such a way that delivery latency is lowered without high networking cost. By segmenting mobility patterns into trips, we are able to apply TTN to a vehicular network using only an estimated destination arrival time for each vehicle. We evaluate TTN using mobility data from the TRANSIMS simulator for a real road network. Results show that our algorithm produces collection-to-network latencies similar to more generic algorithms but at a lower cost and with higher efficiency. Furthermore, we establish a lower bound for delivery latency in our experiments and compare it to TTN. This also helps normalize the interpretation of results specific to our mobility model.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133712469","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 : 2010-06-14DOI: 10.1109/WOWMOM.2010.5534985
Chang Liu, K. Holroyd, Qing Zhu, K. Shen, Wenqi Zhou
Our recent feasibility study of a telephone-administrated Behavioral Migraine Management (BMM) program for teens revealed that while learning and improvements in migraine were encouraging, experience for teens could be further improved with on-demand access to BMM instruction and materials. To meet this demand, an iPhone application was developed to help adolescent migraine patients and their counselors manage migraine with our behavioral migraine management approach. This application provides on-demand access to audio, video and animated instructions to guide the learning and application of behavioral migraine management skills as well as a headache diary that allows adolescents and their counselors to monitor key migraine and medication use variables. The design, implementation, current status, and future plan of this BMM iPhone App for adolescents are described in this paper.
{"title":"Design and implementation of a behavioral migraine management iPhone app for adolescents with migraine","authors":"Chang Liu, K. Holroyd, Qing Zhu, K. Shen, Wenqi Zhou","doi":"10.1109/WOWMOM.2010.5534985","DOIUrl":"https://doi.org/10.1109/WOWMOM.2010.5534985","url":null,"abstract":"Our recent feasibility study of a telephone-administrated Behavioral Migraine Management (BMM) program for teens revealed that while learning and improvements in migraine were encouraging, experience for teens could be further improved with on-demand access to BMM instruction and materials. To meet this demand, an iPhone application was developed to help adolescent migraine patients and their counselors manage migraine with our behavioral migraine management approach. This application provides on-demand access to audio, video and animated instructions to guide the learning and application of behavioral migraine management skills as well as a headache diary that allows adolescents and their counselors to monitor key migraine and medication use variables. The design, implementation, current status, and future plan of this BMM iPhone App for adolescents are described in this paper.","PeriodicalId":384628,"journal":{"name":"2010 IEEE International Symposium on \"A World of Wireless, Mobile and Multimedia Networks\" (WoWMoM)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123459757","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
扫码关注我们
求助内容：
应助结果提醒方式：