[Faculty] Fwd: [CSRC-SDSU COLLOQUIUM]: Distributed Gender Assignment Schemes for FDD Nodes in a Multihop Wireless Network

Jose Castillo jcastillo at mail.sdsu.edu
Mon Jun 12 13:51:42 PDT 2017


*DATE: * Friday, June 16th, 2017

*TITLE: *Distributed Gender Assignment Schemes for FDD Nodes in a Multihop
Wireless Network

*TIME: * 3:30 PM

*LOCATION: * GMCS 314

*SPEAKER: *Moein Parsinia, Computational Science Research Center

*ABSTRACT:* In this research we consider a decentralized, multihop wireless
network consisting of the frequency division duplex (FDD) nodes. The use of
FDD nodes in a multihop wireless
network partitions the nodes in two classes (or genders) depending on the
frequency bands used for the transmission and reception. The nodes of the
same class (or gender) cannot communicate with each other. This can lead to
the disconnected nodes and network partitioning, which would seriously
limit the communication between neighboring nodes. Therefore, the gender
(or frequency band) of these nodes should be selected such that each node
is able to communicate with its 1-hop neighbors.
We model the multihop network as a graph and design a novel, distributed
and balanced bipartite graph coloring scheme, with the aim of assigning at
least half of the 1-hop neighbors of every node in the opposite gender. In
other words, our goal is to strike a balance between two colors in the
1-hop neighborhood of every vertex in the graph. We show that such gender
assignment exists for any simple undirected graph. We then provide a gender
assignment algorithm which is based on extracting a bipartite subgraph from
a given graph, preserving all its vertices. Unlike the existing graph
coloring algorithms which require the information about the entire graph
structure, our algorithm uses only the local information of 1-hop
neighborhood of each node in a distributed manner. Our results demonstrate
that both proposed schemes successfully assign the gender to all the nodes
in the network, such that each node can establish the communication links
with approximately half of its 1-hop neighbors. This arrangement can help
in establishing the efficient and stable routes in the network.

Sponsored by the SDSU-SIAM  Student Chapter
-- 





_______________________________________________
SDSU Computational Science Research Center
Mailing List



-- 

Jose E. Castillo  Ph.D.

Director / Professor

Computational Science Research Center

5500 Campanile Dr

San Diego State University

San Diego CA 92182-1245

619 5947205/3430, Fax 619-594-2459

 http://www.csrc.sdsu.edu/mimetic-book/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://engineering.sdsu.edu/pipermail/faculty/attachments/20170612/80b7e75a/attachment.html>


More information about the Faculty mailing list