Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)最新文献

The effect of retransmitted packet size preservation property on TCP goodput over links with Bernoulli bit-errors 在伯努利误码链路上，重传包大小保留特性对TCP good - put的影响

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.46

T. Ikegawa, Yukio Takahashi

{"title":"The effect of retransmitted packet size preservation property on TCP goodput over links with Bernoulli bit-errors","authors":"T. Ikegawa, Yukio Takahashi","doi":"10.1109/WIOPT.2005.46","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.46","url":null,"abstract":"In this paper, we investigate the effect of the retransmitted packet size preservation (RPSP) property on TCP performance over links with Bernoulli bit-errors, where RPSP means that the sizes of all packets transferred over datalinks (referred to as transferred packets) with the same sequence-number at retransmissions are equal to the size of a packet generated from a message at the original transmission (namely, generated packet). To achieve this, we present a Markov model for size-sequences of the generated and transferred packets, in which the TCP message-segmentation and error-recovery functions with RPSP are taken into account, respectively. Furthermore, we derive the round-trip time and the transferred packet corruption probability, which are the main parameters of TCP performance. Applying them to the conventional TCP-Reno send-rate formula, we discuss the effect of RPSP on TCP-Reno goodput. The key findings from the numerical results include that RPSP cannot be negligible for networks that suffer from a high bit-error rate (e.g., 1 /spl times/ 10/sup -4/, which is the mean bit-error rate of a wireless link in an industrial environment), when the message-segmentation occurrence probability is relatively small.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124363951","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}

引用次数: 3

Using the 802.11e EDCF to achieve TCP upload fairness over WLAN links 采用802.11e EDCF实现WLAN链路上TCP上传的公平性

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.54

D. Leith, P. Clifford

引用次数: 71

A new relaying scheme for cheap wireless relay nodes 一种新的廉价无线中继节点中继方案

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.3

R. Khalili, Kave Salamatian

{"title":"A new relaying scheme for cheap wireless relay nodes","authors":"R. Khalili, Kave Salamatian","doi":"10.1109/WIOPT.2005.3","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.3","url":null,"abstract":"Wireless networks consist of senders, receivers, and intermediate nodes collaborating (more or less) to establish the communication paths. Most of the researches in the domain of wireless network have focused on routing based approaches. In such an approach, wireless network is reduced to a dynamic graph, and a minimum cost routing mechanism is applied. These approaches have led to several routing mechanisms as OLSR and AODV. However, the fundamental nature of wireless network is the broadcast. In the wireless network, all the tuned receivers potentially receive every transmission. This basic property is not well captured by graph-based approaches where packets follow a single path from sender to receiver. In this paper we propose a relaying scheme for wireless multi-hop networks. It is based on collaboration of intermediate relays at network layer to forward useful side information in place of forwarding packets. In our scheme we assume that the nodes are not able to benefit from any interference cancellation mechanism. The channels from sender to relay nodes and from sender to receiver are logically separated through a temporal scheduling. This model is realistic for many practical scenarios in the context of wireless networks. We show in this paper the information theoretic bounds and show that they are achievable using practical codes. The proposed coding scheme is simulated in realistic scenarios. The obtained results show a remarkable improvement in throughput, relay load and reliability compared to network using classical routing approach.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599264","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}

引用次数: 8

Energy saving dynamic source routing for ad hoc wireless networks 自组织无线网络的节能动态源路由

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.21

M. Tarique, K. Tepe, M. Naserian

引用次数: 84

Interference power sum with log-normal components in ad-hoc and sensor networks 自组网和传感器网络中对数正态分量的干扰功率和

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.23

R. Hekmat, P. Mieghem

引用次数: 16

A simulation tool to evaluate radio resource management algorithms for enhanced UMTS 用于评估增强型UMTS无线电资源管理算法的仿真工具

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.8

V. Vassiliou, J. Antoniou, G. Hadjipollas, A. Pitsillides

引用次数: 6

A game-theoretic analysis on the conditions of cooperation in a wireless ad hoc network 无线自组织网络合作条件的博弈论分析

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.1

S. Bandyopadhyay, Subhajyoti Bandyopadhyay

引用次数: 12

Modeling and analysis of opportunistic routing in low traffic scenarios 低流量场景下机会路由的建模与分析

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.30

R. Shah, S. Wiethölter, A. Wolisz, J. Rabaey

引用次数: 43

Secure comparison of encrypted data in wireless sensor networks 无线传感器网络中加密数据的安全比较

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.44

Mithun P. Acharya, J. Girão, D. Westhoff

{"title":"Secure comparison of encrypted data in wireless sensor networks","authors":"Mithun P. Acharya, J. Girão, D. Westhoff","doi":"10.1109/WIOPT.2005.44","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.44","url":null,"abstract":"End-to-end encryption schemes that support operations over ciphertext are of utmost importance for commercial private party wireless sensor network implementations to become meaningful and profitable. For wireless sensor networks, we demonstrated in our previous work that privacy homomorphisms, when used for this purpose, offer two striking advantages apart from end-to-end concealment of data and ability to operate on ciphertexts: flexibility by keyless aggregation and conservation and balancing of aggregator backbone energy. We offered proof of concept by applying a certain privacy homomorphism for sensor network applications that rely on the addition operation. But a large class of aggregator functions like median computation or finding maximum/minimum rely exclusively on comparison operations. Unfortunately, as shown by Rivest, et al., any privacy homomorphism is insecure even against ciphertext that only attacks if they support comparison operations. In this paper we show that a particular order preserving encryption scheme achieves the above mentioned energy benefits and flexibility when used to support comparison operations over encrypted texts for wireless sensor networks, while also managing to hide the plaintext distribution and being secure against ciphertext only attacks. The scheme is shown to have reasonable memory and computation overhead when applied for wireless sensor networks.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134191833","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}

引用次数: 64

An interactive transparent protocol for connection oriented mobility $performance analysis with voice traffic 一个交互式透明协议，用于面向连接的移动性能分析与语音流量

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.9

R. Zaghal, S. Davu, J. Khan

{"title":"An interactive transparent protocol for connection oriented mobility $performance analysis with voice traffic","authors":"R. Zaghal, S. Davu, J. Khan","doi":"10.1109/WIOPT.2005.9","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.9","url":null,"abstract":"Loss-free handoff in mobile networks is an extensive research area. Mobile IP (MIP) provided a solution to enable a mobile node to roam from one location to another while maintaining its network level connectivity. However, handoff latencies and longer triangular routing paths in MIP can severely degrade communication performance and in particular cripple connection oriented protocols like TCP. In this paper we propose an alternate approach for robust mobility. The scheme is based on the principle of 'interactive transparent networking' where all networking layers remain lightweight but are engineered for interactivity. This would allow principle intelligent actions to be performed at the application layer. With protocol interactivity we demonstrate a novel scheme that switches IP address in the TCP/IP stack on both end-points and perform loss-free rapid handoff. The scheme offers not only loss-free handoff, but also offers several fundamental system advantages; (i) it does not impose any changes on original network protocols or their dynamics, and (ii) it fully adheres to the end-to-end principle and do not require intermediary nodes as in MIP. We have achieved a real implementation of the scheme on FreeBSD and tested the real system over Internet with voice traffic. We show that this scheme can dramatically reduce handoff latency and improve TCP performance by offering shorter routes with loss-free handoffs and smooth, low-jitter voice stream.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126699350","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}

引用次数: 6