Devashish Rastogi, S. Ganu, Yanyong Zhang, W. Trappe, C. Graff
{"title":"A Comparative Study of AODV and OLSR on the ORBIT Testbed","authors":"Devashish Rastogi, S. Ganu, Yanyong Zhang, W. Trappe, C. Graff","doi":"10.1109/MILCOM.2007.4455056","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4455056","url":null,"abstract":"Though ad hoc network routing protocols, such as AODV and OLSR, have been extensively studied through simulations, there have been fewer evaluations of their software protocol implementations on real network testbed deployments. Consequently, validating the protocol functionality and performance on an actual experimental platform is imperative in order to understand relative merits or limitations under diferent network conditions. In this paper, we present our initial experimental evaluations of the publicly available AODV and OLSR implementations on the national Open Access Research Testbed (ORBIT) for Next Generation Wireless Networks. We focused on the implementation issues involved in porting these protocols on an open-access testbed as well as the behavior of the proctols on the tested. Finally, we also looked at maximum achievable throughput using these protocols under diferent settings. Our preliminary observations indicate that in a static scenario, these two protocols can achieve comparable throughput, with AODV offering better stability than OLSR.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132562025","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}
Yue-Kai Huang, Bernard B Wu, I. Glesk, K. Kravtsov, E. Narimanov, P. Prucnal, Ting Wang
{"title":"Achieving Physical Layer Security / Privacy with Self-Wrapped OCDM Transmission","authors":"Yue-Kai Huang, Bernard B Wu, I. Glesk, K. Kravtsov, E. Narimanov, P. Prucnal, Ting Wang","doi":"10.1109/MILCOM.2007.4455316","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4455316","url":null,"abstract":"We present a novel transmission system using self-wrapped WHTS OCDM signals to achieve enhanced transmission security. Distributed key is encoded and time-spread to hide under noise in the network. BER of 10-4 is demonstrated experimentally.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128198505","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":"Automatic Optimisation of Reliable Collaborative Services in OLSR Mobile Ad Hoc Networks","authors":"C. Guettier, P. Jacquet, L. Viennot, J. Yelloz","doi":"10.1109/MILCOM.2007.4454993","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4454993","url":null,"abstract":"Future Network based Operations (NbO) will strongly rely on Mobile Ad hoc Networks (MANET), due to urban area, tactical mobility and assymetric operation management. These networks will support multiple collaborative services, such as sensor to shooters, reachback, maintenance of Common Operational Picture (COP). Both networks and services will have to be managed with no or limited operator intervention, still providing reliable behavior in spite of aggressive environments. At routing level, we present how to preserve 2-connectivity by adapting the Optimised Link State Routing Protocol (OLSR). We also introduce the concept of active subnet management to retrieve maximal operational gain from collaborative services. Following a constraint solving method, the paper shows how to maximise the subnet of actors, while satisfying 2-connectivity, reactivity and communication quality constraints. We demonstrate the approach on simulating real world NbO.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"1103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133829572","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":"Performance of DTN-Based Free-Space Optical Networks with Mobility","authors":"R. Nichols, A. Roger Hammons","doi":"10.1109/MILCOM.2007.4455296","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4455296","url":null,"abstract":"Free-space optical communications (FSOC) has the potential to offer significant capacity advantages for future military communication networks. Due to link fragility, it is likely that FSOC networks will suffer from intermittent connectivity. Delay Tolerant Networking (DTN) has been proposed as a potential solution for this technical challenge as it is designed to offer a solution for routing in a network which is not always connected. This paper examines DTN-based FSOC networks in a variety of mobility models and examines the performance of the network.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123140589","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":"Analysis of Propagation Effects in Mobile Satellite Communications","authors":"V. Weerackody","doi":"10.1109/MILCOM.2007.4454901","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4454901","url":null,"abstract":"Mobile satellite communication systems that operate in the Ku-band (11-14 GHz band) and higher frequencies play a significant role in military and civilian communication systems. The satellites of interest are located in the crowded geostationary orbit with a 2 degree separation between adjacent satellites. This close spacing between adjacent satellites may lead to interference effects and, in order to limit interference to adjacent satellites, regulatory agencies have established strict limits on the effective isotropic radiated power (EIRP) from a particular terminal in its off-axis direction. Rugged terrain conditions are commonly encountered in mobile communications applications. In such terrains, the frequent motion of the antenna platform may lead to motion induced antenna pointing errors, which can be characterized by a random variable. It will be shown that such errors will lead to random variations of the terminal's off-axis EIRP spectral density. Since there are strict limits on the off-axis EIRP spectral density it is necessary to quantify these random variation. In this paper we will present a technique to analyze the time-varying interference at the adjacent satellites due to the propagation of the signal from a mobile satellite terminal.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115759152","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":"FTS: A Fractional Transmission Scheme for Efficient Broadcasting via Rateless Coding in Multihop Wireless Networks","authors":"N. Rahnavard, B. Vellambi, F. Fekri","doi":"10.1109/MILCOM.2007.4455060","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4455060","url":null,"abstract":"In this paper, we investigate the problem of reliable and energy-efficient broadcasting in multihop wireless networks and propose a low-complexity and scalable broadcasting scheme, referred to as a fractional transmission scheme (FTS). FTS utilizes rateless coding and the broadcasting nature of wireless channels to reduce energy consumption while ensuring reliable delivery of packets to all the nodes in the network. In FTS, different neighbors of a node share the transmission, and each node sends only a fraction of the total encoded packets required by a receiving node. We compare our scheme with present energy-efficient methods such as Network Coding (NC), Multipoint Relaying (MPR), Dominant Pruning (DPR), and Broadcast Incremental Power (BIP). Our simulations reveal that our scheme performs well in comparison to these strategies, while having lower complexity and higher adaptability in comparison with some of them.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116690174","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":"EM Channel Estimation for Iterative DS-CDMA Receiver using LDPC Codes with M-ary Modulation","authors":"D. Torrieri, A. Mukherjee, H. Kwon","doi":"10.1109/MILCOM.2007.4455131","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4455131","url":null,"abstract":"This paper proposes an iterative pilot-symbol-aided direct-sequence code-division multiple-access receiver. The receiver uses a regular low-density parity-check (LDPC) code, iterative demodulation and decoding, and iterative estimators for the fading amplitude and noise power spectral density (PSD). The expectation-maximization channel-estimation performance is analyzed for an additive white Gaussian noise channel as well as a Rayleigh fading channel. Pilot symbols are periodically distributed throughout each LDPC codeword followed by direct-sequence spreading and an M-ary modulation, e.g., quadriphase-shift keying. After initial estimates of the fading amplitude and noise PSD are obtained by using pilot information, subsequent values of these parameters are iteratively updated by using the soft feedback from the LDPC decoder. The updated fading amplitude and noise PSD estimates are iteratively passed to the LDPC decoder, which results in decoding performance close to that obtained with perfect channel knowledge.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117203073","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}
Mitchell S. Mayer, K. F. Chan, Bob Grillo, E. Thomas
{"title":"IPv6 - From Concept to Field Trials","authors":"Mitchell S. Mayer, K. F. Chan, Bob Grillo, E. Thomas","doi":"10.1109/MILCOM.2007.4455066","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4455066","url":null,"abstract":"IPv6 is the next generation of the Internet Protocol and has been mandated by the Office of Management and Budget throughout Federal agencies, including the Department of Defense (DOD). This paper discusses the process of bringing IPv6 from an array of standards and transition documents to field testing in the CERDEC C4ISR OTM Experiment during the summer of 2007. The paper will discuss the development of the CERDEC IPv6 Laboratory and the process to go from concept to hardware. Where it is appropriate, conceptual ideas of new IPv6 features and performance will be compared to actual performance comparisons between IPv4 and IPv6 taken during this field experiment.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"61 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117223999","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":"Authentication via Ambassadors: A Novel Authentication Mechanism in MANETs","authors":"Feng Li, Jie Wu","doi":"10.1109/MILCOM.2007.4455065","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4455065","url":null,"abstract":"The reputation bootstrap problem is a significant issue for mobile ad-hoc networks (MANETs). We present a novel mechanism, Authentication Via Ambassadors, which authenticates mobile nodes based on their \"social relationship\". One commonly-trusted node is elected as the cluster head in each region. Ambassadors, which are moving nodes trusted by the cluster head, are selected and dispatched according to several different criteria to represent the region and perform authentication. A node that anticipates moving into a remote region can search and find an ambassador of that region, and take authentication to obtain a more precise initial reputation in the remote region. Therefore, the trust convergence time is reduced, and many attacks that threat the reputation systems for MANETs are avoided.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117349492","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}
B. M. Dogahe, Xingzhe Fan, M. Murthi, K. Premaratne
{"title":"Balancing Power and Rate to Achieve Bounded Average Delay in Wireless Networks","authors":"B. M. Dogahe, Xingzhe Fan, M. Murthi, K. Premaratne","doi":"10.1109/MILCOM.2007.4454959","DOIUrl":"https://doi.org/10.1109/MILCOM.2007.4454959","url":null,"abstract":"Allocating limited resources such as bandwidth and power in a multi-hop wireless network can be formulated as a Network Utility Maximization (NUM) problem. In this approach, both source transmitting and link relaying nodes exchange information allowing for the NUM problem to be solved in an iterative distributed manner. Previous NUM formulations of wireless networks have considered the parameters of data rate and reliability in the utility function which measures an application's performance. However, it is well known that delay is an important factor in the performance of many applications. In this paper, we consider an additional constraint based on the delay requirements of the sources. This augmented NUM formulation allows an application to tradeoff rate, power and queuing delay according to its needs, thereby providing greater flexibility. Power allocation among different transmitters is a subtle issue to deal with in this problem, since the capacity of the wireless links are interference limited. A distributed iterative algorithm solving the NUM is presented along with its convergence. The performance of the algorithm is examined via simulations which confirm the expectations from the theory.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121085108","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}