localized multisensor multitarget tracking framework.docx

1、localized multisensor multitarget tracking frameworkA cross-layer resource allocation scheme for ICIC in LTE-AdvancedOriginal Research ArticleJournal of Network and Computer Applications, In Press, Corrected Proof, Available online 18 January 2011Zhaoming Lu, Yan Yang, Xiangming Wen, Ying Ju, Wei Zh

2、engClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractAs a new technology, inter-eNB coordination has been included in LTE-Advanced study items. Moreover, the network architecture in LTE-Advanced system is mo

3、dified to take into account coordinated transmission. In our study, we explore the problem of jointly optimizing the power level and scheduling of resource blocks for LTE-Advanced network based on orthogonal frequency division multiplexing (OFDM). We propose a distributed optimization scheme based o

4、n evolutionary potential games, and in the process of objective function modeling we employ the Lagrangian multiplier method to solve the constraint objective optimization problem. Then particle swarm optimization (PSO) method is adopted to find the optimal power allocation and scheduling for each r

5、esource block in the multi-cell framework. Numerical results prove that proposed algorithm notably improves the overall throughput, while user fairness is guaranteed. Importantly, additional computation and communication cost introduced by cross-layer optimization is also evaluated.Article Outline1.

6、 Introduction2. Inter-cell interference analysis3. Potential games 3.1. Definition3.2. Existence and uniqueness of NE4. A Lagrangian multiplier method for constraint objective function optimization 4.1. System throughput4.2. Fairness criterion4.3. A Lagrangian multiplier method5. Cross-layer optimiz

7、ation algorithm based on potential games 5.1. Cooperation games modeling5.2. PSO based method to solve extreme problem of multivariate function5.3. Convergence to Nash equilibrium6. Simulation analysis 6.1. Performance analysis6.2. Cost analysis7. Conclusions and future workAcknowledgementsReference

8、sPurchase$ 39.95127Prediction-based data aggregation in wireless sensor networks: Combining grey model and Kalman FilterOriginal Research ArticleComputer Communications, Volume 34, Issue 6, 3 May 2011, Pages 793-802Guiyi Wei, Yun Ling, Binfeng Guo, Bin Xiao, Athanasios V. VasilakosClose preview| Rel

9、ated articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractIn many environmental monitoring applications, since the data periodically sensed by wireless sensor networks usually are of high temporal redundancy, prediction-based data ag

10、gregation is an important approach for reducing redundant data communications and saving sensor nodes energy. In this paper, a novel prediction-based data collection protocol is proposed, in which a double-queue mechanism is designed to synchronize the prediction data series of the sensor node and t

11、he sink node, and therefore, the cumulative error of continuous predictions is reduced. Based on this protocol, three prediction-based data aggregation approaches are proposed: Grey-Model-based Data Aggregation (GMDA), Kalman-Filter-based Data Aggregation (KFDA) and Combined Grey model and Kalman Fi

12、lter Data Aggregation (CoGKDA). By integrating the merit of grey model in quick modeling with the advantage of Kalman Filter in processing data series noise, CoGKDA presents high prediction accuracy, low communication overhead, and relative low computational complexity. Experiments are carried out b

13、ased on a real data set of a temperature and humidity monitoring application in a granary. The results show that the proposed approaches significantly reduce communication redundancy and evidently improve the lifetime of wireless sensor networks.Article Outline1. Introduction2. Related work3. Predic

14、tion-based data collection protocol4. Grey model based data aggregation (GMDA)5. Kalman-Filter-based Data Aggregation (KFDA) 5.1. Kalman-Filter-based prediction model5.2. Kalman-Filter-based prediction algorithm6. CoGKDA 6.1. Modeling6.2. Combination weights6.3. CoGKDA algorithm7. Experiment and per

15、formance evaluation 7.1. Experiment setup7.2. GMDA7.3. KFDA7.4. CoGKDA7.5. Complexity and scalability8. ConclusionAcknowledgementsReferencesPurchase$ 41.95128Energy efficient and perceived QoS aware video routing over Wireless Multimedia Sensor NetworksOriginal Research ArticleAd Hoc Networks, Volum

16、e 9, Issue 4, June 2011, Pages 591-607Dionisis Kandris, Michail Tsagkaropoulos, Ilias Politis, Anthony Tzes, Stavros KotsopoulosClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractWireless Sensor Networks (WSN

17、s) have an ever increasing variety of multimedia based applications. n these types of applications, network nodes should ideally maximize QoS and minimize energy expenditures in video communication. This article presents PEMuR, a novel dual scheme for efficient video communication, which aims at bot

18、h energy saving and high QoS attainment. To achieve its objectives, PEMuR proposes the combined use of an energy aware hierarchical routing protocol with an intelligent video packet scheduling algorithm. The adopted routing protocol enables the selection of the most energy efficient routing paths, m

19、anages the network load according to the energy residues of the nodes and prevents useless data transmissions through the proposed use of an energy threshold. In this way, an outstanding level of energy efficiency is achieved. Additionally, the proposed packet scheduling algorithm enables the reduct

20、ion of the video transmission rate with the minimum possible increase of distortion. In order to do so, it makes use of an analytical distortion prediction model that can accurately predict the resulted video distortion due to any error pattern. Thus, the algorithm may cope with limited available ch

21、annel bandwidth by selectively dropping less significant packets prior to their transmission. Simulation results demonstrate the effectiveness of the proposed scheme.Article Outline1. Introduction2. Related work 2.1. Hierarchical routing protocols2.2. Route selection schemes2.3. Wireless video commu

22、nication2.4. Packet loss models3. Proposed scheme overview 3.1. Energy efficient hierarchical routing protocol3.2. Video packet scheduling 3.2.1. Video distortion model3.2.2. Video transmission rate adaptation3.3. PEMuR algorithm overview4. Simulation setup description5. Simulation results presentat

23、ion6. Simulation results evaluation7. ConclusionsReferencesVitaePurchase$ 27.95129Adaptive power-controlled MAC protocols for improved throughput in hardware-constrained cognitive radio networksOriginal Research ArticleAd Hoc Networks, In Press, Corrected Proof, Available online 7 January 2011Haythe

24、m Bany Salameh, Marwan KrunzClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractCognitive radios (CRs) are emerging as a promising technology to enhance spectrum utilization through opportunistic on-demand acc

25、ess. Many MAC protocols for cognitive radio networks (CRNs) have been designed assuming multiple transceivers per CR user. However, in practice, such an assumption comes at the cost of extra hardware. In this paper, we address the problem of assigning channels to CR transmissions in single-hop and m

26、ulti-hop CRNs, assuming one transceiver per CR. The primary goal of our design is to maximize the number of feasible concurrent CR transmissions, and conserve energy as a secondary objective, with respect to both spectrum assignment and transmission power subject to interference constraint and user

27、rate demands. The problem is formulated under both binary-level and multi-level spectrum opportunity frameworks. Our formulation applies to any power-rate relationship. For single-hop CRNs, a centralized polynomial-time algorithm based on bipartite matching that computes the optimal channel assignme

28、nt is developed. We then integrate this algorithm into distributed MAC protocols that preserve fairness. For multi-hop ad hoc CRNs, we propose a novel distributed MAC protocol (WFC-MAC) that attempts to maximize the CRN throughput, assuming single transceiver radios but with “dual-receive” capabilit

29、y. WFC-MAC uses a cooperative assignment that relies only on information provided by the two communicating users. The main novelty in WFC-MAC lies in requiring no active coordination with licensed users and exploiting the dual-receive capability of radios, thus alleviating various channel access pro

30、blems that are common to multi-channel designs. We conduct theoretical analysis of our MAC protocols, and study their performance via simulations. The results indicate that compared with CSMA/CA variants, our protocols significantly decrease the blocking rate of CR transmissions, and hence improve n

31、etwork throughput.Article Outline1. Introduction 1.1. Previous research1.2. Contributions1.3. Organization2. Problem formulation and design constraints 2.1. Network model2.2. Feasibility constraints2.3. Problem formulation3. Optimal channel assignment 3.1. Proposed algorithm3.2. Channel access proto

32、col for single-hop CRNs 3.2.1. Assumptions3.2.2. Operational details3.3. Remarks and design variants 3.3.1. Granularity of channel assignment3.3.2. Fairness properties of AW-MAC3.3.3. RTS/CTS handshake in AW-MAC3.3.4. Channel assignment with a multi-level frequency-dependent power constraint3.3.5. AW-MAC with two transceiver