@article {10906318420150210,
	title = {An Energy-Efficient Clustering Routing Algorithm Based on Geographic Position and Residual Energy for Wireless Sensor Network.},
	journal = {Journal of Computer Networks \& Communications},
	volume = {2015},
	year = {2015},
	pages = {1 - 11},
	abstract = {Recently wireless sensor network (WSN) has become one of the most interesting networking technologies, since it can be deployed without communication infrastructures. A sensor network is composed of a large number of sensor nodes; these nodes are responsible for supervision of the physical phenomenon and transmission of the periodical results to the base station. Therefore, improving the energy efficiency and maximizing the networking lifetime are the major challenges in this kind of networks. To deal with this, a hierarchical clustering scheme, called Location-Energy Spectral Cluster Algorithm (LESCA), is proposed in this paper. LESCA determines automatically the number of clusters in a network. It is based on spectral classification and considers both the residual energy and some properties of nodes. In fact, our approach uses the K-ways algorithm and proposes new features of the network nodes such as average energy, distance to BS, and distance to clusters centers in order to deter},
	keywords = {Data transmission systems, Energy consumption, Routing algorithms, Wireless sensor networks, Wireless sensor nodes},
	issn = {20907141},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=109063184\&site=ehost-live},
	author = {Jorio, Ali and El Fkihi, Sanaa and Elbhiri, Brahim and Aboutajdine, Driss}
}
@article {8699110620120101,
	title = {Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms.},
	journal = {Journal of Electrical \& Computer Engineering},
	year = {2012},
	pages = {1 - 12},
	abstract = {A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms [ABSTRACT FROM AUTHOR]},
	keywords = {Coding theory, Computational complexity, Data transmission systems, Decoders (Electronics) {\textendash} Software, Genetic algorithms, Performance evaluation},
	issn = {20900147},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=86991106\&site=ehost-live},
	author = {Azouaoui, Ahmed and Belkasmi, Mostafa and Farchane, Abderrazak}
}
@article {5099547320100301,
	title = {The Uplink Capacity Evaluation of Wireless Networks: Spectral Analysis Approach.},
	journal = {Journal of Computing \& Information Technology},
	volume = {18},
	number = {1},
	year = {2010},
	pages = {1 - 17},
	abstract = {In this paper we study the capacity of wireless cellular network, in particular the uplink of WCDMA system by using the two dimensional continuous-time Markov chain (CTMC) technique. Considering two types of calls: real-time (RT) calls characterized by a quasi fixed transmission rate, and best-effort (BE) calls which do not require strict demand but need some reliability conditions, we develop an approach based on the spectral analysis for evaluating the cell capacity. We explicitly obtain the simultaneous distribution of the number of RT connections and the number of BE connections in the steady-state. This analysis allows us to simplify the computation of the performance measures including expected delay and throughput of BE traffic. These performances are obtained explicitly in both cases (finite and infinite) of BE calls as function of system parameters like arrival rate of BE and RT calls, service rate of BE and RT calls. These results allow the operator to evaluate the cell capa},
	keywords = {call admission control, Data transmission systems, Markov processes, Matrix-Geometric method, Mobile communication systems, spectral analysis approach, Spectrum analysis, Telecommunication systems, Wireless communication systems, wireless networks},
	issn = {13301136},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=50995473\&site=ehost-live},
	author = {Kobbane, Abdellatif and El-Azouzi, Rachid and Ibrahimi, Khalil and Samanta, Sujit Kumar and Bouyakhf, El-Houssine}
}
