The single frequency network mode (SFN) is one of the benefits of DVB-H network. In addition to the possibility to use only one frequency in given area, the reception of the same contents via two or more radio paths provides with SFN gain which enhances the quality of service whenever the respective sites are located inside the SFN limits. If the same frequency is used outside the theoretical SFN area, the sites that exceed the relative guard distance converts as interfering sources. This paper describes a simulation method for the investigation of the SFN gain in non-interfered network as well as in the environment with SFN interferences. Also simulation results and analysis with the most logical network parameter set is presented.
{"title":"The SFN Gain in Non-interfered and Interfered DVB-H Networks","authors":"J. Penttinen","doi":"10.1109/ICWMC.2008.52","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.52","url":null,"abstract":"The single frequency network mode (SFN) is one of the benefits of DVB-H network. In addition to the possibility to use only one frequency in given area, the reception of the same contents via two or more radio paths provides with SFN gain which enhances the quality of service whenever the respective sites are located inside the SFN limits. If the same frequency is used outside the theoretical SFN area, the sites that exceed the relative guard distance converts as interfering sources. This paper describes a simulation method for the investigation of the SFN gain in non-interfered network as well as in the environment with SFN interferences. Also simulation results and analysis with the most logical network parameter set is presented.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134004923","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 work, we consider the uplink conventional cellular system with and without relaying capabilities. Furthermore we consider that both relay nodes and transmitter nodes are mobile. Depending on the received pilot signal strength from the base station, a mobile can decide whether it will perform either singlehop or multihop transmission. Our goal is to evaluate the performance of multihop communication in infrastructure based cellular network and compare it with the singlehop communication. We focus on the non-real-time services. System throughput and system packet delay have been considered as performance metrics. It has been seen that multihop communication has greatly improved the performance over conventional cellular system specially when nodes have the higher speed.
{"title":"Impact of Mobile Relays on Throughput and Delays in Multihop Cellular Network","authors":"M.F. Murad Hossain, A. Mammela, H. Chowdhury","doi":"10.1109/ICWMC.2008.27","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.27","url":null,"abstract":"In this work, we consider the uplink conventional cellular system with and without relaying capabilities. Furthermore we consider that both relay nodes and transmitter nodes are mobile. Depending on the received pilot signal strength from the base station, a mobile can decide whether it will perform either singlehop or multihop transmission. Our goal is to evaluate the performance of multihop communication in infrastructure based cellular network and compare it with the singlehop communication. We focus on the non-real-time services. System throughput and system packet delay have been considered as performance metrics. It has been seen that multihop communication has greatly improved the performance over conventional cellular system specially when nodes have the higher speed.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127801666","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}
Moohong Lee, Byungjik Keum, Hwang-Soo Lee, Joo-Wan Kim
When the gain of a radio repeater is larger than the isolation between the transmit and receive antennas of the repeater, the feedback signal that comes into the receive antenna from the transmit antenna of the repeater causes the repeater to go into feedback oscillation regardless of the input signal. To prevent feedback oscillation of the repeater by interference cancellation (ICAN), a feedback oscillation model of a radio repeater is first formulated. An ICAN model is then derived from that model. According to the ICAN model, iterative algorithms such as the least mean square (LMS) algorithm using the minimum mean square error criterion can be applied to perform the necessary ICAN. The validity of the ICAN model is confirmed by a computer simulation that shows the relationship among the level of ICAN, the repeater's gain, the estimated delay, and the filter length for the LMS algorithm.
{"title":"A Radio Repeater Interference Cancellation Model for Mobile Communication Systems","authors":"Moohong Lee, Byungjik Keum, Hwang-Soo Lee, Joo-Wan Kim","doi":"10.1109/ICWMC.2008.16","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.16","url":null,"abstract":"When the gain of a radio repeater is larger than the isolation between the transmit and receive antennas of the repeater, the feedback signal that comes into the receive antenna from the transmit antenna of the repeater causes the repeater to go into feedback oscillation regardless of the input signal. To prevent feedback oscillation of the repeater by interference cancellation (ICAN), a feedback oscillation model of a radio repeater is first formulated. An ICAN model is then derived from that model. According to the ICAN model, iterative algorithms such as the least mean square (LMS) algorithm using the minimum mean square error criterion can be applied to perform the necessary ICAN. The validity of the ICAN model is confirmed by a computer simulation that shows the relationship among the level of ICAN, the repeater's gain, the estimated delay, and the filter length for the LMS algorithm.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131258844","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}
O. Alfandi, Patryk Chamuczynski, Henrik Brosenne, Constantin Werner, D. Hogrefe
The future vision of the wireless networks is coexistence of current existing access networks. The different access networks managed by different operators will be bound together into a single network and the Internet Protocol will be the glue. To fulfill this vision, one of the most challenging parts is to facilitate the authentication phase of the handovers between domains. PANA pre-authentication scheme was designed to carry the authentication information before the actual handover execution from one domain to a subsequent domain. However, the available time to complete this handover can be rather short due to the user's movement. In this paper, a new approach is presented that can substantially lower the time needed for an inter-domain handover by using context transfer compared to PANA pre-authentication. We describe the approach and show its benefits by means of simulation using the tool OMNET++.
{"title":"Performance Evaluation of PANA Pre-authentication and PANA Context Transfer","authors":"O. Alfandi, Patryk Chamuczynski, Henrik Brosenne, Constantin Werner, D. Hogrefe","doi":"10.1109/ICWMC.2008.42","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.42","url":null,"abstract":"The future vision of the wireless networks is coexistence of current existing access networks. The different access networks managed by different operators will be bound together into a single network and the Internet Protocol will be the glue. To fulfill this vision, one of the most challenging parts is to facilitate the authentication phase of the handovers between domains. PANA pre-authentication scheme was designed to carry the authentication information before the actual handover execution from one domain to a subsequent domain. However, the available time to complete this handover can be rather short due to the user's movement. In this paper, a new approach is presented that can substantially lower the time needed for an inter-domain handover by using context transfer compared to PANA pre-authentication. We describe the approach and show its benefits by means of simulation using the tool OMNET++.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126636878","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 have considered the downlink multimedia transmission with Direct Sequence-Ultra wideband (DS-UWB) [1] communication system. We have evaluated performance of DS-UWB system under multiuser scenario. We have investigated performance of the system under synchronous and asynchronous transmission. We have discussed the effect of orthogonal and non-orthogonal code selection with effect of different UWB pulse selection. Also the performance of DS-UWB with non-orthogonal code is compared with TH-PAM UWB [2].
{"title":"Performance Analysis of Multiuser DS-UWB System with Orthogonal and Non-orthogonal Code under Synchronous and Asynchronous Transmission","authors":"H. Soni, U. Desai, S. Merchant","doi":"10.1109/ICWMC.2008.9","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.9","url":null,"abstract":"In this paper we have considered the downlink multimedia transmission with Direct Sequence-Ultra wideband (DS-UWB) [1] communication system. We have evaluated performance of DS-UWB system under multiuser scenario. We have investigated performance of the system under synchronous and asynchronous transmission. We have discussed the effect of orthogonal and non-orthogonal code selection with effect of different UWB pulse selection. Also the performance of DS-UWB with non-orthogonal code is compared with TH-PAM UWB [2].","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126113550","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}
H. Stefanovic, V. Stefanović, A. Cvetkovic, J. Anastasov, D. Stefanovic
In this paper the shadowed Rician fading channel model is analyzed. The received signal envelope is modeled as Rician random variable, while the blockage of the line-of-sight (LOS) component is described by Nakagami-m model. Analytical expressions and graphical representations of the received signal statistical characteristics are given. The probability density function and cumulative density function are calculated and graphically represented for different values of relevant parameters, like fading figure, average signal power and ratio of the power in direct component to the power of the multipath components. The expressions for the calculated statistical characteristics are less complicated compared to the other shadowed Rician fading models given in literature, which is the main advantage of this model.
{"title":"Some Statistical Characteristics of a New Shadowed Rician Fading Channel Model","authors":"H. Stefanovic, V. Stefanović, A. Cvetkovic, J. Anastasov, D. Stefanovic","doi":"10.1109/ICWMC.2008.36","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.36","url":null,"abstract":"In this paper the shadowed Rician fading channel model is analyzed. The received signal envelope is modeled as Rician random variable, while the blockage of the line-of-sight (LOS) component is described by Nakagami-m model. Analytical expressions and graphical representations of the received signal statistical characteristics are given. The probability density function and cumulative density function are calculated and graphically represented for different values of relevant parameters, like fading figure, average signal power and ratio of the power in direct component to the power of the multipath components. The expressions for the calculated statistical characteristics are less complicated compared to the other shadowed Rician fading models given in literature, which is the main advantage of this model.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115171188","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}
Gowrishankar, H. Ramesh Babu, G. Raju, P. Satyanarayana
The integration of different wireless technologies is the emerging trend in providing ubiquitous access to the high data rate wireless network. In such system user will be roaming among different radio access technologies (RATs) and this is known as vertical handover/handoff. In order to understand the practical behavior of the system, the Performability model is found to be essential. In wireless network the available bandwidth (ABW) of network is divided into set of logical channels[1] and these set of channels are shared among a set of network users. The network users are divided into new users and handoff users. The handoff users are further classified into vertical handoff users and horizontal handoff users. In a wireless network, the priority is given to handoff users. In order to provide better service to the wireless users the quality of service (QoS) parameters were defined[2]. One of the QoS parameter for the wireless network is handoff dropping probability. For better QoS it is desirable to reduce the handoff dropping probability hence separate set of guard channels were reserved for handoff[3][4]. In this prevailing scenario it is highly desirable to obtain analytic performability model. The stochastic Petri net (SPN) based performability model has been developed to verify the efficiency and accuracy of analytic performability model. The results obtained from both the performability models are promising.
{"title":"Performability Model of Vertical Handoff in Wireless Data Network","authors":"Gowrishankar, H. Ramesh Babu, G. Raju, P. Satyanarayana","doi":"10.1109/ICWMC.2008.60","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.60","url":null,"abstract":"The integration of different wireless technologies is the emerging trend in providing ubiquitous access to the high data rate wireless network. In such system user will be roaming among different radio access technologies (RATs) and this is known as vertical handover/handoff. In order to understand the practical behavior of the system, the Performability model is found to be essential. In wireless network the available bandwidth (ABW) of network is divided into set of logical channels[1] and these set of channels are shared among a set of network users. The network users are divided into new users and handoff users. The handoff users are further classified into vertical handoff users and horizontal handoff users. In a wireless network, the priority is given to handoff users. In order to provide better service to the wireless users the quality of service (QoS) parameters were defined[2]. One of the QoS parameter for the wireless network is handoff dropping probability. For better QoS it is desirable to reduce the handoff dropping probability hence separate set of guard channels were reserved for handoff[3][4]. In this prevailing scenario it is highly desirable to obtain analytic performability model. The stochastic Petri net (SPN) based performability model has been developed to verify the efficiency and accuracy of analytic performability model. The results obtained from both the performability models are promising.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"144 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113993891","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-07-20DOI: 10.1109/SSD.2008.4632808
Yang Jianxi, Wang Yuan, Chu Liang
Multi-path effect in HF communication not only changes the amplitude, but changes the phase of receiving signal as well. The rapid and random movement of ionospheric causes the oscillation of the phase. It could be viewed as the Doppler shift of high-frequency carrier caused by ionospheric. The shift of frequency should be corrected because it brings difficulty in recovering the carrier. The non-blind method needs much quantities of training (or pilot frequency) sequences at the cost of system recourse (bandwidth). However, the blind estimation will wildly encounter the vague phase. In this paper, a semi-blind parameter estimation method is introduced which uses few training sequences to distinguish the carrier. In this way, the carrier's phase and timing parameter could be recovered rapidly. Besides, this algorithm is easy to implement in hardware platform.
{"title":"A Rapid Joint Semi-blind Estimation Algorithm for Carrier Phase and Timing Parameter","authors":"Yang Jianxi, Wang Yuan, Chu Liang","doi":"10.1109/SSD.2008.4632808","DOIUrl":"https://doi.org/10.1109/SSD.2008.4632808","url":null,"abstract":"Multi-path effect in HF communication not only changes the amplitude, but changes the phase of receiving signal as well. The rapid and random movement of ionospheric causes the oscillation of the phase. It could be viewed as the Doppler shift of high-frequency carrier caused by ionospheric. The shift of frequency should be corrected because it brings difficulty in recovering the carrier. The non-blind method needs much quantities of training (or pilot frequency) sequences at the cost of system recourse (bandwidth). However, the blind estimation will wildly encounter the vague phase. In this paper, a semi-blind parameter estimation method is introduced which uses few training sequences to distinguish the carrier. In this way, the carrier's phase and timing parameter could be recovered rapidly. Besides, this algorithm is easy to implement in hardware platform.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"1998 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128252421","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}
Sink mobility is one of the most comprehensive trends for information gathering in sensor networks. This way of information gathering has a prominent role in balancing the energy consumption among sensor networks, and culling the hotspots problem of sensor networks. In this paper, a well planned adaptive moving strategy for a mobile sink in large-scale, hierarchical sensor networks is presented. The mobile sink traverses the entire network uploading the sensed data from cluster heads in time driven scenarios. The mobile sink trajectory is planned such that all heads require no multi-hop relays to reach the mobile sink. The proposed system aims at extending the lifetime of the sensor network by achieving a high level of energy efficiency and fair balancing of energy consumption across all network heads. Furthermore, reducing the loss that data incur due to buffer overflow. Extensive simulations are conducted in order to validate the proposed strategy. The adopted data gathering scheme outperforms the static sink scheme and periphery scheme in terms of life time elongation, and scalability.
{"title":"A Data Gathering Algorithm for a Mobile Sink in Large-Scale Sensor Networks","authors":"E. Saad, M. Awadalla, R. Darwish","doi":"10.1109/ICWMC.2008.38","DOIUrl":"https://doi.org/10.1109/ICWMC.2008.38","url":null,"abstract":"Sink mobility is one of the most comprehensive trends for information gathering in sensor networks. This way of information gathering has a prominent role in balancing the energy consumption among sensor networks, and culling the hotspots problem of sensor networks. In this paper, a well planned adaptive moving strategy for a mobile sink in large-scale, hierarchical sensor networks is presented. The mobile sink traverses the entire network uploading the sensed data from cluster heads in time driven scenarios. The mobile sink trajectory is planned such that all heads require no multi-hop relays to reach the mobile sink. The proposed system aims at extending the lifetime of the sensor network by achieving a high level of energy efficiency and fair balancing of energy consumption across all network heads. Furthermore, reducing the loss that data incur due to buffer overflow. Extensive simulations are conducted in order to validate the proposed strategy. The adopted data gathering scheme outperforms the static sink scheme and periphery scheme in terms of life time elongation, and scalability.","PeriodicalId":308667,"journal":{"name":"2008 The Fourth International Conference on Wireless and Mobile Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125164066","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
扫码关注我们
求助内容：
应助结果提醒方式：