@conference { ISI:000387181100066,
	title = {New Greedy Forwarding Strategy for UWSNs Geographic Routing Protocols},
	booktitle = {2016 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2016},
	note = {12th International Wireless Communications \& Mobile Computing Conference (IWCMC), Paphos, CYPRUS, SEP 05-09, 2016},
	pages = {388-393},
	publisher = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	organization = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	abstract = {Recently Underwater wireless Sensor Networks (UWSNs) have been suggested as a powerful technology for many civilian and military applications, such that tactical surveillance. Geographic routing that uses the position information of nodes to route the packet toward a destination is preferable for UWSNs. In this paper, we propose a New Greedy Forwarding (NGF) strategy using splitting mechanism based on Chinese remainder theorem(CRT) for UWSNs. In the approach, source node reduced the number of bits transmitted using the proposed splitting mechanism based on CRT if there are more than two nodes participate in the forwarding of one packet. This strategy distribute the forwarding task between more nodes instead of selecting one node as next-hop, that reduce the energy consumption per node and maintain node communication for a long time. Thus resulting the increase of network life time and decrease the number of isolated/void nodes. We use topology control through depth adjustment to cope with the problem of isolated and void nodes appeared in geographic routing protocols. Simulation results shows that with the anycast greedy forwarding strategy the network life time is about 500 rounds whereas it is about 1000 rounds using the new greedy forwarding strategy, which means the new strategy increase the network life time and increase the network performance in energy saving.},
	isbn = {978-1-5090-0304-4},
	issn = {2376-6492},
	author = {Jouhari, Mohammed and Ibrahimi, Khalil and Benattou, Mohammed and Kobbane, Abdellatif}
}
@conference { ISI:000381477900056,
	title = {A Distributed Open-Close Access for Small-Cell Networks: A Random Matrix Game Analysis},
	booktitle = {2015 INTERNATIONAL WIRELESS COMMUNICATIONS \& MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {11th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC), Dubrovnik, CROATIA, AUG 24-25, 2015},
	pages = {320-325},
	publisher = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	organization = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	abstract = {Nowadays, Small-Cells are widely being deployed to assist and improve performance of mobile networks. Indeed, they are a promising solution to improve coverage and to offload data traffic in mobile networks. In this paper, we propose a signaling-less architecture of the heterogeneous network composed of one single Macro Base Station and a Single Small-Cell. First, we construct a game theoretic framework for channel-state independent interaction. We present many conditions for the existence of Pure Nash equilibrium. Next, and in order to capture the continuous change of the channel state, we build a random matrix game where the channel state is considered to be random (potentially ruled by some given distribution). A characterization of Nash equilibrium is provided in terms of pure strategies and mixed strategies. Convergence to Nash equilibrium is furthermore guaranteed using a variant of the well-known Combined fully distributed payoff and strategy learning. Our algorithm converges faster (only 10-20 iterations are required to converge to Nash equilibrium) and only need a limited amount of local information. This is quite promising since it says that our scheme is almost applicable for all environments (fast fading included).},
	isbn = {978-1-4799-5344-8},
	issn = {2376-6492},
	author = {Ben Chekroun, Samia and Sabir, Essaid and Kobbane, Abdellatif and Tembine, Hamidou and Bouyakhf, El-Houssine and Ibrahimi, Khalil}
}
@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}
}
