Mohammad S. Talebi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mohammad S. Talebi has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Babak Hossein Khalaj
Department of Electrical Engineering Department of Electrical Engineering Department of Electrical Engineering Department of Electrical Engineering Sharif University of Technology Sharif University of Technology Sharif University of Technology Sharif University of Technology Sharif University of Technology Sharif University of Technology
3 shared publications - Hamid Reza Rabiee
Affiliation Department of Computer Engineering, Sharif University of Technology, Tehran, Iran
2 shared publications - Mahdi Kefayati
Sharif University of Technology; Iran Telecommunication Research Center (ITRC)
2 shared publications
Latest Publications
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21615322,p. 108-115
On Secure Consensus Information Fusion over Sensor Networks
In this work we have examined the problem of consensus information fusion from a novel point of view, challenging the fundamental assumption of mutual trust among the fusion parties. In quest for a method to make information fusion possible while preserving the mutual confidentiality and anonymity of the fused information even in case of collusion of the malicious nodes, we propose the Blind Information Fusion Framework (BIFF). In BIFF, which is a secure information fusion framework, the nodes are not aware of the actual information they are processing, yet converging to the intended result(s). We formulate BIFF according to the anonymization transform and discuss its robustness against collusions for privacy violation. As an example, two secure consensus averaging methods are formulated according to BIFF.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21615322,p. 108-115
On Secure Consensus Information Fusion over Sensor Networks
In this work we have examined the problem of consensus information fusion from a novel point of view, challenging the fundamental assumption of mutual trust among the fusion parties. In quest for a method to make information fusion possible while preserving the mutual confidentiality and anonymity of the fused information even in case of collusion of the malicious nodes, we propose the Blind Information Fusion Framework (BIFF). In BIFF, which is a secure information fusion framework, the nodes are not aware of the actual information they are processing, yet converging to the intended result(s). We formulate BIFF according to the anonymization transform and discuss its robustness against collusions for privacy violation. As an example, two secure consensus averaging methods are formulated according to BIFF.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21556806,p. 562-565
Adaptive Consensus Averaging for Information Fusion over Sensor Networks
This paper introduces adaptive consensus, a spatio-temporal adaptive method to improve convergence behavior of the current consensus fusion schemes. This is achieved by introducing a time adaptive weighting method for updating each sensor data in each iteration. Adaptive consensus method will improve node convergence rate, average convergence rate and the variance of error over the network. A mathematical formulation of the method according to the adaptive filter theory as well as derivation of the time adaptive weights and convergence conditions are presented. The analytical results are verified by simulation as well
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21556806,p. 562-565
Adaptive Consensus Averaging for Information Fusion over Sensor Networks
This paper introduces adaptive consensus, a spatio-temporal adaptive method to improve convergence behavior of the current consensus fusion schemes. This is achieved by introducing a time adaptive weighting method for updating each sensor data in each iteration. Adaptive consensus method will improve node convergence rate, average convergence rate and the variance of error over the network. A mathematical formulation of the method according to the adaptive filter theory as well as derivation of the time adaptive weights and convergence conditions are presented. The analytical results are verified by simulation as well
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Distributed Power Allocation For OFDM Wireless Ad-Hoc Networks Based On Average Consensus
This paper addresses the problem of optimal power allocation in multiuser OFDM ad-hoc networks. Our objective is to maximize the weighted rate-sum of users under total transmit power constraint. Maximizing a weighted rate-sum is more amenable whereas appropriate weight assignment to different users, guarantees fairness among users. We propose a distributed algorithm for optimal power allocation based on reaching a consensus among users for power allocation. The proposed algorithm is tractable in the sense of computational complexity and requires only local information at each node. Simulation results and the analysis of the algorithm are presented to support the proposed idea
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Distributed Power Allocation For OFDM Wireless Ad-Hoc Networks Based On Average Consensus
This paper addresses the problem of optimal power allocation in multiuser OFDM ad-hoc networks. Our objective is to maximize the weighted rate-sum of users under total transmit power constraint. Maximizing a weighted rate-sum is more amenable whereas appropriate weight assignment to different users, guarantees fairness among users. We propose a distributed algorithm for optimal power allocation based on reaching a consensus among users for power allocation. The proposed algorithm is tractable in the sense of computational complexity and requires only local information at each node. Simulation results and the analysis of the algorithm are presented to support the proposed idea