Pub Date : 2009-06-07DOI: 10.1109/ICUFN.2009.5174302
Ziyu Shao, S. Li
Network coding (NC) is a new paradigm in data transport and promises to change many aspects of networking. Starting with an introduction to basic NC concepts and results, this paper reviews the state of the art on a number of topics and points out promising research directions.
{"title":"The promise of network coding","authors":"Ziyu Shao, S. Li","doi":"10.1109/ICUFN.2009.5174302","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174302","url":null,"abstract":"Network coding (NC) is a new paradigm in data transport and promises to change many aspects of networking. Starting with an introduction to basic NC concepts and results, this paper reviews the state of the art on a number of topics and points out promising research directions.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121708892","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174317
Dongseung Shin, Hongseok Yoo, Dongkyun Kim
In vehicular ad hoc networks (VANETs), providing drivers with safety service such as the reliable delivery of an emergency message is a challenge. To propagate the emergency message quickly to all vehicles, the broadcasting technique can be utilized, however, the broadcasting is vulnerable to unreliability. In this paper, we therefore propose a scheme to improve the broadcast reliability by allowing nodes to overhear an ACK message. A selected node transmits an ACK message on behalf of other receiving nodes. If a node overhears an ACK message, but has not received the corresponding message, the node considers that the emergency message is lost and requests the selected node to rebroadcast the emergency message. Using ns-2 simulator, we verify that our proposed scheme provides more reliable service than other existing solutions.
{"title":"EMDOR: Emergency message dissemination with ACK-overhearing based retransmission","authors":"Dongseung Shin, Hongseok Yoo, Dongkyun Kim","doi":"10.1109/ICUFN.2009.5174317","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174317","url":null,"abstract":"In vehicular ad hoc networks (VANETs), providing drivers with safety service such as the reliable delivery of an emergency message is a challenge. To propagate the emergency message quickly to all vehicles, the broadcasting technique can be utilized, however, the broadcasting is vulnerable to unreliability. In this paper, we therefore propose a scheme to improve the broadcast reliability by allowing nodes to overhear an ACK message. A selected node transmits an ACK message on behalf of other receiving nodes. If a node overhears an ACK message, but has not received the corresponding message, the node considers that the emergency message is lost and requests the selected node to rebroadcast the emergency message. Using ns-2 simulator, we verify that our proposed scheme provides more reliable service than other existing solutions.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125177114","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174275
Yi-Quan Ke, S. Yoo
MAC protocol design for cognitive radio (CR) should provide access control for unused spectrum without or with minimal interference to primary users. On this basis, considering how to improve the throughput can make CR MAC protocol more meaningful. To achieve these goals, in this paper a TDMA based multi-channel cognitive radio MAC (MCR-MAC) protocol is proposed for wireless ad hoc network that provides for cooperative detection and protection of incumbent systems around communication pair. By mainly focusing on possible signal collisions between incumbent devices and cognitive radio ad hoc devices, any kind of the hidden incumbent terminal problem is handled in our proposed scheme. To this end, a simple but efficient emergency notification exchanging mechanism between neighbor nodes with little overhead is proposed. Simulation results show that the proposed MCR-MAC can reduce interference on incumbents greatly and improve the throughput remarkably.
{"title":"MCR-MAC: Multi-channel cognitive radio MAC protocol for cooperative incumbent system protection in wireless ad-hoc network","authors":"Yi-Quan Ke, S. Yoo","doi":"10.1109/ICUFN.2009.5174275","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174275","url":null,"abstract":"MAC protocol design for cognitive radio (CR) should provide access control for unused spectrum without or with minimal interference to primary users. On this basis, considering how to improve the throughput can make CR MAC protocol more meaningful. To achieve these goals, in this paper a TDMA based multi-channel cognitive radio MAC (MCR-MAC) protocol is proposed for wireless ad hoc network that provides for cooperative detection and protection of incumbent systems around communication pair. By mainly focusing on possible signal collisions between incumbent devices and cognitive radio ad hoc devices, any kind of the hidden incumbent terminal problem is handled in our proposed scheme. To this end, a simple but efficient emergency notification exchanging mechanism between neighbor nodes with little overhead is proposed. Simulation results show that the proposed MCR-MAC can reduce interference on incumbents greatly and improve the throughput remarkably.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127158646","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174303
Kuang Xu, Pan Hui, V. Li, J. Crowcroft, V. Latora, P. Lio’
Opportunistic networking largely relies on human-carried devices as relays to move data across the network. Human altruistic behavior is an important factor in the feasibility and performance of such a system. In this paper, we study the impact of different altruism distributions on the system throughput and delay of opportunistic communications. We evaluate the system performance by utilizing social network topological models and experimental human mobility traces with different communication patterns. We also discuss several observations from the result of the study. To the best of our knowledge, this is the first study of the impact of altruism on opportunistic communications.
{"title":"Impact of altruism on opportunistic communications","authors":"Kuang Xu, Pan Hui, V. Li, J. Crowcroft, V. Latora, P. Lio’","doi":"10.1109/ICUFN.2009.5174303","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174303","url":null,"abstract":"Opportunistic networking largely relies on human-carried devices as relays to move data across the network. Human altruistic behavior is an important factor in the feasibility and performance of such a system. In this paper, we study the impact of different altruism distributions on the system throughput and delay of opportunistic communications. We evaluate the system performance by utilizing social network topological models and experimental human mobility traces with different communication patterns. We also discuss several observations from the result of the study. To the best of our knowledge, this is the first study of the impact of altruism on opportunistic communications.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120954567","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174296
J. Strassner, S. van der Meer, B. Jennings, Miguel Ponce de Leon
The current Internet, while successful in many aspects, has a set of associated architectural and business problems that threaten its stability and inhibit new advances, such as seamlessly supporting Ubiquitous Computing applications. This paper proposes a set of autonomic mechanisms that can manage the Future Internet. The context-aware governance features of this approach are particularly suitable for also enabling Ubiquitous Computing applications.
{"title":"An autonomic architecture to manage Ubiquitous Computing networks and applications","authors":"J. Strassner, S. van der Meer, B. Jennings, Miguel Ponce de Leon","doi":"10.1109/ICUFN.2009.5174296","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174296","url":null,"abstract":"The current Internet, while successful in many aspects, has a set of associated architectural and business problems that threaten its stability and inhibit new advances, such as seamlessly supporting Ubiquitous Computing applications. This paper proposes a set of autonomic mechanisms that can manage the Future Internet. The context-aware governance features of this approach are particularly suitable for also enabling Ubiquitous Computing applications.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115767714","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174301
Shihyon Park, J. DeDourek
This paper evaluates QoS techniques for transmission of real-time video that use a DiffServ mechanism that includes an efficient bandwidth agent to allocate bandwidth on heterogeneous networks, a Hierarchical Token Bucket (HTB) queuing scheme at the output interface of Linux-based routers, and a policing mechanism at the incoming interface of the edge router (ER) in a Linux-based testbed. The testbed consists of several different networks including IEEE 802.11b to find the characteristics of real-time video traffic using MPEG streaming video and VLC for server/client so that we will have a good idea what bandwidth and burst size is required to stream MPEG video through the QoS Diffserv domain. We set an efficient testbed to investigate how real-time streams behave in the QoS scheme, and to provide a realistic recommendation to manage the available bandwidth for both the QoS provider and clients.
{"title":"Quality of service (QoS) for video transmission","authors":"Shihyon Park, J. DeDourek","doi":"10.1109/ICUFN.2009.5174301","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174301","url":null,"abstract":"This paper evaluates QoS techniques for transmission of real-time video that use a DiffServ mechanism that includes an efficient bandwidth agent to allocate bandwidth on heterogeneous networks, a Hierarchical Token Bucket (HTB) queuing scheme at the output interface of Linux-based routers, and a policing mechanism at the incoming interface of the edge router (ER) in a Linux-based testbed. The testbed consists of several different networks including IEEE 802.11b to find the characteristics of real-time video traffic using MPEG streaming video and VLC for server/client so that we will have a good idea what bandwidth and burst size is required to stream MPEG video through the QoS Diffserv domain. We set an efficient testbed to investigate how real-time streams behave in the QoS scheme, and to provide a realistic recommendation to manage the available bandwidth for both the QoS provider and clients.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131242445","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174306
Wen-Lin Yang, Cheng-Huang Tung
In this study, we consider an optimization problem concerning about how to build a multicast tree to deliver continuous multimedia streams to a large number of mesh clients on the wireless mesh networks simultaneously. In order to provide high-quality streams to users, we need to allocate non-overlapping channels to communication links to avoid interference. Since the number of non-overlapping channels is very limited, some links may not have channels allocated, and the resulting multicast tree may cover only a subset of subscribers. Since the more subscribers can be serviced, the more profits we can make. The goal of this research is then set to determine a multicast tree that can maximize the number of serviced subscribers. An algorithm named LCMR is proposed for the problem described above. The experimental results show that the partial multicast tree determined by our LCMR method outperforms the trees found by the previous published approaches.
{"title":"An interference-free multicast for mesh networks with directional antennas","authors":"Wen-Lin Yang, Cheng-Huang Tung","doi":"10.1109/ICUFN.2009.5174306","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174306","url":null,"abstract":"In this study, we consider an optimization problem concerning about how to build a multicast tree to deliver continuous multimedia streams to a large number of mesh clients on the wireless mesh networks simultaneously. In order to provide high-quality streams to users, we need to allocate non-overlapping channels to communication links to avoid interference. Since the number of non-overlapping channels is very limited, some links may not have channels allocated, and the resulting multicast tree may cover only a subset of subscribers. Since the more subscribers can be serviced, the more profits we can make. The goal of this research is then set to determine a multicast tree that can maximize the number of serviced subscribers. An algorithm named LCMR is proposed for the problem described above. The experimental results show that the partial multicast tree determined by our LCMR method outperforms the trees found by the previous published approaches.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117337065","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174274
K. Kwak, Rumin Yang
A co-basis is a special orthonormal basis, of the Hilbert function space, whose base functions are shape-invariant to Fourier transform except for phase shifts known a priori. A notable advantage of the co-basis orthonormal-expansion method lies in that it essentially conceals the difference between time- and frequency-domains expansions, such that expanding the UWB spectra (frequency domain) is almost equivalent to expanding the pulse shapes (time domain), making the designing task significantly simple. This paper highlights this advantages through tutorial examples on the design of UWB pulses with DAA functionality that meets Korea spectrum regulations.
{"title":"Cognitive UWB pulse design using co-basis expansion method","authors":"K. Kwak, Rumin Yang","doi":"10.1109/ICUFN.2009.5174274","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174274","url":null,"abstract":"A co-basis is a special orthonormal basis, of the Hilbert function space, whose base functions are shape-invariant to Fourier transform except for phase shifts known a priori. A notable advantage of the co-basis orthonormal-expansion method lies in that it essentially conceals the difference between time- and frequency-domains expansions, such that expanding the UWB spectra (frequency domain) is almost equivalent to expanding the pulse shapes (time domain), making the designing task significantly simple. This paper highlights this advantages through tutorial examples on the design of UWB pulses with DAA functionality that meets Korea spectrum regulations.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130671814","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174304
Kuang Xu, Guang-Hua Yang, V. Li, S. Chan
In opportunistic networks, communities of mobile entities may be utilized to improve the efficiency of message forwarding. However, identifying communities that are dynamically changing in mobile environment is non-trivial. Based on random walk on graphs, in this paper we present a community detection algorithm that takes into account the aging and weight of contacts between mobile entities. Our idea originates from message-forwarding operations in opportunistic networks. We evaluate the algorithm on both computer-generated networks and real-world human mobility traces. The result shows that our proposed algorithm can find the communities and detect the changes in their structures over time.
{"title":"Detecting dynamic communities in opportunistic networks","authors":"Kuang Xu, Guang-Hua Yang, V. Li, S. Chan","doi":"10.1109/ICUFN.2009.5174304","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174304","url":null,"abstract":"In opportunistic networks, communities of mobile entities may be utilized to improve the efficiency of message forwarding. However, identifying communities that are dynamically changing in mobile environment is non-trivial. Based on random walk on graphs, in this paper we present a community detection algorithm that takes into account the aging and weight of contacts between mobile entities. Our idea originates from message-forwarding operations in opportunistic networks. We evaluate the algorithm on both computer-generated networks and real-world human mobility traces. The result shows that our proposed algorithm can find the communities and detect the changes in their structures over time.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114167025","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 : 2009-06-07DOI: 10.1109/ICUFN.2009.5174287
Donghee Kim, Juho Lee, Hyeonwoo Lee
Transmission power allocation scheme for soft frequency reuse(SFR) is proposed in tightly coordinated cells where neighboring cells are controlled by a central scheduler. Also fast adaptive SFR scheme is proposed. While SFR is the effective technique to increase cell edge user throughput, it costs the degradation of cell average throughput. The cost increases when SFR fails to be fast adaptive in the change of user distribution. The proposed scheme enables coordinated cells to control transmission power adaptively according to user distribution so that it minimizes the loss of cell average throughput introduced from SFR while it guarantees enhancement of cell edge user throughput. Evaluation result are shown for different number of subbands and compared to static SFR.
{"title":"Subband power allocation for tightly coordinated cellular systems","authors":"Donghee Kim, Juho Lee, Hyeonwoo Lee","doi":"10.1109/ICUFN.2009.5174287","DOIUrl":"https://doi.org/10.1109/ICUFN.2009.5174287","url":null,"abstract":"Transmission power allocation scheme for soft frequency reuse(SFR) is proposed in tightly coordinated cells where neighboring cells are controlled by a central scheduler. Also fast adaptive SFR scheme is proposed. While SFR is the effective technique to increase cell edge user throughput, it costs the degradation of cell average throughput. The cost increases when SFR fails to be fast adaptive in the change of user distribution. The proposed scheme enables coordinated cells to control transmission power adaptively according to user distribution so that it minimizes the loss of cell average throughput introduced from SFR while it guarantees enhancement of cell edge user throughput. Evaluation result are shown for different number of subbands and compared to static SFR.","PeriodicalId":371189,"journal":{"name":"2009 First International Conference on Ubiquitous and Future Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123198528","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
扫码关注我们
求助内容：
应助结果提醒方式：