MILCOM 2008 - 2008 IEEE Military Communications Conference最新文献_第6页

Polarization-based interference mitigation for OFDM signals in channels with polarization mode dispersion 极化模式色散信道中OFDM信号的极化干扰抑制

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753294

B. Walkenhorst, T. Pratt

引用次数: 12

A game theoretic approach to gray hole attacks in Wireless Mesh Networks 无线网状网络中灰洞攻击的博弈论方法

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753657

D. Shila, T. Anjali

{"title":"A game theoretic approach to gray hole attacks in Wireless Mesh Networks","authors":"D. Shila, T. Anjali","doi":"10.1109/MILCOM.2008.4753657","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753657","url":null,"abstract":"Wireless Mesh Networks (WMNs) are multi hop networks in which the mesh clients rely on static mesh routers (or directly via other mesh clients) to relay data from one point to another in a multihop fashion. WMN gained significant attention because of the numerous applications it supports, e.g., broadband home networking, community and neighborhood networks, delivering video, building automation, in entertainment and sporting venues etc. But the main challenge of these multihop networks is the susceptibility to various security threats. In this paper, we address the problem of gray hole attack in which a malicious node refuses to forward a subset of the packets it receives. We present the attack in a simple network of mesh routers in the framework of a non-cooperative Markov game between genuine and malicious mesh router. The main objective of the legitimate node (Player I) is to maximize its throughput by minimizing the loss caused by the attackers. On the other hand , the main goal of the attacker (Player II) is to minimize the throughput of the network by dropping the data packets. We investigate the nash equilibrium of the non cooperative game by allowing the nodes to select their own actions that optimizes the individual performance in terms of the packet delivery ratio.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"248 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132934007","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}

引用次数: 21

Application of network coding in tactical data networks 网络编码在战术数据网中的应用

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753103

K.J. Basel, V. Kasemsri, B. Ramakrishnan

引用次数: 2

Joint optimization of transmission schedule and routing for network capacity 网络容量下传输调度和路由的联合优化

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753383

K. Krishnan, D. Shallcross, L. Kant

{"title":"Joint optimization of transmission schedule and routing for network capacity","authors":"K. Krishnan, D. Shallcross, L. Kant","doi":"10.1109/MILCOM.2008.4753383","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753383","url":null,"abstract":"The capacity of a wireless network depends on the interference encountered by flows in the network as they traverse their routes from source to destination. Link-transmissions along a route must be scheduled so as to avoid interference with other links, while the interference-pattern that scheduling has to accommodate itself depends on the routes selected for traffic flow. Therefore, for efficient use of the network, routing and transmission schedule should be considered together. In this paper, we investigate the joint optimization of routing and transmission schedules for capacity maximization. Under the restriction of a single traffic route for each node-pair (as is usual for ease of operation in wireless networks), the formal problem of determining the best route for each node-pair takes the form of an intractable Integer Program for realistic-sized networks, and is not an option to consider. We show that one can, in fact, begin by allowing multi-path routing, since, in this case, the joint choice of routes and transmission schedule is amenable to a Linear Program formulation of a multi-commodity flow problem. Our method then extracts a single-route solution from the multi-path LP solution by solving a much simpler integer program in which we exploit the LPpsilas dasiapath-filteringpsila properties to obtain tight bounds on the number of paths that appear in the integer formulation. We apply this procedure to an example of an ad hoc network and show that the joint optimization of routing and transmission schedule can be carried out in an efficient manner and that it leads to a higher network capacity than realized by choice of transmission schedule alone with pre-specified routing. Our contributions in this paper are two-fold: (a) we propose a method of maximizing mobile ad hoc network (MANET) capacity by the joint optimization of routing and scheduling and (b) the proposed method can also be used to design MANETs for efficiently supporting a given set of missions.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125241447","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}

引用次数: 5

iPDA: An integrity-protecting private data aggregation scheme for wireless sensor networks iPDA:一种保护无线传感器网络完整性的私有数据聚合方案

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753645

Wenbo He, Hoang Nguyen, Xue Liuy, K. Nahrstedt, T. Abdelzaher

{"title":"iPDA: An integrity-protecting private data aggregation scheme for wireless sensor networks","authors":"Wenbo He, Hoang Nguyen, Xue Liuy, K. Nahrstedt, T. Abdelzaher","doi":"10.1109/MILCOM.2008.4753645","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753645","url":null,"abstract":"Data aggregation is an efficient mechanism widely used in wireless sensor networks (WSN) to collect statistics about data of interests. However, the shared-medium nature of communication makes the WSNs are vulnerable to eavesdropping and packet tampering/injection by adversaries. Hence, how to protect data privacy and data integrity are two major challenges for data aggregation in wireless sensor networks. In this paper, we present iPDA- an integrity-protecting private data aggregation scheme. In iPDA, data privacy is achieved through data slicing and assembling technique; and data integrity is achieved through redundancy by constructing disjoint aggregation paths/trees to collect data of interests. In iPDA, the data integrity-protection and data privacy-preservation mechanisms work synergistically. We evaluate the performance of iPDA scheme in terms of communication overhead and data aggregation accuracy, comparing with a typical data aggregation scheme - TAG, where no integrity protection and privacy preservation is provided. Simulation results show that iPDA achieves the design goals while still maintains the efficiency of data aggregation.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130809327","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}

引用次数: 100

Opportunistic differential scheduling in cellular multicast channels 蜂窝多播信道中的机会差分调度

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753623

B. Lorenzo, H. Zhang, S. Glisic

引用次数: 0

Network coding vs. erasure coding: Reliable multicast in ad hoc networks 网络编码与擦除编码:自组织网络中的可靠多播

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753100

Atsushi Fujimura

{"title":"Network coding vs. erasure coding: Reliable multicast in ad hoc networks","authors":"Atsushi Fujimura","doi":"10.1109/MILCOM.2008.4753100","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753100","url":null,"abstract":"Providing reliable and efficient networking services in wireless ad hoc networks is extremely challenging due to high mobility and unstable wireless nature: a significant number of packets can be corrupt or lost. To increase the reliability in packet erasure networks, various coding schemes have been proposed. Network coding (NC) and erasure coding (EC) are such well-known coding techniques recently considered to be used for multicast communications. Both schemes are able to encode original packets into a potentially infinite data stream of encoded packets. Receivers can reconstruct the original packets once they have collected a certain number of encoded packets. The main difference of these schemes is that NC allows intermediate nodes to encode packets they have received so far whereas EC is an end-to-end coding which allows only sources to encode. Both schemes are considered to be able to provide excellent ammunition against erasure networks. However, dasiathe jury is still outpsila regarding which scheme is suitable in ad hoc networks. In this paper, based on simulations and analysis study, we present information on the performance of both schemes which may be useful for selecting the better coding scheme.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132935991","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}

引用次数: 55

Emission and Discard Priority scheme for optimized deflection routing in OBS networks OBS网络中优化偏转路由的发射和丢弃优先级方案

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753309

P. Acquaah, H. Chan, Jia-Ming Liu

{"title":"Emission and Discard Priority scheme for optimized deflection routing in OBS networks","authors":"P. Acquaah, H. Chan, Jia-Ming Liu","doi":"10.1109/MILCOM.2008.4753309","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753309","url":null,"abstract":"Resolving contention in an efficient and cost-effective manner is a key issue in optical burst switched (OBS) networks. Although deflection routing has been identified as a cost-effective solution, its viability has been questioned. We propose an emission and discard priority (EDP) scheme to alleviate the shortcomings of deflection routing. The objective of this EDP scheme is to reduce the number of late packet arrivals due to burst deflections and to increase the efficiency of deflection routing with selective burst deflections. Through simulation, we compare the performance of deflection routing using the EDP scheme with a basic deflection routing scheme and a no-deflection scheme. Simulation results show that the deflection with EDP scheme has a higher throughput than the basic deflection scheme for loads L ges 0.7 and has a lower proportion of late packet arrivals than the deflection scheme at all loads. We also find that the deflection with EDP scheme has higher goodput than the basic deflection scheme for loads L ges 0.7 . Furthermore, the deflection with EDP scheme has greater efficiency than the deflection scheme in terms of goodput per deflection.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133518992","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}

引用次数: 1

Adaptive switching between space-time and space-frequency block coded OFDM systems 时空和空频分组编码OFDM系统之间的自适应切换

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753221

Keonkook Lee, Youngok Kim, Namjeong Lee, Joonhyuk Kang

{"title":"Adaptive switching between space-time and space-frequency block coded OFDM systems","authors":"Keonkook Lee, Youngok Kim, Namjeong Lee, Joonhyuk Kang","doi":"10.1109/MILCOM.2008.4753221","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753221","url":null,"abstract":"In this paper, we propose an adaptive transmission technique for MIMO-OFDM systems which selects one of space-time block coded OFDM (STBC-OFDM) and space-frequency block coded OFDM (SFBC-OFDM). STBC-OFDM and SFBC-OFDM undergo severe performance degradation in time-varying and frequency-selective channel, respectively. In the adaptive scheme, either STBC-OFDM or SFBC-OFDM is selected by using the proposed switching criteria. Two selection criteria, correlation of the channel and magnitude of the interference, are proposed for transmission mode selection. In criterion I, based on the observation of the theoretical performance in (D.B. lin et al., 2005), correlation between successive OFDM symbols for STBC-OFDM and correlation between neighboring subcarriers for SFBC-OFDM are compared and the mode which has higher correlation value is selected to maximize the SNR. Next, in criterion II, we choose the mode which has smaller interference to reduce the performance degradation due to the interference. Simulation results show that the proposed adaptive switching system outperforms the nonadaptive system.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"47 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133351270","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}

引用次数: 7

Detection of misbehavior in cooperative diversity 合作多样性中不当行为的检测

MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753037

S. Dehnie, Nasir Memon

{"title":"Detection of misbehavior in cooperative diversity","authors":"S. Dehnie, Nasir Memon","doi":"10.1109/MILCOM.2008.4753037","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753037","url":null,"abstract":"Cooperative diversity envisages to provide improved quality of service at the physical layer, with the assumption that wireless nodes are always willing to cooperate. This assumption may be valid in networks where cooperation is confined to nodes whose intentions are known a priori. However, in commercial wireless networks where nodes may misbehave for malicious or selfish intentions, it is difficult to maintain stable cooperation without a mechanism to detect and mitigate effects of misbehavior. In this paper we present a distributed mechanism to detect misbehaving nodes in a cooperative network which is characterized by a minimum frame success rate requirement and hybrid automatic repeat request (HARQ) is implemented to ensure reliable communication. The detection mechanism is developed by observing a number of first transmission attempts to learn how many frames can be transmitted successfully with zero retransmissions (first HARQ phase). Probability of successful transmission for the first transmission attempts is then estimated and its percentage deviation from the minimum frame success rate is measured to detect absence or presence of misbehavior. We show that the proposed mechanism can effectively detect selfish and malicious nodes. The detection mechanism can also be integrated into a reputation based scheme where a source node inform other nodes about the behavior of its partner.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132004367","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}

引用次数: 16