This paper describes the design and implementation of a Media Server for Multimedia Home Network environments and particularly focuses on one of its components namely Content Management. A core design goal is the aggregation and presentation of content metadata regardless of location of the original source. The implementation of our user-centric approach proved to be an effective solution enabling a unified view of home and Internet content available to the user.
{"title":"Content Aware Media Server for Multimedia Home Network","authors":"G. Pekhteryev, F. Matsubara","doi":"10.1109/CCNC.2007.69","DOIUrl":"https://doi.org/10.1109/CCNC.2007.69","url":null,"abstract":"This paper describes the design and implementation of a Media Server for Multimedia Home Network environments and particularly focuses on one of its components namely Content Management. A core design goal is the aggregation and presentation of content metadata regardless of location of the original source. The implementation of our user-centric approach proved to be an effective solution enabling a unified view of home and Internet content available to the user.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132774833","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}
In this paper, we propose a simplified MIMO transmission scheme combined with symbol spreading, which can improve system performance without additional bandwidth or power resources under fast Rayleigh flat fading channels. The same scheme can also be viewed as a design of space-frequency codes for MIMO-OFDM systems with large frequency selectivity. The tensor product is used to generate rotation matrices for MIMO systems from well-designed ones that are known for single-antenna systems. Because of the lattice-based structure, sphere decoding can be employed to reduce the complexity of ML decoding while maintaining the near ML performance. Moreover, MMSE receivers can also be used due to the systematic structure at the transmitter. Simulation results have been provided to support good performance of the proposed scheme for uncoded system as well as coded system under IEEE 802.11n channel modeling.
{"title":"A Simplified Design for MIMO System with Symbol Spreading","authors":"Jun Yang, M. Ghosh","doi":"10.1109/CCNC.2007.93","DOIUrl":"https://doi.org/10.1109/CCNC.2007.93","url":null,"abstract":"In this paper, we propose a simplified MIMO transmission scheme combined with symbol spreading, which can improve system performance without additional bandwidth or power resources under fast Rayleigh flat fading channels. The same scheme can also be viewed as a design of space-frequency codes for MIMO-OFDM systems with large frequency selectivity. The tensor product is used to generate rotation matrices for MIMO systems from well-designed ones that are known for single-antenna systems. Because of the lattice-based structure, sphere decoding can be employed to reduce the complexity of ML decoding while maintaining the near ML performance. Moreover, MMSE receivers can also be used due to the systematic structure at the transmitter. Simulation results have been provided to support good performance of the proposed scheme for uncoded system as well as coded system under IEEE 802.11n channel modeling.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122218065","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}
Ultra Wideband (UWB) technology has been considered as one of the suitable transmission techniques for implementing a cognitive radio system, where spectrum-agile UWB waveforms achieve a number of spectral adaptation features. One approach for designing such waveforms relies on orthogonally combining PSWF (Prolate Spheroidal Wave Functions) based pulse wavelets. In a cognitive UWB radio environment when the transmit signal is M-ary pulse shape modulated, we can obtain M different eigenvalues corresponding to the M PSWF-based pulses while transmitting them through the multipath fading channel. Each eigenvalue represents the multipath channel gain for its corresponding pulse. We propose an optimal power allocation scheme depending on the eigenvalues to improve bit error rate (BER) performance in such a cognitive UWB radio environment. Numerical results show that the scheme outperforms the general equal power allocation scheme.
{"title":"Transmit Power Allocation among Orthogonal Pulse Wavelets for BER Performance Improvement in Cognitive UWB Radio","authors":"Xiaofei Zhou, Honggang Zhang, I. Chlamtac","doi":"10.1109/CCNC.2007.208","DOIUrl":"https://doi.org/10.1109/CCNC.2007.208","url":null,"abstract":"Ultra Wideband (UWB) technology has been considered as one of the suitable transmission techniques for implementing a cognitive radio system, where spectrum-agile UWB waveforms achieve a number of spectral adaptation features. One approach for designing such waveforms relies on orthogonally combining PSWF (Prolate Spheroidal Wave Functions) based pulse wavelets. In a cognitive UWB radio environment when the transmit signal is M-ary pulse shape modulated, we can obtain M different eigenvalues corresponding to the M PSWF-based pulses while transmitting them through the multipath fading channel. Each eigenvalue represents the multipath channel gain for its corresponding pulse. We propose an optimal power allocation scheme depending on the eigenvalues to improve bit error rate (BER) performance in such a cognitive UWB radio environment. Numerical results show that the scheme outperforms the general equal power allocation scheme.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115997000","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}
Variable bit rate encoding is considered to outper- form constant bit rate encoding with regard to compression gain and constancy of the video quality. The drawback is, however, that variable bit rate video streams usually exhibit a significant degree of burstiness which may result in poor multiplexing properties, buffer overflows, and large network delays. In this work we show how the explicit selection of slice mode types can effectively be used to generally avoid the use of large intracoded frames while still providing robustness against packet losses in the network. The employed encoding scheme provides a considerable smoothing of variable bit rate video traffic, resulting in less delay, less delay jitter, and less loss due to buffer overflows and late arrivals. It preserves the efficiency of variable bit rate video encoding, has little overhead, and is in accordance with current video coding standards.
{"title":"Efficient Smoothing of Robust VBR Video Traffic by Explicit Slice-based Mode Type Selection","authors":"M. Fidler, Yuan Lin, P. Emstad, A. Perkis","doi":"10.1109/CCNC.2007.178","DOIUrl":"https://doi.org/10.1109/CCNC.2007.178","url":null,"abstract":"Variable bit rate encoding is considered to outper- form constant bit rate encoding with regard to compression gain and constancy of the video quality. The drawback is, however, that variable bit rate video streams usually exhibit a significant degree of burstiness which may result in poor multiplexing properties, buffer overflows, and large network delays. In this work we show how the explicit selection of slice mode types can effectively be used to generally avoid the use of large intracoded frames while still providing robustness against packet losses in the network. The employed encoding scheme provides a considerable smoothing of variable bit rate video traffic, resulting in less delay, less delay jitter, and less loss due to buffer overflows and late arrivals. It preserves the efficiency of variable bit rate video encoding, has little overhead, and is in accordance with current video coding standards.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116522678","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}
In the standard Mobile IPv6 (MIPv6), the bidirectional tunnelling through the home agent or the route optimization show inefficiency in per-packet routing, especially when both communicating endpoints are mobile. To be scalable and compatible, mobile devices’ packets should be routed efficiently with minimal changes to the network infrastructure. However, the current solutions do not provide any means for the end systems to perform optimized packet routing during the operation of the mobile devices. In this paper, we present an end-to-end tunnelling extension to MIPv6 (E 2 T) for mobile routing packets, which reduces the per-packet routing cost for the communications of mobile devices through the lower packet routing overhead. Besides, our approach requires little change to MIPv6, but allows the more efficient routing behavior with the shorter end-to-end transmission latency between communicating endpoints. The simulation results show our approach is suitable for real-time multimedia applications.
{"title":"E²T: End-to-End Tunneling Extension to Mobile IPv6","authors":"Deguang Le, Xiaoming Fu, X. Gu, D. Hogrefe","doi":"10.1109/CCNC.2007.24","DOIUrl":"https://doi.org/10.1109/CCNC.2007.24","url":null,"abstract":"In the standard Mobile IPv6 (MIPv6), the bidirectional tunnelling through the home agent or the route optimization show inefficiency in per-packet routing, especially when both communicating endpoints are mobile. To be scalable and compatible, mobile devices’ packets should be routed efficiently with minimal changes to the network infrastructure. However, the current solutions do not provide any means for the end systems to perform optimized packet routing during the operation of the mobile devices. In this paper, we present an end-to-end tunnelling extension to MIPv6 (E 2 T) for mobile routing packets, which reduces the per-packet routing cost for the communications of mobile devices through the lower packet routing overhead. Besides, our approach requires little change to MIPv6, but allows the more efficient routing behavior with the shorter end-to-end transmission latency between communicating endpoints. The simulation results show our approach is suitable for real-time multimedia applications.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115593449","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}
-Disjoint Multipath QoS (quality of service) Routing algorithm is aimed at selecting multiple paths for a flow in a peer to peer network, which are mutually disjoint w.r.t. bottleneck links. The Widest Disjoint Paths (WDP) algorithm [3][4] assumes a static set of available paths for each source-destination pair a priori, from which disjoint paths w.r.t. bottleneck links are selected. The Shortest Widest Path (SWP) algorithm [9] dynamically determines one path for each source-destination pair, which is shortest among widest ones. The proposed Disjoint Multipath QoS Routing algorithm dynamically finds paths mutually disjoint w.r.t. bottleneck links, which are shortest among widest ones. Thus, the algorithm generalizes both WDP and SWP algorithms. In many important multimedia applications such as video over IP in telehealth application, the applicationand network-layer must collaborate in order to provide some necessary QoS guarantee. The network-layer should provide certain level of QoS measures, based on which the application-layer is able to compensate for deficiency of achieved QoS level. Those QoS measures may include end-to-end bandwidth, delay and packet loss rate, etc. The Disjoint Multipath QoS Routing algorithm is designed to achieve certain QoS level the application-layer can easily work with. In this paper, we only deal with the network-layer part and will focus on a scenario of one source and one destination. Simulation results and performance analysis demonstrate that the algorithm converges, offers lower end-to-end packet loss rate and higher throughput in comparison with SWP and Dijkstra Shortest Path algorithm as network traffic grows. Keywords--Disjoint path; Multipath routing; Bottleneck link; Bandwidth; Delay; Packet Loss Rate
{"title":"Disjoint Multipath QoS Routing","authors":"X. Zhuang, Shangming Zhu","doi":"10.1109/CCNC.2007.115","DOIUrl":"https://doi.org/10.1109/CCNC.2007.115","url":null,"abstract":"-Disjoint Multipath QoS (quality of service) Routing algorithm is aimed at selecting multiple paths for a flow in a peer to peer network, which are mutually disjoint w.r.t. bottleneck links. The Widest Disjoint Paths (WDP) algorithm [3][4] assumes a static set of available paths for each source-destination pair a priori, from which disjoint paths w.r.t. bottleneck links are selected. The Shortest Widest Path (SWP) algorithm [9] dynamically determines one path for each source-destination pair, which is shortest among widest ones. The proposed Disjoint Multipath QoS Routing algorithm dynamically finds paths mutually disjoint w.r.t. bottleneck links, which are shortest among widest ones. Thus, the algorithm generalizes both WDP and SWP algorithms. In many important multimedia applications such as video over IP in telehealth application, the applicationand network-layer must collaborate in order to provide some necessary QoS guarantee. The network-layer should provide certain level of QoS measures, based on which the application-layer is able to compensate for deficiency of achieved QoS level. Those QoS measures may include end-to-end bandwidth, delay and packet loss rate, etc. The Disjoint Multipath QoS Routing algorithm is designed to achieve certain QoS level the application-layer can easily work with. In this paper, we only deal with the network-layer part and will focus on a scenario of one source and one destination. Simulation results and performance analysis demonstrate that the algorithm converges, offers lower end-to-end packet loss rate and higher throughput in comparison with SWP and Dijkstra Shortest Path algorithm as network traffic grows. Keywords--Disjoint path; Multipath routing; Bottleneck link; Bandwidth; Delay; Packet Loss Rate","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116232200","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}
Wi-Fi mesh networks and WiMAX are two new emerging wireless access technologies for the delivery of broadband services to mobile users in the metropolitan area. To take advantage of the strengths of these two, we propose a novel architecture for next generation wireless metropolitan area networks. In this architecture, no wired backhaul connections for Wi-Fi mesh portals are needed, which considerably reduces the deployment cost and at the same time improves the system scalability. Due to the unique feature of wireless mesh networks which is a part of the architecture, previously proposed mobility management protocol can not work properly in this network environment. We propose a hierarchical mobility management scheme for mobile stations to maintain network connectivity while roaming within the Wi-Fi mesh networks. In this scheme, the dynamic forwarding chain is used to reduce the signalling traffic involved in the mobility management including registration and handoff procedures. The results of the performance evaluation justified the benefits of our proposed mechanism.
{"title":"A Dynamic Hierarchical Mobility Management Protocol for Next Generation Wireless Metropolitan Area Networks","authors":"Hairong Zhou, C. Yeh, H. Mouftah","doi":"10.1109/CCNC.2007.83","DOIUrl":"https://doi.org/10.1109/CCNC.2007.83","url":null,"abstract":"Wi-Fi mesh networks and WiMAX are two new emerging wireless access technologies for the delivery of broadband services to mobile users in the metropolitan area. To take advantage of the strengths of these two, we propose a novel architecture for next generation wireless metropolitan area networks. In this architecture, no wired backhaul connections for Wi-Fi mesh portals are needed, which considerably reduces the deployment cost and at the same time improves the system scalability. Due to the unique feature of wireless mesh networks which is a part of the architecture, previously proposed mobility management protocol can not work properly in this network environment. We propose a hierarchical mobility management scheme for mobile stations to maintain network connectivity while roaming within the Wi-Fi mesh networks. In this scheme, the dynamic forwarding chain is used to reduce the signalling traffic involved in the mobility management including registration and handoff procedures. The results of the performance evaluation justified the benefits of our proposed mechanism.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116929308","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}
Contemporary multimedia consumer devices are increasingly obtaining network connectivity mostly through wireless means. In order to economically support the mobile lifestyle of users, a new class of multimodal consumer devices has emerged that are equipped with heterogeneous wireless access capability. Inter-working of heterogeneous packet switched wireless networks, e.g., cellular and WLANs, via IP is a key step to provide ubiquitous service delivery via seamless connectivity of consumer devices. These wireless networks have a diverse range of capabilities and therefore selection of a specific network to optimize service delivery is an issue. Various algorithms have been proposed for use in the decision making process, with the class of Multi Attribute Decision Making (MADM) methods being one of the most promising. MADM methods, however, are known to suffer from ranking abnormalities. This paper applies TOPSIS, a MADM algorithm, to the problem of network selection. The causes of ranking abnormalities in TOPSIS are analyzed. An improvement to the algorithm as applied to the problem of network selection, where only the top ranking alternatives are considered important for decision making, is proposed. The new approach iteratively applies TOPSIS to the problem, removing the bottom ranked candidate network after each iteration. Simulation results are presented to demonstrate the effectiveness of the proposed iterative TOPSIS approach.
{"title":"Multi-Attribute Network Selection by Iterative TOPSIS for Heterogeneous Wireless Access","authors":"F. Bari, V. Leung","doi":"10.1109/CCNC.2007.164","DOIUrl":"https://doi.org/10.1109/CCNC.2007.164","url":null,"abstract":"Contemporary multimedia consumer devices are increasingly obtaining network connectivity mostly through wireless means. In order to economically support the mobile lifestyle of users, a new class of multimodal consumer devices has emerged that are equipped with heterogeneous wireless access capability. Inter-working of heterogeneous packet switched wireless networks, e.g., cellular and WLANs, via IP is a key step to provide ubiquitous service delivery via seamless connectivity of consumer devices. These wireless networks have a diverse range of capabilities and therefore selection of a specific network to optimize service delivery is an issue. Various algorithms have been proposed for use in the decision making process, with the class of Multi Attribute Decision Making (MADM) methods being one of the most promising. MADM methods, however, are known to suffer from ranking abnormalities. This paper applies TOPSIS, a MADM algorithm, to the problem of network selection. The causes of ranking abnormalities in TOPSIS are analyzed. An improvement to the algorithm as applied to the problem of network selection, where only the top ranking alternatives are considered important for decision making, is proposed. The new approach iteratively applies TOPSIS to the problem, removing the bottom ranked candidate network after each iteration. Simulation results are presented to demonstrate the effectiveness of the proposed iterative TOPSIS approach.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116683249","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}
S. Mo, A. Gelman, V. Vishnevsky, A. Lyakhov, Mikhail Yakimov
In the paper we propose and study a novel packet transmission scheme aimed to overcome a fundamental overhead of WPAN MAC/PHY protocols and to improve ARQ performance. Specifically, we propose to combine two well- known techniques: fragmentation and aggregation by adding multiple Frame Control Sums (FCS) to each fragment. We show analytically and by simulation that the proposed scheme increases WiMedia MAC efficiency greatly. Although the WiMedia MAC has been used as a design base, this novel packet transmission scheme can be extended to other high rate wireless communication systems to cover mmWave.
{"title":"An Efficient Packet Transmission Scheme for Ultra High Rate WPAN","authors":"S. Mo, A. Gelman, V. Vishnevsky, A. Lyakhov, Mikhail Yakimov","doi":"10.1109/CCNC.2007.9","DOIUrl":"https://doi.org/10.1109/CCNC.2007.9","url":null,"abstract":"In the paper we propose and study a novel packet transmission scheme aimed to overcome a fundamental overhead of WPAN MAC/PHY protocols and to improve ARQ performance. Specifically, we propose to combine two well- known techniques: fragmentation and aggregation by adding multiple Frame Control Sums (FCS) to each fragment. We show analytically and by simulation that the proposed scheme increases WiMedia MAC efficiency greatly. Although the WiMedia MAC has been used as a design base, this novel packet transmission scheme can be extended to other high rate wireless communication systems to cover mmWave.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115414877","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}
A critical challenge in mobile ad hoc networks is to scale with a flat structure. Clusters are customarily used at the network layer of these networks, especially for the routing schemes required to approach this problem. Recently, their use at the application layer has also been proposed. However, this new usage faces many performance challenges. This paper focuses on how to optimize the performance of cluster-based application layer schemes in mobile ad hoc networks. It proposes an architecture based on cross-layer design, a concept employed more and more in wireless environments, and which violates reference-layered architecture. We illustrate this architecture with a case study on a cluster-based session signaling scheme. We also present a proof-of-concept prototype and our initial measurements.
{"title":"Cross-Layer Design for Optimizing the Performance of Clusters-Based Application Layer Schemes in Mobile Ad Hoc Networks","authors":"R. Glitho, Chunyan Fu, F. Khendek","doi":"10.1109/CCNC.2007.54","DOIUrl":"https://doi.org/10.1109/CCNC.2007.54","url":null,"abstract":"A critical challenge in mobile ad hoc networks is to scale with a flat structure. Clusters are customarily used at the network layer of these networks, especially for the routing schemes required to approach this problem. Recently, their use at the application layer has also been proposed. However, this new usage faces many performance challenges. This paper focuses on how to optimize the performance of cluster-based application layer schemes in mobile ad hoc networks. It proposes an architecture based on cross-layer design, a concept employed more and more in wireless environments, and which violates reference-layered architecture. We illustrate this architecture with a case study on a cluster-based session signaling scheme. We also present a proof-of-concept prototype and our initial measurements.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123929133","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
扫码关注我们
求助内容：
应助结果提醒方式：