{"title":"Receiver Initiated Network Allocation Vector Clearing Method in WLANs","authors":"Lei Du, Lan Chen","doi":"10.1109/APCC.2005.1554135","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554135","url":null,"abstract":"802.11 DCF defines a virtual carrier sense mechanism, via RTS/CTS handshaking, to reserve wireless channel. All the nodes overhearing either RTS or CTS set their network allocation vector (NAV) respectively, and defer the channel access for the expected time to finish the packet sequence transmission. The problems arise when RTS or CTS is not successfully received by the addressed node, which causes the channel waste resulted from unnecessary NAV setting. We specify them as RTS-induced and CTS-induced unnecessary NAV setting problems depending on the type of the packet where NAV is set from. Some literatures resolve the problem by channel sensing, though, they are focusing on RTS-induced problems, and infeasible in CTS-induced case due to the unavailability of transmission status at those nodes surrounding the destination. Besides, taking into consideration the path loss, multipath fading, movement, etc., the packet error rate of CTS becomes severe in wireless propagation environment. Therefore, it is necessary to resolve the CTS-induced problem as well. To this end we propose the receiver initiated NAV clearing (RINC) method to enhance the system performance. The method aims to notify surrounding nodes the transmission status via a clear packet initiated from the receiver. It eliminates the wasted inhibition period in case of broken sequence without interfering with ongoing transmissions. This paper first describes the unnecessary NAV setting problems and further illustrates the MAC operation of the proposed idea. After that, the performance in terms of throughput, average delay, etc. is evaluated by simulation. It is observed that the proposed method enhanced the throughput by utilizing the channel in a more efficient way","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133160345","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}
{"title":"A New Packet Loss-Resilient Duplicated Video Transmission","authors":"M. Seo, Yo-Won Jeong, Jae-Kyoon Kim, K. Park","doi":"10.1109/APCC.2005.1554227","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554227","url":null,"abstract":"The transmission of duplicated packets provides a loss-resilience without undue time-delay in the video transmission. However, this method increases the bit-rate requirement in the network and hence exacerbates the problem of traffic congestion. In this paper, we propose a duplication of high priority data only for each video macro-block that is small but important in the reconstruction of the video. This reduces the bit-rate requirement in the transmission. Also, an effective packetization method is proposed to reduce the additional packet headers which are required to transmit the duplicated data. The duplicated high priority data of the previous video slice is transmitted as a piggyback to the data packet of the current video slice. Simulations indicate that the proposed method remarkably improves the packet loss-resilience for some video with a small increase of redundant duplicated data for each slice","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114346383","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}
{"title":"Congestion Avoidance Using DYnamic COdec MAnagement: A solution for ISP","authors":"L. Alcuri, F. Saitta, M. Fasciana","doi":"10.1109/APCC.2005.1554190","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554190","url":null,"abstract":"The large diffusion of VoIP is an essential key for the success of emerging Internet service providers. These ISPs conflict with the interests of historical and predominant network maintainers which often control the network infrastructure and telephone services. To win this competition, emerging ISPs have to adopt strategic QoS solutions which will capture the attention of network users and phone clients. This paper presents a solution which is able to obtain the same performance of a 64 Kbps channel reducing the costs for over-provisioning network bandwidth. DyCoMa is a mechanism studied for VoIP applications in network with a limited bandwidth for multimedia services. It works preventing network congestion without blocking incoming calls and maintaining under control end-to-end QoS. This solution could be adopted by ISP which would like to offer VoIP services without investing huge capital in bandwidth resources","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117054384","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}
{"title":"Congestion Management of Self Similar IP Traffic using Probability based Normal and Exponential marking RED","authors":"S. Suresh, O. Gol","doi":"10.1109/APCC.2005.1554087","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554087","url":null,"abstract":"Schemes described in the literature on network congestion management are in general based on queue management. Also it is widely accepted that Poisson model is not sufficient to characterize the traffic in current Internet. In this paper, we present the details of some simulation studies carried out on an alternate RED (random early detection) algorithm for traffic congestion management in IP networks having self similar input. We first discuss the basic scheme of normal as proposed by Floyd et al., for the Poisson input model, and then explain a new AQM proposed by us. Our modification to the RED algorithm takes into consideration probability values corresponding to the average queue lengths for computing the marking/dropping probability. Verification of the algorithms proposed vis-a-vis that of Floyd as well as the ones proposed by us, has been done by simulating self-similar traffic. Results of the verification have been discussed in the paper","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121895227","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}
T. Rakotoarivelo, P. Sénac, A. Seneviratne, M. Diaz
{"title":"A Super-Peer based Method to Discover QoS Enhanced Alternate Paths","authors":"T. Rakotoarivelo, P. Sénac, A. Seneviratne, M. Diaz","doi":"10.1109/APCC.2005.1554100","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554100","url":null,"abstract":"In the next generation Internet, the network should not only be considered as a communication medium, but also as an endless source of services available to the end-systems. These services (i.e. overlay applications) would be composed of multiple cooperative distributed software elements that dynamically build an ad hoc communication mesh (i.e. an overlay association). In a previous contribution, we proposed a collaborative distributed method to provide enhanced QoS between end-points within an overlay association. It aimed at discovering and utilizing composite alternate end-to-end paths that experience better QoS than the path given by the default IP routing mechanisms. Extending this work, this paper presents our investigations on an unstructured super-peer network-based method to discover such QoS enhanced alternate path","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121913420","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}
{"title":"Distributed and Load-Adaptive Self Configuration in Sensor Networks","authors":"M. Iqbal, I. Gondal, L. Dooley","doi":"10.1109/APCC.2005.1554122","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554122","url":null,"abstract":"Proactive self-configuration is crucial for MANETs such as sensor networks, as these are often deployed in hostile environments and are ad hoc in nature. The dynamic architecture of the network is monitored by exchanging so-called network state beacons (NSBs) between key network nodes. The beacon exchange rate and the network state define both the time and nature of a proactive action to combat network performance degradation at a time of crisis. It is thus essential to optimize these parameters for the dynamic load profile of the network. This paper presents a novel distributed adaptive optimization beacon exchange selection model which considers distributed network load for energy efficient monitoring and proactive reconfiguration of the network. The results show an improvement of 70% in throughput, while maintaining a guaranteed quality-of-service for a small control-traffic overhead","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122042868","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}
Jie Bai, Jianhua Zhang, Ruoju Liu, Xueqi He, Ping Zhang
{"title":"Multipath Delay Estimation for a MIMO-OFDM System","authors":"Jie Bai, Jianhua Zhang, Ruoju Liu, Xueqi He, Ping Zhang","doi":"10.1109/APCC.2005.1554024","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554024","url":null,"abstract":"In this paper, a multipath delay estimation scheme for a MIMO-OFDM system is presented. The scheme is achieved by using the same training symbols for each transmitter antenna after performing transmission delay timing estimation. The training sequences which are simultaneously transmitted are specialized for utilizing the peak autocorrelation property. Probability statistics for multipath delay of multi-frame is introduced to improve estimation performance. The simulation results indicate that delay of the path which the fading coefficient is higher than -18 dB can be detected by more than 90% when signal-to-noise radio (SNR) is larger than 6 dB","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123967098","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}
{"title":"Lower-Bound on Blocking Probability of General Banyan-based Photonic Switches with Zero First-Order Switching-Element-Crosstalk","authors":"Chen Yu, Xiaohong Jiang, S. Horiguchi, M. Guo","doi":"10.1109/APCC.2005.1554071","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554071","url":null,"abstract":"The horizontally expanded and vertically stacked photonic banyan (HVPB) is a general architecture for building banyan-based photonic switches. Blocking behavior analysis is an effective approach to studying network performance and finding a graceful compromise among hardware cost, network depth, and blocking probability. In this paper, we analyze the blocking probability of a HVPB network under the constraint of zero first-order switching-element-crosstalk and develop its lower bound with respect to the number of planes (stacked copies) and number stages in the network. Extensive simulation on a network simulator with both random routing and packing strategy has shown that the blocking probabilities of both strategies are nicely bounded by our lower bound, and the blocking probability of packing strategy actually matches the lower-bound. The proposed lower-bound is significant because it provides network designers an effective tool to estimate the minimum blocking probability they can expect from a HVPB architecture regardless what kind of routing strategy to be adopted. In particular, the proposed bound can be used to efficiently estimate the blocking probability of HVPB networks adopting packing routing strategy, in which the inherent relationship and tradeoff among blocking probability, network hardware cost in terms of the number of planes, and network depth can be explored","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"18 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125909945","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}
Gang Yuan, Yunqing Chen, Yueming Wei, Shizhong Nie
{"title":"A Distributable Traffic - based MPLS Dynamic Load Balancing Scheme","authors":"Gang Yuan, Yunqing Chen, Yueming Wei, Shizhong Nie","doi":"10.1109/APCC.2005.1554149","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554149","url":null,"abstract":"A new comprehensive metric based on LSP queuing delay and packet loss probability, which is referred to as DT (distributable traffic), is defined to reflect the load level of LSP. Then based on DT, an dynamic MPLS load balancing scheme is proposed to perform traffic distribution in MPLS networks, which is referred to as DTLB. Only LERs are required to perform special function in DTLB scheme, so the scalability is maintained. Simulation results indicate that the new proposed scheme can perform stable even in dynamic network environment, and it can distribute the traffic onto parallel LSPs more evenly and fairly when compared to other schemes","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128954449","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}
{"title":"Evaluation of a New Effective Antenna Height Definition in ITU-R Recommendation P. 1546-1","authors":"E. Ostlin, Hajime Suzuki, H. Zepernick","doi":"10.1109/APCC.2005.1554033","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554033","url":null,"abstract":"The International Telecommunication Union has recently developed a new recommendation on the method of point-to-area predictions for terrestrial services in the frequency range 30 MHz to 3000 MHz. It supersedes well-known recommendations such as P.370 and P.529 (modified Okumura-Hata method) used mainly for broadcasting and mobile services, respectively. The recommendation serves as a standard in areas of spectrum management and radio technology and is constantly under development. The work is undertaken by the ITU-R Working Party 3K followed by an extensive international approval process. At the moment, P.1546-1 incorporates an effective antenna height concept similar to that in the Okumura model. It is well known that this definition for certain scenarios produces negative transmitting/base antenna height values leading to unrealistic prediction results. Therefore, a widely accepted alternative method is called for. In this paper, an effective antenna height definition that overcomes this problem is investigated. The prediction results are compared with measurement data obtained by utilising the IS-95 pilot signal of a commercial CDMA mobile network in rural Australia","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128978364","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}